| Publication | Date of Publication | Type |
|---|
| Approximating the smallest \(k\)-enclosing geodesic disc in a simple polygon | 2024-01-16 | Paper |
| Minimum ply covering of points with unit squares | 2023-11-24 | Paper |
| https://portal.mardi4nfdi.de/entity/Q6059187 | 2023-11-02 | Paper |
| Cops and Robbers on 1-Planar Graphs | 2023-09-02 | Paper |
| Bottleneck Convex Subsets: Finding k Large Convex Sets in a Point Set | 2023-07-21 | Paper |
| Bottleneck convex subsets: finding \(k\) large convex sets in a point set | 2023-03-30 | Paper |
| On the restricted \(k\)-Steiner tree problem | 2022-10-18 | Paper |
| Computing the \(k\)-visibility region of a point in a polygon | 2021-06-11 | Paper |
| On the restricted 1-Steiner tree problem | 2021-04-21 | Paper |
| Robustness and asymptotics of the projection median | 2021-03-12 | Paper |
| Local Routing in Convex Subdivisions | 2021-02-11 | Paper |
| Computing the \(k\)-crossing visibility region of a point in a polygon | 2020-02-25 | Paper |
| Integrated rank-weighted depth | 2019-10-01 | Paper |
| A time-space trade-off for computing the \(k\)-visibility region of a point in a polygon | 2019-09-10 | Paper |
| Polygon simplification by minimizing convex corners | 2019-09-10 | Paper |
| A simple linear-space data structure for constant-time range minimum query | 2019-05-02 | Paper |
| On Combinatorial Depth Measures | 2019-04-24 | Paper |
| Relating Graph Thickness to Planar Layers and Bend Complexity | 2018-11-28 | Paper |
| Drawing plane triangulations with few segments | 2018-11-19 | Paper |
| The projection median as a weighted average | 2018-06-05 | Paper |
| Competitive Online Routing on Delaunay Triangulations | 2018-02-22 | Paper |
| Thickness and colorability of geometric graphs | 2018-01-19 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4598142 | 2017-12-19 | Paper |
| Guarding orthogonal art galleries with sliding cameras | 2017-09-08 | Paper |
| Computing conforming partitions of orthogonal polygons with minimum stabbing number | 2017-09-07 | Paper |
| Guarding monotone art galleries with sliding cameras in linear time | 2017-07-13 | Paper |
| Time-Space Trade-Off for Finding the k-Visibility Region of a Point in a Polygon | 2017-05-05 | Paper |
| Drawing Planar Graphs with Reduced Height | 2017-04-05 | Paper |
| The Hausdorff core problem on simple polygons | 2017-03-09 | Paper |
| Realization of Simply Connected Polygonal Linkages and Recognition of Unit Disk Contact Trees | 2017-02-10 | Paper |
| Polygon simplification by minimizing convex corners | 2016-09-02 | Paper |
| Linear-space data structures for range frequency queries on arrays and trees | 2016-03-23 | Paper |
| A 3-Approximation Algorithm for Guarding Orthogonal Art Galleries with Sliding Cameras | 2015-09-15 | Paper |
| Guarding Monotone Art Galleries with Sliding Cameras in Linear Time | 2015-09-11 | Paper |
| Linear-space data structures for range minority query in arrays | 2015-09-02 | Paper |
| Low space data structures for geometric range mode query | 2015-05-22 | Paper |
| Plane 3-Trees: Embeddability and Approximation | 2015-05-20 | Paper |
| Complexity of barrier coverage with relocatable sensors in the plane | 2015-05-18 | Paper |
| Local Routing in Convex Subdivisions | 2015-02-20 | Paper |
| Linear-space data structures for range mode query in arrays | 2015-02-05 | Paper |
| On graphs that are not PCGs | 2015-01-30 | Paper |
| Searching on a line: a complete characterization of the optimal solution | 2015-01-28 | Paper |
| Trade-Offs in Planar Polyline Drawings | 2015-01-07 | Paper |
| Drawing Planar Graphs with Reduced Height | 2015-01-07 | Paper |
| ROBUST NONPARAMETRIC SIMPLIFICATION OF POLYGONAL CHAINS | 2014-12-01 | Paper |
| Cycle-maximal triangle-free graphs | 2014-11-20 | Paper |
| Competitive Online Routing on Delaunay Triangulations | 2014-09-02 | Paper |
| Bounding the locality of distributed routing algorithms | 2014-07-23 | Paper |
| Indexed Geometric Jumbled Pattern Matching | 2014-06-30 | Paper |
| A 3-Approximation Algorithm for Guarding Orthogonal Art Galleries with Sliding Cameras | 2014-03-31 | Paper |
| Drawing HV-Restricted Planar Graphs | 2014-03-31 | Paper |
| On Balanced -Contact Representations | 2013-12-20 | Paper |
| Thickness and Colorability of Geometric Graphs | 2013-12-06 | Paper |
| Guarding Orthogonal Art Galleries Using Sliding Cameras: Algorithmic and Hardness Results | 2013-09-20 | Paper |
| Linear-Space Data Structures for Range Frequency Queries on Arrays and Trees | 2013-09-20 | Paper |
| Revisiting the Problem of Searching on a Line | 2013-09-17 | Paper |
| A simple linear-space data structure for constant-time range minimum query | 2013-09-13 | Paper |
| Plane 3-trees: Embeddability and Approximation | 2013-08-12 | Paper |
| A Note on Minimum-Segment Drawings of Planar Graphs | 2013-07-09 | Paper |
| Bounding the locality of distributed routing algorithms | 2013-06-25 | Paper |
| Complexity of Barrier Coverage with Relocatable Sensors in the Plane | 2013-06-07 | Paper |
| Range majority in constant time and linear space | 2013-06-06 | Paper |
| On Graphs That Are Not PCGs | 2013-04-12 | Paper |
| A note on improving the performance of approximation algorithms for radiation therapy | 2013-03-28 | Paper |
| Robust Nonparametric Data Approximation of Point Sets via Data Reduction | 2013-03-21 | Paper |
| Cool-lex order and \(k\)-ary Catalan structures | 2013-01-18 | Paper |
| Faster optimal algorithms for segment minimization with small maximal value | 2013-01-18 | Paper |
| Hamiltonian Paths and Cycles in Planar Graphs | 2012-11-02 | Paper |
| Computing Partitions of Rectilinear Polygons with Minimum Stabbing Number | 2012-09-25 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2904770 | 2012-08-23 | Paper |
| Linear-Space Data Structures for Range Minority Query in Arrays | 2012-08-14 | Paper |
| On the Hardness of Point-Set Embeddability | 2012-06-08 | Paper |
| Embedding Plane 3-Trees in ℝ2 and ℝ3 | 2012-03-09 | Paper |
| Ranking and Loopless Generation of k-ary Dyck Words in Cool-lex Order | 2012-01-13 | Paper |
| Faster Optimal Algorithms for Segment Minimization with Small Maximal Value | 2011-08-12 | Paper |
| Reconstructing polygons from scanner data | 2011-07-27 | Paper |
| Untangled monotonic chains and adaptive range search | 2011-07-27 | Paper |
| Range Majority in Constant Time and Linear Space | 2011-07-06 | Paper |
| Modelling gateway placement in wireless networks: geometric \(k\)-centres of unit disc graphs | 2011-06-17 | Paper |
| AN IMPROVED LINE-SEPARABLE ALGORITHM FOR DISCRETE UNIT DISK COVER | 2010-05-19 | Paper |
| Practical Discrete Unit Disk Cover Using an Exact Line-Separable Algorithm | 2009-12-17 | Paper |
| Untangled Monotonic Chains and Adaptive Range Search | 2009-12-17 | Paper |
| Reconstructing Polygons from Scanner Data | 2009-12-17 | Paper |
| Finding a Hausdorff Core of a Polygon: On Convex Polygon Containment with Bounded Hausdorff Distance | 2009-10-20 | Paper |
| Kinetic maintenance of mobile \(k\)-centres on trees | 2009-06-30 | Paper |
| The projection median of a set of points | 2009-06-18 | Paper |
| BOUNDED-VELOCITY APPROXIMATION OF MOBILE EUCLIDEAN 2-CENTRES | 2008-08-26 | Paper |
| Balancing Traffic Load Using One-Turn Rectilinear Routing | 2008-05-27 | Paper |
| Kinetic Maintenance of Mobile k-Centres on Trees | 2008-05-27 | Paper |
| On Routing with Guaranteed Delivery in Three-Dimensional Ad Hoc Wireless Networks | 2008-03-06 | Paper |
| THE STEINER CENTRE OF A SET OF POINTS: STABILITY, ECCENTRICITY, AND APPLICATIONS TO MOBILE FACILITY LOCATION | 2006-09-04 | Paper |
| Toward the rectilinear crossing number of \(K _{n}\): New drawings, upper bounds, and asymptotics | 2003-04-28 | Paper |
| The rectilinear crossing number of \(K_{10}\) is 62 | 2001-06-18 | Paper |
