Algebraic and Uniqueness Properties of Parity Ordered Binary Decision Diagrams and their Generalization - Daniel Král (Electron. Colloquium Comput. Complex., 2000)

On Complexity of Colouring Mixed Hypertrees. - Daniel Král (FCT, 2001)

On Intersection Graphs of Segments with Prescribed Slopes. - Jakub Cerný; Daniel Král; Helena Nyklová; Ondrej Pangrác (GD, 2001)

Complexity Note on Mixed Hypergraphs. - Daniel Král; Jan Kratochvíl; Heinz-Jürgen Voss (MFCS, 2001)

Complexity of Coloring Graphs without Forbidden Induced Subgraphs. - Daniel Král; Jan Kratochvíl; Zsolt Tuza; Gerhard J. Woeginger (WG, 2001)

On Planar Mixed Hypergraphs. - Zdenek Dvorák 001; Daniel Král (Electron. J. Comb., 2001)

Optimal Free Binary Decision Diagrams for Computation of EARn. - Jan Kára; Daniel Král (MFCS, 2002)

Complexity of Pattern Coloring of Cycle Systems. - Zdenek Dvorák 001; Jan Kára; Daniel Král; Ondrej Pangrác (WG, 2002)

A counter-example to Voloshin's hypergraph co-perfectness conjecture. - Daniel Král' (Australas. J Comb., 2003)

Minimum Degree and the Number of Chords. - Jan Kára; Daniel Král (Ars Comb., 2003)

Locally satisfiable formulas - Daniel Král (Electron. Colloquium Comput. Complex., 2003)

Free Binary Decision Diagrams for Computation of EARn - Jan Kára; Daniel Král (Electron. Colloquium Comput. Complex., 2003)

A Theorem about the Channel Assignment Problem. - Daniel Král; Riste Skrekovski (SIAM J. Discret. Math., 2003)

Mixed hypergraphs with bounded degree: edge-coloring of mixed multigraphs. - Daniel Král; Jan Kratochvíl; Heinz-Jürgen Voss (Theor. Comput. Sci., 2003)

Locally Consistent Constraint Satisfaction Problems: (Extended Abstract). - Zdenek Dvorák 001; Daniel Král; Ondrej Pangrác (ICALP, 2004)

Group Coloring and List Group Coloring Are Pi2P-Complete (Extended Abstract). - Daniel Král; Pavel Nejedlý (MFCS, 2004)

An Algorithm for Cyclic Edge Connectivity of Cubic Graphs. - Zdenek Dvorák 001; Jan Kára; Daniel Král; Ondrej Pangrác (SWAT, 2004)

On Feasible Sets of Mixed Hypergraphs. - Daniel Král (Electron. J. Comb., 2004)

Hajós' theorem for list coloring. - Daniel Král (Discret. Math., 2004)

On maximum face-constrained coloring of plane graphs with no short face cycles. - Daniel Král (Discret. Math., 2004)

Mixed hypercacti. - Daniel Král; Jan Kratochvíl; Heinz-Jürgen Voss (Discret. Math., 2004)

Borodin's conjecture on diagonal coloring is false. - Daniel Král; Riste Skrekovski (Eur. J. Comb., 2004)

Pancyclicity of Strong Products of Graphs. - Daniel Král; Jana Maxová; Pavel Podbrdský; Robert Sámal (Graphs Comb., 2004)

A revival of the girth conjecture. - Tomás Kaiser; Daniel Král; Riste Skrekovski (J. Comb. Theory B, 2004)

Edge-disjoint odd cycles in planar graphs. - Daniel Král; Heinz-Jürgen Voss (J. Comb. Theory B, 2004)

Coloring Powers of Chordal Graphs. - Daniel Král (SIAM J. Discret. Math., 2004)

It is tough to be a plumber. - Daniel Král; Vladan Majerech; Jirí Sgall; Tomás Tichý; Gerhard J. Woeginger (Theor. Comput. Sci., 2004)

An Asymptotically Optimal Linear-Time Algorithm for Locally Consistent Constraint Satisfaction Problems. - Daniel Král; Ondrej Pangrác (MFCS, 2005)

Two algorithms for general list matrix partitions. - Tomás Feder; Pavol Hell; Daniel Král; Jirí Sgall (SODA, 2005)

Three Optimal Algorithms for Balls of Three Colors. - Zdenek Dvorák 001; Vít Jelínek; Daniel Král; Jan Kyncl; Michael E. Saks (STACS, 2005)

Locally Consistent Constraint Satisfaction Problems with Binary Constraints. - Manuel Bodirsky; Daniel Král (WG, 2005)

An exact algorithm for the channel assignment problem. - Daniel Král (Discret. Appl. Math., 2005)

Coloring face hypergraphs on surfaces. - Zdenek Dvorák 001; Daniel Král; Riste Skrekovski (Eur. J. Comb., 2005)

Cyclic, diagonal and facial colorings. - Daniel Král; Tomás Madaras; Riste Skrekovski (Eur. J. Comb., 2005)

Unions of perfect matchings in cubic graphs. - Tomás Kaiser; Daniel Král; Serguei Norine (Electron. Notes Discret. Math., 2005)

Hamilton cycles in strong products of graphs. - Daniel Král; Jana Maxová; Robert Sámal; Pavel Podbrdský (J. Graph Theory, 2005)

A note on group colorings. - Daniel Král; Ondrej Pangrác; Heinz-Jürgen Voss (J. Graph Theory, 2005)

Coloring graphs from lists with bounded size of their union. - Daniel Král; Jirí Sgall (J. Graph Theory, 2005)

A Brooks-Type Theorem for the Generalized List T-Coloring. - Jirí Fiala 001; Daniel Král; Riste Skrekovski (SIAM J. Discret. Math., 2005)

Locally consistent constraint satisfaction problems. - Zdenek Dvorák 001; Daniel Král; Ondrej Pangrác (Theor. Comput. Sci., 2005)

Group coloring is π2P-complete. - Daniel Král (Theor. Comput. Sci., 2005)

Upper hamiltonian numbers and hamiltonian spectra of graphs. - Daniel Král'; Li-Da Tong; Xuding Zhu (Australas. J Comb., 2006)

Free binary decision diagrams for the computation of EARn. - Jan Kára; Daniel Král (Comput. Complex., 2006)

Colorings Of Plane Graphs With No Rainbow Faces. - Veselin Jungic; Daniel Král; Riste Skrekovski (Comb., 2006)

The Circular Chromatic Index of Flower Snarks. - Mohammad Ghebleh; Daniel Král; Serguei Norine; Robin Thomas 001 (Electron. J. Comb., 2006)

Coloring mixed hypertrees. - Daniel Král; Jan Kratochvíl; Andrzej Proskurowski; Heinz-Jürgen Voss (Discret. Appl. Math., 2006)

List coloring of Cartesian products of graphs. - Mieczyslaw Borowiecki; Stanislav Jendrol'; Daniel Král; Jozef Miskuf (Discret. Math., 2006)

Eulerian colorings and the bipartizing matchings conjecture of Fleischner. - Zdenek Dvorák 001; Tomás Kaiser; Daniel Král (Eur. J. Comb., 2006)

Extending partial 5-colorings and 6-colorings in planar graphs. - Daniel Král (J. Comb. Theory B, 2006)

The last excluded case of Dirac's map-color theorem for choosability. - Daniel Král; Riste Skrekovski (J. Graph Theory, 2006)

The Channel Assignment Problem with Variable Weights. - Daniel Král (SIAM J. Discret. Math., 2006)

Construction of Large Graphs with No Optimal Surjective L(2, 1)-Labelings. - Daniel Král; Riste Skrekovski; Martin Tancer (SIAM J. Discret. Math., 2006)

Computing Representations of Matroids of Bounded Branch-Width. - Daniel Král (STACS, 2007)

Mixed hypergraphs and other coloring problems. - Daniel Král (Discret. Math., 2007)

Labeling planar graphs with a condition at distance two. - Peter Bella; Daniel Král; Bojan Mohar; Katarína Quittnerová (Eur. J. Comb., 2007)

Cyclic, diagonal and facial colorings - a missing case. - Daniel Král; Tomás Madaras; Riste Skrekovski (Eur. J. Comb., 2007)

Characterization of affine Steiner triple systems and Hall triple systems. - Daniel Král; Edita Mácajová; Attila Pór; Jean-Sébastien Sereni (Electron. Notes Discret. Math., 2007)

Edge-colorings of cubic graphs with elements of point-transitive Steiner triple systems. - Daniel Král; Edita Mácajová; Attila Pór; Jean-Sébastien Sereni (Electron. Notes Discret. Math., 2007)

Distance Constrained Labelings of K4-minor Free Graphs. - Daniel Král; Pavel Nejedlý (Electron. Notes Discret. Math., 2007)

The circular chromatic index of graphs of high girth. - Tomás Kaiser; Daniel Král; Riste Skrekovski; Xuding Zhu (J. Comb. Theory B, 2007)

Tough spiders. - Tomás Kaiser; Daniel Král; Ladislav Stacho (J. Graph Theory, 2007)

Hamilton cycles in prisms. - Tomás Kaiser; Zdenek Ryjácek; Daniel Král; Moshe Rosenfeld 001; Heinz-Jürgen Voss (J. Graph Theory, 2007)

Closure for the property of having a hamiltonian prism. - Daniel Král; Ladislav Stacho (J. Graph Theory, 2007)

Probabilistic strategies for the partition and plurality problems. - Zdenek Dvorák 001; Vít Jelínek; Daniel Král; Jan Kyncl; Michael E. Saks (Random Struct. Algorithms, 2007)

Labelings of Graphs with Fixed and Variable Edge-Weights. - Robert Babilon; Vít Jelínek; Daniel Král; Pavel Valtr 001 (SIAM J. Discret. Math., 2007)

Coloring even-faced graphs in the torus and the Klein bottle. - Daniel Král; Robin Thomas 001 (Comb., 2008)

Randomized strategies for the plurality problem. - Daniel Král; Jirí Sgall; Tomás Tichý (Discret. Appl. Math., 2008)

Coloring squares of planar graphs with girth six. - Zdenek Dvorák 001; Daniel Král; Pavel Nejedlý; Riste Skrekovski (Eur. J. Comb., 2008)

Six-Critical Graphs on the Klein Bottle. - Nathan Chenette; Luke Postle; Noah Streib; Robin Thomas 001; Carl Yerger; Ken-ichi Kawarabayashi; Daniel Král; Jan Kyncl; Bernard Lidický (Electron. Notes Discret. Math., 2008)

List colorings with measurable sets. - Jan Hladký; Daniel Král; Jean-Sébastien Sereni; Michael Stiebitz (J. Graph Theory, 2008)

Hamiltonian threshold for strong products of graphs. - Daniel Král; Ladislav Stacho (J. Graph Theory, 2008)

Coloring of Triangle-Free Graphs on the Double Torus. - Daniel Král; Matej Stehlík (SIAM J. Discret. Math., 2008)

Bounds for the Real Number Graph Labellings and Application to Labellings of the Triangular Lattice. - Daniel Král; Petr Skoda 002 (SIAM J. Discret. Math., 2008)

Coloring triangle-free graphs on surfaces. - Zdenek Dvorák 001; Daniel Král; Robin Thomas 001 (SODA, 2009)

Algorithms for Classes of Graphs with Bounded Expansion. - Zdenek Dvorák 001; Daniel Král (WG, 2009)

A Note on Edge-Colourings Avoiding Rainbow K4 and Monochromatic Km. - Veselin Jungic; Tomás Kaiser; Daniel Král' (Electron. J. Comb., 2009)

Chromatic Number for a Generalization of Cartesian Product Graphs. - Daniel Král'; Douglas B. West (Electron. J. Comb., 2009)

Decomposition width - a new width parameter for matroids - Daniel Král (CoRR, 2009)

Distance constrained labelings of planar graphs with no short cycles. - Zdenek Dvorák 001; Daniel Král; Pavel Nejedlý; Riste Skrekovski (Discret. Appl. Math., 2009)

Graph labellings with variable weights, a survey. - Jerrold R. Griggs; Daniel Král (Discret. Appl. Math., 2009)

Projective, affine, and abelian colorings of cubic graphs. - Daniel Král; Edita Mácajová; Ondrej Pangrác; André Raspaud; Jean-Sébastien Sereni; Martin Skoviera (Eur. J. Comb., 2009)

Cubic bridgeless graphs have more than a linear number of perfect matchings. - Louis Esperet; Frantisek Kardos; Daniel Král (Electron. Notes Discret. Math., 2009)

Counting flags in triangle-free digraphs. - Jan Hladký; Daniel Král; Sergey Norin (Electron. Notes Discret. Math., 2009)

A combinatorial proof of the Removal Lemma for Groups. - Daniel Král; Oriol Serra; Lluís Vena (J. Comb. Theory A, 2009)

Polynomial-Size Binary Decision Diagrams for the Exactly Half-d-Hyperclique Problem Reading Each Input Bit Twice. - Daniel Král (Theory Comput. Syst., 2009)

Matchings and Nonrainbow Colorings. - Zdenek Dvorák 001; Stanislav Jendrol'; Daniel Král; Gyula Pap (SIAM J. Discret. Math., 2009)

Optimal Real Number Graph Labellings of a Subfamily of Kneser Graphs. - Rok Erman; Suzana Jurecic; Daniel Král; Kris Stopar; Nik Stopar (SIAM J. Discret. Math., 2009)

6-Critical Graphs on the Klein Bottle. - Ken-ichi Kawarabayashi; Daniel Král; Jan Kyncl; Bernard Lidický (SIAM J. Discret. Math., 2009)

A New Lower Bound on the Number of Perfect Matchings in Cubic Graphs. - Daniel Král; Jean-Sébastien Sereni; Michael Stiebitz (SIAM J. Discret. Math., 2009)

Deciding First-Order Properties for Sparse Graphs. - Zdenek Dvorák 001; Daniel Král; Robin Thomas 001 (FOCS, 2010)

Pattern Hypergraphs. - Zdenek Dvorák 001; Jan Kára; Daniel Král'; Ondrej Pangrác (Electron. J. Comb., 2010)

Toughness threshold for the existence of 2-walks in K4-minor-free graphs. - Zdenek Dvorák 001; Daniel Král'; Jakub Teska (Discret. Math., 2010)

Brooks' Theorem via the Alon-Tarsi Theorem. - Jan Hladký; Daniel Král'; Uwe Schauz (Discret. Math., 2010)

A note on antisymmetric flows in graphs. - Zdenek Dvorák 001; Tomás Kaiser; Daniel Král'; Jean-Sébastien Sereni (Eur. J. Comb., 2010)

An improved linear bound on the number of perfect matchings in cubic graphs. - Louis Esperet; Daniel Král'; Petr Skoda 002; Riste Skrekovski (Eur. J. Comb., 2010)

Facial colorings using Hall's Theorem. - Frédéric Havet; Daniel Král'; Jean-Sébastien Sereni; Riste Skrekovski (Eur. J. Comb., 2010)

Graphs with bounded tree-width and large odd-girth are almost bipartite. - Alexandr V. Kostochka; Daniel Král'; Jean-Sébastien Sereni; Michael Stiebitz (J. Comb. Theory B, 2010)

Circular edge-colorings of cubic graphs with girth six. - Daniel Král'; Edita Mácajová; Ján Mazák; Jean-Sébastien Sereni (J. Comb. Theory B, 2010)

Markov bases of binary graph models of K4-minor free graphs. - Daniel Král'; Serguei Norine; Ondrej Pangrác (J. Comb. Theory A, 2010)

Non-rainbow colorings of 3-, 4- and 5-connected plane graphs. - Zdenek Dvorák 001; Daniel Král'; Riste Skrekovski (J. Graph Theory, 2010)

Coloring plane graphs with independent crossings. - Daniel Král'; Ladislav Stacho (J. Graph Theory, 2010)

Short Cycle Covers of Graphs with Minimum Degree Three. - Tomás Kaiser; Daniel Král'; Bernard Lidický; Pavel Nejedlý; Robert Sámal (SIAM J. Discret. Math., 2010)

The Last Fraction of a Fractional Conjecture. - Frantisek Kardos; Daniel Král'; Jean-Sébastien Sereni (SIAM J. Discret. Math., 2010)

Deciding first order logic properties of matroids - Tomas Gavenciak; Daniel Král; Sang-il Oum (CoRR, 2011)

Fractional total colourings of graphs of high girth. - Tomás Kaiser; Andrew D. King; Daniel Král' (J. Comb. Theory B, 2011)

Triangles in arrangements of points and lines in the plane. - Pavel Klavík; Daniel Král'; Lukás Mach (J. Comb. Theory A, 2011)

Limit Behavior of Locally Consistent Constraint Satisfaction Problems. - Manuel Bodirsky; Daniel Král' (SIAM J. Discret. Math., 2011)

Fractional colorings of cubic graphs with large girth. - Frantisek Kardos; Daniel Král'; Jan Volec (SIAM J. Discret. Math., 2011)

Deciding First Order Properties of Matroids. - Tomas Gavenciak; Daniel Král; Sang-il Oum (ICALP (2), 2012)

Non-Three-Colourable Common Graphs Exist. - Hamed Hatami; Jan Hladký; Daniel Král'; Serguei Norine; Alexander A. Razborov (Comb. Probab. Comput., 2012)

Decomposition width of matroids. - Daniel Král' (Discret. Appl. Math., 2012)

A New Lower Bound Based on Gromov's Method of Selecting Heavily Covered Points. - Daniel Král'; Lukás Mach; Jean-Sébastien Sereni (Discret. Comput. Geom., 2012)

Cyclic colorings of plane graphs with independent faces. - Jernej Azarija; Rok Erman; Daniel Král'; Matjaz Krnc; Ladislav Stacho (Eur. J. Comb., 2012)

Classes of graphs with small rank decompositions are X-bounded. - Zdenek Dvorák 001; Daniel Král' (Eur. J. Comb., 2012)

A superlinear bound on the number of perfect matchings in cubic bridgeless graphs. - Louis Esperet; Frantisek Kardos; Daniel Král' (Eur. J. Comb., 2012)

Coloring Eulerian Triangulations of the Klein Bottle. - Daniel Král'; Bojan Mohar; Atsuhiro Nakamoto; Ondrej Pangrác; Yusuke Suzuki (Graphs Comb., 2012)

Domination number of cubic graphs with large girth. - Daniel Král'; Petr Skoda 002; Jan Volec (J. Graph Theory, 2012)

Maximum edge-cuts in cubic graphs with large girth and in random cubic graphs. - Frantisek Kardos; Daniel Král'; Jan Volec (Random Struct. Algorithms, 2012)

Extending Fractional Precolorings. - Daniel Král'; Matjaz Krnc; Martin Kupec; Borut Luzar; Jan Volec (SIAM J. Discret. Math., 2012)

Min-Max Relations for Odd Cycles in Planar Graphs. - Daniel Král'; Jean-Sébastien Sereni; Ladislav Stacho (SIAM J. Discret. Math., 2012)

Packing directed cycles through a specified vertex set. - Ken-ichi Kawarabayashi; Daniel Král'; Marek Krcál; Stephan Kreutzer (SODA, 2013)

A New Bound for the 2/3 Conjecture. - Daniel Král'; Chun-Hung Liu; Jean-Sébastien Sereni; Peter Whalen; Zelealem B. Yilma (Comb. Probab. Comput., 2013)

On the removal lemma for linear systems over Abelian groups. - Daniel Král'; Oriol Serra; Lluís Vena (Eur. J. Comb., 2013)

An application of flag algebras to a problem of Erdős and Sós. - Roman Glebov; Daniel Král'; Jan Volec (Electron. Notes Discret. Math., 2013)

Testing first-order properties for subclasses of sparse graphs. - Zdenek Dvorák 001; Daniel Král; Robin Thomas 001 (J. ACM, 2013)

Monochromatic triangles in three-coloured graphs. - James Cummings 001; Daniel Král'; Florian Pfender; Konrad Sperfeld; Andrew Treglown; Michael Young (J. Comb. Theory B, 2013)

On the number of pentagons in triangle-free graphs. - Hamed Hatami; Jan Hladký; Daniel Král'; Serguei Norine; Alexander A. Razborov (J. Comb. Theory A, 2013)

Rank of divisors on tropical curves. - Jan Hladký; Daniel Král'; Serguei Norine (J. Comb. Theory A, 2013)

Hereditary properties of permutations are strongly testable. - Tereza Klimosová; Daniel Král' (SODA, 2014)

Large permutations and parameter testing. - Roman Glebov; Carlos Hoppen; Tereza Klimosová; Yoshiharu Kohayakawa; Daniel Král; Hong Liu 010 (CoRR, 2014)

Infinite dimensional finitely forcible graphon. - Roman Glebov; Tereza Klimosová; Daniel Král (CoRR, 2014)

The fractional chromatic number of triangle-free subcubic graphs. - David G. Ferguson; Tomás Kaiser; Daniel Král' (Eur. J. Comb., 2014)

Extensions of Fractional Precolorings Show Discontinuous Behavior. - Jan van den Heuvel; Daniel Král; Martin Kupec; Jean-Sébastien Sereni; Jan Volec (J. Graph Theory, 2014)

FO Model Checking of Interval Graphs - Robert Ganian; Petr Hlinený; Daniel Král; Jan Obdrzálek; Jarett Schwartz; Jakub Teska (Log. Methods Comput. Sci., 2015)

Weak regularity and finitely forcible graph limits. - Jacob W. Cooper; Tomás Kaiser; Daniel Král'; Jonathan A. Noel (Electron. Notes Discret. Math., 2015)

Third case of the Cyclic Coloring Conjecture. - Michael Hebdige; Daniel Král' (Electron. Notes Discret. Math., 2015)

Finitely forcible graphons and permutons. - Roman Glebov; Andrzej Grzesik; Tereza Klimosová; Daniel Král (J. Comb. Theory B, 2015)

First-Order Convergence and Roots. - Demetres Christofides; Daniel Král' (Comb. Probab. Comput., 2016)

Packing six T-joins in plane graphs. - Zdenek Dvorák 001; Ken-ichi Kawarabayashi; Daniel Král' (J. Comb. Theory B, 2016)

Three-coloring triangle-free graphs on surfaces I. Extending a coloring to a disk with one triangle. - Zdenek Dvorák 001; Daniel Král'; Robin Thomas 001 (J. Comb. Theory B, 2016)

Graphic TSP in Cubic Graphs. - Zdenek Dvorák 001; Daniel Král; Bojan Mohar (STACS, 2017)

Deobfuscating sparse graphs. - Jakub Gajarský; Daniel Král (CoRR, 2017)

Densities in large permutations and parameter testing. - Roman Glebov; Carlos Hoppen; Tereza Klimosová; Yoshiharu Kohayakawa; Daniel Král'; Hong Liu 010 (Eur. J. Comb., 2017)

First order convergence of matroids. - Frantisek Kardos; Daniel Král'; Anita Liebenau; Lukás Mach (Eur. J. Comb., 2017)

Extremal graph theory and finite forcibility. - Andrzej Grzesik; Daniel Král'; László Miklós Lovász (Electron. Notes Discret. Math., 2017)

Steinberg's Conjecture is false. - Vincent Cohen-Addad; Michael Hebdige; Daniel Král'; Zhentao Li; Esteban Salgado (J. Comb. Theory B, 2017)

First order limits of sparse graphs: Plane trees and path-width. - Jakub Gajarský; Petr Hlinený; Tomás Kaiser; Daniel Král'; Martin Kupec; Jan Obdrzálek; Sebastian Ordyniak; Vojtech Tuma (Random Struct. Algorithms, 2017)

Augmenting Clinical Performance in Combat Casualty Care: Telemedicine to Automation. - Jeremy C. Pamplin; Ronald Yeaw; Gary R. Gilbert; Konrad L. Davis; Elizabeth Mann-Salinas; José Salinas; Daniel Král; Loretta Schlachta-Fairchild (HCI (16), 2018)

Recovering Sparse Graphs. - Jakub Gajarský; Daniel Král (MFCS, 2018)

Elusive extremal graphs. - Andrzej Grzesik; Daniel Král'; László Miklós Lovász (CoRR, 2018)

Three-coloring triangle-free graphs on surfaces II. 4-critical graphs in a disk. - Zdenek Dvorák 001; Daniel Král'; Robin Thomas 001 (J. Comb. Theory B, 2018)

Optimal-size clique transversals in chordal graphs. - Jacob W. Cooper; Andrzej Grzesik; Daniel Král' (J. Graph Theory, 2018)

Analytic representations of large graphs. - Andrzej Grzesik; Daniel Král (BCC, 2019)

A row-invariant parameterized algorithm for integer programming. - Martin Koutecký; Daniel Král (CoRR, 2019)

Decomposing Graphs into Edges and Triangles. - Daniel Král'; Bernard Lidický; Taísa L. Martins; Yanitsa Pehova (Comb. Probab. Comput., 2019)

The step Sidorenko property and non-norming edge-transitive graphs. - Daniel Král'; Taísa L. Martins; Péter Pál Pach; Marcin Wrochna (J. Comb. Theory A, 2019)

A bound on the inducibility of cycles. - Daniel Král'; Sergey Norin; Jan Volec (J. Comb. Theory A, 2019)

Cycles of length three and four in tournaments. - Timothy F. N. Chan; Andrzej Grzesik; Daniel Král'; Jonathan A. Noel (J. Comb. Theory A, 2020)

Three-coloring triangle-free graphs on surfaces III. Graphs of girth five. - Zdenek Dvorák 001; Daniel Král'; Robin Thomas 001 (J. Comb. Theory B, 2020)

Characterization of quasirandom permutations by a pattern sum. - Timothy F. N. Chan; Daniel Král'; Jonathan A. Noel; Yanitsa Pehova; Maryam Sharifzadeh; Jan Volec (Random Struct. Algorithms, 2020)

Permutations with fixed pattern densities. - Richard W. Kenyon; Daniel Král'; Charles Radin; Peter Winkler 001 (Random Struct. Algorithms, 2020)

Sparsity in Algorithms, Combinatorics and Logic (Dagstuhl Seminar 21391). - Daniel Král'; Michal Pilipczuk; Sebastian Siebertz; Blair D. Sullivan (Dagstuhl Reports, 2021)

Coloring graphs by translates in the circle. - Pablo Candela; Carlos Catalá; Robert Hancock 002; Adam Kabela; Daniel Král'; Ander Lamaison; Lluís Vena (Eur. J. Comb., 2021)

Cyclic coloring of plane graphs with maximum face size 16 and 17. - Zdenek Dvorák 001; Michael Hebdige; Filip Hlásek; Daniel Král'; Jonathan A. Noel (Eur. J. Comb., 2021)

Three-coloring triangle-free graphs on surfaces V. Coloring planar graphs with distant anomalies. - Zdenek Dvorák 001; Daniel Král'; Robin Thomas 001 (J. Comb. Theory B, 2021)

Three-coloring triangle-free graphs on surfaces IV. Bounding face sizes of 4-critical graphs. - Zdenek Dvorák 001; Daniel Král'; Robin Thomas 001 (J. Comb. Theory B, 2021)

Non-Bipartite K-Common Graphs. - Daniel Král'; Jonathan A. Noel; Sergey Norin; Jan Volec; Fan Wei (Comb., 2022)

Density Maximizers of Layered Permutations. - Adam Kabela; Daniel Král'; Jonathan A. Noel; Théo Pierron (Electron. J. Comb., 2022)

Inducibility and universality for trees. - Timothy F. N. Chan; Daniel Král'; Bojan Mohar; David R. Wood (Comb. Theory, 2022)

Packing and covering directed triangles asymptotically. - Jacob W. Cooper; Andrzej Grzesik; Adam Kabela; Daniel Král' (Eur. J. Comb., 2022)

Three-coloring triangle-free graphs on surfaces VII. A linear-time algorithm. - Zdenek Dvorák 001; Daniel Král'; Robin Thomas 001 (J. Comb. Theory B, 2022)

Quasirandom Latin squares. - Jacob W. Cooper; Daniel Král'; Ander Lamaison; Samuel Mohr (Random Struct. Algorithms, 2022)

Matrices of Optimal Tree-Depth and a Row-Invariant Parameterized Algorithm for Integer Programming. - Timothy F. N. Chan; Jacob W. Cooper; Martin Koutecký; Daniel Král; Kristýna Pekárková (SIAM J. Comput., 2022)

Closure property of contraction-depth of matroids. - Marcin Brianski; Daniel Král; Ander Lamaison (CoRR, 2023)

No additional tournaments are quasirandom-forcing. - Robert Hancock 002; Adam Kabela; Daniel Král'; Taísa Martins; Roberto Parente; Fiona Skerman; Jan Volec (Eur. J. Comb., 2023)

Cycles of a given length in tournaments. - Andrzej Grzesik; Daniel Král'; László Miklós Lovász; Jan Volec (J. Comb. Theory B, 2023)

Toward characterizing locally common graphs. - Robert Hancock 002; Daniel Král'; Matjaz Krnc; Jan Volec (Random Struct. Algorithms, 2023)

Quasirandom-Forcing Orientations of Cycles. - Andrzej Grzesik; Daniel Il'kovic; Bartlomiej Kielak; Daniel Král' (SIAM J. Discret. Math., 2023)

Twin-Width of Graphs on Surfaces. - Daniel Král; Kristýna Pekárková; Kenny Storgel (MFCS, 2024)

Branch-depth is minor closure of contraction-deletion-depth. - Marcin Brianski; Daniel Král; Kristýna Pekárková (CoRR, 2024)

Forcing quasirandomness with 4-point permutations. - Daniel Král; Jae-Baek Lee; Jonathan A. Noel (CoRR, 2024)

Forcing generalised quasirandom graphs efficiently. - Andrzej Grzesik; Daniel Král'; Oleg Pikhurko (Comb. Probab. Comput., 2024)

Three-coloring triangle-free graphs on surfaces VI. 3-colorability of quadrangulations. - Zdenek Dvorák 001; Daniel Král'; Robin Thomas 001 (J. Comb. Theory B, 2024)

Characterization of matrices with bounded Graver bases and depth parameters and applications to integer programming. - Marcin Brianski; Martin Koutecký; Daniel Král'; Kristýna Pekárková; Felix Schröder (Math. Program., 2024)

Preface. - Frederik Garbe; Daniel Král'; Jaroslav Nesetril (Eur. J. Comb., 2025)

Planar graph with twin-width seven. - Daniel Král'; Ander Lamaison (Eur. J. Comb., 2025)

Preface. - Daniel Král'; Michal Pilipczuk; Sebastian Siebertz; Blair D. Sullivan (Eur. J. Comb., 2025)

The Dimension of the Region of Feasible Tournament Profiles. - Daniel Král'; Ander Lamaison; Magdalena Prorok; Xichao Shu (SIAM J. Discret. Math., 2025)