| Publication | Date of Publication | Type |
|---|
Minimum partition into plane subgraphs: the CG:SHOP challenge 2022
ACM Journal of Experimental Algorithmics | 2024-07-26 | Paper |
Minimizing the continuous diameter when augmenting a geometric tree with a shortcut
Computational Geometry | 2020-10-23 | Paper |
An integral LP relaxation for a drayage problem
Discrete Optimization | 2019-06-13 | Paper |
On interval methods with zero rewriting and exact geometric computation
Mathematical Aspects of Computer and Information Sciences | 2019-03-14 | Paper |
| Minimizing the continuous diameter when augmenting a tree with a shortcut | 2017-09-22 | Paper |
Network farthest-point diagrams
(available as arXiv preprint) | 2017-03-09 | Paper |
Precision-driven computation in the evaluation of expression-dags with common subexpressions: problems and solutions
Mathematical Aspects of Computer and Information Sciences | 2016-05-25 | Paper |
| scientific article; zbMATH DE number 6472648 (Why is no real title available?) | 2015-08-14 | Paper |
A Note on Sekigawa’s Zero Separation Bound
Computer Algebra in Scientific Computing | 2014-07-07 | Paper |
On design and implementation of a generic number type for real algebraic number computations based on expression dags
Mathematics in Computer Science | 2012-01-02 | Paper |
Much Ado about Zero
Lecture Notes in Computer Science | 2009-11-12 | Paper |
A separation bound for real algebraic expressions
Algorithmica | 2009-07-24 | Paper |
Reply to “Backward Error Analysis ...”
Computational Science and Its Applications - ICCSA 2006 | 2009-01-27 | Paper |
Classroom examples of robustness problems in geometric computations
Computational Geometry | 2008-03-26 | Paper |
Edge-coloring bipartite multigraphs in \(O(E \log D)\) time
Combinatorica | 2007-03-29 | Paper |
Algorithms – ESA 2004
Lecture Notes in Computer Science | 2005-08-18 | Paper |
| scientific article; zbMATH DE number 1875420 (Why is no real title available?) | 2003-03-02 | Paper |
| On the design of CGAL a computational geometry algorithms library | 2003-01-23 | Paper |
| scientific article; zbMATH DE number 1639663 (Why is no real title available?) | 2001-11-05 | Paper |
A strong and easily computable separation bound for arithmetic expressions involving radicals
Algorithmica | 2001-01-29 | Paper |
| scientific article; zbMATH DE number 1424302 (Why is no real title available?) | 2000-10-31 | Paper |
Checking geometric programs or verification of geometric structures
Computational Geometry | 1999-05-03 | Paper |
| scientific article; zbMATH DE number 1003230 (Why is no real title available?) | 1997-04-23 | Paper |
Queries on Voronoi diagrams on moving points
Computational Geometry | 1997-03-03 | Paper |
Approximate decision algorithms for point set congruence
Computational Geometry | 1994-08-03 | Paper |
Approximate motion planning and the complexity of the boundary of the union of simple geometric figures
Algorithmica | 1993-01-17 | Paper |
Approximate decision algorithms for approximate congruence
Information Processing Letters | 1993-01-16 | Paper |
