| Publication | Date of Publication | Type |
|---|
Piercing diametral disks induced by edges of maximum spanning trees
Journal of Graph Algorithms and Applications | 2024-11-12 | Paper |
Dynamic Euclidean bottleneck matching
Theoretical Computer Science | 2024-10-01 | Paper |
| Geometric spanning trees minimizing the Wiener index | 2024-04-02 | Paper |
Geometric spanning trees minimizing the Wiener index
Lecture Notes in Computer Science | 2024-01-16 | Paper |
Piercing diametral disks induced by edges of maximum spanning trees
WALCOM: Algorithms and Computation | 2023-11-24 | Paper |
| Planar Bichromatic Bottleneck Spanning Trees | 2023-02-07 | Paper |
Piercing pairwise intersecting geodesic disks by five points
Computational Geometry | 2022-11-16 | Paper |
A linear-time algorithm for minimum \(k\)-hop dominating set of a cactus graph
Discrete Applied Mathematics | 2022-08-24 | Paper |
\( \delta \)-greedy \(t\)-spanner
Computational Geometry | 2021-12-15 | Paper |
Approximating maximum diameter-bounded subgraph in unit disk graphs
Discrete & Computational Geometry | 2021-11-18 | Paper |
Minimizing total interference in asymmetric sensor networks
Theoretical Computer Science | 2021-10-06 | Paper |
Planar bichromatic bottleneck spanning trees
(available as arXiv preprint) | 2021-09-07 | Paper |
Minimizing total interference in asymmetric sensor networks
Algorithms for Sensor Systems | 2021-07-08 | Paper |
| Approximating maximum diameter-bounded subgraph in unit disk graphs | 2020-08-18 | Paper |
Monochromatic plane matchings in bicolored point set
Information Processing Letters | 2019-11-21 | Paper |
Bottleneck bichromatic full Steiner trees
Information Processing Letters | 2018-12-05 | Paper |
Strongly connected spanning subgraph for almost symmetric networks
International Journal of Computational Geometry & Applications | 2018-01-31 | Paper |
Dual power assignment via second Hamiltonian cycle
Journal of Computer and System Sciences | 2017-12-21 | Paper |
Approximating the bottleneck plane perfect matching of a point set
Computational Geometry | 2016-01-15 | Paper |
The Euclidean bottleneck full Steiner tree problem
Algorithmica | 2015-03-02 | Paper |
Bottleneck Steiner tree with bounded number of Steiner vertices
Journal of Discrete Algorithms | 2015-02-13 | Paper |
The Euclidean bottleneck Steiner path problem and other applications of \((\alpha ,\beta )\)-pair decomposition
Discrete & Computational Geometry | 2014-03-25 | Paper |
The Euclidean bottleneck Steiner path problem
Proceedings of the twenty-seventh annual symposium on Computational geometry | 2014-03-24 | Paper |
On the Euclidean bottleneck full Steiner tree problem
Proceedings of the twenty-seventh annual symposium on Computational geometry | 2014-03-24 | Paper |
Bottleneck non-crossing matching in the plane
Computational Geometry | 2014-01-22 | Paper |
Multi cover of a polygon minimizing the sum of areas
International Journal of Computational Geometry & Applications | 2012-11-23 | Paper |
Bottleneck non-crossing matching in the plane
Algorithms – ESA 2012 | 2012-09-25 | Paper |
The MST of symmetric disk graphs is light
Computational Geometry | 2012-06-08 | Paper |
Multi cover of a polygon minimizing the sum of areas
WALCOM: Algorithms and Computation | 2011-02-20 | Paper |
The MST of symmetric disk graphs is light
Lecture Notes in Computer Science | 2010-06-22 | Paper |
Improved bounds on the average distance to the Fermat-Weber center of a convex object
Information Processing Letters | 2010-06-16 | Paper |
