Curriculum vitae of Dániel Marx

• Name: Dániel Marx
• Nationality: Hungarian
• Birth: February 24, 1977, Budapest

• 2005: PhD obtained, Budapest University of Technology and Economics
  Dissertation title: Graph coloring with local and global constraints
• 2000-2003: PhD student (advisor: Katalin Friedl), Budapest University of Technology and Economics, computer science program
• 1995-2000: M.Sc. in computer science, Budapest University of Technology and Economics, degree with distinction
  Thesis title: Graph theoretic problems in designing all-optical networks [in Hungarian]

• 2009- Post-doc research fellow, Blavatnik School of Computer Science, Tel Aviv University,
• 2007-2009:Magyary Zoltán post-doc research fellow at Budapest University of Technology and Economics, Department of Computer Science and Information Theory
• 2007: research fellow at Computer and Automaton Research Institute Hungarian Academy of Sciences (SZTAKI), Budapest, Hungary.
• 2005-2007: post-doc researcher with Prof. Martin Grohe, Humboldt-Universität zu Berlin, Institut für Informatik, Logik in der Informatik
• 2003-2005: research assistant, Budapest University of Technology and Economics, Department of Computer Science and Information Theory

• Hungarian
• English
• French

• 2nd International Workshop on Parameterized and Exact Computation (IWPEC) 2006
• 15th European Symposium on Algorithms (ESA) 2007
• 3rd International Workshop on Parameterized and Exact Computation (IWPEC) 2008
• 20th International Workshop on Combinatorial Algorithms (IWOCA) 2009
• 4rd International Workshop on Parameterized and Exact Computation (IWPEC) 2009
• 9th Latin American Theoretical Informatics Symposium (LATIN) 2010
• 37th International Colloquium on Automata, Languages and Programming (ICALP) 2010
• 5rd International Symposium on Parameterized and Exact Computation (IPEC) 2010
• 6rd International Symposium on Parameterized and Exact Computation (IPEC) 2011 (co-chair)

• Journals: Algorithmica, Discrete Applied Mathematics, Discrete Mathematics, Electronic Journal of Combinatorics, European Journal of Operational Research, Graphs and Combinatorics, INFORMS Journal on Computing, Journal of Computer and System Sciences, Journal of the ACM, Journal on Graph Algorithms and Applications, SIAM Journal on Computing
• Conferences: ACM-SIAM Symposium on Discrete Algorithms, Computational Complexity Conference, International Colloquium on Automata, Languages and Programming, International Symposium on Algorithms and Computation, International Symposium on Mathematical Foundations of Computer Science, International Symposium on Theoretical Aspects of Computer Science, International Workshop on Graph-Theoretic Concepts in Computer Science, Scandinavian Workshop on Algorithm Theory, SIAM Journal on Discrete Mathematics
• PhD Dissertations:
  • Tamás Sarlós, Eötvös Loránd University, Budapest, 2007
  • Jan Kára, Charles University, Prague, 2007
  • Balázs Rácz, Budapest University of Technology and Economics, 2009

• 2000-: organizing the local round of the ACM international programming contest, coaching the teams
• 2004-2006: Chief judge of the ACM Central European Regional Contest
• 2000-2005: Organizing the BUTE 24-hour Programming Contest, developing the problem sets, judging

• 2000-2005: Budapest University of Technology and Economics, teaching assistant for Discrete Mathematics, Theory of Algorithms, and Formal Languages.

• Nokia Scholarship 1999/2000
• TDK (scientific student conference) First and Third Prize, 1999
• OTDK (national scientific student conference) Second Prize, 2001
• János Kemény prize, John von Neumann Computer Society, 2003
• Gyula Farkas prize, János Bolyai Mathematical Society, 2004
• Magyary Zoltán post-doc fellowship, 2007