Juraj Stacho

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