Günter Rote

According to our database, Günter Rote authored at least 169 papers between 1985 and 2024.

Collaborative distances:

• Dijkstra number of three.
• Erdős number of two.

2024

Grid Peeling of Parabolas.

Günter Rote, Moritz Rüber, Morteza Saghafian

CoRR, 2024

2023

Removing Popular Faces in Curve Arrangements.

Phoebe de Nooijer, Soeren Terziadis, Alexandra Weinberger, Zuzana Masárová, Tamara Mchedlidze, Maarten Löffler, Günter Rote

Proceedings of the Graph Drawing and Network Visualization - 31st International Symposium, 2023

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

Linear-Time Algorithms for Maximum-Weight Induced Matchings and Minimum Chain Covers in Convex Bipartite Graphs.

Boris Klemz, Günter Rote

Algorithmica, 2022

2021

Every Collinear Set in a Planar Graph is Free.

Vida Dujmovic, Fabrizio Frati, Daniel Gonçalves, Pat Morin, Günter Rote

Discret. Comput. Geom., 2021

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

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

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

The geometric dilation of three points.

Annette Ebbers-Baumann, Rolf Klein, Christian Knauer, Günter Rote

J. Comput. Geom., 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 Largest Quadrilateral in a Convex Polygon.

Günter Rote

CoRR, 2019

Minimal Dominating Sets in a Tree: Counting, Enumeration, and Extremal Results.

Günter Rote

CoRR, 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

FPT Algorithms for Diverse Collections of Hitting Sets.

Julien Baste, Lars Jaffke, Tomás Masarík, Geevarghese Philip, Günter Rote

Algorithms, 2019

The Maximum Number of Minimal Dominating Sets in a Tree.

Günter Rote

Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete Algorithms, 2019

Isotonic Regression by Dynamic Programming.

Günter Rote

Proceedings of the 2nd Symposium on Simplicity in Algorithms, 2019

On Primal-Dual Circle Representations.

Stefan Felsner, Günter Rote

Proceedings of the 2nd Symposium on Simplicity in Algorithms, 2019

Geometric Multicut.

Mikkel Abrahamsen, Panos Giannopoulos, Maarten Löffler, Günter Rote

Proceedings of the 46th International Colloquium on Automata, Languages, and Programming, 2019

2018

Loopless Gray code enumeration and the Tower of Bucharest.

Felix Herter, Günter Rote

Theor. Comput. Sci., 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

Saturated simple and 2-simple topological graphs with few edges.

Péter Hajnal, Alexander Igamberdiev, Günter Rote, André Schulz

J. Graph Algorithms Appl., 2018

Point sets with many non-crossing perfect matchings.

Andrei Asinowski, Günter Rote

Comput. Geom., 2018

Approximate Minimum-Weight Matching with Outliers Under Translation.

Pankaj K. Agarwal, Haim Kaplan, Geva Kipper, Wolfgang Mulzer, Günter Rote, Micha Sharir, Allen Xiao

Proceedings of the 29th International Symposium on Algorithms and Computation, 2018

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

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

Ordered Level Planarity, Geodesic Planarity and Bi-Monotonicity.

Boris Klemz, Günter Rote

Proceedings of the Graph Drawing and Network Visualization - 25th International Symposium, 2017

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

Recursively-regular subdivisions and applications.

Rafel Jaume, Günter Rote

J. Comput. Geom., 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

Congruence Testing of Point Sets in 4 Dimensions.

Heuna Kim, Günter Rote

CoRR, 2016

<i>λ</i> > 4: an improved lower bound on the growth constant of polyominoes.

Gill Barequet, Günter Rote, Mira Shalah

Commun. ACM, 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

Proceedings of the 27th International Symposium on Algorithms and Computation, 2016

Approximation and Hardness of Token Swapping.

Tillmann Miltzow, Lothar Narins, Yoshio Okamoto, Günter Rote, Antonis Thomas, Takeaki Uno

Proceedings of the 24th Annual European Symposium on Algorithms, 2016

Congruence Testing of Point Sets in 4-Space.

Heuna Kim, Günter Rote

Proceedings of the 32nd International Symposium on Computational Geometry, 2016

2015

Quasi-parallel segments and characterization of unique bichromatic matchings.

Andrei Asinowski, Tillmann Miltzow, Günter Rote

J. Comput. Geom., 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

Point sets with many non-crossing matchings.

Andrei Asinowski, Günter Rote

CoRR, 2015

Congruence Testing of Point Sets in Three and Four Dimensions - Results and Techniques.

Günter Rote

Proceedings of the Mathematical Aspects of Computer and Information Sciences, 2015

λ > 4.

Gill Barequet, Günter Rote, Mira Shalah

Proceedings of the Algorithms - ESA 2015, 2015

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

Plane Graphs with Parity Constraints.

Oswin Aichholzer, Thomas Hackl, Michael Hoffmann, Alexander Pilz, Günter Rote, Bettina Speckmann, Birgit Vogtenhuber

Graphs Comb., 2014

Reprint of: Optimally solving a transportation problem using Voronoi diagrams.

Darius Geiß, Rolf Klein, Rainer Penninger, Günter Rote

Comput. Geom., 2014

Reprint of: Memory-constrained algorithms for simple polygons.

Tetsuo Asano, Kevin Buchin, Maike Buchin, Matias Korman, Wolfgang Mulzer, Günter Rote, André Schulz

Comput. Geom., 2014

Quality Ratios of Measures for Graph Drawing Styles.

Michael Hoffmann, Marc J. van Kreveld, Vincent Kusters, Günter Rote

Proceedings of the 26th Canadian Conference on Computational Geometry, 2014

Graph Drawings with Relative Edge Length Specifications.

Oswin Aichholzer, Michael Hoffmann, Marc J. van Kreveld, Günter Rote

Proceedings of the 26th Canadian Conference on Computational Geometry, 2014

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

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

The finest regular coarsening and recursively-regular subdivisions.

Rafel Jaume, Günter Rote

CoRR, 2013

Fixed-parameter tractability and lower bounds for stabbing problems.

Panos Giannopoulos, Christian Knauer, Günter Rote, Daniel Werner

Comput. Geom., 2013

Optimally solving a transportation problem using Voronoi diagrams.

Darius Geiß, Rolf Klein, Rainer Penninger, Günter Rote

Comput. Geom., 2013

Memory-constrained algorithms for simple polygons.

Tetsuo Asano, Kevin Buchin, Maike Buchin, Matias Korman, Wolfgang Mulzer, Günter Rote, André Schulz

Comput. Geom., 2013

Coloring Hypergraphs Induced by Dynamic Point Sets and Bottomless Rectangles.

Andrei Asinowski, Jean Cardinal, Nathann Cohen, Sébastien Collette, Thomas Hackl, Michael Hoffmann, Kolja B. Knauer, Stefan Langerman, Michal Lason, Piotr Micek, Günter Rote, Torsten Ueckerdt

Proceedings of the Algorithms and Data Structures - 13th International Symposium, 2013

Convex hull alignment through translation.

Michael Hoffmann, Vincent Kusters, Günter Rote, Maria Saumell, Rodrigo I. Silveira

Proceedings of the 25th Canadian Conference on Computational Geometry, 2013

2012

Pointed drawings of planar graphs.

Oswin Aichholzer, Günter Rote, André Schulz, Birgit Vogtenhuber

Comput. Geom., 2012

Configuration space visualization.

Dror Atariah, Günter Rote

Proceedings of the 28th ACM Symposium on Computational Geometry, 2012

Monotone Paths in Planar Convex Subdivisions.

Adrian Dumitrescu, Günter Rote, Csaba D. Tóth

Proceedings of the Computing and Combinatorics - 18th Annual International Conference, 2012

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

Constant-Work-Space Algorithms for Geometric Problems.

Tetsuo Asano, Wolfgang Mulzer, Günter Rote, Yajun Wang

J. Comput. Geom., 2011

Small Grid Embeddings of 3-Polytopes.

Ares Ribó Mor, Günter Rote, André Schulz

Discret. Comput. Geom., 2011

Lines Pinning Lines.

Boris Aronov, Otfried Cheong, Xavier Goaoc, Günter Rote

Discret. Comput. Geom., 2011

Integer point sets minimizing average pairwise L₁ 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

Collapse.

Günter Rote, Uri Zwick

Proceedings of the Twenty-Second Annual ACM-SIAM Symposium on Discrete Algorithms, 2011

Realizing Planar Graphs as Convex Polytopes.

Günter Rote

Proceedings of the Graph Drawing - 19th International Symposium, 2011

Proper n-Cell Polycubes in n - 3 Dimensions.

Andrei Asinowski, Gill Barequet, Ronnie Barequet, Günter Rote

Proceedings of the Computing and Combinatorics - 17th Annual International Conference, 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, Diane L. Souvaine, Andrew Winslow

Proceedings of the 23rd Annual Canadian Conference on Computational Geometry, 2011

Common Developments of Several Different Orthogonal Boxes.

Zachary Abel, Erik D. Demaine, Martin L. Demaine, Hiroaki Matsui, Günter Rote, Ryuhei Uehara

Proceedings of the 23rd Annual Canadian Conference on Computational Geometry, 2011

2010

Obnoxious Centers in Graphs.

Sergio Cabello, Günter Rote

SIAM J. Discret. Math., 2010

Welcome from the Editors-in-Chief.

Kenneth L. Clarkson, Günter Rote

J. Comput. Geom., 2010

Finding the Most Relevant Fragments in Networks.

Kevin Buchin, Sergio Cabello, Joachim Gudmundsson, Maarten Löffler, Jun Luo, Günter Rote, Rodrigo I. Silveira, Bettina Speckmann, Thomas Wolle

J. Graph Algorithms Appl., 2010

Acyclic Orientation of Drawings.

Eyal Ackerman, Kevin Buchin, Christian Knauer, Günter Rote

J. Graph Algorithms Appl., 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

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

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

Formulae and Growth Rates of High-Dimensional Polycubes.

Ronnie Barequet, Gill Barequet, Günter Rote

Electron. Notes Discret. Math., 2009

Flip Graphs of Bounded-Degree Triangulations.

Oswin Aichholzer, Thomas Hackl, David Orden, Pedro Ramos, Günter Rote, André Schulz, Bettina Speckmann

Electron. Notes Discret. Math., 2009

The parameterized complexity of some geometric problems in unbounded dimension

Panos Giannopoulos, Christian Knauer, Günter Rote, Daniel Werner

CoRR, 2009

Bounds on the quality of the PCA bounding boxes.

Darko Dimitrov, Christian Knauer, Klaus Kriegel, Günter Rote

Comput. Geom., 2009

Recovering Structure from <i>r</i>-Sampled Objects.

Oswin Aichholzer, Franz Aurenhammer, B. Kornberger, Simon Plantinga, Günter Rote, Astrid Sturm, Gert Vegter

Comput. Graph. Forum, 2009

Resolving Loads with Positive Interior Stresses.

Günter Rote, André Schulz

Proceedings of the Algorithms and Data Structures, 11th International Symposium, 2009

The Parameterized Complexity of Some Geometric Problems in Unbounded Dimension.

Panos Giannopoulos, Christian Knauer, Günter Rote

Proceedings of the Parameterized and Exact Computation, 4th International Workshop, 2009

Two Applications of Point Matching.

Günter Rote

Proceedings of the Computational Geometry, 08.03. - 13.03.2009, 2009

Constant-Working-Space Algorithms for Geometric Problems.

Tetsuo Asano, Günter Rote

Proceedings of the 21st Annual Canadian Conference on Computational Geometry, 2009

Detecting Hotspots in Geographic Networks.

Kevin Buchin, Sergio Cabello, Joachim Gudmundsson, Maarten Löffler, Jun Luo, Günter Rote, Rodrigo I. Silveira, Bettina Speckmann, Thomas Wolle

Proceedings of the Advances in GIScience, 2009

2008

Minimum-weight triangulation is NP-hard.

Wolfgang Mulzer, Günter Rote

J. ACM, 2008

There Are Not Too Many Magic Configurations.

Eyal Ackerman, Kevin Buchin, Christian Knauer, Rom Pinchasi, Günter Rote

Discret. 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

Matching point sets with respect to the Earth Mover's Distance.

Sergio Cabello, Panos Giannopoulos, Christian Knauer, Günter Rote

Comput. Geom., 2008

Geometric clustering: fixed-parameter tractability and lower bounds with respect to the dimension.

Sergio Cabello, Panos Giannopoulos, Christian Knauer, Günter Rote

Proceedings of the Nineteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2008

Partitioning a Polygon into Two Mirror Congruent Pieces.

Dania El-Khechen, John Iacono, Thomas Fevens, Günter Rote

Proceedings of the 20th Annual Canadian Conference on Computational Geometry, 2008

2007

Planar Embeddings of Graphs with Specified Edge Lengths.

Sergio Cabello, Erik D. Demaine, Günter Rote

J. Graph Algorithms Appl., 2007

Computing the Fréchet distance between piecewise smooth curves.

Günter Rote

Comput. Geom., 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

Matrix scaling by network flow.

Günter Rote, Martin Zachariasen

Proceedings of the Eighteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2007

Embedding 3-polytopes on a small grid.

Ares Ribó Mor, Günter Rote, André Schulz

Proceedings of the 23rd ACM Symposium on Computational Geometry, 2007

New upper bounds on the quality of the PCA bounding boxes in r² and r³.

Darko Dimitrov, Christian Knauer, Klaus Kriegel, Günter Rote

Proceedings of the 23rd ACM Symposium on Computational Geometry, 2007

2006

Threshold arrangements and the knapsack problem.

Günter Rote, André Schulz

Appl. Math. Lett., 2006

2005

Strictly convex drawings of planar graphs

Imre Bárány, Günter Rote

CoRR, 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

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

On Geometric Dilation and Halving Chords.

Adrian Dumitrescu, Annette Ebbers-Baumann, Ansgar Grüne, Rolf Klein, Günter Rote

Proceedings of the Algorithms and Data Structures, 9th International Workshop, 2005

Strictly convex drawings of planar graphs.

Günter Rote

Proceedings of the Sixteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2005

A pointed Delaunay pseudo-triangulation of a simple polygon.

Günter Rote, André Schulz

Proceedings of the (Informal) Proceedings of the 21st European Workshop on Computational Geometry, 2005

Improved lower bound on the geometric dilation of point sets.

Adrian Dumitrescu, Ansgar Grüne, Günter Rote

Proceedings of the (Informal) Proceedings of the 21st European Workshop on Computational Geometry, 2005

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

Covering with Ellipses.

Alon Efrat, Frank Hoffmann, Christian Knauer, Klaus Kriegel, Günter Rote, Carola Wenk

Algorithmica, 2004

On the Fréchet distance of a set of curves.

Adrian Dumitrescu, Günter Rote

Proceedings of the 16th Canadian Conference on Computational Geometry, 2004

2003

Matching planar maps.

Helmut Alt, Alon Efrat, Günter Rote, Carola Wenk

J. Algorithms, 2003

Straightening Polygonal Arcs and Convexifying Polygonal Cycles.

Robert Connelly, Erik D. Demaine, Günter Rote

Discret. Comput. Geom., 2003

The Zigzag Path of a Pseudo-Triangulation.

Oswin Aichholzer, Günter Rote, Bettina Speckmann, Ileana Streinu

Proceedings of the Algorithms and Data Structures, 8th International Workshop, 2003

Pursuit-evasion with imprecise target location.

Günter Rote

Proceedings of the Fourteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2003

Finding a curve in a map.

Carola Wenk, Helmut Alt, Alon Efrat, Lingeshwaran Palaniappan, Günter Rote

Proceedings of the 19th ACM Symposium on Computational Geometry, 2003

Incremental constructions con BRIO.

Nina Amenta, Sunghee Choi, Günter Rote

Proceedings of the 19th ACM Symposium on Computational Geometry, 2003

The complexity of (un)folding.

Helmut Alt, Christian Knauer, Günter Rote, Sue Whitesides

Proceedings of the 19th ACM Symposium on Computational Geometry, 2003

On Constrained Minimum Pseudotriangulations.

Günter Rote, Cao An Wang, Lusheng Wang, Yin-Feng Xu

Proceedings of the Computing and Combinatorics, 9th Annual International Conference, 2003

2002

Crossing the Bridge at Night.

Günter Rote

Bull. EATCS, 2002

Covering shapes by ellipses.

Alon Efrat, Frank Hoffmann, Christian Knauer, Klaus Kriegel, Günter Rote, Carola Wenk

Proceedings of the Thirteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2002

Toward Optimal Diffusion Matrices.

Robert Elsässer, Burkhard Monien, Günter Rote, Stefan Schamberger

Proceedings of the 16th International Parallel and Distributed Processing Symposium (IPDPS 2002), 2002

Pseudotriangulations, polytopes, and how to expand linkages.

Günter Rote

Proceedings of the 18th Annual Symposium on Computational Geometry, 2002

2001

The Obnoxious Center Problem on a Tree.

Rainer E. Burkard, Helidon Dollani, Yixun Lin, Günter Rote

SIAM J. Discret. 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

Generalized self-approaching curves.

Oswin Aichholzer, Franz Aurenhammer, Christian Icking, Rolf Klein, Elmar Langetepe, Günter Rote

Discret. Appl. Math., 2001

Fast 2-Variable Integer Programming.

Friedrich Eisenbrand, Günter Rote

Proceedings of the Integer Programming and Combinatorial Optimization, 2001

Counting triangulations and pseudo-triangulations of wheels.

Dana Randall, Günter Rote, Francisco Santos, Jack Snoeyink

Proceedings of the 13th Canadian Conference on Computational Geometry, 2001

Fast Reduction of Ternary Quadratic Forms.

Friedrich Eisenbrand, Günter Rote

Proceedings of the Cryptography and Lattices, International Conference, 2001

Division-Free Algorithms for the Determinant and the Pfaffian: Algebraic and Combinatorial Approaches.

Günter Rote

Proceedings of the Computational Discrete Mathematics, Advanced Lectures, 2001

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

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

Straighting Polygonal Arcs and Convexifying Polygonal Cycles.

Robert Connelly, Erik D. Demaine, Günter Rote

Proceedings of the 41st Annual Symposium on Foundations of Computer Science, 2000

Every Polygon Can Be Untangled.

Robert Connelly, Erik D. Demaine, Günter Rote

EuroCG, 2000

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

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 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

Constant-Level Greedy Triangulations Approximate the MWT Well.

Oswin Aichholzer, Franz Aurenhammer, Günter Rote, Yin-Feng Xu

J. Comb. Optim., 1998

Approximation of convex figures by pairs of rectangles.

Otfried Schwarzkopf, Ulrich Fuchs, Günter Rote, Emo Welzl

Comput. Geom., 1998

Matching Convex Shapes with Respect to the Symmetric Difference.

Helmut Alt, Ulrich Fuchs, Günter Rote, Gerald Weber

Algorithmica, 1998

Minimizing the Number of Tardy Jobs on a Single Machine with Batch Setup Times.

Günter Rote, Gerhard J. Woeginger

Acta Cybern., 1998

1997

Finding a Shortest Vector in a Two-Dimensional Lattice Modulo m.

Günter Rote

Theor. Comput. Sci., 1997

Matching Shapes with a Reference Point.

Oswin Aichholzer, Helmut Alt, Günter Rote

Int. J. Comput. Geom. Appl., 1997

Three-clustering of Points in the Plane.

Johann Hagauer, Günter Rote

Comput. Geom., 1997

On the distribution of sums of vectors in general position.

Jerrold R. Griggs, Günter Rote

Proceedings of the Contemporary Trends in Discrete Mathematics: From DIMACS and DIMATIA to the Future, 1997

1996

Triangulations Intersect Nicely.

Oswin Aichholzer, Franz Aurenhammer, Siu-Wing Cheng, Naoki Katoh, Günter Rote, Michael Taschwer, Yin-Feng Xu

Discret. Comput. Geom., 1996

1995

Counting Convex Polygons in Planar Point Sets.

Joseph S. B. Mitchell, Günter Rote, Gopalakrishnan Sundaram, Gerhard J. Woeginger

Inf. Process. Lett., 1995

Vehicle routing in an automated warehouse: Analysis and optimization.

Rainer E. Burkard, Bernd Fruhwirth, Günter Rote

Ann. Oper. Res., 1995

A Dynamic Programming Algorithm for Constructing Optimal Refix-Free Codes for Unequal Letter Costs.

Mordecai J. Golin, Günter Rote

Proceedings of the Automata, Languages and Programming, 22nd International Colloquium, 1995

Triangulations Intersect Nicely.

Oswin Aichholzer, Franz Aurenhammer, Michael Taschwer, Günter Rote

Proceedings of the Eleventh Annual Symposium on Computational Geometry, 1995

1994

The Convex-Hull-and-Line Traveling Salesman Problem: A Solvable Case.

Vladimir G. Deineko, René van Dal, Günter Rote

Inf. Process. Lett., 1994

1993

A heuristic for decomposing traffic matrices in TDMA satellite communication.

Günter Rote, Andreas Vogel

ZOR Methods Model. Oper. Res., 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

Shortest Paths for Line Segments.

Christian Icking, Günter Rote, Emo Welzl, Chee-Keng Yap

Algorithmica, 1993

Maintaining the Approximate Width of a Set of Points in the Plane.

Günter Rote, Christian Schwarz, Jack Snoeyink

Proceedings of the 5th Canadian Conference on Computational Geometry, 1993

1992

The n-line traveling salesman problem.

Günter Rote

Networks, 1992

Counting Convex k-Gons in Planar Point Sets.

Günter Rote, Gerhard J. Woeginger

Inf. Process. Lett., 1992

Finding Minimum Area k-gons.

David Eppstein, Mark H. Overmars, Günter Rote, Gerhard J. Woeginger

Discret. Comput. Geom., 1992

The convergence rate of the sandwich algorithm for approximating convex functions.

Günter Rote

Computing, 1992

Minimum-Link Paths Among Obstacles in the Plan.

Joseph S. B. Mitchell, Günter Rote, Gerhard J. Woeginger

Algorithmica, 1992

Simultaneous Inner and Outer Approximation of Shapes.

Rudolf Fleischer, Kurt Mehlhorn, Günter Rote, Emo Welzl, Chee-Keng Yap

Algorithmica, 1992

A New Metric Between Polygons and How to Compute it.

Günter Rote

Proceedings of the Automata, Languages and Programming, 19th International Colloquium, 1992

Degenerate Convex Hulls in High Dimensions without Extra Storage.

Günter Rote

Proceedings of the Eighth Annual Symposium on Computational Geometry, 1992

1991

Geometric Clusterings.

Vasilis Capoyleas, Günter Rote, Gerhard J. Woeginger

J. Algorithms, 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

Computing the Minimum Hausdorff Distance Between Two Point Sets on a Line Under Translation.

Günter Rote

Inf. Process. Lett., 1991

1990

Shortest polygonal paths in space.

Rainer E. Burkard, Günter Rote, En-Yu Yao, Zhongliang Yu

Computing, 1990

Flattening a Rooted Tree.

Paul N. Hilfinger, Eugene L. Lawler, Günter Rote

Proceedings of the Applied Geometry And Discrete Mathematics, 1990

Minimum-Link Paths Among Obstacles in the Plane.

Joseph S. B. Mitchell, Günter Rote, Gerhard J. Woeginger

Proceedings of the Sixth Annual Symposium on Computational Geometry, 1990

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

Computing the Geodesic Center of a Simple Polygon.

Richard Pollack, Micha Sharir, Günter Rote

Discret. Comput. Geom., 1989

1987

Book review.

Günter Rote, Milan Vlach

Z. Oper. Research, 1987

1986

On the Connection Between Hexagonal and Unidirectional Rectangular Systolic Arrays.

Günter Rote

Proceedings of the VLSI Algorithms and Architectures, 1986

1985

A systolic array algorithm for the algebraic path problem (shortest paths; Matrix inversion).

Günter Rote

Computing, 1985