Approximative Bewegungsplanungsverfahren. - Stefan Schirra (1992)

Selected Topics from Computational Geometry, Data Structures and Motion Planning. - Rudolf Fleischer; Otfried Fries; Kurt Mehlhorn; Stefan Meiser; Stefan Näher; Hans Rohnert; Stefan Schirra; Klaus Simon; Athanasios K. Tsakalidis; Christian Uhrig (Data Structures and Efficient Algorithms, 1992)

Approximate Motion Planning and the Complexity of the Boundary of the Union of Simple Geometric Figures. - Helmut Alt; Rudolf Fleischer; Michael Kaufmann 001; Kurt Mehlhorn; Stefan Näher; Stefan Schirra; Christian Uhrig (Algorithmica, 1992)

Approximate Decision Algorithms for Approximate Congruence. - Stefan Schirra (Inf. Process. Lett., 1992)

Moving a Disc Between Polygons. - Stefan Schirra (SCG, 1993)

Revenge of the Dog: Queries on Voronoi Diagrams of Moving Points. - Olivier Devillers; Mordecai J. Golin; Klara Kedem; Stefan Schirra (CCCG, 1994)

How to Compute the Voronoi Diagram of Line Segments: Theoretical and Experimental Results. - Christoph Burnikel; Kurt Mehlhorn; Stefan Schirra (ESA, 1994)

On Degeneracy in Geometric Computations. - Christoph Burnikel; Kurt Mehlhorn; Stefan Schirra (SODA, 1994)

Approximate Decision Algorithms for Point Set Congruence. - Paul J. Heffernan; Stefan Schirra (Comput. Geom., 1994)

Exact Geometric Computation in LEDA. - Christoph Burnikel; Jochen Könemann; Kurt Mehlhorn; Stefan Näher; Stefan Schirra; Christian Uhrig (SCG, 1995)

Velocity Planning for a Robot Moving along the Shortest Straight Line Path Among Moving Obstacles. - Kamala Krithivasan; Anna Rema; Stefan Schirra; P. I. Vijaykumar (CCCG, 1996)

Precision and Robustness in Geometric Computations. - Stefan Schirra (Algorithmic Foundations of Geographic Information Systems, 1996)

The CGAL Kernel: A Basis for Geometric Computation. - Andreas Fabri; Geert-Jan Giezeman; Lutz Kettner; Stefan Schirra; Sven Schönherr (WACG, 1996)

Queries on Voronoi Diagrams of Moving Points. - Olivier Devillers; Mordecai J. Golin; Klara Kedem; Stefan Schirra (Comput. Geom., 1996)

Computing the Minimum Diameter for Moving Points: An Exact Implementation Using Parametric Search. - Jörg Schwerdt; Michiel H. M. Smid; Stefan Schirra (SCG, 1997)

A Strong and Easily Computable Separation Bound for Arithmetic Expressions Involving Square Roots. - Christoph Burnikel; Rudolf Fleischer; Kurt Mehlhorn; Stefan Schirra (SODA, 1997)

Applications of the Generic Programming Paradigm in the Design of CGAL. - Hervé Brönnimann; Lutz Kettner; Stefan Schirra; Remco C. Veltkamp (Generic Programming, 1998)

A computational basis for higher-dimensional computational geometry and applications. - Kurt Mehlhorn; Michael Müller 002; Stefan Näher; Stefan Schirra; Michael Seel; Christian Uhrig; Joachim Ziegler (Comput. Geom., 1998)

A Case Study on the Cost of Geometric Computing. - Stefan Schirra (ALENEX, 1999)

Efficient Exact Geometric Computation Made Easy. - Christoph Burnikel; Rudolf Fleischer; Kurt Mehlhorn; Stefan Schirra (SCG, 1999)

Checking geometric programs or verification of geometric structures. - Kurt Mehlhorn; Stefan Näher; Michael Seel; Raimund Seidel; Thomas Schilz; Stefan Schirra; Christian Uhrig (Comput. Geom., 1999)

Robustness and Precision Issues in Geometric Computation. - Stefan Schirra (Handbook of Computational Geometry, 2000)

A Strong and Easily Computable Separation Bound for Arithmetic Expressions Involving Radicals. - Christoph Burnikel; Rudolf Fleischer; Kurt Mehlhorn; Stefan Schirra (Algorithmica, 2000)

On the design of CGAL a computational geometry algorithms library. - Andreas Fabri; Geert-Jan Giezeman; Lutz Kettner; Stefan Schirra; Sven Schönherr (Softw. Pract. Exp., 2000)

Exact Computation with leda_real - Theory and geometric Applications. - Kurt Mehlhorn; Stefan Schirra (Symbolic Algebraic Methods and Verification Methods, 2001)

Edge-Coloring Bipartite Multigraphs in O(E log D) Time. - Richard Cole 001; Kirstin Ost; Stefan Schirra (Comb., 2001)

Guest Editor's Foreword. - Mark de Berg; Stefan Schirra (Int. J. Comput. Geom. Appl., 2002)

Feasibility of the Exact Geometric Computation Paradigm for Largest Empty Anchored Cylinder Computation in the Plane. - Stefan Schirra (CCCG, 2005)

Experimental Comparison of the Cost of Approximate and Exact Convex Hull Computation in the Plane. - Jan Tusch; Stefan Schirra (CCCG, 2006)

Reply to "Backward Error Analysis ...". - Lutz Kettner; Kurt Mehlhorn; Sylvain Pion; Stefan Schirra; Chee-Keng Yap (ICCSA (1), 2006)

On the Design and Performance of Reliable Geometric Predicates using Error-free Transformations and Exact Sign of Sum Algorithms. - Marc Mörig; Stefan Schirra (CCCG, 2007)

How Reliable Are Practical Point-in-Polygon Strategies? - Stefan Schirra (ESA, 2008)

Classroom examples of robustness problems in geometric computations. - Lutz Kettner; Kurt Mehlhorn; Sylvain Pion; Stefan Schirra; Chee-Keng Yap (Comput. Geom., 2008)

Much Ado about Zero. - Stefan Schirra (Efficient Algorithms, 2009)

A Separation Bound for Real Algebraic Expressions. - Christoph Burnikel; Stefan Funke; Kurt Mehlhorn; Stefan Schirra; Susanne Schmitt (Algorithmica, 2009)

Foundations of Algorithm Engineering. - Matthias Müller-Hannemann; Stefan Schirra (Algorithm Engineering, 2010)

Challenges in Algorithm Engineering. - Matthias Müller-Hannemann; Stefan Schirra (Algorithm Engineering, 2010)

On Design and Implementation of a Generic Number Type for Real Algebraic Number Computations Based on Expression Dags. - Marc Mörig; Ivo Rössling; Stefan Schirra (Math. Comput. Sci., 2010)

A Note on Sekigawa's Zero Separation Bound. - Stefan Schirra (CASC, 2013)

Network Farthest-Point Diagrams. - Prosenjit Bose; Kai Dannies; Jean-Lou De Carufel; Christoph Doell; Carsten Grimm; Anil Maheshwari; Stefan Schirra; Michiel H. M. Smid (J. Comput. Geom., 2013)

On the Use of Adaptive, Exact Decisions Number Types Based on Expression-Dags in Geometric Computing. - Stefan Schirra (CCCG, 2014)

Precision-Driven Computation in the Evaluation of Expression-Dags with Common Subexpressions: Problems and Solutions. - Marc Mörig; Stefan Schirra (MACIS, 2015)

On Interval Methods with Zero Rewriting and Exact Geometric Computation. - Stefan Schirra; Martin Wilhelm (MACIS, 2017)

Minimizing the Continuous Diameter When Augmenting a Tree with a Shortcut. - Jean-Lou De Carufel; Carsten Grimm; Stefan Schirra; Michiel H. M. Smid (WADS, 2017)

Minimizing the continuous diameter when augmenting a geometric tree with a shortcut. - Jean-Lou De Carufel; Carsten Grimm; Anil Maheshwari; Stefan Schirra; Michiel H. M. Smid (Comput. Geom., 2020)

Minimum Partition into Plane Subgraphs: The CG: SHOP Challenge 2022. - Sándor P. Fekete; Phillip Keldenich; Dominik Krupke; Stefan Schirra (CoRR, 2022)

Minimum Coverage by Convex Polygons: The CG: SHOP Challenge 2023. - Sándor P. Fekete; Phillip Keldenich; Dominik Krupke; Stefan Schirra (CoRR, 2023)

Minimum Partition into Plane Subgraphs: The CG:SHOP Challenge 2022. - Sándor P. Fekete; Phillip Keldenich; Dominik Krupke; Stefan Schirra (ACM J. Exp. Algorithmics, 2023)

Maximum Polygon Packing: The CG: SHOP Challenge 2024. - Sándor P. Fekete; Phillip Keldenich; Dominik Krupke; Stefan Schirra (CoRR, 2024)

Minimum Non-Obtuse Triangulations: The CG:SHOP Challenge 2025. - Sándor P. Fekete; Phillip Keldenich; Dominik Krupke; Stefan Schirra (CoRR, 2025)