Minimizing the continuous diameter when augmenting a tree with a shortcut
In: Algorithms and Data Structures - Cham: Springer, S. 301-312, 2017 - (Lecture Notes in Computer Science; 10389)

On interval methods with zero rewriting and exact geometric computation
In: Mathematical Aspects of Computer and Information Sciences - Cham: Springer, S. 211-226, 2017 - (Lecture Notes in Computer Science; 10693)

Precision-driven computation in the evaluation of expression-dags with common subexpressions - problems and solutions
In: Mathematical Aspects of Computer and Information Sciences: 6th International Conference, MACIS 2015, Berlin, Germany, November 11-13, 2015, Revised Selected Papers - Cham: Springer International Publishing, S. 451-465, 2016 - (Lecture Notes in Computer Science; 9582)

Algorithm engineering for expression dag based number types
In: Magdeburg Univ., Fak. für Informatik, Diss., 2015, V, 183 S., graph. Darst.

On the use of adaptive, exact decisions number types based on expression-dags in geometric computing
In: 26th Canadian Conference on Computational Geometry: Halifax, Nova Scotia, August 11-13, 2014, S. 412-418

Network farthest-point diagrams
In: De.arxiv.org - [S.l.]: Arxiv.org, insges. 26 S., 2013

On design and implementation of a generic number type for real algebraic number computations based on expression dags
In: Mathematics in computer science. - Basel : Birkhäuser, Bd. 4.2011, 4, S. 539-556

Algorithm engineering - bridging the gap between algorithm theory and practice
In: Berlin [u.a.]: Springer, 2010; XVI, 513 S.: graph. Darst. - (Lecture notes in computer science; 5971), ISBN 3642148654

Chapter 1. Foundations of algorithm engineering
In: Algorithm engineering . - Berlin [u.a.] : Springer, ISBN 3-642-14865-4, S. 1-15; Lecture notes in computer science; 5971

Chapter 10. Challenges in algorithm engineering
In: Algorithm engineering . - Berlin [u.a.] : Springer, ISBN 3-642-14865-4, S. 446-453; Lecture notes in computer science; 5971

Much ado about zero
In: Efficient algorithms . - Berlin [u.a.] : Springer, ISBN 3-642-03455-1, S. 408-421; Lecture notes in computer science; 5760

Classroom examples of robustness problems in geometric computations
In: Computational geometry . - Amsterdam : Elsevier, Bd. 40.2008, 1, S. 61-78

How reliable are practical point-in-polygon strategies?
In: Algorithms - ESA 2008 . - Berlin [u.a.] : Springer, ISBN 3-540-87743-6, S. 744-755; Lecture notes in computer science; 5193 ; Kongress: ESA; 16 (Karlsruhe) : 2008.09.15-17

On the design and performance of reliable geometric predicates using error-free transformations and exact sign of sum algorithms
In: Proceedings of the 19th Canadian Conference on Computational Geometry, CCCG 2007 . - Ottawa : Prosenjit Bose, ISBN 978-0-7709-0520-0, S. 45-48 ; Kongress: CCCG 2007; 19 (Ottawa) : 2007.08.20-22

Experimental comparison of the cost of approximate and exact convex hull computation in the plane
In: Proceedings of the 18th Canadian Conference on Computational Geometry . - Kingston, ON : Queen\'s Univ., S. 19-22, 2006 ; Kongress: CCCG; 18 (Kingston, Ontario) : 2006.08.14-16

Classroom examples of robustness problems in geometric computations.
In: Albers, Susanne (Hrsg.) ; Radzik, Tomasz (Hrsg.): Algorithms, ESA 2004 (12th annual European symposium Bergen, Norway, September 14 - 17 2004). - proceedings. Berlin : Springer, 2004, S. 702 - 713 (Lecture notes in computer science 3221) . - ESA 2004

Invited lecture : real numbers and robustness in computational geometry.
In: Frougny, Christiane (Hrsg.) ; ... (Hrsg.): Real numbers and computers, RNCï6 (6th conference Dagstuhl, Germany November 15 - 17 2004). Trier : Univ., 2004, S. 7 - 21 (Trierer Forschungsberichte 04-8)