Recherche - Archive ouverte HAL

74 résultats

	Pour les 74 documents Envoyer sur ORCID RSS ATOM Exporter BibTeX XML-TEI CSV RTF EndNote PDF HTML Export avancé	Page : Page précédente 1 2 3 Page suivante	triés par Pertinence Auteur A→Z Auteur Z→A Titre A→Z Titre Z→A Date de publication croissante Date de publication décroissante Date de dépôt croissante Date de dépôt décroissante

		An FPT Algorithm and a Polynomial Kernel for Linear Rankwidth-1 Vertex Deletion Mamadou Moustapha Kanté , Eun Jung Kim , O-Joung Kwon , Christophe Paul IPEC 2015 - 10th International Symposium on Parameterized and Exact Computation, Sep 2015, Patras, Greece. pp.138-150, ⟨10.4230/LIPIcs.IPEC.2015.138⟩ Communication dans un congrès lirmm-01264011v1	Envoyer sur ORCID Exporter BibTeX XML-TEI Dublin Core DC Terms EndNote DataCite Export avancé Partager Gmail Facebook X LinkedIn More
		Fast exact algorithms for some connectivity problems parametrized by clique-width Benjamin Bergougnoux , Mamadou Moustapha Kanté , Mamadou Kanté 2017 Pré-publication, Document de travail hal-01560555v2	Envoyer sur ORCID Exporter BibTeX XML-TEI Dublin Core DC Terms EndNote DataCite Export avancé Partager Gmail Facebook X LinkedIn More
		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 Article dans une revue hal-00342668v1	Envoyer sur ORCID Exporter BibTeX XML-TEI Dublin Core DC Terms EndNote DataCite Export avancé Partager Gmail Facebook X LinkedIn More
		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⟩ Article dans une revue hal-02083523v1	Envoyer sur ORCID Exporter BibTeX XML-TEI Dublin Core DC Terms EndNote DataCite Export avancé Partager Gmail Facebook X LinkedIn More
		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⟩ Communication dans un congrès istex hal-02083539v1	Envoyer sur ORCID Exporter BibTeX XML-TEI Dublin Core DC Terms EndNote DataCite Export avancé Partager Gmail Facebook X LinkedIn More
		Graph operations characterizing rank-width and balanced graph expressions Bruno Courcelle , Mamadou Moustapha Kanté Proccedings of the 33rd International Workshop on Graphs (WG07), Jun 2007, Germany. pp.66--75 Communication dans un congrès hal-00306343v1	Envoyer sur ORCID Exporter BibTeX XML-TEI Dublin Core DC Terms EndNote DataCite Export avancé Partager Gmail Facebook X LinkedIn More
		A Polynomial Delay Algorithm for Enumerating Minimal Dominating Sets in Chordal Graphs Mamadou Moustapha Kanté , Vincent Limouzy , Arnaud Mary , Lhouari Nourine , Takeaki Uno WG 2015: Graph-Theoretic Concepts in Computer Science, pp.138-153, 2016, ⟨10.1007/978-3-662-53174-7_11⟩ Chapitre d'ouvrage hal-02082337v1	Envoyer sur ORCID Exporter BibTeX XML-TEI Dublin Core DC Terms EndNote DataCite Export avancé Partager Gmail Facebook X LinkedIn More
		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 Rapport hal-01115395v1	Envoyer sur ORCID Exporter BibTeX XML-TEI Dublin Core DC Terms EndNote DataCite Export avancé Partager Gmail Facebook X LinkedIn More
		Space-Efficient Parameterized Algorithms on Graphs of Low Shrubdepth Benjamin Bergougnoux , Vera Chekan , Robert Ganian , Mamadou Moustapha Kanté , Matthias Mnich , et al. CoRR, 2023, abs/2307.01285, ⟨10.48550/ARXIV.2307.01285⟩ Article dans une revue hal-04492602v1	Envoyer sur ORCID Exporter BibTeX XML-TEI Dublin Core DC Terms EndNote DataCite Export avancé Partager Gmail Facebook X LinkedIn More
		Space-Efficient Parameterized Algorithms on Graphs of Low Shrubdepth Benjamin Bergougnoux , Vera Chekan , Robert Ganian , Mamadou Moustapha Kanté , Matthias Mnich , et al. 31st Annual European Symposium on Algorithms, 2023, AMSTERDAM, Netherlands. pp.18:1--18:18, ⟨10.4230/LIPICS.ESA.2023.18⟩ Communication dans un congrès hal-04492601v1	Envoyer sur ORCID Exporter BibTeX XML-TEI Dublin Core DC Terms EndNote DataCite Export avancé Partager Gmail Facebook X LinkedIn More
		Enumerating minimal dominating sets in chordal bipartite graphs Petr A. Golovach , Pinar Heggernes , Mamadou Moustapha Kanté , Dieter Kratsch , Yngve Villanger Discrete Applied Mathematics, 2016, 199, pp.30--36. ⟨10.1016/j.dam.2014.12.010⟩ Article dans une revue hal-02083515v1	Envoyer sur ORCID Exporter BibTeX XML-TEI Dublin Core DC Terms EndNote DataCite Export avancé Partager Gmail Facebook X LinkedIn More
		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⟩ Communication dans un congrès istex hal-02083527v1	Envoyer sur ORCID Exporter BibTeX XML-TEI Dublin Core DC Terms EndNote DataCite Export avancé Partager Gmail Facebook X LinkedIn More
		A Note on Graphs of Linear Rank-Width 1 Binh-Minh Bui-Xuan , Mamadou Moustapha Kanté , Vincent Limouzy CoRR, 2013, abs/1306.1345 Article dans une revue hal-02083532v1	Envoyer sur ORCID Exporter BibTeX XML-TEI Dublin Core DC Terms EndNote DataCite Export avancé Partager Gmail Facebook X LinkedIn More
		Connectivity check in 3-connected planar graphs with obstacles Bruno Courcelle , Cyril Gavoille , Mamadou Moustapha Kanté , Andrew Twigg Electronic Notes in Discrete Mathematics, 2008, 31, pp.151-155. ⟨10.1016/j.endm.2008.06.030⟩ Article dans une revue hal-00333863v1	Envoyer sur ORCID Exporter BibTeX XML-TEI Dublin Core DC Terms EndNote DataCite Export avancé Partager Gmail Facebook X LinkedIn More
		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⟩ Communication dans un congrès hal-01630384v1	Envoyer sur ORCID Exporter BibTeX XML-TEI Dublin Core DC Terms EndNote DataCite Export avancé Partager Gmail Facebook X LinkedIn More
		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⟩ Article dans une revue hal-01765527v1	Envoyer sur ORCID Exporter BibTeX XML-TEI Dublin Core DC Terms EndNote DataCite Export avancé Partager Gmail Facebook X LinkedIn More
		The Rank-Width of Directed Graphs Mamadou Moustapha Kanté 2008 Pré-publication, Document de travail hal-00333902v1	Envoyer sur ORCID Exporter BibTeX XML-TEI Dublin Core DC Terms EndNote DataCite Export avancé Partager Gmail Facebook X LinkedIn More
		Linear Rank-Width of Distance-Hereditary Graphs Isolde Adler , Mamadou Moustapha Kanté , O-Joung Kwon Graph-Theoretic Concepts in Computer Science - 40th International Workshop, 2014, Nouan-le-Fuzelier, France. pp.42--55, ⟨10.1007/978-3-319-12340-0_4⟩ Communication dans un congrès hal-02083519v1	Envoyer sur ORCID Exporter BibTeX XML-TEI Dublin Core DC Terms EndNote DataCite Export avancé Partager Gmail Facebook X LinkedIn More
		Well-quasi-ordering of matrices under Schur complement and applications to directed graphs Mamadou Moustapha Kanté Eur. J. Comb., 2012, 33, pp.1820--1841. ⟨10.1016/j.ejc.2012.03.034⟩ Article dans une revue hal-02083533v1	Envoyer sur ORCID Exporter BibTeX XML-TEI Dublin Core DC Terms EndNote DataCite Export avancé Partager Gmail Facebook X LinkedIn More
		Compact Labelings For Efficient First-Order Model-Checking Bruno Courcelle , Cyril Gavoille , Mamadou Moustapha Kanté CoRR, 2008, abs/0811.4713 Article dans une revue hal-02083559v1	Envoyer sur ORCID Exporter BibTeX XML-TEI Dublin Core DC Terms EndNote DataCite Export avancé Partager Gmail Facebook X LinkedIn More
		Computing Small Pivot-Minors Konrad K. Dabrowski , François Dross , Jisu Jeong , Mamadou Moustapha Kanté , O-Joung Kwon , et al. WG 2018 - 44th International Workshop on Graph-Theoretic Concepts in Computer Science, Jun 2018, Cottbus, Germany. pp.125-138, ⟨10.1007/978-3-030-00256-5_11⟩ Communication dans un congrès hal-02083512v1	Envoyer sur ORCID Exporter BibTeX XML-TEI Dublin Core DC Terms EndNote DataCite Export avancé Partager Gmail Facebook X LinkedIn More
		More applications of the d-neighbor equivalence: acyclicity and connectivity constraints Benjamin Bergougnoux , Mamadou Moustapha Kanté CoRR, 2018, abs/1805.11275 Article dans une revue hal-04492610v1	Envoyer sur ORCID Exporter BibTeX XML-TEI Dublin Core DC Terms EndNote DataCite Export avancé Partager Gmail Facebook X LinkedIn More
		Maximal Irredundant Set Enumeration in Bounded-Degeneracy and Bounded-Degree Hypergraphs Alessio Conte , Mamadou Moustapha Kanté , Andrea Marino , Takeaki Uno Combinatorial Algorithms - 30th International Workshop, 2019, PISA, Italy. pp.148--159, ⟨10.1007/978-3-030-25005-8_13⟩ Communication dans un congrès hal-04492609v1	Envoyer sur ORCID Exporter BibTeX XML-TEI Dublin Core DC Terms EndNote DataCite Export avancé Partager Gmail Facebook X LinkedIn More
		Graph operations characterizing rank-width Bruno Courcelle , Mamadou Moustapha Kanté Discrete Applied Mathematics, 2009, 157, pp.627-640. ⟨10.1016/j.dam.2008.08.026⟩ Article dans une revue hal-00334159v1	Envoyer sur ORCID Exporter BibTeX XML-TEI Dublin Core DC Terms EndNote DataCite Export avancé Partager Gmail Facebook X LinkedIn More
		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 Communication dans un congrès hal-01590820v1	Envoyer sur ORCID Exporter BibTeX XML-TEI Dublin Core DC Terms EndNote DataCite Export avancé Partager Gmail Facebook X LinkedIn More
		Vertex-minor reductions can simulate edge contractions Mamadou Moustapha Kanté Discrete Applied Mathematics, 2007, 155, pp.2328--2340 Article dans une revue hal-00306264v1	Envoyer sur ORCID Exporter BibTeX XML-TEI Dublin Core DC Terms EndNote DataCite Export avancé Partager Gmail Facebook X LinkedIn More
		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⟩ Article dans une revue hal-02083480v1	Envoyer sur ORCID Exporter BibTeX XML-TEI Dublin Core DC Terms EndNote DataCite Export avancé Partager Gmail Facebook X LinkedIn More
		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⟩ Communication dans un congrès istex hal-02083529v1	Envoyer sur ORCID Exporter BibTeX XML-TEI Dublin Core DC Terms EndNote DataCite Export avancé Partager Gmail Facebook X LinkedIn More
		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⟩ Communication dans un congrès istex hal-02083531v1	Envoyer sur ORCID Exporter BibTeX XML-TEI Dublin Core DC Terms EndNote DataCite Export avancé Partager Gmail Facebook X LinkedIn More
		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⟩ Communication dans un congrès hal-02083535v1	Envoyer sur ORCID Exporter BibTeX XML-TEI Dublin Core DC Terms EndNote DataCite Export avancé Partager Gmail Facebook X LinkedIn More

Filtrer vos résultats

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

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

Compact Labelings For Efficient First-Order Model-Checking

The Rank-Width of Edge-Coloured Graphs

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

Graph operations characterizing rank-width and balanced graph expressions

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

Finding Paths in Grids with Forbidden Transitions

Space-Efficient Parameterized Algorithms on Graphs of Low Shrubdepth

Space-Efficient Parameterized Algorithms on Graphs of Low Shrubdepth

Enumerating minimal dominating sets in chordal bipartite graphs

An Exact Algorithm to Check the Existence of (Elementary) Paths and a Generalisation of the Cut Problem in Graphs with Forbidden Transitions

A Note on Graphs of Linear Rank-Width 1

Connectivity check in 3-connected planar graphs with obstacles

On Maximal Cliques with Connectivity Constraints in Directed Graphs

On the Enumeration of Minimal Dominating Sets and Related Notions

The Rank-Width of Directed Graphs

Linear Rank-Width of Distance-Hereditary Graphs

Well-quasi-ordering of matrices under Schur complement and applications to directed graphs

Compact Labelings For Efficient First-Order Model-Checking

Computing Small Pivot-Minors

More applications of the d-neighbor equivalence: acyclicity and connectivity constraints

Maximal Irredundant Set Enumeration in Bounded-Degeneracy and Bounded-Degree Hypergraphs

Graph operations characterizing rank-width

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

Vertex-minor reductions can simulate edge contractions

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

Trees in Graphs with Conflict Edges or Forbidden Transitions

Linear Rank-Width and Linear Clique-Width of Trees

On the Neighbourhood Helly of Some Graph Classes and Applications to the Enumeration of Minimal Dominating Sets