| Publication | Date of Publication | Type |
|---|
| Spanning closed trail and hamiltonian cycle in grid graphs | 2023-03-21 | Paper |
| Optimal Testing of Digital Microfluidic Biochips | 2012-07-28 | Paper |
| Maximum series-parallel subgraph | 2012-04-26 | Paper |
| A 3/2-Approximation Algorithm for Generalized Steiner Trees in Complete Graphs with Edge Lengths 1 and 2 | 2010-12-09 | Paper |
| Algorithms and Data Structures | 2010-04-20 | Paper |
| Algorithms - ESA 2003 | 2010-03-03 | Paper |
| 1.25-Approximation Algorithm for Steiner Tree Problem with Distances 1 and 2 | 2009-10-20 | Paper |
| Phasing of 2-SNP Genotypes Based on Non-random Mating Model | 2008-12-09 | Paper |
| Applications of the Linear Matroid Parity Algorithm to Approximating Steiner Trees | 2007-05-02 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5479886 | 2006-07-11 | Paper |
| Algorithms and Computation | 2005-12-22 | Paper |
| Computational Science – ICCS 2005 | 2005-11-30 | Paper |
| The polymatroid Steiner problems | 2005-10-18 | Paper |
| Tighter Bounds for Graph Steiner Tree Approximation | 2005-09-16 | Paper |
| Improved approximation algorithms for the quality of service multicast tree problem | 2005-08-02 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3024759 | 2005-07-04 | Paper |
| The moving-target traveling salesman problem | 2004-10-01 | Paper |
| A new approximation algorithm for finding heavy planar subgraphs | 2003-08-17 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4410160 | 2003-07-02 | Paper |
| A note on the colorability of mixed hypergraph using \(k\) colors | 2003-05-27 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4778566 | 2002-11-18 | Paper |
| A note on the MST heuristic for bounded edge-length Steiner trees with minimum number of Steiner points | 2002-07-25 | Paper |
| Practical Approximation Algorithms for Zero- and Bounded-Skew Trees | 2002-04-23 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2768326 | 2002-01-30 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4803953 | 2002-01-01 | Paper |
| An improved approximation scheme for the Group Steiner Problem | 2001-04-17 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4952699 | 2000-05-10 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4945797 | 2000-03-23 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4234134 | 1999-11-03 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4252041 | 1999-06-17 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4395327 | 1998-10-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4383542 | 1998-04-27 | Paper |
| New approximation algorithms for the Steiner tree problems | 1998-04-13 | Paper |
| Faster approximation algorithms for the rectilinear Steiner tree problem | 1997-07-28 | Paper |
| A series of approximation algorithms for the acyclic directed Steiner tree problem | 1997-05-28 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3137223 | 1993-11-01 | Paper |
| A faster approximation algorithm for the Steiner tree problem in graphs | 1993-08-08 | Paper |
| An 11/6-approximation algorithm for the network Steiner problem | 1993-06-29 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4027204 | 1993-02-21 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3983367 | 1992-06-27 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4710903 | 1992-06-25 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3684162 | 1984-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3966182 | 1982-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3966183 | 1982-01-01 | Paper |
