| Publication | Date of Publication | Type |
|---|
| Testing connectedness of images | 2025-01-14 | Paper |
| Testing connectedness of images | 2024-10-24 | Paper |
| Tolerant Testers of Image Properties | 2023-10-31 | Paper |
| Constant ratio approximations of the weighted feedback vertex set problem for undirected graphs | 2023-03-21 | Paper |
| On approximation properties of the Independent set problem for degree 3 graphs | 2022-12-16 | Paper |
| A nearly optimal parallel algorithm for the Voronoi diagram of a convex polygon | 2022-12-09 | Paper |
| Speed is more powerful than clairvoyance | 2022-12-09 | Paper |
| A linear-time algorithm for the 1-mismatch problem | 2022-08-19 | Paper |
| On-line load balancing for related machines | 2022-08-19 | Paper |
| On the complexity of approximating the independent set problem | 2022-08-16 | Paper |
| Testing convexity of figures under the uniform distribution | 2019-06-07 | Paper |
| The power and limitations of uniform samples in testing properties of figures | 2019-03-11 | Paper |
| Approximation Algorithms for Min-Max Generalization Problems | 2018-10-30 | Paper |
| The Power and Limitations of Uniform Samples in Testing Properties of Figures | 2018-04-19 | Paper |
| Testing Convexity of Figures Under the Uniform Distribution | 2018-01-30 | Paper |
| Tolerant testers of image properties | 2017-12-19 | Paper |
| L p -testing | 2015-06-26 | Paper |
| On the computational complexity of measuring global stability of banking networks | 2015-01-19 | Paper |
| Improvements in throughout maximization for real-time scheduling | 2014-09-26 | Paper |
| Steiner transitive-closure spanners of low-dimensional posets | 2014-08-14 | Paper |
| Approximation algorithms for spanner problems and directed Steiner forest | 2013-06-06 | Paper |
| Exact and approximation algorithms for geometric and capacitated set cover problems | 2012-11-21 | Paper |
| Primal-Dual Approximation Algorithms for Node-Weighted Network Design in Planar Graphs | 2012-11-02 | Paper |
| Finding sparser directed spanners | 2012-08-29 | Paper |
| O(1)-Approximations for Maximum Movement Problems | 2011-08-17 | Paper |
| Improved Approximation for the Directed Spanner Problem | 2011-07-06 | Paper |
| Steiner Transitive-Closure Spanners of Low-Dimensional Posets | 2011-07-06 | Paper |
| A 3/2-Approximation Algorithm for Generalized Steiner Trees in Complete Graphs with Edge Lengths 1 and 2 | 2010-12-09 | Paper |
| Approximation Algorithms for Min-Max Generalization Problems | 2010-09-10 | Paper |
| 8/7-approximation algorithm for (1,2)-TSP | 2010-08-16 | Paper |
| Exact and Approximation Algorithms for Geometric and Capacitated Set Cover Problems | 2010-07-20 | Paper |
| On constructing an optimal consensus clustering from multiple clusterings | 2010-03-24 | Paper |
| 1.25-Approximation Algorithm for Steiner Tree Problem with Distances 1 and 2 | 2009-10-20 | Paper |
| Approximating Transitive Reductions for Directed Networks | 2009-10-20 | Paper |
| On approximating four covering and packing problems | 2009-06-08 | Paper |
| Consistent sets of secondary structures in proteins | 2009-05-13 | Paper |
| Faster Approximation of Distances in Graphs | 2009-02-17 | Paper |
| Approximating the online set multicover problems via randomized winnowing | 2008-04-15 | Paper |
| Approximating Huffman codes in parallel | 2008-01-11 | Paper |
| Applications of the Linear Matroid Parity Algorithm to Approximating Steiner Trees | 2007-05-02 | Paper |
| Randomized approximation algorithms for set multicover problems with applications to reverse engineering of protein and gene networks | 2007-04-18 | Paper |
| The inverse protein folding problem on 2D and 3D lattices | 2007-04-18 | Paper |
| Computational complexity of some restricted instances of 3-SAT | 2007-04-13 | Paper |
| Optimal trade-off for Merkle tree traversal | 2007-03-15 | Paper |
| Algorithms and Data Structures | 2006-10-25 | Paper |
| Algorithms and Data Structures | 2006-10-25 | Paper |
| Combinatorial Pattern Matching | 2005-09-07 | Paper |
| Algorithm Theory - SWAT 2004 | 2005-09-07 | Paper |
| Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques | 2005-08-25 | Paper |
| Tight approximability results for test set problems in bioinformatics | 2005-08-03 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3024759 | 2005-07-04 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4828976 | 2004-11-29 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4737194 | 2004-08-11 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4737213 | 2004-08-11 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4471294 | 2004-07-28 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4432280 | 2003-12-16 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4411359 | 2003-07-08 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4410158 | 2003-07-02 | Paper |
| On the complexity of pattern matching for highly compressed two-dimensional texts. | 2003-05-14 | Paper |
| Aligning two fragmented sequences | 2003-04-28 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4780782 | 2002-11-21 | Paper |
| Efficient approximation algorithms for tiling and packing problems with rectangles | 2002-07-08 | Paper |
| Exact size of binary space partitionings and improved rectangle tiling algorithms | 2002-04-23 | Paper |
| Multi-phase algorithms for throughput maximization for real-time scheduling | 2002-04-23 | Paper |
| Improved approximation algorithms for rectangle tiling and packing. | 2002-01-30 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2753726 | 2001-11-11 | Paper |
| Algorithms for the least distance problem | 2001-09-18 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2721980 | 2001-07-11 | Paper |
| A \(d/2\) approximation for maximum weight independent set in \(d\)-claw free graphs | 2001-04-17 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4527000 | 2001-02-28 | Paper |
| On-Line Load Balancing for Related Machines | 2000-10-04 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4945797 | 2000-03-23 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4719334 | 2000-01-04 | Paper |
| A 2-Approximation Algorithm for the Undirected Feedback Vertex Set Problem | 1999-11-23 | Paper |
| On approximation properties of the independent set problem for low degree graphs | 1999-03-22 | Paper |
| A nearly parallel algorithm for the Voronoi diagram of a convex polygon | 1998-10-22 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3128896 | 1997-10-29 | Paper |
| Reliable Broadcasting in Logarithmic Time with Byzantine Link Failures | 1997-05-20 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4875171 | 1996-10-21 | Paper |
| Online Navigation in a Room | 1995-11-22 | Paper |
| Fast consensus in networks of bounded degree. | 1995-11-22 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4763418 | 1995-04-11 | Paper |
| Reliable distributed diagnosis for multiprocessor systems with random faults | 1995-01-11 | Paper |
| Improved Approximations for the Steiner Tree Problem | 1994-11-23 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3138905 | 1994-09-19 | Paper |
| Cloture Votes:n/4-resilient Distributed Consensus int + 1 rounds | 1993-04-01 | Paper |
| On the complexity of approximating the independent set problem | 1992-06-28 | Paper |
| On the Performance of the Minimum Degree Ordering for Gaussian Elimination | 1990-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3334975 | 1983-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3957927 | 1982-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3938525 | 1980-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3853607 | 1979-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4160434 | 1978-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4139689 | 1977-01-01 | Paper |
