| Publication | Date of Publication | Type |
|---|
| Proof of a conjecture about minimum spanning tree cycle intersection | 2022-09-15 | Paper |
| Computing the Line-Constrained k-center in the Plane for Small k | 2016-11-09 | Paper |
| An efficient algorithm for the length-constrained heaviest path problem on a tree | 2016-06-16 | Paper |
| The Generalized Popular Condensation Problem | 2015-09-11 | Paper |
| On the generalized constrained longest common subsequence problems | 2015-08-24 | Paper |
| Forming Plurality at Minimum Cost | 2015-02-27 | Paper |
| An Optimal Algorithm for the Popular Condensation Problem | 2014-01-17 | Paper |
| Computing Plurality Points and Condorcet Points in Euclidean Space | 2014-01-14 | Paper |
| A linear-time algorithm for finding an edge-partition with max-min ratio at most two | 2013-04-25 | Paper |
| A fully compressed algorithm for computing the edit distance of run-length encoded strings | 2013-03-05 | Paper |
| Efficient algorithms for local ranking | 2012-07-25 | Paper |
| Asymptotic Limits of a New Type of Maximization Recurrence with an Application to Bioinformatics | 2012-07-16 | Paper |
| Efficient retrieval of approximate palindromes in a run-length encoded string | 2012-06-25 | Paper |
| MINKOWSKI SUM SELECTION AND FINDING | 2011-08-23 | Paper |
| Finding all sorting tandem duplication random loss operations | 2011-05-03 | Paper |
| FINDING ALL APPROXIMATE GAPPED PALINDROMES | 2011-01-19 | Paper |
| Identifying Approximate Palindromes in Run-Length Encoded Strings | 2010-12-09 | Paper |
| A tight bound on the min-ratio edge-partitioning problem of a tree | 2010-11-25 | Paper |
| A Fully Compressed Algorithm for Computing the Edit Distance of Run-Length Encoded Strings | 2010-09-06 | Paper |
| Hardness of comparing two run-length encoded strings | 2010-09-01 | Paper |
| Optimal algorithms for the average-constrained maximum-sum segment problem | 2010-06-16 | Paper |
| Optimal algorithms for locating the longest and shortest segments satisfying a sum or an average constraint | 2009-12-18 | Paper |
| Finding All Approximate Gapped Palindromes | 2009-12-17 | Paper |
| A fast algorithm for computing a longest common increasing subsequence | 2009-08-27 | Paper |
| Algorithms and Computation | 2009-08-07 | Paper |
| The backup 2‐center and backup 2‐median problems on trees | 2009-07-28 | Paper |
| Approximate Matching for Run-Length Encoded Strings Is 3sum-Hard | 2009-07-07 | Paper |
| Finding All Sorting Tandem Duplication Random Loss Operations | 2009-07-07 | Paper |
| On locating disjoint segments with maximum sum of densities | 2009-06-16 | Paper |
| Minkowski Sum Selection and Finding | 2009-01-29 | Paper |
| Algorithms for finding the weight-constrained \(k\) longest paths in a tree and the length-constrained \(k\) maximum-sum segments of a sequence | 2008-11-18 | Paper |
| The 2-radius and 2-radiian problems on trees | 2008-11-18 | Paper |
| Sequence comparison. Theory and methods | 2008-10-02 | Paper |
| Algorithms for Computing the Length-Constrained Max-Score Segments with Applications to DNA Copy Number Data Analysis | 2008-05-27 | Paper |
| On Locating Disjoint Segments with Maximum Sum of Densities | 2008-04-24 | Paper |
| The swap edges of a multiple-sources routing tree | 2008-04-03 | Paper |
| A tight analysis of the Katriel-Bodlaender algorithm for online topological ordering | 2008-01-07 | Paper |
| On the range maximum-sum segment query problem | 2007-09-21 | Paper |
| On the uniform edge-partition of a tree | 2007-06-26 | Paper |
| Algorithms and Computation | 2006-11-14 | Paper |
| Improved algorithms for the \(k\) maximum-sums problems | 2006-10-20 | Paper |
| Algorithms and Computation | 2005-12-22 | Paper |
| Finding a length-constrained maximum-density path in a tree | 2005-06-08 | Paper |
| Spanning Trees and Optimization Problems | 2004-01-18 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4708595 | 2003-06-18 | Paper |
| Efficient algorithms for locating the length-constrained heaviest segments with applications to biomolecular sequence analysis. | 2003-05-14 | Paper |
| Light graphs with small routing cost | 2002-07-01 | Paper |
| Approximation algorithms for the shortest total path length spanning tree problem | 2001-02-27 | Paper |
| Approximation algorithms for some optimum communication spanning tree problems | 2000-11-27 | Paper |
| On computing all suboptimal alignments | 2000-09-20 | Paper |
| A Polynomial Time Approximation Scheme for Optimal Product-Requirement Communication Spanning Trees | 2000-08-27 | Paper |
| A Polynomial-Time Approximation Scheme for Minimum Routing Cost Spanning Trees | 2000-03-19 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4250159 | 2000-02-09 | Paper |
| Approximation and exact algorithms for constructing minimum ultrametric trees from distance matrices | 1999-11-21 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4218433 | 1999-03-30 | Paper |
| Linear-space algorithms that build local alignments from fragments | 1996-07-01 | Paper |
| Constrained sequence alignment | 1993-05-16 | Paper |
