| Publication | Date of Publication | Type |
|---|
Half-guarding weakly-visible polygons and terrains
| 2024-09-12 | Paper |
Efficient computation of rectilinear geodesic Voronoi neighbor in presence of obstacles
| 2024-07-05 | Paper |
Sparsity of weighted networks: measures and applications
Information Sciences | 2023-12-12 | Paper |
Discriminating Codes in Geometric Setups
| 2023-11-14 | Paper |
Exact algorithms and hardness results for geometric red-blue hitting set problem
Frontiers of Algorithmic Wisdom | 2023-08-03 | Paper |
On the construction of planar embedding for a class of orthogonal polyhedra
Lecture Notes in Computer Science | 2023-08-03 | Paper |
Minimum consistent subset of simple graph classes
Discrete Applied Mathematics | 2023-08-02 | Paper |
Complexity and approximation for discriminating and identifying code problems in geometric setups
Algorithmica | 2023-06-28 | Paper |
Acrophobic guard watchtower problem
Computational Geometry | 2022-11-16 | Paper |
Minimum consistent subset problem for trees
| 2022-05-20 | Paper |
Minimum consistent subset of simple graph classes
| 2022-03-24 | Paper |
On the geometric red-blue set cover problem
| 2021-10-04 | Paper |
Efficient algorithm for computing the triangle maximizing the length of its smallest side inside a convex polygon
International Journal of Foundations of Computer Science | 2021-04-19 | Paper |
The Euclidean \(k\)-supplier problem in \(I R^2\)
Operations Research Letters | 2021-04-07 | Paper |
Color-spanning localized query
Theoretical Computer Science | 2021-03-09 | Paper |
Variations of largest rectangle recognition amidst a bichromatic point set
Discrete Applied Mathematics | 2020-09-17 | 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 |
Constant work-space algorithms for facility location problems
Discrete Applied Mathematics | 2020-06-29 | Paper |
Color spanning objects: algorithms and hardness results
Discrete Applied Mathematics | 2020-05-18 | Paper |
Corrigendum to: ``Linear time algorithm to cover and hit a set of line segments optimally by two axis-parallel squares
Theoretical Computer Science | 2020-01-16 | Paper |
Range assignment of base-stations maximizing coverage area without interference
Theoretical Computer Science | 2019-12-27 | Paper |
Localized query: color spanning variations
| 2019-10-10 | Paper |
Partial enclosure range searching
International Journal of Computational Geometry & Applications | 2019-09-09 | Paper |
Two-center of the convex hull of a point set: dynamic model, and restricted streaming model
Fundamenta Informaticae | 2019-06-14 | Paper |
Linear time algorithm to cover and hit a set of line segments optimally by two axis-parallel squares
Theoretical Computer Science | 2019-04-23 | Paper |
Covering segments with unit squares
Computational Geometry | 2019-03-20 | Paper |
The Euclidean \(k\)-supplier problem in \(\mathbb R^2\)
| 2018-12-07 | Paper |
An optimal algorithm for plane matchings in multipartite geometric graphs
Computational Geometry | 2018-11-01 | Paper |
Minimum spanning tree of line segments
| 2018-10-04 | Paper |
Minimum width color spanning annulus
Theoretical Computer Science | 2018-05-15 | Paper |
Geometric path problems with violations
Algorithmica | 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
Lecture Notes in Computer Science | 2017-09-22 | Paper |
Faster approximation for maximum independent set on unit disk graph
Information Processing Letters | 2017-08-16 | Paper |
On density, threshold and emptiness queries for intervals in the streaming model
| 2017-07-13 | Paper |
Rectilinear path problems in restricted memory setup
Discrete Applied Mathematics | 2017-06-19 | Paper |
Minimum enclosing circle with few extra variables
| 2017-01-26 | Paper |
Minimum width color spanning annulus
Lecture Notes in Computer Science | 2016-09-02 | Paper |
Color spanning objects: algorithms and hardness results
Algorithms and Discrete Applied Mathematics | 2016-03-23 | Paper |
Space-efficient algorithm for computing a centerpoint of a set of points in \(\mathbb{R}^2\)
Theoretical Computer Science | 2016-01-21 | Paper |
Minimum dominating set problem for unit disks revisited
International Journal of Computational Geometry & Applications | 2015-12-30 | Paper |
An optimal algorithm for plane matchings in multipartite geometric graphs
Lecture Notes in Computer Science | 2015-10-30 | 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 |
In-place algorithms for computing a largest clique in geometric intersection graphs
Discrete Applied Mathematics | 2014-09-12 | Paper |
New variations of the maximum coverage facility location problem
European Journal of Operational Research | 2014-07-27 | Paper |
Diffuse reflection diameter and radius for convex-quadrilateralizable polygons
Discrete Applied Mathematics | 2014-04-16 | Paper |
Efficient multiple-precision integer division algorithm
Information Processing Letters | 2014-04-14 | Paper |
Some variations on constrained minimum enclosing circle problem
Journal of Combinatorial Optimization | 2013-03-25 | 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 |
Recognition of largest empty orthoconvex polygon in a point set
Information Processing Letters | 2012-03-27 | Paper |
On the number of shortest descending paths on the surface of a convex terrain
Journal of Discrete Algorithms | 2011-07-29 | Paper |
Measuring the quality of surveillance in a wireless sensor network
International Journal of Foundations of Computer Science | 2011-07-14 | Paper |
Some variations on constrained minimum enclosing circle problem
Combinatorial Optimization and Applications | 2011-01-08 | Paper |
Separating multi-color points on a plane with fewest axis-parallel lines
Fundamenta Informaticae | 2010-10-01 | Paper |
Improved algorithm for the widest empty 1-corner corridor
Information Processing Letters | 2010-08-20 | Paper |
A new fast heuristic for labeling points
Information Processing Letters | 2010-08-16 | Paper |
Weighted broadcast in linear radio networks
Information Processing Letters | 2010-04-19 | Paper |
A simple algorithm for approximate partial point set pattern matching under rigid motion
WALCOM: Algorithms and Computation | 2010-02-09 | Paper |
Chromatic distribution of \(k\)-nearest neighbors of a line segment in a planar colored point set
Information Processing Letters | 2010-01-29 | Paper |
Smallest \(k\)-point enclosing rectangle and square of arbitrary orientation
Information Processing Letters | 2009-12-04 | Paper |
SMALLEST COLOR-SPANNING OBJECT REVISITED
International Journal of Computational Geometry & Applications | 2009-11-23 | Paper |
Homogeneous 2-hop broadcast in 2D
Computational Geometry | 2009-11-16 | Paper |
Constrained minimum enclosing circle with center on a query line segment
Computational Geometry | 2009-07-27 | Paper |
Optimal algorithm for a special point-labeling problem
Information Processing Letters | 2009-07-09 | Paper |
Algorithms for Computing Diffuse Reflection Paths in Polygons
WALCOM: Algorithms and Computation | 2009-02-24 | Paper |
Improved Algorithm for a Widest 1-Corner Corridor
WALCOM: Algorithms and Computation | 2009-02-24 | 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 |
A generalization of magic squares with applications to digital halftoning
Theory of Computing Systems | 2008-04-03 | Paper |
Weighted Broadcast in Linear Radio Networks
Algorithmic Aspects in Information and Management | 2008-01-04 | Paper |
Constrained Minimum Enclosing Circle with Center on a Query Line Segment
Lecture Notes in Computer Science | 2007-09-05 | Paper |
Computational Science and Its Applications – ICCSA 2004
Lecture Notes in Computer Science | 2007-07-19 | Paper |
IMPROVED ALGORITHM FOR MINIMUM COST RANGE ASSIGNMENT PROBLEM FOR LINEAR RADIO NETWORKS
International Journal of Foundations of Computer Science | 2007-06-05 | Paper |
Shortest monotone descent path problem in polyhedral terrain
Computational Geometry | 2007-04-18 | 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 |
Simple algorithms for partial point set pattern matching under rigid motion
Pattern Recognition | 2006-08-16 | Paper |
Range assignment for energy efficient broadcasting in linear radio networks
Theoretical Computer Science | 2006-03-24 | Paper |
Algorithms and Computation
Lecture Notes in Computer Science | 2005-12-22 | Paper |
STACS 2005
Lecture Notes in Computer Science | 2005-12-02 | Paper |
Distributed Computing - IWDC 2004
Lecture Notes in Computer Science | 2005-08-12 | Paper |
Triangular range counting query in 2D and its application in finding \(k\) nearest neighbors of a line segment
Computational Geometry | 2004-11-18 | Paper |
scientific article; zbMATH DE number 2089214 (Why is no real title available?)
| 2004-08-12 | Paper |
scientific article; zbMATH DE number 2089210 (Why is no real title available?)
| 2004-08-12 | Paper |
scientific article; zbMATH DE number 2077118 (Why is no real title available?)
| 2004-07-01 | Paper |
scientific article; zbMATH DE number 2011843 (Why is no real title available?)
| 2003-12-02 | Paper |
On finding an empty staircase polygon of largest area (width) in a planar point-set
Computational Geometry | 2003-08-25 | Paper |
Largest empty rectangle among a point set
Journal of Algorithms | 2003-08-13 | Paper |
An efficient \(k\) nearest neighbors searching algorithm for a query line.
Theoretical Computer Science | 2003-05-25 | Paper |
Translating a convex polyhedron over monotone polyhedra
Computational Geometry | 2003-03-10 | Paper |
Shattering a set of objects in 2D
Discrete Applied Mathematics | 2002-08-29 | Paper |
scientific article; zbMATH DE number 1696644 (Why is no real title available?)
| 2002-07-22 | Paper |
scientific article; zbMATH DE number 1629856 (Why is no real title available?)
| 2001-11-06 | Paper |
Dynamically maintaining the widest \(k\)-dense corridor
Theoretical Computer Science | 2001-08-20 | Paper |
Safety Zone Problem
Journal of Algorithms | 2000-12-19 | Paper |
Efficient Computation of Rectilinear Geodesic Voronoi Neighbor in the Presence of Obstacles
Journal of Algorithms | 1998-10-06 | Paper |
scientific article; zbMATH DE number 4213497 (Why is no real title available?)
| 1990-01-01 | Paper |
