معرفی
Prof. Dr. Michael Elberfeld is a faculty member at the Technical University of Central Hesse, affiliated with the Department of Mathematics, Natural Sciences and Computer Science. His research focuses on theoretical computer science, particularly in computational and parameterized complexity, logic in computer science, and algorithmic meta-theorems.
- Education: Doctorate in Theoretical Computer Science from the University of Lübeck (2012); Diploma (MSc) in Computer Science from the University of Lübeck (2007).
His work explores the intersection of graph theory, logic, and space-bounded computation, with groundbreaking contributions to problems on bounded tree-width structures and order-invariant logics. He has developed logspace algorithms for graph canonization and studied succinctness tradeoffs in logical formalisms.
Key publications include analyses of parameterized space complexity, algorithmic meta-theorems, and applications to bioinformatics like haplotype inference and network orientation. His research is supported by the European Commission through grants 648276 and P 28699.
He collaborates extensively with researchers such as Martin Grohe, Pascal Schweitzer, and Till Tantau, bridging theoretical logic with practical applications in staff rostering and biological network analysis.
