| Publication | Date of Publication | Type |
|---|
Steiner problems on directed acyclic graphs
Lecture Notes in Computer Science | 2024-01-29 | Paper |
Efficient computation of the geodesic Voronoi diagram of points in a simple polygon
Lecture Notes in Computer Science | 2023-05-08 | Paper |
Finding maximum sum segments in sequences with uncertainty
Theoretical Computer Science | 2020-12-16 | Paper |
| Tight approximation for partial vertex cover with hard capacities | 2020-11-25 | Paper |
Tight approximation for partial vertex cover with hard capacities
Theoretical Computer Science | 2019-06-06 | Paper |
Higher-order geodesic Voronoi diagrams in a polygonal domain with holes
Proceedings of the Twenty-Fourth Annual ACM-SIAM Symposium on Discrete Algorithms | 2019-05-15 | Paper |
\(O(f)\) bi-criteria approximation for capacitated covering with hard capacities
Algorithmica | 2019-05-07 | Paper |
The \((1 | 1)\)-centroid problem in the plane with distance constraints
International Journal of Computational Geometry & Applications | 2018-08-02 | Paper |
| scientific article; zbMATH DE number 6876075 (Why is no real title available?) | 2018-05-29 | Paper |
| The (1|1)-Centroid Problem on the Plane Concerning Distance Constraints | 2018-04-19 | Paper |
\(O(f)\) bi-approximation for capacitated covering with hard capacities
(available as arXiv preprint) | 2018-04-19 | Paper |
The multi-service center problem
Theoretical Computer Science | 2017-11-16 | Paper |
Online dynamic power management with hard real-time guarantees
(available as arXiv preprint) | 2017-03-03 | Paper |
Optimal time-convex hull for a straight-line highway in \(L_p\)-metrics
Computational Geometry | 2016-04-12 | Paper |
Broadcasting in weighted trees under the postal model
Theoretical Computer Science | 2016-02-26 | Paper |
Online dynamic power management with hard real-time guarantees
Theoretical Computer Science | 2015-07-24 | Paper |
The \(k\)-nearest-neighbor Voronoi diagram revisited
Algorithmica | 2015-05-26 | Paper |
Capacitated domination: problem complexity and approximation algorithms
Algorithmica | 2015-05-21 | Paper |
The density maximization problem in graphs
Journal of Combinatorial Optimization | 2013-12-09 | Paper |
| Voronoi diagrams and Delaunay triangulations | 2013-10-17 | Paper |
Optimal time-convex hull under the \(L _{p }\) metrics
Lecture Notes in Computer Science | 2013-08-12 | Paper |
Power domination in circular-arc graphs
Algorithmica | 2013-03-05 | Paper |
Computing the stretch factor and maximum detour of paths, trees, and cycles in the normed space
International Journal of Computational Geometry & Applications | 2012-11-23 | Paper |
Higher order city Voronoi diagrams
Algorithm Theory – SWAT 2012 | 2012-08-14 | Paper |
Capacitated domination: constant factor approximations for planar graphs
Algorithms and Computation | 2011-12-16 | Paper |
Finding maximum sum segments in sequences with uncertainty
Algorithms and Computation | 2011-12-16 | Paper |
An output-sensitive approach for the \(L _{1}/L _{ \infty }\) \(k\)-nearest-neighbor Voronoi diagram
Algorithms – ESA 2011 | 2011-09-16 | Paper |
The density maximization problem in graphs
Lecture Notes in Computer Science | 2011-08-17 | Paper |
Capacitated domination problem
Algorithmica | 2011-05-10 | Paper |
Spanning ratio and maximum detour of rectilinear paths in the \(L _{1}\) plane
Algorithms and Computation | 2010-12-09 | Paper |
Broadcasting in heterogeneous tree networks
Lecture Notes in Computer Science | 2010-07-20 | Paper |
Efficient algorithms for the sum selection problem and \(k\) maximum sums problem
Theoretical Computer Science | 2010-03-09 | Paper |
Optimal randomized algorithm for the density selection problem
Algorithms and Computation | 2009-12-17 | Paper |
Geometric minimum diameter minimum cost spanning tree problem
Algorithms and Computation | 2009-12-17 | Paper |
Fast algorithms for the density finding problem
Algorithmica | 2009-06-17 | Paper |
Maximizing the Number of Independent Labels in the Plane
Frontiers in Algorithmics | 2009-03-10 | Paper |
Efficient Algorithms for the Sum Selection Problem and K Maximum Sums Problem
Algorithms and Computation | 2008-04-24 | Paper |
Randomized algorithm for the sum selection problem
Theoretical Computer Science | 2007-06-06 | Paper |
Algorithms and Computation
Lecture Notes in Computer Science | 2006-11-14 | Paper |
Computing and Combinatorics
Lecture Notes in Computer Science | 2006-01-11 | Paper |
THE HAUSDORFF VORONOI DIAGRAM OF POLYGONAL OBJECTS: A DIVIDE AND CONQUER APPROACH
International Journal of Computational Geometry & Applications | 2005-12-09 | Paper |
LABELING POINTS ON A SINGLE LINE
International Journal of Computational Geometry & Applications | 2005-10-18 | Paper |
| scientific article; zbMATH DE number 2185617 (Why is no real title available?) | 2005-07-04 | Paper |
THE L∞ VORONOI DIAGRAM OF SEGMENTS AND VLSI APPLICATIONS
International Journal of Computational Geometry & Applications | 2005-06-10 | Paper |
Two variations of the minimum Steiner problem
Journal of Combinatorial Optimization | 2005-05-17 | Paper |
| scientific article; zbMATH DE number 1979526 (Why is no real title available?) | 2003-09-14 | Paper |
SKEW VORONOI DIAGRAMS
International Journal of Computational Geometry & Applications | 2000-05-07 | Paper |
An optimal algorithm for shortest paths on weighted interval and circular-arc graphs, with applications
Algorithmica | 1996-02-04 | Paper |
Parallel enclosing rectangle on SIMD machines
Parallel Computing | 1992-06-28 | Paper |
Dynamic Voronoi diagrams
IEEE Transactions on Information Theory | 1983-01-01 | Paper |
On k-Nearest Neighbor Voronoi Diagrams in the Plane
IEEE Transactions on Computers | 1982-01-01 | Paper |
An Algorithm for Transformation of an Arbitrary Switching Function to a Completely Symmetric Function
IEEE Transactions on Computers | 1976-01-01 | Paper |
