| Publication | Date of Publication | Type |
|---|
Proof of a conjecture about minimum spanning tree cycle intersection
Discrete Applied Mathematics | 2022-09-15 | Paper |
Computing the line-constrained \(k\)-center in the plane for small \(k\)
Algorithmic Aspects in Information and Management | 2016-11-09 | Paper |
An efficient algorithm for the length-constrained heaviest path problem on a tree
Information Processing Letters | 2016-06-16 | Paper |
The NPO-completeness of the longest Hamiltonian cycle problem
Information Processing Letters | 2016-06-09 | Paper |
The generalized popular condensation problem
Algorithms and Computation | 2015-09-11 | Paper |
On the generalized constrained longest common subsequence problems
Journal of Combinatorial Optimization | 2015-08-24 | Paper |
Forming Plurality at Minimum Cost
WALCOM: Algorithms and Computation | 2015-02-27 | Paper |
An optimal algorithm for the popular condensation problem
Lecture Notes in Computer Science | 2014-01-17 | Paper |
Computing Plurality Points and Condorcet Points in Euclidean Space
Algorithms and Computation | 2014-01-14 | Paper |
A linear-time algorithm for finding an edge-partition with max-min ratio at most two
Discrete Applied Mathematics | 2013-04-25 | Paper |
A fully compressed algorithm for computing the edit distance of run-length encoded strings
Algorithmica | 2013-03-05 | Paper |
Efficient algorithms for local ranking
Information Processing Letters | 2012-07-25 | Paper |
Asymptotic limits of a new type of maximization recurrence with an application to bioinformatics
Lecture Notes in Computer Science | 2012-07-16 | Paper |
Efficient retrieval of approximate palindromes in a run-length encoded string
Theoretical Computer Science | 2012-06-25 | Paper |
Minkowski sum selection and finding
International Journal of Computational Geometry & Applications | 2011-08-23 | Paper |
Finding all sorting tandem duplication random loss operations
Journal of Discrete Algorithms | 2011-05-03 | Paper |
FINDING ALL APPROXIMATE GAPPED PALINDROMES
International Journal of Foundations of Computer Science | 2011-01-19 | Paper |
Identifying approximate palindromes in run-length encoded strings
Algorithms and Computation | 2010-12-09 | Paper |
A tight bound on the min-ratio edge-partitioning problem of a tree
Discrete Applied Mathematics | 2010-11-25 | Paper |
A fully compressed algorithm for computing the edit distance of run-length encoded strings
Algorithms – ESA 2010 | 2010-09-06 | Paper |
Hardness of comparing two run-length encoded strings
Journal of Complexity | 2010-09-01 | Paper |
Optimal algorithms for the average-constrained maximum-sum segment problem
Information Processing Letters | 2010-06-16 | Paper |
Optimal algorithms for locating the longest and shortest segments satisfying a sum or an average constraint
Information Processing Letters | 2009-12-18 | Paper |
Finding all approximate gapped palindromes
Algorithms and Computation | 2009-12-17 | Paper |
A fast algorithm for computing a longest common increasing subsequence
Information Processing Letters | 2009-08-27 | Paper |
Algorithms and Computation
Lecture Notes in Computer Science | 2009-08-07 | Paper |
The backup 2‐center and backup 2‐median problems on trees
Networks | 2009-07-28 | Paper |
Finding All Sorting Tandem Duplication Random Loss Operations
Combinatorial Pattern Matching | 2009-07-07 | Paper |
Approximate Matching for Run-Length Encoded Strings Is 3sum-Hard
Combinatorial Pattern Matching | 2009-07-07 | Paper |
On locating disjoint segments with maximum sum of densities
Algorithmica | 2009-06-16 | Paper |
Minkowski Sum Selection and Finding
Algorithms and Computation | 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
Theoretical Computer Science | 2008-11-18 | Paper |
The 2-radius and 2-radiian problems on trees
Theoretical Computer Science | 2008-11-18 | Paper |
Sequence comparison. Theory and methods
Computational Biology | 2008-10-02 | Paper |
Algorithms for Computing the Length-Constrained Max-Score Segments with Applications to DNA Copy Number Data Analysis
Algorithms and Computation | 2008-05-27 | Paper |
On Locating Disjoint Segments with Maximum Sum of Densities
Algorithms and Computation | 2008-04-24 | Paper |
The swap edges of a multiple-sources routing tree
Algorithmica | 2008-04-03 | Paper |
A tight analysis of the Katriel-Bodlaender algorithm for online topological ordering
Theoretical Computer Science | 2008-01-07 | Paper |
On the range maximum-sum segment query problem
Discrete Applied Mathematics | 2007-09-21 | Paper |
On the uniform edge-partition of a tree
Discrete Applied Mathematics | 2007-06-26 | Paper |
Algorithms and Computation
Lecture Notes in Computer Science | 2006-11-14 | Paper |
Improved algorithms for the \(k\) maximum-sums problems
Theoretical Computer Science | 2006-10-20 | Paper |
Algorithms and Computation
Lecture Notes in Computer Science | 2005-12-22 | Paper |
Finding a length-constrained maximum-density path in a tree
Journal of Combinatorial Optimization | 2005-06-08 | Paper |
Spanning Trees and Optimization Problems
| 2004-01-18 | Paper |
scientific article; zbMATH DE number 1929960 (Why is no real title available?)
| 2003-06-18 | Paper |
Efficient algorithms for locating the length-constrained heaviest segments with applications to biomolecular sequence analysis.
Journal of Computer and System Sciences | 2003-05-14 | Paper |
Light graphs with small routing cost
Networks | 2002-07-01 | Paper |
Approximation algorithms for the shortest total path length spanning tree problem
Discrete Applied Mathematics | 2001-02-27 | Paper |
Approximation algorithms for some optimum communication spanning tree problems
Discrete Applied Mathematics | 2000-11-27 | Paper |
On computing all suboptimal alignments
Information Sciences | 2000-09-20 | Paper |
A Polynomial Time Approximation Scheme for Optimal Product-Requirement Communication Spanning Trees
Journal of Algorithms | 2000-08-27 | Paper |
A Polynomial-Time Approximation Scheme for Minimum Routing Cost Spanning Trees
SIAM Journal on Computing | 2000-03-19 | Paper |
scientific article; zbMATH DE number 1303537 (Why is no real title available?)
| 2000-02-09 | Paper |
Approximation and exact algorithms for constructing minimum ultrametric trees from distance matrices
Journal of Combinatorial Optimization | 1999-11-21 | Paper |
scientific article; zbMATH DE number 1222844 (Why is no real title available?)
| 1999-03-30 | Paper |
Linear-space algorithms that build local alignments from fragments
Algorithmica | 1996-07-01 | Paper |
Constrained sequence alignment
Bulletin of Mathematical Biology | 1993-05-16 | Paper |
