default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDDaniel Král
Daniel Král' – Daniel Kráľ
Person information
- unicode name: Daniel Kráľ
- affiliation: Masaryk University, Department of Computer Science, Brno, Czech Republic
- affiliation: University of Warwick, DIMAP, Coventry, UK
- affiliation (PhD 2004): Charles University, Institute for Theoretical Computer Science, Prague, Czech Republic
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
Journal Articles
- 2025
[j150]Daniel Král', Ander Lamaison:
Planar graph with twin-width seven. Eur. J. Comb. 123: 103749 (2025)- [j149]Daniel Král', Michal Pilipczuk, Sebastian Siebertz, Blair D. Sullivan:
Preface. Eur. J. Comb. 123: 103881 (2025) - 2024
- [j148]Andrzej Grzesik
, Daniel Král', Oleg Pikhurko:
Forcing generalised quasirandom graphs efficiently. Comb. Probab. Comput. 33(1): 16-31 (2024) - [j147]Zdenek Dvorák, Daniel Král', Robin Thomas:
Three-coloring triangle-free graphs on surfaces VI. 3-colorability of quadrangulations. J. Comb. Theory B 164: 517-548 (2024) - [j146]Marcin Brianski, Martin Koutecký, Daniel Král', Kristýna Pekárková, Felix Schröder:
Characterization of matrices with bounded Graver bases and depth parameters and applications to integer programming. Math. Program. 208(1): 497-531 (2024) - 2023
- [j145]Robert Hancock, Adam Kabela, Daniel Král', Taísa Martins, Roberto Parente, Fiona Skerman, Jan Volec:
No additional tournaments are quasirandom-forcing. Eur. J. Comb. 108: 103632 (2023) - [j144]Andrzej Grzesik, Daniel Král', László Miklós Lovász, Jan Volec:
Cycles of a given length in tournaments. J. Comb. Theory B 158(Part): 117-145 (2023) - [j143]Robert Hancock, Daniel Král', Matjaz Krnc, Jan Volec:
Toward characterizing locally common graphs. Random Struct. Algorithms 62(1): 181-218 (2023) - [j142]Andrzej Grzesik, Daniel Il'kovic, Bartlomiej Kielak, Daniel Král':
Quasirandom-Forcing Orientations of Cycles. SIAM J. Discret. Math. 37(4): 2689-2716 (2023) - 2022
- [j141]Daniel Král', Jonathan A. Noel, Sergey Norin, Jan Volec, Fan Wei:
Non-Bipartite K-Common Graphs. Comb. 42(1): 87-114 (2022) - [j140]Adam Kabela, Daniel Král', Jonathan A. Noel, Théo Pierron:
Density Maximizers of Layered Permutations. Electron. J. Comb. 29(3) (2022) - [j139]Jacob W. Cooper, Andrzej Grzesik, Adam Kabela, Daniel Král':
Packing and covering directed triangles asymptotically. Eur. J. Comb. 101: 103462 (2022) - [j138]Zdenek Dvorák, Daniel Král', Robin Thomas:
Three-coloring triangle-free graphs on surfaces VII. A linear-time algorithm. J. Comb. Theory B 152: 483-504 (2022) - [j137]Jacob W. Cooper, Daniel Král', Ander Lamaison, Samuel Mohr:
Quasirandom Latin squares. Random Struct. Algorithms 61(2): 298-308 (2022) - [j136]Timothy F. N. Chan, Jacob W. Cooper, Martin Koutecký, Daniel Král, Kristýna Pekárková:
Matrices of Optimal Tree-Depth and a Row-Invariant Parameterized Algorithm for Integer Programming. SIAM J. Comput. 51(3): 664-700 (2022) - 2021
- [j135]Zdenek Dvorák, Michael Hebdige, Filip Hlásek, Daniel Král', Jonathan A. Noel:
Cyclic coloring of plane graphs with maximum face size 16 and 17. Eur. J. Comb. 94: 103287 (2021) - [j134]Pablo Candela, Carlos Catalá, Robert Hancock, Adam Kabela, Daniel Král', Ander Lamaison, Lluís Vena:
Coloring graphs by translates in the circle. Eur. J. Comb. 96: 103346 (2021) - [j133]Zdenek Dvorák, Daniel Král', Robin Thomas:
Three-coloring triangle-free graphs on surfaces V. Coloring planar graphs with distant anomalies. J. Comb. Theory B 150: 244-269 (2021) - [j132]Zdenek Dvorák, Daniel Král', Robin Thomas:
Three-coloring triangle-free graphs on surfaces IV. Bounding face sizes of 4-critical graphs. J. Comb. Theory B 150: 270-304 (2021) - 2020
- [j131]Timothy F. N. Chan, Andrzej Grzesik, Daniel Král', Jonathan A. Noel:
Cycles of length three and four in tournaments. J. Comb. Theory A 175: 105276 (2020) - [j130]Zdenek Dvorák, Daniel Král', Robin Thomas:
Three-coloring triangle-free graphs on surfaces III. Graphs of girth five. J. Comb. Theory B 145: 376-432 (2020) - [j129]Richard W. Kenyon, Daniel Král', Charles Radin, Peter Winkler:
Permutations with fixed pattern densities. Random Struct. Algorithms 56(1): 220-250 (2020) - [j128]Timothy F. N. Chan, Daniel Král', Jonathan A. Noel, Yanitsa Pehova, Maryam Sharifzadeh, Jan Volec:
Characterization of quasirandom permutations by a pattern sum. Random Struct. Algorithms 57(4): 920-939 (2020) - 2019
- [j127]Daniel Král', Bernard Lidický, Taísa L. Martins, Yanitsa Pehova:
Decomposing Graphs into Edges and Triangles. Comb. Probab. Comput. 28(3): 465-472 (2019) - [j126]Daniel Král', Sergey Norin, Jan Volec:
A bound on the inducibility of cycles. J. Comb. Theory A 161: 359-363 (2019) - [j125]Daniel Král', Taísa L. Martins, Péter Pál Pach, Marcin Wrochna:
The step Sidorenko property and non-norming edge-transitive graphs. J. Comb. Theory A 162: 34-54 (2019) - 2018
- [j124]Zdenek Dvorák, Daniel Král', Robin Thomas:
Three-coloring triangle-free graphs on surfaces II. 4-critical graphs in a disk. J. Comb. Theory B 132: 1-46 (2018) - [j123]Jacob W. Cooper, Andrzej Grzesik, Daniel Král':
Optimal-size clique transversals in chordal graphs. J. Graph Theory 89(4): 479-493 (2018) - 2017
- [j122]Jan Hladký, Daniel Král', Sergey Norin:
Counting flags in triangle-free digraphs. Comb. 37(1): 49-76 (2017) - [j121]Frantisek Kardos, Daniel Král', Anita Liebenau, Lukás Mach:
First order convergence of matroids. Eur. J. Comb. 59: 150-168 (2017) - [j120]Roman Glebov, Carlos Hoppen, Tereza Klimosová, Yoshiharu Kohayakawa, Daniel Král', Hong Liu:
Densities in large permutations and parameter testing. Eur. J. Comb. 60: 89-99 (2017) - [j119]Andrzej Grzesik, Daniel Král', László Miklós Lovász:
Extremal graph theory and finite forcibility. Electron. Notes Discret. Math. 61: 541-547 (2017) - [j118]Vincent Cohen-Addad, Michael Hebdige, Daniel Král', Zhentao Li, Esteban Salgado:
Steinberg's Conjecture is false. J. Comb. Theory B 122: 452-456 (2017) - [j117]Jakub Gajarský, Petr Hlinený, Tomás Kaiser, Daniel Král', Martin Kupec, Jan Obdrzálek, Sebastian Ordyniak, Vojtech Tuma:
First order limits of sparse graphs: Plane trees and path-width. Random Struct. Algorithms 50(4): 612-635 (2017) - 2016
- [j116]Demetres Christofides, Daniel Král':
First-Order Convergence and Roots. Comb. Probab. Comput. 25(2): 213-221 (2016) - [j115]Zdenek Dvorák, Ken-ichi Kawarabayashi, Daniel Král':
Packing six T-joins in plane graphs. J. Comb. Theory B 116: 287-305 (2016) - [j114]Zdenek Dvorák, Daniel Král', Robin Thomas:
Three-coloring triangle-free graphs on surfaces I. Extending a coloring to a disk with one triangle. J. Comb. Theory B 120: 1-17 (2016) - [j113]Michael Hebdige, Daniel Král:
Third Case of the Cyclic Coloring Conjecture. SIAM J. Discret. Math. 30(1): 525-548 (2016) - 2015
- [j112]Robert Ganian, Petr Hlinený, Daniel Král, Jan Obdrzálek, Jarett Schwartz, Jakub Teska:
FO Model Checking of Interval Graphs. Log. Methods Comput. Sci. 11(4) (2015) - [j111]Michael Hebdige, Daniel Král':
Third case of the Cyclic Coloring Conjecture. Electron. Notes Discret. Math. 49: 11-15 (2015) - [j110]Jacob W. Cooper, Tomás Kaiser, Daniel Král', Jonathan A. Noel:
Weak regularity and finitely forcible graph limits. Electron. Notes Discret. Math. 49: 139-143 (2015) - [j109]Roman Glebov, Andrzej Grzesik, Tereza Klimosová, Daniel Král:
Finitely forcible graphons and permutons. J. Comb. Theory B 110: 112-135 (2015) - 2014
- [j108]David G. Ferguson, Tomás Kaiser, Daniel Král':
The fractional chromatic number of triangle-free subcubic graphs. Eur. J. Comb. 35: 184-220 (2014) - [j107]Jan van den Heuvel, Daniel Král, Martin Kupec, Jean-Sébastien Sereni, Jan Volec:
Extensions of Fractional Precolorings Show Discontinuous Behavior. J. Graph Theory 77(4): 299-329 (2014) - 2013
- [j106]Daniel Král', Chun-Hung Liu, Jean-Sébastien Sereni, Peter Whalen, Zelealem B. Yilma:
A New Bound for the 2/3 Conjecture. Comb. Probab. Comput. 22(3): 384-393 (2013) - [j105]Daniel Král', Oriol Serra, Lluís Vena:
On the removal lemma for linear systems over Abelian groups. Eur. J. Comb. 34(2): 248-259 (2013) - [j104]Roman Glebov, Daniel Král', Jan Volec:
An application of flag algebras to a problem of Erdős and Sós. Electron. Notes Discret. Math. 43: 171-177 (2013) - [j103]Zdenek Dvorák, Daniel Král, Robin Thomas:
Testing first-order properties for subclasses of sparse graphs. J. ACM 60(5): 36:1-36:24 (2013) - [j102]James Cummings, Daniel Král', Florian Pfender, Konrad Sperfeld, Andrew Treglown, Michael Young:
Monochromatic triangles in three-coloured graphs. J. Comb. Theory B 103(4): 489-503 (2013) - [j101]Hamed Hatami, Jan Hladký, Daniel Král', Serguei Norine, Alexander A. Razborov:
On the number of pentagons in triangle-free graphs. J. Comb. Theory A 120(3): 722-732 (2013) - [j100]Jan Hladký, Daniel Král', Serguei Norine:
Rank of divisors on tropical curves. J. Comb. Theory A 120(7): 1521-1538 (2013) - 2012
- [j99]Hamed Hatami, Jan Hladký, Daniel Král', Serguei Norine, Alexander A. Razborov:
Non-Three-Colourable Common Graphs Exist. Comb. Probab. Comput. 21(5): 734-742 (2012) - [j98]Daniel Král':
Decomposition width of matroids. Discret. Appl. Math. 160(6): 913-923 (2012) - [j97]Daniel Král', Lukás Mach, Jean-Sébastien Sereni:
A New Lower Bound Based on Gromov's Method of Selecting Heavily Covered Points. Discret. Comput. Geom. 48(2): 487-498 (2012) - [j96]Jernej 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) - [j95]Zdenek Dvorák, Daniel Král':
Classes of graphs with small rank decompositions are X-bounded. Eur. J. Comb. 33(4): 679-683 (2012) - [j94]Louis 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) - [j93]Daniel Král', Bojan Mohar, Atsuhiro Nakamoto, Ondrej Pangrác, Yusuke Suzuki:
Coloring Eulerian Triangulations of the Klein Bottle. Graphs Comb. 28(4): 499-530 (2012) - [j92]Daniel Král', Petr Skoda, Jan Volec:
Domination number of cubic graphs with large girth. J. Graph Theory 69(2): 131-142 (2012) - [j91]Frantisek Kardos, Daniel Král', Jan Volec:
Maximum edge-cuts in cubic graphs with large girth and in random cubic graphs. Random Struct. Algorithms 41(4): 506-520 (2012) - [j90]Daniel Král', Matjaz Krnc, Martin Kupec, Borut Luzar, Jan Volec:
Extending Fractional Precolorings. SIAM J. Discret. Math. 26(2): 647-660 (2012) - [j89]Daniel Král', Jean-Sébastien Sereni, Ladislav Stacho:
Min-Max Relations for Odd Cycles in Planar Graphs. SIAM J. Discret. Math. 26(3): 884-895 (2012) - 2011
- [j88]Tomás Kaiser, Andrew D. King, Daniel Král':
Fractional total colourings of graphs of high girth. J. Comb. Theory B 101(6): 383-402 (2011) - [j87]Pavel Klavík, Daniel Král', Lukás Mach:
Triangles in arrangements of points and lines in the plane. J. Comb. Theory A 118(3): 1140-1142 (2011) - [j86]Manuel Bodirsky, Daniel Král':
Limit Behavior of Locally Consistent Constraint Satisfaction Problems. SIAM J. Discret. Math. 25(2): 916-933 (2011) - [j85]Frantisek Kardos, Daniel Král', Jan Volec:
Fractional colorings of cubic graphs with large girth. SIAM J. Discret. Math. 25(3): 1454-1476 (2011) - 2010
- [j84]Zdenek Dvorák, Jan Kára, Daniel Král', Ondrej Pangrác:
Pattern Hypergraphs. Electron. J. Comb. 17(1) (2010) - [j83]Zdenek Dvorák, Daniel Král', Jakub Teska:
Toughness threshold for the existence of 2-walks in K4-minor-free graphs. Discret. Math. 310(3): 642-651 (2010) - [j82]Jan Hladký, Daniel Král', Uwe Schauz:
Brooks' Theorem via the Alon-Tarsi Theorem. Discret. Math. 310(23): 3426-3428 (2010) - [j81]Zdenek Dvorák, 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) - [j80]Fré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) - [j79]Louis 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) - [j78]Daniel 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 B 100(4): 351-358 (2010) - [j77]Alexandr 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 B 100(6): 554-559 (2010) - [j76]Daniel Král', Serguei Norine, Ondrej Pangrác:
Markov bases of binary graph models of K4-minor free graphs. J. Comb. Theory A 117(6): 759-765 (2010) - [j75]Zdenek Dvorák, Daniel Král', Riste Skrekovski:
Non-rainbow colorings of 3-, 4- and 5-connected plane graphs. J. Graph Theory 63(2): 129-145 (2010) - [j74]Daniel Král', Ladislav Stacho:
Coloring plane graphs with independent crossings. J. Graph Theory 64(3): 184-205 (2010) - [j73]Tomás Kaiser, Daniel Král', Bernard Lidický, Pavel Nejedlý, Robert Sámal:
Short Cycle Covers of Graphs with Minimum Degree Three. SIAM J. Discret. Math. 24(1): 330-355 (2010) - [j72]Frantisek Kardos, Daniel Král', Jean-Sébastien Sereni:
The Last Fraction of a Fractional Conjecture. SIAM J. Discret. Math. 24(2): 699-707 (2010) - 2009
- [j71]Veselin Jungic, Tomás Kaiser, Daniel Král':
A Note on Edge-Colourings Avoiding Rainbow K4 and Monochromatic Km. Electron. J. Comb. 16(1) (2009) - [j70]Daniel Král', Douglas B. West:
Chromatic Number for a Generalization of Cartesian Product Graphs. Electron. J. Comb. 16(1) (2009) - [j69]Zdenek Dvorák, Daniel Král, Pavel Nejedlý, Riste Skrekovski:
Distance constrained labelings of planar graphs with no short cycles. Discret. Appl. Math. 157(12): 2634-2645 (2009) - [j68]Jerrold R. Griggs, Daniel Král:
Graph labellings with variable weights, a survey. Discret. Appl. Math. 157(12): 2646-2658 (2009) - [j67]Daniel Král, Pavel Nejedlý:
Distance constrained labelings of K4-minor free graphs. Discret. Math. 309(18): 5745-5756 (2009) - [j66]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) - [j65]Louis Esperet, Frantisek Kardos, Daniel Král:
Cubic bridgeless graphs have more than a linear number of perfect matchings. Electron. Notes Discret. Math. 34: 411-415 (2009) - [j64]Daniel Král, Edita Mácajová, Ján Mazák, Jean-Sébastien Sereni:
Circular edge-colorings of cubic graphs with girth six. Electron. Notes Discret. Math. 34: 525-529 (2009) - [j63]Jan Hladký, Daniel Král, Sergey Norin:
Counting flags in triangle-free digraphs. Electron. Notes Discret. Math. 34: 621-625 (2009) - [j62]Daniel Král, Oriol Serra, Lluís Vena:
A combinatorial proof of the Removal Lemma for Groups. J. Comb. Theory A 116(4): 971-978 (2009) - [j61]Daniel 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) - [j60]Zdenek Dvorák, Stanislav Jendrol', Daniel Král, Gyula Pap:
Matchings and Nonrainbow Colorings. SIAM J. Discret. Math. 23(1): 344-348 (2009) - [j59]Ken-ichi Kawarabayashi, Daniel Král, Jan Kyncl, Bernard Lidický:
6-Critical Graphs on the Klein Bottle. SIAM J. Discret. Math. 23(1): 372-383 (2009) - [j58]Rok Erman, Suzana Jurecic, Daniel Král, Kris Stopar, Nik Stopar:
Optimal Real Number Graph Labellings of a Subfamily of Kneser Graphs. SIAM J. Discret. Math. 23(3): 1372-1381 (2009) - [j57]Daniel Král, Jean-Sébastien Sereni, Michael Stiebitz:
A New Lower Bound on the Number of Perfect Matchings in Cubic Graphs. SIAM J. Discret. Math. 23(3): 1465-1483 (2009) - 2008
- [j56]Daniel Král, Robin Thomas:
Coloring even-faced graphs in the torus and the Klein bottle. Comb. 28(3): 325-341 (2008) - [j55]Daniel Král, Jirí Sgall, Tomás Tichý:
Randomized strategies for the plurality problem. Discret. Appl. Math. 156(17): 3305-3311 (2008) - [j54]Zdenek Dvorák, Daniel Král, Pavel Nejedlý, Riste Skrekovski:
Coloring squares of planar graphs with girth six. Eur. J. Comb. 29(4): 838-849 (2008) - [j53]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. Electron. Notes Discret. Math. 31: 235-240 (2008) - [j52]Daniel Král, Ladislav Stacho:
Hamiltonian threshold for strong products of graphs. J. Graph Theory 58(4): 314-328 (2008) - [j51]Jan Hladký, Daniel Král, Jean-Sébastien Sereni, Michael Stiebitz:
List colorings with measurable sets. J. Graph Theory 59(3): 229-238 (2008) - [j50]Daniel Král, Matej Stehlík:
Coloring of Triangle-Free Graphs on the Double Torus. SIAM J. Discret. Math. 22(2): 541-553 (2008) - [j49]Daniel Král, Petr Skoda:
Bounds for the Real Number Graph Labellings and Application to Labellings of the Triangular Lattice. SIAM J. Discret. Math. 22(4): 1559-1569 (2008) - 2007
- [j48]Daniel Král:
Mixed hypergraphs and other coloring problems. Discret. Math. 307(7-8): 923-938 (2007) - [j47]Daniel Král, Tomás Madaras, Riste Skrekovski:
Cyclic, diagonal and facial colorings - a missing case. Eur. J. Comb. 28(6): 1637-1639 (2007) - [j46]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) - [j45]Daniel Král, Pavel Nejedlý:
Distance Constrained Labelings of K4-minor Free Graphs. Electron. Notes Discret. Math. 28: 549-556 (2007) - [j44]Daniel Král, Edita Mácajová, Attila Pór, Jean-Sébastien Sereni:
Characterization of affine Steiner triple systems and Hall triple systems. Electron. Notes Discret. Math. 29: 17-21 (2007) - [j43]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. Electron. Notes Discret. Math. 29: 23-27 (2007) - [j42]Tomás Kaiser, Daniel Král, Riste Skrekovski, Xuding Zhu:
The circular chromatic index of graphs of high girth. J. Comb. Theory B 97(1): 1-13 (2007) - [j41]Daniel Král, Ladislav Stacho:
Closure for the property of having a hamiltonian prism. J. Graph Theory 54(3): 209-220 (2007) - [j40]Tomás Kaiser, Daniel Král, Ladislav Stacho:
Tough spiders. J. Graph Theory 56(1): 23-40 (2007) - [j39]Tomás Kaiser, Zdenek Ryjácek, Daniel Král, Moshe Rosenfeld, Heinz-Jürgen Voss:
Hamilton cycles in prisms. J. Graph Theory 56(4): 249-269 (2007) - [j38]Zdenek Dvorák, 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) - [j37]Robert Babilon, Vít Jelínek, Daniel Král, Pavel Valtr:
Labelings of Graphs with Fixed and Variable Edge-Weights. SIAM J. Discret. Math. 21(3): 688-706 (2007) - 2006
- [j36]Daniel Král', Li-Da Tong, Xuding Zhu:
Upper hamiltonian numbers and hamiltonian spectra of graphs. Australas. J Comb. 35: 329-340 (2006) - [j35]Jan Kára, Daniel Král:
Free binary decision diagrams for the computation of EARn. Comput. Complex. 15(1): 40-61 (2006) - [j34]Veselin Jungic, Daniel Král, Riste Skrekovski:
Colorings Of Plane Graphs With No Rainbow Faces. Comb. 26(2): 169-182 (2006) - [j33]Mohammad Ghebleh, Daniel Král, Serguei Norine, Robin Thomas:
The Circular Chromatic Index of Flower Snarks. Electron. J. Comb. 13(1) (2006) - [j32]Daniel Král, Jan Kratochvíl, Andrzej Proskurowski, Heinz-Jürgen Voss:
Coloring mixed hypertrees. Discret. Appl. Math. 154(4): 660-672 (2006) - [j31]Mieczyslaw Borowiecki, Stanislav Jendrol', Daniel Král, Jozef Miskuf:
List coloring of Cartesian products of graphs. Discret. Math. 306(16): 1955-1958 (2006) - [j30]Zdenek Dvorák, Tomás Kaiser, Daniel Král:
Eulerian colorings and the bipartizing matchings conjecture of Fleischner. Eur. J. Comb. 27(7): 1088-1101 (2006) - [j29]Daniel Král:
Extending partial 5-colorings and 6-colorings in planar graphs. J. Comb. Theory B 96(1): 100-110 (2006) - [j28]Daniel Král, Riste Skrekovski:
The last excluded case of Dirac's map-color theorem for choosability. J. Graph Theory 51(4): 319-354 (2006) - [j27]Daniel Král, Riste Skrekovski, Martin Tancer:
Construction of Large Graphs with No Optimal Surjective L(2, 1)-Labelings. SIAM J. Discret. Math. 20(2): 536-543 (2006) - [j26]Daniel Král:
The Channel Assignment Problem with Variable Weights. SIAM J. Discret. Math. 20(3): 690-704 (2006) - 2005
- [j25]Daniel Král:
An exact algorithm for the channel assignment problem. Discret. Appl. Math. 145(2): 326-331 (2005) - [j24]Zdenek Dvorák, Daniel Král, Riste Skrekovski:
Coloring face hypergraphs on surfaces. Eur. J. Comb. 26(1): 95-110 (2005) - [j23]Daniel Král, Tomás Madaras, Riste Skrekovski:
Cyclic, diagonal and facial colorings. Eur. J. Comb. 26(3-4): 473-490 (2005) - [j22]Tomás Kaiser, Daniel Král, Serguei Norine:
Unions of perfect matchings in cubic graphs. Electron. Notes Discret. Math. 22: 341-345 (2005) - [j21]Daniel Král, Jana Maxová, Robert Sámal, Pavel Podbrdský:
Hamilton cycles in strong products of graphs. J. Graph Theory 48(4): 299-321 (2005) - [j20]Daniel Král, Jirí Sgall:
Coloring graphs from lists with bounded size of their union. J. Graph Theory 49(3): 177-186 (2005) - [j19]Daniel Král, Ondrej Pangrác, Heinz-Jürgen Voss:
A note on group colorings. J. Graph Theory 50(2): 123-129 (2005) - [j18]Jirí Fiala, Daniel Král, Riste Skrekovski:
A Brooks-Type Theorem for the Generalized List T-Coloring. SIAM J. Discret. Math. 19(3): 588-609 (2005) - [j17]Zdenek Dvorák, Daniel Král, Ondrej Pangrác:
Locally consistent constraint satisfaction problems. Theor. Comput. Sci. 348(2-3): 187-206 (2005) - [j16]Daniel Král:
Group coloring is π2P-complete. Theor. Comput. Sci. 349(1): 99-111 (2005) - 2004
- [j15]Daniel Král:
On Feasible Sets of Mixed Hypergraphs. Electron. J. Comb. 11(1) (2004) - [j14]Daniel Král:
On maximum face-constrained coloring of plane graphs with no short face cycles. Discret. Math. 277(1-3): 301-307 (2004) - [j13]Daniel Král, Jan Kratochvíl, Heinz-Jürgen Voss:
Mixed hypercacti. Discret. Math. 286(1-2): 99-113 (2004) - [j12]Daniel Král:
Hajós' theorem for list coloring. Discret. Math. 287(1-3): 161-163 (2004) - [j11]Daniel Král, Riste Skrekovski:
Borodin's conjecture on diagonal coloring is false. Eur. J. Comb. 25(6): 813-816 (2004) - [j10]Daniel Král, Jana Maxová, Pavel Podbrdský, Robert Sámal:
Pancyclicity of Strong Products of Graphs. Graphs Comb. 20(1): 91-104 (2004) - [j9]Daniel Král, Heinz-Jürgen Voss:
Edge-disjoint odd cycles in planar graphs. J. Comb. Theory B 90(1): 107-120 (2004) - [j8]Tomás Kaiser, Daniel Král, Riste Skrekovski:
A revival of the girth conjecture. J. Comb. Theory B 92(1): 41-53 (2004) - [j7]Daniel Král:
Coloring Powers of Chordal Graphs. SIAM J. Discret. Math. 18(3): 451-461 (2004) - [j6]Daniel Král, Vladan Majerech, Jirí Sgall, Tomás Tichý, Gerhard J. Woeginger:
It is tough to be a plumber. Theor. Comput. Sci. 313(3): 473-484 (2004) - 2003
- [j5]Daniel Král':
A counter-example to Voloshin's hypergraph co-perfectness conjecture. Australas. J Comb. 27: 253-262 (2003) - [j4]Jan Kára, Daniel Král:
Minimum Degree and the Number of Chords. Ars Comb. 68 (2003) - [j3]Daniel Král, Riste Skrekovski:
A Theorem about the Channel Assignment Problem. SIAM J. Discret. Math. 16(3): 426-437 (2003) - [j2]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) - 2001
- [j1]Zdenek Dvorák, Daniel Král:
On Planar Mixed Hypergraphs. Electron. J. Comb. 8(1) (2001)
Conference and Workshop Papers
- 2024
- [c33]Daniel Král, Kristýna Pekárková, Kenny Storgel:
Twin-Width of Graphs on Surfaces. MFCS 2024: 66:1-66:15 - 2022
- [c32]Marcin Brianski, Martin Koutecký, Daniel Král', Kristýna Pekárková, Felix Schröder:
Characterization of Matrices with Bounded Graver Bases and Depth Parameters and Applications to Integer Programming. ICALP 2022: 29:1-29:20 - 2020
- [c31]Timothy F. N. Chan, Jacob W. Cooper, Martin Koutecký, Daniel Král', Kristýna Pekárková:
Matrices of Optimal Tree-Depth and Row-Invariant Parameterized Algorithm for Integer Programming. ICALP 2020: 26:1-26:19 - 2019
- [c30]Andrzej Grzesik, Daniel Král:
Analytic representations of large graphs. BCC 2019: 57-88 - 2018
- [c29]Jeremy C. Pamplin, Ronald Yeaw, Gary R. Gilbert, Konrad L. Davis, Elizabeth Mann-Salinas, José Salinas, Daniel Král, Loretta Schlachta-Fairchild:
Augmenting Clinical Performance in Combat Casualty Care: Telemedicine to Automation. HCI (16) 2018: 326-338 - [c28]Jakub Gajarský, Daniel Král:
Recovering Sparse Graphs. MFCS 2018: 29:1-29:15 - 2017
- [c27]Zdenek Dvorák, Daniel Král, Bojan Mohar:
Graphic TSP in Cubic Graphs. STACS 2017: 27:1-27:13 - 2014
- [c26]Tereza Klimosová, Daniel Král':
Hereditary properties of permutations are strongly testable. SODA 2014: 1164-1173 - 2013
- [c25]Robert Ganian, Petr Hlinený, Daniel Král', Jan Obdrzálek, Jarett Schwartz, Jakub Teska:
FO Model Checking of Interval Graphs. ICALP (2) 2013: 250-262 - [c24]Ken-ichi Kawarabayashi, Daniel Král', Marek Krcál, Stephan Kreutzer:
Packing directed cycles through a specified vertex set. SODA 2013: 365-377 - 2012
- [c23]Tomas Gavenciak, Daniel Král, Sang-il Oum:
Deciding First Order Properties of Matroids. ICALP (2) 2012: 239-250 - 2010
- [c22]Zdenek Dvorák, Daniel Král, Robin Thomas:
Deciding First-Order Properties for Sparse Graphs. FOCS 2010: 133-142 - [c21]Daniel Král':
Decomposition Width of Matroids. ICALP (1) 2010: 55-66 - 2009
- [c20]Zdenek Dvorák, Daniel Král, Robin Thomas:
Coloring triangle-free graphs on surfaces. SODA 2009: 120-129 - [c19]Zdenek Dvorák, Daniel Král:
Algorithms for Classes of Graphs with Bounded Expansion. WG 2009: 17-32 - 2007
- [c18]Zdenek Dvorák, Daniel Král, Robin Thomas:
Coloring Triangle-Free Graphs on Surfaces. ISAAC 2007: 2-4 - [c17]Daniel Král:
Computing Representations of Matroids of Bounded Branch-Width. STACS 2007: 224-235 - 2005
- [c16]Daniel Král, Ondrej Pangrác:
An Asymptotically Optimal Linear-Time Algorithm for Locally Consistent Constraint Satisfaction Problems. MFCS 2005: 603-614 - [c15]Tomás Feder, Pavol Hell, Daniel Král, Jirí Sgall:
Two algorithms for general list matrix partitions. SODA 2005: 870-876 - [c14]Zdenek Dvorák, Vít Jelínek, Daniel Král, Jan Kyncl, Michael E. Saks:
Three Optimal Algorithms for Balls of Three Colors. STACS 2005: 206-217 - [c13]Manuel Bodirsky, Daniel Král:
Locally Consistent Constraint Satisfaction Problems with Binary Constraints. WG 2005: 295-306 - 2004
- [c12]Zdenek Dvorák, Daniel Král, Ondrej Pangrác:
Locally Consistent Constraint Satisfaction Problems: (Extended Abstract). ICALP 2004: 469-480 - [c11]Daniel Král, Pavel Nejedlý:
Group Coloring and List Group Coloring Are Pi2P-Complete (Extended Abstract). MFCS 2004: 274-286 - [c10]Daniel Král:
Locally satisfiable formulas. SODA 2004: 330-339 - [c9]Zdenek Dvorák, Jan Kára, Daniel Král, Ondrej Pangrác:
An Algorithm for Cyclic Edge Connectivity of Cubic Graphs. SWAT 2004: 236-247 - 2002
- [c8]Jan Kára, Daniel Král:
Optimal Free Binary Decision Diagrams for Computation of EARn. MFCS 2002: 411-422 - [c7]Zdenek Dvorák, Jan Kára, Daniel Král, Ondrej Pangrác:
Complexity of Pattern Coloring of Cycle Systems. WG 2002: 164-175 - 2001
- [c6]Daniel Král:
On Complexity of Colouring Mixed Hypertrees. FCT 2001: 516-524 - [c5]Jakub Cerný, Daniel Král, Helena Nyklová, Ondrej Pangrác:
On Intersection Graphs of Segments with Prescribed Slopes. GD 2001: 261-271 - [c4]Daniel Král, Jan Kratochvíl, Heinz-Jürgen Voss:
Complexity Note on Mixed Hypergraphs. MFCS 2001: 474-486 - [c3]Daniel Král, Jan Kratochvíl, Zsolt Tuza, Gerhard J. Woeginger:
Complexity of Coloring Graphs without Forbidden Induced Subgraphs. WG 2001: 254-262 - 2000
- [c2]Daniel Král:
Algebraic and Uniqueness Properties of Parity Ordered Binary Decision Diagrams and Their Generalization. MFCS 2000: 477-487 - [c1]Daniel Král, Jan Kratochvíl, Andrzej Proskurowski, Heinz-Jürgen Voss:
Coloring Mixed Hypertrees. WG 2000: 279-289
Editorship
- 2020
- [e2]Javier Esparza, Daniel Král':
45th International Symposium on Mathematical Foundations of Computer Science, MFCS 2020, August 24-28, 2020, Prague, Czech Republic. LIPIcs 170, Schloss Dagstuhl - Leibniz-Zentrum für Informatik 2020, ISBN 978-3-95977-159-7 [contents] - 2015
- [e1]Artur Czumaj, Agelos Georgakopoulos, Daniel Král, Vadim V. Lozin, Oleg Pikhurko:
Surveys in Combinatorics 2015. London Mathematical Society Lecture Note Series 424, Cambridge University Press 2015, ISBN 9781316106853 [contents]
Informal and Other Publications
- 2024
- [i30]Marcin Brianski, Daniel Král, Kristýna Pekárková:
Branch-depth is minor closure of contraction-deletion-depth. CoRR abs/2402.16215 (2024) - [i29]Daniel Král, Jae-Baek Lee, Jonathan A. Noel:
Forcing quasirandomness with 4-point permutations. CoRR abs/2407.06869 (2024) - 2023
- [i28]Daniel Král, Kristýna Pekárková, Kenny Storgel:
Twin-width of graphs on surfaces. CoRR abs/2307.05811 (2023) - [i27]Marcin Brianski, Daniel Král, Ander Lamaison:
Closure property of contraction-depth of matroids. CoRR abs/2311.01945 (2023) - 2022
- [i26]Marcin Brianski, Martin Koutecký, Daniel Král, Kristýna Pekárková, Felix Schröder:
Characterization of matrices with bounded Graver bases and depth parameters and applications to integer programming. CoRR abs/2202.05299 (2022) - [i25]Daniel Král, Ander Lamaison:
Planar graph with twin-width seven. CoRR abs/2209.11537 (2022) - 2021
- [i24]Daniel Král', Michal Pilipczuk, Sebastian Siebertz, Blair D. Sullivan:
Sparsity in Algorithms, Combinatorics and Logic (Dagstuhl Seminar 21391). Dagstuhl Reports 11(8): 115-128 (2021) - 2019
- [i23]Martin Koutecký, Daniel Král:
A row-invariant parameterized algorithm for integer programming. CoRR abs/1907.06688 (2019) - [i22]Robert Hancock, Adam Kabela, Daniel Král, Taísa L. Martins, Roberto Parente, Fiona Skerman, Jan Volec:
No additional tournaments are quasirandom-forcing. CoRR abs/1912.04243 (2019) - 2018
- [i21]Andrzej Grzesik, Daniel Král', László Miklós Lovász:
Elusive extremal graphs. CoRR abs/1807.01141 (2018) - 2017
- [i20]Jakub Gajarský, Daniel Král:
Deobfuscating sparse graphs. CoRR abs/1709.09985 (2017) - 2016
- [i19]Zdenek Dvorák, Daniel Král, Robin Thomas:
Three-coloring triangle-free graphs on surfaces VII. A linear-time algorithm. CoRR abs/1601.01197 (2016) - [i18]Zdenek Dvorák, Daniel Král, Bojan Mohar:
Graphic TSP in cubic graphs. CoRR abs/1608.07568 (2016) - 2015
- [i17]Frantisek Kardos, Daniel Král, Anita Liebenau, Lukás Mach:
First order convergence of matroids. CoRR abs/1501.06518 (2015) - [i16]Jacob W. Cooper, Tomás Kaiser, Daniel Král, Jonathan A. Noel:
Weak regularity and finitely forcible graph limits. CoRR abs/1507.00067 (2015) - [i15]Zdenek Dvorák, Daniel Král, Robin Thomas:
Three-coloring triangle-free graphs on surfaces VI. 3-colorability of quadrangulations. CoRR abs/1509.01013 (2015) - 2014
- [i14]Demetres Christofides, Daniel Král:
First order convergence and roots. CoRR abs/1403.3049 (2014) - [i13]Roman Glebov, Tereza Klimosová, Daniel Král:
Infinite dimensional finitely forcible graphon. CoRR abs/1404.2743 (2014) - [i12]Roman Glebov, Carlos Hoppen, Tereza Klimosová, Yoshiharu Kohayakawa, Daniel Král, Hong Liu:
Large permutations and parameter testing. CoRR abs/1412.5622 (2014) - 2013
- [i11]Zdenek Dvorák, Daniel Král, Robin Thomas:
Three-coloring triangle-free graphs on surfaces II. 4-critical graphs in a disk. CoRR abs/1302.2158 (2013) - 2012
- [i10]Daniel Král', Chun-Hung Liu, Jean-Sébastien Sereni, Peter Whalen, Zelealem B. Yilma:
A new bound for the 2/3 conjecture. CoRR abs/1204.2519 (2012) - [i9]Tereza Klimosová, Daniel Král:
Hereditary properties of permutations are strongly testable. CoRR abs/1208.2624 (2012) - 2011
- [i8]Tomas Gavenciak, Daniel Král, Sang-il Oum:
Deciding first order logic properties of matroids. CoRR abs/1108.5457 (2011) - [i7]Zdenek Dvorák, Daniel Král, Robin Thomas:
Testing first-order properties for subclasses of sparse graphs. CoRR abs/1109.5036 (2011) - 2010
- [i6]Zdenek Dvorák, 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) - 2009
- [i5]Daniel Král:
Decomposition width - a new width parameter for matroids. CoRR abs/0904.2785 (2009) - 2004
- [i4]Zdenek Dvorák, Daniel Král, Ondrej Pangrác:
Locally consistent constraint satisfaction problems. Electron. Colloquium Comput. Complex. TR04 (2004) - 2003
- [i3]Daniel Král:
Locally satisfiable formulas. Electron. Colloquium Comput. Complex. TR03 (2003) - [i2]Jan Kára, Daniel Král:
Free Binary Decision Diagrams for Computation of EARn. Electron. Colloquium Comput. Complex. TR03 (2003) - 2000
- [i1]Daniel Král:
Algebraic and Uniqueness Properties of Parity Ordered Binary Decision Diagrams and their Generalization. Electron. Colloquium Comput. Complex. TR00 (2000)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-31 21:11 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
