| Publication | Date of Publication | Type |
|---|
| Computing in linear time a chord from which a simple polygon is weakly internally visible | 2023-03-21 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5875588 | 2023-02-03 | Paper |
| Efficient approximate shortest-path queries among isothetic rectangular obstacles | 2023-01-18 | Paper |
| An efficient algorithm for the proximity connected two center problem | 2022-08-30 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5091004 | 2022-07-21 | Paper |
| The weighted \(k\)-center problem in trees for fixed \(k\) | 2022-02-21 | Paper |
| Computation of spatial skyline points | 2021-01-07 | Paper |
| Bilinear Assignment Problem: Large Neighborhoods and Experimental Analysis of Algorithms | 2021-01-07 | Paper |
| Constant work-space algorithms for facility location problems | 2020-06-29 | Paper |
| Linear-time fitting of a \(k\)-step function | 2020-05-18 | Paper |
| Minsum \(k\)-sink problem on path networks | 2020-01-16 | Paper |
| Minmax-regret evacuation planning for cycle networks | 2019-10-15 | Paper |
| Minsum \(k\)-sink problem on dynamic flow path networks | 2018-09-06 | Paper |
| Optimizing squares covering a set of points | 2018-05-17 | Paper |
| The bilinear assignment problem: complexity and polynomially solvable special cases | 2017-12-01 | Paper |
| The $p$-Center Problem in Tree Networks Revisited | 2017-10-17 | Paper |
| Improved algorithms for computing \(k\)-sink on dynamic flow path networks | 2017-09-22 | Paper |
| Rectilinear path problems in restricted memory setup | 2017-06-19 | Paper |
| Geometric p-Center Problems with Centers Constrained to Two Lines | 2017-02-01 | Paper |
| On representing a simple polygon perceivable to a blind person | 2017-01-31 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2957510 | 2017-01-26 | Paper |
| Linear-Time Fitting of a k-Step Function | 2016-03-23 | Paper |
| Approximation Algorithms for Generalized MST and TSP in Grid Clusters | 2016-02-05 | Paper |
| Space-efficient algorithm for computing a centerpoint of a set of points in \(\mathbb{R}^2\) | 2016-01-21 | Paper |
| Improved algorithms for computing minmax regret sinks on dynamic path and tree networks | 2015-12-11 | Paper |
| Minmax regret 1-center algorithms for path/tree/unicycle/cactus networks | 2015-09-21 | Paper |
| Optimizing Squares Covering a Set of Points | 2015-09-11 | Paper |
| Improved Algorithms for Computing Minmax Regret 1-Sink and 2-Sink on Path Network | 2015-09-11 | Paper |
| Rectilinear Path Problems in Restricted Memory Setup | 2015-02-19 | Paper |
| A linear time algorithm for computing minmax regret 1-median on a tree network | 2015-01-19 | Paper |
| The cyclical scheduling problem | 2014-10-06 | Paper |
| Back-Up 2-Center on a Path/Tree/Cycle/Unicycle | 2014-09-26 | Paper |
| Improved Minmax Regret 1-Center Algorithms for Cactus Networks with c Cycles | 2014-03-31 | Paper |
| Improved algorithms to network \(p\)-center location problems | 2014-01-22 | Paper |
| The Cyclical Scheduling Problem | 2013-04-12 | Paper |
| Some variations on constrained minimum enclosing circle problem | 2013-03-25 | Paper |
| Computing Minmax Regret 1-Median on a Tree Network with Positive/Negative Vertex Weights | 2013-03-21 | Paper |
| Efficient algorithms for the conditional covering problem | 2012-11-27 | Paper |
| A Linear Time Algorithm for Computing Minmax Regret 1-Median on a Tree | 2012-09-25 | Paper |
| Selecting Good a Priori Sequences for Vehicle Routing Problem with Stochastic Demand | 2012-01-06 | Paper |
| Some Variations on Constrained Minimum Enclosing Circle Problem | 2011-01-08 | Paper |
| Approximation Algorithms for the Multi-Vehicle Scheduling Problem | 2010-12-09 | Paper |
| On intersecting a set of parallel line segments with a convex polygon of minimum area | 2010-03-24 | Paper |
| Computation of Non-dominated Points Using Compact Voronoi Diagrams | 2010-02-09 | Paper |
| Discrete and Computational Geometry | 2010-02-05 | Paper |
| Optimal movement of mobile sensors for barrier coverage of a planar region | 2009-11-25 | Paper |
| Optimal algorithms for the path/tree-shaped facility location problems in trees | 2009-10-23 | Paper |
| Collection depots facility location problems in trees | 2009-07-28 | Paper |
| Approximation Algorithms for a Network Design Problem | 2009-07-23 | Paper |
| Single facility collection depots location problem in the plane | 2009-06-18 | Paper |
| Optimal Algorithms for the Weighted p-Center Problems on the Real Line for Small p | 2009-02-17 | Paper |
| Single Vehicle Scheduling Problems on Path/Tree/Cycle Networks with Release and Handling Times | 2009-01-29 | Paper |
| Optimal Movement of Mobile Sensors for Barrier Coverage of a Planar Region | 2009-01-27 | Paper |
| An Optimal Algorithm for the Continuous/Discrete Weighted 2-Center Problem in Trees | 2008-09-18 | Paper |
| New Upper Bounds on Continuous Tree Edge-Partition Problem | 2008-07-10 | Paper |
| Optimal Algorithms for the Path/Tree-Shaped Facility Location Problems in Trees | 2008-04-24 | Paper |
| Computing the maximum clique in the visibility graph of a simple polygon | 2008-01-11 | Paper |
| Mathematical Foundations of Computer Science 2003 | 2007-12-07 | Paper |
| Efficient algorithms for center problems in cactus networks | 2007-07-09 | Paper |
| Efficient computation of 2-medians in a tree network with positive/negative weights | 2007-05-29 | Paper |
| Algorithms and Computation | 2006-11-14 | Paper |
| Efficient computation of 2-medians in a tree network with positive/negative weights | 2006-08-04 | Paper |
| Algorithms – ESA 2005 | 2006-06-27 | Paper |
| A linear time algorithm to remove winding of a simple polygon | 2006-04-28 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4779120 | 2002-11-24 | Paper |
| Optimally computing a shortest weakly visible line segment inside a simple polygon | 2002-09-03 | Paper |
| On computing the optimal bridge between two convex polygons. | 2002-07-14 | Paper |
| Efficient algorithms for centers and medians in interval and circular-arc graphs | 2002-07-01 | Paper |
| Improved algorithms for uniform partitions of points | 2002-05-21 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2753927 | 2001-11-11 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4511244 | 2001-08-12 | Paper |
| Characterizing LR-visibility polygons and related problems | 2001-04-24 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4511241 | 2001-03-06 | Paper |
| COMPUTING A SHORTEST WEAKLY EXTERNALLY VISIBLE LINE SEGMENT FOR A SIMPLE POLYGON | 2000-11-07 | Paper |
| Optimal algorithms for some intersection radius problems | 1999-08-31 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4256651 | 1999-08-08 | Paper |
| On a Simple, Practical, Optimal, Output-Sensitive Randomized Planar Convex Hull Algorithm | 1998-09-27 | Paper |
| AnO(m+nlogn) Algorithm for the Maximum-Clique Problem in Circular-Arc Graphs | 1998-05-25 | Paper |
| A Linear Algorithm for Maximum Weight Cliques in Proper Circular Arc Graphs | 1997-01-22 | Paper |
| An Optimal Algorithm for the Intersection Radius of a Set of Convex Polygons | 1996-12-11 | Paper |
| An optimal algorithm to translate a convex polyhedron through a two-dimensional convex window | 1994-08-29 | Paper |
| COMPUTING SHORTEST TRANSVERSALS OF SETS | 1993-11-26 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4036601 | 1993-05-18 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4037437 | 1993-05-18 | Paper |
| Computing shortest transversals | 1991-01-01 | Paper |
| Efficient reconstruction of binary trees from their transversals | 1989-01-01 | Paper |
| Fast algorithms for computing the diameter of a finite planar set | 1988-01-01 | Paper |
| Computing the volume of the union of spheres | 1988-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3796753 | 1988-01-01 | Paper |
| Solving the two-dimensional findpath problem using a line-triangle representation of the robot | 1988-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3779744 | 1987-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3716329 | 1985-01-01 | Paper |
| A new linear convex hull algorithm for simple polygons (Corresp.) | 1984-01-01 | Paper |
| Optimal algorithms for computing the minimum distance between two finite planar sets | 1983-01-01 | Paper |
| Efficient algorithms for computing the maximum distance between two finite planar sets | 1983-01-01 | Paper |
| An upper bound on the probability of misclassification in terms of Matusita's measure of affinity | 1982-01-01 | Paper |
| On the multimodality of distances in convex polygons | 1982-01-01 | Paper |
| A Counterexample to a Diameter Algorithm for Convex Polygons | 1982-01-01 | Paper |
