Michael Elberfeld

Publication Activity (10 Years)

Years Active: 2008-2019
Publications (10 Years): 12

Top Venues

CoRR

Theor. Comput. Sci.

LICS

ACM Trans. Comput. Log.

University of Lübeck (PHD)

Education History

University of Lübeck

PHD

Publications

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

Michael Elberfeld.css-eqlu8i{font-size:small;padding-left:4px;}

Publication Activity (10 Years)

Top Topics

Top Venues

Michael Elberfeld