On the Space and Circuit Complexity of Parameterized Problems: Classes and Completeness von Elberfeld, Michael, Stockhusen, Christoph, Tantau, Till

Volltext

The parameterized space complexity of model-checking bounded variable first-order logic von Chen, Yijia, Elberfeld, Michael, Muller, Moritz Martin

Volltext

Expressivity and Succinctness of Order-Invariant Logics on Depth-Bounded Structures von Eickmeyer, Kord, Elberfeld, Michael, Harwath, Frederik

Volltext

Canonizing Graphs of Bounded Tree Width in Logspace von Elberfeld, Michael, Schweitzer, Pascal

Volltext

Where First-Order and Monadic Second-Order Logic Coincide von Elberfeld, Michael, Grohe, Martin, Tantau, Till

Volltext

Negative selection algorithms on strings with efficient training and linear-time classification von Elberfeld, Michael, Textor, Johannes

Volltext

Succinctness of Order-Invariant Logics on Depth-Bounded Structures von Eickmeyer, Kord, Elberfeld, Michael, Harwath, Frederik

Volltext

Logspace Versions of the Theorems of Bodlaender and Courcelle von Elberfeld, M, Jakoby, A, Tantau, T

Volltext

Phylogeny- and parsimony-based haplotype inference with constraints von Elberfeld, Michael, Tantau, Till

Volltext

Negative selection algorithms on strings with efficient training and linear-time classification: Theoretical Aspects of Artificial Immune Systems von ELBERFELD, Michael, TEXTOR, Johannes

Volltext

Optimally orienting physical networks von Silverbush, Dana, Elberfeld, Michael, Sharan, Roded

Volltext

Influence of tree topology restrictions on the complexity of haplotyping with missing data von Elberfeld, Michael, Schnoor, Ilka, Tantau, Till

Volltext

Approximation algorithms for orienting mixed graphs von Elberfeld, Michael, Segev, Danny, Davidson, Colin R., Silverbush, Dana, Sharan, Roded

Volltext

Where First-Order and Monadic Second-Order Logic Coincide von Elberfeld, M., Grohe, M., Tantau, T.

Volltext

Variants of Courcelle's Theorem for complexity classes inside P von Elberfeld, Michael

Volltext

On the Approximability of Reachability-Preserving Network Orientations von Elberfeld, Michael, Bafna, Vineet, Gamzu, Iftah, Medvedovsky, Alexander, Segev, Danny, Silverbush, Dana, Zwick, Uri, Sharan, Roded

Volltext

Efficient Algorithms for String-Based Negative Selection von Elberfeld, Michael, Textor, Johannes

Volltext

On the Space Complexity of Parameterized Problems von Elberfeld, Michael, Stockhusen, Christoph, Tantau, Till

Volltext

The parameterized space complexity of model-checking bounded variable first-order logic von Chen, Yijia, Elberfeld, Michael, Müller, Moritz

Volltext

Phylogeny- and Parsimony-Based Haplotype Inference with Constraints von Elberfeld, Michael, Tantau, Till

Volltext