Please note: This is a beta version of the new dblp website.
You can find the classic dblp view of this page here.
You can find the classic dblp view of this page here.
Zdenek Dvorak
2010 – today
- 2013
[j37]Zdenek Dvorak: Constant-factor approximation of the domination number in sparse graphs. Eur. J. Comb. 34(5): 833-840 (2013)- [j36]Zdenek Dvorak, Bojan Mohar, Robert Sámal: Star Chromatic Index. Journal of Graph Theory 72(3): 313-326 (2013)
- [c12]
- [i16]Zdenek Dvorak, Jean-Sébastien Sereni, Jan Volec: Subcubic triangle-free graphs have fractional chromatic number at most 14/5. CoRR abs/1301.5296 (2013)
- [i15]Zdenek Dvorak, Daniel Král, Robin Thomas: Three-coloring triangle-free graphs on surfaces II. 4-critical graphs in a disk. CoRR abs/1302.2158 (2013)
- [i14]Zdenek Dvorak, Ken-ichi Kawarabayashi, Robin Thomas: Three-coloring triangle-free planar graphs in linear time. CoRR abs/1302.5121 (2013)
- [i13]
- [i12]Zdenek Dvorak, Bernard Lidický: 3-coloring triangle-free planar graphs with a precolored 8-cycle. CoRR abs/1305.2467 (2013)
- [i11]Zdenek Dvorak, Bernard Lidický: 4-critical graphs on surfaces without contractible (<=4)-cycles. CoRR abs/1305.2670 (2013)
- 2012
- [j35]Zdenek Dvorak, Daniel Král': Classes of graphs with small rank decompositions are X-bounded. Eur. J. Comb. 33(4): 679-683 (2012)
- [j34]Zdenek Dvorak, Archontia C. Giannopoulou, Dimitrios M. Thilikos: Forbidden graphs for tree-depth. Eur. J. Comb. 33(5): 969-979 (2012)
- [j33]Zdenek Dvorak, Bernard Lidický, Riste Skrekovski: Bipartizing fullerenes. Eur. J. Comb. 33(6): 1286-1293 (2012)
- [j32]Zdenek Dvorak, Bojan Mohar: Spectrally degenerate graphs: Hereditary case. J. Comb. Theory, Ser. B 102(5): 1099-1109 (2012)
- [i10]Zdenek Dvorak: A stronger structure theorem for excluded topological minors. CoRR abs/1209.0129 (2012)
- [i9]Zdenek Dvorak, Bernard Lidický, Bojan Mohar, Luke Postle: 5-list-coloring planar graphs with distant precolored vertices. CoRR abs/1209.0366 (2012)
- [i8]Zdenek Dvorak, Vojtech Tuma: A dynamic data structure for counting subgraphs in sparse graphs. CoRR abs/1209.0375 (2012)
- [i7]
- 2011
- [j31]Zdenek Dvorak, Bernard Lidický, Riste Skrekovski: Randić index and the diameter of a graph. Eur. J. Comb. 32(3): 434-442 (2011)
- [j30]Zdenek Dvorak, Bernard Lidický, Riste Skrekovski: Graphs with Two Crossings Are 5-Choosable. SIAM J. Discrete Math. 25(4): 1746-1753 (2011)
- [j29]Zdenek Dvorak, Ken-ichi Kawarabayashi, Robin Thomas: Three-coloring triangle-free planar graphs in linear time. ACM Transactions on Algorithms 7(4): 41 (2011)
- [i6]Zdenek Dvorak: 3-choosability of planar graphs with (<=4)-cycles far apart. CoRR abs/1101.4275 (2011)
- [i5]Zdenek Dvorak, Daniel Král, Robin Thomas: Testing first-order properties for subclasses of sparse graphs. CoRR abs/1109.5036 (2011)
- [i4]Zdenek Dvorak: Constant-factor approximation of domination number in sparse graphs. CoRR abs/1110.5190 (2011)
- 2010
- [j28]Hayri Ardal, Zdenek Dvorak, Veselin Jungic, Tomás Kaiser: On a Rado Type Problem for Homogeneous Second Order Linear Recurrences. Electr. J. Comb. 17(1) (2010)
- [j27]Zdenek Dvorak, Jan Kára, Daniel Král', Ondrej Pangrác: Pattern Hypergraphs. Electr. J. Comb. 17(1) (2010)
- [j26]Zdenek Dvorak, Daniel Král', Jakub Teska: Toughness threshold for the existence of 2-walks in K4-minor-free graphs. Discrete Mathematics 310(3): 642-651 (2010)
- [j25]Zdenek Dvorak, Tomás Kaiser, Daniel Král', Jean-Sébastien Sereni: A note on antisymmetric flows in graphs. Eur. J. Comb. 31(1): 320-324 (2010)
- [j24]Zdenek Dvorak, Serguei Norine: Small graph classes and bounded expansion. J. Comb. Theory, Ser. B 100(2): 171-175 (2010)
- [j23]Zdenek Dvorak, Bojan Mohar: Crossing-critical graphs with large maximum degree. J. Comb. Theory, Ser. B 100(4): 413-417 (2010)
- [j22]Zdenek Dvorak, Bojan Mohar: Spectral radius of finite and infinite planar graphs and of graphs of bounded genus. J. Comb. Theory, Ser. B 100(6): 729-739 (2010)
- [j21]Zdenek Dvorak, Daniel Král', Riste Skrekovski: Non-rainbow colorings of 3-, 4- and 5-connected plane graphs. Journal of Graph Theory 63(2): 129-145 (2010)
- [j20]Zdenek Dvorak: On recognizing graphs by numbers of homomorphisms. Journal of Graph Theory 64(4): 330-342 (2010)
- [j19]Zdenek Dvorak, Bernard Lidický, Riste Skrekovski: 3-Choosability of Triangle-Free Planar Graphs with Constraints on 4-Cycles. SIAM J. Discrete Math. 24(3): 934-945 (2010)
- [c11]Zdenek Dvorak, Daniel Král, Robin Thomas: Deciding First-Order Properties for Sparse Graphs. FOCS 2010: 133-142
- [i3]Zdenek Dvorak, Daniel Král, Robin Thomas: Three-coloring triangle-free graphs on surfaces I. Extending a coloring to a disk with one triangle. CoRR abs/1010.2472 (2010)
- [i2]Zdenek Dvorak, Bojan Mohar: Spectrally degenerate graphs: Hereditary case. CoRR abs/1010.3367 (2010)
2000 – 2009
- 2009
- [j18]Zdenek Dvorak, Daniel Král, Pavel Nejedlý, Riste Skrekovski: Distance constrained labelings of planar graphs with no short cycles. Discrete Applied Mathematics 157(12): 2634-2645 (2009)
- [j17]Zdenek Dvorak: Two-factors in orientated graphs with forbidden transitions. Discrete Mathematics 309(1): 104-112 (2009)
- [j16]Zdenek Dvorak, Bernard Lidický, Riste Skrekovski: Planar graphs without 3-, 7-, and 8-cycles are 3-choosable. Discrete Mathematics 309(20): 5899-5904 (2009)
- [j15]Zdenek Dvorak, Bojan Mohar: Spectral radius of finite and infinite planar graphs and of graphs of bounded genus (extended abstract). Electronic Notes in Discrete Mathematics 34: 101-105 (2009)
- [j14]Zdenek Dvorak, Stanislav Jendrol, Daniel Král, Gyula Pap: Matchings and Nonrainbow Colorings. SIAM J. Discrete Math. 23(1): 344-348 (2009)
- [j13]Zdenek Dvorak, Riste Skrekovski: k-Chromatic Number of Graphs on Surfaces. SIAM J. Discrete Math. 23(1): 477-486 (2009)
- [c10]Zdenek Dvorak, Daniel Král, Robin Thomas: Coloring triangle-free graphs on surfaces. SODA 2009: 120-129
- [c9]Zdenek Dvorak, Ken-ichi Kawarabayashi, Robin Thomas: Three-coloring triangle-free planar graphs in linear time. SODA 2009: 1176-1182
- [c8]
- 2008
- [j12]Zdenek Dvorak, Daniel Král, Pavel Nejedlý, Riste Skrekovski: Coloring squares of planar graphs with girth six. Eur. J. Comb. 29(4): 838-849 (2008)
- [j11]Zdenek Dvorak: On forbidden subdivision characterizations of graph classes. Eur. J. Comb. 29(5): 1321-1332 (2008)
- [j10]Zdenek Dvorak, Riste Skrekovski, Martin Tancer: List-Coloring Squares of Sparse Subcubic Graphs. SIAM J. Discrete Math. 22(1): 139-159 (2008)
- [j9]Zdenek 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
- [j8]Jakub Cerný, Zdenek Dvorak, Vít Jelínek, Jan Kára: Noncrossing Hamiltonian paths in geometric graphs. Discrete Applied Mathematics 155(9): 1096-1105 (2007)
- [j7]Zdenek Dvorak, Riste Skrekovski, T. Valla: Four gravity results. Discrete Mathematics 307(2): 181-190 (2007)
- [j6]Zdenek 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)
- [c7]Zdenek Dvorak, Daniel Král, Robin Thomas: Coloring Triangle-Free Graphs on Surfaces. ISAAC 2007: 2-4
- 2006
- [j5]Zdenek Dvorak, Tomás Kaiser, Daniel Král: Eulerian colorings and the bipartizing matchings conjecture of Fleischner. Eur. J. Comb. 27(7): 1088-1101 (2006)
- [j4]Zdenek Dvorak, Riste Skrekovski: A Theorem About a Contractible and Light Edge. SIAM J. Discrete Math. 20(1): 55-61 (2006)
- 2005
- [j3]Zdenek Dvorak, Daniel Král, Riste Skrekovski: Coloring face hypergraphs on surfaces. Eur. J. Comb. 26(1): 95-110 (2005)
- [j2]Zdenek Dvorak, Daniel Král, Ondrej Pangrác: Locally consistent constraint satisfaction problems. Theor. Comput. Sci. 348(2-3): 187-206 (2005)
- [c6]
- [c5]Zdenek 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
- 2004
- [c4]Zdenek Dvorak, Daniel Král, Ondrej Pangrác: Locally Consistent Constraint Satisfaction Problems: (Extended Abstract). ICALP 2004: 469-480
- [c3]Zdenek Dvorak, Jan Kára, Daniel Král, Ondrej Pangrác: An Algorithm for Cyclic Edge Connectivity of Cubic Graphs. SWAT 2004: 236-247
- [i1]Zdenek Dvorak, Daniel Král, Ondrej Pangrác: Locally consistent constraint satisfaction problems. Electronic Colloquium on Computational Complexity (ECCC)(051) (2004)
- 2003
- [c2]Jakub Cerný, Zdenek Dvorak, Vít Jelínek, Jan Kára: Noncrossing Hamiltonian Paths in Geometric Graphs. Graph Drawing 2003: 86-97
- 2002
- [c1]Zdenek Dvorak, Jan Kára, Daniel Král, Ondrej Pangrác: Complexity of Pattern Coloring of Cycle Systems. WG 2002: 164-175
- 2001
- [j1]
Coauthor Index
data released under the ODC-BY 1.0 license. See also our legal information page
last updated on 2013-06-03 20:14 CEST by the dblp team