default search action
Michael Elberfeld
Person information
- affiliation: RWTH Aachen University, Germany
- affiliation: University of California, Berkeley, International Computer Science Institute, CA, USA
- affiliation: University of Lübeck, Institute for Theoretical Computer Science, Germany
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2019
- [j12]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) - 2018
- [c17]Marco Bender, Sebastian Berckey, Michael Elberfeld, Jörg Herbers:
Real-World Staff Rostering via Branch-and-Price in a Declarative Framework. OR 2018: 445-451 - 2017
- [j11]Kord Eickmeyer
, Michael Elberfeld, Frederik Harwath:
Succinctness of Order-Invariant Logics on Depth-Bounded Structures. ACM Trans. Comput. Log. 18(4): 33:1-33:25 (2017) - [j10]Michael Elberfeld, Pascal Schweitzer
Canonizing Graphs of Bounded Tree Width in Logspace. ACM Trans. Comput. Theory 9(3): 12:1-12:29 (2017) - [i9]Yijia Chen, Michael Elberfeld, Moritz Müller:
The parameterized space complexity of model-checking bounded variable first-order logic. CoRR abs/1703.01860 (2017) - 2016
- [j9]Michael Elberfeld:
Variants of Courcelle's Theorem for complexity classes inside P. ACM SIGLOG News 3(1): 23-32 (2016) - [j8]Michael Elberfeld, Martin Grohe, Till Tantau:
Where First-Order and Monadic Second-Order Logic Coincide. ACM Trans. Comput. Log. 17(4): 25 (2016) - [c16]Michael Elberfeld:
Context-Free Graph Properties via Definable Decompositions. CSL 2016: 17:1-17:16 - [c15]Michael Elberfeld, Marlin Frickenschmidt, Martin Grohe:
Order Invariance on Decomposable Structures. LICS 2016: 397-406 - [c14]Michael Elberfeld, Pascal Schweitzer
Canonizing Graphs of Bounded Tree Width in Logspace. STACS 2016: 32:1-32:14 - [i8]Kord Eickmeyer, Michael Elberfeld, Frederik Harwath:
Succinctness of Order-Invariant Logics on Depth-Bounded Structures. CoRR abs/1603.09055 (2016) - [i7]Michael Elberfeld, Marlin Frickenschmidt, Martin Grohe:
Order Invariance on Decomposable Structures. CoRR abs/1606.06557 (2016) - 2015
- [j7]Michael Elberfeld, Christoph Stockhusen, Till Tantau:
On the Space and Circuit Complexity of Parameterized Problems: Classes and Completeness. Algorithmica 71(3): 661-701 (2015) - [i6]Michael Elberfeld, Pascal Schweitzer:
Canonizing Graphs of Bounded Tree Width in Logspace. CoRR abs/1506.07810 (2015) - 2014
- [c13]Christoph Berkholz, Michael Elberfeld:
Parameterized Complexity of Fixed Variable Logics. FSTTCS 2014: 109-120 - [c12]Kord Eickmeyer
Expressivity and Succinctness of Order-Invariant Logics on Depth-Bounded Structures. MFCS (1) 2014: 256-266 - [c11]Michael Elberfeld, Ken-ichi Kawarabayashi:
Embedding and canonizing graphs of bounded genus in logspace. STOC 2014: 383-392 - 2013
- [b1]Michael Elberfeld:
Space and circuit complexity of monadic second-order definable problemes on tree-decomposable structures. University of Lübeck, 2013 - [j6]Michael Elberfeld, Danny Segev, Colin R. Davidson, Dana Silverbush, Roded Sharan:
Approximation algorithms for orienting mixed graphs. Theor. Comput. Sci. 483: 96-103 (2013) - 2012
- [j5]Michael Elberfeld, Till Tantau:
Phylogeny- and parsimony-based haplotype inference with constraints. Inf. Comput. 213: 33-47 (2012) - [j4]Michael Elberfeld, Ilka Schnoor, Till Tantau:
Influence of tree topology restrictions on the complexity of haplotyping with missing data. Theor. Comput. Sci. 432: 38-51 (2012) - [c10]Michael Elberfeld, Christoph Stockhusen, Till Tantau:
On the Space Complexity of Parameterized Problems. IPEC 2012: 206-217 - [c9]Michael Elberfeld, Martin Grohe
Where First-Order and Monadic Second-Order Logic Coincide. LICS 2012: 265-274 - [c8]Michael Elberfeld, Andreas Jakoby, Till Tantau:
Algorithmic Meta Theorems for Circuit Classes of Constant and Logarithmic Depth. STACS 2012: 66-77 - [p1]Michael Elberfeld:
Platz- und Schaltkreiskomplexität von MSO-beschreibbaren Problemen auf baumartig zerlegbaren Strukturen. Ausgezeichnete Informatikdissertationen 2012: 71-80 - [i5]Michael Elberfeld, Martin Grohe, Till Tantau:
Where First-Order and Monadic Second-Order Logic Coincide. CoRR abs/1204.6291 (2012) - [i4]Michael Elberfeld, Christoph Stockhusen, Till Tantau:
On the Space Complexity of Parameterized Problems. Electron. Colloquium Comput. Complex. TR12 (2012) - 2011
- [j3]Michael Elberfeld, Vineet Bafna
On the Approximability of Reachability-Preserving Network Orientations. Internet Math. 7(4): 209-232 (2011) - [j2]Dana Silverbush, Michael Elberfeld, Roded Sharan:
Optimally Orienting Physical Networks. J. Comput. Biol. 18(11): 1437-1448 (2011) - [j1]Michael Elberfeld, Johannes Textor
Negative selection algorithms on strings with efficient training and linear-time classification. Theor. Comput. Sci. 412(6): 534-542 (2011) - [c7]Michael Elberfeld, Danny Segev, Colin R. Davidson, Dana Silverbush, Roded Sharan:
Approximation Algorithms for Orienting Mixed Graphs. CPM 2011: 416-428 - [c6]Dana Silverbush, Michael Elberfeld, Roded Sharan:
Optimally Orienting Physical Networks. RECOMB 2011: 424-436 - [i3]Michael Elberfeld, Andreas Jakoby, Till Tantau:
Algorithmic Meta Theorems for Circuit Classes of Constant and Logarithmic Depth. Electron. Colloquium Comput. Complex. TR11 (2011) - 2010
- [c5]Michael Elberfeld, Till Tantau:
Phylogeny- and Parsimony-Based Haplotype Inference with Constraints. CPM 2010: 177-189 - [c4]Michael Elberfeld, Andreas Jakoby, Till Tantau:
Logspace Versions of the Theorems of Bodlaender and Courcelle. FOCS 2010: 143-152 - [i2]Michael Elberfeld, Andreas Jakoby, Till Tantau:
Logspace Versions of the Theorems of Bodlaender and Courcelle. Electron. Colloquium Comput. Complex. TR10 (2010)
2000 – 2009
- 2009
- [c3]Michael Elberfeld, Johannes Textor
Efficient Algorithms for String-Based Negative Selection. ICARIS 2009: 109-121 - [c2]Michael Elberfeld, Ilka Schnoor, Till Tantau:
Influence of Tree Topology Restrictions on the Complexity of Haplotyping with Missing Data. TAMC 2009: 201-210 - [i1]Michael Elberfeld:
Perfect Phylogeny Haplotyping is Complete for Logspace. CoRR abs/0905.0602 (2009) - 2008
- [c1]Michael Elberfeld, Till Tantau:
Computational Complexity of Perfect-Phylogeny-Related Haplotyping Problems. MFCS 2008: 299-310
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-08-05 20:19 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: