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
Hilfe
Suche: Author="Dvo{\v{r}}{\'a}k, Zden{\v{e}}k"
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
A dynamic data structure for MSO properties in graphs with bounded tree-depth
Zdenȇk Dvoȓák
,
Martin Kupec
,
Vojtȇch Tůma
Lecture Notes in Computer Science
8737
, 2014, pp. 334-345
4-critical graphs on surfaces without contractible
(\le 4)
-cycles
Zdenȇk Dvoȓák
,
Bernard Lidický
SIAM Journal on Discrete Mathematics
28
(1), 2014, pp. 521-552
Large independent sets in triangle-free planar graphs
Zdenȇk Dvoȓák
,
Matthias Mnich
Lecture Notes in Computer Science
8737
, 2014, pp. 346-357
3-choosability of planar graphs with
(\leqslant 4)
-cycles far apart
Zdenȇk Dvoȓák
Journal of Combinatorial Theory Series B
104
, 2014, pp. 28-59
Sub-exponentially many 3-colorings of triangle-free planar graphs
Arash Asadi
,
Zdenȇk Dvoȓák
,
Luke Postle
,
Robin Thomas
Journal of Combinatorial Theory Series B
103
(6), 2013, pp. 706-712
Star chromatic index
Zdenȇk Dvoȓák
,
Bojan Mohar
,
Robert S̑ámal
Journal of Graph Theory
72
(3), 2013, pp. 313-326
Chromatic number and complete graph substructures for degree sequences
Zdenȇk Dvoȓák
,
Bojan Mohar
Combinatorica
33
(5), 2013, pp. 513-529
A dynamic data structure for counting subgraphs in sparse graphs
Zdenȇk Dvoȓák
,
Vojtȇch Tůma
Lecture Notes in Computer Science
8037
, 2013, pp. 304-315
Spectrally degenerate graphs: Hereditary case
Zdenȇk Dvoȓák
,
Bojan Mohar
Journal of Combinatorial Theory Series B
102
(5), 2012, pp. 1099-1109
Graphs with two crossings are 5-choosable
Zdenȇk Dvoȓák
,
Bernard Lidický
,
Riste S̑krekovski
SIAM Journal on Discrete Mathematics
25
(4), 2011, pp. 1746-1753
Algorithms for classes of graphs with bounded expansion
Zdenȇk Dvoȓák
,
Daniel Král'
Lecture Notes in Computer Science
5911
, 2010, pp. 17-32
3-choosability of triangle-free planar graphs with constraints on 4-cycles
Zdenȇk Dvoȓák
,
Bernard Lidický
,
Riste S̑krekovski
SIAM Journal on Discrete Mathematics
24
(3), 2010, pp. 934-945
Crossing-critical graphs with large maximum degree
Zdenȇk Dvoȓák
,
Bojan Mohar
Journal of Combinatorial Theory Series B
100
(4), 2010, pp. 413-417
Spectral radius of finite and infinite planar graphs and of graphs of bounded genus
Zdenȇk Dvoȓák
,
Bojan Mohar
Journal of Combinatorial Theory Series B
100
(6), 2010, pp. 729-739
Small graph classes and bounded expansion
Zdenȇk Dvoȓák
,
Serguei Norine
Journal of Combinatorial Theory Series B
100
(2), 2010, pp. 171-175
Matchings and nonrainbow colorings
Zdenȇk Dvoȓák
,
Stanislav Jendrol'
,
Daniel Král'
,
Gyula Pap
SIAM Journal on Discrete Mathematics
23
(1), 2008-2009, pp. 344-348
List-coloring squares of sparse subcubic graphs
Zdenȇk Dvoȓák
,
Riste S̑krekovski
,
Martin Tancer
SIAM Journal on Discrete Mathematics
22
(1), 2008, pp. 139-159
k
-chromatic number of graphs on surfaces
Zdenȇk Dvoȓák
,
Riste S̑krekovski
SIAM Journal on Discrete Mathematics
23
(1), 2008-2009, pp. 477-486
Coloring triangle-free graphs on surfaces
Zdenȇk Dvoȓák
,
Daniel Král'
,
Robin Thomas
Lecture Notes in Computer Science
4835
, 2007, pp. 2-4
A theorem about a contractible and light edge
Zdenȇk Dvoȓák
,
Riste S̑krekovski
SIAM Journal on Discrete Mathematics
20
(1), 2006, pp. 55-61
On the complexity of the
G
-reconstruction problem
Zdenȇk Dvoȓák
,
Vít Jelínek
Lecture Notes in Computer Science
3827
, 2005, pp. 196-205
Locally consistent constraint satisfaction problems
Zdenȇk Dvoȓák
,
Daniel Král'
,
Ondȓej Pangrác
Theoretical Computer Science
348
(2-3), 2005, pp. 187-206
Noncrossing Hamiltonian paths in geometric graphs
Jakub C̑erný
,
Zdenȇk Dvoȓák
,
Vít Jelínek
,
Jan Kára
Lecture Notes in Computer Science
2912
, 2004, pp. 86-97
An algorithm for cyclic edge connectivity of cubic graphs
Zdenȇk Dvoȓák
,
Jan Kára
,
Daniel Král'
,
Ondȓej Pangrác
Lecture Notes in Computer Science
3111
, 2004, pp. 236-247
Locally consistent constraint satisfaction problems
Zdenȇk Dvoȓák
,
Daniel Král'
,
Ondȓej Pangrác
Lecture Notes in Computer Science
3142
, 2004, pp. 469-480
Seiten 1
2
>