default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMamadou Moustapha Kanté
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2024
[j29]Benjamin Bergougnoux, Mamadou Moustapha Kanté:
Erratum: More Applications of the \(d\)-Neighbor Equivalence: Acyclicity and Connectivity Constraints. SIAM J. Discret. Math. 38(1): 1191-1192 (2024)- [j28]Alexey Barsukov
, Mamadou Moustapha Kanté:
Generalisations of matrix partitions: Complexity and obstructions. Theor. Comput. Sci. 1007: 114652 (2024) - [e2]Olaf Beyersdorff, Mamadou Moustapha Kanté, Orna Kupferman, Daniel Lokshtanov:
41st International Symposium on Theoretical Aspects of Computer Science, STACS 2024, March 12-14, 2024, Clermont-Ferrand, France. LIPIcs 289, Schloss Dagstuhl - Leibniz-Zentrum für Informatik 2024, ISBN 978-3-95977-311-9 [contents] - [i21]Bogdan Alecu, Mamadou Moustapha Kanté, Vadim V. Lozin, Viktor Zamaraev:
Lettericity of graphs: an FPT algorithm and a bound on the size of obstructions. CoRR abs/2402.12559 (2024) - 2023
- [j27]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. J. Comb. Theory B 160: 15-35 (2023) - [c30]Benjamin Bergougnoux, Vera Chekan, Robert Ganian, Mamadou Moustapha Kanté, Matthias Mnich, Sang-il Oum, Michal Pilipczuk, Erik Jan van Leeuwen:
Space-Efficient Parameterized Algorithms on Graphs of Low Shrubdepth. ESA 2023: 18:1-18:18 - [e1]Petra Berenbrink, Patricia Bouyer, Anuj Dawar, Mamadou Moustapha Kanté:
40th International Symposium on Theoretical Aspects of Computer Science, STACS 2023, March 7-9, 2023, Hamburg, Germany. LIPIcs 254, Schloss Dagstuhl - Leibniz-Zentrum für Informatik 2023, ISBN 978-3-95977-266-2 [contents] - [i20]Benjamin Bergougnoux, Vera Chekan, Robert Ganian, Mamadou Moustapha Kanté, Matthias Mnich, Sang-il Oum, Michal Pilipczuk, Erik Jan van Leeuwen:
Space-Efficient Parameterized Algorithms on Graphs of Low Shrubdepth. CoRR abs/2307.01285 (2023) - [i19]Konrad K. Dabrowski, François Dross, Jisu Jeong, Mamadou Moustapha Kanté, O-joung Kwon, Sang-il Oum, Daniël Paulusma:
Computing pivot-minors. CoRR abs/2311.04656 (2023) - 2022
- [j26]Mamadou Moustapha Kanté, Christophe Paul, Dimitrios M. Thilikos:
A Linear Fixed Parameter Tractable Algorithm for Connected Pathwidth. SIAM J. Discret. Math. 36(1): 411-435 (2022) - [j25]Bogdan Alecu, Robert Ferguson, Mamadou Moustapha Kanté, Vadim V. Lozin, Vincent Vatter, Victor Zamaraev:
Letter Graphs and Geometric Grid Classes of Permutations. SIAM J. Discret. Math. 36(4): 2774-2797 (2022) - [c29]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. STACS 2022: 40:1-40:14 - 2021
- [j24]Alessio Conte, Mamadou Moustapha Kanté, Takeaki Uno, Kunihiro Wasa:
Maximal strongly connected cliques in directed graphs: Algorithms and bounds. Discret. Appl. Math. 303: 237-252 (2021) - [j23]Benjamin Bergougnoux, Mamadou Moustapha Kanté:
More Applications of the d-Neighbor Equivalence: Acyclicity and Connectivity Constraints. SIAM J. Discret. Math. 35(3): 1881-1926 (2021) - [j22]Konrad K. 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 J. Discret. Math. 35(4): 2922-2945 (2021) - [i18]Alexey Barsukov, Mamadou Moustapha Kanté:
Generalisations of Matrix Partitions : Complexity and Obstructions. CoRR abs/2107.13809 (2021) - 2020
- [j21]Benjamin Bergougnoux, Mamadou Moustapha Kanté, O-joung Kwon:
An Optimal XP Algorithm for Hamiltonian Cycle on Graphs of Bounded Clique-Width. Algorithmica 82(6): 1654-1674 (2020) - [j20]Bogdan Alecu, Mamadou Moustapha Kanté, Vadim V. Lozin, Viktor Zamaraev:
Between clique-width and linear clique-width of bipartite graphs. Discret. Math. 343(8): 111926 (2020) - [j19]Alessio Conte, Mamadou Moustapha Kanté, Yota Otachi, Takeaki Uno, Kunihiro Wasa:
Efficient enumeration of maximal k-degenerate induced subgraphs of a chordal graph. Theor. Comput. Sci. 818: 2-11 (2020) - [c28]Mamadou Moustapha Kanté, Christophe Paul, Dimitrios M. Thilikos:
A Linear Fixed Parameter Tractable Algorithm for Connected Pathwidth. ESA 2020: 64:1-64:16 - [i17]Mamadou Moustapha Kanté, Christophe Paul, Dimitrios M. Thilikos:
A linear fixed parameter tractable algorithm for connected pathwidth. CoRR abs/2004.11937 (2020) - [i16]Konrad K. 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. CoRR abs/2008.00561 (2020)
2010 – 2019
- 2019
- [j18]Benjamin Bergougnoux, Florent Capelli, Mamadou Moustapha Kanté:
Counting minimal transversals of β-acyclic hypergraphs. J. Comput. Syst. Sci. 101: 21-30 (2019) - [j17]Benjamin Bergougnoux, Mamadou Moustapha Kanté:
Fast exact algorithms for some connectivity problems parameterized by clique-width. Theor. Comput. Sci. 782: 30-53 (2019) - [j16]Mamadou Moustapha Kanté, Thiago Braga Marcilon, Rudini M. Sampaio:
On the parameterized complexity of the geodesic hull number. Theor. Comput. Sci. 791: 10-27 (2019) - [c27]Benjamin Bergougnoux, Mamadou Moustapha Kanté:
More Applications of the d-Neighbor Equivalence: Connectivity and Acyclicity Constraints. ESA 2019: 17:1-17:14 - [c26]Alessio Conte, Mamadou Moustapha Kanté, Andrea Marino, Takeaki Uno:
Maximal Irredundant Set Enumeration in Bounded-Degeneracy and Bounded-Degree Hypergraphs. IWOCA 2019: 148-159 - [c25]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: 73:1-73:14 - 2018
- [j15]Petr A. Golovach, Pinar Heggernes, Mamadou Moustapha Kanté, Dieter Kratsch, Sigve Hortemo Sæther, Yngve Villanger:
Output-Polynomial Enumeration on Graphs of Bounded (Local) Linear MIM-Width. Algorithmica 80(2): 714-741 (2018) - [j14]Mamadou Moustapha Kanté, O-joung Kwon:
Linear rank-width of distance-hereditary graphs II. Vertex-minor obstructions. Eur. J. Comb. 74: 110-139 (2018) - [c24]Mamadou Moustapha Kanté, Kaveh Khoshkhah, Mozhgan Pourmoradnasseri:
Enumerating Minimal Transversals of Hypergraphs without Small Holes. MFCS 2018: 55:1-55:15 - [c23]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: 125-138 - [i15]Benjamin Bergougnoux, Mamadou Moustapha Kanté:
More applications of the d-neighbor equivalence: acyclicity and connectivity constraints. CoRR abs/1805.11275 (2018) - [i14]Benjamin Bergougnoux, Florent Capelli, Mamadou Moustapha Kanté:
Counting Minimal Transversals of β-Acyclic Hypergraphs. CoRR abs/1808.05017 (2018) - 2017
- [j13]Isolde Adler, Mamadou Moustapha Kanté, O-joung Kwon:
Linear Rank-Width of Distance-Hereditary Graphs I. A Polynomial-Time Algorithm. Algorithmica 78(1): 342-377 (2017) - [j12]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 79(1): 66-95 (2017) - [j11]Petr A. Golovach, Pinar Heggernes, Mamadou Moustapha Kanté, Dieter Kratsch, Yngve Villanger:
Minimal dominating sets in interval graphs and trees. Discret. Appl. Math. 216: 162-170 (2017) - [c22]Alessio Conte, Mamadou Moustapha Kanté, Yota Otachi, Takeaki Uno, Kunihiro Wasa:
Efficient Enumeration of Maximal k-Degenerate Subgraphs in a Chordal Graph. COCOON 2017: 150-161 - [c21]Alessio Conte, Mamadou Moustapha Kanté, Takeaki Uno, Kunihiro Wasa:
On Maximal Cliques with Connectivity Constraints in Directed Graphs. ISAAC 2017: 23:1-23:13 - [c20]Mamadou Moustapha Kanté, Takeaki Uno:
Counting Minimal Dominating Sets. TAMC 2017: 333-347 - [c19]Benjamin Bergougnoux, Mamadou Moustapha Kanté, O-joung Kwon:
An Optimal XP Algorithm for Hamiltonian Cycle on Graphs of Bounded Clique-Width. WADS 2017: 121-132 - [i13]Benjamin Bergougnoux, Mamadou Moustapha Kanté, O-joung Kwon:
An optimal XP algorithm for Hamiltonian cycle on graphs of bounded clique-width. CoRR abs/1702.06095 (2017) - [i12]Benjamin Bergougnoux, Mamadou Moustapha Kanté:
Fast exact algorithms for some connectivity problems parametrized by clique-width. CoRR abs/1707.03584 (2017) - 2016
- [j10]Petr A. Golovach, Pinar Heggernes, Mamadou Moustapha Kanté, Dieter Kratsch, Yngve Villanger:
Enumerating minimal dominating sets in chordal bipartite graphs. Discret. Appl. Math. 199: 30-36 (2016) - [j9]Mamadou Moustapha Kanté, Lhouari Nourine:
Polynomial Time Algorithms for Computing a Minimum Hull Set in Distance-Hereditary and Chordal Graphs. SIAM J. Discret. Math. 30(1): 311-326 (2016) - [r1]Mamadou Moustapha Kanté, Lhouari Nourine:
Minimal Dominating Set Enumeration. Encyclopedia of Algorithms 2016: 1287-1291 - 2015
- [j8]Isolde Adler, Mamadou Moustapha Kanté:
Linear rank-width and linear clique-width of trees. Theor. Comput. Sci. 589: 87-98 (2015) - [c18]Petr A. Golovach, Pinar Heggernes, Mamadou Moustapha Kanté, Dieter Kratsch, Sigve Hortemo Sæther, Yngve Villanger:
Output-Polynomial Enumeration on Graphs of Bounded (Local) Linear MIM-Width. ISAAC 2015: 248-258 - [c17]Mamadou Moustapha Kanté, Eun Jung Kim, O-joung Kwon, Christophe Paul:
An FPT Algorithm and a Polynomial Kernel for Linear Rankwidth-1 Vertex Deletion. IPEC 2015: 138-150 - [c16]Mamadou Moustapha Kanté, Vincent Limouzy, Arnaud Mary, Lhouari Nourine, Takeaki Uno:
Polynomial Delay Algorithm for Listing Minimal Edge Dominating Sets in Graphs. WADS 2015: 446-457 - [c15]Mamadou Moustapha Kanté, Vincent Limouzy, Arnaud Mary, Lhouari Nourine, Takeaki Uno:
A Polynomial Delay Algorithm for Enumerating Minimal Dominating Sets in Chordal Graphs. WG 2015: 138-153 - [c14]Mamadou Moustapha Kanté, Fatima Zahra Moataz, Benjamin Momège, Nicolas Nisse:
Finding Paths in Grids with Forbidden Transitions. WG 2015: 154-168 - [i11]Mamadou Moustapha Kanté, Eun Jung Kim, O-joung Kwon, Christophe Paul:
FPT Algorithm and Polynomial Kernel for Linear Rank-width One Vertex Deletion. CoRR abs/1504.05905 (2015) - [i10]Petr A. Golovach, Pinar Heggernes, Mamadou Moustapha Kanté, Dieter Kratsch, Sigve Hortemo Sæther, Yngve Villanger:
Output-Polynomial Enumeration on Graphs of Bounded (Local) Linear MIM-Width. CoRR abs/1509.03753 (2015) - 2014
- [j7]Mamadou Moustapha Kanté, Vincent Limouzy, Arnaud Mary, Lhouari Nourine:
On the Enumeration of Minimal Dominating Sets and Related Notions. SIAM J. Discret. Math. 28(4): 1916-1929 (2014) - [c13]Isolde Adler, Mamadou Moustapha Kanté, O-joung Kwon:
Linear Rank-Width of Distance-Hereditary Graphs. WG 2014: 42-55 - [i9]Isolde Adler, Mamadou Moustapha Kanté, O-joung Kwon:
Linear rank-width of distance-hereditary graphs I. A polynomial-time algorithm. CoRR abs/1403.1081 (2014) - [i8]Mamadou Moustapha Kanté, Vincent Limouzy, Arnaud Mary, Lhouari Nourine, Takeaki Uno:
Polynomial Delay Algorithm for Listing Minimal Edge Dominating sets in Graphs. CoRR abs/1404.3501 (2014) - [i7]Mamadou Moustapha Kanté, Vincent Limouzy, Arnaud Mary, Lhouari Nourine, Takeaki Uno:
A Polynomial Delay Algorithm for Enumerating Minimal Dominating Sets in Chordal Graphs. CoRR abs/1407.2036 (2014) - [i6]Mamadou Moustapha Kanté, Vincent Limouzy, Arnaud Mary, Lhouari Nourine:
On the Enumeration of Minimal Dominating Sets and Related Notions. CoRR abs/1407.2053 (2014) - [i5]Mamadou Moustapha Kanté, O-joung Kwon:
An Upper Bound on the Size of Obstructions for Bounded Linear Rank-Width. CoRR abs/1412.6201 (2014) - 2013
- [j6]Mamadou Moustapha Kanté, Michaël Rao:
The Rank-Width of Edge-Coloured Graphs. Theory Comput. Syst. 52(4): 599-644 (2013) - [c12]Mamadou Moustapha Kanté, Vincent Limouzy, Arnaud Mary, Lhouari Nourine, Takeaki Uno:
On the Enumeration and Counting of Minimal Dominating sets in Interval and Permutation Graphs. ISAAC 2013: 339-349 - [c11]Mamadou Moustapha Kanté, Christian Laforest, Benjamin Momège:
An Exact Algorithm to Check the Existence of (Elementary) Paths and a Generalisation of the Cut Problem in Graphs with Forbidden Transitions. SOFSEM 2013: 257-267 - [c10]Mamadou Moustapha Kanté, Lhouari Nourine:
Polynomial Time Algorithms for Computing a Minimum Hull Set in Distance-Hereditary and Chordal Graphs. SOFSEM 2013: 268-279 - [c9]Mamadou Moustapha Kanté, Christian Laforest, Benjamin Momège:
Trees in Graphs with Conflict Edges or Forbidden Transitions. TAMC 2013: 343-354 - [c8]Isolde Adler, Mamadou Moustapha Kanté:
Linear Rank-Width and Linear Clique-Width of Trees. WG 2013: 12-25 - [i4]Binh-Minh Bui-Xuan, Mamadou Moustapha Kanté, Vincent Limouzy:
A Note on Graphs of Linear Rank-Width 1. CoRR abs/1306.1345 (2013) - 2012
- [j5]Mamadou Moustapha Kanté:
Well-quasi-ordering of matrices under Schur complement and applications to directed graphs. Eur. J. Comb. 33(8): 1820-1841 (2012) - [c7]Laurent Beaudou, Mamadou Moustapha Kanté, Lhouari Nourine:
The Lattice of all Betweenness Relations: Structure and Properties. CLA 2012: 317-326 - [c6]Mamadou Moustapha Kanté, Vincent Limouzy, Arnaud Mary, Lhouari Nourine:
On the Neighbourhood Helly of Some Graph Classes and Applications to the Enumeration of Minimal Dominating Sets. ISAAC 2012: 289-298 - 2011
- [j4]Bruno Courcelle, Cyril Gavoille, Mamadou Moustapha Kanté:
Compact labelings for efficient first-order model-checking. J. Comb. Optim. 21(1): 19-46 (2011) - [c5]Mamadou Moustapha Kanté, Michaël Rao:
\mathbb F\mathbb F-Rank-Width of (Edge-Colored) Graphs. CAI 2011: 158-173 - [c4]Mamadou Moustapha Kanté, Vincent Limouzy, Arnaud Mary, Lhouari Nourine:
Enumeration of Minimal Dominating Sets and Variants. FCT 2011: 298-309 - [i3]Mamadou Moustapha Kanté:
Well-Quasi-Ordering of Matrices under Schur Complement and Applications to Directed Graphs. CoRR abs/1102.2134 (2011)
2000 – 2009
- 2009
- [j3]Bruno Courcelle, Mamadou Moustapha Kanté:
Graph operations characterizing rank-width. Discret. Appl. Math. 157(4): 627-640 (2009) - [c3]Mamadou Moustapha Kanté, Michaël Rao:
Directed Rank-Width and Displit Decomposition. WG 2009: 214-225 - 2008
- [b1]Mamadou Moustapha Kanté:
Graph Structurings: Some Algorithmic Applications. (Structurations de Graphes: Quelques Applications Algorithmiques). University of Bordeaux, France, 2008 - [j2]Bruno Courcelle, Cyril Gavoille, Mamadou Moustapha Kanté, Andrew Twigg:
Connectivity check in 3-connected planar graphs with obstacles. Electron. Notes Discret. Math. 31: 151-155 (2008) - [c2]Bruno Courcelle, Cyril Gavoille, Mamadou Moustapha Kanté:
Efficient First-Order Model-Checking Using Short Labels. FAW 2008: 159-170 - [i2]Bruno Courcelle, Cyril Gavoille, Mamadou Moustapha Kanté:
Compact Labelings For Efficient First-Order Model-Checking. CoRR abs/0811.4713 (2008) - 2007
- [j1]Mamadou Moustapha Kanté:
Vertex-minor reductions can simulate edge contractions. Discret. Appl. Math. 155(17): 2328-2340 (2007) - [c1]Bruno Courcelle, Mamadou Moustapha Kanté:
Graph Operations Characterizing Rank-Width and Balanced Graph Expressions. WG 2007: 66-75 - [i1]Mamadou Moustapha Kanté:
The rank-width of Directed Graphs. CoRR abs/0709.1433 (2007)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-08-22 19:43 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
