Vincent Limouzy

Pascal Ochem

CoRR, 2023

2022

On dually-CPT and strong-CPT posets.

[BibT_eX]

[DOI]

Liliana Alcón

Noemí Gudiño

Marisa Gutierrez

CoRR, 2022

Polynomial Delay Algorithm for Minimal Chordal Completions.

[BibT_eX]

[DOI]

Caroline Brosse

Proceedings of the 49th International Colloquium on Automata, Languages, and Programming, 2022

2021

Containment Graphs and Posets of Paths in a Tree: Wheels and Partial Wheels.

[BibT_eX]

[DOI]

Order, 2021

Connected greedy colourings of perfect graphs and other classes: the good, the bad and the ugly.

[BibT_eX]

[DOI]

CoRR, 2021

2020

Efficient enumeration of maximal split subgraphs and sub-cographs and related classes.

[BibT_eX]

[DOI]

CoRR, 2020

Revisiting a Theorem by Folkman on Graph Colouring.

[BibT_eX]

[DOI]

Jean-Sébastien Sereni

Electron. J. Comb., 2020

2019

WEPA 2016 preface.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2019

2017

Bounds on Directed star arboricity in some digraph classes.

[BibT_eX]

[DOI]

Electron. Notes Discret. Math., 2017

2015

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

[BibT_eX]

[DOI]

Proceedings of the Graph-Theoretic Concepts in Computer Science, 2015

Polynomial Delay Algorithm for Listing Minimal Edge Dominating Sets in Graphs.

[BibT_eX]

[DOI]

Proceedings of the Algorithms and Data Structures - 14th International Symposium, 2015

2014

On the Enumeration of Minimal Dominating Sets and Related Notions.

[BibT_eX]

[DOI]

SIAM J. Discret. Math., 2014

Co-TT graphs and a characterization of split co-TT graphs.

[BibT_eX]

[DOI]

Nirit Lefel Weingarten

Discret. Appl. Math., 2014

2013

A Note on Graphs of Linear Rank-Width 1.

[BibT_eX]

[DOI]

CoRR, 2013

On a class of intersection graphs.

[BibT_eX]

[DOI]

CoRR, 2013

On the Enumeration and Counting of Minimal Dominating sets in Interval and Permutation Graphs.

[BibT_eX]

[DOI]

Proceedings of the Algorithms and Computation - 24th International Symposium, 2013

Hardness and Algorithms for Variants of Line Graphs of Directed Graphs.

[BibT_eX]

[DOI]

Proceedings of the Algorithms and Computation - 24th International Symposium, 2013

2012

Vertex Intersection Graphs of Paths on a Grid.

[BibT_eX]

[DOI]

Andrei Asinowski

Elad Cohen

Marina Lipshteyn

Michal Stern

J. Graph Algorithms Appl., 2012

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

[BibT_eX]

[DOI]

Proceedings of the Algorithms and Computation - 23rd International Symposium, 2012

2011

String graphs of k-bend paths on a grid.

[BibT_eX]

[DOI]

Andrei Asinowski

Elad Cohen

Marina Lipshteyn

Michal Stern

Electron. Notes Discret. Math., 2011

Enumeration of Minimal Dominating Sets and Variants.

[BibT_eX]

[DOI]

Proceedings of the Fundamentals of Computation Theory - 18th International Symposium, 2011

2010

Seidel Minor, Permutation Graphs and Combinatorial Properties.

[BibT_eX]

[DOI]

Proceedings of the Algorithms and Computation - 21st International Symposium, 2010

2009

On some simplicial elimination schemes for chordal graphs.

[BibT_eX]

[DOI]

Electron. Notes Discret. Math., 2009

Algorithmic aspects of a general modular decomposition theory.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2009

2008

A note on computing set overlap classes.

[BibT_eX]

[DOI]

Pierre Charbit

Mathieu Raffinot

Michaël Rao

Inf. Process. Lett., 2008

2007

NLC-2 Graph Recognition and Isomorphism.

[BibT_eX]

[DOI]

Michaël Rao

Proceedings of the Graph-Theoretic Concepts in Computer Science, 2007

Unifying Two Graph Decompositions with Modular Decomposition.

[BibT_eX]

[DOI]

Proceedings of the Algorithms and Computation, 18th International Symposium, 2007

2006

On Modular Decomposition Concepts: the case for Homogeneous Relations.

[BibT_eX]

[DOI]

Electron. Notes Discret. Math., 2006

Algorithmic Aspects of a Novel Modular Decomposition Theory

[BibT_eX]

[DOI]

CoRR, 2006

Homogeneity vs. Adjacency: Generalising Some Graph Decomposition Algorithms.

[BibT_eX]

[DOI]