| Publication | Date of Publication | Type |
|---|
| https://portal.mardi4nfdi.de/entity/Q6124759 | 2024-04-02 | Paper |
| Geometric spanning trees minimizing the Wiener index | 2024-01-16 | Paper |
| Stabbing pairwise intersecting disks by four points | 2023-12-21 | Paper |
| Piercing diametral disks induced by edges of maximum spanning trees | 2023-11-24 | Paper |
| Parameterized Study of Steiner Tree on Unit Disk Graphs | 2023-11-02 | Paper |
| Parameterized study of Steiner tree on unit disk graphs | 2023-04-21 | Paper |
| Planar Bichromatic Bottleneck Spanning Trees | 2023-02-07 | Paper |
| Geodesic obstacle representation of graphs | 2022-11-16 | Paper |
| Piercing pairwise intersecting geodesic disks by five points | 2022-11-16 | Paper |
| \(2\times n\) grids have unbounded anagram-free chromatic number | 2022-09-06 | Paper |
| A linear-time algorithm for minimum \(k\)-hop dominating set of a cactus graph | 2022-08-24 | Paper |
| Computing maximum independent set on outerstring graphs and their relatives | 2022-04-08 | Paper |
| \( \delta \)-greedy \(t\)-spanner | 2021-12-15 | Paper |
| Approximating maximum diameter-bounded subgraph in unit disk graphs | 2021-11-18 | Paper |
| Minimizing total interference in asymmetric sensor networks | 2021-10-06 | Paper |
| Piercing pairwise intersecting geodesic disks | 2021-09-17 | Paper |
| Planar bichromatic bottleneck spanning trees | 2021-09-07 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5002693 | 2021-07-28 | Paper |
| Minimizing total interference in asymmetric sensor networks | 2021-07-08 | Paper |
| On the minimum consistent subset problem | 2021-06-30 | Paper |
| The Most Likely Object to be Seen Through a Window | 2021-02-11 | Paper |
| Improved PTASs for convex barrier coverage | 2021-01-07 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5136221 | 2020-11-25 | Paper |
| Faster algorithms for some optimization problems on collinear points | 2020-11-12 | Paper |
| Sensor network topology design and analysis for efficient data gathering by a mobile mule | 2020-10-12 | Paper |
| Boundary Labeling for Rectangular Diagrams | 2020-08-25 | Paper |
| Approximating Maximum Diameter-Bounded Subgraph in Unit Disk Graphs | 2020-08-18 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5115775 | 2020-08-18 | Paper |
| Balanced line separators of unit disk graphs | 2020-04-22 | Paper |
| On the minimum consistent subset problem | 2020-01-16 | Paper |
| Computing maximum independent set on outerstring graphs and their relatives | 2020-01-16 | Paper |
| Monochromatic plane matchings in bicolored point set | 2019-11-21 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5240127 | 2019-10-24 | Paper |
| Minimizing the sum of distances to a server in a constraint network | 2019-10-18 | Paper |
| Approximability of covering cells with line segments | 2019-10-11 | Paper |
| Approximability of covering cells with line segments | 2019-08-13 | Paper |
| Unique Coverage with Rectangular Regions | 2019-04-24 | Paper |
| Bottleneck detour tree of points on a path | 2019-03-20 | Paper |
| Locating battery charging stations to facilitate almost shortest paths | 2019-02-08 | Paper |
| Bounded-hop communication networks | 2019-01-11 | Paper |
| Bottleneck bichromatic full Steiner trees | 2018-12-05 | Paper |
| Anagram-free chromatic number is not pathwidth-bounded | 2018-11-22 | Paper |
| Selecting and covering colored points | 2018-10-26 | Paper |
| Improved PTASs for convex barrier coverage | 2018-06-22 | Paper |
| Anagram-Free Chromatic Number is not Pathwidth-Bounded | 2018-02-05 | Paper |
| Strongly Connected Spanning Subgraph for Almost Symmetric Networks | 2018-01-31 | Paper |
| Dual power assignment via second Hamiltonian cycle | 2017-12-21 | Paper |
| Compatible Connectivity-Augmentation of Planar Disconnected Graphs | 2017-10-05 | Paper |
| Balanced line separators of unit disk graphs | 2017-09-22 | Paper |
| \(\delta\)-greedy \(t\)-spanner | 2017-09-22 | Paper |
| On the stretch factor of convex polyhedra whose vertices are (almost) on a sphere | 2017-03-30 | Paper |
| Switching to directional antennas with constant increase in radius and hop distance | 2017-03-27 | Paper |
| On the stretch factor of convex Delaunay graphs | 2017-03-09 | Paper |
| An optimal algorithm for computing angle-constrained spanners | 2017-03-09 | Paper |
| Gabriel Triangulations and Angle-Monotone Graphs: Local Routing and Recognition | 2017-02-21 | Paper |
| Approximating the bottleneck plane perfect matching of a point set | 2016-01-15 | Paper |
| On the Minimum Cost Range Assignment Problem | 2016-01-11 | Paper |
| Choice Is Hard | 2016-01-11 | Paper |
| Minimum Dominating Set Problem for Unit Disks Revisited | 2015-12-30 | Paper |
| Compatible connectivity augmentation of planar disconnected graphs | 2015-12-02 | Paper |
| On the Bounded-Hop Range Assignment Problem | 2015-10-30 | Paper |
| Bottleneck Steiner tree with bounded number of Steiner vertices | 2015-02-13 | Paper |
| Spiderman graph: visibility in urban regions | 2014-12-23 | Paper |
| APPROXIMATION ALGORITHMS FOR A VARIANT OF DISCRETE PIERCING SET PROBLEM FOR UNIT DISKS | 2014-12-01 | Paper |
| Private approximation of search problems | 2014-11-25 | Paper |
| Minimum weight Euclidean \(t\)-spanner is NP-hard | 2014-08-13 | Paper |
| Bounding the locality of distributed routing algorithms | 2014-07-23 | Paper |
| The Euclidean bottleneck Steiner path problem and other applications of \((\alpha ,\beta )\)-pair decomposition | 2014-03-25 | Paper |
| The euclidean bottleneck steiner path problem | 2014-03-24 | Paper |
| Bottleneck non-crossing matching in the plane | 2014-01-22 | Paper |
| Bounding the locality of distributed routing algorithms | 2013-06-25 | Paper |
| On the power of the semi-separated pair decomposition | 2013-04-29 | Paper |
| Stable roommates spanner | 2012-12-04 | Paper |
| MULTI COVER OF A POLYGON MINIMIZING THE SUM OF AREAS | 2012-11-23 | Paper |
| Bottleneck Non-crossing Matching in the Plane | 2012-09-25 | Paper |
| Unexplored Steiner Ratios in Geometric Networks | 2012-09-25 | Paper |
| On bounded degree plane strong geometric spanners | 2012-09-13 | Paper |
| The MST of symmetric disk graphs is light | 2012-06-08 | Paper |
| A generalized Winternitz theorem | 2012-01-13 | Paper |
| Connectivity guarantees for wireless networks with directional antennas | 2011-12-28 | Paper |
| Spanners of additively weighted point sets | 2011-08-23 | Paper |
| Switching to Directional Antennas with Constant Increase in Radius and Hop Distance | 2011-08-12 | Paper |
| On a family of strong geometric spanners that admit local routing strategies | 2011-07-20 | Paper |
| Location-oblivious distributed unit disk graph coloring | 2011-05-10 | Paper |
| Multi Cover of a Polygon Minimizing the Sum of Areas | 2011-02-20 | Paper |
| An Optimal Algorithm for Computing Angle-Constrained Spanners | 2010-12-09 | Paper |
| Computing the greedy spanner in near-quadratic time | 2010-09-27 | Paper |
| Improved Methods For Generating Quasi-gray Codes | 2010-06-22 | Paper |
| The MST of Symmetric Disk Graphs Is Light | 2010-06-22 | Paper |
| Communication-Efficient Construction of the Plane Localized Delaunay Graph | 2010-04-27 | Paper |
| Graph-Theoretic Concepts in Computer Science | 2010-01-12 | Paper |
| Private Approximation of Search Problems | 2009-11-06 | Paper |
| Spanners of Complete k-Partite Geometric Graphs | 2009-11-06 | Paper |
| On the Power of the Semi-Separated Pair Decomposition | 2009-10-20 | Paper |
| Minimum-cost load-balancing partitions | 2009-08-27 | Paper |
| Computing all large sums-of-pairs in \(\mathbb R^n\) and the discrete planar two-watchtower problem | 2009-07-09 | Paper |
| Matrix columns allocation problems | 2009-05-28 | Paper |
| Distinct distances in graph drawings | 2009-04-07 | Paper |
| A linear-space algorithm for distance preserving graph embedding | 2009-03-09 | Paper |
| On a Family of Strong Geometric Spanners That Admit Local Routing Strategies | 2009-02-17 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3601553 | 2009-02-10 | Paper |
| On the Stretch Factor of Convex Delaunay Graphs | 2009-01-29 | Paper |
| Single Vehicle Scheduling Problems on Path/Tree/Cycle Networks with Release and Handling Times | 2009-01-29 | Paper |
| Geometric spanners with small chromatic number | 2008-11-19 | Paper |
| Spanners of Additively Weighted Point Sets | 2008-07-15 | Paper |
| Computing the Greedy Spanner in Near-Quadratic Time | 2008-07-15 | Paper |
| Covering Points by Unit Disks of Fixed Location | 2008-05-27 | Paper |
| Spanners of Complete k-Partite Geometric Graphs | 2008-04-15 | Paper |
| Polynomial-time approximation schemes for piercing and covering with applications in wireless networks | 2008-03-13 | Paper |
| Geometric Spanners with Small Chromatic Number | 2008-02-20 | Paper |
| Location Oblivious Distributed Unit Disk Graph Coloring | 2007-11-15 | Paper |
| Power assignment in radio networks with two power levels | 2007-03-12 | Paper |
| The minimum-area spanning tree problem | 2006-10-25 | Paper |
| Algorithms and Data Structures | 2006-10-25 | Paper |
| On the Fermat-Weber center of a convex object | 2005-11-01 | Paper |
| Algorithm Theory - SWAT 2004 | 2005-09-07 | Paper |
| Geographic quorum system approximations | 2005-04-29 | Paper |
