Mamadou Moustapha Kanté

95 papers A* 1A 8B 20C 3Misc 2Journal 57Unranked 2

Year	Rank	Type	Title / Venue / Authors
2026	J	`jnl`	Lettericity of graphs: an FPT algorithm and a bound on the size of obstructions. Algorithmica Bogdan Alecu, Mamadou Moustapha Kanté, Vadim V. Lozin, Viktor Zamaraev
2026	A	`conf`	Testing H-Freeness on Sparse Graphs, the Case of Bounded Expansion. STACS Samuel Humeau, Mamadou Moustapha Kanté, Daniel Mock, Timothé Picavet, Alexandre Vigny
2026	J	`jnl`	Transducing Linear Decompositions of Tournaments. CoRR Colin Geniet, Fatemeh Ghasemi, Mamadou Moustapha Kanté
2026	B	`conf`	Weakly-Sparse and Strongly Flip-Flat Classes of Graphs Are Uniformly Almost-Wide. CSL Fatemeh Ghasemi, Julien Grange, Mamadou Moustapha Kanté, Florent R. Madelaine
2025	A	`conf`	CMSO-Transducing Tree-Like Graph Decompositions. STACS Rutger Campbell, Bruno Guillon, Mamadou Moustapha Kanté, Eun Jung Kim, Noleen Köhler
2025	J	`jnl`	Listing maximal H-free subgraphs. Discret. Appl. Math. Alessio Conte, Roberto Grossi, Mamadou Moustapha Kanté, Andrea Marino, Takeaki Uno
2025	A*	`conf`	Recognisability Equals Definability for Finitely Representable Matroids of Bounded Path-Width. LICS Rutger Campbell, Bruno Guillon, Mamadou Moustapha Kanté, Eun Jung Kim, Sang-il Oum
2025	J	`jnl`	Space-Efficient Parameterized Algorithms on Graphs of Low Shrubdepth. ACM Trans. Comput. Theory Benjamin Bergougnoux, Vera Chekan, Robert Ganian, Mamadou Moustapha Kanté, Matthias Mnich, Sang-il Oum, Michal Pilipczuk, Erik Jan van Leeuwen
2025	J	`jnl`	Testing H-freeness on sparse graphs, the case of bounded expansion. CoRR Samuel Humeau, Mamadou Moustapha Kanté, Daniel Mock, Timothé Picavet, Alexandre Vigny
2025	J	`jnl`	Weakly-sparse and strongly flip-flat classes of graphs are uniformly almost-wide. CoRR Fatemeh Ghasemi, Julien Grange, Mamadou Moustapha Kanté, Florent R. Madelaine
2024	A	`ed.`	41st International Symposium on Theoretical Aspects of Computer Science, STACS 2024, Clermont-Ferrand, France, March 12-14, 2024 STACS Olaf Beyersdorff, Mamadou Moustapha Kanté, Orna Kupferman, Daniel Lokshtanov
2024	J	`jnl`	CMSO-transducing tree-like graph decompositions. CoRR Rutger Campbell, Bruno Guillon, Mamadou Moustapha Kanté, Eun Jung Kim, Noleen Köhler
2024	J	`jnl`	Erratum: More Applications of the \(d\)-Neighbor Equivalence: Acyclicity and Connectivity Constraints. SIAM J. Discret. Math. Benjamin Bergougnoux, Mamadou Moustapha Kanté
2024	J	`jnl`	Generalisations of matrix partitions: Complexity and obstructions. Theor. Comput. Sci. Alexey Barsukov, Mamadou Moustapha Kanté
2024	J	`jnl`	Lettericity of graphs: an FPT algorithm and a bound on the size of obstructions. CoRR Bogdan Alecu, Mamadou Moustapha Kanté, Vadim V. Lozin, Viktor Zamaraev
2023	A	`ed.`	40th International Symposium on Theoretical Aspects of Computer Science, STACS 2023, Hamburg, Germany, March 7-9, 2023 STACS Petra Berenbrink, Patricia Bouyer, Anuj Dawar, Mamadou Moustapha Kanté
2023	J	`jnl`	Computing pivot-minors. CoRR Konrad K. Dabrowski, François Dross, Jisu Jeong, Mamadou Moustapha Kanté, O-joung Kwon, Sang-il Oum, Daniël Paulusma
2023	J	`jnl`	Obstructions for matroids of path-width at most J. Comb. Theory B Mamadou Moustapha Kanté, Eun Jung Kim, O-joung Kwon, Sang-il Oum
2023	A	`conf`	Space-Efficient Parameterized Algorithms on Graphs of Low Shrubdepth. ESA Benjamin Bergougnoux, Vera Chekan, Robert Ganian, Mamadou Moustapha Kanté, Matthias Mnich, Sang-il Oum, Michal Pilipczuk, Erik Jan van Leeuwen
2023	J	`jnl`	Space-Efficient Parameterized Algorithms on Graphs of Low Shrubdepth. CoRR Benjamin Bergougnoux, Vera Chekan, Robert Ganian, Mamadou Moustapha Kanté, Matthias Mnich, Sang-il Oum, Michal Pilipczuk, Erik Jan van Leeuwen
2022	J	`jnl`	A Linear Fixed Parameter Tractable Algorithm for Connected Pathwidth. SIAM J. Discret. Math. Mamadou Moustapha Kanté, Christophe Paul, Dimitrios M. Thilikos
2022	J	`jnl`	Letter Graphs and Geometric Grid Classes of Permutations. SIAM J. Discret. Math. Bogdan Alecu, Robert Ferguson, Mamadou Moustapha Kanté, Vadim V. Lozin, Vincent Vatter, Victor Zamaraev
2022	A	`conf`	Obstructions for Matroids of Path-Width at most k and Graphs of Linear Rank-Width at most k. STACS Mamadou Moustapha Kanté, Eun Jung Kim, O-joung Kwon, Sang-il Oum
2021	J	`jnl`	Generalisations of Matrix Partitions : Complexity and Obstructions. CoRR Alexey Barsukov, Mamadou Moustapha Kanté
2021	J	`jnl`	Maximal strongly connected cliques in directed graphs: Algorithms and bounds. Discret. Appl. Math. Alessio Conte, Mamadou Moustapha Kanté, Takeaki Uno, Kunihiro Wasa
2021	J	`jnl`	More Applications of the d-Neighbor Equivalence: Acyclicity and Connectivity Constraints. SIAM J. Discret. Math. Benjamin Bergougnoux, Mamadou Moustapha Kanté
2021	J	`jnl`	Tree Pivot-Minors and Linear Rank-Width. SIAM J. Discret. Math. Konrad K. Dabrowski, François Dross, Jisu Jeong, Mamadou Moustapha Kanté, O-joung Kwon, Sang-il Oum, Daniël Paulusma
2020	A	`conf`	A Linear Fixed Parameter Tractable Algorithm for Connected Pathwidth. ESA Mamadou Moustapha Kanté, Christophe Paul, Dimitrios M. Thilikos
2020	J	`jnl`	A linear fixed parameter tractable algorithm for connected pathwidth. CoRR Mamadou Moustapha Kanté, Christophe Paul, Dimitrios M. Thilikos
2020	J	`jnl`	An Optimal XP Algorithm for Hamiltonian Cycle on Graphs of Bounded Clique-Width. Algorithmica Benjamin Bergougnoux, Mamadou Moustapha Kanté, O-joung Kwon
2020	J	`jnl`	Between clique-width and linear clique-width of bipartite graphs. Discret. Math. Bogdan Alecu, Mamadou Moustapha Kanté, Vadim V. Lozin, Viktor Zamaraev
2020	J	`jnl`	Efficient enumeration of maximal Theor. Comput. Sci. Alessio Conte, Mamadou Moustapha Kanté, Yota Otachi, Takeaki Uno, Kunihiro Wasa
2020	J	`jnl`	Tree pivot-minors and linear rank-width. CoRR Konrad K. Dabrowski, François Dross, Jisu Jeong, Mamadou Moustapha Kanté, O-joung Kwon, Sang-il Oum, Daniël Paulusma
2019	J	`jnl`	Counting minimal transversals of J. Comput. Syst. Sci. Benjamin Bergougnoux, Florent Capelli, Mamadou Moustapha Kanté
2019	J	`jnl`	Fast exact algorithms for some connectivity problems parameterized by clique-width. Theor. Comput. Sci. Benjamin Bergougnoux, Mamadou Moustapha Kanté
2019	B	`conf`	Listing Induced Steiner Subgraphs as a Compact Way to Discover Steiner Trees in Graphs. MFCS Alessio Conte, Roberto Grossi, Mamadou Moustapha Kanté, Andrea Marino, Takeaki Uno, Kunihiro Wasa
2019	C	`conf`	Maximal Irredundant Set Enumeration in Bounded-Degeneracy and Bounded-Degree Hypergraphs. IWOCA Alessio Conte, Mamadou Moustapha Kanté, Andrea Marino, Takeaki Uno
2019	A	`conf`	More Applications of the d-Neighbor Equivalence: Connectivity and Acyclicity Constraints. ESA Benjamin Bergougnoux, Mamadou Moustapha Kanté
2019	J	`jnl`	On the parameterized complexity of the geodesic hull number. Theor. Comput. Sci. Mamadou Moustapha Kanté, Thiago Braga Marcilon, Rudini M. Sampaio
2018	B	`conf`	Computing Small Pivot-Minors. WG Konrad K. Dabrowski, François Dross, Jisu Jeong, Mamadou Moustapha Kanté, O-joung Kwon, Sang-il Oum, Daniël Paulusma
2018	J	`jnl`	Counting Minimal Transversals of β-Acyclic Hypergraphs. CoRR Benjamin Bergougnoux, Florent Capelli, Mamadou Moustapha Kanté
2018	B	`conf`	Enumerating Minimal Transversals of Hypergraphs without Small Holes. MFCS Mamadou Moustapha Kanté, Kaveh Khoshkhah, Mozhgan Pourmoradnasseri
2018	J	`jnl`	Linear rank-width of distance-hereditary graphs II. Vertex-minor obstructions. Eur. J. Comb. Mamadou Moustapha Kanté, O-joung Kwon
2018	J	`jnl`	More applications of the d-neighbor equivalence: acyclicity and connectivity constraints. CoRR Benjamin Bergougnoux, Mamadou Moustapha Kanté
2018	J	`jnl`	Output-Polynomial Enumeration on Graphs of Bounded (Local) Linear MIM-Width. Algorithmica Petr A. Golovach, Pinar Heggernes, Mamadou Moustapha Kanté, Dieter Kratsch, Sigve Hortemo Sæther, Yngve Villanger
2017	J	`jnl`	An FPT Algorithm and a Polynomial Kernel for Linear Rankwidth-1 Vertex Deletion. Algorithmica Mamadou Moustapha Kanté, Eun Jung Kim, O-joung Kwon, Christophe Paul
2017	B	`conf`	An Optimal XP Algorithm for Hamiltonian Cycle on Graphs of Bounded Clique-Width. WADS Benjamin Bergougnoux, Mamadou Moustapha Kanté, O-joung Kwon
2017	J	`jnl`	An optimal XP algorithm for Hamiltonian cycle on graphs of bounded clique-width. CoRR Benjamin Bergougnoux, Mamadou Moustapha Kanté, O-joung Kwon
2017	C	`conf`	Counting Minimal Dominating Sets. TAMC Mamadou Moustapha Kanté, Takeaki Uno
2017	Misc	`conf`	Efficient Enumeration of Maximal k-Degenerate Subgraphs in a Chordal Graph. COCOON Alessio Conte, Mamadou Moustapha Kanté, Yota Otachi, Takeaki Uno, Kunihiro Wasa
2017	J	`jnl`	Fast exact algorithms for some connectivity problems parametrized by clique-width. CoRR Benjamin Bergougnoux, Mamadou Moustapha Kanté
2017	J	`jnl`	Linear Rank-Width of Distance-Hereditary Graphs I. A Polynomial-Time Algorithm. Algorithmica Isolde Adler, Mamadou Moustapha Kanté, O-joung Kwon
2017	J	`jnl`	Minimal dominating sets in interval graphs and trees. Discret. Appl. Math. Petr A. Golovach, Pinar Heggernes, Mamadou Moustapha Kanté, Dieter Kratsch, Yngve Villanger
2017	B	`conf`	On Maximal Cliques with Connectivity Constraints in Directed Graphs. ISAAC Alessio Conte, Mamadou Moustapha Kanté, Takeaki Uno, Kunihiro Wasa
2016	J	`jnl`	Enumerating minimal dominating sets in chordal bipartite graphs. Discret. Appl. Math. Petr A. Golovach, Pinar Heggernes, Mamadou Moustapha Kanté, Dieter Kratsch, Yngve Villanger
2016	—	`ch.`	Minimal Dominating Set Enumeration. Encyclopedia of Algorithms Mamadou Moustapha Kanté, Lhouari Nourine
2016	J	`jnl`	Polynomial Time Algorithms for Computing a Minimum Hull Set in Distance-Hereditary and Chordal Graphs. SIAM J. Discret. Math. Mamadou Moustapha Kanté, Lhouari Nourine
2015	B	`conf`	A Polynomial Delay Algorithm for Enumerating Minimal Dominating Sets in Chordal Graphs. WG Mamadou Moustapha Kanté, Vincent Limouzy, Arnaud Mary, Lhouari Nourine, Takeaki Uno
2015	B	`conf`	An FPT Algorithm and a Polynomial Kernel for Linear Rankwidth-1 Vertex Deletion. IPEC Mamadou Moustapha Kanté, Eun Jung Kim, O-joung Kwon, Christophe Paul
2015	J	`jnl`	FPT Algorithm and Polynomial Kernel for Linear Rank-width One Vertex Deletion. CoRR Mamadou Moustapha Kanté, Eun Jung Kim, O-joung Kwon, Christophe Paul
2015	B	`conf`	Finding Paths in Grids with Forbidden Transitions. WG Mamadou Moustapha Kanté, Fatima Zahra Moataz, Benjamin Momège, Nicolas Nisse
2015	J	`jnl`	Linear rank-width and linear clique-width of trees. Theor. Comput. Sci. Isolde Adler, Mamadou Moustapha Kanté
2015	B	`conf`	Output-Polynomial Enumeration on Graphs of Bounded (Local) Linear MIM-Width. ISAAC Petr A. Golovach, Pinar Heggernes, Mamadou Moustapha Kanté, Dieter Kratsch, Sigve Hortemo Sæther, Yngve Villanger
2015	J	`jnl`	Output-Polynomial Enumeration on Graphs of Bounded (Local) Linear MIM-Width. CoRR Petr A. Golovach, Pinar Heggernes, Mamadou Moustapha Kanté, Dieter Kratsch, Sigve Hortemo Sæther, Yngve Villanger
2015	B	`conf`	Polynomial Delay Algorithm for Listing Minimal Edge Dominating Sets in Graphs. WADS Mamadou Moustapha Kanté, Vincent Limouzy, Arnaud Mary, Lhouari Nourine, Takeaki Uno
2014	J	`jnl`	A Polynomial Delay Algorithm for Enumerating Minimal Dominating Sets in Chordal Graphs. CoRR Mamadou Moustapha Kanté, Vincent Limouzy, Arnaud Mary, Lhouari Nourine, Takeaki Uno
2014	J	`jnl`	An Upper Bound on the Size of Obstructions for Bounded Linear Rank-Width. CoRR Mamadou Moustapha Kanté, O-joung Kwon
2014	B	`conf`	Linear Rank-Width of Distance-Hereditary Graphs. WG Isolde Adler, Mamadou Moustapha Kanté, O-joung Kwon
2014	J	`jnl`	Linear rank-width of distance-hereditary graphs I. A polynomial-time algorithm. CoRR Isolde Adler, Mamadou Moustapha Kanté, O-joung Kwon
2014	J	`jnl`	On the Enumeration of Minimal Dominating Sets and Related Notions. CoRR Mamadou Moustapha Kanté, Vincent Limouzy, Arnaud Mary, Lhouari Nourine
2014	J	`jnl`	On the Enumeration of Minimal Dominating Sets and Related Notions. SIAM J. Discret. Math. Mamadou Moustapha Kanté, Vincent Limouzy, Arnaud Mary, Lhouari Nourine
2014	J	`jnl`	Polynomial Delay Algorithm for Listing Minimal Edge Dominating sets in Graphs. CoRR Mamadou Moustapha Kanté, Vincent Limouzy, Arnaud Mary, Lhouari Nourine, Takeaki Uno
2013	J	`jnl`	A Note on Graphs of Linear Rank-Width 1. CoRR Binh-Minh Bui-Xuan, Mamadou Moustapha Kanté, Vincent Limouzy
2013	B	`conf`	An Exact Algorithm to Check the Existence of (Elementary) Paths and a Generalisation of the Cut Problem in Graphs with Forbidden Transitions. SOFSEM Mamadou Moustapha Kanté, Christian Laforest, Benjamin Momège
2013	B	`conf`	Linear Rank-Width and Linear Clique-Width of Trees. WG Isolde Adler, Mamadou Moustapha Kanté
2013	B	`conf`	On the Enumeration and Counting of Minimal Dominating sets in Interval and Permutation Graphs. ISAAC Mamadou Moustapha Kanté, Vincent Limouzy, Arnaud Mary, Lhouari Nourine, Takeaki Uno
2013	B	`conf`	Polynomial Time Algorithms for Computing a Minimum Hull Set in Distance-Hereditary and Chordal Graphs. SOFSEM Mamadou Moustapha Kanté, Lhouari Nourine
2013	J	`jnl`	The Rank-Width of Edge-Coloured Graphs. Theory Comput. Syst. Mamadou Moustapha Kanté, Michaël Rao
2013	C	`conf`	Trees in Graphs with Conflict Edges or Forbidden Transitions. TAMC Mamadou Moustapha Kanté, Christian Laforest, Benjamin Momège
2012	B	`conf`	On the Neighbourhood Helly of Some Graph Classes and Applications to the Enumeration of Minimal Dominating Sets. ISAAC Mamadou Moustapha Kanté, Vincent Limouzy, Arnaud Mary, Lhouari Nourine
2012	—	`conf`	The Lattice of all Betweenness Relations: Structure and Properties. CLA Laurent Beaudou, Mamadou Moustapha Kanté, Lhouari Nourine
2012	J	`jnl`	Well-quasi-ordering of matrices under Schur complement and applications to directed graphs. Eur. J. Comb. Mamadou Moustapha Kanté
2011	J	`jnl`	Compact labelings for efficient first-order model-checking. J. Comb. Optim. Bruno Courcelle, Cyril Gavoille, Mamadou Moustapha Kanté
2011	B	`conf`	Enumeration of Minimal Dominating Sets and Variants. FCT Mamadou Moustapha Kanté, Vincent Limouzy, Arnaud Mary, Lhouari Nourine
2011	J	`jnl`	Well-Quasi-Ordering of Matrices under Schur Complement and Applications to Directed Graphs. CoRR Mamadou Moustapha Kanté
2011	—	`conf`	\mathbb CAI Mamadou Moustapha Kanté, Michaël Rao
2009	B	`conf`	Directed Rank-Width and Displit Decomposition. WG Mamadou Moustapha Kanté, Michaël Rao
2009	J	`jnl`	Graph operations characterizing rank-width. Discret. Appl. Math. Bruno Courcelle, Mamadou Moustapha Kanté
2008	J	`jnl`	Compact Labelings For Efficient First-Order Model-Checking CoRR Bruno Courcelle, Cyril Gavoille, Mamadou Moustapha Kanté
2008	J	`jnl`	Connectivity check in 3-connected planar graphs with obstacles. Electron. Notes Discret. Math. Bruno Courcelle, Cyril Gavoille, Mamadou Moustapha Kanté, Andrew Twigg
2008	Misc	`conf`	Efficient First-Order Model-Checking Using Short Labels. FAW Bruno Courcelle, Cyril Gavoille, Mamadou Moustapha Kanté
2008	—	`—`	Graph Structurings: Some Algorithmic Applications. (Structurations de Graphes: Quelques Applications Algorithmiques). Mamadou Moustapha Kanté
2007	B	`conf`	Graph Operations Characterizing Rank-Width and Balanced Graph Expressions. WG Bruno Courcelle, Mamadou Moustapha Kanté
2007	J	`jnl`	The rank-width of Directed Graphs CoRR Mamadou Moustapha Kanté
2007	J	`jnl`	Vertex-minor reductions can simulate edge contractions. Discret. Appl. Math. Mamadou Moustapha Kanté