Michael Elberfeld

From MaRDI portal
Person:390886

Available identifiers

zbMath Open elberfeld.michaelMaRDI QIDQ390886

List of research outcomes





PublicationDate of PublicationType
Canonizing Graphs of Bounded Tree Width in Logspace2019-12-06Paper
https://portal.mardi4nfdi.de/entity/Q49727292019-11-26Paper
Order Invariance on Decomposable Structures2018-04-23Paper
Succinctness of Order-Invariant Logics on Depth-Bounded Structures2018-03-22Paper
Canonizing Graphs of Bounded Tree Width in Logspace2018-01-24Paper
Context-Free Graph Properties via Definable Decompositions2017-07-19Paper
Where First-Order and Monadic Second-Order Logic Coincide2017-07-13Paper
Where First-Order and Monadic Second-Order Logic Coincide2017-05-16Paper
Parameterized Complexity of Fixed Variable Logics2017-04-25Paper
Embedding and canonizing graphs of bounded genus in logspace2015-06-26Paper
On the space and circuit complexity of parameterized problems: classes and completeness2015-05-04Paper
Expressivity and Succinctness of Order-Invariant Logics on Depth-Bounded Structures2014-10-14Paper
Approximation algorithms for orienting mixed graphs2014-01-09Paper
On the Space Complexity of Parameterized Problems2013-01-07Paper
On the approximability of reachability-preserving network orientations2012-08-29Paper
Algorithmic meta theorems for circuit classes of constant and logarithmic depth2012-08-23Paper
Influence of tree topology restrictions on the complexity of haplotyping with missing data2012-06-25Paper
Phylogeny- and parsimony-based haplotype inference with constraints2012-05-24Paper
Approximation Algorithms for Orienting Mixed Graphs2011-06-29Paper
Negative selection algorithms on strings with efficient training and linear-time classification2011-02-21Paper
Phylogeny- and parsimony-based haplotype inference with constraints2010-07-26Paper
Influence of Tree Topology Restrictions on the Complexity of Haplotyping with Missing Data2009-06-03Paper
Computational Complexity of Perfect-Phylogeny-Related Haplotyping Problems2009-02-03Paper

Research outcomes over time

This page was built for person: Michael Elberfeld