| Publication | Date of Publication | Type |
|---|
| Applications of a numbering scheme for polygonal obstacles in the plane | 2023-01-25 | Paper |
| Computing the all-pairs longest chains in the plane | 2023-01-18 | Paper |
| Two-variable linear programming in parallel | 2022-12-09 | Paper |
| On geometric path query problems | 2022-08-19 | Paper |
| Influence-based Voronoi diagrams of clusters | 2021-09-16 | Paper |
| Online scheduling of moldable parallel tasks | 2019-08-08 | Paper |
| Computing \(L_1\) shortest paths among polygonal obstacles in the plane | 2019-05-17 | Paper |
| Computing Shortest Paths among Curved Obstacles in the Plane | 2018-10-30 | Paper |
| Two-Point L1 Shortest Path Queries in the Plane | 2018-04-23 | Paper |
| Parallel algorithms for partitioning sorted sets and related problems | 2017-12-05 | Paper |
| Planar spanners and approximate shortest path queries among obstacles in the plane | 2017-12-05 | Paper |
| On Clustering Induced Voronoi Diagrams | 2017-11-22 | Paper |
| Mountain reduction, block matching, and applications in intensity-modulated radiation therapy | 2017-10-20 | Paper |
| Algorithms for congruent sphere packing and applications | 2017-09-29 | Paper |
| Geometric algorithms for static leaf sequencing problems in radiation therapy | 2017-09-29 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5365045 | 2017-09-29 | 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 |
| Maintaining visibility of a polygon with a moving point of view | 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 | 2015-12-08 | Paper |
| Packing Cubes into a Cube in (D>3)-Dimensions | 2015-10-29 | Paper |
| Efficient algorithms for the one-dimensional \(k\)-center problem | 2015-10-08 | Paper |
| Optimal point movement for covering circular regions | 2015-07-10 | Paper |
| Packing cubes into a cube is NP-complete in the strong sense | 2015-07-10 | Paper |
| Weak visibility queries of line segments in simple polygons | 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 |
| Shortest path queries in planar graphs | 2014-09-26 | Paper |
| A Circular Matrix-Merging Algorithm with Application in VMAT Radiation Therapy | 2014-09-02 | Paper |
| A note on searching line arrangements and applications | 2014-04-11 | Paper |
| Algorithms for interval structures with applications | 2013-12-19 | 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 |
| Packing Cubes into a Cube Is NP-Hard in the Strong Sense | 2013-06-11 | 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 |
| FREE-FORM SURFACE PARTITION IN 3-D | 2012-11-23 | Paper |
| Algorithms on minimizing the maximum sensor movement for barrier coverage of a linear domain | 2012-08-14 | Paper |
| Computing feasible toolpaths for 5-axis machines | 2012-08-13 | Paper |
| Computing Maximum Non-crossing Matching in Convex Bipartite Graphs | 2012-07-16 | Paper |
| Flattening topologically spherical surface | 2012-07-03 | 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 |
| A new algorithm for a field splitting problem in intensity-modulated radiation therapy | 2011-11-07 | 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 |
| Coupled path planning, region optimization, and applications in intensity-modulated radiation therapy | 2011-07-01 | Paper |
| Algorithms for Interval Structures with Applications | 2011-06-03 | Paper |
| Improved Points Approximation Algorithms Based on Simplicial Thickness Data Structures | 2011-05-19 | Paper |
| Shape rectangularization problems in intensity-modulated radiation therapy | 2011-05-10 | Paper |
| Geometric Algorithms for Agglomerative Hierarchical Clustering | 2011-03-18 | Paper |
| Pairwise Data Clustering and Applications | 2011-03-18 | Paper |
| New algorithms for online rectangle filling with \(k\)-lookahead | 2011-02-18 | Paper |
| Densest k-Subgraph Approximation on Intersection Graphs | 2011-02-15 | Paper |
| Computing Toolpaths for 5-Axis NC Machines | 2011-01-08 | Paper |
| FINDING MANY OPTIMAL PATHS WITHOUT GROWING ANY OPTIMAL PATH TREES | 2010-09-30 | Paper |
| Representing a Functional Curve by Curves with Fewer Peaks | 2010-06-22 | Paper |
| Two flow network simplification algorithms | 2009-12-18 | 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 |
| GEOMETRIC ALGORITHMS FOR THE CONSTRAINED 1-D K-MEANS CLUSTERING PROBLEMS AND IMRT APPLICATIONS | 2009-06-23 | Paper |
| Geometric Algorithms for the Constrained 1-D K-Means Clustering Problems and IMRT Applications | 2009-03-10 | Paper |
| A New Field Splitting Algorithm for Intensity-Modulated Radiation Therapy | 2009-03-06 | Paper |
| Finding Many Optimal Paths Without Growing Any Optimal Path Trees | 2009-03-06 | Paper |
| Approximating the Maximum Sharing Problem | 2009-02-17 | Paper |
| Free-Form Surface Partition in 3-D | 2009-01-29 | Paper |
| Stabbing Convex Polygons with a Segment or a Polygon | 2008-11-25 | Paper |
| MOUNTAIN REDUCTION, BLOCK MATCHING, AND APPLICATIONS IN INTENSITY-MODULATED RADIATION THERAPY | 2008-08-26 | Paper |
| New Algorithms for Online Rectangle Filling with k-Lookahead | 2008-07-10 | Paper |
| Optimal Field Splitting, with Applications in Intensity-Modulated Radiation Therapy | 2008-06-19 | Paper |
| Optimal Surface Flattening | 2008-06-19 | Paper |
| On Approximating the Maximum Simple Sharing Problem | 2008-04-24 | Paper |
| Field Splitting Problems in Intensity-Modulated Radiation Therapy | 2008-04-24 | Paper |
| Shape Rectangularization Problems in Intensity-Modulated Radiation Therapy | 2008-04-24 | Paper |
| Construction of the nearest neighbor embracing graph of a point set | 2008-04-04 | Paper |
| Traversing the Machining Graph | 2008-03-11 | Paper |
| Online Rectangle Filling | 2008-02-20 | Paper |
| THE LAYERED NET SURFACE PROBLEMS IN DISCRETE GEOMETRY AND MEDICAL IMAGE SEGMENTATION | 2007-07-13 | Paper |
| Algorithms and Computation | 2006-11-14 | Paper |
| Algorithms and Computation | 2006-11-14 | Paper |
| GENERALIZED GEOMETRIC APPROACHES FOR LEAF SEQUENCING PROBLEMS IN RADIATION THERAPY | 2006-05-29 | Paper |
| MINIMUM AREA CONVEX PACKING OF TWO CONVEX POLYGONS | 2006-05-10 | Paper |
| Optimal terrain construction problems and applications in intensity-modulated radiation therapy | 2006-03-21 | Paper |
| Computing and Combinatorics | 2006-01-11 | Paper |
| Algorithms and Computation | 2005-12-22 | Paper |
| Polygonal path simplification with angle constraints | 2005-11-01 | Paper |
| GEOMETRIC ALGORITHMS FOR DENSITY-BASED DATA CLUSTERING | 2005-10-18 | Paper |
| Algorithm Theory - SWAT 2004 | 2005-09-07 | Paper |
| Computing and Combinatorics | 2005-06-15 | Paper |
| Computing and Combinatorics | 2005-06-15 | Paper |
| ON GEOMETRIC PATH QUERY PROBLEMS | 2005-06-10 | Paper |
| ON CONNECTING RED AND BLUE RECTILINEAR POLYGONAL OBSTACLES WITH NONINTERSECTING MONOTONE RECTILINEAR PATHS | 2005-06-10 | Paper |
| EFFICIENT ALGORITHMS FOR OPTIMIZATION-BASED IMAGE SEGMENTATION | 2005-06-10 | Paper |
| Efficient algorithms and implementations for optimizing the sum of linear fractional functions, with applications | 2005-05-17 | Paper |
| Efficient algorithms for \(k\)-terminal cuts on planar graphs | 2004-12-02 | Paper |
| GEOMETRIC ALGORITHMS FOR STATIC LEAF SEQUENCING PROBLEMS IN RADIATION THERAPY | 2004-11-01 | Paper |
| Geometric permutations of higher dimensional spheres | 2004-10-13 | Paper |
| Finding an optimal path without growing the tree | 2004-10-01 | Paper |
| OPTIMAL POLYGON COVER PROBLEMS AND APPLICATIONS | 2004-09-29 | Paper |
| IMAGE SEGMENTATION WITH ASTEROIDALITY/TUBULARITY AND SMOOTHNESS CONSTRAINTS | 2004-09-29 | Paper |
| SPACE-EFFICIENT ALGORITHMS FOR APPROXIMATING POLYGONAL CURVES IN TWO-DIMENSIONAL SPACE | 2004-09-29 | Paper |
| TOPOLOGICAL PEELING AND APPLICATIONS | 2004-09-29 | Paper |
| EFFICIENT APPROXIMATION ALGORITHMS FOR PAIRWISE DATA CLUSTERING AND APPLICATIONS | 2004-09-29 | Paper |
| An Experimental Study and Comparison of Topological Peeling and Topological Walk | 2004-08-12 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4737229 | 2004-08-11 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4472522 | 2004-08-04 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4472528 | 2004-08-04 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4474100 | 2004-08-04 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4474113 | 2004-08-04 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4474114 | 2004-08-04 | Paper |
| Computing optimal beams in two and three dimensions | 2003-08-28 | Paper |
| Efficient parallel algorithms for planar \(st\)-graphs | 2003-08-17 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4411365 | 2003-07-08 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4411366 | 2003-07-08 | Paper |
| Two-variable linear programming in parallel | 2002-11-27 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4553232 | 2002-11-04 | Paper |
| Efficiently approximating polygonal paths in three and higher dimensions | 2002-06-17 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2768301 | 2002-03-24 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2768318 | 2002-01-30 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4945504 | 2001-10-07 | Paper |
| An efficient direct approach for computing shortest rectilinear paths among obstacles in a two-layer interconnection model | 2001-09-27 | Paper |
| Parallel algorithms for partitioning sorted sets and related problems | 2001-05-20 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4525711 | 2001-01-24 | Paper |
| Determining an optimal penetration among weighted regions in two and three dimensions | 2001-01-01 | Paper |
| Lower bounds for computing geometric spanners and approximate shortest paths | 2001-01-01 | Paper |
| Determining Weak Visibility of a Polygon from an Edge in Parallel | 2000-11-07 | Paper |
| Finding the Convex Hull of Discs in Parallel | 2000-11-07 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4952691 | 2000-10-23 | Paper |
| SKEW VORONOI DIAGRAMS | 2000-05-07 | Paper |
| Shortest Path Queries Among Weighted Obstacles in the Rectilinear Plane | 2000-03-19 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4252037 | 1999-10-06 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4218407 | 1999-03-30 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4218406 | 1998-11-11 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4247445 | 1998-01-01 | Paper |
| Rectilinear short path queries among rectangular obstacles | 1997-02-27 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4886059 | 1996-11-04 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4875174 | 1996-10-21 | Paper |
| Optimally Computing the Shortest Weakly Visible Subedge of a Simple Polygon | 1996-06-09 | Paper |
| COMPUTING THE ALL-PAIRS LONGEST CHAINS IN THE PLANE | 1996-03-18 | Paper |
| An optimal algorithm for shortest paths on weighted interval and circular-arc graphs, with applications | 1996-02-04 | Paper |
| AN OPTIMAL PARALLEL ALGORITHM FOR DETECTING WEAK VISIBILITY OF A SIMPLE POLYGON | 1995-05-17 | Paper |
| Optimal parallel hypercube algorithms for polygon problems | 1995-01-01 | Paper |
| On parallel rectilinear obstacle-avoiding paths | 1994-11-29 | Paper |
| An optimal parallel algorithm for the visibility of a simple polygon from a point | 1994-09-29 | Paper |
| Testing a simple polygon for monotonicity optimally in parallel | 1994-05-19 | Paper |
| Parallel rectilinear shortest paths with rectangular obstacles | 1992-09-27 | Paper |
| An optimal parallel algorithm for the minimum circle-cover problem | 1989-01-01 | Paper |
