| Publication | Date of Publication | Type |
|---|
| Minimizing Maximum Unmet Demand by Transportations Between Adjacent Nodes Characterized by Supplies and Demands | 2023-11-16 | Paper |
| Transportation Problem Allowing Sending and Bringing Back | 2023-08-18 | Paper |
| Transportation problem on a graph | 2023-01-17 | Paper |
| Space filling curves and their use in the design of geometric data structures | 2022-08-16 | Paper |
| A new transportation problem on a graph with sending and bringing-back operations | 2021-10-04 | Paper |
| Pseudo approximation algorithms, with applications to optimal motion planning | 2018-11-23 | Paper |
| A new algorithmic framework for basic problems on binary images | 2017-05-12 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2968076 | 2017-03-09 | Paper |
| Depth-First Search Using $$O(n)$$ Bits | 2015-09-11 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2934662 | 2014-12-18 | Paper |
| The distance trisector curve | 2014-11-25 | Paper |
| $\widetilde{O}(\sqrt{n})$ -Space and Polynomial-Time Algorithm for Planar Directed Graph Reachability | 2014-10-14 | Paper |
| Reprint of: Memory-constrained algorithms for simple polygons | 2014-01-22 | Paper |
| Constant-Work-Space Algorithms for Shortest Paths in Trees and Simple Polygons | 2013-11-28 | Paper |
| Time-Space Tradeoffs for All-Nearest-Larger-Neighbors Problems | 2013-08-12 | Paper |
| Memory-constrained algorithms for simple polygons | 2013-07-31 | Paper |
| Priority Queues and Sorting for Read-Only Data | 2013-05-28 | Paper |
| A New Framework for Connected Components Labeling of Binary Images | 2013-04-04 | Paper |
| Small Work Space Algorithms for Some Basic Problems on Binary Images | 2013-04-04 | Paper |
| In-place algorithm for erasing a connected component in a binary image | 2012-12-06 | Paper |
| Faster computation of the Robinson-Foulds distance between phylogenetic networks | 2012-10-02 | Paper |
| Constant-Work-Space Image Scan with a Given Angle | 2011-05-18 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3084820 | 2011-03-25 | Paper |
| The Structure and Number of Global Roundings of a Graph | 2011-03-18 | Paper |
| In-Place Linear-Time Algorithms for Euclidean Distance Transform | 2010-11-02 | Paper |
| Faster Computation of the Robinson-Foulds Distance between Phylogenetic Networks | 2010-07-26 | Paper |
| Online uniformity of integer points on a line | 2010-06-09 | Paper |
| Disc covering problem with application to digital halftoning | 2010-05-10 | Paper |
| Some theoretical challenges in digital geometry: a perspective | 2010-04-28 | Paper |
| Aspect-ratio Voronoi diagram and its complexity bounds | 2010-03-24 | Paper |
| OPTIMAL TRIANGULATIONS OF POINTS AND SEGMENTS WITH STEINER POINTS | 2010-03-19 | Paper |
| Constant-Work-Space Algorithm for a Shortest Path in a Simple Polygon | 2010-02-09 | Paper |
| Finding Nearest Larger Neighbors | 2009-11-12 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3625837 | 2009-05-22 | Paper |
| CONSTRUCTING OPTIMAL HIGHWAYS | 2009-04-14 | Paper |
| A linear-space algorithm for distance preserving graph embedding | 2009-03-09 | Paper |
| Constant-Working-Space Algorithms: How Fast Can We Solve Problems without Using Any Extra Array? | 2009-01-29 | Paper |
| Voronoi diagrams with respect to criteria on vision information | 2008-09-25 | Paper |
| Zone Diagrams: Existence, Uniqueness, and Algorithmic Challenge | 2008-08-14 | Paper |
| Optimal Triangulation with Steiner Points | 2008-05-27 | Paper |
| In-Place Algorithm for Image Rotation | 2008-05-27 | Paper |
| A generalization of magic squares with applications to digital halftoning | 2008-04-03 | Paper |
| Computational Science and Its Applications – ICCSA 2004 | 2007-07-19 | Paper |
| The distance trisector curve | 2007-05-23 | Paper |
| POLYLINE FITTING OF PLANAR POINTS UNDER MIN-SUM CRITERIA | 2006-05-29 | Paper |
| Algorithms and Computation | 2005-12-22 | Paper |
| Algorithms and Computation | 2005-12-22 | Paper |
| Algorithm Theory - SWAT 2004 | 2005-09-07 | Paper |
| Combinatorial Image Analysis | 2005-08-12 | Paper |
| EFFICIENT ALGORITHMS FOR OPTIMIZATION-BASED IMAGE SEGMENTATION | 2005-06-10 | Paper |
| Optimal spanners for axis-aligned rectangles | 2005-02-09 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4829028 | 2004-11-29 | Paper |
| The structure and number of global roundings of a graph | 2004-10-27 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4474128 | 2004-08-04 | Paper |
| Pseudo approximation algorithms with applications to optimal motion planning | 2004-03-11 | Paper |
| Spanning trees crossing few barriers | 2004-02-05 | Paper |
| Matrix Rounding under the Lp-Discrepancy Measure and Its Application to Digital Halftoning | 2003-09-28 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4418982 | 2003-07-31 | Paper |
| Algorithmic Evaluation of Line Detection Problem | 2003-07-09 | Paper |
| Translating a convex polyhedron over monotone polyhedra | 2003-03-10 | Paper |
| Shattering a set of objects in 2D | 2002-08-29 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4530817 | 2002-06-09 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4331296 | 2002-05-15 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4511235 | 2001-12-05 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2728901 | 2001-11-06 | Paper |
| A unified scheme for detecting fundamental curves in binary edge images | 2001-09-27 | Paper |
| Dynamically maintaining the widest \(k\)-dense corridor | 2001-08-20 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2708237 | 2001-08-14 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2722004 | 2001-07-11 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4526992 | 2001-02-28 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4761861 | 2001-02-21 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4761862 | 2001-02-21 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4525761 | 2001-01-24 | Paper |
| A new approximation algorithm for the capacitated vehicle routing problem on a tree | 2001-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4945520 | 2000-11-13 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4504017 | 2000-09-14 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4935169 | 2000-01-30 | Paper |
| Space-filling curves and their use in the design of geometric data structures | 1998-07-22 | Paper |
| Variants for the Hough transform for line detection | 1996-11-04 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4875174 | 1996-10-21 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4873786 | 1996-04-21 | Paper |
| EFFICIENT ENUMERATION OF GRID POINTS IN A CONVEX POLYGON AND ITS APPLICATION TO INTEGER PROGRAMMING | 1995-03-01 | Paper |
| WALKING IN AN ARRANGEMENT TOPOLOGICALLY | 1994-11-06 | Paper |
| Algorithms for projecting points to give the most uniform distribution with applications to hashing | 1993-06-29 | Paper |
| Shortest path between two simple polygons | 1987-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3787490 | 1987-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3787491 | 1987-01-01 | Paper |
| Generating and counting valid patterns in routes between two points | 1986-01-01 | Paper |
| Visibility of disjoint polygons | 1986-01-01 | Paper |
| Polygon triangulation: Efficiency and minimality | 1986-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3689213 | 1985-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3936659 | 1982-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4156337 | 1978-01-01 | Paper |
| A Wire-Routing Scheme Based on Trunk-Division Methods | 1977-01-01 | Paper |
