Computational Complexity of Perfect-Phylogeny-Related Haplotyping Problems. - Michael Elberfeld; Till Tantau (MFCS, 2008)

Efficient Algorithms for String-Based Negative Selection. - Michael Elberfeld; Johannes Textor (ICARIS, 2009)

Perfect Phylogeny Haplotyping is Complete for Logspace - Michael Elberfeld (CoRR, 2009)

Logspace Versions of the Theorems of Bodlaender and Courcelle. - Michael Elberfeld; Andreas Jakoby; Till Tantau (Electron. Colloquium Comput. Complex., 2010)

Algorithmic Meta Theorems for Circuit Classes of Constant and Logarithmic Depth. - Michael Elberfeld; Andreas Jakoby; Till Tantau (Electron. Colloquium Comput. Complex., 2011)

On the Approximability of Reachability-Preserving Network Orientations. - Michael Elberfeld; Vineet Bafna; Iftah Gamzu; Alexander Medvedovsky; Danny Segev; Dana Silverbush; Uri Zwick; Roded Sharan (Internet Math., 2011)

Optimally Orienting Physical Networks. - Dana Silverbush; Michael Elberfeld; Roded Sharan (J. Comput. Biol., 2011)

Negative selection algorithms on strings with efficient training and linear-time classification. - Michael Elberfeld; Johannes Textor (Theor. Comput. Sci., 2011)

Platz- und Schaltkreiskomplexität von MSO-beschreibbaren Problemen auf baumartig zerlegbaren Strukturen. - Michael Elberfeld (Ausgezeichnete Informatikdissertationen, 2012)

On the Space Complexity of Parameterized Problems. - Michael Elberfeld; Christoph Stockhusen; Till Tantau (Electron. Colloquium Comput. Complex., 2012)

Phylogeny- and parsimony-based haplotype inference with constraints. - Michael Elberfeld; Till Tantau (Inf. Comput., 2012)

Influence of tree topology restrictions on the complexity of haplotyping with missing data. - Michael Elberfeld; Ilka Schnoor; Till Tantau (Theor. Comput. Sci., 2012)

Approximation algorithms for orienting mixed graphs. - Michael Elberfeld; Danny Segev; Colin R. Davidson; Dana Silverbush; Roded Sharan (Theor. Comput. Sci., 2013)

Space and circuit complexity of monadic second-order definable problemes on tree-decomposable structures. - Michael Elberfeld (2013)

Parameterized Complexity of Fixed Variable Logics. - Christoph Berkholz; Michael Elberfeld (FSTTCS, 2014)

Expressivity and Succinctness of Order-Invariant Logics on Depth-Bounded Structures. - Kord Eickmeyer; Michael Elberfeld; Frederik Harwath (MFCS (1), 2014)

Embedding and canonizing graphs of bounded genus in logspace. - Michael Elberfeld; Ken-ichi Kawarabayashi (STOC, 2014)

On the Space and Circuit Complexity of Parameterized Problems: Classes and Completeness. - Michael Elberfeld; Christoph Stockhusen; Till Tantau (Algorithmica, 2015)

Context-Free Graph Properties via Definable Decompositions. - Michael Elberfeld (CSL, 2016)

Order Invariance on Decomposable Structures. - Michael Elberfeld; Marlin Frickenschmidt; Martin Grohe (LICS, 2016)

Variants of Courcelle's Theorem for complexity classes inside P. - Michael Elberfeld (ACM SIGLOG News, 2016)

Where First-Order and Monadic Second-Order Logic Coincide. - Michael Elberfeld; Martin Grohe; Till Tantau (ACM Trans. Comput. Log., 2016)

Succinctness of Order-Invariant Logics on Depth-Bounded Structures. - Kord Eickmeyer; Michael Elberfeld; Frederik Harwath (ACM Trans. Comput. Log., 2017)

Canonizing Graphs of Bounded Tree Width in Logspace. - Michael Elberfeld; Pascal Schweitzer (ACM Trans. Comput. Theory, 2017)

Real-World Staff Rostering via Branch-and-Price in a Declarative Framework. - Marco Bender; Sebastian Berckey; Michael Elberfeld; Jörg Herbers (OR, 2018)

The parameterized space complexity of model-checking bounded variable first-order logic. - Yijia Chen 001; Michael Elberfeld; Moritz Müller (Log. Methods Comput. Sci., 2019)

Space-Efficient Depth-First Search via Augmented Succinct Graph Encodings. - Michael Elberfeld; Frank Kammer; Johannes Meintrup (CoRR, 2025)