| Publication | Date of Publication | Type |
|---|
| Largest unit rectangles inscribed in a convex polygon | 2024-11-15 | Paper |
| Inscribing or circumscribing a histogon to a convex polygon | 2024-09-12 | Paper |
| Area-efficient algorithms for upward straight-line tree drawings | 2024-01-29 | Paper |
| Directed hamiltonian packing in d-dimensional meshes and its application | 2023-01-25 | Paper |
| Reachability of turn sequences | 2022-03-01 | Paper |
| Minimum rectilinear polygons for given angle sequences | 2021-12-15 | Paper |
| Representing graphs and hypergraphs by touching polygons in 3D | 2020-10-26 | Paper |
| Area bounds of rectilinear polygons realized by angle sequences | 2019-10-25 | Paper |
| Tight bounds for beacon-based coverage in simple rectilinear polygons | 2019-10-18 | Paper |
| Minimum-width annulus with outliers: circular, square, and rectangular cases | 2019-03-11 | Paper |
| The minimum convex container of two convex polytopes under translations | 2018-11-19 | Paper |
| Minimum-width annulus with outliers: circular, square, and rectangular cases | 2018-06-15 | Paper |
| Covering points with convex sets of minimum size | 2018-03-16 | Paper |
| Maximizing the overlap of two planar convex sets under rigid motions | 2017-10-20 | Paper |
| Minimum Rectilinear Polygons for Given Angle Sequences | 2017-02-01 | Paper |
| Covering Points with Convex Sets of Minimum Size | 2016-05-03 | Paper |
| Tight Bounds for Beacon-Based Coverage in Simple Rectilinear Polygons | 2016-05-03 | Paper |
| Local event boundary detection with unreliable sensors: analysis of the majority vote scheme | 2015-12-08 | Paper |
| Local Event Boundary Detection with Unreliable Sensors: Analysis of the Majority Vote Scheme | 2015-05-20 | Paper |
| A note on minimum-sum coverage by aligned disks | 2014-04-14 | Paper |
| Realistic roofs over a rectilinear polygon | 2013-09-03 | Paper |
| Area Bounds of Rectilinear Polygons Realized by Angle Sequences | 2013-03-21 | Paper |
| Covering and piercing disks with two centers | 2013-01-25 | Paper |
| THE ONION DIAGRAM: A VORONOI-LIKE TESSELLATION OF A PLANAR LINE SPACE AND ITS APPLICATIONS | 2012-11-23 | Paper |
| Generating Realistic Roofs over a Rectilinear Polygon | 2011-12-16 | Paper |
| Covering and Piercing Disks with Two Centers | 2011-12-16 | Paper |
| THE ALIGNED K-CENTER PROBLEM | 2011-05-11 | Paper |
| The Onion Diagram: A Voronoi-Like Tessellation of a Planar Line Space and Its Applications | 2010-12-09 | Paper |
| GUARDING A POLYGON FROM TWO NEARLY-OPPOSITE DIRECTIONS | 2010-07-27 | Paper |
| Covering a simple polygon by monotone directions | 2010-03-11 | Paper |
| Untangling a planar graph | 2009-12-14 | Paper |
| CONSTRUCTING OPTIMAL HIGHWAYS | 2009-04-14 | Paper |
| On the minimum total length of interval systems expressing all intervals, and range-restricted queries | 2009-02-12 | Paper |
| Covering a Simple Polygon by Monotone Directions | 2009-01-29 | Paper |
| Escaping offline searchers and isoperimetric theorems | 2008-11-19 | Paper |
| CONSTRUCTING THE CITY VORONOI DIAGRAM FASTER | 2008-09-29 | Paper |
| Escaping Off-Line Searchers and a Discrete Isoperimetric Theorem | 2008-05-27 | Paper |
| Maximum overlap and minimum convex hull of two convex polyhedra under translations | 2008-04-28 | Paper |
| Moving Vertices to Make Drawings Plane | 2008-03-25 | Paper |
| Farthest-Point Queries with Geometric and Combinatorial Constraints | 2008-03-18 | Paper |
| Maximizing the overlap of two planar convex sets under rigid motions | 2007-03-15 | Paper |
| Fundamentals of Computation Theory | 2006-10-20 | Paper |
| GUARDING ART GALLERIES BY GUARDING WITNESSES | 2006-05-29 | Paper |
| Inscribing an axially symmetric polygon and other approximation algorithms for planar convex sets | 2006-04-28 | Paper |
| Farthest-point queries with geometric and combinatorial constraints | 2006-04-28 | Paper |
| Algorithms for drawing binary trees in the plane. | 2006-01-17 | Paper |
| Algorithms and Computation | 2005-12-22 | Paper |
| Computing and Combinatorics | 2005-06-15 | Paper |
| LABELING A RECTILINEAR MAP WITH SLIDING LABELS | 2005-06-10 | Paper |
| Labeling points with weights | 2004-12-02 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4474126 | 2004-08-04 | Paper |
| Facility location and the geometric minimum-diameter spanning tree. | 2004-01-23 | Paper |
| Computing farthest neighbors on a convex polytope. | 2003-08-17 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4411284 | 2003-07-07 | Paper |
| Building bridges between convex regions | 2003-05-19 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4551357 | 2002-09-05 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2766839 | 2002-07-01 | Paper |
| Computing the optimal bridge between two polygons | 2002-05-14 | Paper |
| Area-efficient algorithms for straight-line tree drawings | 2001-01-29 | Paper |
| Optimal embedding of multiple directed Hamiltonian rings into \(d\)-dimensional meshes | 2000-11-07 | Paper |
| Placing two disks in a convex polygon | 2000-10-26 | Paper |
| The widest k-dense corridor problems | 1999-01-12 | Paper |
