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

Daniel Král

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

2009
78EEZdenek Dvorak, Daniel Král, Robin Thomas: Coloring triangle-free graphs on surfaces. SODA 2009: 120-129
77EEDaniel Král: Decomposition width - a new width parameter for matroids CoRR abs/0904.2785: (2009)
76EEDaniel Král, Edita Mácajová, Ondrej Pangrác, André Raspaud, Jean-Sébastien Sereni, Martin Skoviera: Projective, affine, and abelian colorings of cubic graphs. Eur. J. Comb. 30(1): 53-69 (2009)
2008
75EEDaniel Král, Robin Thomas: Coloring even-faced graphs in the torus and the Klein bottle. Combinatorica 28(3): 325-341 (2008)
74EEDaniel Král, Jiri Sgall, Tomás Tichý: Randomized strategies for the plurality problem. Discrete Applied Mathematics 156(17): 3305-3311 (2008)
73EENathan Chenette, Luke Postle, Noah Streib, Robin Thomas, Carl Yerger, Ken-ichi Kawarabayashi, Daniel Král, Jan Kyncl, Bernard Lidický: Six-Critical Graphs on the Klein Bottle. Electronic Notes in Discrete Mathematics 31: 235-240 (2008)
72EEZdenek Dvorak, Daniel Král, Pavel Nejedlý, Riste Skrekovski: Coloring squares of planar graphs with girth six. Eur. J. Comb. 29(4): 838-849 (2008)
71EEDaniel Král, Ladislav Stacho: Hamiltonian threshold for strong products of graphs. Journal of Graph Theory 58(4): 314-328 (2008)
70EEJan Hladký, Daniel Král, Jean-Sébastien Sereni, Michael Stiebitz: List colorings with measurable sets. Journal of Graph Theory 59(3): 229-238 (2008)
69EEDaniel Král, Matej Stehlík: Coloring of Triangle-Free Graphs on the Double Torus. SIAM J. Discrete Math. 22(2): 541-553 (2008)
2007
68EEZdenek Dvorak, Daniel Král, Robin Thomas: Coloring Triangle-Free Graphs on Surfaces. ISAAC 2007: 2-4
67EEDaniel Král: Computing Representations of Matroids of Bounded Branch-Width. STACS 2007: 224-235
66EEDaniel Král: Mixed hypergraphs and other coloring problems. Discrete Mathematics 307(7-8): 923-938 (2007)
65EEDaniel Král, Pavel Nejedlý: Distance Constrained Labelings of K4-minor Free Graphs. Electronic Notes in Discrete Mathematics 28: 549-556 (2007)
64EEDaniel Král, Edita Mácajová, Attila Pór, Jean-Sébastien Sereni: Characterization of affine Steiner triple systems and Hall triple systems. Electronic Notes in Discrete Mathematics 29: 17-21 (2007)
63EEDaniel Král, Edita Mácajová, Attila Pór, Jean-Sébastien Sereni: Edge-colorings of cubic graphs with elements of point-transitive Steiner triple systems. Electronic Notes in Discrete Mathematics 29: 23-27 (2007)
62EEDaniel Král, Tomás Madaras, Riste Skrekovski: Cyclic, diagonal and facial colorings - a missing case. Eur. J. Comb. 28(6): 1637-1639 (2007)
61EEPeter Bella, Daniel Král, Bojan Mohar, Katarína Quittnerová: Labeling planar graphs with a condition at distance two. Eur. J. Comb. 28(8): 2201-2239 (2007)
60EETomás Kaiser, Daniel Král, Riste Skrekovski, Xuding Zhu: The circular chromatic index of graphs of high girth. J. Comb. Theory, Ser. B 97(1): 1-13 (2007)
59EEDaniel Král, Ladislav Stacho: Closure for the property of having a hamiltonian prism. Journal of Graph Theory 54(3): 209-220 (2007)
58EETomás Kaiser, Daniel Král, Ladislav Stacho: Tough spiders. Journal of Graph Theory 56(1): 23-40 (2007)
57EETomás Kaiser, Zdenek Ryjácek, Daniel Král, Moshe Rosenfeld, Heinz-Jürgen Voss: Hamilton cycles in prisms. Journal of Graph Theory 56(4): 249-269 (2007)
56EEZdenek 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)
55EERobert Babilon, Vít Jelínek, Daniel Král, Pavel Valtr: Labelings of Graphs with Fixed and Variable Edge-Weights. SIAM J. Discrete Math. 21(3): 688-706 (2007)
2006
54EEVeselin Jungic, Daniel Král, Riste Skrekovski: Colorings Of Plane Graphs With No Rainbow Faces. Combinatorica 26(2): 169-182 (2006)
53EEJan Kára, Daniel Král: Free binary decision diagrams for the computation of EARn. Computational Complexity 15(1): 40-61 (2006)
52EEDaniel Král, Jan Kratochvíl, Andrzej Proskurowski, Heinz-Jürgen Voss: Coloring mixed hypertrees. Discrete Applied Mathematics 154(4): 660-672 (2006)
51EEMieczyslaw Borowiecki, Stanislav Jendrol, Daniel Král, Jozef Miskuf: List coloring of Cartesian products of graphs. Discrete Mathematics 306(16): 1955-1958 (2006)
50EEMohammad Ghebleh, Daniel Král, Serguei Norine, Robin Thomas: The Circular Chromatic Index of Flower Snarks. Electr. J. Comb. 13(1): (2006)
49EEZdenek Dvorak, Tomás Kaiser, Daniel Král: Eulerian colorings and the bipartizing matchings conjecture of Fleischner. Eur. J. Comb. 27(7): 1088-1101 (2006)
48EEDaniel Král: Extending partial 5-colorings and 6-colorings in planar graphs. J. Comb. Theory, Ser. B 96(1): 100-110 (2006)
47EEDaniel Král, Riste Skrekovski: The last excluded case of Dirac's map-color theorem for choosability. Journal of Graph Theory 51(4): 319-354 (2006)
46EEDaniel Král, Riste Skrekovski, Martin Tancer: Construction of Large Graphs with No Optimal Surjective L(2, 1)-Labelings. SIAM J. Discrete Math. 20(2): 536-543 (2006)
45EEDaniel Král: The Channel Assignment Problem with Variable Weights. SIAM J. Discrete Math. 20(3): 690-704 (2006)
2005
44EEDaniel Král, Ondrej Pangrác: An Asymptotically Optimal Linear-Time Algorithm for Locally Consistent Constraint Satisfaction Problems. MFCS 2005: 603-614
43EETomás Feder, Pavol Hell, Daniel Král, Jiri Sgall: Two algorithms for general list matrix partitions. SODA 2005: 870-876
42EEZdenek 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
41EEManuel Bodirsky, Daniel Král: Locally Consistent Constraint Satisfaction Problems with Binary Constraints. WG 2005: 295-306
40EEDaniel Král: An exact algorithm for the channel assignment problem. Discrete Applied Mathematics 145(2): 326-331 (2005)
39EETomás Kaiser, Daniel Král, Serguei Norine: Unions of perfect matchings in cubic graphs. Electronic Notes in Discrete Mathematics 22: 341-345 (2005)
38EEZdenek Dvorak, Daniel Král, Riste Skrekovski: Coloring face hypergraphs on surfaces. Eur. J. Comb. 26(1): 95-110 (2005)
37EEDaniel Král, Tomás Madaras, Riste Skrekovski: Cyclic, diagonal and facial colorings. Eur. J. Comb. 26(3-4): 473-490 (2005)
36EEDaniel Král, Jana Maxová, Robert Sámal, Pavel Podbrdský: Hamilton cycles in strong products of graphs. Journal of Graph Theory 48(4): 299-321 (2005)
35EEDaniel Král, Jiri Sgall: Coloring graphs from lists with bounded size of their union. Journal of Graph Theory 49(3): 177-186 (2005)
34EEDaniel Král, Ondrej Pangrác, Heinz-Jürgen Voss: A note on group colorings. Journal of Graph Theory 50(2): 123-129 (2005)
33EEJirí Fiala, Daniel Král, Riste Skrekovski: A Brooks-Type Theorem for the Generalized List T-Coloring. SIAM J. Discrete Math. 19(3): 588-609 (2005)
32EEZdenek Dvorak, Daniel Král, Ondrej Pangrác: Locally consistent constraint satisfaction problems. Theor. Comput. Sci. 348(2-3): 187-206 (2005)
31EEDaniel Král: Group coloring is Pi2P-complete. Theor. Comput. Sci. 349(1): 99-111 (2005)
2004
30EEZdenek Dvorak, Daniel Král, Ondrej Pangrác: Locally Consistent Constraint Satisfaction Problems: (Extended Abstract). ICALP 2004: 469-480
29EEDaniel Král, Pavel Nejedlý: Group Coloring and List Group Coloring Are Pi2P-Complete (Extended Abstract). MFCS 2004: 274-286
28EEDaniel Král: Locally satisfiable formulas. SODA 2004: 330-339
27EEZdenek Dvorak, Jan Kára, Daniel Král, Ondrej Pangrác: An Algorithm for Cyclic Edge Connectivity of Cubic Graphs. SWAT 2004: 236-247
26EEDaniel Král: On maximum face-constrained coloring of plane graphs with no short face cycles. Discrete Mathematics 277(1-3): 301-307 (2004)
25EEDaniel Král, Jan Kratochvíl, Heinz-Jürgen Voss: Mixed hypercacti. Discrete Mathematics 286(1-2): 99-113 (2004)
24EEDaniel Král: Hajós' theorem for list coloring. Discrete Mathematics 287(1-3): 161-163 (2004)
23EEDaniel Král: On Feasible Sets of Mixed Hypergraphs. Electr. J. Comb. 11(1): (2004)
22EEZdenek Dvorak, Daniel Král, Ondrej Pangrác: Locally consistent constraint satisfaction problems Electronic Colloquium on Computational Complexity (ECCC)(051): (2004)
21EEDaniel Král, Riste Skrekovski: Borodin's conjecture on diagonal coloring is false. Eur. J. Comb. 25(6): 813-816 (2004)
20EEDaniel Král, Jana Maxová, Pavel Podbrdský, Robert Sámal: Pancyclicity of Strong Products of Graphs. Graphs and Combinatorics 20(1): 91-104 (2004)
19EEDaniel Král, Heinz-Jürgen Voss: Edge-disjoint odd cycles in planar graphs. J. Comb. Theory, Ser. B 90(1): 107-120 (2004)
18EETomás Kaiser, Daniel Král, Riste Skrekovski: A revival of the girth conjecture. J. Comb. Theory, Ser. B 92(1): 41-53 (2004)
17EEDaniel Král: Coloring Powers of Chordal Graphs. SIAM J. Discrete Math. 18(3): 451-461 (2004)
16EEDaniel Král, Vladan Majerech, Jiri Sgall, Tomás Tichý, Gerhard J. Woeginger: It is tough to be a plumber. Theor. Comput. Sci. 303(3): 473-484 (2004)
2003
15 Jan Kára, Daniel Král: Minimum Degree and the Number of Chords. Ars Comb. 68: (2003)
14EEDaniel Král: Locally satisfiable formulas Electronic Colloquium on Computational Complexity (ECCC)(050): (2003)
13EEJan Kára, Daniel Král: Free Binary Decision Diagrams for Computation of EARn Electronic Colloquium on Computational Complexity (ECCC)(061): (2003)
12EEDaniel Král, Riste Skrekovski: A Theorem about the Channel Assignment Problem. SIAM J. Discrete Math. 16(3): 426-437 (2003)
11EEDaniel Král, Jan Kratochvíl, Heinz-Jürgen Voss: Mixed hypergraphs with bounded degree: edge-coloring of mixed multigraphs. Theor. Comput. Sci. 295: 263-278 (2003)
2002
10EEJan Kára, Daniel Král: Optimal Free Binary Decision Diagrams for Computation of EARn. MFCS 2002: 411-422
9EEZdenek Dvorak, Jan Kára, Daniel Král, Ondrej Pangrác: Complexity of Pattern Coloring of Cycle Systems. WG 2002: 164-175
2001
8EEDaniel Král: On Complexity of Colouring Mixed Hypertrees. FCT 2001: 516-524
7EEJakub Cerný, Daniel Král, Helena Nyklová, Ondrej Pangrác: On Intersection Graphs of Segments with Prescribed Slopes. Graph Drawing 2001: 261-271
6EEDaniel Král, Jan Kratochvíl, Heinz-Jürgen Voss: Complexity Note on Mixed Hypergraphs. MFCS 2001: 474-486
5EEDaniel Král, Jan Kratochvíl, Zsolt Tuza, Gerhard J. Woeginger: Complexity of Coloring Graphs without Forbidden Induced Subgraphs. WG 2001: 254-262
4EEZdenek Dvorak, Daniel Král: On Planar Mixed Hypergraphs. Electr. J. Comb. 8(1): (2001)
2000
3EEDaniel Král: Algebraic an Uniqueness Properties of Parity Ordered Binary Decision Diagrams and Their Generalization. MFCS 2000: 477-487
2EEDaniel Král, Jan Kratochvíl, Andrzej Proskurowski, Heinz-Jürgen Voss: Coloring Mixed Hypertrees. WG 2000: 279-289
1EEDaniel Král: Algebraic and Uniqueness Properties of Parity Ordered Binary Decision Diagrams and their Generalization Electronic Colloquium on Computational Complexity (ECCC) 7(13): (2000)

Coauthor Index

1Robert Babilon [55]
2Peter Bella [61]
3Manuel Bodirsky [41]
4Mieczyslaw Borowiecki [51]
5Jakub Cerný [7]
6Nathan Chenette [73]
7Zdenek Dvorak [4] [9] [22] [27] [30] [32] [38] [42] [49] [56] [68] [72] [78]
8Tomás Feder [43]
9Jirí Fiala [33]
10Mohammad Ghebleh [50]
11Pavol Hell [43]
12Jan Hladký [70]
13Vít Jelínek (Vítek Jelínek) [42] [55] [56]
14Stanislav Jendrol [51]
15Veselin Jungic [54]
16Tomás Kaiser [18] [39] [49] [57] [58] [60]
17Jan Kára [9] [10] [13] [15] [27] [53]
18Ken-ichi Kawarabayashi [73]
19Jan Kratochvíl [2] [5] [6] [11] [25] [52]
20Jan Kyncl [42] [56] [73]
21Bernard Lidický [73]
22Edita Mácajová [63] [64] [76]
23Tomás Madaras [37] [62]
24Vladan Majerech [16]
25Jana Maxová [20] [36]
26Jozef Miskuf [51]
27Bojan Mohar [61]
28Pavel Nejedlý [29] [65] [72]
29Serguei Norine [39] [50]
30Helena Nyklová [7]
31Ondrej Pangrác [7] [9] [22] [27] [30] [32] [34] [44] [76]
32Pavel Podbrdský [20] [36]
33Attila Pór [63] [64]
34Luke Postle [73]
35Andrzej Proskurowski [2] [52]
36Katarína Quittnerová [61]
37André Raspaud [76]
38Moshe Rosenfeld [57]
39Zdenek Ryjácek [57]
40Michael E. Saks [42] [56]
41Robert Sámal [20] [36]
42Jean-Sébastien Sereni [63] [64] [70] [76]
43Jiri Sgall [16] [35] [43] [74]
44Martin Skoviera [76]
45Riste Skrekovski [12] [18] [21] [33] [37] [38] [46] [47] [54] [60] [62] [72]
46Ladislav Stacho [58] [59] [71]
47Matej Stehlík [69]
48Michael Stiebitz [70]
49Noah Streib [73]
50Martin Tancer [46]
51Robin Thomas [50] [68] [73] [75] [78]
52Tomás Tichý [16] [74]
53Zsolt Tuza [5]
54Pavel Valtr [55]
55Heinz-Jürgen Voss [2] [6] [11] [19] [25] [34] [52] [57]
56Gerhard J. Woeginger [5] [16]
57Carl Yerger [73]
58Xuding Zhu [60]

Colors in the list of coauthors

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