| Publication | Date of Publication | Type |
|---|
On the planar two-center problem and circular hulls
Discrete \& Computational Geometry | 2022-12-08 | Paper |
scientific article; zbMATH DE number 7559259 (Why is no real title available?)
| 2022-07-18 | Paper |
Algorithms for the line-constrained disk coverage and related problems
Computational Geometry | 2022-06-13 | Paper |
Algorithms for the line-constrained disk coverage and related problems
Lecture Notes in Computer Science | 2022-03-25 | Paper |
An \(O(n\log n)\)-time algorithm for the \(k\)-center problem in trees
SIAM Journal on Computing | 2021-04-14 | Paper |
A divide-and-conquer algorithm for two-point L1 shortest path queries in polygonal domains
| 2020-09-09 | Paper |
An \(O(n\log n)\)-time algorithm for the \(k\)-center problem in trees
| 2020-08-18 | Paper |
Separating overlapped intervals on a line
| 2020-01-13 | Paper |
On top-\(k\) weighted sum aggregate nearest and farthest neighbors in the \(L_1\) plane
International Journal of Computational Geometry & Applications | 2019-10-31 | Paper |
Bicriteria rectilinear shortest paths among rectilinear obstacles in the plane
Discrete \& Computational Geometry | 2019-09-11 | Paper |
\(L_{1}\) shortest path queries in simple polygons
Theoretical Computer Science | 2019-09-10 | Paper |
Quickest visibility queries in polygonal domains
Discrete \& Computational Geometry | 2019-08-07 | Paper |
Covering uncertain points in a tree
Algorithmica | 2019-05-17 | Paper |
Computing \(L_1\) shortest paths among polygonal obstacles in the plane
Algorithmica | 2019-05-17 | Paper |
scientific article; zbMATH DE number 7030514 (Why is no real title available?)
| 2019-02-27 | Paper |
An optimal algorithm for minimum-link rectilinear paths in triangulated rectilinear domains
Algorithmica | 2019-01-11 | Paper |
Algorithms for covering multiple barriers
Theoretical Computer Science | 2019-01-10 | Paper |
Computing the rectilinear center of uncertain points in the plane
International Journal of Computational Geometry & Applications | 2018-11-26 | Paper |
An improved algorithm for diameter-optimally augmenting paths in a metric space
Computational Geometry | 2018-10-31 | Paper |
Computing shortest paths among curved obstacles in the plane
ACM Transactions on Algorithms | 2018-10-30 | Paper |
A note on computing the center of uncertain data on the real line
Operations Research Letters | 2018-10-02 | Paper |
Balanced splitting on weighted intervals
Operations Research Letters | 2018-09-28 | Paper |
Quickest visibility queries in polygonal domains
| 2018-08-13 | Paper |
Bicriteria rectilinear shortest paths among rectilinear obstacles in the plane
| 2018-08-13 | Paper |
\(k\)-regret minimizing set: efficient algorithms and hardness
| 2018-07-18 | Paper |
Near-linear time approximation schemes for geometric maximum coverage
Theoretical Computer Science | 2018-05-15 | Paper |
Two-point \(L_1\) shortest path queries in the plane
Proceedings of the thirtieth annual symposium on Computational geometry | 2018-04-23 | Paper |
Dispersing points on intervals
| 2018-04-19 | Paper |
Dispersing points on intervals
Discrete Applied Mathematics | 2018-03-21 | Paper |
\(\varepsilon\)-kernel coresets for stochastic points
| 2018-03-02 | Paper |
On the geodesic centers of polygonal domains
| 2018-03-02 | Paper |
Minimizing the maximum moving cost of interval coverages
International Journal of Computational Geometry & Applications | 2018-01-31 | Paper |
Computing the \(L_1\) geodesic diameter and center of a polygonal domain
| 2018-01-24 | Paper |
Computing shortest paths amid pseudodisks
| 2017-09-29 | Paper |
Algorithms for covering multiple barriers
Lecture Notes in Computer Science | 2017-09-22 | Paper |
An improved algorithm for diameter-optimally augmenting paths in a metric space
Lecture Notes in Computer Science | 2017-09-22 | Paper |
Covering uncertain points in a tree
Lecture Notes in Computer Science | 2017-09-22 | Paper |
Line-Constrained k-Median, k-Means, and k-Center Problems in the Plane
International Journal of Computational Geometry & Applications | 2017-05-19 | Paper |
Computing the center of uncertain points on tree networks
Algorithmica | 2017-05-11 | Paper |
Computing the \(L_1\) geodesic diameter and center of a polygonal domain
Discrete \& Computational Geometry | 2017-05-11 | Paper |
Minimizing the aggregate movements for interval coverage
Algorithmica | 2017-05-11 | Paper |
A new algorithm for computing visibility graphs of polygonal obstacles in the plane
| 2017-03-30 | Paper |
Two-point \(L_1\) shortest path queries in the plane
| 2017-03-30 | Paper |
New algorithms for facility location problems on the real line
Algorithmica | 2017-03-27 | Paper |
Outlier respecting points approximation
Algorithmica | 2017-03-27 | Paper |
Computing the visibility polygon of an island in a polygonal domain
Algorithmica | 2017-03-06 | Paper |
\(L_1\) shortest path queries among polygonal obstacles in the plane
| 2017-01-30 | Paper |
Matroid and knapsack center problems
Algorithmica | 2016-06-28 | Paper |
Minmax regret 1-facility location on uncertain path networks
European Journal of Operational Research | 2016-06-27 | Paper |
Minimizing the maximum moving cost of interval coverage
Algorithms and Computation | 2016-01-11 | Paper |
Shortest color-spanning intervals
Theoretical Computer Science | 2015-12-11 | Paper |
Range queries on uncertain data
Theoretical Computer Science | 2015-12-08 | Paper |
Computing the center of uncertain points on tree networks
Lecture Notes in Computer Science | 2015-10-30 | Paper |
Minimizing the aggregate movements for interval coverage
Lecture Notes in Computer Science | 2015-10-30 | Paper |
Linear Time Approximation Schemes for Geometric Maximum Coverage
Lecture Notes in Computer Science | 2015-10-29 | Paper |
An optimal algorithm for minimum-link rectilinear paths in triangulated rectilinear domains
Lecture Notes in Computer Science | 2015-10-27 | Paper |
Efficient algorithms for the one-dimensional \(k\)-center problem
Theoretical Computer Science | 2015-10-08 | Paper |
Quell
Theoretical Computer Science | 2015-10-08 | Paper |
One-dimensional \(k\)-center on uncertain data
Theoretical Computer Science | 2015-09-25 | Paper |
Line-constrained \(k\)-median, \(k\)-means, and \(k\)-center problems in the plane
Algorithms and Computation | 2015-09-11 | Paper |
Range queries on uncertain data
Lecture Notes in Computer Science | 2015-09-11 | Paper |
Optimal point movement for covering circular regions
Algorithmica | 2015-07-10 | Paper |
Computing the \(L_1\) geodesic diameter and center of a simple polygon in linear time
Computational Geometry | 2015-06-17 | Paper |
Weak visibility queries of line segments in simple polygons
Computational Geometry | 2015-06-17 | Paper |
Computing maximum non-crossing matching in convex bipartite graphs
Discrete Applied Mathematics | 2015-06-10 | Paper |
Visibility and ray shooting queries in polygonal domains
Computational Geometry | 2015-03-06 | Paper |
Computing shortest paths among curved obstacles in the plane
Proceedings of the twenty-ninth annual symposium on Computational geometry | 2015-02-17 | Paper |
One-dimensional \(k\)-center on uncertain data
Lecture Notes in Computer Science | 2014-09-26 | Paper |
Shortest color-spanning intervals
Lecture Notes in Computer Science | 2014-09-26 | Paper |
A note on searching line arrangements and applications
Information Processing Letters | 2014-04-11 | Paper |
Computing the \(L _{1}\) geodesic diameter and center of a simple polygon in linear time
LATIN 2014: Theoretical Informatics | 2014-03-31 | Paper |
Minmax regret 1-facility location on uncertain path networks
Algorithms and Computation | 2014-01-14 | Paper |
The topology aware file distribution problem
Journal of Combinatorial Optimization | 2013-12-09 | Paper |
Computing shortest paths amid convex pseudodisks
SIAM Journal on Computing | 2013-09-25 | Paper |
Algorithms on minimizing the maximum sensor movement for barrier coverage of a linear domain
Discrete \& Computational Geometry | 2013-09-23 | Paper |
Computing the visibility polygon of an island in a polygonal domain
Automata, Languages, and Programming | 2013-08-12 | Paper |
Visibility and Ray Shooting Queries in Polygonal Domains
Lecture Notes in Computer Science | 2013-08-12 | Paper |
Approximating points by a piecewise linear function
Algorithmica | 2013-06-25 | Paper |
Fitting a step function to a point set with outliers based on simplicial thickness data structures
International Journal of Computational Geometry & Applications | 2013-06-24 | Paper |
Locating an obnoxious line among planar objects
International Journal of Computational Geometry & Applications | 2013-06-24 | Paper |
Weak visibility queries of line segments in simple polygons
Lecture Notes in Computer Science | 2013-03-21 | Paper |
Optimal point movement for covering circular regions
Lecture Notes in Computer Science | 2013-03-21 | Paper |
Matroid and knapsack center problems
Lecture Notes in Computer Science | 2013-03-19 | Paper |
Algorithms on minimizing the maximum sensor movement for barrier coverage of a linear domain
Lecture Notes in Computer Science | 2012-08-14 | Paper |
Computing maximum non-crossing matching in convex bipartite graphs
Frontiers in Algorithmics and Algorithmic Aspects in Information and Management | 2012-07-16 | Paper |
An improved algorithm for reconstructing a simple polygon from its visibility angles
Computational Geometry | 2012-05-18 | Paper |
Improved algorithms for path partition and related problems
Operations Research Letters | 2012-04-05 | Paper |
Efficient algorithms for the weighted \(k\)-center problem on a real line
Algorithms and Computation | 2011-12-16 | Paper |
Outlier Respecting Points Approximation
Algorithms and Computation | 2011-12-16 | Paper |
An improved algorithm for reconstructing a simple polygon from the visibility angles
Algorithms and Computation | 2011-12-16 | Paper |
Online rectangle filling
Theoretical Computer Science | 2011-10-10 | Paper |
Processing an offline insertion-query sequence with applications
International Journal of Foundations of Computer Science | 2011-10-10 | Paper |
A nearly optimal algorithm for finding \(L _{1}\) shortest paths among polygonal obstacles in the plane
Algorithms – ESA 2011 | 2011-09-16 | Paper |
Representing a functional curve by curves with fewer peaks
Discrete \& Computational Geometry | 2011-08-23 | Paper |
The topology aware file distribution problem
Lecture Notes in Computer Science | 2011-08-17 | Paper |
New algorithms for 1-D facility location and path equipartition problems
Lecture Notes in Computer Science | 2011-08-12 | Paper |
Improved points approximation algorithms based on simplicial thickness data structures
Lecture Notes in Computer Science | 2011-05-19 | Paper |
New algorithms for online rectangle filling with \(k\)-lookahead
Journal of Combinatorial Optimization | 2011-02-18 | Paper |
Representing a Functional Curve by Curves with Fewer Peaks
Lecture Notes in Computer Science | 2010-06-22 | Paper |
Approximating points by a piecewise linear function: I
Algorithms and Computation | 2009-12-17 | Paper |
Approximating points by a piecewise linear function: II. Dealing with outliers
Algorithms and Computation | 2009-12-17 | Paper |
Locating an obnoxious line among planar objects
Algorithms and Computation | 2009-12-17 | Paper |
Processing an Offline Insertion-Query Sequence with Applications
Frontiers in Algorithmics | 2009-07-14 | Paper |
New Algorithms for Online Rectangle Filling with k-Lookahead
Lecture Notes in Computer Science | 2008-07-10 | Paper |
Traversing the Machining Graph
Lecture Notes in Computer Science | 2008-03-11 | Paper |
Online Rectangle Filling
Approximation and Online Algorithms | 2008-02-20 | Paper |
An improved algorithm for finding the closest pair of points
Journal of Computer Science and Technology | 2006-10-12 | Paper |
