Curriculum vitae of Daniel Kráµ

Academic qualifications, summary of research achievements

• 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
• 93 research papers accepted for publication in journals and 1 in a book, 2 survey papers, and 20 papers accepted to refereed international conferences
  journal publications include those in Advances in Mathematics, Canadian Journal of Mathematics, Combinatorica, Computational Complexity, European Journal of Combinatorics, Israel Journal of Mathematics, Journal of Combinatorial Theory Series A and B, Journal of Graph Theory and SIAM Journal on Discrete Mathematics
  conference publication include those at FOCS, ICALP, SODA and STACS
• more than 200 non-self-citations in published articles, Hirsch index 6 as of November 2010

Employment history

• July 2010-now, associate professor (tenured), Charles University, Prague
  February 2011-now, adjunct researcher, University of West Bohemia, Pilsen
• August 2006-June 2010, researcher of Institute for Theoretical Computer Science, Charles University, Prague
• October 2005-July 2006, visiting assistant professor and Fulbright scholar at School of Mathematics of Georgia Institute of Technology
• August-September 2005, researcher of Department of Applied Mathematics, Charles University, Prague
• October 2004-July 2005, postdoctoral fellow at Institute for Mathematics of Technical University Berlin; the position was funded by the European training network COMBSTRU
• November 2001-September 2004, junior researcher of Institute for Theoretical Computer Science, Charles University, Prague
  September 2001-August 2004, PhD student of Charles University, Prague; PhD thesis on the topic of graph coloring problems advised by Jan Kratochvil

Professional distinction

• holder of the ERC Starting grant "CCOSA: Classes of combinatorial objects - from structure to algorithms"
• awarded the European prize for combinatorics in 2011
• invited plenary talks: 43th International Czech and Slovak Conference Graphs 2008, 35th International Workshop on Graph-Theoretic Concepts in Computer Science (WG'09), 18th workshop Cycles and Colourings (C&C'09), Young Workshop in Arithmetics and Combinatorics (ICMAT'11), Workshop on Graph Homomorphisms, Fields Institute, Toronto, Canada, 2011, European Conference on Combinatorics, Graph Theory and Applications 2011 (Eurocomb'11), Joint Mathematical Conference CSASC 2011 and Kolloquium uber Kombinatorik 2011 (Kolkom'11)
• other prizes/awards: prize of the Czech Union of Mathematicians for young mathematicians in 2006, Bolzano Foundation Award in 2008 and the Neuron prize for young mathematicians given by Karel Janecek foundation in 2010
  the best alumni award given by Czech Ministry of Education, the Bolzano award given by Charles University, the Carolinum association award 2004, EATCS best student paper award at MFCS'02 and at MFCS'04, best student paper award at SWAT'04
  the winner of the International Olympiad in Informatics (IOI) 1996

Professional service

• member of the editorial board of Journal of Graph Theory (since 2008) and European Journal of Combinatorics (since 2009), associate editor of Discrete Mathematics (since 2010), Discrete Optimization (since 2010) and SIAM Journal on Discrete Mathematics (since 2012)
• member of the program committee of WG'06, MFCS'10, SODA'12 and SOFSEM'12, and the committee for the SIAM Conference on Discrete Mathematics 2012
• member of the Computer Science Panel of the Czech Grant Agency (since 2011) and the Computer Science Board of the Charles University Grant Agency (since 2010)

Teaching, advising students

• instructor of courses on algorithms, combinatorics, graph theory, linear algebra methods, matroid theory and programming taught at Charles University in Prague, Georgia Institute of Technology and University of West Bohemia in Pilsen
  half-semester courses taught (as a visiting professor) at LIAFA in Paris, France, and at University of Pavol Jozef ©afárik in Koąice, Slovakia
• 4 bachelor, 3 master and 1 PhD students defended their thesis under my supervision
  advisor of 5 student projects awarded prizes at the competition of Czech and Slovak bachelor and master students
• active in the national olympiad in informatics (a computer science competition for high school students), member of the Central Committee of Czech Olympiad in Informatics (since 2005), coauthor of several papers in a Czech journal for high school students and teachers of mathematics and physics

Lecture notes

• D. Kráµ, O. Pangrác: Introduction to matroid theory (lecture notes), Matfyzpress, Publishing House of the Faculty of Mathematics and Physics of Charles University in Prague, 2009, ISBN 978-80-7378-062-3, 113 pp.

Research interests

• structural graph theory, in particular, graph coloring
• extremal combinatorics and dense combinatorial objects
• use of combinatorial optimization techniques in graph theory
• graph and matroid decompositions and their algorithmic applications

Most important papers

• 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. Serra, L. Vena: A Removal Lemma for systems of linear equations over finite fields, to appear in Israel Journal of Mathematics.
• Z. Dvořák, D. Kráµ, R. Thomas: Deciding first-order properties for sparse graphs, Proceedings 51st Annual IEEE Symposium on Foundations of Computer Science (FOCS'10), pp. 133-142, 2010.
• D. Kráµ, R. ©krekovski: A Theorem about the Channel Assignment Problem, SIAM Journal on Discrete Mathematics 16(3) (2003), 426-437.
• T. Kaiser, A. King, D. Kráµ: Fractional total colourings of graphs of high girth, Journal of Combinatorial Theory Series B 101 (2011), 383-402.

List of publications

Teaching experience

List of talks

List of awards obtained