| 2026 | CSL | Weakly-Sparse and Strongly Flip-Flat Classes of Graphs Are Uniformly Almost-Wide. | Fatemeh Ghasemi, Julien Grange, Mamadou Moustapha Kant, Florent R. Madelaine |
| 2026 | ICALP | Transducing Linear Decompositions of Tournaments. | Colin Geniet, Fatemeh Ghasemi, Mamadou Moustapha Kant |
| 2026 | STACS | Testing H-Freeness on Sparse Graphs, the Case of Bounded Expansion. | Samuel Humeau, Mamadou Moustapha Kant, Daniel Mock, Timoth Picavet, Alexandre Vigny |
| 2025 | LICS | Recognisability Equals Definability for Finitely Representable Matroids of Bounded Path-Width. | Rutger Campbell, Bruno Guillon, Mamadou Moustapha Kant, Eun Jung Kim, Sang-il Oum |
| 2025 | STACS | CMSO-Transducing Tree-Like Graph Decompositions. | Rutger Campbell, Bruno Guillon, Mamadou Moustapha Kant, Eun Jung Kim, Noleen Khler |
| 2023 | ESA | Space-Efficient Parameterized Algorithms on Graphs of Low Shrubdepth. | Benjamin Bergougnoux, Vera Chekan, Robert Ganian, Mamadou Moustapha Kant, Matthias Mnich, Sang-il Oum, Michal Pilipczuk, Erik Jan van Leeuwen |
| 2022 | STACS | Obstructions for Matroids of Path-Width at most k and Graphs of Linear Rank-Width at most k. | Mamadou Moustapha Kant, Eun Jung Kim, O-joung Kwon, Sang-il Oum |
| 2020 | ESA | A Linear Fixed Parameter Tractable Algorithm for Connected Pathwidth. | Mamadou Moustapha Kant, Christophe Paul, Dimitrios M. Thilikos |
| 2019 | ESA | More Applications of the d-Neighbor Equivalence: Connectivity and Acyclicity Constraints. | Benjamin Bergougnoux, Mamadou Moustapha Kant |
| 2019 | IWOCA | Maximal Irredundant Set Enumeration in Bounded-Degeneracy and Bounded-Degree Hypergraphs. | Alessio Conte, Mamadou Moustapha Kant, Andrea Marino, Takeaki Uno |
| 2019 | MFCS | Listing Induced Steiner Subgraphs as a Compact Way to Discover Steiner Trees in Graphs. | Alessio Conte, Roberto Grossi, Mamadou Moustapha Kant, Andrea Marino, Takeaki Uno, Kunihiro Wasa |
| 2018 | MFCS | Enumerating Minimal Transversals of Hypergraphs without Small Holes. | Mamadou Moustapha Kant, Kaveh Khoshkhah, Mozhgan Pourmoradnasseri |
| 2018 | WG | Computing Small Pivot-Minors. | Konrad K. Dabrowski, Franois Dross, Jisu Jeong, Mamadou Moustapha Kant, O-joung Kwon, Sang-il Oum, Danil Paulusma |
| 2017 | COCOON | Efficient Enumeration of Maximal k-Degenerate Subgraphs in a Chordal Graph. | Alessio Conte, Mamadou Moustapha Kant, Yota Otachi, Takeaki Uno, Kunihiro Wasa |
| 2017 | ISAAC | On Maximal Cliques with Connectivity Constraints in Directed Graphs. | Alessio Conte, Mamadou Moustapha Kant, Takeaki Uno, Kunihiro Wasa |
| 2017 | TAMC | Counting Minimal Dominating Sets. | Mamadou Moustapha Kant, Takeaki Uno |
| 2017 | WADS | An Optimal XP Algorithm for Hamiltonian Cycle on Graphs of Bounded Clique-Width. | Benjamin Bergougnoux, Mamadou Moustapha Kant, O-joung Kwon |
| 2015 | ISAAC | Output-Polynomial Enumeration on Graphs of Bounded (Local) Linear MIM-Width. | Petr A. Golovach, Pinar Heggernes, Mamadou Moustapha Kant, Dieter Kratsch, Sigve Hortemo Sther, Yngve Villanger |
| 2015 | WADS | Polynomial Delay Algorithm for Listing Minimal Edge Dominating Sets in Graphs. | Mamadou Moustapha Kant, Vincent Limouzy, Arnaud Mary, Lhouari Nourine, Takeaki Uno |
| 2015 | WG | A Polynomial Delay Algorithm for Enumerating Minimal Dominating Sets in Chordal Graphs. | Mamadou Moustapha Kant, Vincent Limouzy, Arnaud Mary, Lhouari Nourine, Takeaki Uno |
| 2015 | WG | Finding Paths in Grids with Forbidden Transitions. | Mamadou Moustapha Kant, Fatima Zahra Moataz, Benjamin Momge, Nicolas Nisse |
| 2014 | WG | Linear Rank-Width of Distance-Hereditary Graphs. | Isolde Adler, Mamadou Moustapha Kant, O-joung Kwon |
| 2013 | ISAAC | On the Enumeration and Counting of Minimal Dominating sets in Interval and Permutation Graphs. | Mamadou Moustapha Kant, Vincent Limouzy, Arnaud Mary, Lhouari Nourine, Takeaki Uno |
| 2013 | SOFSEM | An Exact Algorithm to Check the Existence of (Elementary) Paths and a Generalisation of the Cut Problem in Graphs with Forbidden Transitions. | Mamadou Moustapha Kant, Christian Laforest, Benjamin Momge |
| 2013 | SOFSEM | Polynomial Time Algorithms for Computing a Minimum Hull Set in Distance-Hereditary and Chordal Graphs. | Mamadou Moustapha Kant, Lhouari Nourine |
| 2013 | TAMC | Trees in Graphs with Conflict Edges or Forbidden Transitions. | Mamadou Moustapha Kant, Christian Laforest, Benjamin Momge |
| 2013 | WG | Linear Rank-Width and Linear Clique-Width of Trees. | Isolde Adler, Mamadou Moustapha Kant |
| 2012 | ISAAC | On the Neighbourhood Helly of Some Graph Classes and Applications to the Enumeration of Minimal Dominating Sets. | Mamadou Moustapha Kant, Vincent Limouzy, Arnaud Mary, Lhouari Nourine |
| 2011 | FCT | Enumeration of Minimal Dominating Sets and Variants. | Mamadou Moustapha Kant, Vincent Limouzy, Arnaud Mary, Lhouari Nourine |
| 2009 | WG | Directed Rank-Width and Displit Decomposition. | Mamadou Moustapha Kant, Michal Rao |
| 2008 | FAW | Efficient First-Order Model-Checking Using Short Labels. | Bruno Courcelle, Cyril Gavoille, Mamadou Moustapha Kant |
| 2007 | WG | Graph Operations Characterizing Rank-Width and Balanced Graph Expressions. | Bruno Courcelle, Mamadou Moustapha Kant |