Michael Elberfeld
Michael Elberfeld
Unknown affiliation
Verified email at posteo.de
Title
Cited by
Cited by
Year
Logspace versions of the theorems of Bodlaender and Courcelle
M Elberfeld, A Jakoby, T Tantau
51st Annual IEEE Symposium on Foundations of Computer Science (FOCS 2010 …, 2010
1272010
Algorithmic meta theorems for circuit classes of constant and logarithmic depth
M Elberfeld, A Jakoby, T Tantau
Symposium on Theoretical Aspects of Computer Science (STACS 2012) 14, 66-77, 2012
412012
Efficient algorithms for string-based negative selection
M Elberfeld, J Textor
Artificial Immune Systems (ICARIS 2009), 109-121, 2009
322009
Negative selection algorithms on strings with efficient training and linear-time classification
M Elberfeld, J Textor
Theoretical Computer Science 412 (6), 534-542, 2011
312011
Embedding and canonizing graphs of bounded genus in logspace
M Elberfeld, K Kawarabayashi
Proceedings of the 46th Annual ACM Symposium on Theory of Computing (STOC …, 2014
282014
Optimally orienting physical networks
D Silverbush, M Elberfeld, R Sharan
Journal of Computational Biology 18 (11), 1437-1448, 2011
282011
On the space and circuit complexity of parameterized problems: Classes and completeness
M Elberfeld, C Stockhusen, T Tantau
Algorithmica 71 (3), 661-701, 2015
252015
Canonizing graphs of bounded tree width in logspace
M Elberfeld, P Schweitzer
ACM Transactions on Computation Theory (TOCT) 9 (3), 1-29, 2017
242017
Where first-order and monadic second-order logic coincide
M Elberfeld, M Grohe, T Tantau
27th Annual IEEE Symposium on Logic in Computer Science (LICS 2012), 265-274, 2012
192012
Where first-order and monadic second-order logic coincide
M Elberfeld, M Grohe, T Tantau
ACM Transactions on Computational Logic (TOCL) 17 (4), 1-18, 2016
142016
On the space complexity of parameterized problems
M Elberfeld, C Stockhusen, T Tantau
Parameterized and Exact Computation (IPEC 2012), 206-217, 2012
122012
Approximation algorithms for orienting mixed graphs
M Elberfeld, D Segev, CR Davidson, D Silverbush, R Sharan
Combinatorial Pattern Matching (CPM 2011), 416-428, 2011
122011
Expressivity and Succinctness of Order-Invariant Logics on Depth-Bounded Structures
K Eickmeyer, M Elberfeld, F Harwath
Mathematical Foundations of Computer Science (MFCS 2014), 256-266, 2014
112014
On the Approximability of Reachability Preserving Network Orientations
M Elberfeld, V Bafna, I Gamzu, A Medvedovsky, D Segev, D Silverbush, ...
Internet Mathematics 7 (4), 209-232, 2011
102011
Approximation algorithms for orienting mixed graphs
M Elberfeld, D Segev, CR Davidson, D Silverbush, R Sharan
Theoretical Computer Science 483, 96-103, 2013
92013
Order invariance on decomposable structures
M Elberfeld, M Frickenschmidt, M Grohe
Proceedings of the 31st Annual ACM/IEEE Symposium on Logic in Computer …, 2016
62016
Phylogeny-and parsimony-based haplotype inference with constraints
M Elberfeld, T Tantau
Combinatorial Pattern Matching (CPM 2011), 177-189, 2010
52010
Computational complexity of perfect-phylogeny-related haplotyping problems
M Elberfeld, T Tantau
Mathematical Foundations of Computer Science (MFCS 2008), 299-310, 2008
52008
Space and Circuit Complexity of Monadic Second-Order Definable Problems on Tree-Decomposable Structures
M Elberfeld
University of Lübeck, 2012
42012
Perfect phylogeny haplotyping is complete for logspace
M Elberfeld
arXiv preprint arXiv:0905.0602, 2009
42009
The system can't perform the operation now. Try again later.
Articles 1–20