Filtrer vos résultats
- 12
- 9
- 7
- 7
- 5
- 1
- 1
- 20
- 1
- 3
- 1
- 1
- 1
- 1
- 2
- 1
- 1
- 2
- 7
- 1
- 20
- 1
- 12
- 8
- 8
- 5
- 2
- 2
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 21
- 10
- 8
- 5
- 4
- 3
- 3
- 3
- 3
- 3
- 2
- 2
- 2
- 2
- 2
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
21 résultats
|
|
triés par
|
|
Co-TT graphs and a characterization of split co-TT graphsDiscrete Applied Mathematics, 2014, 165, pp.168-174. ⟨10.1016/j.dam.2012.11.014⟩
Article dans une revue
hal-02082703v1
|
||
|
NLC-2 graph recognition and isomorphismWG'07, 33rd International Workshop on Graph-Theoretic Concepts in Computer Science, 2007, Jena, Germany
Communication dans un congrès
hal-00159700v1
|
||
Stratégies de capture de fugitifs... ou l'application de la théorie des graphes à PacManInterstices, 2009, http://interstices.info/pacman
Article dans une revue
hal-00367092v1
|
|||
|
On some simplicial elimination schemes for chordal graphs2008
Pré-publication, Document de travail
hal-00353959v2
|
||
|
Algorithmic Aspects of a General Modular Decomposition Theory2007
Pré-publication, Document de travail
hal-00111235v2
|
||
|
On dually-CPT and strong-CPT posetsOrder, 2023, ⟨10.1007/s11083-023-09656-4⟩
Article dans une revue
hal-04216376v1
|
||
Bounds on Directed star arboricity in some digraph classesElectronic Notes in Discrete Mathematics, 2017, 62, pp.267 - 272. ⟨10.1016/j.endm.2017.10.046⟩
Article dans une revue
hal-01784822v1
|
|||
|
A Polynomial Delay Algorithm for Enumerating Minimal Dominating Sets in Chordal GraphsWG 2015: Graph-Theoretic Concepts in Computer Science, pp.138-153, 2016, ⟨10.1007/978-3-662-53174-7_11⟩
Chapitre d'ouvrage
hal-02082337v1
|
||
|
On the Enumeration of Minimal Dominating Sets and Related NotionsSIAM Journal on Discrete Mathematics, 2014, 28 (4), pp.1916 - 1929. ⟨10.1137/120862612⟩
Article dans une revue
hal-01765527v1
|
||
|
Homogeneity vs. Adjacency: generalising some graph decomposition algorithmsWG: Graph-Theoretic Concepts in Computer Science, Jun 2006, Bergen, Norway. pp.278-288, ⟨10.1007/11917496_25⟩
Communication dans un congrès
hal-00020188v1
|
||
|
A Note on Computing Set Overlap ClassesInformation Processing Letters, 2008, 108 (4), pp.186-191. ⟨10.1016/j.ipl.2008.05.005⟩
Article dans une revue
lirmm-00325371v1
|
||
|
NLC-2 graph recognition and isomorphismGraph-Theoretic Concepts in Computer Science 33rd International Workshop, WG 2007, Dornburg, Germany, June 21-23, 2007., Jun 2007, Dornburg, Germany. pp.86-98, ⟨10.1007/978-3-540-74839-7_9⟩
Communication dans un congrès
hal-00134605v1
|
||
Hardness and Algorithms for Variants of Line Graphs of Directed GraphsInternational Symposium on Algorithms and Computation, Dec 2013, Hong-Kong, China. pp.196-206, ⟨10.1007/978-3-642-45030-3_19⟩
Communication dans un congrès
istex
hal-02082711v1
|
|||
|
Contact graphs of boxes with unidirectional contacts2023
Pré-publication, Document de travail
hal-04216379v1
|
||
|
Revisiting a theorem by Folkman on graph colouringThe Electronic Journal of Combinatorics, 2020, 27 (1), pp.P1.56. ⟨10.37236/8899⟩
Article dans une revue
hal-02194900v2
|
||
|
A Note On Computing Set Overlap Classes2007
Pré-publication, Document de travail
hal-00192579v1
|
||
|
On the hardness of inclusion-wise minimal separators enumeration2023
Pré-publication, Document de travail
hal-04216381v1
|
||
|
Polynomial Delay Algorithm for Listing Minimal Edge Dominating Sets in GraphsAlgorithms and Data Structures (WADS), Aug 2015, Victoria, Canada. pp.446-457
Communication dans un congrès
hal-01248851v1
|
||
|
Unifying two Graph Decompositions with Modular DecompositionInternational Symposium on Algorithms and Computation (ISAAC, Dec 2007, Sendai, Japan. pp.52-64, ⟨10.1007/978-3-540-77120-3⟩
Communication dans un congrès
hal-00022957v3
|
||
|
A new tractable combinatorial decompositionRR-07016, 2007
Rapport
lirmm-00157502v2
|
||
|
Unifying Two Graph Decompositions with Modular DecompositionISAAC'07: 18th International Symposium on Algorithms and Computation, Dec 2007, Sendai, Japan. pp.52-64, ⟨10.1007/978-3-540-77120-3_7⟩
Communication dans un congrès
lirmm-00325376v1
|