Search - Université Clermont Auvergne Access content directly

Filter your results

45 Results
authIdHal_s : makante
Image document

Compact Labelings For Efficient First-Order Model-Checking

Bruno Courcelle , Cyril Gavoille , Mamadou Moustapha Kanté
Journal of Combinatorial Optimization, 2011, 21 (1), pp.19--46
Journal articles hal-00342668v1

The Rank-Width of Edge-Coloured Graphs

Mamadou Moustapha Kanté , Michaël Rao
Theory Comput. Syst., 2013, 52, pp.599--644. ⟨10.1007/s00224-012-9399-y⟩
Journal articles hal-02083523v1

mathbb \emphF\mathbb F-Rank-Width of (Edge-Colored) Graphs

Mamadou Moustapha Kanté , Michaël Rao
Algebraic Informatics - 4th International Conference, 2011, Linz, Austria. pp.158--173, ⟨10.1007/978-3-642-21493-6_10⟩
Conference papers istex hal-02083539v1
Image document

An FPT Algorithm and a Polynomial Kernel for Linear Rankwidth-1 Vertex Deletion

Mamadou Moustapha Kanté , Eun Jung Kim , O-Joung Kwon , Christophe Paul
10th International Symposium on Parameterized and Exact Computation (IPEC 2015), Sep 2015, Patras, Greece. pp.138-150, ⟨10.4230/LIPIcs.IPEC.2015.138⟩
Conference papers lirmm-01264011v1
Image document

Fast exact algorithms for some connectivity problems parametrized by clique-width

Benjamin Bergougnoux , Mamadou Moustapha Kanté , Mamadou Kanté
2017
Preprints, Working Papers, ... hal-01560555v2

Polynomial Delay Algorithm for Listing Minimal Edge Dominating Sets in Graphs

Mamadou Moustapha Kanté , Vincent Limouzy , Arnaud Mary , Lhouari Nourine , Takeaki Uno et al.
Algorithms and Data Structures (WADS), Aug 2015, Victoria, Canada. pp.446-457
Conference papers hal-01248851v1
Image document

Counting Minimal Transversals of ß-Acyclic Hypergraphs

Benjamin Bergougnoux , Florent Capelli , Mamadou Moustapha Kanté
2018
Preprints, Working Papers, ... hal-01610959v2

Enumeration of Minimal Dominating Sets and Variants

Mamadou Moustapha Kanté , Vincent Limouzy , Arnaud Mary , Lhouari Nourine
Fundamentals of Computation Theory - 18th International Symposium, 2011, Oslo, Norway. pp.298--309, ⟨10.1007/978-3-642-22953-4_26⟩
Conference papers istex hal-02083540v1

Linear Rank-Width of Distance-Hereditary Graphs I. A Polynomial-Time Algorithm

Isolde Adler , Mamadou Moustapha Kanté , O-Joung Kwon
Algorithmica, 2017, 78, pp.342--377. ⟨10.1007/s00453-016-0164-5⟩
Journal articles hal-02083514v1

The Lattice of all Betweenness Relations: Structure and Properties

Laurent Beaudou , Mamadou Moustapha Kanté , Lhouari Nourine
Proceedings of The Ninth International Conference on Concept Lattices and Their Applications, 2012, Fuengirola (Málaga), Spain. pp.317--326
Conference papers hal-02083534v1

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 et al.
Algorithms and Computation - 24th International Symposium, 2013, Hong Kong, China. pp.339--349, ⟨10.1007/978-3-642-45030-3_32⟩
Conference papers istex hal-02083525v1
Image document

Finding Paths in Grids with Forbidden Transitions

Mamadou Moustapha Kanté , Fatima Zahra Moataz , Benjamin Momège , Nicolas Nisse
[Research Report] Inria Sophia Antipolis; Univeristé Nice Sophia Antipolis; CNRS. 2015
Reports hal-01115395v1

Enumerating minimal dominating sets in chordal bipartite graphs

Petr A. Golovach , Pinar Heggernes , Mamadou Moustapha Kanté , Dieter Kratsch , Yngve Villanger et al.
Discrete Applied Mathematics, 2016, 199, pp.30--36. ⟨10.1016/j.dam.2014.12.010⟩
Journal articles hal-02083515v1

On the Enumeration of Minimal Dominating Sets and Related Notions

Mamadou Moustapha Kanté , Vincent Limouzy , Arnaud Mary , Lhouari Nourine
SIAM Journal on Discrete Mathematics, 2014, 28 (4), pp.1916 - 1929. ⟨10.1137/120862612⟩
Journal articles hal-01765527v1

A Note on Graphs of Linear Rank-Width 1

Binh-Minh Bui-Xuan , Mamadou Moustapha Kanté , Vincent Limouzy
CoRR, 2013, abs/1306.1345
Journal articles hal-02083532v1

A Polynomial Delay Algorithm for Enumerating Minimal Dominating Sets in Chordal Graphs

Mamadou Moustapha Kanté , Vincent Limouzy , Arnaud Mary , Lhouari Nourine , Takeaki Uno et al.
WG 2015: Graph-Theoretic Concepts in Computer Science, pp.138-153, 2016, ⟨10.1007/978-3-662-53174-7_11⟩
Book sections hal-02082337v1

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 Momège
SOFSEM 2013: Theory and Practice of Computer Science, 2013, Špindlerův Mlýn, Czech Republic. pp.257--267, ⟨10.1007/978-3-642-35843-2_23⟩
Conference papers istex hal-02083527v1
Image document

On paths in grids with forbidden transitions

Mamadou Moustapha Kanté , Fatima Zahra Moataz , Benjamin Momège , Nicolas Nisse
ALGOTEL 2015 — 17èmes Rencontres Francophones sur les Aspects Algorithmiques des Télécommunications, Jun 2015, Beaune, France
Conference papers hal-01142745v1

Counting Minimal Dominating Sets

Mamadou Moustapha Kanté , Takeaki Uno
TAMC'17, 2017, Bern, Switzerland. pp.333-347, ⟨10.1007/978-3-319-55911-7_24⟩
Conference papers hal-01630342v1

Linear rank-width of distance-hereditary graphs II. Vertex-minor obstructions

Mamadou Moustapha Kanté , O-Joung Kwon
Eur. J. Comb., 2018, 74, pp.110--139. ⟨10.1016/j.ejc.2018.07.009⟩
Journal articles hal-02083482v1

An Upper Bound on the Size of Obstructions for Bounded Linear Rank-Width

Mamadou Moustapha Kanté , O-Joung Kwon
CoRR, 2014, abs/1412.6201
Journal articles hal-02083521v1

Polynomial Time Algorithms for Computing a Minimum Hull Set in Distance-Hereditary and Chordal Graphs

Mamadou Moustapha Kanté , Lhouari Nourine
SIAM Journal on Discrete Mathematics, 2016, 30 (1), pp.311 - 326. ⟨10.1137/15M1013389⟩
Journal articles hal-01765439v1
Image document

An Optimal XP Algorithm for Hamiltonian Cycle on Graphs of Bounded Clique-Width

Benjamin Bergougnoux , O-Joung Kwon , Mamadou Moustapha Kanté
WADS 2017, Jul 2017, St. John’s, Canada
Conference papers hal-01590820v1

Linear Rank-Width and Linear Clique-Width of Trees

Isolde Adler , Mamadou Moustapha Kanté
Graph-Theoretic Concepts in Computer Science - 39th International Workshop, 2013, Lübeck, Germany. pp.12--25, ⟨10.1007/978-3-642-45043-3_3⟩
Conference papers istex hal-02083531v1

Trees in Graphs with Conflict Edges or Forbidden Transitions

Mamadou Moustapha Kanté , Christian Laforest , Benjamin Momège
Theory and Applications of Models of Computation, 2013, Hong Kong, China. pp.343--354, ⟨10.1007/978-3-642-38236-9_31⟩
Conference papers istex hal-02083529v1

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
Algorithms and Computation - 23rd International Symposium, 2012, Taipei, Taiwan. pp.289--298, ⟨10.1007/978-3-642-35261-4_32⟩
Conference papers hal-02083535v1

An FPT Algorithm and a Polynomial Kernel for Linear Rankwidth-1 Vertex Deletion

Mamadou Moustapha Kanté , Eun Jung Kim , O-Joung Kwon , Christophe Paul
Algorithmica, 2017, 79 (1), pp.66-95. ⟨10.1007/s00453-016-0230-z⟩
Journal articles lirmm-01692676v1
Image document

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 et al.
MFCS 2019 - 44th International Symposium on Mathematical Foundations of Computer Science, Aug 2019, Aachen, Germany. pp.1-14, ⟨10.4230/LIPIcs.MFCS.2019.73⟩
Conference papers hal-02335601v1

Output-Polynomial Enumeration on Graphs of Bounded (Local) Linear MIM-Width

Petr A. Golovach , Pinar Heggernes , Mamadou Moustapha Kanté , Dieter Kratsch , Sigve Sæther et al.
Algorithmica, 2018, 80, pp.714--741. ⟨10.1007/s00453-017-0289-1⟩
Journal articles hal-02083480v1

On Maximal Cliques with Connectivity Constraints in Directed Graphs

Alessio Conte , Mamadou Moustapha Kanté , Takeaki Uno , Kunihiro Wasa
28th International Symposium on Algorithms and Computation (ISAAC 2017), 2017, Phuket, Thailand. pp.23, ⟨10.4230/LIPIcs.ISAAC.2017.23⟩
Conference papers hal-01630384v1