| Publication | Date of Publication | Type |
|---|
Semi-total domination in unit disk graphs and general graphs
Discrete Applied Mathematics | 2026-01-28 | Paper |
| (Independent) Roman domination parameterized by distance to cluster | 2025-11-14 | Paper |
Total Roman domination and total domination in unit disk graphs
Communications in Combinatorics and Optimization | 2025-10-13 | Paper |
Dispersion problem on a convex polygon
Information Processing Letters | 2024-09-11 | Paper |
| Semi-total domination in unit disk graphs | 2024-05-31 | Paper |
On the complexity of approximating and illuminating three-dimensional convex polyhedra
Lecture Notes in Computer Science | 2022-12-16 | Paper |
Generating sparse spanners for weighted graphs
SWAT 90 | 2022-12-09 | Paper |
Finding all weakly-visible chords of a polygon in linear time
Algorithm Theory — SWAT '94 | 2022-12-09 | Paper |
Vertex-edge domination in unit disk graphs
Discrete Applied Mathematics | 2022-08-04 | Paper |
On \(d\)-distance \(m\)-tuple \((\ell,r)\)-domination in graphs
Information Processing Letters | 2021-12-14 | Paper |
| Roman Domination in Convex Bipartite Graphs | 2021-11-17 | Paper |
Constrained k-center problem on a convex polygon
International Journal of Foundations of Computer Science | 2021-04-20 | Paper |
The Euclidean \(k\)-supplier problem in \(I R^2\)
Operations Research Letters | 2021-04-07 | Paper |
Liar's domination in unit disk graphs
Theoretical Computer Science | 2020-10-22 | Paper |
Liar's dominating set problem on unit disk graphs
Discrete Applied Mathematics | 2020-09-17 | Paper |
Vertex-edge domination in unit disk graphs
Algorithms and Discrete Applied Mathematics | 2020-07-21 | 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 |
Efficient independent set approximation in unit disk graphs
Discrete Applied Mathematics | 2020-05-18 | Paper |
On d-distance m-tuple (\ell, r)-domination in graphs
(available as arXiv preprint) | 2019-07-26 | Paper |
DRESS: dimensionality reduction for efficient sequence search
Data Mining and Knowledge Discovery | 2019-01-29 | Paper |
Discrete unit square cover problem
Discrete Mathematics, Algorithms and Applications | 2019-01-09 | Paper |
| The Euclidean \(k\)-supplier problem in \(\mathbb R^2\) | 2018-12-07 | Paper |
| Liar's dominating set in unit disk graphs | 2018-10-04 | Paper |
Planar spanners and approximate shortest path queries among obstacles in the plane
Algorithms — ESA '96 | 2017-12-05 | Paper |
Just-in-Time Analytics on Large File Systems
IEEE Transactions on Computers | 2017-07-12 | Paper |
Improved algorithm for maximum independent set on unit disk graph
Algorithms and Discrete Applied Mathematics | 2016-03-23 | Paper |
Minimum dominating set problem for unit disks revisited
International Journal of Computational Geometry & Applications | 2015-12-30 | Paper |
Unit disk cover problem in 2D
Journal of Discrete Algorithms | 2015-08-18 | 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 |
On the discrete unit disk cover problem
International Journal of Computational Geometry & Applications | 2013-06-24 | Paper |
Mining chains of relations
Intelligent Systems Reference Library | 2012-02-09 | Paper |
On the discrete unit disk cover problem
WALCOM: Algorithms and Computation | 2011-02-20 | Paper |
Improved algorithm for the widest empty 1-corner corridor
Information Processing Letters | 2010-08-20 | Paper |
An improved line-separable algorithm for discrete unit disk cover
Discrete Mathematics, Algorithms and Applications | 2010-05-19 | Paper |
Weighted broadcast in linear radio networks
Information Processing Letters | 2010-04-19 | Paper |
Homogeneous 2-hop broadcast in 2D
Computational Geometry | 2009-11-16 | Paper |
Improved Algorithm for a Widest 1-Corner Corridor
WALCOM: Algorithms and Computation | 2009-02-24 | Paper |
Computing Best Coverage Path in the Presence of Obstacles in a Sensor Field
Lecture Notes in Computer Science | 2009-02-17 | Paper |
Homogeneous 2-Hops Broadcast in 2D
Computational Science and Its Applications - ICCSA 2006 | 2009-02-03 | Paper |
VARIATIONS OF BASE-STATION PLACEMENT PROBLEM ON THE BOUNDARY OF A CONVEX REGION
International Journal of Foundations of Computer Science | 2008-09-25 | Paper |
Weighted Broadcast in Linear Radio Networks
Algorithmic Aspects in Information and Management | 2008-01-04 | Paper |
IMPROVED ALGORITHM FOR MINIMUM COST RANGE ASSIGNMENT PROBLEM FOR LINEAR RADIO NETWORKS
International Journal of Foundations of Computer Science | 2007-06-05 | Paper |
Efficient algorithm for placing a given number of base stations to cover a convex region
Journal of Parallel and Distributed Computing | 2007-01-09 | Paper |
Distributed Computing – IWDC 2005
Lecture Notes in Computer Science | 2006-10-10 | Paper |
Range assignment for energy efficient broadcasting in linear radio networks
Theoretical Computer Science | 2006-03-24 | Paper |
Distributed Computing - IWDC 2004
Lecture Notes in Computer Science | 2005-08-12 | Paper |
Optimally computing a shortest weakly visible line segment inside a simple polygon
Computational Geometry | 2002-09-03 | Paper |
| scientific article; zbMATH DE number 1786224 (Why is no real title available?) | 2002-08-21 | Paper |
| scientific article; zbMATH DE number 1263225 (Why is no real title available?) | 2001-08-28 | Paper |
| scientific article; zbMATH DE number 1354127 (Why is no real title available?) | 1999-10-31 | Paper |
On the complexity of approximating Euclidean traveling salesman tours and minimum spanning trees
Algorithmica | 1998-11-10 | Paper |
On the complexity of optimization problems for 3-dimensional convex polyhedra and decision trees
Computational Geometry | 1997-11-09 | Paper |
A Fast Algorithm for Constructing Sparse Euclidean Spanners
International Journal of Computational Geometry & Applications | 1997-09-10 | Paper |
LR-visibility in polygons
Computational Geometry | 1997-09-04 | Paper |
CONSTRUCTING DEGREE-3 SPANNERS WITH OTHER SPARSENESS PROPERTIES
International Journal of Foundations of Computer Science | 1996-11-26 | Paper |
| scientific article; zbMATH DE number 910877 (Why is no real title available?) | 1996-11-04 | Paper |
| scientific article; zbMATH DE number 753969 (Why is no real title available?) | 1995-05-11 | Paper |
| scientific article; zbMATH DE number 177554 (Why is no real title available?) | 1993-05-18 | Paper |
Minimum vertex hulls for polyhedral domains
Theoretical Computer Science | 1993-01-16 | Paper |
| scientific article; zbMATH DE number 4206037 (Why is no real title available?) | 1990-01-01 | Paper |
Improved Total Domination and Total Roman Domination in Unit Disk Graphs
(available as arXiv preprint) | N/A | Paper |
