| Publication | Date of Publication | Type |
|---|
| On the planar two-center problem and circular hulls | 2022-12-08 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5088992 | 2022-07-18 | Paper |
| Algorithms for the line-constrained disk coverage and related problems | 2022-06-13 | Paper |
| Algorithms for the line-constrained disk coverage and related problems | 2022-03-25 | Paper |
| An $O(n\log n)$-Time Algorithm for the $k$-Center Problem in Trees | 2021-04-14 | Paper |
| A divide-and-conquer algorithm for two-point L1 shortest path queries in polygonal domains | 2020-09-09 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5116532 | 2020-08-18 | Paper |
| Separating overlapped intervals on a line | 2020-01-13 | Paper |
| On Top-k Weighted<scp>Sum</scp>Aggregate Nearest and Farthest Neighbors in the L1 Plane | 2019-10-31 | Paper |
| Bicriteria rectilinear shortest paths among rectilinear obstacles in the plane | 2019-09-11 | Paper |
| \(L_{1}\) shortest path queries in simple polygons | 2019-09-10 | Paper |
| Quickest visibility queries in polygonal domains | 2019-08-07 | Paper |
| Covering uncertain points in a tree | 2019-05-17 | Paper |
| Computing \(L_1\) shortest paths among polygonal obstacles in the plane | 2019-05-17 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4626291 | 2019-02-27 | Paper |
| An optimal algorithm for minimum-link rectilinear paths in triangulated rectilinear domains | 2019-01-11 | Paper |
| Algorithms for covering multiple barriers | 2019-01-10 | Paper |
| Computing the Rectilinear Center of Uncertain Points in the Plane | 2018-11-26 | Paper |
| An improved algorithm for diameter-optimally augmenting paths in a metric space | 2018-10-31 | Paper |
| Computing Shortest Paths among Curved Obstacles in the Plane | 2018-10-30 | Paper |
| A note on computing the center of uncertain data on the real line | 2018-10-02 | Paper |
| Balanced splitting on weighted intervals | 2018-09-28 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4580138 | 2018-08-13 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4580139 | 2018-08-13 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3174902 | 2018-07-18 | Paper |
| Near-linear time approximation schemes for geometric maximum coverage | 2018-05-15 | Paper |
| Two-Point L1 Shortest Path Queries in the Plane | 2018-04-23 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4636536 | 2018-04-19 | Paper |
| Dispersing points on intervals | 2018-03-21 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4606321 | 2018-03-02 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4606352 | 2018-03-02 | Paper |
| Minimizing the Maximum Moving Cost of Interval Coverage | 2018-01-31 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4601866 | 2018-01-24 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5365045 | 2017-09-29 | Paper |
| An improved algorithm for diameter-optimally augmenting paths in a metric space | 2017-09-22 | Paper |
| Algorithms for covering multiple barriers | 2017-09-22 | Paper |
| Covering uncertain points in a tree | 2017-09-22 | Paper |
| Line-Constrained k-Median, k-Means, and k-Center Problems in the Plane | 2017-05-19 | Paper |
| Minimizing the aggregate movements for interval coverage | 2017-05-11 | Paper |
| Computing the center of uncertain points on tree networks | 2017-05-11 | Paper |
| Computing the \(L_1\) geodesic diameter and center of a polygonal domain | 2017-05-11 | Paper |
| A new algorithm for computing visibility graphs of polygonal obstacles in the plane | 2017-03-30 | Paper |
| Two-point L1 shortest path queries in the plane | 2017-03-30 | Paper |
| New algorithms for facility location problems on the real line | 2017-03-27 | Paper |
| Outlier respecting points approximation | 2017-03-27 | Paper |
| Computing the visibility polygon of an island in a polygonal domain | 2017-03-06 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2957892 | 2017-01-30 | Paper |
| Matroid and knapsack center problems | 2016-06-28 | Paper |
| Minmax regret 1-facility location on uncertain path networks | 2016-06-27 | Paper |
| Minimizing the Maximum Moving Cost of Interval Coverage | 2016-01-11 | Paper |
| Shortest color-spanning intervals | 2015-12-11 | Paper |
| Range queries on uncertain data | 2015-12-08 | Paper |
| Minimizing the aggregate movements for interval coverage | 2015-10-30 | Paper |
| Computing the Center of Uncertain Points on Tree Networks | 2015-10-30 | Paper |
| Linear Time Approximation Schemes for Geometric Maximum Coverage | 2015-10-29 | Paper |
| An optimal algorithm for minimum-link rectilinear paths in triangulated rectilinear domains | 2015-10-27 | Paper |
| Efficient algorithms for the one-dimensional \(k\)-center problem | 2015-10-08 | Paper |
| Quell | 2015-10-08 | Paper |
| One-dimensional \(k\)-center on uncertain data | 2015-09-25 | Paper |
| Range queries on uncertain data | 2015-09-11 | Paper |
| Line-Constrained $$k$$ -Median, $$k$$ -Means, and $$k$$ -Center Problems in the Plane | 2015-09-11 | Paper |
| Optimal point movement for covering circular regions | 2015-07-10 | Paper |
| Weak visibility queries of line segments in simple polygons | 2015-06-17 | Paper |
| Computing the \(L_1\) geodesic diameter and center of a simple polygon in linear time | 2015-06-17 | Paper |
| Computing maximum non-crossing matching in convex bipartite graphs | 2015-06-10 | Paper |
| Visibility and ray shooting queries in polygonal domains | 2015-03-06 | Paper |
| Computing shortest paths among curved obstacles in the plane | 2015-02-17 | Paper |
| One-Dimensional k-Center on Uncertain Data | 2014-09-26 | Paper |
| Shortest Color-Spanning Intervals | 2014-09-26 | Paper |
| A note on searching line arrangements and applications | 2014-04-11 | Paper |
| Computing the L 1 Geodesic Diameter and Center of a Simple Polygon in Linear Time | 2014-03-31 | Paper |
| Minmax Regret 1-Facility Location on Uncertain Path Networks | 2014-01-14 | Paper |
| The topology aware file distribution problem | 2013-12-09 | Paper |
| Computing Shortest Paths amid Convex Pseudodisks | 2013-09-25 | Paper |
| Algorithms on minimizing the maximum sensor movement for barrier coverage of a linear domain | 2013-09-23 | Paper |
| Visibility and Ray Shooting Queries in Polygonal Domains | 2013-08-12 | Paper |
| Computing the Visibility Polygon of an Island in a Polygonal Domain | 2013-08-12 | Paper |
| Approximating points by a piecewise linear function | 2013-06-25 | Paper |
| FITTING A STEP FUNCTION TO A POINT SET WITH OUTLIERS BASED ON SIMPLICIAL THICKNESS DATA STRUCTURES | 2013-06-24 | Paper |
| LOCATING AN OBNOXIOUS LINE AMONG PLANAR OBJECTS | 2013-06-24 | Paper |
| Weak visibility queries of line segments in simple polygons | 2013-03-21 | Paper |
| Optimal point movement for covering circular regions | 2013-03-21 | Paper |
| Matroid and knapsack center problems | 2013-03-19 | Paper |
| Algorithms on minimizing the maximum sensor movement for barrier coverage of a linear domain | 2012-08-14 | Paper |
| Computing Maximum Non-crossing Matching in Convex Bipartite Graphs | 2012-07-16 | Paper |
| An improved algorithm for reconstructing a simple polygon from its visibility angles | 2012-05-18 | Paper |
| Improved algorithms for path partition and related problems | 2012-04-05 | Paper |
| Efficient Algorithms for the Weighted k-Center Problem on a Real Line | 2011-12-16 | Paper |
| Outlier Respecting Points Approximation | 2011-12-16 | Paper |
| An Improved Algorithm for Reconstructing a Simple Polygon from the Visibility Angles | 2011-12-16 | Paper |
| Online rectangle filling | 2011-10-10 | Paper |
| PROCESSING AN OFFLINE INSERTION-QUERY SEQUENCE WITH APPLICATIONS | 2011-10-10 | Paper |
| A Nearly Optimal Algorithm for Finding L 1 Shortest Paths among Polygonal Obstacles in the Plane | 2011-09-16 | Paper |
| Representing a functional curve by curves with fewer peaks | 2011-08-23 | Paper |
| The Topology Aware File Distribution Problem | 2011-08-17 | Paper |
| New Algorithms for 1-D Facility Location and Path Equipartition Problems | 2011-08-12 | Paper |
| Improved Points Approximation Algorithms Based on Simplicial Thickness Data Structures | 2011-05-19 | Paper |
| New algorithms for online rectangle filling with \(k\)-lookahead | 2011-02-18 | Paper |
| Representing a Functional Curve by Curves with Fewer Peaks | 2010-06-22 | Paper |
| Approximating Points by a Piecewise Linear Function: I | 2009-12-17 | Paper |
| Approximating Points by a Piecewise Linear Function: II. Dealing with Outliers | 2009-12-17 | Paper |
| Locating an Obnoxious Line among Planar Objects | 2009-12-17 | Paper |
| Processing an Offline Insertion-Query Sequence with Applications | 2009-07-14 | Paper |
| New Algorithms for Online Rectangle Filling with k-Lookahead | 2008-07-10 | Paper |
| Traversing the Machining Graph | 2008-03-11 | Paper |
| Online Rectangle Filling | 2008-02-20 | Paper |
| An improved algorithm for finding the closest pair of points | 2006-10-12 | Paper |
