| Publication | Date of Publication | Type |
|---|
| Maximum bipartite subgraphs of geometric intersection graphs | 2024-06-10 | Paper |
| Constant delay lattice train schedules | 2023-12-11 | Paper |
| The balanced connected subgraph problem for geometric intersection graphs | 2022-08-25 | Paper |
| The balanced connected subgraph problem | 2022-08-04 | Paper |
| Collision-free routing problem with restricted L-path | 2022-08-04 | Paper |
| Balanced connected graph partition | 2022-03-24 | Paper |
| Linear-size planar Manhattan network for convex point sets | 2021-12-15 | Paper |
| Efficient Algorithm for Computing the Triangle Maximizing the Length of Its Smallest Side Inside a Convex Polygon | 2021-04-19 | Paper |
| Approximate Shortest Paths in Polygons with Violations | 2021-02-11 | Paper |
| Optimal facility location problem on polyhedral terrains using descending paths | 2020-11-06 | Paper |
| Problems on One Way Road Networks | 2020-11-05 | Paper |
| Maximum bipartite subgraph of geometric intersection graphs | 2020-07-22 | Paper |
| Constant work-space algorithms for facility location problems | 2020-06-29 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5111741 | 2020-05-27 | Paper |
| Balanced connected subgraph problem in geometric intersection graphs | 2020-05-13 | Paper |
| Approximate shortest paths in polygons with violations | 2020-05-13 | 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 |
| Finding axis-parallel rectangles of fixed perimeter or area containing the largest number of points | 2019-10-25 | Paper |
| The balanced connected subgraph problem | 2019-10-10 | Paper |
| Maximum Bipartite Subgraph of Geometric Intersection Graphs | 2019-09-09 | Paper |
| Two-center of the Convex Hull of a Point Set: Dynamic Model, and Restricted Streaming Model | 2019-06-14 | Paper |
| Helly-Type Theorems in Property Testing | 2019-04-24 | 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 |
| Collision-Free Routing problem with Restricted L-Path | 2018-09-06 | 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 |
| Rectilinear path problems in restricted memory setup | 2017-06-19 | Paper |
| On representing a simple polygon perceivable to a blind person | 2017-01-31 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2957525 | 2017-01-26 | Paper |
| Minimum Width Color Spanning Annulus | 2016-09-02 | Paper |
| Space-efficient algorithm for computing a centerpoint of a set of points in \(\mathbb{R}^2\) | 2016-01-21 | Paper |
| Maximal and Maximum Transitive Relation Contained in a Given Binary Relation | 2015-10-29 | Paper |
| Time-Space Tradeoffs for Dynamic Programming Algorithms in Trees and Bounded Treewidth Graphs | 2015-10-29 | Paper |
| Rectilinear Path Problems in Restricted Memory Setup | 2015-02-19 | Paper |
| Prune-and-search with limited workspace | 2014-11-24 | Paper |
| Back-Up 2-Center on a Path/Tree/Cycle/Unicycle | 2014-09-26 | Paper |
| In-place algorithms for computing a largest clique in geometric intersection graphs | 2014-09-12 | Paper |
| Helly-Type Theorems in Property Testing | 2014-03-31 | Paper |
| On the Construction of Generalized Voronoi Inverse of a Rectangular Tessellation | 2013-12-17 | Paper |
| Tight analysis of shortest path convergecast in wireless sensor networks | 2013-07-30 | Paper |
| Localized geometric query problems | 2013-01-25 | Paper |
| Near optimal algorithm for the shortest descending path on the surface of a convex terrain | 2012-09-13 | Paper |
| Base station placement on boundary of a convex polygon | 2012-07-26 | Paper |
| In-Place Algorithms for Computing a Largest Clique in Geometric Intersection Graphs | 2012-07-16 | Paper |
| On the number of shortest descending paths on the surface of a convex terrain | 2011-07-29 | Paper |
| A new fast heuristic for labeling points | 2010-08-16 | Paper |
| Fast computation of smallest enclosing circle with center on a query line segment | 2010-06-09 | Paper |
| Approximation algorithms for shortest descending paths in terrains | 2010-05-25 | Paper |
| Largest empty circle centered on a query line | 2010-05-25 | Paper |
| GUARD PLACEMENT FOR MAXIMIZING L-VISIBILITY EXTERIOR TO A CONVEX POLYGON | 2010-02-01 | 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 |
| Optimal Guard Placement Problem Under L-Visibility | 2009-01-27 | Paper |
| VARIATIONS OF BASE-STATION PLACEMENT PROBLEM ON THE BOUNDARY OF A CONVEX REGION | 2008-09-25 | Paper |
| Guarding Exterior Region of a Simple Polygon | 2008-03-25 | 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 |
| Shortest monotone descent path problem in polyhedral terrain | 2007-04-18 | Paper |
| STACS 2005 | 2005-12-02 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3046483 | 2004-08-12 | Paper |
