Zdenek Dvorak

	2012
51		Zdenek Dvorak, Daniel Král': Classes of graphs with small rank decompositions are X-bounded. Eur. J. Comb. 33(4): 679-683 (2012)
50		Zdenek Dvorak, Archontia C. Giannopoulou, Dimitrios M. Thilikos: Forbidden graphs for tree-depth. Eur. J. Comb. 33(5): 969-979 (2012)
49		Zdenek Dvorak, Bernard Lidický, Riste Skrekovski: Bipartizing fullerenes. Eur. J. Comb. 33(6): 1286-1293 (2012)
	2011
48		Zdenek Dvorak, Ken-ichi Kawarabayashi, Robin Thomas: Three-coloring triangle-free planar graphs in linear time. ACM Transactions on Algorithms 7(4): 41 (2011)
47		Zdenek Dvorak: 3-choosability of planar graphs with (<=4)-cycles far apart CoRR abs/1101.4275: (2011)
46		Zdenek Dvorak, Daniel Král, Robin Thomas: Testing first-order properties for subclasses of sparse graphs CoRR abs/1109.5036: (2011)
45		Zdenek Dvorak: Constant-factor approximation of domination number in sparse graphs CoRR abs/1110.5190: (2011)
44		Zdenek Dvorak, Bernard Lidický, Riste Skrekovski: Randić index and the diameter of a graph. Eur. J. Comb. 32(3): 434-442 (2011)
43		Zdenek Dvorak, Bernard Lidický, Riste Skrekovski: Graphs with Two Crossings Are 5-Choosable. SIAM J. Discrete Math. 25(4): 1746-1753 (2011)
	2010
42		Zdenek Dvorak, Daniel Král, Robin Thomas: Deciding First-Order Properties for Sparse Graphs. FOCS 2010: 133-142
41		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)
40		Zdenek Dvorak, Bojan Mohar: Spectrally degenerate graphs: Hereditary case CoRR abs/1010.3367: (2010)
39		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)
38		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)
37		Zdenek Dvorak, Jan Kára, Daniel Král', Ondrej Pangrác: Pattern Hypergraphs. Electr. J. Comb. 17(1): (2010)
36		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)
35		Zdenek Dvorak, Serguei Norine: Small graph classes and bounded expansion. J. Comb. Theory, Ser. B 100(2): 171-175 (2010)
34		Zdenek Dvorak, Bojan Mohar: Crossing-critical graphs with large maximum degree. J. Comb. Theory, Ser. B 100(4): 413-417 (2010)
33		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)
32		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)
31		Zdenek Dvorak: On recognizing graphs by numbers of homomorphisms. Journal of Graph Theory 64(4): 330-342 (2010)
30		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)
	2009
29		Zdenek Dvorak, Ken-ichi Kawarabayashi, Robin Thomas: Three-coloring triangle-free planar graphs in linear time. SODA 2009: 1176-1182
28		Zdenek Dvorak, Daniel Král, Robin Thomas: Coloring triangle-free graphs on surfaces. SODA 2009: 120-129
27		Zdenek Dvorak, Daniel Král: Algorithms for Classes of Graphs with Bounded Expansion. WG 2009: 17-32
26		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)
25		Zdenek Dvorak: Two-factors in orientated graphs with forbidden transitions. Discrete Mathematics 309(1): 104-112 (2009)
24		Zdenek Dvorak, Bernard Lidický, Riste Skrekovski: Planar graphs without 3-, 7-, and 8-cycles are 3-choosable. Discrete Mathematics 309(20): 5899-5904 (2009)
23		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)
22		Zdenek Dvorak, Stanislav Jendrol, Daniel Král, Gyula Pap: Matchings and Nonrainbow Colorings. SIAM J. Discrete Math. 23(1): 344-348 (2009)
21		Zdenek Dvorak, Riste Skrekovski: k-Chromatic Number of Graphs on Surfaces. SIAM J. Discrete Math. 23(1): 477-486 (2009)
	2008
20		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)
19		Zdenek Dvorak: On forbidden subdivision characterizations of graph classes. Eur. J. Comb. 29(5): 1321-1332 (2008)
18		Zdenek Dvorak, Riste Skrekovski, Martin Tancer: List-Coloring Squares of Sparse Subcubic Graphs. SIAM J. Discrete Math. 22(1): 139-159 (2008)
17		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
16		Zdenek Dvorak, Daniel Král, Robin Thomas: Coloring Triangle-Free Graphs on Surfaces. ISAAC 2007: 2-4
15		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)
14		Zdenek Dvorak, Riste Skrekovski, T. Valla: Four gravity results. Discrete Mathematics 307(2): 181-190 (2007)
13		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)
	2006
12		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)
11		Zdenek Dvorak, Riste Skrekovski: A Theorem About a Contractible and Light Edge. SIAM J. Discrete Math. 20(1): 55-61 (2006)
	2005
10		Zdenek Dvorak, Vít Jelínek: On the Complexity of the G-Reconstruction Problem. ISAAC 2005: 196-205
9		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
8		Zdenek Dvorak, Daniel Král, Riste Skrekovski: Coloring face hypergraphs on surfaces. Eur. J. Comb. 26(1): 95-110 (2005)
7		Zdenek Dvorak, Daniel Král, Ondrej Pangrác: Locally consistent constraint satisfaction problems. Theor. Comput. Sci. 348(2-3): 187-206 (2005)
	2004
6		Zdenek Dvorak, Daniel Král, Ondrej Pangrác: Locally Consistent Constraint Satisfaction Problems: (Extended Abstract). ICALP 2004: 469-480
5		Zdenek Dvorak, Jan Kára, Daniel Král, Ondrej Pangrác: An Algorithm for Cyclic Edge Connectivity of Cubic Graphs. SWAT 2004: 236-247
4		Zdenek Dvorak, Daniel Král, Ondrej Pangrác: Locally consistent constraint satisfaction problems Electronic Colloquium on Computational Complexity (ECCC)(051): (2004)
	2003
3		Jakub Cerný, Zdenek Dvorak, Vít Jelínek, Jan Kára: Noncrossing Hamiltonian Paths in Geometric Graphs. Graph Drawing 2003: 86-97
	2002
2		Zdenek Dvorak, Jan Kára, Daniel Král, Ondrej Pangrác: Complexity of Pattern Coloring of Cycle Systems. WG 2002: 164-175
	2001
1		Zdenek Dvorak, Daniel Král: On Planar Mixed Hypergraphs. Electr. J. Comb. 8(1): (2001)

Coauthor Index

1	Hayri Ardal	[38]
2	Jakub Cerný	[3] [15]
3	Archontia C. Giannopoulou	[50]
4	Vít Jelínek (Vítek Jelínek)	[3] [9] [10] [13] [15]
5	Stanislav Jendrol	[22]
6	Veselin Jungic	[38]
7	Tomás Kaiser	[12] [36] [38]
8	Jan Kára	[2] [3] [5] [15] [37]
9	Ken-ichi Kawarabayashi	[29] [48]
10	Daniel Král (Daniel Král')	[1] [2] [4] [5] [6] [7] [8] [9] [12] [13] [16] [20] [22] [26] [27] [28] [32] [36] [37] [39] [41] [42] [46] [51]
11	Jan Kyncl	[9] [13]
12	Bernard Lidický	[24] [30] [43] [44] [49]
13	Bojan Mohar	[23] [33] [34] [40]
14	Pavel Nejedlý	[20] [26]
15	Serguei Norine	[35]
16	Ondrej Pangrác	[2] [4] [5] [6] [7] [37]
17	Gyula Pap	[22]
18	Michael E. Saks (Michael Saks)	[9] [13]
19	Jean-Sébastien Sereni	[36]
20	Riste Skrekovski	[8] [11] [14] [17] [18] [20] [21] [24] [26] [30] [32] [43] [44] [49]
21	Martin Tancer	[18]
22	Jakub Teska	[39]
23	Dimitrios M. Thilikos	[50]
24	Robin Thomas	[16] [28] [29] [41] [42] [46] [48]
25	T. Valla	[14] [17]

Colors in the list of coauthors

Last update Tue May 29 20:41:18 2012 CET by the DBLP Team — Data released under the ODC-BY 1.0 license — See also our legal information page