| Publication | Date of Publication | Type |
|---|
Online geometric covering and piercing
Algorithmica | 2024-10-07 | Paper |
| Online dominating set and coloring | 2024-09-16 | Paper |
Online class cover problem
Computational Geometry | 2024-09-10 | Paper |
Online hitting of unit balls and hypercubes in \(\mathbb{R}^d\) using points from \(\mathbb{Z}^d\)
Theoretical Computer Science | 2024-03-05 | Paper |
Hitting geometric objects online via points in \(\mathbb{Z}^d\)
Lecture Notes in Computer Science | 2023-08-10 | Paper |
Geometric dominating-set and set-cover via local-search
Computational Geometry | 2023-07-12 | Paper |
Geometric dominating-set and set-cover via local-search
Computational Geometry | 2023-07-12 | Paper |
scientific article; zbMATH DE number 7378687 (Why is no real title available?)
(available as arXiv preprint) | 2021-08-04 | Paper |
| scientific article; zbMATH DE number 7376034 (Why is no real title available?) | 2021-07-28 | Paper |
Convex-straight-skeleton Voronoi diagrams for segments and convex polygons
Algorithmica | 2021-06-30 | Paper |
Variations of largest rectangle recognition amidst a bichromatic point set
Discrete Applied Mathematics | 2020-09-17 | Paper |
| Guarding polyhedral terrain by \(k\)-watchtowers | 2020-07-07 | Paper |
Constant work-space algorithms for facility location problems
Discrete Applied Mathematics | 2020-06-29 | Paper |
| A lower bound on the growth constant of polyaboloes on the Tetrakis lattice | 2020-02-24 | Paper |
Range assignment of base-stations maximizing coverage area without interference
Theoretical Computer Science | 2019-12-27 | Paper |
Circular separation dimension of a subclass of planar graphs
(available as arXiv preprint) | 2018-12-10 | Paper |
| Circular separation dimension of a subclass of planar graphs | 2018-12-10 | Paper |
| Computing convex-straight-skeleton Voronoi diagrams for segments and convex polygons | 2018-10-04 | Paper |
Rectilinear path problems in restricted memory setup
Discrete Applied Mathematics | 2017-06-19 | Paper |
Voronoi diagram for convex polygonal sites with convex polygon-offset distance function
Algorithms and Discrete Applied Mathematics | 2017-04-07 | Paper |
Demand hitting and covering of intervals
Algorithms and Discrete Applied Mathematics | 2017-04-07 | Paper |
| Minimum enclosing circle with few extra variables | 2017-01-26 | Paper |
Rectilinear path problems in restricted memory setup
Algorithms and Discrete Applied Mathematics | 2015-02-19 | Paper |
Approximation algorithms for maximum independent set of a unit disk graph
Information Processing Letters | 2014-12-15 | Paper |
APPROXIMATION ALGORITHMS FOR A VARIANT OF DISCRETE PIERCING SET PROBLEM FOR UNIT DISKS
International Journal of Computational Geometry & Applications | 2014-12-01 | Paper |
Prune-and-search with limited workspace
Journal of Computer and System Sciences | 2014-11-24 | Paper |
Back-up 2-center on a path/tree/cycle/unicycle
Lecture Notes in Computer Science | 2014-09-26 | Paper |
In-place algorithms for computing a largest clique in geometric intersection graphs
Discrete Applied Mathematics | 2014-09-12 | Paper |
An in-place min-max priority search tree
Computational Geometry | 2013-01-25 | Paper |
In-place algorithms for computing a largest clique in geometric intersection graphs
Frontiers in Algorithmics and Algorithmic Aspects in Information and Management | 2012-07-16 | Paper |
