| Publication | Date of Publication | Type |
|---|
Approximation algorithms for the longest run subsequence problem
| 2024-10-21 | Paper |
MUL-tree pruning for consistency and compatibility
| 2024-10-21 | Paper |
Shortest longest-path graph orientations
| 2024-08-22 | Paper |
Polynomial-time equivalences and refined algorithms for longest common subsequence variants
Discrete Applied Mathematics | 2024-05-29 | Paper |
Polynomial-time equivalences and refined algorithms for longest common subsequence variants
| 2024-05-06 | Paper |
Efficient assignment of identities in anonymous populations
| 2024-04-15 | Paper |
Finding the cyclic covers of a string
WALCOM: Algorithms and Computation | 2023-11-24 | Paper |
Building a small and informative phylogenetic supertree
Information and Computation | 2023-09-27 | Paper |
Online and Approximate Network Construction from Bounded Connectivity Constraints
International Journal of Foundations of Computer Science | 2023-08-18 | Paper |
Online and approximate network construction from bounded connectivity constraints
| 2023-03-22 | Paper |
scientific article; zbMATH DE number 7564377 (Why is no real title available?)
| 2022-07-27 | Paper |
scientific article; zbMATH DE number 7561381 (Why is no real title available?)
| 2022-07-21 | Paper |
Fast algorithms for the rooted triplet distance between caterpillars
| 2022-05-20 | Paper |
Upper and lower degree-constrained graph orientation with minimum penalty
Theoretical Computer Science | 2021-12-22 | Paper |
New and improved algorithms for unordered tree inclusion
Theoretical Computer Science | 2021-08-27 | Paper |
Computing the rooted triplet distance between phylogenetic networks
Algorithmica | 2021-06-11 | Paper |
Graph orientation with edge modifications
International Journal of Foundations of Computer Science | 2021-04-19 | Paper |
Pushing the online Boolean matrix-vector multiplication conjecture off-line and identifying its easy cases
Journal of Computer and System Sciences | 2021-03-10 | Paper |
Graph orientation with splits
Theoretical Computer Science | 2020-10-21 | Paper |
Exact algorithms for the repetition-bounded longest common subsequence problem
Theoretical Computer Science | 2020-09-01 | Paper |
Exact algorithms for the bounded repetition longest common subsequence problem
| 2020-05-13 | Paper |
Computing the rooted triplet distance between phylogenetic networks
Lecture Notes in Computer Science | 2020-02-25 | Paper |
Graph orientation with edge modifications
| 2019-10-11 | Paper |
Pushing the online matrix-vector conjecture off-line and identifying its easy cases
| 2019-10-11 | Paper |
Improved Algorithms for Constructing Consensus Trees
Proceedings of the Twenty-Fourth Annual ACM-SIAM Symposium on Discrete Algorithms | 2019-05-15 | Paper |
The approximability of maximum rooted triplets consistency with fan triplets and forbidden triplets
Discrete Applied Mathematics | 2019-03-11 | Paper |
Graph orientation with splits
Lecture Notes in Computer Science | 2018-08-17 | Paper |
Improved algorithms for constructing consensus trees
Journal of the ACM | 2018-08-02 | Paper |
Determining the consistency of resolved triplets and fan triplets
| 2018-03-22 | Paper |
scientific article; zbMATH DE number 6851886 (Why is no real title available?)
| 2018-03-21 | Paper |
3D rectangulations and geometric matrix multiplication
Algorithmica | 2018-02-28 | Paper |
On finding the Adams consensus tree
Information and Computation | 2017-09-28 | Paper |
An efficient algorithm for the rooted triplet distance between galled trees
| 2017-07-25 | Paper |
On finding the Adams consensus tree
| 2017-01-24 | Paper |
On the parameterized complexity of associative and commutative unification
Theoretical Computer Science | 2016-12-22 | Paper |
Faster algorithms for computing the R* consensus tree
Algorithmica | 2016-12-21 | Paper |
Degree-constrained graph orientation: maximum satisfaction and minimum violation
Theory of Computing Systems | 2016-03-21 | Paper |
Graph orientations optimizing the number of light or heavy vertices
Journal of Graph Algorithms and Applications | 2015-10-29 | Paper |
On the parameterized complexity of associative and commutative unification
Parameterized and Exact Computation | 2015-09-15 | Paper |
3D rectangulations and geometric matrix multiplication
Algorithms and Computation | 2015-09-11 | Paper |
Faster algorithms for computing the R* consensus tree
Algorithms and Computation | 2015-09-11 | Paper |
The approximability of maximum rooted triplets consistency with fan triplets and forbidden triplets
Combinatorial Pattern Matching | 2015-08-20 | Paper |
Linked dynamic tries with applications to LZ-compression in sublinear time and space
Algorithmica | 2015-06-25 | Paper |
Ultra-succinct representation of ordered trees
| 2014-12-18 | Paper |
Algorithms for combining rooted triplets into a galled phylogenetic network
| 2014-10-13 | Paper |
Degree-constrained graph orientation: maximum satisfaction and minimum violation
Approximation and Online Algorithms | 2014-09-02 | Paper |
Fast relative Lempel-Ziv self-index for similar sequences
Theoretical Computer Science | 2014-04-15 | Paper |
Computing the rooted triplet distance between galled trees by counting triangles
Journal of Discrete Algorithms | 2014-04-01 | Paper |
Computing the maximum agreement of phylogenetic networks
| 2013-08-30 | Paper |
CRAM: compressed random access memory
Automata, Languages, and Programming | 2013-08-12 | Paper |
Constructing the R* consensus tree of two trees in subcubic time
Algorithmica | 2013-05-13 | Paper |
Graph orientations optimizing the number of light or heavy vertices
Lecture Notes in Computer Science | 2012-11-02 | Paper |
Faster computation of the Robinson-Foulds distance between phylogenetic networks
Information Sciences | 2012-10-02 | Paper |
Computing the rooted triplet distance between galled trees by counting triangles
Combinatorial Pattern Matching | 2012-08-14 | Paper |
More efficient periodic traversal in anonymous undirected graphs
Theoretical Computer Science | 2012-08-10 | Paper |
Fast relative Lempel-Ziv self-index for similar sequences
Frontiers in Algorithmics and Algorithmic Aspects in Information and Management | 2012-07-16 | Paper |
Asymptotic limits of a new type of maximization recurrence with an application to bioinformatics
Lecture Notes in Computer Science | 2012-07-16 | Paper |
Inferring a graph from path frequency
Discrete Applied Mathematics | 2012-06-18 | Paper |
The complexity of inferring a minimally resolved phylogenetic supertree
SIAM Journal on Computing | 2012-05-30 | Paper |
Ultra-succinct representation of ordered trees with applications
Journal of Computer and System Sciences | 2012-05-11 | Paper |
Approximation algorithms for buy-at-bulk geometric network design
International Journal of Foundations of Computer Science | 2012-03-13 | Paper |
Algorithms for building consensus MUL-trees
Algorithms and Computation | 2011-12-16 | Paper |
Approximation algorithms for the graph orientation minimizing the maximum weighted outdegree
Journal of Combinatorial Optimization | 2011-06-17 | Paper |
Algorithms for finding a most similar subforest
Theory of Computing Systems | 2011-05-25 | Paper |
Graph orientation to maximize the minimum weighted outdegree
International Journal of Foundations of Computer Science | 2011-05-10 | Paper |
New results on optimizing rooted triplets consistency
Discrete Applied Mathematics | 2010-10-11 | Paper |
Constructing the R* consensus tree of two trees in subcubic time
Algorithms – ESA 2010 | 2010-09-06 | Paper |
Faster computation of the Robinson-Foulds distance between phylogenetic networks
Combinatorial Pattern Matching | 2010-07-26 | Paper |
More efficient periodic traversal in anonymous undirected graphs
Structural Information and Communication Complexity | 2010-02-24 | Paper |
Computing a smallest multi-labeled phylogenetic tree from rooted triplets
Algorithms and Computation | 2009-12-17 | Paper |
Approximation Algorithms for Buy-at-Bulk Geometric Network Design
Lecture Notes in Computer Science | 2009-10-20 | Paper |
LATIN 2004: Theoretical Informatics
Lecture Notes in Computer Science | 2009-05-07 | Paper |
New Results on Optimizing Rooted Triplets Consistency
Algorithms and Computation | 2009-01-29 | Paper |
Compressed Dynamic Tries with Applications to LZ-Compression in Sublinear Time and Space
FSTTCS 2007: Foundations of Software Technology and Theoretical Computer Science | 2008-04-24 | Paper |
Approximation Algorithms for the Graph Orientation Minimizing the Maximum Weighted Outdegree
Algorithmic Aspects in Information and Management | 2008-01-04 | Paper |
Algorithms for Finding a Most Similar Subforest
Combinatorial Pattern Matching | 2007-09-14 | Paper |
Polynomial-time algorithms for the ordered maximum agreement subtree problem
Algorithmica | 2007-08-20 | Paper |
Approximation algorithms for Hamming clustering problems
Journal of Discrete Algorithms | 2007-04-26 | Paper |
ON THE APPROXIMABILITY OF MAXIMUM AND MINIMUM EDGE CLIQUE PARTITION PROBLEMS
International Journal of Foundations of Computer Science | 2007-04-25 | Paper |
ONLINE AND DYNAMIC RECOGNITION OF SQUAREFREE STRINGS
International Journal of Foundations of Computer Science | 2007-04-25 | Paper |
Inferring a level-1 phylogenetic network from a dense set of rooted triplets
Theoretical Computer Science | 2007-01-09 | Paper |
A faster and more space-efficient algorithm for inferring arc-annotations of RNA sequences through alignment
Algorithmica | 2006-11-06 | Paper |
Mathematical Foundations of Computer Science 2005
Lecture Notes in Computer Science | 2006-10-20 | Paper |
Mathematical Foundations of Computer Science 2005
Lecture Notes in Computer Science | 2006-10-20 | Paper |
Algorithms for Combining Rooted Triplets into a Galled Phylogenetic Network
SIAM Journal on Computing | 2006-06-01 | Paper |
Rooted maximum agreement supertrees
Algorithmica | 2006-03-21 | Paper |
Algorithms and Computation
Lecture Notes in Computer Science | 2005-12-22 | Paper |
Algorithms and Computation
Lecture Notes in Computer Science | 2005-12-22 | Paper |
Structural Information and Communication Complexity
Lecture Notes in Computer Science | 2005-11-30 | Paper |
Research in Computational Molecular Biology
Lecture Notes in Computer Science | 2005-11-23 | Paper |
Combinatorial Pattern Matching
Lecture Notes in Computer Science | 2005-09-07 | Paper |
Computing and Combinatorics
Lecture Notes in Computer Science | 2005-06-15 | Paper |
Computing the maximum agreement of phylogenetic networks
Theoretical Computer Science | 2005-06-10 | Paper |
Semi-balanced colorings of graphs: Generalized 2-colorings based on a relaxed discrepancy condition
Graphs and Combinatorics | 2004-12-13 | Paper |
scientific article; zbMATH DE number 1998340 (Why is no real title available?)
| 2003-10-29 | Paper |
scientific article; zbMATH DE number 1786462 (Why is no real title available?)
| 2002-08-21 | Paper |
On the complexity of inferring rooted evolutinary trees
| 2001-10-24 | Paper |
scientific article; zbMATH DE number 1615274 (Why is no real title available?)
| 2001-07-08 | Paper |
scientific article; zbMATH DE number 1444316 (Why is no real title available?)
| 2001-01-14 | Paper |
On the complexity of constructing evolutionary trees
Journal of Combinatorial Optimization | 1999-11-21 | Paper |
scientific article; zbMATH DE number 1305511 (Why is no real title available?)
| 1999-06-17 | Paper |
scientific article; zbMATH DE number 1088267 (Why is no real title available?)
| 1997-12-15 | Paper |
