| Publication | Date of Publication | Type |
|---|
| Kinetic Geodesic Voronoi Diagrams in a Simple Polygon | 2023-10-26 | Paper |
| Reconfiguration of connected graph partitions | 2023-10-05 | Paper |
| Negative instance for the edge patrolling beacon problem | 2023-03-31 | Paper |
| Reconfiguration of connected graph partitions via recombination | 2023-03-22 | Paper |
| Distance Bounds for High Dimensional Consistent Digital Rays and 2-D Partially-Consistent Digital Rays | 2023-02-07 | Paper |
| Graphs with large total angular resolution | 2023-01-05 | Paper |
| Distance bounds for high dimensional consistent digital rays and 2-D partially-consistent digital rays | 2022-09-16 | Paper |
| Rectilinear link diameter and radius in a rectilinear polygonal domain | 2022-07-21 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5088936 | 2022-07-18 | Paper |
| Reconfiguration of connected graph partitions via recombination | 2022-06-13 | Paper |
| Circumscribing polygons and polygonizations for disjoint line segments | 2022-06-03 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5077652 | 2022-05-18 | Paper |
| Universal Reconfiguration of Facet-Connected Modular Robots by Pivots: The O(1) Musketeers | 2022-05-11 | Paper |
| Efficient segment folding is hard | 2022-04-08 | Paper |
| Snipperclips: cutting tools into desired polygons using themselves | 2021-09-17 | Paper |
| Universal reconfiguration of facet-connected modular robots by pivots: the \(O(1)\) musketeers | 2021-04-19 | Paper |
| Constrained routing between non-visible vertices | 2021-03-09 | Paper |
| Rectilinear link diameter and radius in a rectilinear polygonal domain | 2021-01-07 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5140731 | 2020-12-16 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5136216 | 2020-11-25 | Paper |
| Routing in Polygonal Domains | 2020-11-25 | Paper |
| Routing on the visibility graph | 2020-11-25 | Paper |
| Graphs with large total angular resolution | 2020-10-26 | Paper |
| Symmetric assembly puzzles are hard, beyond a few pieces | 2020-10-23 | Paper |
| Routing in histograms | 2020-07-22 | Paper |
| Balanced line separators of unit disk graphs | 2020-04-22 | Paper |
| Routing in polygonal domains | 2020-04-22 | Paper |
| Packing plane spanning graphs with short edges in complete geometric graphs | 2019-10-25 | Paper |
| Faster algorithms for growing prioritized disks and rectangles | 2019-10-18 | Paper |
| Dynamic graph coloring | 2019-04-25 | Paper |
| Stabbing segments with rectilinear objects | 2019-03-29 | Paper |
| Improved Time-Space Trade-offs for Computing Voronoi Diagrams | 2019-02-27 | Paper |
| Routing on the Visibility Graph | 2019-02-27 | Paper |
| Gap-Planar Graphs | 2019-02-20 | Paper |
| Computing the geodesic centers of a polygonal domain | 2018-11-19 | Paper |
| High Dimensional Consistent Digital Segments | 2018-11-19 | Paper |
| On the complexity of barrier resilience for fat regions and bounded ply | 2018-10-31 | Paper |
| Time-space trade-offs for triangulations and Voronoi diagrams | 2018-10-31 | Paper |
| On the complexity of barrier resilience for fat regions | 2018-10-17 | Paper |
| Gap-planar graphs | 2018-09-24 | Paper |
| High Dimensional Consistent Digital Segments. | 2018-08-13 | Paper |
| On interference among moving sensors and related problems | 2018-06-05 | Paper |
| Time-space trade-offs for triangulating a simple polygon | 2018-06-05 | Paper |
| Weight Balancing on Boundaries and Skeletons | 2018-04-23 | Paper |
| Improved Time-Space Trade-offs for Computing Voronoi Diagrams | 2018-04-19 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4636491 | 2018-04-19 | Paper |
| On interference among moving sensors and related problems | 2018-03-02 | Paper |
| The dual diameter of triangulations | 2018-02-19 | Paper |
| Colored spanning graphs for set visualization | 2018-02-19 | Paper |
| Computing the L1 Geodesic Diameter and Center of a Polygonal Domain | 2018-01-24 | Paper |
| Constrained routing between non-visible vertices | 2017-10-23 | Paper |
| Line segment covering of cells in arrangements | 2017-10-18 | Paper |
| Time-space trade-offs for triangulating a simple polygon | 2017-10-17 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5368689 | 2017-10-10 | Paper |
| Dynamic graph coloring | 2017-09-22 | Paper |
| Balanced line separators of unit disk graphs | 2017-09-22 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5282800 | 2017-07-17 | Paper |
| Packing plane spanning trees and paths in complete geometric graphs | 2017-06-13 | Paper |
| Hanabi is NP-hard, even for cheaters who look at their cards | 2017-05-12 | Paper |
| Computing the \(L_1\) geodesic diameter and center of a polygonal domain | 2017-05-11 | Paper |
| The 1-\textsc{Center} and 1-\textsc{Highway} problem revisited | 2017-03-03 | Paper |
| Symmetric Assembly Puzzles are Hard, Beyond a Few Pieces | 2017-02-01 | Paper |
| Space-Time Trade-offs for Stack-Based Algorithms | 2017-01-30 | Paper |
| A linear-time algorithm for the geodesic center of a simple polygon | 2016-12-20 | Paper |
| Locating a single facility and a high-speed line | 2016-06-23 | Paper |
| Line segment covering of cells in arrangements | 2016-02-05 | Paper |
| Time-Space Trade-offs for Triangulations and Voronoi Diagrams | 2015-10-30 | Paper |
| Stabbing segments with rectilinear objects | 2015-09-29 | Paper |
| Space-time trade-offs for stack-based algorithms | 2015-09-02 | Paper |
| GEODESIC-PRESERVING POLYGON SIMPLIFICATION | 2015-07-01 | Paper |
| Computing the \(L_1\) geodesic diameter and center of a simple polygon in linear time | 2015-06-17 | Paper |
| Geometric biplane graphs. I: Maximal graphs | 2015-05-22 | Paper |
| Geometric biplane graphs. II: Graph augmentation | 2015-05-22 | Paper |
| Reprint of: Theta-3 is connected | 2015-04-27 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5173163 | 2015-02-09 | Paper |
| Geodesic order types | 2015-01-19 | Paper |
| Balanced partitions of 3-colored geometric sets in the plane | 2014-12-05 | Paper |
| New results on stabbing segments with a polygon | 2014-11-24 | Paper |
| Theta-3 is connected | 2014-08-13 | Paper |
| Computing a visibility polygon using few variables | 2014-08-13 | Paper |
| The 1-median and 1-highway problem | 2014-07-27 | Paper |
| Computing the L 1 Geodesic Diameter and Center of a Simple Polygon in Linear Time | 2014-03-31 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5747414 | 2014-02-14 | Paper |
| Reprint of: Memory-constrained algorithms for simple polygons | 2014-01-22 | Paper |
| Geodesic-Preserving Polygon Simplification | 2014-01-14 | Paper |
| Colored Spanning Graphs for Set Visualization | 2013-12-20 | Paper |
| Helly numbers of polyominoes | 2013-09-26 | Paper |
| The geodesic diameter of polygonal domains | 2013-09-23 | Paper |
| Coloring planar homothets and three-dimensional hypergraphs | 2013-09-03 | Paper |
| Memory-constrained algorithms for simple polygons | 2013-07-31 | Paper |
| New Results on Stabbing Segments with a Polygon | 2013-06-07 | Paper |
| Establishing strong connectivity using optimal radius half-disk antennas | 2013-01-25 | Paper |
| Locating a Service Facility and a Rapid Transit Line | 2013-01-07 | Paper |
| The 1-Center and 1-Highway Problem | 2013-01-07 | Paper |
| Some properties of \(k\)-Delaunay and \(k\)-Gabriel graphs | 2012-12-04 | Paper |
| Minimizing interference in ad hoc networks with bounded communication radius | 2012-10-23 | Paper |
| Geodesic Order Types | 2012-09-25 | Paper |
| Coloring Planar Homothets and Three-Dimensional Hypergraphs | 2012-06-29 | Paper |
| Colorful strips | 2012-01-24 | Paper |
| Minimizing interference in ad hoc networks with bounded communication radius | 2011-12-16 | Paper |
| Computing the Visibility Polygon Using Few Variables | 2011-12-16 | Paper |
| EFFECT OF CORNER INFORMATION IN SIMULTANEOUS PLACEMENT OF k RECTANGLES AND TABLEAUX | 2011-03-25 | Paper |
| Covering points by disjoint boxes with outliers | 2011-01-21 | Paper |
| The Geodesic Diameter of Polygonal Domains | 2010-09-06 | Paper |
| Effect of Corner Information in Simultaneous Placement of K Rectangles and Tableaux | 2010-07-20 | Paper |
| Colorful Strips | 2010-04-27 | Paper |
| Algorithms for Computing the Maximum Weight Region Decomposable into Elementary Shapes | 2009-12-17 | Paper |
| Consistent digital rays | 2009-08-27 | Paper |
| Square and Rectangle Covering with Outliers | 2009-07-14 | Paper |
| All Farthest Neighbors in the Presence of Highways and Obstacles | 2009-02-24 | Paper |
| Consistent digital rays | 2009-02-12 | Paper |
| Optimal Insertion of a Segment Highway in a City Metric | 2008-07-10 | Paper |
