| Publication | Date of Publication | Type |
|---|
| Approximating the directed path partition problem | 2024-03-27 | Paper |
| NC algorithms for partitioning planar graphs into induced forests and approximating NP-hard problems | 2024-02-28 | Paper |
| Fast RNC and NC algorithms for finding a maximal set of paths with an application | 2024-01-29 | Paper |
| The maximal f-dependent set problem for planar graphs is in NC | 2024-01-05 | Paper |
| Approximation algorithms for the directed path partition problems | 2023-08-10 | Paper |
| Approximation algorithms for the maximally balanced connected graph tripartition problem | 2022-10-04 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5091731 | 2022-07-27 | Paper |
| Approximation algorithms for maximally balanced connected graph partition | 2022-01-18 | Paper |
| A randomized approximation algorithm for metric triangle packing | 2021-05-11 | Paper |
| Improved approximation algorithms for path vertex covers in regular graphs | 2020-10-12 | Paper |
| A randomized approximation algorithm for metric triangle packing | 2020-05-13 | Paper |
| Approximation algorithms for maximally balanced connected graph partition | 2020-05-13 | Paper |
| Approximation algorithms for the maximum weight internal spanning tree problem | 2019-10-17 | Paper |
| Designing and implementing algorithms for the closest string problem | 2019-08-20 | Paper |
| Better Approximation Algorithms for Scaffolding Problems | 2019-04-26 | Paper |
| Designing and Implementing Algorithms for the Closest String Problem | 2019-04-26 | Paper |
| NC algorithms for finding a maximal set of paths with application to compressing strings | 2019-01-10 | Paper |
| Approximation algorithms for the scaffolding problem and its generalizations | 2018-06-05 | Paper |
| An approximation algorithm for maximum internal spanning tree | 2018-04-13 | Paper |
| Approximation algorithms for the maximum weight internal spanning tree problem | 2017-10-23 | Paper |
| An approximation algorithm for maximum internal spanning tree | 2017-05-05 | Paper |
| The parameterized complexity of the shared center problem | 2017-03-27 | Paper |
| An Improved Approximation Algorithm for rSPR Distance | 2016-09-02 | Paper |
| Parameterized and approximation algorithms for finding two disjoint matchings | 2016-06-27 | Paper |
| Parallel approximation algorithms for maximum weighted matching in general graphs | 2016-06-16 | Paper |
| Randomized fixed-parameter algorithms for the closest string problem | 2016-03-23 | Paper |
| Map graphs | 2015-10-30 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5501800 | 2015-08-14 | Paper |
| Faster exact computation of rSPR distance | 2015-05-11 | Paper |
| Randomized and Parameterized Algorithms for the Closest String Problem | 2014-06-30 | Paper |
| Faster Exact Computation of rSPR Distance | 2014-04-03 | Paper |
| Parameterized and Approximation Algorithms for Finding Two Disjoint Matchings | 2013-12-10 | Paper |
| An Improved Approximation Algorithm for the Bandpass-2 Problem | 2012-11-02 | Paper |
| The Parameterized Complexity of the Shared Center Problem | 2012-08-14 | Paper |
| A three-string approach to the closest string problem | 2012-05-11 | Paper |
| An approximation algorithm for the minimum co-path set problem | 2011-07-01 | Paper |
| A Space Efficient Algorithm for Sequence Alignment with Inversions | 2011-03-18 | Paper |
| Approximating maximum edge 2-coloring in simple graphs | 2010-11-25 | Paper |
| Erratum to: ``An improved randomized approximation algorithm for maximum triangle packing | 2010-10-11 | Paper |
| A Three-String Approach to the Closest String Problem | 2010-07-20 | Paper |
| Approximating Maximum Edge 2-Coloring in Simple Graphs | 2010-07-20 | Paper |
| A Linear Kernel for Co-Path/Cycle Packing | 2010-07-20 | Paper |
| Algorithms - ESA 2003 | 2010-03-03 | Paper |
| Improved deterministic approximation algorithms for max TSP | 2009-12-04 | Paper |
| A 3.4713-approximation algorithm for the capacitated multicast tree routing problem | 2009-11-25 | Paper |
| Approximation algorithms for reconstructing the duplication history of tandem repeats | 2009-11-25 | Paper |
| Approximating maximum edge 2-coloring in simple graphs via local improvement | 2009-11-04 | Paper |
| An improved randomized approximation algorithm for maximum triangle packing | 2009-06-30 | Paper |
| Approximation Algorithms for Reconstructing the Duplication History of Tandem Repeats | 2009-03-06 | Paper |
| An Improved Approximation Algorithm for the Capacitated Multicast Tree Routing Problem | 2009-01-27 | Paper |
| An improved approximation algorithm for maximum edge 2-coloring in simple graphs | 2008-08-08 | Paper |
| Optimizing deletion cost for secure multicast key management | 2008-07-31 | Paper |
| Approximating Maximum Edge 2-Coloring in Simple Graphs Via Local Improvement | 2008-07-10 | Paper |
| An Improved Randomized Approximation Algorithm for Maximum Triangle Packing | 2008-07-10 | Paper |
| Approximation algorithms for bounded degree phylogenetic roots | 2008-05-27 | Paper |
| Improved approximation algorithms for metric MaxTSP | 2008-01-22 | Paper |
| An Improved Approximation Algorithm for Maximum Edge 2-Coloring in Simple Graphs | 2008-01-04 | Paper |
| Mathematical Foundations of Computer Science 2003 | 2007-12-07 | Paper |
| New bounds on the edge number of ak-map graph | 2007-08-09 | Paper |
| Computing phylogenetic roots with bounded degrees and errors is NP-complete | 2007-01-09 | Paper |
| Recognizing hole-free 4-map graphs in cubic time | 2006-08-11 | Paper |
| Computing bounded-degree phylogenetic roots of disconnected graphs | 2006-06-30 | Paper |
| Algorithms – ESA 2005 | 2006-06-27 | Paper |
| A linear-time algorithm for 7-coloring 1-plane graphs | 2006-03-21 | Paper |
| An improved randomized approximation algorithm for Max TSP | 2005-12-14 | Paper |
| Graph-Theoretic Concepts in Computer Science | 2005-12-08 | Paper |
| Computing and Combinatorics | 2005-06-15 | Paper |
| Computing and Combinatorics | 2005-06-15 | Paper |
| A space-efficient algorithm for sequence alignment with inversions and reversals | 2004-10-27 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4818840 | 2004-09-24 | Paper |
| Disk embeddings of planar graphs | 2004-09-22 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4408109 | 2003-07-02 | Paper |
| Common-Face Embeddings of Planar Graphs | 2003-06-19 | Paper |
| Computing Phylogenetic Roots with Bounded Degrees and Errors | 2003-06-19 | Paper |
| Approximation algorithms for NMR spectral peak assignment. | 2003-05-25 | Paper |
| The longest common subsequence problem for sequences with nested arc annotations. | 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. | 2003-01-21 | Paper |
| Approximating unweighted connectivity problems in parallel | 2003-01-14 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4536416 | 2002-11-25 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4778572 | 2002-11-18 | Paper |
| Finding Double Euler Trails of Planar Graphs in Linear Time | 2002-09-29 | Paper |
| Approximation Algorithms for Independent Sets in Map Graphs | 2002-08-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4542571 | 2002-08-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2766819 | 2002-07-14 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2766820 | 2002-07-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4535038 | 2002-06-12 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4370206 | 2001-12-04 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4526983 | 2001-02-28 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4505358 | 2000-09-27 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4505398 | 2000-09-27 | Paper |
| Reducing Randomness via Irrational Numbers | 2000-03-19 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4937194 | 2000-02-03 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4937212 | 2000-02-03 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4935141 | 2000-01-30 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4705513 | 1999-12-20 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4703476 | 1999-12-15 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4253327 | 1999-11-08 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4253358 | 1999-11-08 | Paper |
| An Algorithm for Shortest Paths in Bipartite Digraphs with Concave Weight Matrices and its Applications | 1999-10-28 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4252289 | 1999-09-15 | Paper |
| Fast RNC and NC algorithms for maximal path sets | 1999-04-28 | Paper |
| Parallel algorithms for maximal acyclic sets | 1998-08-10 | Paper |
| Efficient Approximation Schemes for Maximization Problems onK3,3-free orK5-free Graphs | 1998-07-19 | Paper |
| Parallel constructions of maximal path sets and applications to short superstrings | 1997-09-18 | Paper |
| The maximal \(f\)-dependent set problem for planar graphs is in NC | 1997-02-28 | Paper |
| A fast and efficient NC algorithm for maximal matching | 1997-02-27 | Paper |
| Parallel complexity of partitioning a planar graph into vertex-induced forests | 1997-02-03 | Paper |
| A parallel algorithm for finding a triconnected component separator with an application | 1996-09-29 | Paper |
| The complexity of selecting maximal solutions | 1995-08-02 | Paper |
| Direct injective modules | 1994-08-25 | Paper |
| A fast and efficient parallel algorithm for finding a satisfying truth assignment to a 2-CNF formula | 1993-01-17 | Paper |
| A simple parallel algorithm for computing the diameters of all vertices in a tree and its application | 1993-01-16 | Paper |
| ON THE COMPLEXITY OF COMPUTING OPTIMAL SOLUTIONS | 1992-09-27 | Paper |
| A randomized NC algorithm for the maximal tree cover problem | 1992-06-28 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3990419 | 1992-06-28 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3797362 | 1987-01-01 | Paper |
