| 2025 | ISAAC | Space-Efficient Depth-First Search via Augmented Succinct Graph Encodings. | Michael Elberfeld, Frank Kammer, Johannes Meintrup |
| 2016 | CSL | Context-Free Graph Properties via Definable Decompositions. | Michael Elberfeld |
| 2016 | LICS | Order Invariance on Decomposable Structures. | Michael Elberfeld, Marlin Frickenschmidt, Martin Grohe |
| 2016 | STACS | Canonizing Graphs of Bounded Tree Width in Logspace. | Michael Elberfeld, Pascal Schweitzer |
| 2014 | MFCS | Expressivity and Succinctness of Order-Invariant Logics on Depth-Bounded Structures. | Kord Eickmeyer, Michael Elberfeld, Frederik Harwath |
| 2014 | STOC | Embedding and canonizing graphs of bounded genus in logspace. | Michael Elberfeld, Ken-ichi Kawarabayashi |
| 2012 | LICS | Where First-Order and Monadic Second-Order Logic Coincide. | Michael Elberfeld, Martin Grohe, Till Tantau |
| 2012 | STACS | Algorithmic Meta Theorems for Circuit Classes of Constant and Logarithmic Depth. | Michael Elberfeld, Andreas Jakoby, Till Tantau |
| 2011 | CPM | Approximation Algorithms for Orienting Mixed Graphs. | Michael Elberfeld, Danny Segev, Colin R. Davidson, Dana Silverbush, Roded Sharan |
| 2011 | RECOMB | Optimally Orienting Physical Networks. | Dana Silverbush, Michael Elberfeld, Roded Sharan |
| 2010 | CPM | Phylogeny- and Parsimony-Based Haplotype Inference with Constraints. | Michael Elberfeld, Till Tantau |
| 2010 | FOCS | Logspace Versions of the Theorems of Bodlaender and Courcelle. | Michael Elberfeld, Andreas Jakoby, Till Tantau |
| 2009 | TAMC | Influence of Tree Topology Restrictions on the Complexity of Haplotyping with Missing Data. | Michael Elberfeld, Ilka Schnoor, Till Tantau |
| 2008 | MFCS | Computational Complexity of Perfect-Phylogeny-Related Haplotyping Problems. | Michael Elberfeld, Till Tantau |