Michael Elberfeld

42 papers A* 4A 2B 7C 1Journal 22Unranked 4
YearRankTypeTitle / Venue / Authors
2025 B conf
Space-Efficient Depth-First Search via Augmented Succinct Graph Encodings.
ISAAC
Michael Elberfeld, Frank Kammer, Johannes Meintrup
2025 J jnl
Space-Efficient Depth-First Search via Augmented Succinct Graph Encodings.
CoRR
Michael Elberfeld, Frank Kammer, Johannes Meintrup
2019 J jnl
The parameterized space complexity of model-checking bounded variable first-order logic.
Log. Methods Comput. Sci.
Yijia Chen, Michael Elberfeld, Moritz Müller
2018 — conf
Real-World Staff Rostering via Branch-and-Price in a Declarative Framework.
OR
Marco Bender, Sebastian Berckey, Michael Elberfeld, Jörg Herbers
2017 J jnl
Canonizing Graphs of Bounded Tree Width in Logspace.
ACM Trans. Comput. Theory
Michael Elberfeld, Pascal Schweitzer
2017 J jnl
Succinctness of Order-Invariant Logics on Depth-Bounded Structures.
ACM Trans. Comput. Log.
Kord Eickmeyer, Michael Elberfeld, Frederik Harwath
2017 J jnl
The parameterized space complexity of model-checking bounded variable first-order logic.
CoRR
Yijia Chen, Michael Elberfeld, Moritz Müller
2016 A conf
Canonizing Graphs of Bounded Tree Width in Logspace.
STACS
Michael Elberfeld, Pascal Schweitzer
2016 B conf
Context-Free Graph Properties via Definable Decompositions.
CSL
Michael Elberfeld
2016 A* conf
Order Invariance on Decomposable Structures.
LICS
Michael Elberfeld, Marlin Frickenschmidt, Martin Grohe
2016 J jnl
Order Invariance on Decomposable Structures.
CoRR
Michael Elberfeld, Marlin Frickenschmidt, Martin Grohe
2016 J jnl
Succinctness of Order-Invariant Logics on Depth-Bounded Structures.
CoRR
Kord Eickmeyer, Michael Elberfeld, Frederik Harwath
2016 J jnl
Variants of Courcelle's Theorem for complexity classes inside P.
ACM SIGLOG News
Michael Elberfeld
2016 J jnl
Where First-Order and Monadic Second-Order Logic Coincide.
ACM Trans. Comput. Log.
Michael Elberfeld, Martin Grohe, Till Tantau
2015 J jnl
Canonizing Graphs of Bounded Tree Width in Logspace.
CoRR
Michael Elberfeld, Pascal Schweitzer
2015 J jnl
On the Space and Circuit Complexity of Parameterized Problems: Classes and Completeness.
Algorithmica
Michael Elberfeld, Christoph Stockhusen, Till Tantau
2014 A* conf
Embedding and canonizing graphs of bounded genus in logspace.
STOC
Michael Elberfeld, Ken-ichi Kawarabayashi
2014 — conf
Expressivity and Succinctness of Order-Invariant Logics on Depth-Bounded Structures.
MFCS (1)
Kord Eickmeyer, Michael Elberfeld, Frederik Harwath
2014 — conf
Parameterized Complexity of Fixed Variable Logics.
FSTTCS
Christoph Berkholz, Michael Elberfeld
2013 J jnl
Approximation algorithms for orienting mixed graphs.
Theor. Comput. Sci.
Michael Elberfeld, Danny Segev, Colin R. Davidson, Dana Silverbush, Roded Sharan
2013 — —
Space and circuit complexity of monadic second-order definable problemes on tree-decomposable structures.
Michael Elberfeld
2012 A conf
Algorithmic Meta Theorems for Circuit Classes of Constant and Logarithmic Depth.
STACS
Michael Elberfeld, Andreas Jakoby, Till Tantau
2012 J jnl
Influence of tree topology restrictions on the complexity of haplotyping with missing data.
Theor. Comput. Sci.
Michael Elberfeld, Ilka Schnoor, Till Tantau
2012 B conf
On the Space Complexity of Parameterized Problems.
IPEC
Michael Elberfeld, Christoph Stockhusen, Till Tantau
2012 J jnl
On the Space Complexity of Parameterized Problems.
Electron. Colloquium Comput. Complex.
Michael Elberfeld, Christoph Stockhusen, Till Tantau
2012 J jnl
Phylogeny- and parsimony-based haplotype inference with constraints.
Inf. Comput.
Michael Elberfeld, Till Tantau
2012 — ch.
Platz- und Schaltkreiskomplexität von MSO-beschreibbaren Problemen auf baumartig zerlegbaren Strukturen.
Ausgezeichnete Informatikdissertationen
Michael Elberfeld
2012 J jnl
Where First-Order and Monadic Second-Order Logic Coincide
CoRR
Michael Elberfeld, Martin Grohe, Till Tantau
2012 A* conf
Where First-Order and Monadic Second-Order Logic Coincide.
LICS
Michael Elberfeld, Martin Grohe, Till Tantau
2011 J jnl
Algorithmic Meta Theorems for Circuit Classes of Constant and Logarithmic Depth.
Electron. Colloquium Comput. Complex.
Michael Elberfeld, Andreas Jakoby, Till Tantau
2011 B conf
Approximation Algorithms for Orienting Mixed Graphs.
CPM
Michael Elberfeld, Danny Segev, Colin R. Davidson, Dana Silverbush, Roded Sharan
2011 J jnl
Negative selection algorithms on strings with efficient training and linear-time classification.
Theor. Comput. Sci.
Michael Elberfeld, Johannes Textor
2011 J jnl
On the Approximability of Reachability-Preserving Network Orientations.
Internet Math.
Michael Elberfeld, Vineet Bafna, Iftah Gamzu, Alexander Medvedovsky, Danny Segev, Dana Silverbush, Uri Zwick, Roded Sharan
2011 B conf
Optimally Orienting Physical Networks.
RECOMB
Dana Silverbush, Michael Elberfeld, Roded Sharan
2011 J jnl
Optimally Orienting Physical Networks.
J. Comput. Biol.
Dana Silverbush, Michael Elberfeld, Roded Sharan
2010 A* conf
Logspace Versions of the Theorems of Bodlaender and Courcelle.
FOCS
Michael Elberfeld, Andreas Jakoby, Till Tantau
2010 J jnl
Logspace Versions of the Theorems of Bodlaender and Courcelle.
Electron. Colloquium Comput. Complex.
Michael Elberfeld, Andreas Jakoby, Till Tantau
2010 B conf
Phylogeny- and Parsimony-Based Haplotype Inference with Constraints.
CPM
Michael Elberfeld, Till Tantau
2009 — conf
Efficient Algorithms for String-Based Negative Selection.
ICARIS
Michael Elberfeld, Johannes Textor
2009 C conf
Influence of Tree Topology Restrictions on the Complexity of Haplotyping with Missing Data.
TAMC
Michael Elberfeld, Ilka Schnoor, Till Tantau
2009 J jnl
Perfect Phylogeny Haplotyping is Complete for Logspace
CoRR
Michael Elberfeld
2008 B conf
Computational Complexity of Perfect-Phylogeny-Related Haplotyping Problems.
MFCS
Michael Elberfeld, Till Tantau