Michael Elberfeld

List of research outcomes

This list is not complete and representing at the moment only items from zbMATH Open and arXiv. We are working on additional sources - please check back here soon!

Publication	Date of Publication	Type
Canonizing Graphs of Bounded Tree Width in Logspace ACM Transactions on Computation Theory	2019-12-06	Paper
The parameterized space complexity of model-checking bounded variable first-order logic (available as arXiv preprint)	2019-11-26	Paper
Order invariance on decomposable structures Proceedings of the 31st Annual ACM/IEEE Symposium on Logic in Computer Science	2018-04-23	Paper
Succinctness of Order-Invariant Logics on Depth-Bounded Structures ACM Transactions on Computational Logic	2018-03-22	Paper
Canonizing graphs of bounded tree width in logspace (available as arXiv preprint)	2018-01-24	Paper
Context-Free Graph Properties via Definable Decompositions	2017-07-19	Paper
Where first-order and monadic second-order logic coincide ACM Transactions on Computational Logic	2017-07-13	Paper
Where first-order and monadic second-order logic coincide 2012 27th Annual IEEE Symposium on Logic in Computer Science	2017-05-16	Paper
Parameterized complexity of fixed variable logics	2017-04-25	Paper
Embedding and canonizing graphs of bounded genus in logspace Proceedings of the forty-sixth annual ACM symposium on Theory of computing	2015-06-26	Paper
On the space and circuit complexity of parameterized problems: classes and completeness Algorithmica	2015-05-04	Paper
Expressivity and succinctness of order-invariant logics on depth-bounded structures Mathematical Foundations of Computer Science 2014	2014-10-14	Paper
Approximation algorithms for orienting mixed graphs Theoretical Computer Science	2014-01-09	Paper
On the Space Complexity of Parameterized Problems Parameterized and Exact Computation	2013-01-07	Paper
On the approximability of reachability-preserving network orientations Internet Mathematics	2012-08-29	Paper
Algorithmic meta theorems for circuit classes of constant and logarithmic depth	2012-08-23	Paper
Influence of tree topology restrictions on the complexity of haplotyping with missing data Theoretical Computer Science	2012-06-25	Paper
Phylogeny- and parsimony-based haplotype inference with constraints Information and Computation	2012-05-24	Paper
Approximation algorithms for orienting mixed graphs Combinatorial Pattern Matching	2011-06-29	Paper
Negative selection algorithms on strings with efficient training and linear-time classification Theoretical Computer Science	2011-02-21	Paper
Phylogeny- and parsimony-based haplotype inference with constraints Combinatorial Pattern Matching	2010-07-26	Paper
Influence of Tree Topology Restrictions on the Complexity of Haplotyping with Missing Data Lecture Notes in Computer Science	2009-06-03	Paper
Computational Complexity of Perfect-Phylogeny-Related Haplotyping Problems Lecture Notes in Computer Science	2009-02-03	Paper

Research outcomes over time

This page was built for person: Michael Elberfeld