A systolic array algorithm for the algebraic path problem (shortest paths; Matrix inversion). - Günter Rote (Computing, 1985)

On the Connection Between Hexagonal and Unidirectional Rectangular Systolic Arrays. - Günter Rote (Aegean Workshop on Computing, 1986)

Book review. - Günter Rote; Milan Vlach (Z. Oper. Research, 1987)

Computing the Geodesic Center of a Simple Polygon. - Richard Pollack; Micha Sharir; Günter Rote (Discret. Comput. Geom., 1989)

Testing the Necklace Condition for Shortest Tours and Optimal Factors in the Plane. - Herbert Edelsbrunner; Günter Rote; Emo Welzl (Theor. Comput. Sci., 1989)

Minimum-Link Paths Among Obstacles in the Plane. - Joseph S. B. Mitchell; Günter Rote; Gerhard J. Woeginger (SCG, 1990)

Flattening a Rooted Tree. - Paul N. Hilfinger; Eugene L. Lawler; Günter Rote (Applied Geometry And Discrete Mathematics, 1990)

Shortest polygonal paths in space. - Rainer E. Burkard; Günter Rote; En-Yu Yao; Zhongliang Yu 001 (Computing, 1990)

Computing the Minimum Hausdorff Distance Between Two Point Sets on a Line Under Translation. - Günter Rote (Inf. Process. Lett., 1991)

Counting k-Subsets and Convex k-gons in the Plane. - Günter Rote; Gerhard J. Woeginger; Binhai Zhu; Zhengyan Wang (Inf. Process. Lett., 1991)

Geometric Clusterings. - Vasilis Capoyleas; Günter Rote; Gerhard J. Woeginger (J. Algorithms, 1991)

Degenerate Convex Hulls in High Dimensions without Extra Storage. - Günter Rote (SCG, 1992)

A New Metric Between Polygons and How to Compute it. - Günter Rote (ICALP, 1992)

Simultaneous Inner and Outer Approximation of Shapes. - Rudolf Fleischer; Kurt Mehlhorn; Günter Rote; Emo Welzl; Chee-Keng Yap (Algorithmica, 1992)

Minimum-Link Paths Among Obstacles in the Plan. - Joseph S. B. Mitchell; Günter Rote; Gerhard J. Woeginger (Algorithmica, 1992)

The convergence rate of the sandwich algorithm for approximating convex functions. - Günter Rote (Computing, 1992)

Finding Minimum Area k-gons. - David Eppstein; Mark H. Overmars; Günter Rote; Gerhard J. Woeginger (Discret. Comput. Geom., 1992)

Counting Convex k-Gons in Planar Point Sets. - Günter Rote; Gerhard J. Woeginger (Inf. Process. Lett., 1992)

The n-line traveling salesman problem. - Günter Rote (Networks, 1992)

Maintaining the Approximate Width of a Set of Points in the Plane. - Günter Rote; Christian Schwarz 002; Jack Snoeyink (CCCG, 1993)

Shortest Paths for Line Segments. - Christian Icking; Günter Rote; Emo Welzl; Chee-Keng Yap (Algorithmica, 1993)

On the Union of Fat Wedges and Separating a Collection of Segments By a Line. - Alon Efrat; Günter Rote; Micha Sharir (Comput. Geom., 1993)

A heuristic for decomposing traffic matrices in TDMA satellite communication. - Günter Rote; Andreas Vogel 004 (ZOR Methods Model. Oper. Res., 1993)

The Convex-Hull-and-Line Traveling Salesman Problem: A Solvable Case. - Vladimir G. Deineko; René van Dal; Günter Rote (Inf. Process. Lett., 1994)

Triangulations Intersect Nicely. - Oswin Aichholzer; Franz Aurenhammer; Michael Taschwer; Günter Rote (SCG, 1995)

A Dynamic Programming Algorithm for Constructing Optimal Refix-Free Codes for Unequal Letter Costs. - Mordecai J. Golin; Günter Rote (ICALP, 1995)

Vehicle routing in an automated warehouse: Analysis and optimization. - Rainer E. Burkard; Bernd Fruhwirth; Günter Rote (Ann. Oper. Res., 1995)

Counting Convex Polygons in Planar Point Sets. - Joseph S. B. Mitchell; Günter Rote; Gopalakrishnan Sundaram; Gerhard J. Woeginger (Inf. Process. Lett., 1995)

Triangulations Intersect Nicely. - Oswin Aichholzer; Franz Aurenhammer; Siu-Wing Cheng; Naoki Katoh; Günter Rote; Michael Taschwer; Yin-Feng Xu (Discret. Comput. Geom., 1996)

On the distribution of sums of vectors in general position. - Jerrold R. Griggs; Günter Rote (Contemporary Trends in Discrete Mathematics, 1997)

Three-clustering of Points in the Plane. - Johann Hagauer; Günter Rote (Comput. Geom., 1997)

Matching Shapes with a Reference Point. - Oswin Aichholzer; Helmut Alt; Günter Rote (Int. J. Comput. Geom. Appl., 1997)

Finding a Shortest Vector in a Two-Dimensional Lattice Modulo m. - Günter Rote (Theor. Comput. Sci., 1997)

Minimizing the Number of Tardy Jobs on a Single Machine with Batch Setup Times. - Günter Rote; Gerhard J. Woeginger (Acta Cybern., 1998)

Matching Convex Shapes with Respect to the Symmetric Difference. - Helmut Alt; Ulrich Fuchs 001; Günter Rote; Gerald Weber (Algorithmica, 1998)

Approximation of convex figures by pairs of rectangles. - Otfried Schwarzkopf; Ulrich Fuchs 001; Günter Rote; Emo Welzl (Comput. Geom., 1998)

Constant-Level Greedy Triangulations Approximate the MWT Well. - Oswin Aichholzer; Franz Aurenhammer; Günter Rote; Yin-Feng Xu (J. Comb. Optim., 1998)

A Visibility Representation for Graphs in Three Dimensions. - Prosenjit Bose; Hazel Everett; Sándor P. Fekete; Michael E. Houle; Anna Lubiw; Henk Meijer; Kathleen Romanik; Günter Rote; Thomas C. Shermer; Sue Whitesides; Christian Zelle (J. Graph Algorithms Appl., 1998)

The quadratic assignment problem with a monotone anti-Monge and a symmetric Toeplitz matrix: Easy and hard cases. - Rainer E. Burkard; Eranda Çela; Günter Rote; Gerhard J. Woeginger (Math. Program., 1998)

A Dynamic Programming Algorithm for Constructing Optimal Prefix-Free Codes with Unequal Letter Costs. - Mordecai J. Golin; Günter Rote (IEEE Trans. Inf. Theory, 1998)

Every Polygon Can Be Untangled. - Robert Connelly; Erik D. Demaine; Günter Rote (EuroCG, 2000)

Straighting Polygonal Arcs and Convexifying Polygonal Cycles. - Robert Connelly; Erik D. Demaine; Günter Rote (FOCS, 2000)

A Central Limit Theorem for Convex Chains in the Square. - Imre Bárány; Günter Rote; William L. Steiger; Cun-Hui Zhang (Discret. Comput. Geom., 2000)

Upper Bounds on the Maximal Number of Facets of 0/1-Polytopes. - Tamás Fleiner; Volker Kaibel; Günter Rote (Eur. J. Comb., 2000)

Division-Free Algorithms for the Determinant and the Pfaffian: Algebraic and Combinatorial Approaches. - Günter Rote (Computational Discrete Mathematics, 2001)

Fast Reduction of Ternary Quadratic Forms. - Friedrich Eisenbrand; Günter Rote (CaLC, 2001)

Counting triangulations and pseudo-triangulations of wheels. - Dana Randall; Günter Rote; Francisco Santos; Jack Snoeyink (CCCG, 2001)

Fast 2-Variable Integer Programming. - Friedrich Eisenbrand; Günter Rote (IPCO, 2001)

Generalized self-approaching curves. - Oswin Aichholzer; Franz Aurenhammer; Christian Icking; Rolf Klein; Elmar Langetepe; Günter Rote (Discret. Appl. Math., 2001)

Triangles of Extremal Area or Perimeter in a Finite Planar Point Set. - Peter Braß; Günter Rote; Konrad J. Swanepoel (Discret. Comput. Geom., 2001)

The Obnoxious Center Problem on a Tree. - Rainer E. Burkard; Helidon Dollani; Yixun Lin; Günter Rote (SIAM J. Discret. Math., 2001)

Pseudotriangulations, polytopes, and how to expand linkages. - Günter Rote (SCG, 2002)

Toward Optimal Diffusion Matrices. - Robert Elsässer; Burkhard Monien; Günter Rote; Stefan Schamberger (IPDPS, 2002)

Covering shapes by ellipses. - Alon Efrat; Frank Hoffmann 002; Christian Knauer; Klaus Kriegel; Günter Rote; Carola Wenk (SODA, 2002)

Crossing the Bridge at Night. - Günter Rote (Bull. EATCS, 2002)

On Constrained Minimum Pseudotriangulations. - Günter Rote; Cao An Wang; Lusheng Wang 001; Yin-Feng Xu (COCOON, 2003)

The complexity of (un)folding. - Helmut Alt; Christian Knauer; Günter Rote; Sue Whitesides (SCG, 2003)

Incremental constructions con BRIO. - Nina Amenta; Sunghee Choi; Günter Rote (SCG, 2003)

Finding a curve in a map. - Carola Wenk; Helmut Alt; Alon Efrat; Lingeshwaran Palaniappan; Günter Rote (SCG, 2003)

Pursuit-evasion with imprecise target location. - Günter Rote (SODA, 2003)

The Zigzag Path of a Pseudo-Triangulation. - Oswin Aichholzer; Günter Rote; Bettina Speckmann; Ileana Streinu (WADS, 2003)

Straightening Polygonal Arcs and Convexifying Polygonal Cycles. - Robert Connelly; Erik D. Demaine; Günter Rote (Discret. Comput. Geom., 2003)

Matching planar maps. - Helmut Alt; Alon Efrat; Günter Rote; Carola Wenk (J. Algorithms, 2003)

On the Fréchet distance of a set of curves. - Adrian Dumitrescu; Günter Rote (CCCG, 2004)

Covering with Ellipses. - Alon Efrat; Frank Hoffmann 002; Christian Knauer; Klaus Kriegel; Günter Rote; Carola Wenk (Algorithmica, 2004)

Non-Crossing Frameworks with Non-Crossing Reciprocals. - David Orden; Günter Rote; Francisco Santos; Brigitte Servatius; Herman Servatius; Walter Whiteley (Discret. Comput. Geom., 2004)

Improved lower bound on the geometric dilation of point sets. - Adrian Dumitrescu; Ansgar Grüne; Günter Rote (EuroCG, 2005)

A pointed Delaunay pseudo-triangulation of a simple polygon. - Günter Rote; André Schulz 001 (EuroCG, 2005)

Strictly convex drawings of planar graphs. - Günter Rote (SODA, 2005)

On Geometric Dilation and Halving Chords. - Adrian Dumitrescu; Annette Ebbers-Baumann; Ansgar Grüne; Rolf Klein; Günter Rote (WADS, 2005)

Simple and optimal output-sensitive construction of contour trees using monotone paths. - Yi-Jen Chiang; Tobias Lenz; Xiang Lu; Günter Rote (Comput. Geom., 2005)

Planar minimally rigid graphs and pseudo-triangulations. - Ruth Haas; David Orden; Günter Rote; Francisco Santos; Brigitte Servatius; Herman Servatius; Diane L. Souvaine; Ileana Streinu; Walter Whiteley (Comput. Geom., 2005)

Strictly convex drawings of planar graphs - Imre Bárány; Günter Rote (CoRR, 2005)

Threshold arrangements and the knapsack problem. - Günter Rote; André Schulz 001 (Appl. Math. Lett., 2006)

New upper bounds on the quality of the PCA bounding boxes in r2 and r3. - Darko Dimitrov; Christian Knauer; Klaus Kriegel; Günter Rote (SCG, 2007)

Embedding 3-polytopes on a small grid. - Ares Ribó Mor; Günter Rote; André Schulz 001 (SCG, 2007)

Matrix scaling by network flow. - Günter Rote; Martin Zachariasen (SODA, 2007)

On the geometric dilation of closed curves, graphs, and point sets. - Adrian Dumitrescu; Annette Ebbers-Baumann; Ansgar Grüne; Rolf Klein; Günter Rote (Comput. Geom., 2007)

Computing the Fréchet distance between piecewise smooth curves. - Günter Rote (Comput. Geom., 2007)

Planar Embeddings of Graphs with Specified Edge Lengths. - Sergio Cabello; Erik D. Demaine; Günter Rote (J. Graph Algorithms Appl., 2007)

Partitioning a Polygon into Two Mirror Congruent Pieces. - Dania El-Khechen; John Iacono; Thomas Fevens; Günter Rote (CCCG, 2008)

Geometric clustering: fixed-parameter tractability and lower bounds with respect to the dimension. - Sergio Cabello; Panos Giannopoulos; Christian Knauer; Günter Rote (SODA, 2008)

Matching point sets with respect to the Earth Mover's Distance. - Sergio Cabello; Panos Giannopoulos; Christian Knauer; Günter Rote (Comput. Geom., 2008)

Approximation of an open polygonal curve with a minimum number of circular arcs and biarcs. - Robert L. Scot Drysdale; Günter Rote; Astrid Sturm (Comput. Geom., 2008)

There Are Not Too Many Magic Configurations. - Eyal Ackerman; Kevin Buchin; Christian Knauer; Rom Pinchasi; Günter Rote (Discret. Comput. Geom., 2008)

Minimum-weight triangulation is NP-hard. - Wolfgang Mulzer; Günter Rote (J. ACM, 2008)

Detecting Hotspots in Geographic Networks. - Kevin Buchin; Sergio Cabello; Joachim Gudmundsson; Maarten Löffler; Jun Luo 008; Günter Rote; Rodrigo I. Silveira; Bettina Speckmann; Thomas Wolle (AGILE Conf., 2009)

Constant-Working-Space Algorithms for Geometric Problems. - Tetsuo Asano; Günter Rote (CCCG, 2009)

Two Applications of Point Matching. - Günter Rote (Computational Geometry, 2009)

The Parameterized Complexity of Some Geometric Problems in Unbounded Dimension. - Panos Giannopoulos; Christian Knauer; Günter Rote (IWPEC, 2009)

Resolving Loads with Positive Interior Stresses. - Günter Rote; André Schulz 001 (WADS, 2009)

Recovering Structure from r-Sampled Objects. - Oswin Aichholzer; Franz Aurenhammer; B. Kornberger; Simon Plantinga; Günter Rote; Astrid Sturm; Gert Vegter (Comput. Graph. Forum, 2009)

Bounds on the quality of the PCA bounding boxes. - Darko Dimitrov; Christian Knauer; Klaus Kriegel; Günter Rote (Comput. Geom., 2009)

The parameterized complexity of some geometric problems in unbounded dimension - Panos Giannopoulos; Christian Knauer; Günter Rote; Daniel Werner (CoRR, 2009)

Flip Graphs of Bounded-Degree Triangulations. - Oswin Aichholzer; Thomas Hackl; David Orden; Pedro Ramos 001; Günter Rote; André Schulz 001; Bettina Speckmann (Electron. Notes Discret. Math., 2009)

Formulae and Growth Rates of High-Dimensional Polycubes. - Ronnie Barequet; Gill Barequet; Günter Rote (Electron. Notes Discret. Math., 2009)

Wooden Geometric Puzzles: Design and Hardness Proofs. - Helmut Alt; Hans L. Bodlaender; Marc J. van Kreveld; Günter Rote; Gerard Tel (Theory Comput. Syst., 2009)

Integer Point Sets Minimizing Average Pairwise L1-Distance: What is the Optimal Shape of a Town? - Erik D. Demaine; Sándor P. Fekete; Günter Rote; Nils Schweer; Daria Schymura; Mariano Zelke (CoRR, 2010)

Locked and Unlocked Chains of Planar Shapes. - Robert Connelly; Erik D. Demaine; Martin L. Demaine; Sándor P. Fekete; Stefan Langerman; Joseph S. B. Mitchell; Ares Ribó; Günter Rote (Discret. Comput. Geom., 2010)

Acyclic Orientation of Drawings. - Eyal Ackerman; Kevin Buchin; Christian Knauer; Günter Rote (J. Graph Algorithms Appl., 2010)

Finding the Most Relevant Fragments in Networks. - Kevin Buchin; Sergio Cabello; Joachim Gudmundsson; Maarten Löffler; Jun Luo 008; Günter Rote; Rodrigo I. Silveira; Bettina Speckmann; Thomas Wolle (J. Graph Algorithms Appl., 2010)

Welcome from the Editors-in-Chief. - Kenneth L. Clarkson; Günter Rote (J. Comput. Geom., 2010)

Obnoxious Centers in Graphs. - Sergio Cabello; Günter Rote (SIAM J. Discret. Math., 2010)

Common Developments of Several Different Orthogonal Boxes. - Zachary Abel; Erik D. Demaine; Martin L. Demaine; Hiroaki Matsui; Günter Rote; Ryuhei Uehara (CCCG, 2011)

Convexifying Polygons Without Losing Visibilities. - Oswin Aichholzer; Greg Aloupis; Erik D. Demaine; Martin L. Demaine; Vida Dujmovic; Ferran Hurtado; Anna Lubiw; Günter Rote; André Schulz 001; Diane L. Souvaine; Andrew Winslow (CCCG, 2011)

Proper n-Cell Polycubes in n - 3 Dimensions. - Andrei Asinowski; Gill Barequet; Ronnie Barequet; Günter Rote (COCOON, 2011)

Realizing Planar Graphs as Convex Polytopes. - Günter Rote (GD, 2011)

Collapse. - Günter Rote; Uri Zwick (SODA, 2011)

Integer point sets minimizing average pairwise L1 distance: What is the optimal shape of a town? - Erik D. Demaine; Sándor P. Fekete; Günter Rote; Nils Schweer; Daria Schymura; Mariano Zelke (Comput. Geom., 2011)

Lines Pinning Lines. - Boris Aronov; Otfried Cheong; Xavier Goaoc; Günter Rote (Discret. Comput. Geom., 2011)

Small Grid Embeddings of 3-Polytopes. - Ares Ribó Mor; Günter Rote; André Schulz 001 (Discret. Comput. Geom., 2011)

Constant-Work-Space Algorithms for Geometric Problems. - Tetsuo Asano; Wolfgang Mulzer; Günter Rote; Yajun Wang (J. Comput. Geom., 2011)

Geometric clustering: Fixed-parameter tractability and lower bounds with respect to the dimension. - Sergio Cabello; Panos Giannopoulos; Christian Knauer; Dániel Marx; Günter Rote (ACM Trans. Algorithms, 2011)

Monotone Paths in Planar Convex Subdivisions. - Adrian Dumitrescu; Günter Rote; Csaba D. Tóth (COCOON, 2012)

Configuration space visualization. - Dror Atariah; Günter Rote (SCG, 2012)

Pointed drawings of planar graphs. - Oswin Aichholzer; Günter Rote; André Schulz 001; Birgit Vogtenhuber (Comput. Geom., 2012)

Convex hull alignment through translation. - Michael Hoffmann 001; Vincent Kusters; Günter Rote; Maria Saumell; Rodrigo I. Silveira (CCCG, 2013)

Coloring Hypergraphs Induced by Dynamic Point Sets and Bottomless Rectangles. - Andrei Asinowski; Jean Cardinal; Nathann Cohen; Sébastien Collette; Thomas Hackl; Michael Hoffmann 001; Kolja B. Knauer; Stefan Langerman; Michal Lason; Piotr Micek; Günter Rote; Torsten Ueckerdt (WADS, 2013)

Memory-constrained algorithms for simple polygons. - Tetsuo Asano; Kevin Buchin; Maike Buchin; Matias Korman; Wolfgang Mulzer; Günter Rote; André Schulz 001 (Comput. Geom., 2013)

Optimally solving a transportation problem using Voronoi diagrams. - Darius Geiß; Rolf Klein; Rainer Penninger; Günter Rote (Comput. Geom., 2013)

Fixed-parameter tractability and lower bounds for stabbing problems. - Panos Giannopoulos; Christian Knauer; Günter Rote; Daniel Werner (Comput. Geom., 2013)

The finest regular coarsening and recursively-regular subdivisions. - Rafel Jaume; Günter Rote (CoRR, 2013)

Add Isotropic Gaussian Kernels at Own Risk: More and More Resilient Modes in Higher Dimensions. - Herbert Edelsbrunner; Brittany Terese Fasy; Günter Rote (Discret. Comput. Geom., 2013)

On the Parameterization and the Geometry of the Configuration Space of a Single Planar Robot. - Dror Atariah; Sunayana Ghosh; Günter Rote (J. WSCG, 2013)

Graph Drawings with Relative Edge Length Specifications. - Oswin Aichholzer; Michael Hoffmann 001; Marc J. van Kreveld; Günter Rote (CCCG, 2014)

Quality Ratios of Measures for Graph Drawing Styles. - Michael Hoffmann 001; Marc J. van Kreveld; Vincent Kusters; Günter Rote (CCCG, 2014)

Reprint of: Memory-constrained algorithms for simple polygons. - Tetsuo Asano; Kevin Buchin; Maike Buchin; Matias Korman; Wolfgang Mulzer; Günter Rote; André Schulz 001 (Comput. Geom., 2014)

Reprint of: Optimally solving a transportation problem using Voronoi diagrams. - Darius Geiß; Rolf Klein; Rainer Penninger; Günter Rote (Comput. Geom., 2014)

Plane Graphs with Parity Constraints. - Oswin Aichholzer; Thomas Hackl; Michael Hoffmann 001; Alexander Pilz; Günter Rote; Bettina Speckmann; Birgit Vogtenhuber (Graphs Comb., 2014)

Advantage in the discrete Voronoi game. - Dániel Gerbner; Viola Mészáros; Dömötör Pálvölgyi; Alexey Pokrovskiy; Günter Rote (J. Graph Algorithms Appl., 2014)

λ > 4. - Gill Barequet; Günter Rote; Mira Shalah (ESA, 2015)

Congruence Testing of Point Sets in Three and Four Dimensions - Results and Techniques. - Günter Rote (MACIS, 2015)

Point sets with many non-crossing matchings. - Andrei Asinowski; Günter Rote (CoRR, 2015)

Triangulations with Circular Arcs. - Oswin Aichholzer; Wolfgang Aigner; Franz Aurenhammer; Katerina Cech Dobiásová; Bert Jüttler; Günter Rote (J. Graph Algorithms Appl., 2015)

Quasi-parallel segments and characterization of unique bichromatic matchings. - Andrei Asinowski; Tillmann Miltzow; Günter Rote (J. Comput. Geom., 2015)

Congruence Testing of Point Sets in 4-Space. - Heuna Kim; Günter Rote (SoCG, 2016)

Approximation and Hardness of Token Swapping. - Tillmann Miltzow; Lothar Narins; Yoshio Okamoto; Günter Rote; Antonis Thomas; Takeaki Uno (ESA, 2016)

Packing Short Plane Spanning Trees in Complete Geometric Graphs. - Oswin Aichholzer; Thomas Hackl; Matias Korman; Alexander Pilz; Günter Rote; André van Renssen; Marcel Roeloffzen; Birgit Vogtenhuber (ISAAC, 2016)

λ > 4: an improved lower bound on the growth constant of polyominoes. - Gill Barequet; Günter Rote; Mira Shalah (Commun. ACM, 2016)

Congruence Testing of Point Sets in 4 Dimensions. - Heuna Kim; Günter Rote (CoRR, 2016)

Tight Exact and Approximate Algorithmic Results on Token Swapping. - Tillmann Miltzow; Lothar Narins; Yoshio Okamoto; Günter Rote; Antonis Thomas; Takeaki Uno (CoRR, 2016)

Recursively-regular subdivisions and applications. - Rafel Jaume; Günter Rote (J. Comput. Geom., 2016)

Shortest path to a segment and quickest visibility queries. - Valentin Polishchuk; Esther M. Arkin; Alon Efrat; Christian Knauer; Joseph S. B. Mitchell; Günter Rote; Lena Schlipf; Topi Talvitie (J. Comput. Geom., 2016)

Ordered Level Planarity, Geodesic Planarity and Bi-Monotonicity. - Boris Klemz; Günter Rote (GD, 2017)

Search for the end of a path in the d-dimensional grid and in other graphs. - Dániel Gerbner; Balázs Keszegh; Dömötör Pálvölgyi; Günter Rote; Gábor Wiener (Ars Math. Contemp., 2017)

Packing Short Plane Spanning Graphs in Complete Geometric Graphs. - Oswin Aichholzer; Thomas Hackl; Matias Korman; Alexander Pilz; Günter Rote; André van Renssen; Marcel Roeloffzen; Birgit Vogtenhuber (CoRR, 2017)

Approximate Minimum-Weight Matching with Outliers Under Translation. - Pankaj K. Agarwal; Haim Kaplan; Geva Kipper; Wolfgang Mulzer; Günter Rote; Micha Sharir; Allen Xiao (ISAAC, 2018)

Point sets with many non-crossing perfect matchings. - Andrei Asinowski; Günter Rote (Comput. Geom., 2018)

Saturated simple and 2-simple topological graphs with few edges. - Péter Hajnal; Alexander Igamberdiev; Günter Rote; André Schulz 001 (J. Graph Algorithms Appl., 2018)

Windrose Planarity: Embedding Graphs with Direction-Constrained Edges. - Patrizio Angelini; Giordano Da Lozzo; Giuseppe Di Battista; Valentino Di Donato; Philipp Kindermann; Günter Rote; Ignaz Rutter (ACM Trans. Algorithms, 2018)

Loopless Gray code enumeration and the Tower of Bucharest. - Felix Herter; Günter Rote (Theor. Comput. Sci., 2018)

Geometric Multicut. - Mikkel Abrahamsen; Panos Giannopoulos; Maarten Löffler; Günter Rote (ICALP, 2019)

On Primal-Dual Circle Representations. - Stefan Felsner; Günter Rote (SOSA, 2019)

Isotonic Regression by Dynamic Programming. - Günter Rote (SOSA, 2019)

The Maximum Number of Minimal Dominating Sets in a Tree. - Günter Rote (SODA, 2019)

FPT Algorithms for Diverse Collections of Hitting Sets. - Julien Baste; Lars Jaffke; Tomás Masarík; Geevarghese Philip; Günter Rote (Algorithms, 2019)

Packing plane spanning graphs with short edges in complete geometric graphs. - Oswin Aichholzer; Thomas Hackl; Matias Korman; Alexander Pilz; André van Renssen; Marcel Roeloffzen; Günter Rote; Birgit Vogtenhuber (Comput. Geom., 2019)

Minimal Dominating Sets in a Tree: Counting, Enumeration, and Extremal Results. - Günter Rote (CoRR, 2019)

The Largest Quadrilateral in a Convex Polygon. - Günter Rote (CoRR, 2019)

Convex Equipartitions of Colored Point Sets. - Pavle V. M. Blagojevic; Günter Rote; Johanna K. Steinmeyer; Günter M. Ziegler (Discret. Comput. Geom., 2019)

The geometric dilation of three points. - Annette Ebbers-Baumann; Rolf Klein; Christian Knauer; Günter Rote (J. Comput. Geom., 2019)

Ordered Level Planarity and Its Relationship to Geodesic Planarity, Bi-Monotonicity, and Variations of Level Planarity. - Boris Klemz; Günter Rote (ACM Trans. Algorithms, 2019)

Geometric Multicut: Shortest Fences for Separating Groups of Objects in the Plane. - Mikkel Abrahamsen; Panos Giannopoulos; Maarten Löffler; Günter Rote (Discret. Comput. Geom., 2020)

Area Difference Bounds for Dissections of a Square into an Odd Number of Triangles. - Jean-Philippe Labbé; Günter Rote; Günter M. Ziegler (Exp. Math., 2020)

Every Collinear Set in a Planar Graph is Free. - Vida Dujmovic; Fabrizio Frati; Daniel Gonçalves 001; Pat Morin; Günter Rote (Discret. Comput. Geom., 2021)

The Two-Squirrel Problem and Its Relatives. - Sergey Bereg; Yuya Higashikawa; Naoki Katoh; László Kozma 002; Manuel Lafond; Günter Rote; Yuki Tokuni; Max Willert; Binhai Zhu (JCDCGGG, 2022)

Linear-Time Algorithms for Maximum-Weight Induced Matchings and Minimum Chain Covers in Convex Bipartite Graphs. - Boris Klemz; Günter Rote (Algorithmica, 2022)

An Almost Optimal Bound on the Number of Intersections of Two Simple Polygons. - Eyal Ackerman; Balázs Keszegh; Günter Rote (Discret. Comput. Geom., 2022)

Grid Peeling of Parabolas. - Günter Rote; Moritz Rüber; Morteza Saghafian (SoCG, 2024)

Optimal strategies in fractional games: vertex cover and domination. - Csilla Bujtás; Günter Rote; Zsolt Tuza (Ars Math. Contemp., 2024)

Probabilistic Finite Automaton Emptiness is undecidable. - Günter Rote (CoRR, 2024)

Removing Popular Faces in Curve Arrangements. - Phoebe de Nooijer; Soeren Terziadis; Alexandra Weinberger; Zuzana Masárová; Tamara Mchedlidze; Maarten Löffler; Günter Rote (J. Graph Algorithms Appl., 2024)

Finding a Shortest Curve That Separates Few Objects from Many. - Therese Biedl; Éric Colin de Verdière; Fabrizio Frati; Anna Lubiw; Günter Rote (SoCG, 2025)

On Solving Simple Curved Nonograms. - Maarten Löffler; Günter Rote; Soeren Terziadis; Alexandra Weinberger (IWOCA, 2025)

Probabilistic Finite Automaton Emptiness Is Undecidable for a Fixed Automaton. - Günter Rote (MFCS, 2025)

NumPSLA - An experimental research tool for pseudoline arrangements and order types. - Günter Rote (CoRR, 2025)

Minimum spanning blob-trees. - Katharina Klost; Marc J. van Kreveld; Daniel Perz; Günter Rote; Josef Tkadlec (CoRR, 2025)

Sweeping x-monotone pseudolines. - Therese Biedl; Erin W. Chambers; Irina Kostitsyna; Günter Rote (CoRR, 2025)