Daniel Král

ORCID

Publication Activity (10 Years)

Years Active: 2000-2024
Publications (10 Years): 18

Top Venues

CoRR

MFCS

SIAM J. Discret. Math.

Log. Methods Comput. Sci.

Publications

Daniel Král, Jae-Baek Lee, Jonathan A. Noel
Forcing quasirandomness with 4-point permutations. CoRR (2024)
Marcin Brianski, Daniel Král, Kristýna Pekárková
Branch-depth is minor closure of contraction-deletion-depth. CoRR (2024)
Daniel Král, Kristýna Pekárková, Kenny Storgel
Twin-Width of Graphs on Surfaces. MFCS (2024)
Daniel Král, Kristýna Pekárková, Kenny Storgel
Twin-width of graphs on surfaces. CoRR (2023)
Marcin Brianski, Daniel Král, Ander Lamaison
Closure property of contraction-depth of matroids. CoRR (2023)
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) (2022)
Daniel Král, Ander Lamaison
Planar graph with twin-width seven. CoRR (2022)
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 (2022)
Robert Hancock, Adam Kabela, Daniel Král, Taísa L. Martins, Roberto Parente, Fiona Skerman, Jan Volec
No additional tournaments are quasirandom-forcing. CoRR (2019)
Andrzej Grzesik, Daniel Král
Analytic representations of large graphs. BCC (2019)
Martin Koutecký, Daniel Král
A row-invariant parameterized algorithm for integer programming. CoRR (2019)
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)
Jakub Gajarský, Daniel Král
Recovering Sparse Graphs. MFCS (2018)
Zdenek Dvorák, Daniel Král, Bojan Mohar
Graphic TSP in Cubic Graphs. STACS (2017)
Jakub Gajarský, Daniel Král
Deobfuscating sparse graphs. CoRR (2017)
Michael Hebdige, Daniel Král
Third Case of the Cyclic Coloring Conjecture. SIAM J. Discret. Math. 30 (1) (2016)
Zdenek Dvorák, Daniel Král, Robin Thomas
Three-coloring triangle-free graphs on surfaces VII. A linear-time algorithm. CoRR (2016)
Zdenek Dvorák, Daniel Král, Bojan Mohar
Graphic TSP in cubic graphs. CoRR (2016)
Frantisek Kardos, Daniel Král, Anita Liebenau, Lukás Mach
First order convergence of matroids. CoRR (2015)
Jacob W. Cooper, Tomás Kaiser, Daniel Král, Jonathan A. Noel
Weak regularity and finitely forcible graph limits. CoRR (2015)
Zdenek Dvorák, Daniel Král, Robin Thomas
Three-coloring triangle-free graphs on surfaces VI. 3-colorability of quadrangulations. CoRR (2015)
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)
Roman Glebov, Andrzej Grzesik, Tereza Klimosová, Daniel Král
Finitely forcible graphons and permutons. J. Comb. Theory, Ser. B 110 (2015)
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) (2014)
Roman Glebov, Tereza Klimosová, Daniel Král
Infinite dimensional finitely forcible graphon. CoRR (2014)
Demetres Christofides, Daniel Král
First order convergence and roots. CoRR (2014)
Roman Glebov, Carlos Hoppen, Tereza Klimosová, Yoshiharu Kohayakawa, Daniel Král, Hong Liu
Large permutations and parameter testing. CoRR (2014)
Zdenek Dvorák, Daniel Král, Robin Thomas
Three-coloring triangle-free graphs on surfaces II. 4-critical graphs in a disk CoRR (2013)
Zdenek Dvorák, Daniel Král, Robin Thomas
Testing first-order properties for subclasses of sparse graphs. J. ACM 60 (5) (2013)
Tereza Klimosová, Daniel Král
Hereditary properties of permutations are strongly testable CoRR (2012)
Tomas Gavenciak, Daniel Král, Sang-il Oum
Deciding First Order Properties of Matroids. ICALP (2) (2012)
Zdenek Dvorák, Daniel Král, Robin Thomas
Testing first-order properties for subclasses of sparse graphs CoRR (2011)
Tomas Gavenciak, Daniel Král, Sang-il Oum
Deciding first order logic properties of matroids CoRR (2011)
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 (2010)
Zdenek Dvorák, Daniel Král, Robin Thomas
Deciding First-Order Properties for Sparse Graphs. FOCS (2010)
Zdenek Dvorák, Stanislav Jendrol', Daniel Král, Gyula Pap
Matchings and Nonrainbow Colorings. SIAM J. Discret. Math. 23 (1) (2009)
Ken-ichi Kawarabayashi, Daniel Král, Jan Kyncl, Bernard Lidický
6-Critical Graphs on the Klein Bottle. SIAM J. Discret. Math. 23 (1) (2009)
Jan Hladký, Daniel Král, Sergey Norin
Counting flags in triangle-free digraphs. Electron. Notes Discret. Math. 34 (2009)
Zdenek Dvorák, Daniel Král, Robin Thomas
Coloring triangle-free graphs on surfaces. SODA (2009)
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) (2009)
Daniel Král, Pavel Nejedlý
-minor free graphs. Discret. Math. 309 (18) (2009)
Daniel Král, Oriol Serra, Lluís Vena
A combinatorial proof of the Removal Lemma for Groups. J. Comb. Theory, Ser. A 116 (4) (2009)
Jerrold R. Griggs, Daniel Král
Graph labellings with variable weights, a survey. Discret. Appl. Math. 157 (12) (2009)
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) (2009)
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) (2009)
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) (2009)
Zdenek Dvorák, Daniel Král
Algorithms for Classes of Graphs with Bounded Expansion. WG (2009)
Daniel Král
-Hyperclique Problem Reading Each Input Bit Twice. Theory Comput. Syst. 45 (1) (2009)
Daniel Král
Decomposition width - a new width parameter for matroids CoRR (2009)
Louis Esperet, Frantisek Kardos, Daniel Král
Cubic bridgeless graphs have more than a linear number of perfect matchings. Electron. Notes Discret. Math. 34 (2009)
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 (2009)
Daniel Král, Ladislav Stacho
Hamiltonian threshold for strong products of graphs. J. Graph Theory 58 (4) (2008)
Jan Hladký, Daniel Král, Jean-Sébastien Sereni, Michael Stiebitz
List colorings with measurable sets. J. Graph Theory 59 (3) (2008)
Daniel Král, Robin Thomas
Coloring even-faced graphs in the torus and the Klein bottle. Comb. 28 (3) (2008)
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) (2008)
Zdenek Dvorák, Daniel Král, Pavel Nejedlý, Riste Skrekovski
Coloring squares of planar graphs with girth six. Eur. J. Comb. 29 (4) (2008)
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 (2008)
Daniel Král, Matej Stehlík
Coloring of Triangle-Free Graphs on the Double Torus. SIAM J. Discret. Math. 22 (2) (2008)
Daniel Král, Jirí Sgall, Tomás Tichý
Randomized strategies for the plurality problem. Discret. Appl. Math. 156 (17) (2008)
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 (2007)
Peter Bella, Daniel Král, Bojan Mohar, Katarína Quittnerová
Labeling planar graphs with a condition at distance two. Eur. J. Comb. 28 (8) (2007)
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) (2007)
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 (2007)
Daniel Král
Mixed hypergraphs and other coloring problems. Discret. Math. 307 (7-8) (2007)
Daniel Král, Tomás Madaras, Riste Skrekovski
Cyclic, diagonal and facial colorings - a missing case. Eur. J. Comb. 28 (6) (2007)
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) (2007)
Daniel Král, Pavel Nejedlý
-minor Free Graphs. Electron. Notes Discret. Math. 28 (2007)
Daniel Král
Computing Representations of Matroids of Bounded Branch-Width. STACS (2007)
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) (2007)
Tomás Kaiser, Daniel Král, Ladislav Stacho
Tough spiders. J. Graph Theory 56 (1) (2007)
Daniel Král, Ladislav Stacho
Closure for the property of having a hamiltonian prism. J. Graph Theory 54 (3) (2007)
Tomás Kaiser, Zdenek Ryjácek, Daniel Král, Moshe Rosenfeld, Heinz-Jürgen Voss
Hamilton cycles in prisms. J. Graph Theory 56 (4) (2007)
Zdenek Dvorák, Daniel Král, Robin Thomas
Coloring Triangle-Free Graphs on Surfaces. ISAAC (2007)
Mieczyslaw Borowiecki, Stanislav Jendrol', Daniel Král, Jozef Miskuf
List coloring of Cartesian products of graphs. Discret. Math. 306 (16) (2006)
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) (2006)
Daniel Král
Extending partial 5-colorings and 6-colorings in planar graphs. J. Comb. Theory, Ser. B 96 (1) (2006)
Mohammad Ghebleh, Daniel Král, Serguei Norine, Robin Thomas
The Circular Chromatic Index of Flower Snarks. Electron. J. Comb. 13 (1) (2006)
Daniel Král, Jan Kratochvíl, Andrzej Proskurowski, Heinz-Jürgen Voss
Coloring mixed hypertrees. Discret. Appl. Math. 154 (4) (2006)
Zdenek Dvorák, Tomás Kaiser, Daniel Král
Eulerian colorings and the bipartizing matchings conjecture of Fleischner. Eur. J. Comb. 27 (7) (2006)
Veselin Jungic, Daniel Král, Riste Skrekovski
Colorings Of Plane Graphs With No Rainbow Faces. Comb. 26 (2) (2006)
Daniel Král, Riste Skrekovski
The last excluded case of Dirac's map-color theorem for choosability. J. Graph Theory 51 (4) (2006)
Jan Kára, Daniel Král
. Comput. Complex. 15 (1) (2006)
Daniel Král
The Channel Assignment Problem with Variable Weights. SIAM J. Discret. Math. 20 (3) (2006)
Daniel Král, Ondrej Pangrác, Heinz-Jürgen Voss
A note on group colorings. J. Graph Theory 50 (2) (2005)
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)
Daniel Král
-complete. Theor. Comput. Sci. 349 (1) (2005)
Zdenek Dvorák, Daniel Král, Ondrej Pangrác
Locally consistent constraint satisfaction problems. Theor. Comput. Sci. 348 (2-3) (2005)
Jirí Fiala, Daniel Král, Riste Skrekovski
A Brooks-Type Theorem for the Generalized List T-Coloring. SIAM J. Discret. Math. 19 (3) (2005)
Daniel Král, Tomás Madaras, Riste Skrekovski
Cyclic, diagonal and facial colorings. Eur. J. Comb. 26 (3-4) (2005)
Daniel Král
An exact algorithm for the channel assignment problem. Discret. Appl. Math. 145 (2) (2005)
Tomás Feder, Pavol Hell, Daniel Král, Jirí Sgall
Two algorithms for general list matrix partitions. SODA (2005)
Daniel Král, Ondrej Pangrác
An Asymptotically Optimal Linear-Time Algorithm for Locally Consistent Constraint Satisfaction Problems. MFCS (2005)
Manuel Bodirsky, Daniel Král
Locally Consistent Constraint Satisfaction Problems with Binary Constraints. WG (2005)
Tomás Kaiser, Daniel Král, Serguei Norine
Unions of perfect matchings in cubic graphs. Electron. Notes Discret. Math. 22 (2005)
Daniel Král, Jirí Sgall
Coloring graphs from lists with bounded size of their union. J. Graph Theory 49 (3) (2005)
Daniel Král, Jana Maxová, Robert Sámal, Pavel Podbrdský
Hamilton cycles in strong products of graphs. J. Graph Theory 48 (4) (2005)
Zdenek Dvorák, Daniel Král, Riste Skrekovski
Coloring face hypergraphs on surfaces. Eur. J. Comb. 26 (1) (2005)
Daniel Král, Riste Skrekovski
Borodin's conjecture on diagonal coloring is false. Eur. J. Comb. 25 (6) (2004)
Zdenek Dvorák, Jan Kára, Daniel Král, Ondrej Pangrác
An Algorithm for Cyclic Edge Connectivity of Cubic Graphs. SWAT (2004)
Daniel Král, Jana Maxová, Pavel Podbrdský, Robert Sámal
Pancyclicity of Strong Products of Graphs. Graphs Comb. 20 (1) (2004)

Daniel Král.css-eqlu8i{font-size:small;padding-left:4px;}

Publication Activity (10 Years)

Top Topics

Top Venues

Daniel Král