| Publication | Date of Publication | Type |
|---|
Approximation algorithms for the maximum path cover problem using long paths
Information and Computation | 2025-12-15 | Paper |
Approximately covering vertices by order-5 or longer paths
Journal of Computer and System Sciences | 2025-12-11 | Paper |
Path cover using only short paths
Theoretical Computer Science | 2025-10-17 | Paper |
| Approximately covering vertices by order-5 or longer paths | 2025-06-17 | Paper |
An improved approximation algorithm for covering vertices by 4^+-paths
Journal of Combinatorial Optimization | 2025-04-28 | Paper |
| An approximation algorithm for covering vertices by \(4^+\)-paths | 2024-09-16 | Paper |
Approximation Algorithms for Multiprocessor Scheduling with Testing to Minimize the Total Job Completion Time
Algorithmica | 2024-04-24 | Paper |
Approximating the directed path partition problem
Information and Computation | 2024-03-27 | Paper |
NC algorithms for partitioning planar graphs into induced forests and approximating NP-hard problems
Graph-Theoretic Concepts in Computer Science | 2024-02-28 | Paper |
Fast RNC and NC algorithms for finding a maximal set of paths with an application
Lecture Notes in Computer Science | 2024-01-29 | Paper |
The maximal f-dependent set problem for planar graphs is in NC
Graph-Theoretic Concepts in Computer Science | 2024-01-05 | Paper |
Approximation algorithms for the directed path partition problems
Frontiers of Algorithmics | 2023-08-10 | Paper |
| NC algorithms for partitioning sparse graphs into induced forests with an application | 2023-03-21 | Paper |
Approximation algorithms for the maximally balanced connected graph tripartition problem
Journal of Combinatorial Optimization | 2022-10-04 | Paper |
| Better practical algorithms for rSPR distance and hybridization number | 2022-07-27 | Paper |
Approximation algorithms for maximally balanced connected graph partition
Algorithmica | 2022-01-18 | Paper |
A randomized approximation algorithm for metric triangle packing
Journal of Combinatorial Optimization | 2021-05-11 | Paper |
Improved approximation algorithms for path vertex covers in regular graphs
Algorithmica | 2020-10-12 | Paper |
Approximation algorithms for maximally balanced connected graph partition
Combinatorial Optimization and Applications | 2020-05-13 | Paper |
A randomized approximation algorithm for metric triangle packing
Combinatorial Optimization and Applications | 2020-05-13 | Paper |
Approximation algorithms for the maximum weight internal spanning tree problem
Algorithmica | 2019-10-17 | Paper |
Designing and implementing algorithms for the closest string problem
Theoretical Computer Science | 2019-08-20 | Paper |
Better approximation algorithms for scaffolding problems
Frontiers in Algorithmics | 2019-04-26 | Paper |
Designing and Implementing Algorithms for the Closest String Problem
Frontiers in Algorithmics | 2019-04-26 | Paper |
NC algorithms for finding a maximal set of paths with application to compressing strings
Automata, Languages and Programming | 2019-01-10 | Paper |
Approximation algorithms for the scaffolding problem and its generalizations
Theoretical Computer Science | 2018-06-05 | Paper |
An approximation algorithm for maximum internal spanning tree
Journal of Combinatorial Optimization | 2018-04-13 | Paper |
Approximation algorithms for the maximum weight internal spanning tree problem
Lecture Notes in Computer Science | 2017-10-23 | Paper |
An approximation algorithm for maximum internal spanning tree
Lecture Notes in Computer Science | 2017-05-05 | Paper |
The parameterized complexity of the shared center problem
Algorithmica | 2017-03-27 | Paper |
An improved approximation algorithm for rSPR distance
Lecture Notes in Computer Science | 2016-09-02 | Paper |
Parameterized and approximation algorithms for finding two disjoint matchings
Theoretical Computer Science | 2016-06-27 | Paper |
Parallel approximation algorithms for maximum weighted matching in general graphs
Information Processing Letters | 2016-06-16 | Paper |
Randomized fixed-parameter algorithms for the closest string problem
Algorithmica | 2016-03-23 | Paper |
Map graphs
Journal of the ACM | 2015-10-30 | Paper |
| scientific article; zbMATH DE number 6472597 (Why is no real title available?) | 2015-08-14 | Paper |
Faster exact computation of rSPR distance
Journal of Combinatorial Optimization | 2015-05-11 | Paper |
Randomized and Parameterized Algorithms for the Closest String Problem
Combinatorial Pattern Matching | 2014-06-30 | Paper |
Faster exact computation of rSPR distance
Frontiers in Algorithmics and Algorithmic Aspects in Information and Management | 2014-04-03 | Paper |
Parameterized and Approximation Algorithms for Finding Two Disjoint Matchings
Combinatorial Optimization and Applications | 2013-12-10 | Paper |
An improved approximation algorithm for the bandpass-2 problem
Combinatorial Optimization and Applications | 2012-11-02 | Paper |
The parameterized complexity of the shared center problem
Combinatorial Pattern Matching | 2012-08-14 | Paper |
A three-string approach to the closest string problem
Journal of Computer and System Sciences | 2012-05-11 | Paper |
An approximation algorithm for the minimum co-path set problem
Algorithmica | 2011-07-01 | Paper |
A Space Efficient Algorithm for Sequence Alignment with Inversions
Lecture Notes in Computer Science | 2011-03-18 | Paper |
Approximating maximum edge 2-coloring in simple graphs
Discrete Applied Mathematics | 2010-11-25 | Paper |
Erratum to: ``An improved randomized approximation algorithm for maximum triangle packing''
Discrete Applied Mathematics | 2010-10-11 | Paper |
A linear kernel for co-path/cycle packing
Algorithmic Aspects in Information and Management | 2010-07-20 | Paper |
Approximating maximum edge 2-coloring in simple graphs
Algorithmic Aspects in Information and Management | 2010-07-20 | Paper |
A three-string approach to the closest string problem
Lecture Notes in Computer Science | 2010-07-20 | Paper |
More reliable protein NMR peak assignment via improved 2-interval scheduling
Lecture Notes in Computer Science | 2010-03-03 | Paper |
Improved deterministic approximation algorithms for max TSP
Information Processing Letters | 2009-12-04 | Paper |
A 3.4713-approximation algorithm for the capacitated multicast tree routing problem
Theoretical Computer Science | 2009-11-25 | Paper |
Approximation algorithms for reconstructing the duplication history of tandem repeats
Algorithmica | 2009-11-25 | Paper |
Approximating maximum edge 2-coloring in simple graphs via local improvement
Theoretical Computer Science | 2009-11-04 | Paper |
An improved randomized approximation algorithm for maximum triangle packing
Discrete Applied Mathematics | 2009-06-30 | Paper |
Approximation Algorithms for Reconstructing the Duplication History of Tandem Repeats
Lecture Notes in Computer Science | 2009-03-06 | Paper |
An Improved Approximation Algorithm for the Capacitated Multicast Tree Routing Problem
Combinatorial Optimization and Applications | 2009-01-27 | Paper |
An improved approximation algorithm for maximum edge 2-coloring in simple graphs
Journal of Discrete Algorithms | 2008-08-08 | Paper |
Optimizing deletion cost for secure multicast key management
Theoretical Computer Science | 2008-07-31 | Paper |
Approximating Maximum Edge 2-Coloring in Simple Graphs Via Local Improvement
Algorithmic Aspects in Information and Management | 2008-07-10 | Paper |
An Improved Randomized Approximation Algorithm for Maximum Triangle Packing
Algorithmic Aspects in Information and Management | 2008-07-10 | Paper |
Approximation algorithms for bounded degree phylogenetic roots
Algorithmica | 2008-05-27 | Paper |
Improved approximation algorithms for metric MaxTSP
Journal of Combinatorial Optimization | 2008-01-22 | Paper |
An Improved Approximation Algorithm for Maximum Edge 2-Coloring in Simple Graphs
Algorithmic Aspects in Information and Management | 2008-01-04 | Paper |
Mathematical Foundations of Computer Science 2003
Lecture Notes in Computer Science | 2007-12-07 | Paper |
New bounds on the edge number of ak-map graph
Journal of Graph Theory | 2007-08-09 | Paper |
Computing phylogenetic roots with bounded degrees and errors is NP-complete
Theoretical Computer Science | 2007-01-09 | Paper |
Recognizing hole-free 4-map graphs in cubic time
Algorithmica | 2006-08-11 | Paper |
Computing bounded-degree phylogenetic roots of disconnected graphs
Journal of Algorithms | 2006-06-30 | Paper |
Algorithms – ESA 2005
Lecture Notes in Computer Science | 2006-06-27 | Paper |
A linear-time algorithm for 7-coloring 1-plane graphs
Algorithmica | 2006-03-21 | Paper |
An improved randomized approximation algorithm for Max TSP
Journal of Combinatorial Optimization | 2005-12-14 | Paper |
Graph-Theoretic Concepts in Computer Science
Lecture Notes in Computer Science | 2005-12-08 | Paper |
Computing and Combinatorics
Lecture Notes in Computer Science | 2005-06-15 | Paper |
Computing and Combinatorics
Lecture Notes in Computer Science | 2005-06-15 | Paper |
A space-efficient algorithm for sequence alignment with inversions and reversals
Theoretical Computer Science | 2004-10-27 | Paper |
| scientific article; zbMATH DE number 2102753 (Why is no real title available?) | 2004-09-24 | Paper |
Disk embeddings of planar graphs
Algorithmica | 2004-09-22 | Paper |
| scientific article; zbMATH DE number 1945156 (Why is no real title available?) | 2003-07-02 | Paper |
Computing Phylogenetic Roots with Bounded Degrees and Errors
SIAM Journal on Computing | 2003-06-19 | Paper |
Common-Face Embeddings of Planar Graphs
SIAM Journal on Computing | 2003-06-19 | Paper |
Approximation algorithms for NMR spectral peak assignment.
Theoretical Computer Science | 2003-05-25 | Paper |
The longest common subsequence problem for sequences with nested arc annotations.
Journal of Computer and System Sciences | 2003-05-14 | Paper |
Tight upper bound on the number of edges in a bipartite \(K_{3,3}\)-free or \(K_{5}\)-free graph with an application.
Information Processing Letters | 2003-01-21 | Paper |
Approximating unweighted connectivity problems in parallel
Information and Computation | 2003-01-14 | Paper |
| scientific article; zbMATH DE number 1759463 (Why is no real title available?) | 2002-11-25 | Paper |
| scientific article; zbMATH DE number 1830750 (Why is no real title available?) | 2002-11-18 | Paper |
Finding Double Euler Trails of Planar Graphs in Linear Time
SIAM Journal on Computing | 2002-09-29 | Paper |
| scientific article; zbMATH DE number 1775439 (Why is no real title available?) | 2002-08-01 | Paper |
Approximation algorithms for independent sets in map graphs
Journal of Algorithms | 2002-08-01 | Paper |
| scientific article; zbMATH DE number 1696627 (Why is no real title available?) | 2002-07-14 | Paper |
| scientific article; zbMATH DE number 1696628 (Why is no real title available?) | 2002-07-01 | Paper |
| scientific article; zbMATH DE number 1754611 (Why is no real title available?) | 2002-06-12 | Paper |
| scientific article; zbMATH DE number 1104333 (Why is no real title available?) | 2001-12-04 | Paper |
| scientific article; zbMATH DE number 1559535 (Why is no real title available?) | 2001-02-28 | Paper |
| scientific article; zbMATH DE number 1511678 (Why is no real title available?) | 2000-09-27 | Paper |
| scientific article; zbMATH DE number 1511710 (Why is no real title available?) | 2000-09-27 | Paper |
Reducing Randomness via Irrational Numbers
SIAM Journal on Computing | 2000-03-19 | Paper |
| scientific article; zbMATH DE number 1398073 (Why is no real title available?) | 2000-02-03 | Paper |
| scientific article; zbMATH DE number 1398091 (Why is no real title available?) | 2000-02-03 | Paper |
| scientific article; zbMATH DE number 1395315 (Why is no real title available?) | 2000-01-30 | Paper |
| scientific article; zbMATH DE number 1380812 (Why is no real title available?) | 1999-12-20 | Paper |
| scientific article; zbMATH DE number 1379134 (Why is no real title available?) | 1999-12-15 | Paper |
| scientific article; zbMATH DE number 1322315 (Why is no real title available?) | 1999-11-08 | Paper |
| scientific article; zbMATH DE number 1322337 (Why is no real title available?) | 1999-11-08 | Paper |
An Algorithm for Shortest Paths in Bipartite Digraphs with Concave Weight Matrices and its Applications
SIAM Journal on Computing | 1999-10-28 | Paper |
| scientific article; zbMATH DE number 1305408 (Why is no real title available?) | 1999-09-15 | Paper |
Fast RNC and NC algorithms for maximal path sets
Theoretical Computer Science | 1999-04-28 | Paper |
Parallel algorithms for maximal acyclic sets
Algorithmica | 1998-08-10 | Paper |
Efficient Approximation Schemes for Maximization Problems onK3,3-free orK5-free Graphs
Journal of Algorithms | 1998-07-19 | Paper |
Parallel constructions of maximal path sets and applications to short superstrings
Theoretical Computer Science | 1997-09-18 | Paper |
The maximal \(f\)-dependent set problem for planar graphs is in NC
Theoretical Computer Science | 1997-02-28 | Paper |
A fast and efficient NC algorithm for maximal matching
Information Processing Letters | 1997-02-27 | Paper |
Parallel complexity of partitioning a planar graph into vertex-induced forests
Discrete Applied Mathematics | 1997-02-03 | Paper |
A parallel algorithm for finding a triconnected component separator with an application
Information Processing Letters | 1996-09-29 | Paper |
The complexity of selecting maximal solutions
Information and Computation | 1995-08-02 | Paper |
Direct injective modules
Acta Mathematica Sinica, English Series | 1994-08-25 | Paper |
A fast and efficient parallel algorithm for finding a satisfying truth assignment to a 2-CNF formula
Information Processing Letters | 1993-01-17 | Paper |
A simple parallel algorithm for computing the diameters of all vertices in a tree and its application
Information Processing Letters | 1993-01-16 | Paper |
ON THE COMPLEXITY OF COMPUTING OPTIMAL SOLUTIONS
International Journal of Foundations of Computer Science | 1992-09-27 | Paper |
| scientific article; zbMATH DE number 38104 (Why is no real title available?) | 1992-06-28 | Paper |
A randomized NC algorithm for the maximal tree cover problem
Information Processing Letters | 1992-06-28 | Paper |
| scientific article; zbMATH DE number 4063336 (Why is no real title available?) | 1987-01-01 | Paper |
