dblp.uni-trier.dewww.uni-trier.de

Zdenek Dvorak

List of publications from the DBLP Bibliography Server - FAQ
Coauthor Index - Ask others: ACM DL/Guide - CiteSeer - CSB - Google - MSN - Yahoo
Home Page

2009
23EEZdenek Dvorak, Ken-ichi Kawarabayashi, Robin Thomas: Three-coloring triangle-free planar graphs in linear time. SODA 2009: 1176-1182
22EEZdenek Dvorak, Daniel Král, Robin Thomas: Coloring triangle-free graphs on surfaces. SODA 2009: 120-129
21EEZdenek Dvorak: Two-factors in orientated graphs with forbidden transitions. Discrete Mathematics 309(1): 104-112 (2009)
2008
20EEZdenek Dvorak, Daniel Král, Pavel Nejedlý, Riste Skrekovski: Coloring squares of planar graphs with girth six. Eur. J. Comb. 29(4): 838-849 (2008)
19EEZdenek Dvorak: On forbidden subdivision characterizations of graph classes. Eur. J. Comb. 29(5): 1321-1332 (2008)
18EEZdenek Dvorak, Riste Skrekovski, Martin Tancer: List-Coloring Squares of Sparse Subcubic Graphs. SIAM J. Discrete Math. 22(1): 139-159 (2008)
17EEZdenek Dvorak, Riste Skrekovski, T. Valla: Planar Graphs of Odd-Girth at Least 9 are Homomorphic to the Petersen Graph. SIAM J. Discrete Math. 22(2): 568-591 (2008)
2007
16EEZdenek Dvorak, Daniel Král, Robin Thomas: Coloring Triangle-Free Graphs on Surfaces. ISAAC 2007: 2-4
15EEJakub Cerný, Zdenek Dvorak, Vít Jelínek, Jan Kára: Noncrossing Hamiltonian paths in geometric graphs. Discrete Applied Mathematics 155(9): 1096-1105 (2007)
14EEZdenek Dvorak, Riste Skrekovski, T. Valla: Four gravity results. Discrete Mathematics 307(2): 181-190 (2007)
13EEZdenek Dvorak, Vít Jelínek, Daniel Král, Jan Kyncl, Michael E. Saks: Probabilistic strategies for the partition and plurality problems. Random Struct. Algorithms 30(1-2): 63-77 (2007)
2006
12EEZdenek Dvorak, Tomás Kaiser, Daniel Král: Eulerian colorings and the bipartizing matchings conjecture of Fleischner. Eur. J. Comb. 27(7): 1088-1101 (2006)
11EEZdenek Dvorak, Riste Skrekovski: A Theorem About a Contractible and Light Edge. SIAM J. Discrete Math. 20(1): 55-61 (2006)
2005
10EEZdenek Dvorak, Vít Jelínek: On the Complexity of the G-Reconstruction Problem. ISAAC 2005: 196-205
9EEZdenek Dvorak, Vít Jelínek, Daniel Král, Jan Kyncl, Michael E. Saks: Three Optimal Algorithms for Balls of Three Colors. STACS 2005: 206-217
8EEZdenek Dvorak, Daniel Král, Riste Skrekovski: Coloring face hypergraphs on surfaces. Eur. J. Comb. 26(1): 95-110 (2005)
7EEZdenek Dvorak, Daniel Král, Ondrej Pangrác: Locally consistent constraint satisfaction problems. Theor. Comput. Sci. 348(2-3): 187-206 (2005)
2004
6EEZdenek Dvorak, Daniel Král, Ondrej Pangrác: Locally Consistent Constraint Satisfaction Problems: (Extended Abstract). ICALP 2004: 469-480
5EEZdenek Dvorak, Jan Kára, Daniel Král, Ondrej Pangrác: An Algorithm for Cyclic Edge Connectivity of Cubic Graphs. SWAT 2004: 236-247
4EEZdenek Dvorak, Daniel Král, Ondrej Pangrác: Locally consistent constraint satisfaction problems Electronic Colloquium on Computational Complexity (ECCC)(051): (2004)
2003
3EEJakub Cerný, Zdenek Dvorak, Vít Jelínek, Jan Kára: Noncrossing Hamiltonian Paths in Geometric Graphs. Graph Drawing 2003: 86-97
2002
2EEZdenek Dvorak, Jan Kára, Daniel Král, Ondrej Pangrác: Complexity of Pattern Coloring of Cycle Systems. WG 2002: 164-175
2001
1EEZdenek Dvorak, Daniel Král: On Planar Mixed Hypergraphs. Electr. J. Comb. 8(1): (2001)

Coauthor Index

1Jakub Cerný [3] [15]
2Vít Jelínek (Vítek Jelínek) [3] [9] [10] [13] [15]
3Tomás Kaiser [12]
4Jan Kára [2] [3] [5] [15]
5Ken-ichi Kawarabayashi [23]
6Daniel Král [1] [2] [4] [5] [6] [7] [8] [9] [12] [13] [16] [20] [22]
7Jan Kyncl [9] [13]
8Pavel Nejedlý [20]
9Ondrej Pangrác [2] [4] [5] [6] [7]
10Michael E. Saks [9] [13]
11Riste Skrekovski [8] [11] [14] [17] [18] [20]
12Martin Tancer [18]
13Robin Thomas [16] [22] [23]
14T. Valla [14] [17]

Copyright © Sun May 17 03:24:02 2009 by Michael Ley (ley@uni-trier.de)