Scholar
Dániel Marx
Google Scholar ID: hY2ibr8AAAAJ
CISPA Helmholtz Center for Information Security
Citations & Impact
Citations
7,110
H-index
38
i10-index
106
Publications
20
Co-authors
65
list available
Contact
Publications
Resume (English only)
Academic Achievements
- Founded and led the Parameterized Algorithms and Complexity group, supported by grants from the European Research Council.
Research Experience
- From 2005 to 2012, he held postdoc researcher and visiting researcher positions in Berlin, Budapest, and Tel Aviv; from 2012 to 2019, he was a senior research fellow at the Institute for Computer Science and Control of the Hungarian Academy of Sciences, where he founded the Parameterized Algorithms and Complexity group funded by his European Research Council Starting and Consolidator Grants; from 2019 to 2020, he worked as a senior researcher at the Max Planck Institute for Informatics in Saarbrücken; since 2020, he has been a tenured faculty member at the CISPA Helmholtz Center for Information Security.
Education
- Obtained his PhD in 2005 from the Budapest University of Technology and Economics, Hungary.
Background
- Research Interests: Algorithmic Graph Theory, Computational Complexity, Parameterized Algorithms. Brief Introduction: Dániel Marx is a tenured faculty member at CISPA, known for his theoretical work on algorithms and lower bounds for a wide range of problems.
