On Injective Colourings of Chordal Graphs. - Pavol Hell; André Raspaud; Juraj Stacho (LATIN, 2008)

On 2-Subcolourings of Chordal Graphs. - Juraj Stacho (LATIN, 2008)

Polarity of chordal graphs. - Tínaz Ekim; Pavol Hell; Juraj Stacho; Dominique de Werra (Discret. Appl. Math., 2008)

On P4-transversals of chordal graphs. - Juraj Stacho (Discret. Math., 2008)

Polynomial-Time Algorithm for the Leafage of Chordal Graphs. - Michel Habib; Juraj Stacho (ESA, 2009)

Linear Algorithms for Chordal Graphs of Bounded Directed Vertex Leafage. - Michel Habib; Juraj Stacho (Electron. Notes Discret. Math., 2009)

A Decomposition Theorem for Chordal Graphs and its Applications. - Michel Habib; Juraj Stacho (Electron. Notes Discret. Math., 2009)

Unique perfect phylogeny is NP-hard - Michel Habib; Juraj Stacho (CoRR, 2010)

Unique Perfect Phylogeny Is NP-Hard. - Michel Habib; Juraj Stacho (CPM, 2011)

Recognizing Some Subclasses of Vertex Intersection Graphs of 0-Bend Paths in a Grid. - Steven Chaplick; Elad Cohen; Juraj Stacho (WG, 2011)

Dichotomy for tree-structured trigraph list homomorphism problems. - Tomás Feder; Pavol Hell; David G. Schell; Juraj Stacho (Discret. Appl. Math., 2011)

Algorithmic complexity of finding cross-cycles in flag complexes. - Michal Adamaszek; Juraj Stacho (SCG, 2012)

3-Colouring AT-Free Graphs in Polynomial Time. - Juraj Stacho (Algorithmica, 2012)

On edge-sets of bicliques in graphs. - Marina Groshaus; Pavol Hell; Juraj Stacho (Discret. Appl. Math., 2012)

Reduced clique graphs of chordal graphs. - Michel Habib; Juraj Stacho (Eur. J. Comb., 2012)

Obstructions to chordal circular-arc graphs of small independence number. - Mathew C. Francis; Pavol Hell; Juraj Stacho (Electron. Notes Discret. Math., 2013)

Unique perfect phylogeny is intractable. - Michel Habib; Juraj Stacho (Theor. Comput. Sci., 2013)

Constraint Satisfaction with Counting Quantifiers 2. - Barnaby Martin; Juraj Stacho (CSR, 2014)

Contact Representations of Planar Graphs: Extending a Partial Representation is Hard. - Steven Chaplick; Paul Dorbec; Jan Kratochvíl; Mickaël Montassier; Juraj Stacho (WG, 2014)

4-coloring $P_6$-free graphs with no induced 5-cycles. - Maria Chudnovsky; Peter Maceli; Juraj Stacho; Mingxian Zhong (CoRR, 2014)

The vertex leafage of chordal graphs. - Steven Chaplick; Juraj Stacho (Discret. Appl. Math., 2014)

Blocking Quadruple: A New Obstruction to Circular-Arc Graphs. - Mathew C. Francis; Pavol Hell; Juraj Stacho (SIAM J. Discret. Math., 2014)

Forbidden structure characterization of circular-arc graphs and a certifying recognition algorithm. - Mathew C. Francis; Pavol Hell; Juraj Stacho (SODA, 2015)

Minimal Classes of Graphs of Unbounded Clique-width and Well-quasi-ordering. - Aistis Atminas; Robert Brignall; Vadim V. Lozin; Juraj Stacho (CoRR, 2015)

Stable-iΠ partitions of graphs. - Konrad K. Dabrowski; Vadim V. Lozin; Juraj Stacho (Discret. Appl. Math., 2015)

Vertex Ordering Characterizations of Graphs of Bounded Asteroidal Number. - Derek G. Corneil; Juraj Stacho (J. Graph Theory, 2015)

Constraint Satisfaction with Counting Quantifiers. - Barnaby Martin; Florent R. Madelaine; Juraj Stacho (SIAM J. Discret. Math., 2015)

Complexity of simplicial homology and independence complexes of chordal graphs. - Michal Adamaszek; Juraj Stacho (Comput. Geom., 2016)

Bichain graphs: Geometric model and universal graphs. - Robert Brignall; Vadim V. Lozin; Juraj Stacho (Discret. Appl. Math., 2016)

Max point-tolerance graphs. - Daniele Catanzaro; Steven Chaplick; Stefan Felsner; Bjarni V. Halldórsson; Magnús M. Halldórsson; Thomas Hixon; Juraj Stacho (Discret. Appl. Math., 2017)

4-Coloring P6-Free Graphs with No Induced 5-Cycles. - Maria Chudnovsky; Peter Maceli; Juraj Stacho; Mingxian Zhong (J. Graph Theory, 2017)

3-Colorable Subclasses of P8-Free Graphs. - Maria Chudnovsky; Juraj Stacho (SIAM J. Discret. Math., 2018)

Minimal classes of graphs of unbounded clique-width defined by finitely many forbidden induced subgraphs. - Aistis Atminas; Robert Brignall; Vadim V. Lozin; Juraj Stacho (Discret. Appl. Math., 2021)