| Publication | Date of Publication | Type |
|---|
| On clustering induced Voronoi diagrams | 2025-05-20 | Paper |
| Applications of a numbering scheme for polygonal obstacles in the plane | 2023-01-25 | Paper |
Computing the all-pairs longest chains in the plane
Lecture Notes in Computer Science | 2023-01-18 | Paper |
Two-variable linear programming in parallel
Algorithm Theory — SWAT'98 | 2022-12-09 | Paper |
On geometric path query problems
Lecture Notes in Computer Science | 2022-08-19 | Paper |
Influence-based Voronoi diagrams of clusters
Computational Geometry | 2021-09-16 | Paper |
Online scheduling of moldable parallel tasks
Journal of Scheduling | 2019-08-08 | Paper |
Computing \(L_1\) shortest paths among polygonal obstacles in the plane
Algorithmica | 2019-05-17 | Paper |
Computing shortest paths among curved obstacles in the plane
ACM Transactions on Algorithms | 2018-10-30 | Paper |
Two-point \(L_1\) shortest path queries in the plane
Proceedings of the thirtieth annual symposium on Computational geometry | 2018-04-23 | Paper |
Planar spanners and approximate shortest path queries among obstacles in the plane
Algorithms — ESA '96 | 2017-12-05 | Paper |
Parallel algorithms for partitioning sorted sets and related problems
Algorithms — ESA '96 | 2017-12-05 | Paper |
On clustering induced Voronoi diagrams
SIAM Journal on Computing | 2017-11-22 | Paper |
Mountain reduction, block matching, and applications in intensity-modulated radiation therapy
Proceedings of the twenty-first annual symposium on Computational geometry | 2017-10-20 | Paper |
| Computing shortest paths amid pseudodisks | 2017-09-29 | Paper |
Algorithms for congruent sphere packing and applications
Proceedings of the seventeenth annual symposium on Computational geometry | 2017-09-29 | Paper |
Geometric algorithms for static leaf sequencing problems in radiation therapy
Proceedings of the nineteenth annual symposium on Computational geometry | 2017-09-29 | Paper |
| A new algorithm for computing visibility graphs of polygonal obstacles in the plane | 2017-03-30 | Paper |
| Two-point L₁ 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₁ shortest path queries among polygonal obstacles in the plane
(available as arXiv preprint) | 2017-01-30 | Paper |
Matroid and knapsack center problems
Algorithmica | 2016-06-28 | Paper |
Maintaining visibility of a polygon with a moving point of view
Information Processing Letters | 2016-06-09 | Paper |
| Kinetic Transition Networks for the Thomson Problem and Smale's 7th Problem | 2016-05-26 | Paper |
A circular matrix-merging algorithm with application in volumetric intensity-modulated arc therapy
Theoretical Computer Science | 2015-12-08 | Paper |
Packing cubes into a cube in \((D>3)\)-dimensions
Lecture Notes in Computer Science | 2015-10-29 | Paper |
Efficient algorithms for the one-dimensional \(k\)-center problem
Theoretical Computer Science | 2015-10-08 | Paper |
Packing cubes into a cube is NP-complete in the strong sense
Journal of Combinatorial Optimization | 2015-07-10 | Paper |
Optimal point movement for covering circular regions
Algorithmica | 2015-07-10 | 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 |
Shortest path queries in planar graphs
Proceedings of the thirty-second annual ACM symposium on Theory of computing | 2014-09-26 | Paper |
A circular matrix-merging algorithm with application in VMAT radiation therapy
Frontiers in Algorithmics | 2014-09-02 | Paper |
A note on searching line arrangements and applications
Information Processing Letters | 2014-04-11 | Paper |
Algorithms for interval structures with applications
Theoretical Computer Science | 2013-12-19 | 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 |
Shell: a spatial decomposition data structure for 3D curve traversal on many-core architectures
Lecture Notes in Computer Science | 2013-09-17 | 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 |
Packing cubes into a cube is NP-hard in the strong sense
Lecture Notes in Computer Science | 2013-06-11 | 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 |
Free-form surface partition in 3-d
International Journal of Computational Geometry & Applications | 2012-11-23 | 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 feasible toolpaths for 5-axis machines
Theoretical Computer Science | 2012-08-13 | Paper |
Computing maximum non-crossing matching in convex bipartite graphs
Frontiers in Algorithmics and Algorithmic Aspects in Information and Management | 2012-07-16 | Paper |
Flattening topologically spherical surface
Journal of Combinatorial Optimization | 2012-07-03 | 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 |
A new algorithm for a field splitting problem in intensity-modulated radiation therapy
Algorithmica | 2011-11-07 | Paper |
Processing an offline insertion-query sequence with applications
International Journal of Foundations of Computer Science | 2011-10-10 | Paper |
Online rectangle filling
Theoretical 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 |
Coupled path planning, region optimization, and applications in intensity-modulated radiation therapy
Algorithmica | 2011-07-01 | Paper |
Algorithms for interval structures with applications
Frontiers in Algorithmics and Algorithmic Aspects in Information and Management | 2011-06-03 | Paper |
Improved points approximation algorithms based on simplicial thickness data structures
Lecture Notes in Computer Science | 2011-05-19 | Paper |
Shape rectangularization problems in intensity-modulated radiation therapy
Algorithmica | 2011-05-10 | Paper |
Geometric algorithms for agglomerative hierarchical clustering
Lecture Notes in Computer Science | 2011-03-18 | Paper |
Pairwise data clustering and applications
Lecture Notes in Computer Science | 2011-03-18 | Paper |
New algorithms for online rectangle filling with k-lookahead
Journal of Combinatorial Optimization | 2011-02-18 | Paper |
Densest k-subgraph approximation on intersection graphs
Approximation and Online Algorithms | 2011-02-15 | Paper |
Computing toolpaths for 5-axis NC machines
Combinatorial Optimization and Applications | 2011-01-08 | Paper |
Finding many optimal paths without growing any optimal path trees
International Journal of Computational Geometry & Applications | 2010-09-30 | Paper |
Representing a Functional Curve by Curves with Fewer Peaks
Lecture Notes in Computer Science | 2010-06-22 | Paper |
Two flow network simplification algorithms
Information Processing Letters | 2009-12-18 | 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 |
GEOMETRIC ALGORITHMS FOR THE CONSTRAINED 1-D K-MEANS CLUSTERING PROBLEMS AND IMRT APPLICATIONS
International Journal of Foundations of Computer Science | 2009-06-23 | Paper |
Geometric Algorithms for the Constrained 1-D K-Means Clustering Problems and IMRT Applications
Frontiers in Algorithmics | 2009-03-10 | Paper |
A New Field Splitting Algorithm for Intensity-Modulated Radiation Therapy
Lecture Notes in Computer Science | 2009-03-06 | Paper |
Finding Many Optimal Paths Without Growing Any Optimal Path Trees
Lecture Notes in Computer Science | 2009-03-06 | Paper |
Approximating the Maximum Sharing Problem
Lecture Notes in Computer Science | 2009-02-17 | Paper |
Free-Form Surface Partition in 3-D
Algorithms and Computation | 2009-01-29 | Paper |
Stabbing Convex Polygons with a Segment or a Polygon
Algorithms - ESA 2008 | 2008-11-25 | Paper |
MOUNTAIN REDUCTION, BLOCK MATCHING, AND APPLICATIONS IN INTENSITY-MODULATED RADIATION THERAPY
International Journal of Computational Geometry & Applications | 2008-08-26 | Paper |
New Algorithms for Online Rectangle Filling with k-Lookahead
Lecture Notes in Computer Science | 2008-07-10 | Paper |
Optimal Surface Flattening
Frontiers in Algorithmics | 2008-06-19 | Paper |
Optimal Field Splitting, with Applications in Intensity-Modulated Radiation Therapy
Frontiers in Algorithmics | 2008-06-19 | Paper |
Shape Rectangularization Problems in Intensity-Modulated Radiation Therapy
Algorithms and Computation | 2008-04-24 | Paper |
On Approximating the Maximum Simple Sharing Problem
Algorithms and Computation | 2008-04-24 | Paper |
Field Splitting Problems in Intensity-Modulated Radiation Therapy
Algorithms and Computation | 2008-04-24 | Paper |
Construction of the nearest neighbor embracing graph of a point set
Journal of Combinatorial Optimization | 2008-04-04 | 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 |
THE LAYERED NET SURFACE PROBLEMS IN DISCRETE GEOMETRY AND MEDICAL IMAGE SEGMENTATION
International Journal of Computational Geometry & Applications | 2007-07-13 | Paper |
Algorithms and Computation
Lecture Notes in Computer Science | 2006-11-14 | Paper |
Algorithms and Computation
Lecture Notes in Computer Science | 2006-11-14 | Paper |
GENERALIZED GEOMETRIC APPROACHES FOR LEAF SEQUENCING PROBLEMS IN RADIATION THERAPY
International Journal of Computational Geometry & Applications | 2006-05-29 | Paper |
MINIMUM AREA CONVEX PACKING OF TWO CONVEX POLYGONS
International Journal of Computational Geometry & Applications | 2006-05-10 | Paper |
Optimal terrain construction problems and applications in intensity-modulated radiation therapy
Algorithmica | 2006-03-21 | Paper |
Computing and Combinatorics
Lecture Notes in Computer Science | 2006-01-11 | Paper |
Algorithms and Computation
Lecture Notes in Computer Science | 2005-12-22 | Paper |
Polygonal path simplification with angle constraints
Computational Geometry | 2005-11-01 | Paper |
GEOMETRIC ALGORITHMS FOR DENSITY-BASED DATA CLUSTERING
International Journal of Computational Geometry & Applications | 2005-10-18 | Paper |
Algorithm Theory - SWAT 2004
Lecture Notes in Computer Science | 2005-09-07 | Paper |
Computing and Combinatorics
Lecture Notes in Computer Science | 2005-06-15 | Paper |
Computing and Combinatorics
Lecture Notes in Computer Science | 2005-06-15 | Paper |
ON GEOMETRIC PATH QUERY PROBLEMS
International Journal of Computational Geometry & Applications | 2005-06-10 | Paper |
EFFICIENT ALGORITHMS FOR OPTIMIZATION-BASED IMAGE SEGMENTATION
International Journal of Computational Geometry & Applications | 2005-06-10 | Paper |
ON CONNECTING RED AND BLUE RECTILINEAR POLYGONAL OBSTACLES WITH NONINTERSECTING MONOTONE RECTILINEAR PATHS
International Journal of Computational Geometry & Applications | 2005-06-10 | Paper |
Efficient algorithms and implementations for optimizing the sum of linear fractional functions, with applications
Journal of Combinatorial Optimization | 2005-05-17 | Paper |
Efficient algorithms for \(k\)-terminal cuts on planar graphs
Algorithmica | 2004-12-02 | Paper |
GEOMETRIC ALGORITHMS FOR STATIC LEAF SEQUENCING PROBLEMS IN RADIATION THERAPY
International Journal of Computational Geometry & Applications | 2004-11-01 | Paper |
Geometric permutations of higher dimensional spheres
Computational Geometry | 2004-10-13 | Paper |
Finding an optimal path without growing the tree
Journal of Algorithms | 2004-10-01 | Paper |
OPTIMAL POLYGON COVER PROBLEMS AND APPLICATIONS
International Journal of Computational Geometry & Applications | 2004-09-29 | Paper |
IMAGE SEGMENTATION WITH ASTEROIDALITY/TUBULARITY AND SMOOTHNESS CONSTRAINTS
International Journal of Computational Geometry & Applications | 2004-09-29 | Paper |
SPACE-EFFICIENT ALGORITHMS FOR APPROXIMATING POLYGONAL CURVES IN TWO-DIMENSIONAL SPACE
International Journal of Computational Geometry & Applications | 2004-09-29 | Paper |
EFFICIENT APPROXIMATION ALGORITHMS FOR PAIRWISE DATA CLUSTERING AND APPLICATIONS
International Journal of Computational Geometry & Applications | 2004-09-29 | Paper |
TOPOLOGICAL PEELING AND APPLICATIONS
International Journal of Computational Geometry & Applications | 2004-09-29 | Paper |
An Experimental Study and Comparison of Topological Peeling and Topological Walk
Lecture Notes in Computer Science | 2004-08-12 | Paper |
| scientific article; zbMATH DE number 2086692 (Why is no real title available?) | 2004-08-11 | Paper |
| scientific article; zbMATH DE number 2080277 (Why is no real title available?) | 2004-08-04 | Paper |
| scientific article; zbMATH DE number 2081013 (Why is no real title available?) | 2004-08-04 | Paper |
| scientific article; zbMATH DE number 2081012 (Why is no real title available?) | 2004-08-04 | Paper |
| scientific article; zbMATH DE number 2080271 (Why is no real title available?) | 2004-08-04 | Paper |
| scientific article; zbMATH DE number 2081002 (Why is no real title available?) | 2004-08-04 | Paper |
Computing optimal beams in two and three dimensions
Journal of Combinatorial Optimization | 2003-08-28 | Paper |
Efficient parallel algorithms for planar st-graphs
Algorithmica | 2003-08-17 | Paper |
| scientific article; zbMATH DE number 1947399 (Why is no real title available?) | 2003-07-08 | Paper |
| scientific article; zbMATH DE number 1947400 (Why is no real title available?) | 2003-07-08 | Paper |
Two-variable linear programming in parallel
Computational Geometry | 2002-11-27 | Paper |
| scientific article; zbMATH DE number 1798162 (Why is no real title available?) | 2002-11-04 | Paper |
Efficiently approximating polygonal paths in three and higher dimensions
Algorithmica | 2002-06-17 | Paper |
| Geometric permutations of high dimensional spheres. | 2002-03-24 | Paper |
| Polygonal path approximation with angle constraints | 2002-01-30 | Paper |
| scientific article; zbMATH DE number 1424292 (Why is no real title available?) | 2001-10-07 | Paper |
An efficient direct approach for computing shortest rectilinear paths among obstacles in a two-layer interconnection model
Computational Geometry | 2001-09-27 | Paper |
Parallel algorithms for partitioning sorted sets and related problems
Algorithmica | 2001-05-20 | Paper |
| scientific article; zbMATH DE number 1555944 (Why is no real title available?) | 2001-01-24 | Paper |
Determining an optimal penetration among weighted regions in two and three dimensions
Journal of Combinatorial Optimization | 2001-01-01 | Paper |
Lower bounds for computing geometric spanners and approximate shortest paths
Discrete Applied Mathematics | 2001-01-01 | Paper |
Finding the Convex Hull of Discs in Parallel
International Journal of Computational Geometry & Applications | 2000-11-07 | Paper |
Determining Weak Visibility of a Polygon from an Edge in Parallel
International Journal of Computational Geometry & Applications | 2000-11-07 | Paper |
| scientific article; zbMATH DE number 1445369 (Why is no real title available?) | 2000-10-23 | Paper |
SKEW VORONOI DIAGRAMS
International Journal of Computational Geometry & Applications | 2000-05-07 | Paper |
Shortest Path Queries Among Weighted Obstacles in the Rectilinear Plane
SIAM Journal on Computing | 2000-03-19 | Paper |
| scientific article; zbMATH DE number 1305095 (Why is no real title available?) | 1999-10-06 | Paper |
| scientific article; zbMATH DE number 1222819 (Why is no real title available?) | 1999-03-30 | Paper |
| scientific article; zbMATH DE number 1222818 (Why is no real title available?) | 1998-11-11 | Paper |
| scientific article; zbMATH DE number 1302178 (Why is no real title available?) | 1998-01-01 | Paper |
Rectilinear short path queries among rectangular obstacles
Information Processing Letters | 1997-02-27 | Paper |
| scientific article; zbMATH DE number 910885 (Why is no real title available?) | 1996-11-04 | Paper |
| scientific article; zbMATH DE number 871905 (Why is no real title available?) | 1996-10-21 | Paper |
Optimally Computing the Shortest Weakly Visible Subedge of a Simple Polygon
Journal of Algorithms | 1996-06-09 | Paper |
COMPUTING THE ALL-PAIRS LONGEST CHAINS IN THE PLANE
International Journal of Computational Geometry & Applications | 1996-03-18 | Paper |
An optimal algorithm for shortest paths on weighted interval and circular-arc graphs, with applications
Algorithmica | 1996-02-04 | Paper |
AN OPTIMAL PARALLEL ALGORITHM FOR DETECTING WEAK VISIBILITY OF A SIMPLE POLYGON
International Journal of Computational Geometry & Applications | 1995-05-17 | Paper |
Optimal parallel hypercube algorithms for polygon problems
IEEE Transactions on Computers | 1995-01-01 | Paper |
On parallel rectilinear obstacle-avoiding paths
Computational Geometry | 1994-11-29 | Paper |
An optimal parallel algorithm for the visibility of a simple polygon from a point
Journal of the ACM | 1994-09-29 | Paper |
Testing a simple polygon for monotonicity optimally in parallel
Information Processing Letters | 1994-05-19 | Paper |
Parallel rectilinear shortest paths with rectangular obstacles
Computational Geometry | 1992-09-27 | Paper |
An optimal parallel algorithm for the minimum circle-cover problem
Information Processing Letters | 1989-01-01 | Paper |
