KANTE - Mamadou
Toutes les publications (43)
| Date/Type | Titre/URL/journal | Domaines | Notes SJR/Core | Cit. GScholar |
|---|---|---|---|---|
| 2026
COMM |
Samuel Humeau, Mamadou Moustapha Kanté, Daniel Mock, Timothé Picavet, Alexandre Vigny, Moustapha Kanté
Testing H-Freeness on Sparse Graphs, the Case of Bounded Expansion 43rd International Symposium on Theoretical Aspects of Computer Science (STACS 2026) - 2026 |
Informatique/Logique en informatique | ||
| 2026
COMM |
Fatemeh Ghasemi, Julien Grange, Mamadou Moustapha Kanté, Florent Madelaine
Weakly-sparse and strongly flip-flat classes of graphs are uniformly almost-wide CSL 2026 - 2026 |
Informatique/Logique en informatique | ||
| 2026
UNDEFINED |
Colin Geniet, Fatemeh Ghasemi, Mamadou Moustapha Kanté
Transducing Linear Decompositions of Tournaments |
Maths | ||
| 2025
ART |
Alessio Conte, Roberto Grossi, Mamadou Moustapha Kanté, Andrea Marino, Takeaki Uno
Listing Maximal H-Free Subgraphs Discrete Applied Mathematics - 2025 |
Informatique/Complexité | ||
| 2025
COMM |
Rutger Campbell, Bruno Guillon, Mamadou Moustapha Kanté, Eun Jung Kim, Sang-Il Oum
Recognisability Equals Definability for Finitely Representable Matroids of Bounded Path-Width 2025 40th Annual ACM/IEEE Symposium on Logic in Computer Science (LICS) - 2025 |
Informatique/Logique en informatique | ||
| 2025
ART |
Benjamin Bergougnoux, Vera Chekan, Robert Ganian, Mamadou Moustapha Kanté, Matthias Mnich, Sang-Il Oum, Michal Pilipczuk, Erik Leeuwen
Space-Efficient Parameterized Algorithms on Graphs of Low Shrubdepth ACM Transactions on Computation Theory - 2025 |
Informatique/Algorithme et structure de données | ||
| 2024
COMM |
Rutger Campbell, Bruno Guillon, Mamadou Moustapha Kanté, Eun Jung Kim, Noleen Köhler
CMSO-transducing tree-like graph decompositions STACS 2025 - 2024 |
Informatique/Logique en informatique | ||
| 2024
PROCEEDINGS |
Olaf Beyersdorff, Mamadou Moustapha Kanté, Orna Kupferman, Daniel Lokshtanov
LIPIcs, Volume 289, STACS 2024, Complete Volume |
|||
| 2024
ART |
Bogdan Alecu, Mamadou Moustapha Kanté, Vadim Lozin, Viktor Zamaraev
Lettericity of graphs: an FPT algorithm and a bound on the size of obstructions Algorithmica - 2024 |
Informatique/Complexité | ||
| 2024
ART |
Alexey Barsukov, Mamadou Moustapha Kanté
Generalisations of matrix partitions: Complexity and obstructions Theoretical Computer Science - 2024 |
Informatique/Algorithme et structure de données | ||
| 2023
ART |
Mamadou Moustapha Kanté, Eun Jung Kim, O-Joung Kwon, Sang-Il Oum
Obstructions for matroids of path-width at most k and graphs of linear rank-width at most k Journal of Combinatorial Theory, Series B - 2023 |
Informatique/Mathématique discrète | ||
| 2023
PROCEEDINGS |
Petra Berenbrink, Patricia Bouyer, Anuj Dawar, Mamadou Moustapha Kanté
LIPIcs, Volume 254, STACS 2023, Complete Volume |
|||
| 2023
COMM |
Benjamin Bergougnoux, Vera Chekan, Robert Ganian, Mamadou Moustapha Kanté, Matthias Mnich, Sang-Il Oum, Michal Pilipczuk, Erik Leeuwen
Space-Efficient Parameterized Algorithms on Graphs of Low Shrubdepth 31st Annual European Symposium on Algorithms - 2023 |
Informatique/Algorithme et structure de données | ||
| 2023
ART |
Konrad Dabrowski, François Dross, Jisu Jeong, Mamadou Moustapha Kanté, O-Joung Kwon, Sang-Il Oum, Daniël Paulusma
Computing pivot-minors Computing Research Repository - 2023 |
Informatique/Algorithme et structure de données | ||
| 2022
ART |
Bogdan Alecu, Robert Ferguson, Mamadou Moustapha Kanté, Vadim Lozin, Vincent Vatter, Victor Zamaraev
Letter Graphs and Geometric Grid Classes of Permutations SIAM Journal on Discrete Mathematics - 2022 |
Informatique/Mathématique discrète | ||
| 2022
ART |
Mamadou Moustapha Kanté, Christophe Paul, Dimitrios M. Thilikos
A Linear Fixed Parameter Tractable Algorithm for Connected Pathwidth SIAM Journal on Discrete Mathematics - 2022 |
Informatique/Algorithme et structure de données | ||
| 2022
COMM |
Eun Jung Kim, O-Joung Kwon, Sang-Il Oum, Mamadou Moustapha Kanté
Obstructions for Matroids of Path-Width at most k and Graphs of Linear Rank-Width at most k STACS 2022 - 2022 |
Informatique/Mathématique discrète | ||
| 2021
ART |
Alessio Conte, Mamadou Moustapha Kanté, Takeaki Uno, Kunihiro Wasa
Maximal strongly connected cliques in directed graphs: Algorithms and bounds Discrete Applied Mathematics - 2021 |
Informatique/Algorithme et structure de données | ||
| 2021
ART |
Alessio Conte, Mamadou Moustapha Kanté, Takeaki Uno, Kunihiro Wasa
Maximal strongly connected cliques in directed graphs: Algorithms and bounds Discrete Applied Mathematics - 2021 |
Informatique/Complexité | ||
| 2021
ART |
Konrad Dabrowski, François Dross, Jisu Jeong, Mamadou Moustapha Kanté, O-Joung Kwon, Sang-Il Oum, Daniël Paulusma
Tree pivot-minors and linear rank-width SIAM Journal on Discrete Mathematics - 2021 |
Informatique/Algorithme et structure de données | ||
| 2021
ART |
Benjamin Bergougnoux, Mamadou Moustapha Kanté
More applications of the d-neighbor equivalence: acyclicity and connectivity constraints SIAM Journal on Discrete Mathematics - 2021 |
Informatique/Algorithme et structure de données | ||
| 2021
ART |
Konrad Dabrowski, François Dross, Jisu Jeong, Mamadou Moustapha Kanté, O-Joung Kwon, Sang-Il Oum, Daniël Paulusma
Tree Pivot-Minors and Linear Rank-Width SIAM Journal on Discrete Mathematics - 2021 |
Informatique/Mathématique discrète | ||
| 2020
COMM |
Mamadou Moustapha Kanté, Christophe Paul, Dimitrios M. Thilikos
A linear fixed parameter tractable algorithm for connected pathwidth ESA 2020 - 28th Annual European Symposium on Algorithms - 2020 |
Informatique/Algorithme et structure de données | ||
| 2020
ART |
Bogdan Alecu, Mamadou Moustapha Kanté, Vadim Lozin, Viktor Zamaraev
Between clique-width and linear clique-width of bipartite graphs Discrete Mathematics - 2020 |
Informatique/Mathématique discrète | ||
| 2020
ART |
Alessio Conte, Mamadou Moustapha Kanté, Yota Otachi, Takeaki Uno, Kunihiro Wasa
Efficient enumeration of maximal k-degenerate induced subgraphs of a chordal graph Theoretical Computer Science - 2020 |
Informatique/Complexité | ||
| 2020
ART |
Benjamin Bergougnoux, Mamadou Moustapha Kanté, O-Joung Kwon
An Optimal XP Algorithm for Hamiltonian Cycle on Graphs of Bounded Clique-Width Algorithmica - 2020 |
Informatique/Complexité | ||
| 2019
UNDEFINED |
Benjamin Bergougnoux, Mamadou Moustapha Kanté
More applications of the $d$-neihgbor equivalence: acyclicity and connectivity constraints |
Informatique/Complexité | ||
| 2019
COMM |
Alessio Conte, Roberto Grossi, Mamadou Moustapha Kanté, Andrea Marino, Takeaki Uno, Kunihiro Wasa
Listing Induced Steiner Subgraphs as a Compact Way to Discover Steiner Trees in Graphs MFCS 2019 - 44th International Symposium on Mathematical Foundations of Computer Science - 2019 |
|||
| 2019
ART |
Benjamin Bergougnoux, Florent Capelli, Mamadou Moustapha Kanté
Counting Minimal Transversals of β-Acyclic Hypergraphs Journal of Computer and System Sciences - 2019 |
Informatique/Algorithme et structure de données | ||
| 2019
ART |
Mamadou Moustapha Kanté, Thiago Marcilon, Rudini Sampaio
On the parameterized complexity of the geodesic hull number Theoretical Computer Science - 2019 |
Informatique/Algorithme et structure de données | ||
| 2019
COMM |
Alessio Conte, Mamadou Moustapha Kanté, Andrea Marino, Takeaki Uno
Maximal Irredundant Set Enumeration in Bounded-Degeneracy and Bounded-Degree Hypergraphs Combinatorial Algorithms - 30th International Workshop - 2019 |
Informatique/Algorithme et structure de données | ||
| 2019
COMM |
Benjamin Bergougnoux, Mamadou Moustapha Kanté
More Applications of the d-Neighbor Equivalence: Connectivity and Acyclicity Constraints 27th Annual European Symposium on Algorithms - 2019 |
Informatique/Algorithme et structure de données | ||
| 2019
ART |
Benjamin Bergougnoux, Mamadou Moustapha Kanté
Fast exact algorithms for some connectivity problems parameterized by clique-width Theoretical Computer Science - 2019 |
Informatique/Algorithme et structure de données | ||
| 2018
UNDEFINED |
Benjamin Bergougnoux, Mamadou Moustapha Kanté, O-Joung Kwon
An Optimal XP Algorithm for Hamiltonian Cycle on Graphs of Bounded Clique-Width. |
Informatique/Algorithme et structure de données | ||
| 2018
UNDEFINED |
Benjamin Bergougnoux, Florent Capelli, Mamadou Moustapha Kanté
Counting Minimal Transversals of ß-Acyclic Hypergraphs |
Informatique/Algorithme et structure de données | ||
| 2018
COMM |
Konrad K. Dabrowski, François Dross, Jisu Jeong, Mamadou Moustapha Kanté, O-Joung Kwon, Sang-Il Oum, Daniël Paulusma
Computing Small Pivot-Minors WG 2018 - 44th International Workshop on Graph-Theoretic Concepts in Computer Science - 2018 |
Informatique/Complexité | ||
| 2018
ART |
Petr A. Golovach, Pinar Heggernes, Mamadou Moustapha Kanté, Dieter Kratsch, Sigve Sæther, Yngve Villanger
Output-Polynomial Enumeration on Graphs of Bounded (Local) Linear MIM-Width Algorithmica - 2018 |
Informatique/Complexité | ||
| 2018
COMM |
Mamadou Moustapha Kanté, Kaveh Khoshkhah, Mozhgan Pourmoradnasseri
Enumerating Minimal Transversals of Hypergraphs without Small Holes 43rd International Symposium on Mathematical Foundations of Computer Science - 2018 |
Informatique/Complexité | ||
| 2018
ART |
Mamadou Moustapha Kanté, O-Joung Kwon
Linear rank-width of distance-hereditary graphs II. Vertex-minor obstructions Eur. J. Comb. - 2018 |
Informatique/Complexité | ||
| 2018
ART |
Benjamin Bergougnoux, Florent Capelli, Mamadou Moustapha Kanté
Counting Minimal Transversals of \\(β\\)-Acyclic Hypergraphs Computing Research Repository - 2018 |
Informatique/Algorithme et structure de données | ||
| 2017
ART |
Mamadou Moustapha Kanté, Eun Jung Kim, O-Joung Kwon, Christophe Paul
An FPT Algorithm and a Polynomial Kernel for Linear Rankwidth-1 Vertex Deletion Algorithmica - 2017 |
Informatique/Mathématique discrète | ||
| 2017
COMM |
Benjamin Bergougnoux, O-Joung Kwon, Mamadou Moustapha Kanté
An Optimal XP Algorithm for Hamiltonian Cycle on Graphs of Bounded Clique-Width WADS 2017 - 2017 |
Informatique/Complexité | ||
| 2017
ART |
Petr A. Golovach, Pinar Heggernes, Mamadou Moustapha Kanté, Dieter Kratsch, Yngve Villanger
Minimal dominating sets in interval graphs and trees Discrete Applied Mathematics - 2017 |
Informatique/Algorithme et structure de données |