| Publication | Date of Publication | Type |
|---|
| https://portal.mardi4nfdi.de/entity/Q6128571 | 2024-04-15 | Paper |
| Finding the cyclic covers of a string | 2023-11-24 | Paper |
| Building a small and informative phylogenetic supertree | 2023-09-27 | Paper |
| Online and Approximate Network Construction from Bounded Connectivity Constraints | 2023-08-18 | Paper |
| Online and approximate network construction from bounded connectivity constraints | 2023-03-22 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5091725 | 2022-07-27 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5091018 | 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 | 2021-12-22 | Paper |
| New and improved algorithms for unordered tree inclusion | 2021-08-27 | Paper |
| Computing the rooted triplet distance between phylogenetic networks | 2021-06-11 | Paper |
| Graph Orientation with Edge Modifications | 2021-04-19 | Paper |
| Pushing the online Boolean matrix-vector multiplication conjecture off-line and identifying its easy cases | 2021-03-10 | Paper |
| Graph orientation with splits | 2020-10-21 | Paper |
| Exact algorithms for the repetition-bounded longest common subsequence problem | 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 | 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 | 2019-05-15 | Paper |
| The approximability of maximum rooted triplets consistency with fan triplets and forbidden triplets | 2019-03-11 | Paper |
| Graph orientation with splits | 2018-08-17 | Paper |
| Improved Algorithms for Constructing Consensus Trees | 2018-08-02 | Paper |
| Determining the consistency of resolved triplets and fan triplets | 2018-03-22 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4608616 | 2018-03-21 | Paper |
| 3D rectangulations and geometric matrix multiplication | 2018-02-28 | Paper |
| On finding the Adams consensus tree | 2017-09-28 | Paper |
| An efficient algorithm for the rooted triplet distance between galled trees | 2017-07-25 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2955018 | 2017-01-24 | Paper |
| On the parameterized complexity of associative and commutative unification | 2016-12-22 | Paper |
| Faster algorithms for computing the R* consensus tree | 2016-12-21 | Paper |
| Degree-constrained graph orientation: maximum satisfaction and minimum violation | 2016-03-21 | Paper |
| Graph Orientations Optimizing the Number of Light or Heavy Vertices | 2015-10-29 | Paper |
| On the Parameterized Complexity of Associative and Commutative Unification | 2015-09-15 | Paper |
| 3D Rectangulations and Geometric Matrix Multiplication | 2015-09-11 | Paper |
| Faster Algorithms for Computing the R* Consensus Tree | 2015-09-11 | Paper |
| The Approximability of Maximum Rooted Triplets Consistency with Fan Triplets and Forbidden Triplets | 2015-08-20 | Paper |
| Linked dynamic tries with applications to LZ-compression in sublinear time and space | 2015-06-25 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2934640 | 2014-12-18 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2921689 | 2014-10-13 | Paper |
| Degree-Constrained Graph Orientation: Maximum Satisfaction and Minimum Violation | 2014-09-02 | Paper |
| Fast relative Lempel-Ziv self-index for similar sequences | 2014-04-15 | Paper |
| Computing the rooted triplet distance between galled trees by counting triangles | 2014-04-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2845521 | 2013-08-30 | Paper |
| CRAM: Compressed Random Access Memory | 2013-08-12 | Paper |
| Constructing the R* consensus tree of two trees in subcubic time | 2013-05-13 | Paper |
| Graph Orientations Optimizing the Number of Light or Heavy Vertices | 2012-11-02 | Paper |
| Faster computation of the Robinson-Foulds distance between phylogenetic networks | 2012-10-02 | Paper |
| Computing the Rooted Triplet Distance between Galled Trees by Counting Triangles | 2012-08-14 | Paper |
| More efficient periodic traversal in anonymous undirected graphs | 2012-08-10 | Paper |
| Fast Relative Lempel-Ziv Self-index for Similar Sequences | 2012-07-16 | Paper |
| Asymptotic Limits of a New Type of Maximization Recurrence with an Application to Bioinformatics | 2012-07-16 | Paper |
| Inferring a graph from path frequency | 2012-06-18 | Paper |
| The Complexity of Inferring a Minimally Resolved Phylogenetic Supertree | 2012-05-30 | Paper |
| Ultra-succinct representation of ordered trees with applications | 2012-05-11 | Paper |
| APPROXIMATION ALGORITHMS FOR BUY-AT-BULK GEOMETRIC NETWORK DESIGN | 2012-03-13 | Paper |
| Algorithms for Building Consensus MUL-trees | 2011-12-16 | Paper |
| Approximation algorithms for the graph orientation minimizing the maximum weighted outdegree | 2011-06-17 | Paper |
| Algorithms for finding a most similar subforest | 2011-05-25 | Paper |
| GRAPH ORIENTATION TO MAXIMIZE THE MINIMUM WEIGHTED OUTDEGREE | 2011-05-10 | Paper |
| New results on optimizing rooted triplets consistency | 2010-10-11 | Paper |
| Constructing the R* Consensus Tree of Two Trees in Subcubic Time | 2010-09-06 | Paper |
| Faster Computation of the Robinson-Foulds Distance between Phylogenetic Networks | 2010-07-26 | Paper |
| More Efficient Periodic Traversal in Anonymous Undirected Graphs | 2010-02-24 | Paper |
| Computing a Smallest Multi-labeled Phylogenetic Tree from Rooted Triplets | 2009-12-17 | Paper |
| Approximation Algorithms for Buy-at-Bulk Geometric Network Design | 2009-10-20 | Paper |
| LATIN 2004: Theoretical Informatics | 2009-05-07 | Paper |
| New Results on Optimizing Rooted Triplets Consistency | 2009-01-29 | Paper |
| Compressed Dynamic Tries with Applications to LZ-Compression in Sublinear Time and Space | 2008-04-24 | Paper |
| Approximation Algorithms for the Graph Orientation Minimizing the Maximum Weighted Outdegree | 2008-01-04 | Paper |
| Algorithms for Finding a Most Similar Subforest | 2007-09-14 | Paper |
| Polynomial-time algorithms for the ordered maximum agreement subtree problem | 2007-08-20 | Paper |
| Approximation algorithms for Hamming clustering problems | 2007-04-26 | Paper |
| ON THE APPROXIMABILITY OF MAXIMUM AND MINIMUM EDGE CLIQUE PARTITION PROBLEMS | 2007-04-25 | Paper |
| ONLINE AND DYNAMIC RECOGNITION OF SQUAREFREE STRINGS | 2007-04-25 | Paper |
| Inferring a level-1 phylogenetic network from a dense set of rooted triplets | 2007-01-09 | Paper |
| A faster and more space-efficient algorithm for inferring arc-annotations of RNA sequences through alignment | 2006-11-06 | Paper |
| Mathematical Foundations of Computer Science 2005 | 2006-10-20 | Paper |
| Mathematical Foundations of Computer Science 2005 | 2006-10-20 | Paper |
| Algorithms for Combining Rooted Triplets into a Galled Phylogenetic Network | 2006-06-01 | Paper |
| Rooted maximum agreement supertrees | 2006-03-21 | Paper |
| Algorithms and Computation | 2005-12-22 | Paper |
| Algorithms and Computation | 2005-12-22 | Paper |
| Structural Information and Communication Complexity | 2005-11-30 | Paper |
| Research in Computational Molecular Biology | 2005-11-23 | Paper |
| Combinatorial Pattern Matching | 2005-09-07 | Paper |
| Computing and Combinatorics | 2005-06-15 | Paper |
| Computing the maximum agreement of phylogenetic networks | 2005-06-10 | Paper |
| Semi-balanced colorings of graphs: Generalized 2-colorings based on a relaxed discrepancy condition | 2004-12-13 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4432975 | 2003-10-29 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4547753 | 2002-08-21 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2741464 | 2001-10-24 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2723944 | 2001-07-08 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4953346 | 2001-01-14 | Paper |
| On the complexity of constructing evolutionary trees | 1999-11-21 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4252402 | 1999-06-17 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4364583 | 1997-12-15 | Paper |
