Fakultät für Informatik
-
Technische Universität München
Lehrstuhl für Effiziente Algorithmen
Die bibliographische Datenbank LEABib
Suchen
•
Liste der Journale
•
Liste der Serien
•
Liste der Konferenzen
•
Ausgewählte Publikationen
[1]
Hilfe
Suche: Author="Stacho, Juraj"
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Vertex ordering characterizations of graphs of bounded asteroidal number
Derek G. Corneil
,
Juraj Stacho
Journal of Graph Theory
78
(1), 2015, pp. 61-79
Contact representations of planar graphs: Extending a partial representation is hard
Steven Chaplick
,
Paul Dorbec
,
Jan Kratochvíl
,
Mickael Montassier
,
Juraj Stacho
Lecture Notes in Computer Science
8747
, 2014, pp. 139-151
Blocking quadruple: A new obstruction to circular-arc graphs
Matthew Francis
,
Pavol Hell
,
Juraj Stacho
SIAM Journal on Discrete Mathematics
28
(2), 2014, pp. 631-655
Unique perfect phylogeny is intractable
Michel Habib
,
Juraj Stacho
Theoretical Computer Science
476
, 2013, pp. 47-66
Algorithmic complexity of finding cross-cycles in flag complexes
Michaƚ Adamaszek
,
Juraj Stacho
Proceedings of the 28th Annual Symposium on Computational Geometry, SCG'2012 (Chapel Hill, NC, USA, June 17-20, 2012)
, 2012, pp. 51-60
Constraint satisfaction with counting quantifiers
Florent Madelaine
,
Barnaby Martin
,
Juraj Stacho
Lecture Notes in Computer Science
7353
, 2012, pp. 253-265
3-colouring AT-free graphs in polynomial time
Juraj Stacho
Algorithmica
64
(3), 2012, pp. 384-399
Recognizing some subclasses of vertex intersection graphs of 0-bend paths in a grid
Steven Chaplick
,
Elad Cohen
,
Juraj Stacho
Lecture Notes in Computer Science
6986
, 2011, pp. 319-330
Unique perfect phylogeny is
NP
-hard
Michel Habib
,
Juraj Stacho
Lecture Notes in Computer Science
6661
, 2011, pp. 132-146
3-colouring AT-free graphs in polynomial time
Juraj Stacho
Lecture Notes in Computer Science
6507
, 2010, pp. 144-155
Polynomial-time algorithm for the leafage of chordal graphs
Michel Habib
,
Juraj Stacho
Lecture Notes in Computer Science
5757
, 2009, pp. 290-300