| Publication | Date of Publication | Type |
|---|
| Differential meta-analysis for testing the relative importance of two competing null hypotheses over multiple experiments | 2024-09-05 | Paper |
| Finding all weakly-visible chords of a polygon in linear time | 2022-12-09 | Paper |
| On hamiltonian triangulations in simple polygons (Extended Abstract) | 2022-08-19 | Paper |
| Approximate distance oracles for geometric spanners | 2018-11-05 | Paper |
| Geometric Minimum Spanning Trees via Well-Separated Pair Decompositions | 2017-06-15 | Paper |
| Geometric Avatar Problems | 2017-02-21 | Paper |
| On the dilation spectrum of paths, cycles, and trees | 2009-08-14 | Paper |
| FST TCS 2003: Foundations of Software Technology and Theoretical Computer Science | 2009-08-06 | Paper |
| Region-restricted clustering for geographic data mining | 2009-02-12 | Paper |
| Region-Restricted Clustering for Geographic Data Mining | 2008-03-11 | Paper |
| Geometric Spanner Networks | 2007-06-06 | Paper |
| Distance-preserving approximations of polygonal paths | 2007-02-19 | Paper |
| Algorithms and Computation | 2006-11-14 | Paper |
| STACS 2005 | 2005-12-02 | Paper |
| Computational Science – ICCS 2005 | 2005-11-30 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4829019 | 2004-11-29 | Paper |
| Approximating geometric bottleneck shortest paths | 2004-11-18 | Paper |
| BALANCED PARTITION OF MINIMUM SPANNING TREES | 2004-09-29 | Paper |
| Balanced Partition of Minimum Spanning Trees | 2004-08-12 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4427857 | 2003-09-14 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4418635 | 2003-08-11 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4779120 | 2002-11-24 | Paper |
| Fast Greedy Algorithms for Constructing Sparse Geometric Spanners | 2002-09-29 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4542536 | 2002-09-17 | Paper |
| Optimally computing a shortest weakly visible line segment inside a simple polygon | 2002-09-03 | Paper |
| Graph-theoretic techniques in D-optimal design problems | 2002-05-28 | Paper |
| Improved algorithms for constructing fault-tolerant spanners | 2002-05-20 | Paper |
| Algorithms for facility location problems with outliers. (Extended abstract) | 2002-01-30 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2762528 | 2002-01-09 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3150179 | 2002-01-01 | Paper |
| Approximating a minimum Manhattan network | 2001-10-14 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2721991 | 2001-07-11 | Paper |
| A generalization of maximal independent sets | 2001-05-06 | Paper |
| Approximating the Stretch Factor of Euclidean Graphs | 2000-10-18 | Paper |
| ON HAMILTONIAN TRIANGULATIONS IN SIMPLE POLYGONS | 2000-05-07 | Paper |
| A Fast Algorithm for Constructing Sparse Euclidean Spanners | 1997-09-10 | Paper |
| LR-visibility in polygons | 1997-09-04 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4886051 | 1996-11-04 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4698690 | 1995-05-11 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4037425 | 1993-05-18 | Paper |
| Stability number and chromatic number of tolerance graphs | 1992-06-28 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3348433 | 1990-01-01 | Paper |
| A note on the Hamiltonian circuit problem on directed path graphs | 1989-01-01 | Paper |
