| Publication | Date of Publication | Type |
|---|
| On the complexity of approximating and illuminating three-dimensional convex polyhedra | 2022-12-16 | Paper |
| Generating sparse spanners for weighted graphs | 2022-12-09 | Paper |
| Finding all weakly-visible chords of a polygon in linear time | 2022-12-09 | Paper |
| Vertex-edge domination in unit disk graphs | 2022-08-04 | Paper |
| On \(d\)-distance \(m\)-tuple \((\ell,r)\)-domination in graphs | 2021-12-14 | Paper |
| Roman Domination in Convex Bipartite Graphs | 2021-11-17 | Paper |
| Constrained k-Center Problem on a Convex Polygon | 2021-04-20 | Paper |
| The Euclidean \(k\)-supplier problem in \(I R^2\) | 2021-04-07 | Paper |
| Liar's domination in unit disk graphs | 2020-10-22 | Paper |
| Liar's dominating set problem on unit disk graphs | 2020-09-17 | Paper |
| Vertex-edge domination in unit disk graphs | 2020-07-21 | Paper |
| The maximum distance-\(d\) independent set problem on unit disk graphs | 2020-07-07 | Paper |
| Guarding polyhedral terrain by \(k\)-watchtowers | 2020-07-07 | Paper |
| Efficient independent set approximation in unit disk graphs | 2020-05-18 | Paper |
| On $d$-distance $m$-tuple ($\ell, r$)-domination in graphs | 2019-07-26 | Paper |
| DRESS: dimensionality reduction for efficient sequence search | 2019-01-29 | Paper |
| Discrete unit square cover problem | 2019-01-09 | Paper |
| The Euclidean \(k\)-supplier problem in \(\mathbb R^2\) | 2018-12-07 | Paper |
| Liar's dominating set in unit disk graphs | 2018-10-04 | Paper |
| Planar spanners and approximate shortest path queries among obstacles in the plane | 2017-12-05 | Paper |
| Just-in-Time Analytics on Large File Systems | 2017-07-12 | Paper |
| A lower bound for approximating the geometric minimum weight matching | 2016-06-16 | Paper |
| Minimum Dominating Set Problem for Unit Disks Revisited | 2015-12-30 | Paper |
| Unit disk cover problem in 2D | 2015-08-18 | Paper |
| Approximation algorithms for maximum independent set of a unit disk graph | 2014-12-15 | Paper |
| APPROXIMATION ALGORITHMS FOR A VARIANT OF DISCRETE PIERCING SET PROBLEM FOR UNIT DISKS | 2014-12-01 | Paper |
| ON THE DISCRETE UNIT DISK COVER PROBLEM | 2013-06-24 | Paper |
| Algorithms for computing best coverage path in the presence of obstacles in a sensor field | 2012-09-13 | Paper |
| Mining Chains of Relations | 2012-02-09 | Paper |
| On the Discrete Unit Disk Cover Problem | 2011-02-20 | Paper |
| Improved algorithm for the widest empty 1-corner corridor | 2010-08-20 | Paper |
| AN IMPROVED LINE-SEPARABLE ALGORITHM FOR DISCRETE UNIT DISK COVER | 2010-05-19 | Paper |
| Weighted broadcast in linear radio networks | 2010-04-19 | Paper |
| Homogeneous 2-hop broadcast in 2D | 2009-11-16 | Paper |
| Improved Algorithm for a Widest 1-Corner Corridor | 2009-02-24 | Paper |
| Computing Best Coverage Path in the Presence of Obstacles in a Sensor Field | 2009-02-17 | Paper |
| Homogeneous 2-Hops Broadcast in 2D | 2009-02-03 | Paper |
| VARIATIONS OF BASE-STATION PLACEMENT PROBLEM ON THE BOUNDARY OF A CONVEX REGION | 2008-09-25 | Paper |
| Weighted Broadcast in Linear Radio Networks | 2008-01-04 | Paper |
| IMPROVED ALGORITHM FOR MINIMUM COST RANGE ASSIGNMENT PROBLEM FOR LINEAR RADIO NETWORKS | 2007-06-05 | Paper |
| Efficient algorithm for placing a given number of base stations to cover a convex region | 2007-01-09 | Paper |
| Distributed Computing – IWDC 2005 | 2006-10-10 | Paper |
| Range assignment for energy efficient broadcasting in linear radio networks | 2006-03-24 | Paper |
| Distributed Computing - IWDC 2004 | 2005-08-12 | Paper |
| Optimally computing a shortest weakly visible line segment inside a simple polygon | 2002-09-03 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4547546 | 2002-08-21 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4234097 | 2001-08-28 | Paper |
| Lower bounds for computing geometric spanners and approximate shortest paths | 2001-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4268440 | 1999-10-31 | Paper |
| On the complexity of approximating Euclidean traveling salesman tours and minimum spanning trees | 1998-11-10 | Paper |
| On the complexity of optimization problems for 3-dimensional convex polyhedra and decision trees | 1997-11-09 | Paper |
| A Fast Algorithm for Constructing Sparse Euclidean Spanners | 1997-09-10 | Paper |
| LR-visibility in polygons | 1997-09-04 | Paper |
| CONSTRUCTING DEGREE-3 SPANNERS WITH OTHER SPARSENESS PROPERTIES | 1996-11-26 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4886051 | 1996-11-04 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4698690 | 1995-05-11 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4037425 | 1993-05-18 | Paper |
| Minimum vertex hulls for polyhedral domains | 1993-01-16 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3355260 | 1990-01-01 | Paper |
