| Publication | Date of Publication | Type |
|---|
Heuristic algorithms for the maximum colorful subtree problem
| 2022-07-18 | Paper |
A closer look at the closest string and closest substring problem
2011 Proceedings of the Thirteenth Workshop on Algorithm Engineering and Experiments (ALENEX) | 2019-09-12 | Paper |
Fragmentation Trees Reloaded
Lecture Notes in Computer Science | 2016-06-22 | Paper |
Speedy colorful subtrees
Lecture Notes in Computer Science | 2015-10-29 | Paper |
Counting glycans revisited
Journal of Mathematical Biology | 2014-10-30 | Paper |
Improved fixed-parameter algorithms for minimum-flip consensus trees
ACM Transactions on Algorithms | 2014-09-09 | Paper |
\textsc{FlipCut} supertrees: towards matrix representation accuracy in polynomial time
Algorithmica | 2013-11-11 | Paper |
Cluster editing
Lecture Notes in Computer Science | 2013-08-05 | Paper |
Even faster parameterized cluster deletion and cluster editing
Information Processing Letters | 2013-04-04 | Paper |
A golden ratio parameterized algorithm for cluster editing
Journal of Discrete Algorithms | 2013-01-18 | Paper |
Finding characteristic substructures for metabolite classes
| 2012-10-02 | Paper |
Extension and robustness of transitivity clustering for protein-protein interaction network analysis
Internet Mathematics | 2012-08-29 | Paper |
A note on the parameterized complexity of unordered maximum tree orientation
Discrete Applied Mathematics | 2012-06-18 | Paper |
A golden ratio parameterized algorithm for cluster editing
Lecture Notes in Computer Science | 2012-01-13 | Paper |
FlipCut supertrees: towards matrix representation accuracy in polynomial time
Lecture Notes in Computer Science | 2011-08-17 | Paper |
Exact algorithms for cluster editing: Evaluation and experiments
Algorithmica | 2011-05-10 | Paper |
Computing bond orders in molecule graphs
Theoretical Computer Science | 2011-03-14 | Paper |
A faster fixed-parameter approach to drawing binary tanglegrams
Parameterized and Exact Computation | 2010-01-14 | Paper |
Going weighted: parameterized algorithms for cluster editing
Theoretical Computer Science | 2009-11-25 | Paper |
Determination of Glycan Structure from Tandem Mass Spectra
Lecture Notes in Computer Science | 2009-07-23 | Paper |
Computing Bond Types in Molecule Graphs
Lecture Notes in Computer Science | 2009-07-23 | Paper |
Inferring Peptide Composition from Molecular Formulas
Lecture Notes in Computer Science | 2009-07-23 | Paper |
Going Weighted: Parameterized Algorithms for Cluster Editing
Combinatorial Optimization and Applications | 2009-01-27 | Paper |
Exact Algorithms for Cluster Editing: Evaluation and Experiments
Experimental Algorithms | 2008-06-13 | Paper |
An Improved Fixed-Parameter Algorithm for Minimum-Flip Consensus Trees
Parameterized and Exact Computation | 2008-06-05 | Paper |
Mass spectra alignments and their significance
Journal of Discrete Algorithms | 2008-05-29 | Paper |
A fast and simple algorithm for the money changing problem
Algorithmica | 2007-09-10 | Paper |
Sequencing from compomers: The puzzle
Theory of Computing Systems | 2007-02-13 | Paper |
Computing and Combinatorics
Lecture Notes in Computer Science | 2006-01-11 | Paper |
Combinatorial Pattern Matching
Lecture Notes in Computer Science | 2005-12-14 | Paper |
Patchworks
Advances in Mathematics | 2002-02-17 | Paper |
From subtrees to supertrees
| 2001-09-18 | Paper |
Algorithmic Aspects of Tree Amalgamation
Journal of Algorithms | 2000-12-19 | Paper |
A note on maximal hierarchies
Advances in Mathematics | 2000-11-19 | Paper |
Patching up \(X\)-trees
Annals of Combinatorics | 2000-04-04 | Paper |
Recovering symbolically dated, rooted trees from symbolic ultrametrics
Advances in Mathematics | 1998-12-02 | Paper |
