Dániel Marx is tenured Faculty at CISPA. He obtained his PhD in 2005 at the Budapest University of Technology and Economics in Hungary. After that, he had postdoc researcher and visiting researcher positions in Berlin, Budapest, and Tel Aviv. From 2012 to 2019, he was at the Institute for Computer Science and Control of the Hungarian Academy of Sciences, where he has founded the Parameterized Algorithms and Complexity group, funded from his European Research Council Starting and Consolidator Grants. In 2019, he became a senior researcher at the Max Planck Institute for Informatics in Saarbrücken, and joined CISPA as a tenured faculty member in 2020. Dániel is known for his theoretical work on algorithms and lower bounds for a wide range of problems.
IEEE Symposium on Foundations of Computer Science (FOCS)
ACM-SIAM Symposium on Discrete Algorithms (SODA)
ACM-SIAM Symposium on Discrete Algorithms (SODA)
SIAM Journal on Computing
International Symposium on Parameterized and Exact Computation (IPEC)
International Symposium on Parameterized and Exact Computation (IPEC)
International Symposium on Parameterized and Exact Computation (IPEC)
Journal of Computer and System Sciences
Discrete Optimization