Academic qualifications, summary of research achievements
Doctor of Science (DSc) received in October 2012 from the Academy of Sciences of the Czech Republic
Doctorate Degree (PhD) in Computer Science received in August 2004 from Charles University, Prague, Czech Republic
Master Degree (Mgr) in Computer Science received in September 2001 from Charles University, Prague, Czech Republic
Philip Leverhulme Prize in Mathematics and Statistics 2014
over 100 journal research papers and over 20 in refereed computer science conferences
journal publications include those in
Advances in Mathematics,
Canadian Journal of Mathematics,
Geometric and Functional Analysis,
Israel Journal of Mathematics,
Journal of the ACM,
Journal of Combinatorial Theory Series A and B, and
SIAM Journal on Discrete Mathematics
conference publication include those at FOCS, ICALP, SODA and STACS
over 500 non-self-citations according to WoS, H-index: 12 (WoS), 13 (MathSciNet), 23 (Google Scholar) as of January 2017
since October 2012, professor, Mathematics Institute and Department of Computer Science, University of Warwick, Coventry
member of the Centre for Discrete Mathematics and its Applications (DIMAP)
July 2010-September 2012, associate professor, Department of Applied Mathematics (2010-11) and Computer Science Institute (2012), Charles University, Prague
February 2011-December 2012, adjunct researcher, Department of Mathematics, University of West Bohemia, Pilsen
August 2006-June 2010, researcher, Institute for Theoretical Computer Science, Charles University, Prague
October 2005-July 2006, visiting assistant professor and Fulbright scholar, School of Mathematics, Georgia Institute of Technology, Atlanta
August-September 2005, researcher, Department of Applied Mathematics, Charles University, Prague
October 2004-July 2005, postdoctoral fellow, Institute for Mathematics, Technical University Berlin; the position was funded by the European training network COMBSTRU
November 2001-September 2004, junior researcher, Institute for Theoretical Computer Science, Charles University, Prague
September 2001-August 2004, PhD student, Charles University, Prague;
PhD thesis on the topic of graph coloring problems advised by Jan Kratochvíl
Editor-in-Chief: SIAM Journal on Discrete Mathematics (since 2017, associate editor since 2012)
Associate editor: Discrete Mathematics (since 2010) and Discrete Optimization (2010-2016)
Editorial board membership: Journal of Graph Theory (since 2008) and European Journal of Combinatorics (since 2009)
member of the steering committee of SODA (since 2016)
Organization of schools and workshops: CCOSA Fall School 2011, CCOSA Winter School 2013, ICMS workshop on extremal combinatorics 2014, LMS-CMI Research school on Regularity and Analytic Methods in Combinatorics 2015, Oberwolfach workshop on graph theory 2016, Workshop on Algorithms, Logic and Structure 2016, 10 Year Anniversary DIMAP Workshop 2017, Workshop in Honour of Mike Paterson's 75th Birthday 2017
Computer Science Panel of the Czech Science Foundation (2011-15, vice-chair 2012)
Computer Science Board of the Charles University Grant Agency (member since 2010)
Supervision of graduate students and postdoctoral fellows
Postdocs: Jean-Sébastien Sereni (2006-08), Louis Esperet (2008-09), Demetres Christofides (2010-11), Ján Mazák (2011-12), Andrew Treglown (2011-12), Roman Glebov (2013), Anita Liebenau (2013-15), Ping Hu (2014-), Tamás Hubai (2015-)
Former PhD students: Pavel Nejedlý (Charles University, 2008), Jan Hladký (Charles University, 2013), Jan Volec (University of Warwick and Université Paris Diderot - Paris 7, 2014, co-advised with Jean-Sébastien Sereni), Lukáš Mach (University of Warwick, 2015),Tereza Klimošová (University of Warwick, 2015)
Current PhD students: Taísa Lopes Martins, Yanitsa Pehova, Jordan Venters
Student internships: Andrew King (2008-09), Andrzej Grzesik (2013 and 2014), Matjaž Krnc (2013), Fiona Skerman (2014), Francois Dross (2015), James Hirst (2016)
Extremal combinatorics and dense combinatorial structures
Analytic methods in combinatorics, in particular, combinatorial limits
Structural graph theory, in particular, graph coloring
Logic methods in graph and matroid theory and their algorithmic applications
J. W. Cooper, D. Kráľ, T. Martins: Finitely forcible graph limits are universal, available as arXiv:1701.03846.
Z. Dvořák, D. Kráľ, R. Thomas: Testing first-order properties for subclasses of sparse graphs, Journal of ACM 60 (2013), article no. 36.
L. Esperet, F. Kardoš, A. King, D. Kráľ, S. Norine: Exponentially many perfect matchings in cubic graphs, Advances in Mathematics 227 (2011), 1646-1664.
D. Kráľ, O. Pikhurko: Quasirandom permutations are characterized by 4-point densities, Geometric and Functional Analysis 23 (2013), 570-579.
D. Kráľ, O. Serra, L. Vena: A Removal Lemma for systems of linear equations over finite fields, Israel Journal of Mathematics 187 (2012), 193-207.
D. Kráľ, R. Škrekovski: A Theorem about the channel assignment problem, SIAM Journal on Discrete Mathematics 16 (2003), 426-437.