Daniel Král - RankMe

131 papers A* 5A 4B 15Journal 102Unranked 4

Year	Rank	Type	Title / Venue / Authors
2026	J	`jnl`	Hypergraphs with uniform Turán density equal to 8/27. Comb. Probab. Comput. Frederik Garbe, Daniel Il'kovic, Daniel Král, Filip Kucerák, Ander Lamaison
2026	J	`jnl`	Strong modeling limits of graphs with bounded tree-width. Eur. J. Comb. Andrzej Grzesik, Daniel Král, Samuel Mohr
2025	B	`ed.`	Graph-Theoretic Concepts in Computer Science - 50th International Workshop, WG 2024, Gozd Martuljek, Slovenia, June 19-21, 2024, Revised Selected Papers WG Daniel Král, Martin Milanic
2024	J	`jnl`	Branch-depth is minor closure of contraction-deletion-depth. CoRR Marcin Brianski, Daniel Král, Kristýna Pekárková
2024	J	`jnl`	Forcing quasirandomness with 4-point permutations. CoRR Daniel Král, Jae-Baek Lee, Jonathan A. Noel
2024	B	`conf`	Twin-Width of Graphs on Surfaces. MFCS Daniel Král, Kristýna Pekárková, Kenny Storgel
2023	J	`jnl`	Closure property of contraction-depth of matroids. CoRR Marcin Brianski, Daniel Král, Ander Lamaison
2023	J	`jnl`	Twin-width of graphs on surfaces. CoRR Daniel Král, Kristýna Pekárková, Kenny Storgel
2022	J	`jnl`	Characterization of matrices with bounded Graver bases and depth parameters and applications to integer programming. CoRR Marcin Brianski, Martin Koutecký, Daniel Král, Kristýna Pekárková, Felix Schröder
2022	J	`jnl`	Matrices of Optimal Tree-Depth and a Row-Invariant Parameterized Algorithm for Integer Programming. SIAM J. Comput. Timothy F. N. Chan, Jacob W. Cooper, Martin Koutecký, Daniel Král, Kristýna Pekárková
2022	J	`jnl`	Planar graph with twin-width seven. CoRR Daniel Král, Ander Lamaison
2019	J	`jnl`	A row-invariant parameterized algorithm for integer programming. CoRR Martin Koutecký, Daniel Král
2019	—	`conf`	Analytic representations of large graphs. BCC Andrzej Grzesik, Daniel Král
2019	J	`jnl`	No additional tournaments are quasirandom-forcing. CoRR Robert Hancock, Adam Kabela, Daniel Král, Taísa L. Martins, Roberto Parente, Fiona Skerman, Jan Volec
2018	—	`conf`	Augmenting Clinical Performance in Combat Casualty Care: Telemedicine to Automation. HCI (16) Jeremy C. Pamplin, Ronald Yeaw, Gary R. Gilbert, Konrad L. Davis, Elizabeth Mann-Salinas, José Salinas, Daniel Král, Loretta Schlachta-Fairchild
2018	B	`conf`	Recovering Sparse Graphs. MFCS Jakub Gajarský, Daniel Král
2017	J	`jnl`	Deobfuscating sparse graphs. CoRR Jakub Gajarský, Daniel Král
2017	A	`conf`	Graphic TSP in Cubic Graphs. STACS Zdenek Dvorák, Daniel Král, Bojan Mohar
2016	J	`jnl`	Graphic TSP in cubic graphs. CoRR Zdenek Dvorák, Daniel Král, Bojan Mohar
2016	J	`jnl`	Third Case of the Cyclic Coloring Conjecture. SIAM J. Discret. Math. Michael Hebdige, Daniel Král
2016	J	`jnl`	Three-coloring triangle-free graphs on surfaces VII. A linear-time algorithm. CoRR Zdenek Dvorák, Daniel Král, Robin Thomas
2015	J	`jnl`	FO Model Checking of Interval Graphs Log. Methods Comput. Sci. Robert Ganian, Petr Hlinený, Daniel Král, Jan Obdrzálek, Jarett Schwartz, Jakub Teska
2015	J	`jnl`	Finitely forcible graphons and permutons. J. Comb. Theory B Roman Glebov, Andrzej Grzesik, Tereza Klimosová, Daniel Král
2015	J	`jnl`	First order convergence of matroids. CoRR Frantisek Kardos, Daniel Král, Anita Liebenau, Lukás Mach
2015	—	`book`	Surveys in Combinatorics 2015 Artur Czumaj, Agelos Georgakopoulos, Daniel Král, Vadim V. Lozin, Oleg Pikhurko
2015	J	`jnl`	Three-coloring triangle-free graphs on surfaces VI. 3-colorability of quadrangulations. CoRR Zdenek Dvorák, Daniel Král, Robin Thomas
2015	J	`jnl`	Weak regularity and finitely forcible graph limits. CoRR Jacob W. Cooper, Tomás Kaiser, Daniel Král, Jonathan A. Noel
2014	J	`jnl`	Extensions of Fractional Precolorings Show Discontinuous Behavior. J. Graph Theory Jan van den Heuvel, Daniel Král, Martin Kupec, Jean-Sébastien Sereni, Jan Volec
2014	J	`jnl`	First order convergence and roots. CoRR Demetres Christofides, Daniel Král
2014	J	`jnl`	Infinite dimensional finitely forcible graphon. CoRR Roman Glebov, Tereza Klimosová, Daniel Král
2014	J	`jnl`	Large permutations and parameter testing. CoRR Roman Glebov, Carlos Hoppen, Tereza Klimosová, Yoshiharu Kohayakawa, Daniel Král, Hong Liu
2013	J	`jnl`	Testing first-order properties for subclasses of sparse graphs. J. ACM Zdenek Dvorák, Daniel Král, Robin Thomas
2013	J	`jnl`	Three-coloring triangle-free graphs on surfaces II. 4-critical graphs in a disk CoRR Zdenek Dvorák, Daniel Král, Robin Thomas
2012	—	`conf`	Deciding First Order Properties of Matroids. ICALP (2) Tomas Gavenciak, Daniel Král, Sang-il Oum
2012	J	`jnl`	Hereditary properties of permutations are strongly testable CoRR Tereza Klimosová, Daniel Král
2011	J	`jnl`	Deciding first order logic properties of matroids CoRR Tomas Gavenciak, Daniel Král, Sang-il Oum
2011	J	`jnl`	Testing first-order properties for subclasses of sparse graphs CoRR Zdenek Dvorák, Daniel Král, Robin Thomas
2010	A*	`conf`	Deciding First-Order Properties for Sparse Graphs. FOCS Zdenek Dvorák, Daniel Král, Robin Thomas
2010	J	`jnl`	Three-coloring triangle-free graphs on surfaces I. Extending a coloring to a disk with one triangle CoRR Zdenek Dvorák, Daniel Král, Robin Thomas
2009	J	`jnl`	6-Critical Graphs on the Klein Bottle. SIAM J. Discret. Math. Ken-ichi Kawarabayashi, Daniel Král, Jan Kyncl, Bernard Lidický
2009	J	`jnl`	A New Lower Bound on the Number of Perfect Matchings in Cubic Graphs. SIAM J. Discret. Math. Daniel Král, Jean-Sébastien Sereni, Michael Stiebitz
2009	J	`jnl`	A combinatorial proof of the Removal Lemma for Groups. J. Comb. Theory A Daniel Král, Oriol Serra, Lluís Vena
2009	B	`conf`	Algorithms for Classes of Graphs with Bounded Expansion. WG Zdenek Dvorák, Daniel Král
2009	J	`jnl`	Circular edge-colorings of cubic graphs with girth six. Electron. Notes Discret. Math. Daniel Král, Edita Mácajová, Ján Mazák, Jean-Sébastien Sereni
2009	A*	`conf`	Coloring triangle-free graphs on surfaces. SODA Zdenek Dvorák, Daniel Král, Robin Thomas
2009	J	`jnl`	Counting flags in triangle-free digraphs. Electron. Notes Discret. Math. Jan Hladký, Daniel Král, Sergey Norin
2009	J	`jnl`	Cubic bridgeless graphs have more than a linear number of perfect matchings. Electron. Notes Discret. Math. Louis Esperet, Frantisek Kardos, Daniel Král
2009	J	`jnl`	Decomposition width - a new width parameter for matroids CoRR Daniel Král
2009	J	`jnl`	Distance constrained labelings of K Discret. Math. Daniel Král, Pavel Nejedlý
2009	J	`jnl`	Distance constrained labelings of planar graphs with no short cycles. Discret. Appl. Math. Zdenek Dvorák, Daniel Král, Pavel Nejedlý, Riste Skrekovski
2009	J	`jnl`	Graph labellings with variable weights, a survey. Discret. Appl. Math. Jerrold R. Griggs, Daniel Král
2009	J	`jnl`	Matchings and Nonrainbow Colorings. SIAM J. Discret. Math. Zdenek Dvorák, Stanislav Jendrol', Daniel Král, Gyula Pap
2009	J	`jnl`	Optimal Real Number Graph Labellings of a Subfamily of Kneser Graphs. SIAM J. Discret. Math. Rok Erman, Suzana Jurecic, Daniel Král, Kris Stopar, Nik Stopar
2009	J	`jnl`	Polynomial-Size Binary Decision Diagrams for the Exactly Half- Theory Comput. Syst. Daniel Král
2009	J	`jnl`	Projective, affine, and abelian colorings of cubic graphs. Eur. J. Comb. Daniel Král, Edita Mácajová, Ondrej Pangrác, André Raspaud, Jean-Sébastien Sereni, Martin Skoviera
2008	J	`jnl`	Bounds for the Real Number Graph Labellings and Application to Labellings of the Triangular Lattice. SIAM J. Discret. Math. Daniel Král, Petr Skoda
2008	J	`jnl`	Coloring even-faced graphs in the torus and the Klein bottle. Comb. Daniel Král, Robin Thomas
2008	J	`jnl`	Coloring of Triangle-Free Graphs on the Double Torus. SIAM J. Discret. Math. Daniel Král, Matej Stehlík
2008	J	`jnl`	Coloring squares of planar graphs with girth six. Eur. J. Comb. Zdenek Dvorák, Daniel Král, Pavel Nejedlý, Riste Skrekovski
2008	J	`jnl`	Hamiltonian threshold for strong products of graphs. J. Graph Theory Daniel Král, Ladislav Stacho
2008	J	`jnl`	List colorings with measurable sets. J. Graph Theory Jan Hladký, Daniel Král, Jean-Sébastien Sereni, Michael Stiebitz
2008	J	`jnl`	Randomized strategies for the plurality problem. Discret. Appl. Math. Daniel Král, Jirí Sgall, Tomás Tichý
2008	J	`jnl`	Six-Critical Graphs on the Klein Bottle. Electron. Notes Discret. Math. Nathan Chenette, Luke Postle, Noah Streib, Robin Thomas, Carl Yerger, Ken-ichi Kawarabayashi, Daniel Král, Jan Kyncl, Bernard Lidický
2007	J	`jnl`	Characterization of affine Steiner triple systems and Hall triple systems. Electron. Notes Discret. Math. Daniel Král, Edita Mácajová, Attila Pór, Jean-Sébastien Sereni
2007	J	`jnl`	Closure for the property of having a hamiltonian prism. J. Graph Theory Daniel Král, Ladislav Stacho
2007	B	`conf`	Coloring Triangle-Free Graphs on Surfaces. ISAAC Zdenek Dvorák, Daniel Král, Robin Thomas
2007	A	`conf`	Computing Representations of Matroids of Bounded Branch-Width. STACS Daniel Král
2007	J	`jnl`	Cyclic, diagonal and facial colorings - a missing case. Eur. J. Comb. Daniel Král, Tomás Madaras, Riste Skrekovski
2007	J	`jnl`	Distance Constrained Labelings of K Electron. Notes Discret. Math. Daniel Král, Pavel Nejedlý
2007	J	`jnl`	Edge-colorings of cubic graphs with elements of point-transitive Steiner triple systems. Electron. Notes Discret. Math. Daniel Král, Edita Mácajová, Attila Pór, Jean-Sébastien Sereni
2007	J	`jnl`	Hamilton cycles in prisms. J. Graph Theory Tomás Kaiser, Zdenek Ryjácek, Daniel Král, Moshe Rosenfeld, Heinz-Jürgen Voss
2007	J	`jnl`	Labeling planar graphs with a condition at distance two. Eur. J. Comb. Peter Bella, Daniel Král, Bojan Mohar, Katarína Quittnerová
2007	J	`jnl`	Labelings of Graphs with Fixed and Variable Edge-Weights. SIAM J. Discret. Math. Robert Babilon, Vít Jelínek, Daniel Král, Pavel Valtr
2007	J	`jnl`	Mixed hypergraphs and other coloring problems. Discret. Math. Daniel Král
2007	J	`jnl`	Probabilistic strategies for the partition and plurality problems. Random Struct. Algorithms Zdenek Dvorák, Vít Jelínek, Daniel Král, Jan Kyncl, Michael E. Saks
2007	J	`jnl`	The circular chromatic index of graphs of high girth. J. Comb. Theory B Tomás Kaiser, Daniel Král, Riste Skrekovski, Xuding Zhu
2007	J	`jnl`	Tough spiders. J. Graph Theory Tomás Kaiser, Daniel Král, Ladislav Stacho
2006	J	`jnl`	Coloring mixed hypertrees. Discret. Appl. Math. Daniel Král, Jan Kratochvíl, Andrzej Proskurowski, Heinz-Jürgen Voss
2006	J	`jnl`	Colorings Of Plane Graphs With No Rainbow Faces. Comb. Veselin Jungic, Daniel Král, Riste Skrekovski
2006	J	`jnl`	Construction of Large Graphs with No Optimal Surjective L(2, 1)-Labelings. SIAM J. Discret. Math. Daniel Král, Riste Skrekovski, Martin Tancer
2006	J	`jnl`	Eulerian colorings and the bipartizing matchings conjecture of Fleischner. Eur. J. Comb. Zdenek Dvorák, Tomás Kaiser, Daniel Král
2006	J	`jnl`	Extending partial 5-colorings and 6-colorings in planar graphs. J. Comb. Theory B Daniel Král
2006	J	`jnl`	Free binary decision diagrams for the computation of EAR Comput. Complex. Jan Kára, Daniel Král
2006	J	`jnl`	List coloring of Cartesian products of graphs. Discret. Math. Mieczyslaw Borowiecki, Stanislav Jendrol', Daniel Král, Jozef Miskuf
2006	J	`jnl`	The Channel Assignment Problem with Variable Weights. SIAM J. Discret. Math. Daniel Král
2006	J	`jnl`	The Circular Chromatic Index of Flower Snarks. Electron. J. Comb. Mohammad Ghebleh, Daniel Král, Serguei Norine, Robin Thomas
2006	J	`jnl`	The last excluded case of Dirac's map-color theorem for choosability. J. Graph Theory Daniel Král, Riste Skrekovski
2005	J	`jnl`	A Brooks-Type Theorem for the Generalized List T-Coloring. SIAM J. Discret. Math. Jirí Fiala, Daniel Král, Riste Skrekovski
2005	J	`jnl`	A note on group colorings. J. Graph Theory Daniel Král, Ondrej Pangrác, Heinz-Jürgen Voss
2005	B	`conf`	An Asymptotically Optimal Linear-Time Algorithm for Locally Consistent Constraint Satisfaction Problems. MFCS Daniel Král, Ondrej Pangrác
2005	J	`jnl`	An exact algorithm for the channel assignment problem. Discret. Appl. Math. Daniel Král
2005	J	`jnl`	Coloring face hypergraphs on surfaces. Eur. J. Comb. Zdenek Dvorák, Daniel Král, Riste Skrekovski
2005	J	`jnl`	Coloring graphs from lists with bounded size of their union. J. Graph Theory Daniel Král, Jirí Sgall
2005	J	`jnl`	Cyclic, diagonal and facial colorings. Eur. J. Comb. Daniel Král, Tomás Madaras, Riste Skrekovski
2005	J	`jnl`	Group coloring is π Theor. Comput. Sci. Daniel Král
2005	J	`jnl`	Hamilton cycles in strong products of graphs. J. Graph Theory Daniel Král, Jana Maxová, Robert Sámal, Pavel Podbrdský
2005	B	`conf`	Locally Consistent Constraint Satisfaction Problems with Binary Constraints. WG Manuel Bodirsky, Daniel Král
2005	J	`jnl`	Locally consistent constraint satisfaction problems. Theor. Comput. Sci. Zdenek Dvorák, Daniel Král, Ondrej Pangrác
2005	A	`conf`	Three Optimal Algorithms for Balls of Three Colors. STACS Zdenek Dvorák, Vít Jelínek, Daniel Král, Jan Kyncl, Michael E. Saks
2005	A*	`conf`	Two algorithms for general list matrix partitions. SODA Tomás Feder, Pavol Hell, Daniel Král, Jirí Sgall
2005	J	`jnl`	Unions of perfect matchings in cubic graphs. Electron. Notes Discret. Math. Tomás Kaiser, Daniel Král, Serguei Norine
2004	J	`jnl`	A revival of the girth conjecture. J. Comb. Theory B Tomás Kaiser, Daniel Král, Riste Skrekovski
2004	—	`conf`	An Algorithm for Cyclic Edge Connectivity of Cubic Graphs. SWAT Zdenek Dvorák, Jan Kára, Daniel Král, Ondrej Pangrác
2004	J	`jnl`	Borodin's conjecture on diagonal coloring is false. Eur. J. Comb. Daniel Král, Riste Skrekovski
2004	J	`jnl`	Coloring Powers of Chordal Graphs. SIAM J. Discret. Math. Daniel Král
2004	J	`jnl`	Edge-disjoint odd cycles in planar graphs. J. Comb. Theory B Daniel Král, Heinz-Jürgen Voss
2004	B	`conf`	Group Coloring and List Group Coloring Are Pi MFCS Daniel Král, Pavel Nejedlý
2004	J	`jnl`	Hajós' theorem for list coloring. Discret. Math. Daniel Král
2004	J	`jnl`	It is tough to be a plumber. Theor. Comput. Sci. Daniel Král, Vladan Majerech, Jirí Sgall, Tomás Tichý, Gerhard J. Woeginger
2004	A*	`conf`	Locally Consistent Constraint Satisfaction Problems: (Extended Abstract). ICALP Zdenek Dvorák, Daniel Král, Ondrej Pangrác
2004	J	`jnl`	Locally consistent constraint satisfaction problems Electron. Colloquium Comput. Complex. Zdenek Dvorák, Daniel Král, Ondrej Pangrác
2004	A*	`conf`	Locally satisfiable formulas. SODA Daniel Král
2004	J	`jnl`	Mixed hypercacti. Discret. Math. Daniel Král, Jan Kratochvíl, Heinz-Jürgen Voss
2004	J	`jnl`	On Feasible Sets of Mixed Hypergraphs. Electron. J. Comb. Daniel Král
2004	J	`jnl`	On maximum face-constrained coloring of plane graphs with no short face cycles. Discret. Math. Daniel Král
2004	J	`jnl`	Pancyclicity of Strong Products of Graphs. Graphs Comb. Daniel Král, Jana Maxová, Pavel Podbrdský, Robert Sámal
2003	J	`jnl`	A Theorem about the Channel Assignment Problem. SIAM J. Discret. Math. Daniel Král, Riste Skrekovski
2003	J	`jnl`	Free Binary Decision Diagrams for Computation of EAR Electron. Colloquium Comput. Complex. Jan Kára, Daniel Král
2003	J	`jnl`	Locally satisfiable formulas Electron. Colloquium Comput. Complex. Daniel Král
2003	J	`jnl`	Minimum Degree and the Number of Chords. Ars Comb. Jan Kára, Daniel Král
2003	J	`jnl`	Mixed hypergraphs with bounded degree: edge-coloring of mixed multigraphs. Theor. Comput. Sci. Daniel Král, Jan Kratochvíl, Heinz-Jürgen Voss
2002	B	`conf`	Complexity of Pattern Coloring of Cycle Systems. WG Zdenek Dvorák, Jan Kára, Daniel Král, Ondrej Pangrác
2002	B	`conf`	Optimal Free Binary Decision Diagrams for Computation of EAR MFCS Jan Kára, Daniel Král
2001	B	`conf`	Complexity Note on Mixed Hypergraphs. MFCS Daniel Král, Jan Kratochvíl, Heinz-Jürgen Voss
2001	B	`conf`	Complexity of Coloring Graphs without Forbidden Induced Subgraphs. WG Daniel Král, Jan Kratochvíl, Zsolt Tuza, Gerhard J. Woeginger
2001	B	`conf`	On Complexity of Colouring Mixed Hypertrees. FCT Daniel Král
2001	A	`conf`	On Intersection Graphs of Segments with Prescribed Slopes. GD Jakub Cerný, Daniel Král, Helena Nyklová, Ondrej Pangrác
2001	J	`jnl`	On Planar Mixed Hypergraphs. Electron. J. Comb. Zdenek Dvorák, Daniel Král
2000	B	`conf`	Algebraic and Uniqueness Properties of Parity Ordered Binary Decision Diagrams and Their Generalization. MFCS Daniel Král
2000	J	`jnl`	Algebraic and Uniqueness Properties of Parity Ordered Binary Decision Diagrams and their Generalization Electron. Colloquium Comput. Complex. Daniel Král
2000	B	`conf`	Coloring Mixed Hypertrees. WG Daniel Král, Jan Kratochvíl, Andrzej Proskurowski, Heinz-Jürgen Voss