| Publication | Date of Publication | Type |
|---|
On algorithmic complexity of imprecise spanners
Computational Geometry | 2023-11-23 | Paper |
Algorithmic results on locating-total domination in graphs
Discrete Applied Mathematics | 2023-05-11 | Paper |
On the plane angle-monotone graphs
Computational Geometry | 2021-12-15 | Paper |
Angle-monotonicity of Delaunay triangulation
Computational Geometry | 2021-01-07 | Paper |
Complexity results for \(k\)-domination and \(\alpha\)-domination problems and their variants.
(available as arXiv preprint) | 2019-12-18 | Paper |
Fault tolerancy of continuous Yao graph of angle less than 2/5
Information Processing Letters | 2019-06-04 | Paper |
(Weakly) self-approaching geometric graphs and spanners
Computational Geometry | 2018-12-07 | Paper |
Continuous Yao graphs
Computational Geometry | 2018-02-12 | Paper |
| Visualization of geometric spanner algorithms | 2018-01-30 | Paper |
Finding the best shortcut in a geometric network
Proceedings of the twenty-first annual symposium on Computational geometry | 2017-10-20 | Paper |
Angle-constrained spanners with angle at least \(\pi/3\)
Information Processing Letters | 2017-01-31 | Paper |
A lower bound for computing geometric spanners
Computational Geometry | 2016-04-12 | Paper |
Some properties of continuous Yao graph
Topics in Theoretical Computer Science | 2016-04-01 | Paper |
| Region-fault tolerant geometric spanners | 2014-12-18 | Paper |
Experimental study of geometric \(t\)-spanners
ACM Journal of Experimental Algorithmics | 2014-04-01 | Paper |
On the power of the semi-separated pair decomposition
Computational Geometry | 2013-04-29 | Paper |
Geometric spanners for weighted point sets
Algorithmica | 2011-08-16 | Paper |
Computing the greedy spanner in near-quadratic time
Algorithmica | 2010-09-27 | Paper |
Geometric Spanners for Weighted Point Sets
Lecture Notes in Computer Science | 2009-10-29 | Paper |
On the Power of the Semi-Separated Pair Decomposition
Lecture Notes in Computer Science | 2009-10-20 | Paper |
Region-fault tolerant geometric spanners
Discrete & Computational Geometry | 2009-05-06 | Paper |
Improving the Stretch Factor of a Geometric Network by Edge Augmentation
SIAM Journal on Computing | 2009-03-16 | Paper |
Computing the Greedy Spanner in Near-Quadratic Time
Algorithm Theory – SWAT 2008 | 2008-07-15 | Paper |
Experimental Study of Geometric t-Spanners: A Running Time Comparison
Experimental Algorithms | 2008-01-02 | Paper |
Algorithms – ESA 2005
Lecture Notes in Computer Science | 2006-06-27 | Paper |
