|
|
|
|
Venues (Conferences, Journals, ...)
|
|
|
GrowBag graphs for keyword ? (Num. hits/coverage)
Group by:
The graphs summarize 4 occurrences of 4 keywords
|
|
|
|
|
Results
Found 15 publication records. Showing 15 according to the selection in the facets
| Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
| 1 | Michael Elberfeld, Till Tantau |
Phylogeny- and parsimony-based haplotype inference with constraints.  |
Inf. Comput.  |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Michael Elberfeld, Martin Grohe, Till Tantau |
Where First-Order and Monadic Second-Order Logic Coincide |
CoRR |
2012 |
DBLP BibTeX RDF |
|
| 1 | Michael Elberfeld, Andreas Jakoby, Till Tantau |
Algorithmic Meta Theorems for Circuit Classes of Constant and Logarithmic Depth. |
STACS |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Michael Elberfeld, Andreas Jakoby, Till Tantau |
Algorithmic Meta Theorems for Circuit Classes of Constant and Logarithmic Depth. |
Electronic Colloquium on Computational Complexity (ECCC) |
2011 |
DBLP BibTeX RDF |
|
| 1 | Michael Elberfeld, Johannes Textor |
Negative selection algorithms on strings with efficient training and linear-time classification. |
Theor. Comput. Sci. |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Michael Elberfeld, Vineet Bafna, Iftah Gamzu, Alexander Medvedovsky, Danny Segev, Dana Silverbush, Uri Zwick, Roded Sharan |
On the Approximability of Reachability-Preserving Network Orientations. |
Internet Mathematics |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Michael Elberfeld, Danny Segev, Colin R. Davidson, Dana Silverbush, Roded Sharan |
Approximation Algorithms for Orienting Mixed Graphs. |
CPM |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Dana Silverbush, Michael Elberfeld, Roded Sharan |
Optimally Orienting Physical Networks. |
RECOMB |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Michael Elberfeld, Andreas Jakoby, Till Tantau |
Logspace Versions of the Theorems of Bodlaender and Courcelle. |
Electronic Colloquium on Computational Complexity (ECCC) |
2010 |
DBLP BibTeX RDF |
|
| 1 | Michael Elberfeld, Till Tantau |
Phylogeny- and Parsimony-Based Haplotype Inference with Constraints. |
CPM |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Michael Elberfeld, Andreas Jakoby, Till Tantau |
Logspace Versions of the Theorems of Bodlaender and Courcelle. |
FOCS |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Michael Elberfeld |
Perfect Phylogeny Haplotyping is Complete for Logspace |
CoRR |
2009 |
DBLP BibTeX RDF |
|
| 1 | Michael Elberfeld, Ilka Schnoor, Till Tantau |
Influence of Tree Topology Restrictions on the Complexity of Haplotyping with Missing Data. |
TAMC |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Michael Elberfeld, Johannes Textor |
Efficient Algorithms for String-Based Negative Selection. |
ICARIS |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Michael Elberfeld, Till Tantau |
Computational Complexity of Perfect-Phylogeny-Related Haplotyping Problems. |
MFCS |
2008 |
DBLP DOI BibTeX RDF |
circuit classes, computational complexity, bioinformatics, haplotyping, perfect phylogenies |
Displaying result #1 - #15 of 15 (100 per page; Change: )
|
|
![[Valid RSS]](Pics/valid-rss.png "Validate my RSS feed")