Publication | Date of Publication | Type |
---|
Parameterized Complexity for Finding a Perfect Phylogeny from Mixed Tumor Samples | 2023-09-27 | Paper |
A new dynamic programming algorithm for the simplified partial digest problem | 2023-04-12 | Paper |
Efficient algorithms for the minmax regret path center problem with length constraint on trees | 2022-05-10 | Paper |
An improved algorithm for the minmax regret path center problem on trees | 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 | 2018-11-05 | Paper |
An improved algorithm for the minmax regret path centdian problem on trees | 2018-09-07 | Paper |
Comments on: ``Extensive facility location problems on networks: an updated review | 2018-08-28 | Paper |
Efficient algorithms for the round-trip 1-center and 1-median problems | 2016-04-18 | Paper |
On the minmax regret path median problem on trees | 2015-07-13 | Paper |
A Linear-Time Algorithm for the Minimum Degree Hypergraph Problem with the Consecutive Ones Property | 2013-06-11 | Paper |
Efficient algorithms for the conditional covering problem | 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 | 2012-09-25 | Paper |
On the Round-Trip 1-Center and 1-Median Problems | 2012-06-08 | Paper |
Faster query algorithms for the text fingerprinting problem | 2011-07-18 | Paper |
Improved data structures for the orthogonal range successor problem | 2011-01-21 | Paper |
Efficient Indexes for the Positional Pattern Matching Problem and Two Related Problems over Small Alphabets | 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 | 2010-10-07 | Paper |
Improved algorithms for the continuous tree edge-partition problems and a note on ratio and sorted matrices searches | 2010-05-25 | Paper |
On Chen and Chen's new tree inclusion algorithm | 2010-03-24 | Paper |
Algorithms - ESA 2003 | 2010-03-03 | Paper |
Efficient algorithms for the problems of enumerating cuts by non-decreasing weights | 2010-02-23 | Paper |
Efficient algorithms for the inverse sorting problem with bound constraints under the \(l_{\infty }\)-norm and the Hamming distance | 2009-11-10 | Paper |
Efficient Data Structures for the Orthogonal Range Successor Problem | 2009-07-23 | Paper |
Improved Algorithms for the Gene Team Problem | 2009-07-07 | Paper |
Efficient algorithms for two generalized 2-median problems and the group median problem on trees | 2009-03-17 | Paper |
A Faster Query Algorithm for the Text Fingerprinting Problem | 2008-09-25 | Paper |
Finding the conditional location of a median path on a tree | 2008-08-14 | Paper |
Efficient Algorithms for the k Smallest Cuts Enumeration | 2008-07-10 | Paper |
Improved Algorithms for the Minmax-Regret 1-Center Problem | 2008-04-24 | Paper |
Improved Algorithms for the Minmax Regret 1-Median Problem | 2007-09-10 | Paper |
Efficient algorithms for a constrained k-tree core problem in a tree network | 2006-06-30 | Paper |
Linear time algorithms for the ring loading problem with demand splitting | 2005-02-22 | Paper |
Efficient algorithms for the scaled indexing problem | 2004-11-23 | Paper |
https://portal.mardi4nfdi.de/entity/Q4808671 | 2004-08-12 | Paper |
https://portal.mardi4nfdi.de/entity/Q4472520 | 2004-08-04 | Paper |
https://portal.mardi4nfdi.de/entity/Q4474142 | 2004-08-04 | Paper |
An optimal simple parallel algorithm for testing isomorphism of maximal outerplanar graphs | 2002-07-04 | Paper |
Finding a 2-Core of a Tree in Linear Time | 2002-04-23 | Paper |
Tight bounds on the solutions of multidimensional divide-and-conquer maximin recurrences | 2000-08-21 | Paper |
Efficient Parallel Algorithms for Optimally Locating a Path and a Tree of a Specified Length in a Weighted Tree Network | 2000-03-16 | Paper |
The lowest common ancestor problem on a tree with an unfixed root | 2000-01-30 | Paper |
EFFICIENT EMULATIONS FOR X-TREES AND /w-ARY TREES* | 1999-06-22 | Paper |
Simulating the CRCW PRAM on reconfigurable networks | 1999-01-12 | Paper |
Tighter Bounds on the Solution of a Divide-and-Conquer Maximin Recurrence | 1997-06-04 | Paper |
Cost-optimal parallel algorithms for constructing B-trees | 1995-08-10 | Paper |
Deriving algorithms on reconfigurable networks based on function decomposition | 1994-11-29 | Paper |
Sorting and computing convex hulls on processor arrays with reconfigurable bus systems | 1994-01-13 | Paper |
On the Set LCS and Set-Set LCS Problems | 1993-06-29 | Paper |
A simple approach to implementing multiplication with small tables | 1991-01-01 | Paper |
Constant time sorting on a processor array with a reconfigurable bus system | 1990-01-01 | Paper |
Two dimensional processor array with a reconfigurable bus system is at least as powerful as CRCW model | 1990-01-01 | Paper |