Michael Elberfeld

According to our database, Michael Elberfeld authored at least 27 papers between 2008 and 2025.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2025

Space-Efficient Depth-First Search via Augmented Succinct Graph Encodings.

Michael Elberfeld, Frank Kammer, Johannes Meintrup

CoRR, April, 2025

2019

The parameterized space complexity of model-checking bounded variable first-order logic.

Yijia Chen, Michael Elberfeld, Moritz Müller

Log. Methods Comput. Sci., 2019

2018

Real-World Staff Rostering via Branch-and-Price in a Declarative Framework.

Marco Bender, Sebastian Berckey, Michael Elberfeld, Jörg Herbers

Proceedings of the Operations Research Proceedings 2018, 2018

2017

Succinctness of Order-Invariant Logics on Depth-Bounded Structures.

Kord Eickmeyer, Michael Elberfeld, Frederik Harwath

ACM Trans. Comput. Log., 2017

2016

Variants of Courcelle's Theorem for complexity classes inside P.

Michael Elberfeld

ACM SIGLOG News, 2016

Canonizing Graphs of Bounded Tree Width in Logspace.

Michael Elberfeld, Pascal Schweitzer

Proceedings of the 33rd Symposium on Theoretical Aspects of Computer Science, 2016

Order Invariance on Decomposable Structures.

Michael Elberfeld, Marlin Frickenschmidt, Martin Grohe

Proceedings of the 31st Annual ACM/IEEE Symposium on Logic in Computer Science, 2016

Context-Free Graph Properties via Definable Decompositions.

Michael Elberfeld

Proceedings of the 25th EACSL Annual Conference on Computer Science Logic, 2016

2015

On the Space and Circuit Complexity of Parameterized Problems: Classes and Completeness.

Michael Elberfeld, Christoph Stockhusen, Till Tantau

Algorithmica, 2015

2014

Embedding and canonizing graphs of bounded genus in logspace.

Michael Elberfeld, Ken-ichi Kawarabayashi

Proceedings of the Symposium on Theory of Computing, 2014

Expressivity and Succinctness of Order-Invariant Logics on Depth-Bounded Structures.

Kord Eickmeyer, Michael Elberfeld, Frederik Harwath

Proceedings of the Mathematical Foundations of Computer Science 2014, 2014

Parameterized Complexity of Fixed Variable Logics.

Christoph Berkholz, Michael Elberfeld

Proceedings of the 34th International Conference on Foundation of Software Technology and Theoretical Computer Science, 2014

2013

Space and circuit complexity of monadic second-order definable problemes on tree-decomposable structures.

Michael Elberfeld

PhD thesis, 2013

2012

Algorithmic Meta Theorems for Circuit Classes of Constant and Logarithmic Depth.

Michael Elberfeld, Andreas Jakoby, Till Tantau

Proceedings of the 29th International Symposium on Theoretical Aspects of Computer Science, 2012

Where First-Order and Monadic Second-Order Logic Coincide.

Michael Elberfeld, Martin Grohe, Till Tantau

Proceedings of the 27th Annual IEEE Symposium on Logic in Computer Science, 2012

On the Space Complexity of Parameterized Problems.

Michael Elberfeld, Christoph Stockhusen, Till Tantau

Proceedings of the Parameterized and Exact Computation - 7th International Symposium, 2012

Platz- und Schaltkreiskomplexität von MSO-beschreibbaren Problemen auf baumartig zerlegbaren Strukturen.

Michael Elberfeld

Proceedings of the Ausgezeichnete Informatikdissertationen 2012, 2012

2011

Negative selection algorithms on strings with efficient training and linear-time classification.

Michael Elberfeld, Johannes Textor

Theor. Comput. Sci., 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

Proceedings of the Research in Computational Molecular Biology, 2011

Approximation Algorithms for Orienting Mixed Graphs.

Michael Elberfeld, Danny Segev, Colin R. Davidson, Dana Silverbush, Roded Sharan

Proceedings of the Combinatorial Pattern Matching - 22nd Annual Symposium, 2011

2010

Logspace Versions of the Theorems of Bodlaender and Courcelle.

Michael Elberfeld, Andreas Jakoby, Till Tantau

Proceedings of the 51th Annual IEEE Symposium on Foundations of Computer Science, 2010

Phylogeny- and Parsimony-Based Haplotype Inference with Constraints.

Michael Elberfeld, Till Tantau

Proceedings of the Combinatorial Pattern Matching, 21st Annual Symposium, 2010

2009

Perfect Phylogeny Haplotyping is Complete for Logspace

Michael Elberfeld

CoRR, 2009

Influence of Tree Topology Restrictions on the Complexity of Haplotyping with Missing Data.

Michael Elberfeld, Ilka Schnoor, Till Tantau

Proceedings of the Theory and Applications of Models of Computation, 6th Annual Conference, 2009

Efficient Algorithms for String-Based Negative Selection.

Michael Elberfeld, Johannes Textor

Proceedings of the Artificial Immune Systems, 8th International Conference, 2009

2008

Computational Complexity of Perfect-Phylogeny-Related Haplotyping Problems.

Michael Elberfeld, Till Tantau

Proceedings of the Mathematical Foundations of Computer Science 2008, 2008