| Publication | Date of Publication | Type |
|---|
| Sparsity of weighted networks: measures and applications | 2023-12-12 | Paper |
| https://portal.mardi4nfdi.de/entity/Q6065423 | 2023-11-14 | Paper |
| Exact algorithms and hardness results for geometric red-blue hitting set problem | 2023-08-03 | Paper |
| On the construction of planar embedding for a class of orthogonal polyhedra | 2023-08-03 | Paper |
| Minimum consistent subset of simple graph classes | 2023-08-02 | Paper |
| Complexity and approximation for discriminating and identifying code problems in geometric setups | 2023-06-28 | Paper |
| Acrophobic guard watchtower problem | 2022-11-16 | Paper |
| Minimum consistent subset problem for trees | 2022-05-20 | Paper |
| Minimum consistent subset of simple graph classes | 2022-03-24 | Paper |
| On the geometric red-blue set cover problem | 2021-10-04 | Paper |
| Efficient Algorithm for Computing the Triangle Maximizing the Length of Its Smallest Side Inside a Convex Polygon | 2021-04-19 | Paper |
| The Euclidean \(k\)-supplier problem in \(I R^2\) | 2021-04-07 | Paper |
| Color-spanning localized query | 2021-03-09 | Paper |
| Variations of largest rectangle recognition amidst a bichromatic point set | 2020-09-17 | 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 |
| Constant work-space algorithms for facility location problems | 2020-06-29 | Paper |
| Color spanning objects: algorithms and hardness results | 2020-05-18 | Paper |
| Corrigendum to: ``Linear time algorithm to cover and hit a set of line segments optimally by two axis-parallel squares | 2020-01-16 | Paper |
| Range assignment of base-stations maximizing coverage area without interference | 2019-12-27 | Paper |
| Localized query: color spanning variations | 2019-10-10 | Paper |
| Partial Enclosure Range Searching | 2019-09-09 | Paper |
| Two-center of the Convex Hull of a Point Set: Dynamic Model, and Restricted Streaming Model | 2019-06-14 | Paper |
| Linear time algorithm to cover and hit a set of line segments optimally by two axis-parallel squares | 2019-04-23 | Paper |
| Covering segments with unit squares | 2019-03-20 | Paper |
| The Euclidean \(k\)-supplier problem in \(\mathbb R^2\) | 2018-12-07 | Paper |
| An optimal algorithm for plane matchings in multipartite geometric graphs | 2018-11-01 | Paper |
| Minimum spanning tree of line segments | 2018-10-04 | Paper |
| Minimum width color spanning annulus | 2018-05-15 | Paper |
| Geometric path problems with violations | 2018-04-06 | Paper |
| Optimal covering and hitting of line segments by two axis-parallel squares | 2017-10-23 | Paper |
| Covering segments with unit squares | 2017-09-22 | Paper |
| Faster approximation for maximum independent set on unit disk graph | 2017-08-16 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5275378 | 2017-07-13 | Paper |
| Rectilinear path problems in restricted memory setup | 2017-06-19 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2957525 | 2017-01-26 | Paper |
| Minimum Width Color Spanning Annulus | 2016-09-02 | Paper |
| Color Spanning Objects: Algorithms and Hardness Results | 2016-03-23 | Paper |
| Space-efficient algorithm for computing a centerpoint of a set of points in \(\mathbb{R}^2\) | 2016-01-21 | Paper |
| Minimum Dominating Set Problem for Unit Disks Revisited | 2015-12-30 | Paper |
| An Optimal Algorithm for Plane Matchings in Multipartite Geometric Graphs | 2015-10-30 | Paper |
| Rectilinear Path Problems in Restricted Memory Setup | 2015-02-19 | 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 |
| Prune-and-search with limited workspace | 2014-11-24 | Paper |
| In-place algorithms for computing a largest clique in geometric intersection graphs | 2014-09-12 | Paper |
| New variations of the maximum coverage facility location problem | 2014-07-27 | Paper |
| Diffuse reflection diameter and radius for convex-quadrilateralizable polygons | 2014-04-16 | Paper |
| Efficient multiple-precision integer division algorithm | 2014-04-14 | Paper |
| Some variations on constrained minimum enclosing circle problem | 2013-03-25 | Paper |
| An in-place min-max priority search tree | 2013-01-25 | Paper |
| In-Place Algorithms for Computing a Largest Clique in Geometric Intersection Graphs | 2012-07-16 | Paper |
| Recognition of largest empty orthoconvex polygon in a point set | 2012-03-27 | Paper |
| On the number of shortest descending paths on the surface of a convex terrain | 2011-07-29 | Paper |
| MEASURING THE QUALITY OF SURVEILLANCE IN A WIRELESS SENSOR NETWORK | 2011-07-14 | Paper |
| Some Variations on Constrained Minimum Enclosing Circle Problem | 2011-01-08 | Paper |
| Separating Multi-Color Points on a Plane with Fewest Axis-Parallel Lines | 2010-10-01 | Paper |
| Improved algorithm for the widest empty 1-corner corridor | 2010-08-20 | Paper |
| A new fast heuristic for labeling points | 2010-08-16 | Paper |
| Weighted broadcast in linear radio networks | 2010-04-19 | Paper |
| A Simple Algorithm for Approximate Partial Point Set Pattern Matching under Rigid Motion | 2010-02-09 | Paper |
| Chromatic distribution of \(k\)-nearest neighbors of a line segment in a planar colored point set | 2010-01-29 | Paper |
| Smallest \(k\)-point enclosing rectangle and square of arbitrary orientation | 2009-12-04 | Paper |
| SMALLEST COLOR-SPANNING OBJECT REVISITED | 2009-11-23 | Paper |
| Homogeneous 2-hop broadcast in 2D | 2009-11-16 | Paper |
| Constrained minimum enclosing circle with center on a query line segment | 2009-07-27 | Paper |
| Optimal algorithm for a special point-labeling problem | 2009-07-09 | Paper |
| Algorithms for Computing Diffuse Reflection Paths in Polygons | 2009-02-24 | Paper |
| Improved Algorithm for a Widest 1-Corner Corridor | 2009-02-24 | 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 |
| A generalization of magic squares with applications to digital halftoning | 2008-04-03 | Paper |
| Weighted Broadcast in Linear Radio Networks | 2008-01-04 | Paper |
| Constrained Minimum Enclosing Circle with Center on a Query Line Segment | 2007-09-05 | Paper |
| Computational Science and Its Applications – ICCSA 2004 | 2007-07-19 | Paper |
| IMPROVED ALGORITHM FOR MINIMUM COST RANGE ASSIGNMENT PROBLEM FOR LINEAR RADIO NETWORKS | 2007-06-05 | Paper |
| Shortest monotone descent path problem in polyhedral terrain | 2007-04-18 | 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 |
| Simple algorithms for partial point set pattern matching under rigid motion | 2006-08-16 | Paper |
| Range assignment for energy efficient broadcasting in linear radio networks | 2006-03-24 | Paper |
| Algorithms and Computation | 2005-12-22 | Paper |
| STACS 2005 | 2005-12-02 | Paper |
| Distributed Computing - IWDC 2004 | 2005-08-12 | Paper |
| Triangular range counting query in 2D and its application in finding \(k\) nearest neighbors of a line segment | 2004-11-18 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3046479 | 2004-08-12 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3046483 | 2004-08-12 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4470502 | 2004-07-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4437495 | 2003-12-02 | Paper |
| On finding an empty staircase polygon of largest area (width) in a planar point-set | 2003-08-25 | Paper |
| Largest empty rectangle among a point set | 2003-08-13 | Paper |
| An efficient \(k\) nearest neighbors searching algorithm for a query line. | 2003-05-25 | Paper |
| Translating a convex polyhedron over monotone polyhedra | 2003-03-10 | Paper |
| Shattering a set of objects in 2D | 2002-08-29 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2766837 | 2002-07-22 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2728901 | 2001-11-06 | Paper |
| Dynamically maintaining the widest \(k\)-dense corridor | 2001-08-20 | Paper |
| Safety Zone Problem | 2000-12-19 | Paper |
| Efficient Computation of Rectilinear Geodesic Voronoi Neighbor in the Presence of Obstacles | 1998-10-06 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3359799 | 1990-01-01 | Paper |
