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

Daniel Král Home Page Coauthor index pubzone.org

Daniel Král'

List of publications from the DBLP Bibliography Server - FAQ
Ask others: ACM DL/Guide - CiteSeerX - CSB - MetaPress - Google - Bing - Yahoo

DBLP keys2012
122Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLDaniel Král', Chun-Hung Liu, Jean-Sébastien Sereni, Peter Whalen, Zelealem Yilma: A new bound for the 2/3 conjecture CoRR abs/1204.2519: (2012)
121Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLDaniel Král': Decomposition width of matroids. Discrete Applied Mathematics 160(6): 913-923 (2012)
120Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLJernej Azarija, Rok Erman, Daniel Král', Matjaz Krnc, Ladislav Stacho: Cyclic colorings of plane graphs with independent faces. Eur. J. Comb. 33(3): 294-301 (2012)
119Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLZdenek Dvorak, Daniel Král': Classes of graphs with small rank decompositions are X-bounded. Eur. J. Comb. 33(4): 679-683 (2012)
118Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLLouis Esperet, Frantisek Kardos, Daniel Král': A superlinear bound on the number of perfect matchings in cubic bridgeless graphs. Eur. J. Comb. 33(5): 767-798 (2012)
117Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLDaniel Král', Petr Skoda, Jan Volec: Domination number of cubic graphs with large girth. Journal of Graph Theory 69(2): 131-142 (2012)
2011
116Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLTomás Gavenciak, Daniel Král, Sang-il Oum: Deciding first order logic properties of matroids CoRR abs/1108.5457: (2011)
115Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLZdenek Dvorak, Daniel Král, Robin Thomas: Testing first-order properties for subclasses of sparse graphs CoRR abs/1109.5036: (2011)
114Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLPavel Klavík, Daniel Král', Lukás Mach: Triangles in arrangements of points and lines in the plane. J. Comb. Theory, Ser. A 118(3): 1140-1142 (2011)
113Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLTomás Kaiser, Andrew King, Daniel Král': Fractional total colourings of graphs of high girth. J. Comb. Theory, Ser. B 101(6): 383-402 (2011)
112Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLManuel Bodirsky, Daniel Král': Limit Behavior of Locally Consistent Constraint Satisfaction Problems. SIAM J. Discrete Math. 25(2): 916-933 (2011)
111Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLFrantisek Kardos, Daniel Král', Jan Volec: Fractional colorings of cubic graphs with large girth. SIAM J. Discrete Math. 25(3): 1454-1476 (2011)
2010
110Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLZdenek Dvorak, Daniel Král, Robin Thomas: Deciding First-Order Properties for Sparse Graphs. FOCS 2010: 133-142
109Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLDaniel Král': Decomposition Width of Matroids. ICALP (1) 2010: 55-66
108Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLZdenek 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)
107Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLJan Hladký, Daniel Král', Uwe Schauz: Brooks' Theorem via the Alon-Tarsi Theorem. Discrete Mathematics 310(23): 3426-3428 (2010)
106Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLZdenek 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)
105Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLZdenek Dvorak, Jan Kára, Daniel Král', Ondrej Pangrác: Pattern Hypergraphs. Electr. J. Comb. 17(1): (2010)
104Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLZdenek 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)
103Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLFrédéric Havet, Daniel Král', Jean-Sébastien Sereni, Riste Skrekovski: Facial colorings using Hall's Theorem. Eur. J. Comb. 31(3): 1001-1019 (2010)
102Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLLouis Esperet, Daniel Král', Petr Skoda, Riste Skrekovski: An improved linear bound on the number of perfect matchings in cubic graphs. Eur. J. Comb. 31(5): 1316-1334 (2010)
101Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLDaniel Král', Serguei Norine, Ondrej Pangrác: Markov bases of binary graph models of K4-minor free graphs. J. Comb. Theory, Ser. A 117(6): 759-765 (2010)
100Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLDaniel Král', Edita Mácajová, Ján Mazák, Jean-Sébastien Sereni: Circular edge-colorings of cubic graphs with girth six. J. Comb. Theory, Ser. B 100(4): 351-358 (2010)
99Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLAlexandr V. Kostochka, Daniel Král', Jean-Sébastien Sereni, Michael Stiebitz: Graphs with bounded tree-width and large odd-girth are almost bipartite. J. Comb. Theory, Ser. B 100(6): 554-559 (2010)
98Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLZdenek 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)
97Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLDaniel Král', Ladislav Stacho: Coloring plane graphs with independent crossings. Journal of Graph Theory 64(3): 184-205 (2010)
96Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLTomás Kaiser, Daniel Král', Bernard Lidický, Pavel Nejedlý, Robert Sámal: Short Cycle Covers of Graphs with Minimum Degree Three. SIAM J. Discrete Math. 24(1): 330-355 (2010)
95Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLFrantisek Kardos, Daniel Král', Jean-Sébastien Sereni: The Last Fraction of a Fractional Conjecture. SIAM J. Discrete Math. 24(2): 699-707 (2010)
2009
94Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLZdenek Dvorak, Daniel Král, Robin Thomas: Coloring triangle-free graphs on surfaces. SODA 2009: 120-129
93Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLZdenek Dvorak, Daniel Král: Algorithms for Classes of Graphs with Bounded Expansion. WG 2009: 17-32
92Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLDaniel Král: Decomposition width - a new width parameter for matroids CoRR abs/0904.2785: (2009)
91Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLZdenek 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)
90Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLJerrold R. Griggs, Daniel Král: Graph labellings with variable weights, a survey. Discrete Applied Mathematics 157(12): 2646-2658 (2009)
89Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLDaniel Král, Pavel Nejedlý: Distance constrained labelings of K4-minor free graphs. Discrete Mathematics 309(18): 5745-5756 (2009)
88Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLVeselin Jungic, Tomás Kaiser, Daniel Král': A Note on Edge-Colourings Avoiding Rainbow K4 and Monochromatic Km. Electr. J. Comb. 16(1): (2009)
87Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLDaniel Král', Douglas B. West: Chromatic Number for a Generalization of Cartesian Product Graphs. Electr. J. Comb. 16(1): (2009)
86Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLLouis Esperet, Frantisek Kardos, Daniel Král: Cubic bridgeless graphs have more than a linear number of perfect matchings. Electronic Notes in Discrete Mathematics 34: 411-415 (2009)
85Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLDaniel Král, Edita Mácajová, Ján Mazák, Jean-Sébastien Sereni: Circular edge-colorings of cubic graphs with girth six. Electronic Notes in Discrete Mathematics 34: 525-529 (2009)
84Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLJan Hladký, Daniel Král, Sergey Norin: Counting flags in triangle-free digraphs. Electronic Notes in Discrete Mathematics 34: 621-625 (2009)
83Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLDaniel 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)
82Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLDaniel Král, Oriol Serra, Lluís Vena: A combinatorial proof of the Removal Lemma for Groups. J. Comb. Theory, Ser. A 116(4): 971-978 (2009)
81Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLZdenek Dvorak, Stanislav Jendrol, Daniel Král, Gyula Pap: Matchings and Nonrainbow Colorings. SIAM J. Discrete Math. 23(1): 344-348 (2009)
80Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLKen-ichi Kawarabayashi, Daniel Král, Jan Kyncl, Bernard Lidický: 6-Critical Graphs on the Klein Bottle. SIAM J. Discrete Math. 23(1): 372-383 (2009)
79Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLRok Erman, Suzana Jurecic, Daniel Král, Kris Stopar, Nik Stopar: Optimal Real Number Graph Labellings of a Subfamily of Kneser Graphs. SIAM J. Discrete Math. 23(3): 1372-1381 (2009)
78Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLDaniel Král, Jean-Sébastien Sereni, Michael Stiebitz: A New Lower Bound on the Number of Perfect Matchings in Cubic Graphs. SIAM J. Discrete Math. 23(3): 1465-1483 (2009)
77Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLDaniel Král: Polynomial-Size Binary Decision Diagrams for the Exactly Half-d-Hyperclique Problem Reading Each Input Bit Twice. Theory Comput. Syst. 45(1): 27-42 (2009)
2008
76Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLDaniel Král, Robin Thomas: Coloring even-faced graphs in the torus and the Klein bottle. Combinatorica 28(3): 325-341 (2008)
75Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLDaniel Král, Jiri Sgall, Tomás Tichý: Randomized strategies for the plurality problem. Discrete Applied Mathematics 156(17): 3305-3311 (2008)
74Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLNathan 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)
73Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLZdenek Dvorak, Daniel Král, Pavel Nejedlý, Riste Skrekovski: Coloring squares of planar graphs with girth six. Eur. J. Comb. 29(4): 838-849 (2008)
72Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLDaniel Král, Ladislav Stacho: Hamiltonian threshold for strong products of graphs. Journal of Graph Theory 58(4): 314-328 (2008)
71Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLJan Hladký, Daniel Král, Jean-Sébastien Sereni, Michael Stiebitz: List colorings with measurable sets. Journal of Graph Theory 59(3): 229-238 (2008)
70Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLDaniel Král, Matej Stehlík: Coloring of Triangle-Free Graphs on the Double Torus. SIAM J. Discrete Math. 22(2): 541-553 (2008)
69Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLDaniel Král, Petr Skoda: Bounds for the Real Number Graph Labellings and Application to Labellings of the Triangular Lattice. SIAM J. Discrete Math. 22(4): 1559-1569 (2008)
2007
68Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLZdenek Dvorak, Daniel Král, Robin Thomas: Coloring Triangle-Free Graphs on Surfaces. ISAAC 2007: 2-4
67Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLDaniel Král: Computing Representations of Matroids of Bounded Branch-Width. STACS 2007: 224-235
66Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLDaniel Král: Mixed hypergraphs and other coloring problems. Discrete Mathematics 307(7-8): 923-938 (2007)
65Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLDaniel Král, Pavel Nejedlý: Distance Constrained Labelings of K4-minor Free Graphs. Electronic Notes in Discrete Mathematics 28: 549-556 (2007)
64Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLDaniel 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)
63Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLDaniel 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)
62Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLDaniel Král, Tomás Madaras, Riste Skrekovski: Cyclic, diagonal and facial colorings - a missing case. Eur. J. Comb. 28(6): 1637-1639 (2007)
61Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLPeter 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)
60Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLTomá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)
59Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLDaniel Král, Ladislav Stacho: Closure for the property of having a hamiltonian prism. Journal of Graph Theory 54(3): 209-220 (2007)
58Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLTomás Kaiser, Daniel Král, Ladislav Stacho: Tough spiders. Journal of Graph Theory 56(1): 23-40 (2007)
57Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLTomá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)
56Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLZdenek 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)
55Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLRobert 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
54Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLVeselin Jungic, Daniel Král, Riste Skrekovski: Colorings Of Plane Graphs With No Rainbow Faces. Combinatorica 26(2): 169-182 (2006)
53Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLJan Kára, Daniel Král: Free binary decision diagrams for the computation of EARn. Computational Complexity 15(1): 40-61 (2006)
52Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLDaniel Král, Jan Kratochvíl, Andrzej Proskurowski, Heinz-Jürgen Voss: Coloring mixed hypertrees. Discrete Applied Mathematics 154(4): 660-672 (2006)
51Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLMieczyslaw Borowiecki, Stanislav Jendrol, Daniel Král, Jozef Miskuf: List coloring of Cartesian products of graphs. Discrete Mathematics 306(16): 1955-1958 (2006)
50Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLMohammad Ghebleh, Daniel Král, Serguei Norine, Robin Thomas: The Circular Chromatic Index of Flower Snarks. Electr. J. Comb. 13(1): (2006)
49Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLZdenek Dvorak, Tomás Kaiser, Daniel Král: Eulerian colorings and the bipartizing matchings conjecture of Fleischner. Eur. J. Comb. 27(7): 1088-1101 (2006)
48Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLDaniel Král: Extending partial 5-colorings and 6-colorings in planar graphs. J. Comb. Theory, Ser. B 96(1): 100-110 (2006)
47Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLDaniel 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)
46Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLDaniel 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)
45Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLDaniel Král: The Channel Assignment Problem with Variable Weights. SIAM J. Discrete Math. 20(3): 690-704 (2006)
2005
44Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLDaniel Král, Ondrej Pangrác: An Asymptotically Optimal Linear-Time Algorithm for Locally Consistent Constraint Satisfaction Problems. MFCS 2005: 603-614
43Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLTomás Feder, Pavol Hell, Daniel Král, Jiri Sgall: Two algorithms for general list matrix partitions. SODA 2005: 870-876
42Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLZdenek 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
41Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLManuel Bodirsky, Daniel Král: Locally Consistent Constraint Satisfaction Problems with Binary Constraints. WG 2005: 295-306
40Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLDaniel Král: An exact algorithm for the channel assignment problem. Discrete Applied Mathematics 145(2): 326-331 (2005)
39Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLTomás Kaiser, Daniel Král, Serguei Norine: Unions of perfect matchings in cubic graphs. Electronic Notes in Discrete Mathematics 22: 341-345 (2005)
38Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLZdenek Dvorak, Daniel Král, Riste Skrekovski: Coloring face hypergraphs on surfaces. Eur. J. Comb. 26(1): 95-110 (2005)
37Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLDaniel Král, Tomás Madaras, Riste Skrekovski: Cyclic, diagonal and facial colorings. Eur. J. Comb. 26(3-4): 473-490 (2005)
36Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLDaniel 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)
35Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLDaniel Král, Jiri Sgall: Coloring graphs from lists with bounded size of their union. Journal of Graph Theory 49(3): 177-186 (2005)
34Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLDaniel Král, Ondrej Pangrác, Heinz-Jürgen Voss: A note on group colorings. Journal of Graph Theory 50(2): 123-129 (2005)
33Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLJirí 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)
32Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLZdenek Dvorak, Daniel Král, Ondrej Pangrác: Locally consistent constraint satisfaction problems. Theor. Comput. Sci. 348(2-3): 187-206 (2005)
31Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLDaniel Král: Group coloring is Pi2P-complete. Theor. Comput. Sci. 349(1): 99-111 (2005)
2004
30Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLZdenek Dvorak, Daniel Král, Ondrej Pangrác: Locally Consistent Constraint Satisfaction Problems: (Extended Abstract). ICALP 2004: 469-480
29Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLDaniel Král, Pavel Nejedlý: Group Coloring and List Group Coloring Are Pi2P-Complete (Extended Abstract). MFCS 2004: 274-286
28Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLDaniel Král: Locally satisfiable formulas. SODA 2004: 330-339
27Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLZdenek Dvorak, Jan Kára, Daniel Král, Ondrej Pangrác: An Algorithm for Cyclic Edge Connectivity of Cubic Graphs. SWAT 2004: 236-247
26Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLDaniel Král: On maximum face-constrained coloring of plane graphs with no short face cycles. Discrete Mathematics 277(1-3): 301-307 (2004)
25Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLDaniel Král, Jan Kratochvíl, Heinz-Jürgen Voss: Mixed hypercacti. Discrete Mathematics 286(1-2): 99-113 (2004)
24Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLDaniel Král: Hajós' theorem for list coloring. Discrete Mathematics 287(1-3): 161-163 (2004)
23Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLDaniel Král: On Feasible Sets of Mixed Hypergraphs. Electr. J. Comb. 11(1): (2004)
22Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLZdenek Dvorak, Daniel Král, Ondrej Pangrác: Locally consistent constraint satisfaction problems Electronic Colloquium on Computational Complexity (ECCC)(051): (2004)
21Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLDaniel Král, Riste Skrekovski: Borodin's conjecture on diagonal coloring is false. Eur. J. Comb. 25(6): 813-816 (2004)
20Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLDaniel Král, Jana Maxová, Pavel Podbrdský, Robert Sámal: Pancyclicity of Strong Products of Graphs. Graphs and Combinatorics 20(1): 91-104 (2004)
19Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLDaniel Král, Heinz-Jürgen Voss: Edge-disjoint odd cycles in planar graphs. J. Comb. Theory, Ser. B 90(1): 107-120 (2004)
18Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLTomás Kaiser, Daniel Král, Riste Skrekovski: A revival of the girth conjecture. J. Comb. Theory, Ser. B 92(1): 41-53 (2004)
17Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLDaniel Král: Coloring Powers of Chordal Graphs. SIAM J. Discrete Math. 18(3): 451-461 (2004)
16Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLDaniel 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
15no EE pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLJan Kára, Daniel Král: Minimum Degree and the Number of Chords. Ars Comb. 68: (2003)
14Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLDaniel Král: Locally satisfiable formulas Electronic Colloquium on Computational Complexity (ECCC)(050): (2003)
13Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLJan Kára, Daniel Král: Free Binary Decision Diagrams for Computation of EARn Electronic Colloquium on Computational Complexity (ECCC)(061): (2003)
12Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLDaniel Král, Riste Skrekovski: A Theorem about the Channel Assignment Problem. SIAM J. Discrete Math. 16(3): 426-437 (2003)
11Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLDaniel 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
10Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLJan Kára, Daniel Král: Optimal Free Binary Decision Diagrams for Computation of EARn. MFCS 2002: 411-422
9Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLZdenek Dvorak, Jan Kára, Daniel Král, Ondrej Pangrác: Complexity of Pattern Coloring of Cycle Systems. WG 2002: 164-175
2001
8Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLDaniel Král: On Complexity of Colouring Mixed Hypertrees. FCT 2001: 516-524
7Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLJakub Cerný, Daniel Král, Helena Nyklová, Ondrej Pangrác: On Intersection Graphs of Segments with Prescribed Slopes. Graph Drawing 2001: 261-271
6Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLDaniel Král, Jan Kratochvíl, Heinz-Jürgen Voss: Complexity Note on Mixed Hypergraphs. MFCS 2001: 474-486
5Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLDaniel Král, Jan Kratochvíl, Zsolt Tuza, Gerhard J. Woeginger: Complexity of Coloring Graphs without Forbidden Induced Subgraphs. WG 2001: 254-262
4Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLZdenek Dvorak, Daniel Král: On Planar Mixed Hypergraphs. Electr. J. Comb. 8(1): (2001)
2000
3Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLDaniel Král: Algebraic an Uniqueness Properties of Parity Ordered Binary Decision Diagrams and Their Generalization. MFCS 2000: 477-487
2Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLDaniel Král, Jan Kratochvíl, Andrzej Proskurowski, Heinz-Jürgen Voss: Coloring Mixed Hypertrees. WG 2000: 279-289
1Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLDaniel 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

1Jernej Azarija [120]
2Robert Babilon [55]
3Peter Bella [61]
4Manuel Bodirsky [41] [112]
5Mieczyslaw Borowiecki [51]
6Jakub Cerný [7]
7Nathan Chenette [74]
8Zdenek Dvorak [4] [9] [22] [27] [30] [32] [38] [42] [49] [56] [68] [73] [81] [91] [93] [94] [98] [104] [105] [106] [108] [110] [115] [119]
9Rok Erman [79] [120]
10Louis Esperet [86] [102] [118]
11Tomás Feder [43]
12Jirí Fiala [33]
13Tomás Gavenciak [116]
14Mohammad Ghebleh [50]
15Jerrold R. Griggs [90]
16Frédéric Havet [103]
17Pavol Hell [43]
18Jan Hladký [71] [84] [107]
19Vít Jelínek (Vítek Jelínek) [42] [55] [56]
20Stanislav Jendrol [51] [81]
21Veselin Jungic [54] [88]
22Suzana Jurecic [79]
23Tomás Kaiser [18] [39] [49] [57] [58] [60] [88] [96] [104] [113]
24Jan Kára [9] [10] [13] [15] [27] [53] [105]
25Frantisek Kardos [86] [95] [111] [118]
26Ken-ichi Kawarabayashi [74] [80]
27Andrew King [113]
28Pavel Klavík [114]
29Alexandr V. Kostochka [99]
30Jan Kratochvíl [2] [5] [6] [11] [25] [52]
31Matjaz Krnc [120]
32Jan Kyncl [42] [56] [74] [80]
33Bernard Lidický [74] [80] [96]
34Chun-Hung Liu [122]
35Edita Mácajová [63] [64] [83] [85] [100]
36Lukás Mach [114]
37Tomás Madaras [37] [62]
38Vladan Majerech [16]
39Jana Maxová [20] [36]
40Ján Mazák [85] [100]
41Jozef Miskuf [51]
42Bojan Mohar [61]
43Pavel Nejedlý [29] [65] [73] [89] [91] [96]
44Sergey Norin [84]
45Serguei Norine [39] [50] [101]
46Helena Nyklová [7]
47Sang-il Oum [116]
48Ondrej Pangrác [7] [9] [22] [27] [30] [32] [34] [44] [83] [101] [105]
49Gyula Pap [81]
50Pavel Podbrdský [20] [36]
51Attila Pór [63] [64]
52Luke Postle [74]
53Andrzej Proskurowski [2] [52]
54Katarína Quittnerová [61]
55André Raspaud [83]
56Moshe Rosenfeld [57]
57Zdenek Ryjácek [57]
58Michael E. Saks (Michael Saks) [42] [56]
59Robert Sámal [20] [36] [96]
60Uwe Schauz [107]
61Jean-Sébastien Sereni [63] [64] [71] [78] [83] [85] [95] [99] [100] [103] [104] [122]
62Oriol Serra [82]
63Jiri Sgall [16] [35] [43] [75]
64Petr Skoda [69] [102] [117]
65Martin Skoviera [83]
66Riste Skrekovski [12] [18] [21] [33] [37] [38] [46] [47] [54] [60] [62] [73] [91] [98] [102] [103]
67Ladislav Stacho [58] [59] [72] [97] [120]
68Matej Stehlík [70]
69Michael Stiebitz [71] [78] [99]
70Kris Stopar [79]
71Nik Stopar [79]
72Noah Streib [74]
73Martin Tancer [46]
74Jakub Teska [106]
75Robin Thomas [50] [68] [74] [76] [94] [108] [110] [115]
76Tomás Tichý [16] [75]
77Zsolt Tuza [5]
78Pavel Valtr [55]
79Lluís Vena [82]
80Jan Volec [111] [117]
81Heinz-Jürgen Voss [2] [6] [11] [19] [25] [34] [52] [57]
82Douglas B. West [87]
83Peter Whalen [122]
84Gerhard J. Woeginger [5] [16]
85Carl Yerger [74]
86Zelealem Yilma [122]
87Xuding Zhu [60]

Colors in the list of coauthors

Last update Fri Jun 1 15:44:53 2012 CET by the DBLP TeamThis material is Open Data Data released under the ODC-BY 1.0 license — See also our legal information page