| Publication | Date of Publication | Type |
|---|
Data reduction, exact, and heuristic algorithms for clique cover
2006 Proceedings of the Eighth Workshop on Algorithm Engineering and Experiments (ALENEX) | 2019-09-11 | Paper |
Pattern matching for arc-annotated sequences
ACM Transactions on Algorithms | 2015-09-02 | Paper |
Data reduction and exact algorithms for clique cover
ACM Journal of Experimental Algorithmics | 2014-04-01 | Paper |
Prediction of phenotype information from genotype data
Communications in Information and Systems | 2010-04-23 | Paper |
Fundamentals of Computation Theory
Lecture Notes in Computer Science | 2010-04-20 | Paper |
Automated generation of search tree algorithms for graph modification problems
Lecture Notes in Computer Science | 2010-03-03 | Paper |
On the complexity of SNP block partitioning under the perfect phylogeny model
Discrete Mathematics | 2009-12-15 | Paper |
SOFSEM 2004: Theory and Practice of Computer Science
Lecture Notes in Computer Science | 2009-06-04 | Paper |
Algorithms for compact letter displays: comparison and evaluation
Computational Statistics and Data Analysis | 2009-06-02 | Paper |
Haplotyping with missing data via perfect path phylogenies
Discrete Applied Mathematics | 2007-04-18 | Paper |
THE COMPUTATIONAL COMPLEXITY OF AVOIDING FORBIDDEN SUBMATRICES BY ROW DELETIONS
International Journal of Foundations of Computer Science | 2007-02-08 | Paper |
On the parameterized intractability of motif search problems
Combinatorica | 2007-01-08 | Paper |
Compression-based fixed-parameter algorithms for feedback vertex set and edge bipartization
Journal of Computer and System Sciences | 2006-12-07 | Paper |
Parameterized intractability of distinguishing substring selection
Theory of Computing Systems | 2006-10-25 | Paper |
Algorithms and Data Structures
Lecture Notes in Computer Science | 2006-10-25 | Paper |
Graph-modeled data clustering: Exact algorithms for clique generation
Theory of Computing Systems | 2006-02-08 | Paper |
Parameterized and Exact Computation
Lecture Notes in Computer Science | 2005-08-23 | Paper |
Computing the similarity of two sequences with nested arc annotations
Theoretical Computer Science | 2004-10-27 | Paper |
Automated generation of search tree algorithms for hard graphs modification problems
Algorithmica | 2004-10-01 | Paper |
A fixed-parameter algorithm for minimum quartet inconsistency
Journal of Computer and System Sciences | 2004-08-19 | Paper |
| scientific article; zbMATH DE number 2086391 (Why is no real title available?) | 2004-08-11 | Paper |
| scientific article; zbMATH DE number 2087047 (Why is no real title available?) | 2004-08-11 | Paper |
| scientific article; zbMATH DE number 2081011 (Why is no real title available?) | 2004-08-04 | Paper |
Fixed-parameter algorithms for CLOSEST STRING and related problems
Algorithmica | 2004-03-11 | Paper |
| scientific article; zbMATH DE number 2011849 (Why is no real title available?) | 2003-12-02 | Paper |
Worst-case upper bounds for MAX-2-SAT with an application to MAX-CUT.
Discrete Applied Mathematics | 2003-09-15 | Paper |
| scientific article; zbMATH DE number 1954383 (Why is no real title available?) | 2003-07-28 | Paper |
| scientific article; zbMATH DE number 1786463 (Why is no real title available?) | 2002-08-21 | Paper |
| scientific article; zbMATH DE number 1629855 (Why is no real title available?) | 2001-11-04 | Paper |
Faster exact algorithms for hard problems: A parameterized point of view
Discrete Mathematics | 2001-07-05 | Paper |
