| Publication | Date of Publication | Type |
|---|
| https://portal.mardi4nfdi.de/entity/Q6128571 | 2024-04-15 | Paper |
| Perpetual maintenance of machines with different urgency requirements | 2023-10-24 | Paper |
| Online and Approximate Network Construction from Bounded Connectivity Constraints | 2023-08-18 | Paper |
| Online and approximate network construction from bounded connectivity constraints | 2023-03-22 | Paper |
| Local Routing in Sparse and Lightweight Geometric Graphs | 2023-02-03 | Paper |
| Linear-time heuristics for minimum weight rectangulation | 2022-12-09 | Paper |
| A fast heuristic for approximating the minimum weight triangulation | 2022-12-09 | Paper |
| A linear-time heuristic for minimum rectangular coverings (Extended abstract) | 2022-12-09 | Paper |
| Sorting shuffled monotone sequences | 2022-12-09 | Paper |
| Fast algorithms for greedy triangulation | 2022-12-09 | Paper |
| Local routing in sparse and lightweight geometric graphs | 2022-05-03 | Paper |
| Minimum spanning trees in \(d\) dimensions | 2021-12-20 | Paper |
| Pushing the online Boolean matrix-vector multiplication conjecture off-line and identifying its easy cases | 2021-03-10 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5136224 | 2020-11-25 | Paper |
| Approximation algorithms for the geometric firefighter and budget fence problems | 2019-10-29 | Paper |
| Pushing the online matrix-vector conjecture off-line and identifying its easy cases | 2019-10-11 | Paper |
| On a Fire Fighter’s Problem | 2019-06-24 | Paper |
| Shortcuts for the circle | 2019-03-20 | Paper |
| Approximate distance oracles for geometric spanners | 2018-11-05 | Paper |
| 3D rectangulations and geometric matrix multiplication | 2018-02-28 | Paper |
| Efficiently correcting matrix products | 2017-10-10 | Paper |
| A Fire Fighter's Problem. | 2017-10-10 | Paper |
| Bamboo Garden Trimming Problem (Perpetual Maintenance of Machines with Different Attendance Urgency Factors) | 2017-04-04 | Paper |
| On parallel complexity of planar triangulations | 2017-01-19 | Paper |
| Computing hierarchies of clusters from the euclidean minimum spanning tree in linear time | 2017-01-19 | Paper |
| Efficiently Correcting Matrix Products | 2015-09-11 | Paper |
| 3D Rectangulations and Geometric Matrix Multiplication | 2015-09-11 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5501830 | 2015-08-14 | Paper |
| Quickest path queries on transportation network | 2014-06-27 | Paper |
| A note on a QPTAS for maximum weight triangulation of planar point sets | 2014-04-30 | Paper |
| Approximation Algorithms for the Geometric Firefighter and Budget Fence Problems | 2014-03-31 | Paper |
| Algorithms and Data Structures | 2010-04-20 | Paper |
| RESTRICTED MESH SIMPLIFICATION USING EDGE CONTRACTIONS | 2009-07-20 | Paper |
| FIXED PARAMETER ALGORITHMS FOR THE MINIMUM WEIGHT TRIANGULATION PROBLEM | 2008-08-26 | Paper |
| A Fixed Parameter Algorithm for the Minimum Number Convex Partition Problem | 2008-03-18 | Paper |
| Tight Time Bounds for the Minimum Local Convex Partition Problem | 2008-03-18 | Paper |
| Minimum weight pseudo-triangulations | 2007-10-12 | Paper |
| Restricted Mesh Simplification Using Edge Contractions | 2007-09-10 | Paper |
| Approximate distance oracles for graphs with dense clusters | 2007-06-04 | Paper |
| Covering a Set of Points with a Minimum Number of Lines | 2007-05-02 | Paper |
| Algorithms and Computation | 2006-11-14 | Paper |
| A PTAS for minimum vertex dilation triangulation of a simple polygon with a constant number of sources of dilation | 2006-04-28 | Paper |
| Algorithms and Computation | 2005-12-22 | Paper |
| TSP with neighborhoods of varying size | 2005-11-16 | Paper |
| FSTTCS 2004: Foundations of Software Technology and Theoretical Computer Science | 2005-08-12 | Paper |
| Chips on wafers, or packing rectangles into grids | 2005-01-31 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4829019 | 2004-11-29 | Paper |
| BALANCED PARTITION OF MINIMUM SPANNING TREES | 2004-09-29 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3046480 | 2004-08-12 | 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/Q4411358 | 2003-07-08 | Paper |
| Fast Greedy Algorithms for Constructing Sparse Geometric Spanners | 2002-09-29 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4542536 | 2002-09-17 | Paper |
| Optimal algorithms for complete linkage clustering in \(d\) dimensions | 2002-08-13 | Paper |
| Lower bounds for approximate polygon decomposition and minimum gap | 2002-07-14 | Paper |
| Improved algorithms for constructing fault-tolerant spanners | 2002-05-20 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2748154 | 2001-10-14 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2721991 | 2001-07-11 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4500844 | 2001-03-25 | Paper |
| The greedy triangulation can be computed from the Delaunay triangulation in linear time | 2000-10-22 | Paper |
| Close approximations of minimum rectangular coverings | 2000-09-04 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4948735 | 2000-06-21 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4948733 | 2000-04-26 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4247271 | 2000-01-18 | Paper |
| Quasi-Greedy Triangulations Approximating the Minimum Weight Triangulation | 1998-12-02 | Paper |
| A linear-time approximation scheme for minimum weight triangulation of convex polygons | 1998-08-02 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4390742 | 1998-05-26 | Paper |
| Fast algorithms for complete linkage clustering | 1998-03-11 | Paper |
| Exploiting few inversions when sorting: Sequential and parallel algorithms | 1997-09-10 | Paper |
| On 2-QBF truth testing in parallel | 1997-02-28 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4875212 | 1996-04-28 | Paper |
| Sorting shuffled monotone sequences | 1995-02-13 | Paper |
| Space-efficient parallel merging | 1993-11-15 | Paper |
| Sublinear merging and natural mergesort | 1993-06-29 | Paper |
| Adaptive Heapsort | 1993-06-29 | Paper |
| Matching parentheses in parallel | 1993-05-16 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4028912 | 1993-03-28 | Paper |
| Fast algorithms for greedy triangulation | 1992-12-14 | Paper |
| There are planar graphs almost as good as the complete graphs and almost as cheap as minimum spanning trees | 1992-09-27 | Paper |
| Splitsort -- an adaptive sorting algorithm | 1992-06-27 | Paper |
| A sublogarithmic convex hull algorithm | 1990-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3359741 | 1990-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3359785 | 1990-01-01 | Paper |
| A note on adaptive parallel sorting | 1989-01-01 | Paper |
| Heuristics for optimum binary search trees and minimum weight triangulation problems | 1989-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3484348 | 1989-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3484376 | 1989-01-01 | Paper |
| A balanced search tree O(1) worst-case update time | 1988-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3796755 | 1988-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3817624 | 1988-01-01 | Paper |
| On approximation behavior of the greedy triangulation for convex polygons | 1987-01-01 | Paper |
| Algorithms for minimum length partitions of polygons | 1987-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3783595 | 1987-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3785934 | 1987-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3693536 | 1985-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5184827 | 1985-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3217601 | 1984-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3339306 | 1984-01-01 | Paper |
