| Publication | Date of Publication | Type |
|---|
| Erratum for “Global Identifiability of Differential Models” | 2024-01-23 | Paper |
| SIAN | 2023-03-03 | Paper |
| Combinatorial complexity of signed discs | 2023-01-18 | Paper |
| On μ-symmetric polynomials | 2022-10-27 | Paper |
| An algorithmic approach to small limit cycles of nonlinear differential systems: the averaging method revisited | 2022-09-22 | Paper |
| Rods and Rings: Soft Subdivision Planner for R^3 x S^2. | 2022-07-18 | Paper |
| Clustering complex zeros of triangular systems of polynomials | 2021-06-25 | Paper |
| Global Identifiability of Differential Models | 2020-11-13 | Paper |
| An Algorithmic Approach to Limit Cycles of Nonlinear Differential Systems | 2020-09-10 | Paper |
| Towards soft exact computation (invited talk) | 2020-04-29 | Paper |
| Root-finding with implicit deflation | 2020-04-29 | Paper |
| Pseudo approximation algorithms, with applications to optimal motion planning | 2018-11-23 | Paper |
| Amortized analysis of smooth quadtrees in all dimensions | 2018-11-01 | Paper |
| Implementation of a near-optimal complex root clustering algorithm | 2018-08-17 | Paper |
| On \(\mu\)-symmetric polynomials and D-plus | 2018-08-17 | Paper |
| Path Planning for Simple Robots using Soft Subdivision Search | 2018-01-30 | Paper |
| A near-optimal subdivision algorithm for complex root isolation based on the Pellet test and Newton iteration | 2017-11-22 | Paper |
| Shortest path amidst disc obstacles is computable | 2017-10-20 | Paper |
| Adaptive isotopic approximation of nonsingular curves | 2017-10-20 | Paper |
| Constructive root bound for <tt> k </tt>-ary rational input numbers | 2017-09-29 | Paper |
| Almost tight recursion tree bounds for the Descartes method | 2017-02-03 | Paper |
| Empirical study of an evaluation-based subdivision algorithm for complex root isolation | 2016-09-29 | Paper |
| Certified computation of planar Morse-Smale complexes | 2016-08-18 | Paper |
| Soft Subdivision Search in Motion Planning, II: Axiomatics | 2015-11-12 | Paper |
| On soft predicates in subdivision motion planning | 2015-07-27 | Paper |
| A simple but exact and efficient algorithm for complex root isolation | 2015-06-09 | Paper |
| Near optimal tree size bounds on a simple real root isolation algorithm | 2015-03-27 | Paper |
| On soft predicates in subdivision motion planning | 2015-02-17 | Paper |
| Isotopic Arrangement of Simple Curves: An Exact Numerical Approach Based on Subdivision | 2014-09-08 | Paper |
| Amortized Analysis of Smooth Quadtrees in All Dimensions | 2014-09-02 | Paper |
| Certified computation of planar morse-smale complexes | 2014-08-07 | Paper |
| On formulating simultaneity for studying parallelism and synchronization | 2014-03-14 | Paper |
| Analytic Root Clustering: A Complete Algorithm Using Soft Zero Tests | 2013-08-05 | Paper |
| Hypergeometric Functions in Exact Geometric Computation | 2013-04-19 | Paper |
| Lower bounds for zero-dimensional projections | 2012-05-13 | Paper |
| A Real Elementary Approach to the Master Recurrence and Generalizations | 2011-07-01 | Paper |
| Adaptive isotopic approximation of nonsingular curves: The parameterizability and nonlocal isotopy approach | 2011-06-03 | Paper |
| The Design of Core 2: A Library for Exact Numeric Computation in Geometry and Algebra | 2010-09-14 | Paper |
| An Experimental Study of Weighted k-Link Shortest Path Algorithms | 2010-06-02 | Paper |
| In Praise of Numerical Computation | 2009-11-12 | Paper |
| Complete numerical isolation of real roots in zero-dimensional triangular systems | 2009-06-18 | Paper |
| Foundations of Exact Rounding | 2009-02-24 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3601542 | 2009-02-10 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3601580 | 2009-02-10 | Paper |
| Reply to “Backward Error Analysis ...” | 2009-01-27 | Paper |
| Complete subdivision algorithms, II | 2009-01-20 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5301656 | 2009-01-20 | Paper |
| Theory of Real Computation According to EGC | 2009-01-13 | Paper |
| OPTIMAL VORONOI DIAGRAM CONSTRUCTION WITH n CONVEX SITES IN THREE DIMENSIONS | 2008-05-20 | Paper |
| Classroom examples of robustness problems in geometric computations | 2008-03-26 | Paper |
| Competitive on-line scheduling with level of service | 2007-12-20 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3447174 | 2007-06-28 | Paper |
| SHORTEST PATH AMIDST DISC OBSTACLES IS COMPUTABLE | 2007-02-09 | Paper |
| Constructive root bound for \(k\)-ary rational input numbers | 2007-01-09 | Paper |
| Algorithms and Data Structures | 2006-10-25 | Paper |
| Algorithms – ESA 2005 | 2006-06-27 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5718722 | 2006-01-16 | Paper |
| Algorithms – ESA 2004 | 2005-08-18 | Paper |
| Recent progress in exact geometric computation | 2005-06-01 | Paper |
| Pseudo approximation algorithms with applications to optimal motion planning | 2004-03-11 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4551383 | 2002-09-05 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2768338 | 2002-07-22 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4530835 | 2002-06-09 | Paper |
| Wavelet foveation | 2001-05-07 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4953977 | 2000-05-15 | Paper |
| A simultaneous search problem | 2000-03-19 | Paper |
| Precision-Sensitive Euclidean Shortest Path in 3-Space | 2000-03-19 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4230368 | 1999-08-16 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4401025 | 1999-03-02 | Paper |
| Combinatorial complexity of translating a box in polyhedral 3-space | 1998-08-30 | Paper |
| Primal dividing and dual pruning: Output-sensitive construction of four-dimensional polytopes and three-dimensional Voronoi diagrams | 1998-07-27 | Paper |
| Approximate Euclidean Shortest Paths in 3-Space | 1998-03-16 | Paper |
| Towards exact geometric computation | 1997-03-18 | Paper |
| Combinatorial complexity of signed discs | 1996-11-10 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4886058 | 1996-08-22 | Paper |
| The Habicht approach to subresultants | 1996-07-18 | Paper |
| Shortest paths for line segments | 1993-10-13 | Paper |
| Constructing the Voronoi diagram of a set of line segments in parallel | 1993-04-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4028871 | 1993-03-28 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4028900 | 1993-03-28 | Paper |
| Simultaneous inner and outer approximation of shapes | 1993-01-17 | Paper |
| Quantitative Steinitz's theorems with applications to multifingered grasping | 1992-06-28 | Paper |
| Refinement methods for geometric bounds in constructive solid geometry | 1992-06-28 | Paper |
| New Upper Bounds in Klee’s Measure Problem | 1992-06-27 | Paper |
| Constructive Whitney–Graustein Theorem: Or How to Untangle Closed Planar Curves | 1992-06-25 | Paper |
| Reversal Complexity | 1992-06-25 | Paper |
| A new lower bound construction for commutative Thue systems with applications | 1991-01-01 | Paper |
| A geometric consistency theorem for a symbolic perturbation scheme | 1990-01-01 | Paper |
| Symbolic treatment of geometric degeneracies | 1990-01-01 | Paper |
| Finding minimal convex nested polygons | 1989-01-01 | Paper |
| Mountain Climbing, Ladder Moving, and the Ring-Width of a Polygon | 1989-01-01 | Paper |
| The orthogonal convex skull problem | 1988-01-01 | Paper |
| Computing the link center of a simple polygon | 1988-01-01 | Paper |
| Parallel triangulation of a polygon in two calls to the trapezoidal map | 1988-01-01 | Paper |
| Parallel computational geometry | 1988-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3809814 | 1988-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4203687 | 1988-01-01 | Paper |
| An O(n log n) algorithm for the Voronoi diagram of a set of simple curve segments | 1987-01-01 | Paper |
| Generalized Voronoi diagrams for a ladder. II: Efficient construction of the diagram | 1987-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3028358 | 1987-01-01 | Paper |
| On k-Hulls and Related Problems | 1987-01-01 | Paper |
| Shape from probing | 1987-01-01 | Paper |
| New upper bounds for neighbor searching | 1986-01-01 | Paper |
| Generalized voronoi diagrams for moving a ladder. I: Topological analysis | 1986-01-01 | Paper |
| A parallel median algorithm | 1985-01-01 | Paper |
| A “retraction” method for planning the motion of a disc | 1985-01-01 | Paper |
| Strong NP-hardness of moving many discs | 1984-01-01 | Paper |
| Geometric retrieval problems | 1984-01-01 | Paper |
| The Format Model | 1984-01-01 | Paper |
| Some consequences of non-uniform conditions on uniform classes | 1983-01-01 | Paper |
| A hybrid algorithm for the shortest path between two nodes in the presence of few negative arcs | 1983-01-01 | Paper |
| On formulating simultaneity for studying parallelism and synchronization | 1980-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4190122 | 1979-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4125814 | 1977-01-01 | Paper |
| New upper bounds for selection | 1976-01-01 | Paper |
