Günter Rote

According to our database1, Günter Rote authored at least 180 papers between 1985 and 2019.

Collaborative distances:
  • Dijkstra number2 of three.
  • Erdős number3 of two.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

Homepages:

On csauthors.net:

Bibliography

2019
Convex Equipartitions of Colored Point Sets.
Discrete & Computational Geometry, 2019

Packing plane spanning graphs with short edges in complete geometric graphs.
Comput. Geom., 2019

The Maximum Number of Minimal Dominating Sets in a Tree.
Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete Algorithms, 2019

Isotonic Regression by Dynamic Programming.
Proceedings of the 2nd Symposium on Simplicity in Algorithms, 2019

On Primal-Dual Circle Representations.
Proceedings of the 2nd Symposium on Simplicity in Algorithms, 2019

Every Collinear Set in a Planar Graph Is Free.
Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete Algorithms, 2019

2018
Loopless Gray code enumeration and the Tower of Bucharest.
Theor. Comput. Sci., 2018

Windrose Planarity: Embedding Graphs with Direction-Constrained Edges.
ACM Trans. Algorithms, 2018

Saturated simple and 2-simple topological graphs with few edges.
J. Graph Algorithms Appl., 2018

Point sets with many non-crossing perfect matchings.
Comput. Geom., 2018

Approximate Minimum-Weight Matching with Outliers Under Translation.
Proceedings of the 29th International Symposium on Algorithms and Computation, 2018

2017
Search for the end of a path in the d-dimensional grid and in other graphs.
Ars Math. Contemp., 2017

Ordered Level Planarity, Geodesic Planarity and Bi-Monotonicity.
Proceedings of the Graph Drawing and Network Visualization - 25th International Symposium, 2017

2016
Shortest path to a segment and quickest visibility queries.
JoCG, 2016

Recursively-regular subdivisions and applications.
JoCG, 2016

λ > 4: an improved lower bound on the growth constant of polyominoes.
Commun. ACM, 2016

Windrose Planarity: Embedding Graphs with Direction-Constrained Edges.
Proceedings of the Twenty-Seventh Annual ACM-SIAM Symposium on Discrete Algorithms, 2016

Packing Short Plane Spanning Trees in Complete Geometric Graphs.
Proceedings of the 27th International Symposium on Algorithms and Computation, 2016

Loopless Gray Code Enumeration and the Tower of Bucharest.
Proceedings of the 8th International Conference on Fun with Algorithms, 2016

Approximation and Hardness of Token Swapping.
Proceedings of the 24th Annual European Symposium on Algorithms, 2016

Congruence Testing of Point Sets in 4-Space.
Proceedings of the 32nd International Symposium on Computational Geometry, 2016

2015
Quasi-parallel segments and characterization of unique bichromatic matchings.
JoCG, 2015

Triangulations with Circular Arcs.
J. Graph Algorithms Appl., 2015

Saturated Simple and 2-simple Topological Graphs with Few Edges.
Proceedings of the Graph-Theoretic Concepts in Computer Science, 2015

Congruence Testing of Point Sets in Three and Four Dimensions - Results and Techniques.
Proceedings of the Mathematical Aspects of Computer and Information Sciences, 2015

λ > 4.
Proceedings of the Algorithms - ESA 2015, 2015

Shortest Path to a Segment and Quickest Visibility Queries.
Proceedings of the 31st International Symposium on Computational Geometry, 2015

2014
Advantage in the discrete Voronoi game.
J. Graph Algorithms Appl., 2014

Plane Graphs with Parity Constraints.
Graphs and Combinatorics, 2014

Reprint of: Optimally solving a transportation problem using Voronoi diagrams.
Comput. Geom., 2014

Reprint of: Memory-constrained algorithms for simple polygons.
Comput. Geom., 2014

Quality Ratios of Measures for Graph Drawing Styles.
Proceedings of the 26th Canadian Conference on Computational Geometry, 2014

Graph Drawings with Relative Edge Length Specifications.
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.
Journal of WSCG, 2013

Flip Graphs of Bounded Degree Triangulations.
Graphs and Combinatorics, 2013

Add Isotropic Gaussian Kernels at Own Risk: More and More Resilient Modes in Higher Dimensions.
Discrete & Computational Geometry, 2013

Fixed-parameter tractability and lower bounds for stabbing problems.
Comput. Geom., 2013

Optimally solving a transportation problem using Voronoi diagrams.
Comput. Geom., 2013

Memory-constrained algorithms for simple polygons.
Comput. Geom., 2013

Coloring Hypergraphs Induced by Dynamic Point Sets and Bottomless Rectangles.
Proceedings of the Algorithms and Data Structures - 13th International Symposium, 2013

Convex hull alignment through translation.
Proceedings of the 25th Canadian Conference on Computational Geometry, 2013

2012
Pointed drawings of planar graphs.
Comput. Geom., 2012

Add isotropic Gaussian kernels at own risk: more and more resilient modes in higher dimensions.
Proceedings of the Symposuim on Computational Geometry 2012, 2012

Configuration space visualization.
Proceedings of the Symposuim on Computational Geometry 2012, 2012

Monotone Paths in Planar Convex Subdivisions.
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.
ACM Trans. Algorithms, 2011

Constant-Work-Space Algorithms for Geometric Problems.
JoCG, 2011

Small Grid Embeddings of 3-Polytopes.
Discrete & Computational Geometry, 2011

Lines Pinning Lines.
Discrete & Computational Geometry, 2011

Integer point sets minimizing average pairwise L1 distance: What is the optimal shape of a town?
Comput. Geom., 2011

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

Realizing Planar Graphs as Convex Polytopes.
Proceedings of the Graph Drawing - 19th International Symposium, 2011

Triangulations with Circular Arcs.
Proceedings of the Graph Drawing - 19th International Symposium, 2011

Proper n-Cell Polycubes in n - 3 Dimensions.
Proceedings of the Computing and Combinatorics - 17th Annual International Conference, 2011

Convexifying Polygons Without Losing Visibilities.
Proceedings of the 23rd Annual Canadian Conference on Computational Geometry, 2011

Common Developments of Several Different Orthogonal Boxes.
Proceedings of the 23rd Annual Canadian Conference on Computational Geometry, 2011

2010
Obnoxious Centers in Graphs.
SIAM J. Discrete Math., 2010

Welcome from the Editors-in-Chief.
JoCG, 2010

Finding the Most Relevant Fragments in Networks.
J. Graph Algorithms Appl., 2010

Acyclic Orientation of Drawings.
J. Graph Algorithms Appl., 2010

Locked and Unlocked Chains of Planar Shapes.
Discrete & Computational Geometry, 2010

Formulae and growth rates of high-dimensional polycubes.
Combinatorica, 2010

2009
Wooden Geometric Puzzles: Design and Hardness Proofs.
Theory Comput. Syst., 2009

Formulae and Growth Rates of High-Dimensional Polycubes.
Electronic Notes in Discrete Mathematics, 2009

Flip Graphs of Bounded-Degree Triangulations.
Electronic Notes in Discrete Mathematics, 2009

Bounds on the quality of the PCA bounding boxes.
Comput. Geom., 2009

Recovering Structure from r-Sampled Objects.
Comput. Graph. Forum, 2009

Resolving Loads with Positive Interior Stresses.
Proceedings of the Algorithms and Data Structures, 11th International Symposium, 2009

Plane Graphs with Parity Constraints.
Proceedings of the Algorithms and Data Structures, 11th International Symposium, 2009

The Parameterized Complexity of Some Geometric Problems in Unbounded Dimension.
Proceedings of the Parameterized and Exact Computation, 4th International Workshop, 2009

Two Applications of Point Matching.
Proceedings of the Computational Geometry, 08.03. - 13.03.2009, 2009

Integer Point Sets Minimizing Average Pairwise l1 Distance: What is the Optimal Shape of a Town?
Proceedings of the 21st Annual Canadian Conference on Computational Geometry, 2009

Constant-Working-Space Algorithms for Geometric Problems.
Proceedings of the 21st Annual Canadian Conference on Computational Geometry, 2009

Detecting Hotspots in Geographic Networks.
Proceedings of the Advances in GIScience, 2009

2008
Minimum-weight triangulation is NP-hard.
J. ACM, 2008

There Are Not Too Many Magic Configurations.
Discrete & Computational Geometry, 2008

Approximation of an open polygonal curve with a minimum number of circular arcs and biarcs.
Comput. Geom., 2008

Matching point sets with respect to the Earth Mover's Distance.
Comput. Geom., 2008

Geometric clustering: fixed-parameter tractability and lower bounds with respect to the dimension.
Proceedings of the Nineteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2008

Partitioning a Polygon into Two Mirror Congruent Pieces.
Proceedings of the 20th Annual Canadian Conference on Computational Geometry, 2008

2007
Planar Embeddings of Graphs with Specified Edge Lengths.
J. Graph Algorithms Appl., 2007

Computing the Fréchet distance between piecewise smooth curves.
Comput. Geom., 2007

On the geometric dilation of closed curves, graphs, and point sets.
Comput. Geom., 2007

Matrix scaling by network flow.
Proceedings of the Eighteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2007

Obnoxious centers in graphs.
Proceedings of the Eighteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2007

Wooden Geometric Puzzles: Design and Hardness Proofs.
Proceedings of the Fun with Algorithms, 4th International Conference, 2007

Embedding 3-polytopes on a small grid.
Proceedings of the 23rd ACM Symposium on Computational Geometry, Gyeongju, 2007

New upper bounds on the quality of the PCA bounding boxes in r2 and r3.
Proceedings of the 23rd ACM Symposium on Computational Geometry, Gyeongju, 2007

There are not too many magic configurations.
Proceedings of the 23rd ACM Symposium on Computational Geometry, Gyeongju, 2007

Pointed Drawings of Planar Graphs.
Proceedings of the 19th Annual Canadian Conference on Computational Geometry, 2007

2006
Threshold arrangements and the knapsack problem.
Appl. Math. Lett., 2006

Acyclic Orientation of Drawings.
Proceedings of the Algorithm Theory, 2006

Minimum weight triangulation is NP-hard.
Proceedings of the 22nd ACM Symposium on Computational Geometry, 2006

Locked and unlocked chains of planar shapes.
Proceedings of the 22nd ACM Symposium on Computational Geometry, 2006

2005
Planar minimally rigid graphs and pseudo-triangulations.
Comput. Geom., 2005

Simple and optimal output-sensitive construction of contour trees using monotone paths.
Comput. Geom., 2005

On Geometric Dilation and Halving Chords.
Proceedings of the Algorithms and Data Structures, 9th International Workshop, 2005

Strictly convex drawings of planar graphs.
Proceedings of the Sixteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2005

A pointed Delaunay pseudo-triangulation of a simple polygon.
Proceedings of the (Informal) Proceedings of the 21st European Workshop on Computational Geometry, 2005

Improved lower bound on the geometric dilation of point sets.
Proceedings of the (Informal) Proceedings of the 21st European Workshop on Computational Geometry, 2005

Matching point sets with respect to the Earth mover's distance.
Proceedings of the (Informal) Proceedings of the 21st European Workshop on Computational Geometry, 2005

Matching Point Sets with Respect to the Earth Mover's Distance.
Proceedings of the Algorithms, 2005

2004
Non-Crossing Frameworks with Non-Crossing Reciprocals.
Discrete & Computational Geometry, 2004

Covering with Ellipses.
Algorithmica, 2004

On the Fréchet distance of a set of curves.
Proceedings of the 16th Canadian Conference on Computational Geometry, 2004

2003
Matching planar maps.
J. Algorithms, 2003

Blowing Up Polygonal Linkages.
Discrete & Computational Geometry, 2003

The Zigzag Path of a Pseudo-Triangulation.
Proceedings of the Algorithms and Data Structures, 8th International Workshop, 2003

Pursuit-evasion with imprecise target location.
Proceedings of the Fourteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2003

Matching planar maps.
Proceedings of the Fourteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2003

Planar Embeddings of Graphs with Specified Edge Lengths.
Proceedings of the Graph Drawing, 11th International Symposium, 2003

Finding a curve in a map.
Proceedings of the 19th ACM Symposium on Computational Geometry, 2003

Planar minimally rigid graphs and pseudo-triangulations.
Proceedings of the 19th ACM Symposium on Computational Geometry, 2003

Incremental constructions con BRIO.
Proceedings of the 19th ACM Symposium on Computational Geometry, 2003

The complexity of (un)folding.
Proceedings of the 19th ACM Symposium on Computational Geometry, 2003

On Constrained Minimum Pseudotriangulations.
Proceedings of the Computing and Combinatorics, 9th Annual International Conference, 2003

2002
Crossing the Bridge at Night.
Bulletin of the EATCS, 2002

Covering shapes by ellipses.
Proceedings of the Thirteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2002

Toward Optimal Diffusion Matrices.
Proceedings of the 16th International Parallel and Distributed Processing Symposium (IPDPS 2002), 2002

Pseudotriangulations, polytopes, and how to expand linkages.
Proceedings of the 18th Annual Symposium on Computational Geometry, Barcelona, 2002

2001
The Obnoxious Center Problem on a Tree.
SIAM J. Discrete Math., 2001

Triangles of Extremal Area or Perimeter in a Finite Planar Point Set.
Discrete & Computational Geometry, 2001

Generalized self-approaching curves.
Discrete Applied Mathematics, 2001

Fast 2-Variable Integer Programming.
Proceedings of the Integer Programming and Combinatorial Optimization, 2001

Counting triangulations and pseudo-triangulations of wheels.
Proceedings of the 13th Canadian Conference on Computational Geometry, 2001

Fast Reduction of Ternary Quadratic Forms.
Proceedings of the Cryptography and Lattices, International Conference, 2001

Division-Free Algorithms for the Determinant and the Pfaffian: Algebraic and Combinatorial Approaches.
Proceedings of the Computational Discrete Mathematics, Advanced Lectures, 2001

2000
Upper Bounds on the Maximal Number of Facets of 0/1-Polytopes.
Eur. J. Comb., 2000

A Central Limit Theorem for Convex Chains in the Square.
Discrete & Computational Geometry, 2000

Straighting Polygonal Arcs and Convexifying Polygonal Cycles.
Proceedings of the 41st Annual Symposium on Foundations of Computer Science, 2000

Every Polygon Can Be Untangled.
EuroCG, 2000

1998
A Dynamic Programming Algorithm for Constructing Optimal Prefix-Free Codes with Unequal Letter Costs.
IEEE Trans. Information Theory, 1998

The quadratic assignment problem with a monotone anti-Monge and a symmetric Toeplitz matrix: Easy and hard cases.
Math. Program., 1998

A Visibility Representation for Graphs in Three Dimensions.
J. Graph Algorithms Appl., 1998

Constant-Level Greedy Triangulations Approximate the MWT Well.
J. Comb. Optim., 1998

Approximation of convex figures by pairs of rectangles.
Comput. Geom., 1998

Matching Convex Shapes with Respect to the Symmetric Difference.
Algorithmica, 1998

Minimizing the Number of Tardy Jobs on a Single Machine with Batch Setup Times.
Acta Cybern., 1998

Generalized Self-Approaching Curves.
Proceedings of the Algorithms and Computation, 9th International Symposium, 1998

1997
Finding a Shortest Vector in a Two-Dimensional Lattice Modulo m.
Theor. Comput. Sci., 1997

Matching Shapes with a Reference Point.
Int. J. Comput. Geometry Appl., 1997

Three-clustering of Points in the Plane.
Comput. Geom., 1997

On the distribution of sums of vectors in general position.
Proceedings of the Contemporary Trends in Discrete Mathematics: From DIMACS and DIMATIA to the Future, 1997

1996
Triangulations Intersect Nicely.
Discrete & Computational Geometry, 1996

The Quadratic Assignment Problem with a Monotone Anti-Monge and a Symmetric Toeplitz Matrix: Easy and Hard Cases.
Proceedings of the Integer Programming and Combinatorial Optimization, 1996

Matching Convex Shapes with Respect to the Symmetric Difference.
Proceedings of the Algorithms, 1996

1995
Counting Convex Polygons in Planar Point Sets.
Inf. Process. Lett., 1995

Vehicle routing in an automated warehouse: Analysis and optimization.
Annals OR, 1995

A Dynamic Programming Algorithm for Constructing Optimal Refix-Free Codes for Unequal Letter Costs.
Proceedings of the Automata, Languages and Programming, 22nd International Colloquium, 1995

Triangulations Intersect Nicely.
Proceedings of the Eleventh Annual Symposium on Computational Geometry, 1995

1994
The Convex-Hull-and-Line Traveling Salesman Problem: A Solvable Case.
Inf. Process. Lett., 1994

Matching Shapes with a Reference Point.
Proceedings of the Tenth Annual Symposium on Computational Geometry, 1994

1993
A heuristic for decomposing traffic matrices in TDMA satellite communication.
ZOR - Meth. & Mod. of OR, 1993

On the Union of Fat Wedges and Separating a Collection of Segments By a Line.
Comput. Geom., 1993

Shortest Paths for Line Segments.
Algorithmica, 1993

Three-Clustering of Points in the Plane.
Proceedings of the Algorithms - ESA '93, First Annual European Symposium, Bad Honnef, Germany, September 30, 1993

Maintaining the Approximate Width of a Set of Points in the Plane.
Proceedings of the 5th Canadian Conference on Computational Geometry, 1993

On the Union of Fat Wedges and Separating a Collection of Segments By a Line.
Proceedings of the 5th Canadian Conference on Computational Geometry, 1993

1992
The n-line traveling salesman problem.
Networks, 1992

Counting Convex k-Gons in Planar Point Sets.
Inf. Process. Lett., 1992

Finding Minimum Area k-gons.
Discrete & Computational Geometry, 1992

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

Minimum-Link Paths Among Obstacles in the Plan.
Algorithmica, 1992

Simultaneous Inner and Outer Approximation of Shapes.
Algorithmica, 1992

A New Metric Between Polygons and How to Compute it.
Proceedings of the Automata, Languages and Programming, 19th International Colloquium, 1992

Degenerate Convex Hulls in High Dimensions without Extra Storage.
Proceedings of the Eighth Annual Symposium on Computational Geometry, 1992

1991
Geometric Clusterings.
J. Algorithms, 1991

Counting k-Subsets and Convex k-gons in the Plane.
Inf. Process. Lett., 1991

Computing the Minimum Hausdorff Distance Between Two Point Sets on a Line Under Translation.
Inf. Process. Lett., 1991

1990
Shortest polygonal paths in space.
Computing, 1990

Approximation of Convex Figures by Pairs of Rectangles.
Proceedings of the STACS 90, 1990

Flattening a Rooted Tree.
Proceedings of the Applied Geometry And Discrete Mathematics, 1990

Minimum-Link Paths Among Obstacles in the Plane.
Proceedings of the Sixth Annual Symposium on Computational Geometry, 1990

On Simultaneous Inner and Outer Approximation of Shapes.
Proceedings of the Sixth Annual Symposium on Computational Geometry, 1990

1989
Testing the Necklace Condition for Shortest Tours and Optimal Factors in the Plane.
Theor. Comput. Sci., 1989

Computing the Geodesic Center of a Simple Polygon.
Discrete & Computational Geometry, 1989

1987
Book review.
Zeitschr. für OR, 1987

Testing the Necklace Condition for Shortest Tours and Optimal Factors in the Plane.
Proceedings of the Automata, Languages and Programming, 14th International Colloquium, 1987

1986
On the Connection Between Hexagonal and Unidirectional Rectangular Systolic Arrays.
Proceedings of the VLSI Algorithms and Architectures, 1986

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


  Loading...