Juraj Stacho

SIAM J. Discret. Math., 2018

2017

4-Coloring P6-Free Graphs with No Induced 5-Cycles.

[BibT_eX]

[DOI]

J. Graph Theory, 2017

Max point-tolerance graphs.

[BibT_eX]

[DOI]

Daniele Catanzaro

Steven Chaplick

Stefan Felsner

Bjarni V. Halldórsson

Magnús M. Halldórsson

Thomas Hixon

Discret. Appl. Math., 2017

2016

Bichain graphs: Geometric model and universal graphs.

[BibT_eX]

[DOI]

Robert Brignall

Vadim V. Lozin

Discret. Appl. Math., 2016

Complexity of simplicial homology and independence complexes of chordal graphs.

[BibT_eX]

[DOI]

Michal Adamaszek

Comput. Geom., 2016

2015

Constraint Satisfaction with Counting Quantifiers.

[BibT_eX]

[DOI]

Barnaby Martin

Florent R. Madelaine

SIAM J. Discret. Math., 2015

Vertex Ordering Characterizations of Graphs of Bounded Asteroidal Number.

[BibT_eX]

[DOI]

Derek G. Corneil

J. Graph Theory, 2015

Stable-iΠ partitions of graphs.

[BibT_eX]

[DOI]

Konrad K. Dabrowski

Vadim V. Lozin

Discret. Appl. Math., 2015

Minimal Classes of Graphs of Unbounded Clique-width and Well-quasi-ordering.

[BibT_eX]

[DOI]

CoRR, 2015

Forbidden structure characterization of circular-arc graphs and a certifying recognition algorithm.

[BibT_eX]

[DOI]

Mathew C. Francis

Proceedings of the Twenty-Sixth Annual ACM-SIAM Symposium on Discrete Algorithms, 2015

2014

Blocking Quadruple: A New Obstruction to Circular-Arc Graphs.

[BibT_eX]

[DOI]

Mathew C. Francis

SIAM J. Discret. Math., 2014

The vertex leafage of chordal graphs.

[BibT_eX]

[DOI]

Steven Chaplick

Discret. Appl. Math., 2014

4-coloring $P_6$-free graphs with no induced 5-cycles.

[BibT_eX]

[DOI]

CoRR, 2014

Contact Representations of Planar Graphs: Extending a Partial Representation is Hard.

[BibT_eX]

[DOI]

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

Constraint Satisfaction with Counting Quantifiers 2.

[BibT_eX]

[DOI]

Barnaby Martin

Proceedings of the Computer Science - Theory and Applications, 2014

2013

Unique perfect phylogeny is intractable.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2013

Obstructions to chordal circular-arc graphs of small independence number.

[BibT_eX]

[DOI]

Mathew C. Francis

Electron. Notes Discret. Math., 2013

2012

Reduced clique graphs of chordal graphs.

[BibT_eX]

[DOI]

Eur. J. Comb., 2012

On edge-sets of bicliques in graphs.

[BibT_eX]

[DOI]

Marina Groshaus

Discret. Appl. Math., 2012

3-Colouring AT-Free Graphs in Polynomial Time.

[BibT_eX]

[DOI]

Algorithmica, 2012

Algorithmic complexity of finding cross-cycles in flag complexes.

[BibT_eX]

[DOI]

Michal Adamaszek

Proceedings of the 28th ACM Symposium on Computational Geometry, 2012

2011

Dichotomy for tree-structured trigraph list homomorphism problems.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2011

Recognizing Some Subclasses of Vertex Intersection Graphs of 0-Bend Paths in a Grid.

[BibT_eX]

[DOI]

Steven Chaplick

Elad Cohen

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

Unique Perfect Phylogeny Is NP-Hard.

[BibT_eX]

[DOI]

Proceedings of the Combinatorial Pattern Matching - 22nd Annual Symposium, 2011

2010

Unique perfect phylogeny is NP-hard

[BibT_eX]

[DOI]

CoRR, 2010

2009

A Decomposition Theorem for Chordal Graphs and its Applications.

[BibT_eX]

[DOI]

Electron. Notes Discret. Math., 2009

Linear Algorithms for Chordal Graphs of Bounded Directed Vertex Leafage.

[BibT_eX]

[DOI]

Electron. Notes Discret. Math., 2009

Polynomial-Time Algorithm for the Leafage of Chordal Graphs.

[BibT_eX]

[DOI]

Proceedings of the Algorithms, 2009

2008

On P4-transversals of chordal graphs.

[BibT_eX]

[DOI]

Discret. Math., 2008

Polarity of chordal graphs.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2008

On 2-Subcolourings of Chordal Graphs.

[BibT_eX]

[DOI]

Proceedings of the LATIN 2008: Theoretical Informatics, 2008

On Injective Colourings of Chordal Graphs.

[BibT_eX]

[DOI]

André Raspaud