| Publication | Date of Publication | Type |
|---|
| An approximation algorithm for covering vertices by \(4^+\)-paths | 2024-09-16 | Paper |
| Cabbage can't always be transformed into turnip: decision algorithms for sorting by symmetric reversals | 2024-08-22 | Paper |
| Algorithms and hardness for the longest common subsequence of three strings and related problems | 2024-05-29 | Paper |
Edge searching and fast searching with constraints
Theoretical Computer Science | 2024-03-01 | Paper |
| Constrained graph searching on trees | 2024-02-28 | Paper |
Fast searching on cactus graphs
Journal of Combinatorial Optimization | 2023-04-17 | Paper |
| Better practical algorithms for rSPR distance and hybridization number | 2022-07-27 | Paper |
A randomized approximation algorithm for metric triangle packing
Journal of Combinatorial Optimization | 2021-05-11 | Paper |
A \(\frac{4}{3}\)-approximation algorithm for the maximum internal spanning tree problem
Journal of Computer and System Sciences | 2021-03-10 | Paper |
The one-cop-moves game on graphs with some special structures
Theoretical Computer Science | 2020-11-06 | Paper |
A randomized approximation algorithm for metric triangle packing
Combinatorial Optimization and Applications | 2020-05-13 | Paper |
| The one-cop-moves game on graphs of small treewidth | 2020-05-13 | Paper |
Approximation algorithms for the maximum weight internal spanning tree problem
Algorithmica | 2019-10-17 | Paper |
Positive semidefinite zero forcing numbers of two classes of graphs
Theoretical Computer Science | 2019-08-20 | 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 |
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 |
A polynomial time approximation scheme for the closest shared center problem
Algorithmica | 2017-03-06 | Paper |
Finding similar regions in many strings
Proceedings of the thirty-first annual ACM symposium on Theory of Computing | 2016-09-29 | Paper |
An improved approximation algorithm for rSPR distance
Lecture Notes in Computer Science | 2016-09-02 | Paper |
Aligning sequences via an evolutionary tree: complexity and approximation
Proceedings of the twenty-sixth annual ACM symposium on Theory of computing - STOC '94 | 2016-09-01 | Paper |
Parameterized and approximation algorithms for finding two disjoint matchings
Theoretical Computer Science | 2016-06-27 | Paper |
Randomized fixed-parameter algorithms for the closest string problem
Algorithmica | 2016-03-23 | Paper |
A factor-\((1.408+\varepsilon)\) approximation for sorting unsigned genomes by reciprocal translocations
Theoretical Computer Science | 2015-12-08 | Paper |
On the closest string and substring problems
Journal of the ACM | 2015-10-30 | Paper |
Faster exact computation of rSPR distance
Journal of Combinatorial Optimization | 2015-05-11 | Paper |
Near optimal multiple alignment within a band in polynomial time
Proceedings of the thirty-second annual ACM symposium on Theory of computing | 2014-09-26 | Paper |
Discovering almost any hidden motif from multiple sequences
ACM Transactions on Algorithms | 2014-09-09 | Paper |
A \((1.408+\varepsilon )\)-approximation algorithm for sorting unsigned genomes by reciprocal translocations
Frontiers in Algorithmics | 2014-09-02 | Paper |
Randomized and Parameterized Algorithms for the Closest String Problem
Combinatorial Pattern Matching | 2014-06-30 | Paper |
| scientific article; zbMATH DE number 6289240 (Why is no real title available?) | 2014-04-25 | 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 |
On a relation between Randić index and algebraic connectivity
MATCH - Communications in Mathematical and in Computer Chemistry | 2013-10-30 | Paper |
Constant time approximation scheme for largest well predicted subset
Journal of Combinatorial Optimization | 2013-06-28 | Paper |
Near optimal solutions for maximum quasi-bicliques
Journal of Combinatorial Optimization | 2013-06-28 | Paper |
| Complete solution for unicyclic graphs with minimum general Randić index | 2013-06-25 | Paper |
A Polynomial Time Approximation Scheme for the Closest Shared Center Problem
Lecture Notes in Computer Science | 2013-06-11 | Paper |
A polynomial time approximation scheme for embedding a directed hypergraph on a weighted ring
Journal of Combinatorial Optimization | 2013-01-03 | Paper |
| scientific article; zbMATH DE number 6113922 (Why is no real title available?) | 2012-12-07 | Paper |
An improved approximation algorithm for the bandpass-2 problem
Combinatorial Optimization and Applications | 2012-11-02 | Paper |
An improved approximation algorithm for the complementary maximal strip recovery problem
Journal of Computer and System Sciences | 2012-08-17 | Paper |
The parameterized complexity of the shared center problem
Combinatorial Pattern Matching | 2012-08-14 | Paper |
Exact and approximation algorithms for the complementary maximal strip recovery problem
Journal of Combinatorial Optimization | 2012-07-17 | Paper |
A three-string approach to the closest string problem
Journal of Computer and System Sciences | 2012-05-11 | Paper |
On the ordering of benzenoid chains and cyclo-polyphenacenes with respect to their numbers of clar aromatic sextets
Journal of Mathematical Chemistry | 2011-07-21 | Paper |
An approximation algorithm for the minimum co-path set problem
Algorithmica | 2011-07-01 | Paper |
An improved approximation algorithm for the complementary maximal strip recovery problem
Frontiers in Algorithmics and Algorithmic Aspects in Information and Management | 2011-06-03 | Paper |
On constrained minimum pseudotriangulations
Lecture Notes in Computer Science | 2011-03-18 | Paper |
Probabilistic analysis of a motif discovery algorithm for multiple sequences
SIAM Journal on Discrete Mathematics | 2010-12-03 | Paper |
Erratum to: ``An improved randomized approximation algorithm for maximum triangle packing
Discrete Applied Mathematics | 2010-10-11 | Paper |
Beyond evolutionary trees
Natural Computing | 2010-09-16 | Paper |
Near optimal solutions for maximum quasi-bicliques
Lecture Notes in Computer Science | 2010-07-20 | Paper |
Constant time approximation scheme for largest well predicted subset
Lecture Notes in Computer Science | 2010-07-20 | Paper |
Randomized approaches for nearest neighbor search in metric space when computing the pairwise distance is extremely expensive
Algorithmic Aspects in Information and Management | 2010-07-20 | Paper |
A linear kernel for co-path/cycle packing
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 |
A polynomial time approximation scheme for embedding a directed hypergraph on a ring
Information Processing Letters | 2009-12-18 | Paper |
Improved deterministic approximation algorithms for max TSP
Information Processing Letters | 2009-12-04 | Paper |
Approximation algorithms for reconstructing the duplication history of tandem repeats
Algorithmica | 2009-11-25 | Paper |
Approximation Algorithms for Biclustering Problems
SIAM Journal on Computing | 2009-08-20 | Paper |
Efficient Algorithms for the Closest String and Distinguishing String Selection Problems
Frontiers in Algorithmics | 2009-07-14 | Paper |
On bipartite graphs with minimal energy
Discrete Applied Mathematics | 2009-06-30 | Paper |
An improved randomized approximation algorithm for maximum triangle packing
Discrete Applied Mathematics | 2009-06-30 | Paper |
On the Tractability of Maximal Strip Recovery
Lecture Notes in Computer Science | 2009-06-03 | Paper |
Discovering Almost Any Hidden Motif from Multiple Sequences in Polynomial Time with Low Sample Complexity and High Success Probability
Lecture Notes in Computer Science | 2009-06-03 | 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 |
An Improved Randomized Approximation Algorithm for Maximum Triangle Packing
Algorithmic Aspects in Information and Management | 2008-07-10 | Paper |
Quasi-bicliques: Complexity and Binding Pairs
Lecture Notes in Computer Science | 2008-07-10 | Paper |
Space efficient algorithms for ordered tree comparison
Algorithmica | 2008-07-01 | Paper |
Finding Additive Biclusters with Random Background
Combinatorial Pattern Matching | 2008-06-17 | Paper |
Identification of Distinguishing Motifs
Combinatorial Pattern Matching | 2008-06-17 | Paper |
On partitioning simple bipartite graphs in vertex-disjoint paths
Southeast Asian Bulletin of Mathematics | 2008-06-03 | Paper |
Efficient Algorithms for Model-Based Motif Discovery from Multiple Sequences
Lecture Notes in Computer Science | 2008-05-27 | Paper |
On packing and coloring hyperedges in a cycle
Discrete Applied Mathematics | 2007-09-21 | Paper |
Some approximation algorithms for the clique partition problem in weighted interval graphs
Theoretical Computer Science | 2007-09-03 | Paper |
A 1.75-approximation algorithm for unsigned translocation distance
Journal of Computer and System Sciences | 2007-08-27 | Paper |
Near optimal multiple alignment within a band in polynomial time
Journal of Computer and System Sciences | 2007-08-23 | Paper |
Algorithms and Computation
Lecture Notes in Computer Science | 2006-11-14 | Paper |
Algorithms and Computation
Lecture Notes in Computer Science | 2006-11-14 | Paper |
Optimal relay location for resource-limited energy-efficient wireless communication
Journal of Global Optimization | 2006-10-31 | Paper |
| Maximum tree and maximum value for the Randić index \(R_{-1}\) of trees of order \(n\leq 102\) | 2006-06-06 | Paper |
On the complexity of unsigned translocation distance
Theoretical Computer Science | 2006-03-24 | Paper |
Maximizing profits of routing in WDM networks
Journal of Combinatorial Optimization | 2006-02-08 | Paper |
Algorithms and Computation
Lecture Notes in Computer Science | 2005-12-22 | Paper |
An improved randomized approximation algorithm for Max TSP
Journal of Combinatorial Optimization | 2005-12-14 | Paper |
Algorithmic Applications in Management
Lecture Notes in Computer Science | 2005-11-30 | Paper |
Decomposing toroidal graphs into circuits and edges
Discrete Applied Mathematics | 2005-08-17 | Paper |
| scientific article; zbMATH DE number 2185648 (Why is no real title available?) | 2005-07-04 | Paper |
Exact matching of RNA secondary structure patterns
Theoretical Computer Science | 2005-06-10 | Paper |
On the complexity of finding emerging patterns
Theoretical Computer Science | 2005-06-10 | Paper |
On \(k\)-coloring of weighted circular-arc graphs
Southeast Asian Bulletin of Mathematics | 2005-03-14 | Paper |
Removable edges in a cycle of a 4-connected graph
Discrete Mathematics | 2004-11-18 | Paper |
Minimum \(k\) arborescences with bandwidth constraints
Algorithmica | 2004-09-22 | Paper |
| scientific article; zbMATH DE number 2086667 (Why is no real title available?) | 2004-08-11 | Paper |
\(k\)-resonance of open-ended carbon nanotubes
Journal of Mathematical Chemistry | 2004-06-11 | Paper |
Solutions for Two Conjectures on the Inverse Problem of the Wiener Index of Peptoids
SIAM Journal on Discrete Mathematics | 2004-01-08 | Paper |
Genetic Design of Drugs Without Side-Effects
SIAM Journal on Computing | 2003-09-28 | Paper |
A complete solution to a conjecture on the \({\beta}\)-polynomials of graphs
Journal of Mathematical Chemistry | 2003-08-25 | Paper |
Approximate sequencing for variable length tasks.
Theoretical Computer Science | 2003-08-17 | Paper |
| scientific article; zbMATH DE number 1945157 (Why is no real title available?) | 2003-07-02 | Paper |
Center and distinguisher for strings with unbounded alphabet
Journal of Combinatorial Optimization | 2003-06-09 | Paper |
Finding similar regions in many sequences
Journal of Computer and System Sciences | 2003-05-04 | Paper |
| scientific article; zbMATH DE number 1796993 (Why is no real title available?) | 2002-09-05 | Paper |
Computing similarity between RNA structures
Theoretical Computer Science | 2002-07-15 | Paper |
An approximation algorithm for a bottleneck \(k\)-Steiner tree problem in the Euclidean plane
Information Processing Letters | 2002-07-14 | Paper |
Approximations for a bottleneck Steiner tree problem
Algorithmica | 2002-05-21 | Paper |
Approximations for Steiner trees with minimum number of Steiner points
Theoretical Computer Science | 2002-03-03 | Paper |
Approximations for Steiner trees with minimum number of Steiner points
Journal of Global Optimization | 2001-03-20 | Paper |
| scientific article; zbMATH DE number 1555959 (Why is no real title available?) | 2001-01-24 | Paper |
| scientific article; zbMATH DE number 1424545 (Why is no real title available?) | 2000-11-06 | Paper |
Fixed topology alignment with recombination
Discrete Applied Mathematics | 2000-11-06 | Paper |
A More Efficient Approximation Scheme for Tree Alignment
SIAM Journal on Computing | 2000-10-18 | Paper |
On the inapproximability of disjoint paths and minimum Steiner forest with bandwidth constraints
Journal of Computer and System Sciences | 2000-05-08 | Paper |
| scientific article; zbMATH DE number 1302179 (Why is no real title available?) | 2000-04-17 | Paper |
| scientific article; zbMATH DE number 1301590 (Why is no real title available?) | 2000-02-20 | Paper |
Fitting distances by tree metrics with increment error
Journal of Combinatorial Optimization | 1999-10-04 | Paper |
Fixed topology Steiner trees and spanning forests
Theoretical Computer Science | 1999-04-28 | Paper |
Graph traversals, genes and matroids: An efficient case of the travelling salesman problem
Discrete Applied Mathematics | 1999-03-22 | Paper |
Improved Approximation Algorithms for Tree Alignment
Journal of Algorithms | 1998-09-08 | Paper |
On the complexity of comparing evolutionary trees
Discrete Applied Mathematics | 1997-11-25 | Paper |
| An approximation scheme for some Steiner tree problems in the plane | 1997-07-15 | Paper |
Approximation algorithms for tree alignment with a given phylogeny
Algorithmica | 1997-05-25 | Paper |
On the completeness of incidence calculus
Journal of Automated Reasoning | 1997-04-13 | Paper |
Alignment of trees -- an alternative to tree edit
Theoretical Computer Science | 1997-02-28 | Paper |
A NON-NUMERIC APPROACH TO UNCERTAIN REASONING
International Journal of General Systems | 1996-02-26 | Paper |
| scientific article; zbMATH DE number 5172 (Why is no real title available?) | 1992-06-25 | Paper |
