default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDJuraj Stacho
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
Journal Articles
- 2021
[j21]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: 57-69 (2021)- 2018
- [j20]Maria Chudnovsky, Juraj Stacho:
3-Colorable Subclasses of P8-Free Graphs. SIAM J. Discret. Math. 32(2): 1111-1138 (2018) - 2017
- [j19]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: 84-97 (2017) - [j18]Maria Chudnovsky, Peter Maceli, Juraj Stacho, Mingxian Zhong:
4-Coloring P6-Free Graphs with No Induced 5-Cycles. J. Graph Theory 84(3): 262-285 (2017) - 2016
- [j17]Michal Adamaszek, Juraj Stacho:
Complexity of simplicial homology and independence complexes of chordal graphs. Comput. Geom. 57: 8-18 (2016) - [j16]Robert Brignall, Vadim V. Lozin, Juraj Stacho:
Bichain graphs: Geometric model and universal graphs. Discret. Appl. Math. 199: 16-29 (2016) - 2015
- [j15]Konrad K. Dabrowski, Vadim V. Lozin, Juraj Stacho:
Stable-iΠ partitions of graphs. Discret. Appl. Math. 182: 104-114 (2015) - [j14]Derek G. Corneil, Juraj Stacho:
Vertex Ordering Characterizations of Graphs of Bounded Asteroidal Number. J. Graph Theory 78(1): 61-79 (2015) - [j13]Barnaby Martin, Florent R. Madelaine, Juraj Stacho:
Constraint Satisfaction with Counting Quantifiers. SIAM J. Discret. Math. 29(2): 1065-1113 (2015) - 2014
- [j12]Steven Chaplick, Juraj Stacho:
The vertex leafage of chordal graphs. Discret. Appl. Math. 168: 14-25 (2014) - [j11]Mathew C. Francis, Pavol Hell, Juraj Stacho:
Blocking Quadruple: A New Obstruction to Circular-Arc Graphs. SIAM J. Discret. Math. 28(2): 631-655 (2014) - 2013
- [j10]Mathew C. Francis, Pavol Hell, Juraj Stacho:
Obstructions to chordal circular-arc graphs of small independence number. Electron. Notes Discret. Math. 44: 75-81 (2013) - [j9]Michel Habib, Juraj Stacho:
Unique perfect phylogeny is intractable. Theor. Comput. Sci. 476: 47-66 (2013) - 2012
- [j8]Juraj Stacho:
3-Colouring AT-Free Graphs in Polynomial Time. Algorithmica 64(3): 384-399 (2012) - [j7]Marina Groshaus, Pavol Hell, Juraj Stacho:
On edge-sets of bicliques in graphs. Discret. Appl. Math. 160(18): 2698-2708 (2012) - [j6]Michel Habib, Juraj Stacho:
Reduced clique graphs of chordal graphs. Eur. J. Comb. 33(5): 712-735 (2012) - 2011
- [j5]Tomás Feder, Pavol Hell, David G. Schell, Juraj Stacho:
Dichotomy for tree-structured trigraph list homomorphism problems. Discret. Appl. Math. 159(12): 1217-1224 (2011) - 2009
- [j4]Michel Habib, Juraj Stacho:
Linear Algorithms for Chordal Graphs of Bounded Directed Vertex Leafage. Electron. Notes Discret. Math. 32: 99-108 (2009) - [j3]Michel Habib, Juraj Stacho:
A Decomposition Theorem for Chordal Graphs and its Applications. Electron. Notes Discret. Math. 34: 561-565 (2009) - 2008
- [j2]Tínaz Ekim, Pavol Hell, Juraj Stacho, Dominique de Werra:
Polarity of chordal graphs. Discret. Appl. Math. 156(13): 2469-2479 (2008) - [j1]Juraj Stacho:
On P4-transversals of chordal graphs. Discret. Math. 308(23): 5548-5554 (2008)
Conference and Workshop Papers
- 2015
- [c11]Mathew C. Francis, Pavol Hell, Juraj Stacho:
Forbidden structure characterization of circular-arc graphs and a certifying recognition algorithm. SODA 2015: 1708-1727 - 2014
- [c10]Barnaby Martin, Juraj Stacho:
Constraint Satisfaction with Counting Quantifiers 2. CSR 2014: 259-272 - [c9]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: 139-151 - 2012
- [c8]Michal Adamaszek, Juraj Stacho:
Algorithmic complexity of finding cross-cycles in flag complexes. SCG 2012: 51-60 - [c7]Florent R. Madelaine, Barnaby Martin, Juraj Stacho:
Constraint Satisfaction with Counting Quantifiers. CSR 2012: 253-265 - 2011
- [c6]Michel Habib, Juraj Stacho:
Unique Perfect Phylogeny Is NP-Hard. CPM 2011: 132-146 - [c5]Steven Chaplick, Elad Cohen, Juraj Stacho:
Recognizing Some Subclasses of Vertex Intersection Graphs of 0-Bend Paths in a Grid. WG 2011: 319-330 - 2010
- [c4]Juraj Stacho:
3-Colouring AT-Free Graphs in Polynomial Time. ISAAC (2) 2010: 144-155 - 2009
- [c3]Michel Habib, Juraj Stacho:
Polynomial-Time Algorithm for the Leafage of Chordal Graphs. ESA 2009: 290-300 - 2008
- [c2]Pavol Hell, André Raspaud, Juraj Stacho:
On Injective Colourings of Chordal Graphs. LATIN 2008: 520-530 - [c1]Juraj Stacho:
On 2-Subcolourings of Chordal Graphs. LATIN 2008: 544-554
Informal and Other Publications
- 2015
- [i11]Aistis Atminas, Robert Brignall, Vadim V. Lozin, Juraj Stacho:
Minimal Classes of Graphs of Unbounded Clique-width and Well-quasi-ordering. CoRR abs/1503.01628 (2015) - [i10]Daniele Catanzaro, Steven Chaplick, Stefan Felsner, Bjarni V. Halldórsson, Magnús M. Halldórsson, Thomas Hixon, Juraj Stacho:
Max Point-Tolerance Graphs. CoRR abs/1508.03810 (2015) - 2014
- [i9]Maria Chudnovsky, Peter Maceli, Juraj Stacho, Mingxian Zhong:
4-coloring $P_6$-free graphs with no induced 5-cycles. CoRR abs/1407.2487 (2014) - [i8]Mathew C. Francis, Pavol Hell, Juraj Stacho:
Forbidden structure characterization of circular-arc graphs and a certifying recognition algorithm. CoRR abs/1408.2639 (2014) - 2013
- [i7]Marina Groshaus, Pavol Hell, Juraj Stacho:
On edge-sets of bicliques in graphs. CoRR abs/1307.4629 (2013) - [i6]Barnaby Martin, Juraj Stacho:
Constraint Satisfaction with Counting Quantifiers 2. CoRR abs/1312.7605 (2013) - 2012
- [i5]Mathew C. Francis, Pavol Hell, Juraj Stacho:
Obstructions to chordal circular-arc graphs of small independence number. CoRR abs/1210.5701 (2012) - 2011
- [i4]Steven Chaplick, Juraj Stacho:
The vertex leafage of chordal graphs. CoRR abs/1104.2524 (2011) - [i3]Florent R. Madelaine, Barnaby Martin, Juraj Stacho:
Constraint Satisfaction with Counting Quantifiers. CoRR abs/1112.2974 (2011) - 2010
- [i2]Tomás Feder, Pavol Hell, David G. Schell, Juraj Stacho:
Dichotomy for tree-structured trigraph list homomorphism problems. CoRR abs/1009.0358 (2010) - [i1]Michel Habib, Juraj Stacho:
Unique perfect phylogeny is NP-hard. CoRR abs/1011.5737 (2010)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-25 05:48 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
