| Publication | Date of Publication | Type |
|---|
Parameterized Complexity for Finding a Perfect Phylogeny from Mixed Tumor Samples
SIAM Journal on Discrete Mathematics | 2023-09-27 | Paper |
A new dynamic programming algorithm for the simplified partial digest problem
Theoretical Computer Science | 2023-04-12 | Paper |
Efficient algorithms for the minmax regret path center problem with length constraint on trees
Theoretical Computer Science | 2022-05-10 | Paper |
An improved algorithm for the minmax regret path center problem on trees
Journal of Computer and System Sciences | 2020-09-07 | Paper |
On the minmax regret path center problem on trees
| 2020-07-07 | Paper |
Improved algorithms for the minmax-regret 1-center and 1-median problems
ACM Transactions on Algorithms | 2018-11-05 | Paper |
An improved algorithm for the minmax regret path centdian problem on trees
Journal of Computer and System Sciences | 2018-09-07 | Paper |
Comments on: ``Extensive facility location problems on networks: an updated review
Top | 2018-08-28 | Paper |
Efficient algorithms for the round-trip 1-center and 1-median problems
Journal of Computer and System Sciences | 2016-04-18 | Paper |
On the minmax regret path median problem on trees
Journal of Computer and System Sciences | 2015-07-13 | Paper |
A linear-time algorithm for the minimum degree hypergraph problem with the consecutive ones property
Lecture Notes in Computer Science | 2013-06-11 | Paper |
Efficient algorithms for the conditional covering problem
Information and Computation | 2012-11-27 | Paper |
On the minimum degree hypergraph problem with subset size two and the red-blue set cover problem with the consecutive ones property
Lecture Notes in Computer Science | 2012-09-25 | Paper |
On the round-trip 1-center and 1-median problems
WALCOM: Algorithms and Computation | 2012-06-08 | Paper |
Faster query algorithms for the text fingerprinting problem
Information and Computation | 2011-07-18 | Paper |
Improved data structures for the orthogonal range successor problem
Computational Geometry | 2011-01-21 | Paper |
Efficient indexes for the positional pattern matching problem and two related problems over small alphabets
Algorithms and Computation | 2010-12-09 | Paper |
Improved algorithms for finding length-bounded two vertex-disjoint paths in a planar graph and minmax \(k\) vertex-disjoint paths in a directed acyclic graph
Journal of Computer and System Sciences | 2010-10-07 | Paper |
Improved algorithms for the continuous tree edge-partition problems and a note on ratio and sorted matrices searches
Discrete Applied Mathematics | 2010-05-25 | Paper |
On Chen and Chen's new tree inclusion algorithm
Information Processing Letters | 2010-03-24 | Paper |
Efficient algorithms for the ring loading problem with demand splitting
Lecture Notes in Computer Science | 2010-03-03 | Paper |
Efficient algorithms for the problems of enumerating cuts by non-decreasing weights
Algorithmica | 2010-02-23 | Paper |
Efficient algorithms for the inverse sorting problem with bound constraints under the \(l_{\infty }\)-norm and the Hamming distance
Journal of Computer and System Sciences | 2009-11-10 | Paper |
Efficient Data Structures for the Orthogonal Range Successor Problem
Lecture Notes in Computer Science | 2009-07-23 | Paper |
Improved Algorithms for the Gene Team Problem
Combinatorial Optimization and Applications | 2009-07-07 | Paper |
Efficient algorithms for two generalized 2-median problems and the group median problem on trees
Theoretical Computer Science | 2009-03-17 | Paper |
A Faster Query Algorithm for the Text Fingerprinting Problem
Algorithms – ESA 2007 | 2008-09-25 | Paper |
Finding the conditional location of a median path on a tree
Information and Computation | 2008-08-14 | Paper |
Efficient Algorithms for the k Smallest Cuts Enumeration
Lecture Notes in Computer Science | 2008-07-10 | Paper |
Improved Algorithms for the Minmax-Regret 1-Center Problem
Algorithms and Computation | 2008-04-24 | Paper |
Improved Algorithms for the Minmax Regret 1-Median Problem
Lecture Notes in Computer Science | 2007-09-10 | Paper |
Efficient algorithms for a constrained k-tree core problem in a tree network
Journal of Algorithms | 2006-06-30 | Paper |
Linear time algorithms for the ring loading problem with demand splitting
Journal of Algorithms | 2005-02-22 | Paper |
Efficient algorithms for the scaled indexing problem
Journal of Algorithms | 2004-11-23 | Paper |
scientific article; zbMATH DE number 2090005 (Why is no real title available?)
| 2004-08-12 | Paper |
scientific article; zbMATH DE number 2081038 (Why is no real title available?)
| 2004-08-04 | Paper |
scientific article; zbMATH DE number 2080269 (Why is no real title available?)
| 2004-08-04 | Paper |
An optimal simple parallel algorithm for testing isomorphism of maximal outerplanar graphs
Journal of Parallel and Distributed Computing | 2002-07-04 | Paper |
Finding a 2-core of a tree in linear time
SIAM Journal on Discrete Mathematics | 2002-04-23 | Paper |
Tight bounds on the solutions of multidimensional divide-and-conquer maximin recurrences
Theoretical Computer Science | 2000-08-21 | Paper |
Efficient Parallel Algorithms for Optimally Locating a Path and a Tree of a Specified Length in a Weighted Tree Network
Journal of Algorithms | 2000-03-16 | Paper |
The lowest common ancestor problem on a tree with an unfixed root
Information Sciences | 2000-01-30 | Paper |
EFFICIENT EMULATIONS FOR X-TREES AND /w-ARY TREES*
Parallel Algorithms and Applications | 1999-06-22 | Paper |
Simulating the CRCW PRAM on reconfigurable networks
Theoretical Computer Science | 1999-01-12 | Paper |
Tighter Bounds on the Solution of a Divide-and-Conquer Maximin Recurrence
Journal of Algorithms | 1997-06-04 | Paper |
Cost-optimal parallel algorithms for constructing B-trees
Information Sciences | 1995-08-10 | Paper |
Deriving algorithms on reconfigurable networks based on function decomposition
Theoretical Computer Science | 1994-11-29 | Paper |
Sorting and computing convex hulls on processor arrays with reconfigurable bus systems
Information Sciences | 1994-01-13 | Paper |
On the Set LCS and Set-Set LCS Problems
Journal of Algorithms | 1993-06-29 | Paper |
A simple approach to implementing multiplication with small tables
Information Processing Letters | 1991-01-01 | Paper |
Two dimensional processor array with a reconfigurable bus system is at least as powerful as CRCW model
Information Processing Letters | 1990-01-01 | Paper |
Constant time sorting on a processor array with a reconfigurable bus system
Information Processing Letters | 1990-01-01 | Paper |
