Research
Research interests:
parameterized complexity, constraint
satisfaction problems (CSP), graph coloring, algorithmic graph theory,
combinatorial optimization, computational complexity
- List of publications (with online
papers), DBLP
- 10 most important publications
- List of research talks
- Slides on parameterized complexity:
- Coauthors of my published papers:
Noga Alon,
Albert Atserias,
MohammadHossein Bateni,
Andrei Bulatov,
Sergio Cabello,
Chandra Checkuri,
Rajesh Chitnis,
David Cohen,
Tibor Cinkler,
Martin Cooper,
Marek Cygan,
Víctor Dalmau,
Holger Dell,
Erik Demaine,
Alina R. Ene,
Dániel Fogaras,
Panos Giannopoulos,
Martin Green,
Martin Grohe,
MohammadTaghi Hajiaghayi,
Emmanuel Hebrard,
Klaus Jansen,
Naonori Kakimura,
Ken-ichi Kawarabayashi,
Rolf Klein,
Christian Knauer,
Nitish Korula,
Stefan Kratsch,
Andrei Krokhin,
Martin Kutz,
Claus Popp Larsen,
Daniel Lokshtanov,
Jesper Nederlof,
Yoshio Okamoto,
Ramamohan Paturi,
Barry O'Sullivan,
Marcin Pilipczuk,
Michal Pilipczuk,
Igor Razgon,
Günter Rote,
Saket Saurabh,
Marcus Schaefer,
Ildikó Schlotter,
Magnus Wahlström,
Paul Wollan.
I have collected links to online papers on
Others
ACM International Collegiate Programming Contest:
I was the chief judge of the Central European Regional Contest
(2004-2006).
Challenge24:
I was responsible for developing the problem set for the first five 24-hour programming contest
(2000-2005).
Addresses
Technical note: my name is Dániel Marx (with an accent on the 'a'),
but in some places it appears as Daniel
Marx. I made a separate page to
help search engines recognize Daniel
Marx as well.
