Günter Rote

发表

A heuristic for decomposing traffic matrices in TDMA satellite communication

Günter Rote, Andreas Vogel, G. Rote, 1993, ZOR Methods Model. Oper. Res..

Integer Point Sets Minimizing Average Pairwise l1 Distance: What is the Optimal Shape of a Town?

Günter Rote, Erik D. Demaine, Sándor P. Fekete, 2009, CCCG.

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

Günter Rote, Sergio Cabello, Panos Giannopoulos, 2008, SODA '08.

Geometric Multicut: Shortest Fences for Separating Groups of Objects in the Plane

Maarten Löffler, Günter Rote, Panos Giannopoulos, 2019, Discrete & Computational Geometry.

Shortest path to a segment and quickest visibility queries

Esther M. Arkin, Joseph S. B. Mitchell, Günter Rote, 2016, J. Comput. Geom..

There Are Not Too Many Magic Configurations

Günter Rote, Kevin Buchin, Rom Pinchasi, 2008, Discret. Comput. Geom..

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

Günter Rote, G. Rote, 2015, MACIS.

Threshold arrangements and the knapsack problem

Günter Rote, André Schulz, G. Rote, 2006, Appl. Math. Lett..

Counting k-Subsets and Convex k-gons in the Plane

Gerhard J. Woeginger, Günter Rote, Binhai Zhu, 1991, Inf. Process. Lett..

Blowing Up Polygonal Linkages

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

The Quadratic Assignment Problem with a Monotone Anti-Monge and a Symmetric Toeplitz Matrix: Easy and Hard Cases

Gerhard J. Woeginger, Günter Rote, Rainer E. Burkard, 1996, IPCO.

Acyclic Orientation of Drawings

Günter Rote, Kevin Buchin, Eyal Ackerman, 2006, SWAT.

A Central Limit Theorem for Convex Chains in the Square

Günter Rote, Imre Bárány, William L. Steiger, 2000, Discret. Comput. Geom..

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

Günter Rote, Jack Snoeyink, Christian Schwarz, 1993, CCCG.

Recovering Structure from r‐Sampled Objects

Franz Aurenhammer, Günter Rote, Oswin Aichholzer, 2009, Comput. Graph. Forum.

The Zigzag Path of a Pseudo-Triangulation

Bettina Speckmann, Günter Rote, Oswin Aichholzer, 2003, WADS.

Computing the geodesic center of a simple polygon

Micha Sharir, Günter Rote, Richard Pollack, 1989, Discret. Comput. Geom..

Counting Convex k-Gons in Planar Point Sets

Gerhard J. Woeginger, Günter Rote, 1992, Inf. Process. Lett..

Wooden Geometric Puzzles: Design and Hardness Proofs

Günter Rote, Gerard Tel, Helmut Alt, 2008, Theory of Computing Systems.

Congruence Testing of Point Sets in 4-Space

Günter Rote, Heuna Kim, 2016, Symposium on Computational Geometry.

On the Union of Fat Wedges and Separating a Collection of Segments By a Line

Micha Sharir, Günter Rote, Alon Efrat, 1993, Comput. Geom..

Triangulations with Circular Arcs

Franz Aurenhammer, Günter Rote, Bert Jüttler, 2015, J. Graph Algorithms Appl..

Geometric Clusterings

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

Finding minimum areak-gons

David Eppstein, Gerhard J. Woeginger, Günter Rote, 1992, Discret. Comput. Geom..

Matching Point Sets with Respect to the Earth Mover's Distance

Günter Rote, Sergio Cabello, Panos Giannopoulos, 2005, ESA.

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

Günter Rote, Mordecai J. Golin, G. Rote, 1995, ICALP.

Triangulations intersect nicely

Franz Aurenhammer, Günter Rote, Oswin Aichholzer, 1995, SCG '95.

Proper n-Cell Polycubes in n - 3 Dimensions

Günter Rote, Andrei Asinowski, Gill Barequet, 2011, COCOON.

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

Günter Rote, Boris Klemz, 2017, ArXiv.

Formulae and Growth Rates of High-Dimensional Polycubes

Günter Rote, Gill Barequet, Ronnie Barequet, 2009, Electron. Notes Discret. Math..

Λ > 4: an Improved Lower Bound on the Growth Constant of Polyominoes

Günter Rote, Gill Barequet, Mira Shalah, 2016, Commun. ACM.

Approximate Minimum-Weight Matching with Outliers under Translation

Haim Kaplan, Micha Sharir, Günter Rote, 2018, ISAAC.

Fixed-parameter tractability and lower bounds for stabbing problems pdf

Günter Rote, Panos Giannopoulos, Christian Knauer, 2013, Comput. Geom..

Memory-constrained algorithms for simple polygons

Günter Rote, Tetsuo Asano, Wolfgang Mulzer, 2011, Comput. Geom..

Approximation of Convex Figures by Pairs of Rectangles

Günter Rote, Otfried Cheong, Emo Welzl, 1990, STACS.

Welcome from the Editors-in-Chief

Kenneth L. Clarkson, Günter Rote, 2010, J. Comput. Geom..

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

Günter Rote, 1997, Theor. Comput. Sci..

Recursively-regular subdivisions and applications

Günter Rote, Rafel Jaume, 2016, J. Comput. Geom..

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

Gerhard J. Woeginger, Günter Rote, 1998, Acta Cybern..

Counting Convex Polygons in Planar Point Sets

Joseph S. B. Mitchell, Gerhard J. Woeginger, Günter Rote, 1995, Inf. Process. Lett..

Non-Crossing Frameworks with Non-Crossing Reciprocals

Günter Rote, Francisco Santos, David Orden, 2004, Discret. Comput. Geom..

Upper Bounds on the Maximal Number of Facets of 0/1-Polytopes

Günter Rote, Volker Kaibel, Tamás Fleiner, 2000, Eur. J. Comb..

λ > 4

Günter Rote, Gill Barequet, Mira Shalah, 2016, ESA.

Optimally solving a transportation problem using Voronoi diagrams

Günter Rote, Rolf Klein, Rainer Penninger, 2012, Comput. Geom..

Welcome Defects as a Sign of Innovation

Günter Rote, Michael A. Cusumano, Fabio A. Schreiber, 2005 .

Graph Drawings with Relative Edge Length Specifications

Michael Hoffmann, Günter Rote, Marc J. van Kreveld, 2014, CCCG.

Coloring Hypergraphs Induced by Dynamic Point Sets and Bottomless Rectangles

Jean Cardinal, Michael Hoffmann, Günter Rote, 2013, WADS.

A Dynamic Programming Algorithm for Constructing Optimal Prefix-Free Codes with Unequal Letter Costs

Günter Rote, Mordecai J. Golin, G. Rote, 1998, IEEE Trans. Inf. Theory.

Book review

Günter Rote, M. Vlach, 1987, Z. Oper. Research.

Matching Convex Shapes with Respect to the Symmetric Difference

Gerald Weber, Günter Rote, Helmut Alt, 1996, Algorithmica.

Planar minimally rigid graphs and pseudo-triangulations

Günter Rote, Diane L. Souvaine, Francisco Santos, 2005, Comput. Geom..

Testing the Necklace Condition for Shortest Tours and Optimal Factors in the Plane

Günter Rote, Herbert Edelsbrunner, Emo Welzl, 1987, ICALP.

Configuration space visualization

Günter Rote, Dror Atariah, 2012, SoCG '12.

Toward optimal diffusion matrices

Günter Rote, Robert Elsässer, Burkhard Monien, 2002, Proceedings 16th International Parallel and Distributed Processing Symposium.

Flip Graphs of Bounded Degree Triangulations

Bettina Speckmann, Günter Rote, Oswin Aichholzer, 2013, Graphs Comb..

Bounds on the quality of the PCA bounding boxes

Günter Rote, Darko Dimitrov, Christian Knauer, 2009, Comput. Geom..

Point sets with many non-crossing matchings pdf

Günter Rote, Andrei Asinowski, 2015, ArXiv.

21st Annual Symposium on Computational Geometry (SCG'05)

Günter Rote, Lutz Kettner, Joe Mitchell, 2005 .

Triangulations intersect nicely

Franz Aurenhammer, Yin-Feng Xu, Günter Rote, 1996, Discret. Comput. Geom..

Matching planar maps

Günter Rote, Alon Efrat, Helmut Alt, 2003, SODA '03.

The quadratic assignment problem with a monotone anti-Monge and a symmetric Toeplitz matrix: Easy and hard cases

Gerhard J. Woeginger, Günter Rote, Rainer E. Burkard, 1996, Math. Program..

Three-clustering of Points in the Plane

Günter Rote, Johann Hagauer, 1997, Comput. Geom..

Monotone Paths in Planar Convex Subdivisions

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

Vehicle routing in an automated warehouse: Analysis and optimization

Günter Rote, Rainer E. Burkard, Bernd Fruhwirth, 1995, Ann. Oper. Res..

Planar Embeddings of Graphs with Specified Edge Lengths

Günter Rote, Erik D. Demaine, Sergio Cabello, 2003, Graph Drawing.

Point sets with many non-crossing perfect matchings

Günter Rote, Andrei Asinowski, 2018, Comput. Geom..

Quality Ratios of Measures for Graph Drawing Styles

Michael Hoffmann, Günter Rote, Marc J. van Kreveld, 2014, CCCG.

Testing the Necklace Condition for Shortest Tours and Optimal Factors in the Plane

Günter Rote, Herbert Edelsbrunner, Emo Welzl, 1987, ICALP.

Plane Graphs with Parity Constraints

Bettina Speckmann, Alexander Pilz, Michael Hoffmann, 2009, WADS.

Embedding 3-polytopes on a small grid

Günter Rote, André Schulz, Ares Ribó Mor, 2007, SCG '07.

Ordered Level Planarity and Its Relationship to Geodesic Planarity, Bi-Monotonicity, and Variations of Level Planarity

Günter Rote, Boris Klemz, 2019, ACM Trans. Algorithms.

New greedy triangulation algorithms

Franz Aurenhammer, Günter Rote, Oswin Aichholzer, 1996 .

Convex Equipartitions of Colored Point Sets

Günter Rote, Günter M. Ziegler, Pavle V. M. Blagojevic, 2019, Discret. Comput. Geom..

Simultaneous inner and outer approximation of shapes

Kurt Mehlhorn, Günter Rote, Rudolf Fleischer, 2005, Algorithmica.

A Visibility Representation for Graphs in Three Dimensions

Hazel Everett, Günter Rote, Prosenjit Bose, 1998, J. Graph Algorithms Appl..

Packing Short Plane Spanning Trees in Complete Geometric Graphs

Alexander Pilz, Günter Rote, Marcel Roeloffzen, 2016, ISAAC.

Constant-Level Greedy Triangulations Approximate the MWT Well

Franz Aurenhammer, Yin-Feng Xu, Günter Rote, 1998, J. Comb. Optim..

The convergence rate of the sandwich algorithm for approximating convex functions

Günter Rote, G. Rote, 1992, Computing.

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

Günter Rote, André Schulz, Péter Hajnal, 2015, WG.

Constant-Working-Space Algorithms for Geometric Problems

Günter Rote, Tetsuo Asano, Wolfgang Mulzer, 2009, CCCG.

Locked and unlocked chains of planar shapes

Joseph S. B. Mitchell, Günter Rote, Erik D. Demaine, 2006, SCG '06.

Pointed drawings of planar graphs☆

Günter Rote, Oswin Aichholzer, André Schulz, 2012, CCCG.

Detecting Hotspots in Geographic Networks

Bettina Speckmann, Joachim Gudmundsson, Maarten Löffler, 2009, AGILE Conf..

On the geometric dilation of closed curves, graphs, and point sets

Günter Rote, Rolf Klein, Adrian Dumitrescu, 2007, Comput. Geom..

Approximation of convex figures by pairs of rectangles

Günter Rote, Otfried Cheong, Emo Welzl, 1998, Comput. Geom..

Pseudotriangulations, polytopes, and how to expand linkages

Günter Rote, 2002, SCG '02.

Common Developments of Several Different Orthogonal Boxes

Günter Rote, Erik D. Demaine, Ryuhei Uehara, 2011, CCCG.

Saturated simple and 2-simple topological graphs with few edges

Günter Rote, André Schulz, Péter Hajnal, 2018, J. Graph Algorithms Appl..

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

Günter Rote, 2019, ArXiv.

A New Metric Between Polygons and How to Compute it

Günter Rote, G. Rote, 1992, ICALP.

Packing plane spanning graphs with short edges in complete geometric graphs

Alexander Pilz, Günter Rote, Marcel Roeloffzen, 2019, Comput. Geom..

The n-line traveling salesman problem

Günter Rote, 1992, Networks.

Matrix scaling by network flow

Günter Rote, Martin Zachariasen, 2007, SODA '07.

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

Günter Rote, G. Rote, 2001, Computational Discrete Mathematics.

The Maximum Number of Minimal Dominating Sets in a Tree

Günter Rote, 2019, SODA.

Acyclic Orientation of Drawings

Günter Rote, Kevin Buchin, Eyal Ackerman, 2010, J. Graph Algorithms Appl..

Geometric Multicut

Maarten Löffler, Günter Rote, Panos Giannopoulos, 2019, ICALP.

Matching Convex Shapes with Respect to the Symmetric Difference

Gerald Weber, Günter Rote, Helmut Alt, 1996, ESA.

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

Günter Rote, G. Rote, 1991, Inf. Process. Lett..

The Parameterized Complexity of Some Geometric Problems in Unbounded Dimension

Günter Rote, Panos Giannopoulos, Christian Knauer, 2009, IWPEC.

The Obnoxious Center Problem on a Tree

Günter Rote, Rainer E. Burkard, Yixun Lin, 2001, SIAM J. Discret. Math..

Three-Clustering of Points in the Plane

Günter Rote, Johann Hagauer, 1993, ESA.

Optimal graph orientation with storage applications

Franz Aurenhammer, Günter Rote, Oswin Aichholzer, 1995 .

Covering shapes by ellipses

Günter Rote, Alon Efrat, Christian Knauer, 2002, SODA '02.

On the distribution of sums of vectors in general position

Günter Rote, Jerrold R. Griggs, 1997, Contemporary Trends in Discrete Mathematics.

Fast Reduction of Ternary Quadratic Forms

Günter Rote, Friedrich Eisenbrand, G. Rote, 2001, CaLC.

Windrose Planarity

Günter Rote, Ignaz Rutter, Giuseppe Di Battista, 2015, ACM Trans. Algorithms.

Minimum-link paths among obstacles in the plane

Joseph S. B. Mitchell, Gerhard J. Woeginger, Günter Rote, 1990, SCG '90.

Every Polygon Can Be Untangled

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

Matching point sets with respect to the Earth mover's distance

Günter Rote, Sergio Cabello, Panos Giannopoulos, 2005, EuroCG.

Formulae and growth rates of high-dimensional polycubes

Günter Rote, Gill Barequet, Ronnie Barequet, 2009, Electron. Notes Discret. Math..

Wooden Geometric Puzzles: Design and Hardness Proofs

Günter Rote, Gerard Tel, Marc J. van Kreveld, 2007, FUN.

Generalized Self-Approaching Curves

Franz Aurenhammer, Günter Rote, Rolf Klein, 1998, ISAAC.

The complexity of (un)folding

Günter Rote, Helmut Alt, Sue Whitesides, 2003, SCG '03.

Approximation and Hardness of Token Swapping

Günter Rote, Yoshio Okamoto, Takeaki Uno, 2016, ESA.

Crossing the Bridge at Night

Günter Rote, 2002, Bull. EATCS.

Every Collinear Set in a Planar Graph is Free

Günter Rote, Pat Morin, Vida Dujmovic, 2018, Discrete & Computational Geometry.

On Geometric Dilation and Halving Chords

Günter Rote, Rolf Klein, Adrian Dumitrescu, 2005, WADS.

Convexifying Polygons Without Losing Visibilities

Günter Rote, Erik D. Demaine, Vida Dujmovic, 2011, CCCG.

New upper bounds on the quality of the PCA bounding boxes in r2 and r3

Günter Rote, Darko Dimitrov, Christian Knauer, 2007, SCG '07.

Computing the Fréchet distance between piecewise smooth curves

Günter Rote, 2007, Comput. Geom..

There are not too many magic configurations

Günter Rote, Kevin Buchin, Rom Pinchasi, 2007, SCG '07.

Advantage in the discrete Voronoi game

Günter Rote, Dömötör Pálvölgyi, Viola Mészáros, 2014, J. Graph Algorithms Appl..

Finding the Most Relevant Fragments in Networks

Bettina Speckmann, Joachim Gudmundsson, Maarten Löffler, 2010, J. Graph Algorithms Appl..

Locked and Unlocked Chains of Planar Shapes

Joseph S. B. Mitchell, Günter Rote, Erik D. Demaine, 2010, Discret. Comput. Geom..

FPT Algorithms for Diverse Collections of Hitting Sets pdf

Günter Rote, Geevarghese Philip, Tomás Masarík, 2019, Algorithms.

The finest regular coarsening and recursively-regular subdivisions pdf

Günter Rote, Rafel Jaume, 2013, ArXiv.

Pursuit-evasion with imprecise target location

Günter Rote, G. Rote, 2003, SODA '03.

On the Connection Between Hexagonal and Unidirectional Rectangular Systolic Arrays

Günter Rote, 1986, Aegean Workshop on Computing.

Resolving Loads with Positive Interior Stresses

Günter Rote, André Schulz, 2009, WADS.

Loopless Gray code enumeration and the Tower of Bucharest

Günter Rote, Felix Herter, 2018, Theor. Comput. Sci..

Reprint of: Optimally solving a transportation problem using Voronoi diagrams

Günter Rote, Rolf Klein, Rainer Penninger, 2014, Comput. Geom..

On Primal-Dual Circle Representations

Stefan Felsner, Günter Rote, G. Rote, 2019, SOSA.

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

Günter Rote, Vladimir G. Deineko, René van Dal, 1994, Inf. Process. Lett..

Degenerate convex hulls in high dimensions without extra storage

Günter Rote, 1992, SCG '92.

Shortest paths for line segments

Günter Rote, Chee-Keng Yap, Emo Welzl, 2015, Algorithmica.

Covering with Ellipses

Günter Rote, Alon Efrat, Christian Knauer, 2003, Algorithmica.

Add isotropic Gaussian kernels at own risk: more and more resilient modes in higher dimensions

Günter Rote, Herbert Edelsbrunner, Brittany Terese Fasy, 2012, SoCG '12.

On simultaneous inner and outer approximation of shapes

Kurt Mehlhorn, Günter Rote, Rudolf Fleischer, 1990, SCG '90.

Flip Graphs of Bounded-Degree Triangulations

Bettina Speckmann, Günter Rote, Oswin Aichholzer, 2009, Electron. Notes Discret. Math..

Minimum-link paths among obstacles in the plane

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

Tight Exact and Approximate Algorithmic Results on Token Swapping pdf

Günter Rote, Yoshio Okamoto, Takeaki Uno, 2016, ArXiv.

Flattening a Rooted Tree

Eugene L. Lawler, Günter Rote, Paul Hilfinger, 1990, Applied Geometry And Discrete Mathematics.

Quasi-parallel segments and characterization of unique bichromatic matchings

Günter Rote, Tillmann Miltzow, Andrei Asinowski, 2015, J. Comput. Geom..

Matching Shapes with a Reference Point

Günter Rote, Helmut Alt, Oswin Aichholzer, 1997, Int. J. Comput. Geom. Appl..

Convex hull alignment through translation

Michael Hoffmann, Günter Rote, Rodrigo I. Silveira, 2013, CCCG.

Incremental constructions con BRIO

Günter Rote, Sunghee Choi, Nina Amenta, 2003, SCG '03.

Two Applications of Point Matching

Günter Rote, 2009, Computational Geometry.

Finding a curve in a map

Günter Rote, Alon Efrat, Helmut Alt, 2003, SCG '03.

Triangulations with Circular Arcs

Franz Aurenhammer, Günter Rote, Bert Jüttler, 2011, Graph Drawing.

Add Isotropic Gaussian Kernels at Own Risk: More and More Resilient Modes in Higher Dimensions

Günter Rote, Herbert Edelsbrunner, Brittany Terese Fasy, 2013, Discret. Comput. Geom..

A pointed Delaunay pseudo-triangulation of a simple polygon

Günter Rote, André Schulz, 2005, EuroCG.

Reprint of: Memory-constrained algorithms for simple polygons

Günter Rote, Tetsuo Asano, Wolfgang Mulzer, 2014, Comput. Geom..

Loopless Gray Code Enumeration and the Tower of Bucharest

Günter Rote, Felix Herter, 2016, FUN.

Minimum-weight triangulation is NP-hard pdf

Günter Rote, Wolfgang Mulzer, G. Rote, 2006, JACM.

Planar minimally rigid graphs and pseudo-triangulations

Günter Rote, Diane L. Souvaine, Francisco Santos, 2003, SCG '03.

Partitioning a Polygon into Two Mirror Congruent Pieces

Günter Rote, Thomas Fevens, John Iacono, 2008, CCCG.

Triangles of Extremal Area or Perimeter in a Finite Planar Point Set

Günter Rote, Konrad J. Swanepoel, Peter Braß, 2001, Discret. Comput. Geom..

Ordered Level Planarity, Geodesic Planarity and Bi-Monotonicity pdf

Günter Rote, Boris Klemz, 2017, Graph Drawing.

Generalized self-approaching curves

Franz Aurenhammer, Günter Rote, Rolf Klein, 2001, Discret. Appl. Math..

Matching shapes with a reference point

Günter Rote, Helmut Alt, Oswin Aichholzer, 1994, SCG '94.

Isotonic Regression by Dynamic Programming

Günter Rote, 2019, SOSA@SODA.

The geometric dilation of three points

Günter Rote, Rolf Klein, Christian Knauer, 2019, J. Comput. Geom..

Counting triangulations and pseudo-triangulations of wheels

Günter Rote, Dana Randall, Jack Snoeyink, 2001, CCCG.

Small Grid Embeddings of 3-Polytopes

Günter Rote, André Schulz, Ares Ribó Mor, 2011, Discret. Comput. Geom..

Proceedings of the twenty-first annual symposium on Computational geometry

Günter Rote, Joe Mitchell, 2005, SoCG 2005.

Strictly convex drawings of planar graphs

Günter Rote, 2005, SODA.

Lines Pinning Lines

Xavier Goaoc, Günter Rote, Boris Aronov, 2010, Discret. Comput. Geom..

Shortest polygonal paths in space

Günter Rote, Rainer E. Burkard, Zhongliang Yu, 2005, Computing.

On the Fréchet distance of a set of curves

Günter Rote, Adrian Dumitrescu, G. Rote, 2004, CCCG.

On Constrained Minimum Pseudotriangulations

Yin-Feng Xu, Lusheng Wang, Günter Rote, 2003, COCOON.

Congruence Testing of Point Sets in 4 Dimensions pdf

Günter Rote, Heuna Kim, G. Rote, 2016, ArXiv.

Obnoxious centers in graphs

Günter Rote, Sergio Cabello, G. Rote, 2007, SODA '07.

Within the conference there will be plenary talks and minisymposia on special topics. Every participant can also give a contributed talk or present a poster.

Marc Noy, Günter Rote, Michael Drmota, 2013 .

Plane Graphs with Parity Constraints

Bettina Speckmann, Alexander Pilz, Michael Hoffmann, 2014, Graphs Comb..

Improved lower bound on the geometric dilation of point sets

Günter Rote, Adrian Dumitrescu, Ansgar Grüne, 2005, EuroCG.

Straightening polygonal arcs and convexifying polygonal cycles

Günter Rote, Erik D. Demaine, Robert Connelly, 2000, Proceedings 41st Annual Symposium on Foundations of Computer Science.

Fast 2-Variable Integer Programming

Günter Rote, Friedrich Eisenbrand, G. Rote, 2001, IPCO.

Simple and optimal output-sensitive construction of contour trees using monotone paths

Günter Rote, Yi-Jen Chiang, Xiang Lu, 2005, Comput. Geom..

Realizing Planar Graphs as Convex Polytopes

Günter Rote, 2011, Graph Drawing.

Every Collinear Set in a Planar Graph is Free

Günter Rote, Pat Morin, Fabrizio Frati, 2021, Discret. Comput. Geom..

Long Monotone Paths in Convex Subdivisions

Günter Rote, 2011 .

Sequences With Subword Complexity 2n

Günter Rote, 1994 .

Partial Least-Squares Point Matching under Translations

Günter Rote, 2010 .

Time complexity and linear-time approximation of the ancient two-machine flow shop

Gerhard J. Woeginger, Günter Rote, 1998 .

The Degree of Convexity

Günter Rote, 2013 .

Curves with increasing chords

Günter Rote, 1994 .

Binary trees having a given number of nodes with 0 , 1 , and 2 children

Günter Rote, 2002 .

Convex Approximation by Spherical Patches

Günter Rote, Kevin Buchin, Gert Vegter, 2007 .

Lexicographic Fréchet matchings

Günter Rote, 2014 .

A Simple Linear Time Greedy Triangulation Algorithm for Uniformly Distributed Points

Günter Rote, Oswin Aichholzer, G. Rote, 1995 .

Windrose Planarity: Embedding Graphs with Direction-Constrained Edges

Günter Rote, Ignaz Rutter, Giuseppe Di Battista, 2016, SODA.

Minimizing the density of terminal assignments in layout design

Franz Rendl, Günter Rote, F. Rendl, 1986 .

On the geometric dilation of curves and point sets

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

On-line -adic covering by the method of the -th segment and its application to on-line covering by cubes.

Gerhard J. Woeginger, Günter Rote, Janusz Januszewski, 1996 .

Constant-work-space algorithms for geometric problems (1) (コンピュテーション)

Günter Rote, Wolfgang Mulzer, 浅野哲夫, 2010 .

Shortest inspection-path queries in simple polygons

Günter Rote, Christian Knauer, 2005 .