| Publication | Date of Publication | Type |
|---|
| Finding large planar subgraphs and large subgraphs of a given genus | 2024-01-29 | Paper |
| An improved algorithm for finding maximum outerplanar subgraphs | 2024-01-24 | Paper |
| Faster compression of patterns to rectangle rule lists | 2023-10-16 | Paper |
| Combination algorithms for Steiner tree variants | 2023-04-21 | Paper |
| Faster compression of patterns to rectangle rule lists | 2020-05-26 | Paper |
| Improved approximation algorithms for minimum power covering problems | 2019-10-18 | Paper |
| Client assignment problems for latency minimization | 2019-06-25 | Paper |
| Improved approximation algorithms for minimum power covering problems | 2019-01-15 | Paper |
| T-joins in strongly connected hypergraphs | 2017-12-14 | Paper |
| Improved approximation algorithms for single-tiered relay placement | 2016-04-13 | Paper |
| 1.61-approximation for min-power strong connectivity with two power levels | 2016-02-23 | Paper |
| Register loading via linear programming | 2015-09-02 | Paper |
| Relay placement for two-connectivity | 2015-04-09 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2934701 | 2014-12-18 | Paper |
| Bounding the payment of approximate truthful mechanisms | 2014-12-02 | Paper |
| An improved approximation algorithm for resource allocation | 2014-09-09 | Paper |
| Sequential dependency computation via geometric data structures | 2014-01-22 | Paper |
| Approximate Min-Power Strong Connectivity | 2014-01-21 | Paper |
| Maximum series-parallel subgraph | 2012-04-26 | Paper |
| Maximizing a Monotone Submodular Function Subject to a Matroid Constraint | 2012-03-15 | Paper |
| Register Loading via Linear Programming | 2011-08-12 | Paper |
| Disjoint bases in a polymatroid | 2010-11-09 | Paper |
| Min-Power Strong Connectivity | 2010-09-10 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3575437 | 2010-07-27 | Paper |
| Algorithms - ESA 2003 | 2010-03-03 | Paper |
| Maximum Series-Parallel Subgraph | 2010-01-21 | Paper |
| Reconfigurations in Graphs and Grids | 2009-03-16 | Paper |
| Fast edge colorings with fixed number of colors to minimize imbalance | 2009-01-19 | Paper |
| Reconfigurations in Graphs and Grids | 2008-09-18 | Paper |
| A note on data structures for maintaining bipartitions | 2008-05-16 | Paper |
| Fast Edge Colorings with Fixed Number of Colors to Minimize Imbalance | 2008-04-17 | Paper |
| Maximizing a Submodular Set Function Subject to a Matroid Constraint (Extended Abstract) | 2007-11-29 | Paper |
| On ring grooming in optical networks | 2007-10-12 | Paper |
| A fast localized algorithm for scheduling sensors | 2006-08-04 | Paper |
| Bounded-hops power assignment in ad hoc wireless networks | 2006-06-09 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5290259 | 2006-04-28 | Paper |
| SEPARATING POINTS BY AXIS-PARALLEL LINES | 2006-03-13 | Paper |
| Algorithms and Computation | 2005-12-22 | Paper |
| Algorithms and Computation | 2005-12-22 | Paper |
| The polymatroid Steiner problems | 2005-10-18 | Paper |
| Approximation Algorithms for the 0-Extension Problem | 2005-02-21 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4737541 | 2004-08-11 | Paper |
| Multicuts in unweighted graphs and digraphs with bounded degree and bounded tree-width | 2004-03-14 | Paper |
| A new approximation algorithm for finding heavy planar subgraphs | 2003-08-17 | Paper |
| Traffic partition in WDM/SONET rings to minimize SONET ADMs | 2003-06-09 | Paper |
| Minimum-energy broadcasting in static ad hoc wireless networks | 2003-02-19 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4542519 | 2002-08-01 | Paper |
| Splittable traffic partition in WDM/SONET rings to minimize SONET ADMs | 2002-07-15 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2768266 | 2002-06-30 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2741506 | 2001-10-24 | Paper |
| Alphabet-Independent and Scaled Dictionary Matching | 2001-03-12 | Paper |
| An improved approximation algorithm of MULTIWAY CUT. | 2000-11-21 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3840353 | 1999-04-08 | Paper |
| A Better Approximation Algorithm for Finding Planar Subgraphs | 1998-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4875164 | 1996-06-16 | Paper |
