| 2009 |
|---|
| 78 | EE | Zdenek Dvorak,
Daniel Král,
Robin Thomas:
Coloring triangle-free graphs on surfaces.
SODA 2009: 120-129 |
| 77 | EE | Daniel Král:
Decomposition width - a new width parameter for matroids
CoRR abs/0904.2785: (2009) |
| 76 | EE | Daniel 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 |
|---|
| 75 | EE | Daniel Král,
Robin Thomas:
Coloring even-faced graphs in the torus and the Klein bottle.
Combinatorica 28(3): 325-341 (2008) |
| 74 | EE | Daniel Král,
Jiri Sgall,
Tomás Tichý:
Randomized strategies for the plurality problem.
Discrete Applied Mathematics 156(17): 3305-3311 (2008) |
| 73 | EE | Nathan 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) |
| 72 | EE | 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) |
| 71 | EE | Daniel Král,
Ladislav Stacho:
Hamiltonian threshold for strong products of graphs.
Journal of Graph Theory 58(4): 314-328 (2008) |
| 70 | EE | Jan Hladký,
Daniel Král,
Jean-Sébastien Sereni,
Michael Stiebitz:
List colorings with measurable sets.
Journal of Graph Theory 59(3): 229-238 (2008) |
| 69 | EE | Daniel Král,
Matej Stehlík:
Coloring of Triangle-Free Graphs on the Double Torus.
SIAM J. Discrete Math. 22(2): 541-553 (2008) |
| 2007 |
|---|
| 68 | EE | Zdenek Dvorak,
Daniel Král,
Robin Thomas:
Coloring Triangle-Free Graphs on Surfaces.
ISAAC 2007: 2-4 |
| 67 | EE | Daniel Král:
Computing Representations of Matroids of Bounded Branch-Width.
STACS 2007: 224-235 |
| 66 | EE | Daniel Král:
Mixed hypergraphs and other coloring problems.
Discrete Mathematics 307(7-8): 923-938 (2007) |
| 65 | EE | Daniel Král,
Pavel Nejedlý:
Distance Constrained Labelings of K4-minor Free Graphs.
Electronic Notes in Discrete Mathematics 28: 549-556 (2007) |
| 64 | EE | Daniel 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) |
| 63 | EE | Daniel 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) |
| 62 | EE | Daniel Král,
Tomás Madaras,
Riste Skrekovski:
Cyclic, diagonal and facial colorings - a missing case.
Eur. J. Comb. 28(6): 1637-1639 (2007) |
| 61 | EE | Peter 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) |
| 60 | EE | Tomá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) |
| 59 | EE | Daniel Král,
Ladislav Stacho:
Closure for the property of having a hamiltonian prism.
Journal of Graph Theory 54(3): 209-220 (2007) |
| 58 | EE | Tomás Kaiser,
Daniel Král,
Ladislav Stacho:
Tough spiders.
Journal of Graph Theory 56(1): 23-40 (2007) |
| 57 | EE | Tomá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) |
| 56 | EE | 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) |
| 55 | EE | Robert 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 |
|---|
| 54 | EE | Veselin Jungic,
Daniel Král,
Riste Skrekovski:
Colorings Of Plane Graphs With No Rainbow Faces.
Combinatorica 26(2): 169-182 (2006) |
| 53 | EE | Jan Kára,
Daniel Král:
Free binary decision diagrams for the computation of EARn.
Computational Complexity 15(1): 40-61 (2006) |
| 52 | EE | Daniel Král,
Jan Kratochvíl,
Andrzej Proskurowski,
Heinz-Jürgen Voss:
Coloring mixed hypertrees.
Discrete Applied Mathematics 154(4): 660-672 (2006) |
| 51 | EE | Mieczyslaw Borowiecki,
Stanislav Jendrol,
Daniel Král,
Jozef Miskuf:
List coloring of Cartesian products of graphs.
Discrete Mathematics 306(16): 1955-1958 (2006) |
| 50 | EE | Mohammad Ghebleh,
Daniel Král,
Serguei Norine,
Robin Thomas:
The Circular Chromatic Index of Flower Snarks.
Electr. J. Comb. 13(1): (2006) |
| 49 | EE | 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) |
| 48 | EE | Daniel Král:
Extending partial 5-colorings and 6-colorings in planar graphs.
J. Comb. Theory, Ser. B 96(1): 100-110 (2006) |
| 47 | EE | Daniel 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) |
| 46 | EE | Daniel 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) |
| 45 | EE | Daniel Král:
The Channel Assignment Problem with Variable Weights.
SIAM J. Discrete Math. 20(3): 690-704 (2006) |
| 2005 |
|---|
| 44 | EE | Daniel Král,
Ondrej Pangrác:
An Asymptotically Optimal Linear-Time Algorithm for Locally Consistent Constraint Satisfaction Problems.
MFCS 2005: 603-614 |
| 43 | EE | Tomás Feder,
Pavol Hell,
Daniel Král,
Jiri Sgall:
Two algorithms for general list matrix partitions.
SODA 2005: 870-876 |
| 42 | EE | 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 |
| 41 | EE | Manuel Bodirsky,
Daniel Král:
Locally Consistent Constraint Satisfaction Problems with Binary Constraints.
WG 2005: 295-306 |
| 40 | EE | Daniel Král:
An exact algorithm for the channel assignment problem.
Discrete Applied Mathematics 145(2): 326-331 (2005) |
| 39 | EE | Tomás Kaiser,
Daniel Král,
Serguei Norine:
Unions of perfect matchings in cubic graphs.
Electronic Notes in Discrete Mathematics 22: 341-345 (2005) |
| 38 | EE | Zdenek Dvorak,
Daniel Král,
Riste Skrekovski:
Coloring face hypergraphs on surfaces.
Eur. J. Comb. 26(1): 95-110 (2005) |
| 37 | EE | Daniel Král,
Tomás Madaras,
Riste Skrekovski:
Cyclic, diagonal and facial colorings.
Eur. J. Comb. 26(3-4): 473-490 (2005) |
| 36 | EE | Daniel 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) |
| 35 | EE | Daniel Král,
Jiri Sgall:
Coloring graphs from lists with bounded size of their union.
Journal of Graph Theory 49(3): 177-186 (2005) |
| 34 | EE | Daniel Král,
Ondrej Pangrác,
Heinz-Jürgen Voss:
A note on group colorings.
Journal of Graph Theory 50(2): 123-129 (2005) |
| 33 | EE | Jirí 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) |
| 32 | EE | Zdenek Dvorak,
Daniel Král,
Ondrej Pangrác:
Locally consistent constraint satisfaction problems.
Theor. Comput. Sci. 348(2-3): 187-206 (2005) |
| 31 | EE | Daniel Král:
Group coloring is Pi2P-complete.
Theor. Comput. Sci. 349(1): 99-111 (2005) |
| 2004 |
|---|
| 30 | EE | Zdenek Dvorak,
Daniel Král,
Ondrej Pangrác:
Locally Consistent Constraint Satisfaction Problems: (Extended Abstract).
ICALP 2004: 469-480 |
| 29 | EE | Daniel Král,
Pavel Nejedlý:
Group Coloring and List Group Coloring Are Pi2P-Complete (Extended Abstract).
MFCS 2004: 274-286 |
| 28 | EE | Daniel Král:
Locally satisfiable formulas.
SODA 2004: 330-339 |
| 27 | EE | Zdenek Dvorak,
Jan Kára,
Daniel Král,
Ondrej Pangrác:
An Algorithm for Cyclic Edge Connectivity of Cubic Graphs.
SWAT 2004: 236-247 |
| 26 | EE | Daniel Král:
On maximum face-constrained coloring of plane graphs with no short face cycles.
Discrete Mathematics 277(1-3): 301-307 (2004) |
| 25 | EE | Daniel Král,
Jan Kratochvíl,
Heinz-Jürgen Voss:
Mixed hypercacti.
Discrete Mathematics 286(1-2): 99-113 (2004) |
| 24 | EE | Daniel Král:
Hajós' theorem for list coloring.
Discrete Mathematics 287(1-3): 161-163 (2004) |
| 23 | EE | Daniel Král:
On Feasible Sets of Mixed Hypergraphs.
Electr. J. Comb. 11(1): (2004) |
| 22 | EE | Zdenek Dvorak,
Daniel Král,
Ondrej Pangrác:
Locally consistent constraint satisfaction problems
Electronic Colloquium on Computational Complexity (ECCC)(051): (2004) |
| 21 | EE | Daniel Král,
Riste Skrekovski:
Borodin's conjecture on diagonal coloring is false.
Eur. J. Comb. 25(6): 813-816 (2004) |
| 20 | EE | Daniel Král,
Jana Maxová,
Pavel Podbrdský,
Robert Sámal:
Pancyclicity of Strong Products of Graphs.
Graphs and Combinatorics 20(1): 91-104 (2004) |
| 19 | EE | Daniel Král,
Heinz-Jürgen Voss:
Edge-disjoint odd cycles in planar graphs.
J. Comb. Theory, Ser. B 90(1): 107-120 (2004) |
| 18 | EE | Tomás Kaiser,
Daniel Král,
Riste Skrekovski:
A revival of the girth conjecture.
J. Comb. Theory, Ser. B 92(1): 41-53 (2004) |
| 17 | EE | Daniel Král:
Coloring Powers of Chordal Graphs.
SIAM J. Discrete Math. 18(3): 451-461 (2004) |
| 16 | EE | Daniel 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) |
| 14 | EE | Daniel Král:
Locally satisfiable formulas
Electronic Colloquium on Computational Complexity (ECCC)(050): (2003) |
| 13 | EE | Jan Kára,
Daniel Král:
Free Binary Decision Diagrams for Computation of EARn
Electronic Colloquium on Computational Complexity (ECCC)(061): (2003) |
| 12 | EE | Daniel Král,
Riste Skrekovski:
A Theorem about the Channel Assignment Problem.
SIAM J. Discrete Math. 16(3): 426-437 (2003) |
| 11 | EE | Daniel 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 |
|---|
| 10 | EE | Jan Kára,
Daniel Král:
Optimal Free Binary Decision Diagrams for Computation of EARn.
MFCS 2002: 411-422 |
| 9 | EE | Zdenek Dvorak,
Jan Kára,
Daniel Král,
Ondrej Pangrác:
Complexity of Pattern Coloring of Cycle Systems.
WG 2002: 164-175 |
| 2001 |
|---|
| 8 | EE | Daniel Král:
On Complexity of Colouring Mixed Hypertrees.
FCT 2001: 516-524 |
| 7 | EE | Jakub Cerný,
Daniel Král,
Helena Nyklová,
Ondrej Pangrác:
On Intersection Graphs of Segments with Prescribed Slopes.
Graph Drawing 2001: 261-271 |
| 6 | EE | Daniel Král,
Jan Kratochvíl,
Heinz-Jürgen Voss:
Complexity Note on Mixed Hypergraphs.
MFCS 2001: 474-486 |
| 5 | EE | Daniel Král,
Jan Kratochvíl,
Zsolt Tuza,
Gerhard J. Woeginger:
Complexity of Coloring Graphs without Forbidden Induced Subgraphs.
WG 2001: 254-262 |
| 4 | EE | Zdenek Dvorak,
Daniel Král:
On Planar Mixed Hypergraphs.
Electr. J. Comb. 8(1): (2001) |
| 2000 |
|---|
| 3 | EE | Daniel Král:
Algebraic an Uniqueness Properties of Parity Ordered Binary Decision Diagrams and Their Generalization.
MFCS 2000: 477-487 |
| 2 | EE | Daniel Král,
Jan Kratochvíl,
Andrzej Proskurowski,
Heinz-Jürgen Voss:
Coloring Mixed Hypertrees.
WG 2000: 279-289 |
| 1 | EE | Daniel Král:
Algebraic and Uniqueness Properties of Parity Ordered Binary Decision Diagrams and their Generalization
Electronic Colloquium on Computational Complexity (ECCC) 7(13): (2000) |
