Juraj Stacho

Publication Activity (10 Years)

Years Active: 2008-2021
Publications (10 Years): 6

Top Topics

Graph Structures

Constraint Satisfaction

Top Venues

Discret. Appl. Math.

SIAM J. Discret. Math.

Publications

Aistis Atminas, Robert Brignall, Vadim V. Lozin, Juraj Stacho
Minimal classes of graphs of unbounded clique-width defined by finitely many forbidden induced subgraphs. Discret. Appl. Math. 295 (2021)
Maria Chudnovsky, Juraj Stacho
-Free Graphs. SIAM J. Discret. Math. 32 (2) (2018)
Maria Chudnovsky, Peter Maceli, Juraj Stacho, Mingxian Zhong
-Free Graphs with No Induced 5-Cycles. J. Graph Theory 84 (3) (2017)
Daniele Catanzaro, Steven Chaplick, Stefan Felsner, Bjarni V. Halldórsson, Magnús M. Halldórsson, Thomas Hixon, Juraj Stacho
Max point-tolerance graphs. Discret. Appl. Math. 216 (2017)
Robert Brignall, Vadim V. Lozin, Juraj Stacho
Bichain graphs: Geometric model and universal graphs. Discret. Appl. Math. 199 (2016)
Michal Adamaszek, Juraj Stacho
Complexity of simplicial homology and independence complexes of chordal graphs. Comput. Geom. 57 (2016)
Barnaby Martin, Florent R. Madelaine, Juraj Stacho
Constraint Satisfaction with Counting Quantifiers. SIAM J. Discret. Math. 29 (2) (2015)
Konrad K. Dabrowski, Vadim V. Lozin, Juraj Stacho
Stable-iΠ partitions of graphs. Discret. Appl. Math. 182 (2015)
Aistis Atminas, Robert Brignall, Vadim V. Lozin, Juraj Stacho
Minimal Classes of Graphs of Unbounded Clique-width and Well-quasi-ordering. CoRR (2015)
Derek G. Corneil, Juraj Stacho
Vertex Ordering Characterizations of Graphs of Bounded Asteroidal Number. J. Graph Theory 78 (1) (2015)
Daniele Catanzaro, Steven Chaplick, Stefan Felsner, Bjarni V. Halldórsson, Magnús M. Halldórsson, Thomas Hixon, Juraj Stacho
Max Point-Tolerance Graphs. CoRR (2015)
Mathew C. Francis, Pavol Hell, Juraj Stacho
Forbidden structure characterization of circular-arc graphs and a certifying recognition algorithm. SODA (2015)
Mathew C. Francis, Pavol Hell, Juraj Stacho
Blocking Quadruple: A New Obstruction to Circular-Arc Graphs. SIAM J. Discret. Math. 28 (2) (2014)
Maria Chudnovsky, Peter Maceli, Juraj Stacho, Mingxian Zhong
4-coloring $P_6$-free graphs with no induced 5-cycles. CoRR (2014)
Barnaby Martin, Juraj Stacho
Constraint Satisfaction with Counting Quantifiers 2. CSR (2014)
Steven Chaplick, Juraj Stacho
The vertex leafage of chordal graphs. Discret. Appl. Math. 168 (2014)
Steven Chaplick, Paul Dorbec, Jan Kratochvíl, Mickaël Montassier, Juraj Stacho
Contact Representations of Planar Graphs: Extending a Partial Representation is Hard. WG (2014)
Mathew C. Francis, Pavol Hell, Juraj Stacho
Forbidden structure characterization of circular-arc graphs and a certifying recognition algorithm. CoRR (2014)
Michel Habib, Juraj Stacho
Unique perfect phylogeny is intractable. Theor. Comput. Sci. 476 (2013)
Mathew C. Francis, Pavol Hell, Juraj Stacho
Obstructions to chordal circular-arc graphs of small independence number. Electron. Notes Discret. Math. 44 (2013)
Marina Groshaus, Pavol Hell, Juraj Stacho
On edge-sets of bicliques in graphs. CoRR (2013)
Barnaby Martin, Juraj Stacho
Constraint Satisfaction with Counting Quantifiers 2. CoRR (2013)
Michel Habib, Juraj Stacho
Reduced clique graphs of chordal graphs. Eur. J. Comb. 33 (5) (2012)
Juraj Stacho
3-Colouring AT-Free Graphs in Polynomial Time. Algorithmica 64 (3) (2012)
Mathew C. Francis, Pavol Hell, Juraj Stacho
Obstructions to chordal circular-arc graphs of small independence number CoRR (2012)
Marina Groshaus, Pavol Hell, Juraj Stacho
On edge-sets of bicliques in graphs. Discret. Appl. Math. 160 (18) (2012)
Michal Adamaszek, Juraj Stacho
Algorithmic complexity of finding cross-cycles in flag complexes. SCG (2012)
Florent R. Madelaine, Barnaby Martin, Juraj Stacho
Constraint Satisfaction with Counting Quantifiers. CSR (2012)
Steven Chaplick, Elad Cohen, Juraj Stacho
Recognizing Some Subclasses of Vertex Intersection Graphs of 0-Bend Paths in a Grid. WG (2011)
Florent R. Madelaine, Barnaby Martin, Juraj Stacho
Constraint Satisfaction with Counting Quantifiers CoRR (2011)
Michel Habib, Juraj Stacho
-Hard. CPM (2011)
Tomás Feder, Pavol Hell, David G. Schell, Juraj Stacho
Dichotomy for tree-structured trigraph list homomorphism problems. Discret. Appl. Math. 159 (12) (2011)
Steven Chaplick, Juraj Stacho
The vertex leafage of chordal graphs CoRR (2011)
Tomás Feder, Pavol Hell, David G. Schell, Juraj Stacho
Dichotomy for tree-structured trigraph list homomorphism problems CoRR (2010)
Juraj Stacho
3-Colouring AT-Free Graphs in Polynomial Time. ISAAC (2) (2010)
Michel Habib, Juraj Stacho
Unique perfect phylogeny is NP-hard CoRR (2010)
Michel Habib, Juraj Stacho
Linear Algorithms for Chordal Graphs of Bounded Directed Vertex Leafage. Electron. Notes Discret. Math. 32 (2009)
Michel Habib, Juraj Stacho
Polynomial-Time Algorithm for the Leafage of Chordal Graphs. ESA (2009)
Michel Habib, Juraj Stacho
A Decomposition Theorem for Chordal Graphs and its Applications. Electron. Notes Discret. Math. 34 (2009)
Juraj Stacho
On 2-Subcolourings of Chordal Graphs. LATIN (2008)
Tínaz Ekim, Pavol Hell, Juraj Stacho, Dominique de Werra
Polarity of chordal graphs. Discret. Appl. Math. 156 (13) (2008)
Juraj Stacho
-transversals of chordal graphs. Discret. Math. 308 (23) (2008)
Pavol Hell, André Raspaud, Juraj Stacho
On Injective Colourings of Chordal Graphs. LATIN (2008)