Dániel Marx
research fellow

dmarx (at sign here) cs.bme.hu

Institute for Computer Science and Control,
Hungarian Academy of Sciences (MTA SZTAKI)

Curriculum Vitae


Research interests:
parameterized complexity, constraint satisfaction problems (CSP), graph coloring, algorithmic graph theory, combinatorial optimization, computational complexity

I have collected links to online papers on


ACM International Collegiate Programming Contest:
I was the chief judge of the Central European Regional Contest (2004-2006).

I was responsible for developing the problem set for the first five 24-hour programming contest (2000-2005).