| 2008 |
|---|
| 98 | | Dania El-Khechen,
John Iacono,
Thomas Fevens,
Günter Rote:
Partitioning a Polygon into Two Mirror Congruent Pieces.
CCCG 2008 |
| 97 | EE | Sergio Cabello,
Panos Giannopoulos,
Christian Knauer,
Günter Rote:
Geometric clustering: fixed-parameter tractability and lower bounds with respect to the dimension.
SODA 2008: 836-843 |
| 96 | EE | Sergio Cabello,
Panos Giannopoulos,
Christian Knauer,
Günter Rote:
Matching point sets with respect to the Earth Mover's Distance.
Comput. Geom. 39(2): 118-133 (2008) |
| 95 | EE | Robert L. Scot Drysdale,
Günter Rote,
Astrid Sturm:
Approximation of an open polygonal curve with a minimum number of circular arcs and biarcs.
Comput. Geom. 41(1-2): 31-47 (2008) |
| 94 | EE | Eyal Ackerman,
Kevin Buchin,
Christian Knauer,
Rom Pinchasi,
Günter Rote:
There Are Not Too Many Magic Configurations.
Discrete & Computational Geometry 39(1-3): 3-16 (2008) |
| 93 | EE | Wolfgang Mulzer,
Günter Rote:
Minimum-weight triangulation is NP-hard.
J. ACM 55(2): (2008) |
| 2007 |
|---|
| 92 | | Oswin Aichholzer,
Günter Rote,
André Schulz,
Birgit Vogtenhuber:
Pointed Drawings of Planar Graphs.
CCCG 2007: 237-240 |
| 91 | EE | Helmut Alt,
Hans L. Bodlaender,
Marc J. van Kreveld,
Günter Rote,
Gerard Tel:
Wooden Geometric Puzzles: Design and Hardness Proofs.
FUN 2007: 16-29 |
| 90 | EE | Günter Rote,
Martin Zachariasen:
Matrix scaling by network flow.
SODA 2007: 848-854 |
| 89 | EE | Sergio Cabello,
Günter Rote:
Obnoxious centers in graphs.
SODA 2007: 98-107 |
| 88 | EE | Ares Ribó Mor,
Günter Rote,
André Schulz:
Embedding 3-polytopes on a small grid.
Symposium on Computational Geometry 2007: 112-118 |
| 87 | EE | Eyal Ackerman,
Kevin Buchin,
Christian Knauer,
Rom Pinchasi,
Günter Rote:
There are not too many magic configurations.
Symposium on Computational Geometry 2007: 142-149 |
| 86 | EE | Darko Dimitrov,
Christian Knauer,
Klaus Kriegel,
Günter Rote:
New upper bounds on the quality of the PCA bounding boxes in r2 and r3.
Symposium on Computational Geometry 2007: 275-283 |
| 85 | EE | Adrian Dumitrescu,
Annette Ebbers-Baumann,
Ansgar Grüne,
Rolf Klein,
Günter Rote:
On the geometric dilation of closed curves, graphs, and point sets.
Comput. Geom. 36(1): 16-38 (2007) |
| 84 | EE | Günter Rote:
Computing the Fréchet distance between piecewise smooth curves.
Comput. Geom. 37(3): 162-174 (2007) |
| 83 | EE | Sergio Cabello,
Erik D. Demaine,
Günter Rote:
Planar Embeddings of Graphs with Specified Edge Lengths.
J. Graph Algorithms Appl. 11(1): 259-276 (2007) |
| 2006 |
|---|
| 82 | EE | Eyal Ackerman,
Kevin Buchin,
Christian Knauer,
Günter Rote:
Acyclic Orientation of Drawings.
SWAT 2006: 268-279 |
| 81 | EE | Wolfgang Mulzer,
Günter Rote:
Minimum weight triangulation is NP-hard.
Symposium on Computational Geometry 2006: 1-10 |
| 80 | EE | Robert Connelly,
Erik D. Demaine,
Martin L. Demaine,
Sándor P. Fekete,
Stefan Langerman,
Joseph S. B. Mitchell,
Ares Ribó,
Günter Rote:
Locked and unlocked chains of planar shapes.
Symposium on Computational Geometry 2006: 61-70 |
| 79 | EE | Günter Rote,
André Schulz:
Threshold arrangements and the knapsack problem.
Appl. Math. Lett. 19(1): 108-112 (2006) |
| 78 | EE | Wolfgang Mulzer,
Günter Rote:
Minimum-weight triangulation is NP-hard
CoRR abs/cs/0601002: (2006) |
| 77 | EE | Robert Connelly,
Erik D. Demaine,
Martin L. Demaine,
Sándor P. Fekete,
Stefan Langerman,
Joseph S. B. Mitchell,
Ares Ribó,
Günter Rote:
Locked and Unlocked Chains of Planar Shapes
CoRR abs/cs/0604022: (2006) |
| 2005 |
|---|
| 76 | | Joseph S. B. Mitchell,
Günter Rote:
Proceedings of the 21st ACM Symposium on Computational Geometry, Pisa, Italy, June 6-8, 2005
ACM 2005 |
| 75 | EE | Sergio Cabello,
Panos Giannopoulos,
Christian Knauer,
Günter Rote:
Matching Point Sets with Respect to the Earth Mover's Distance.
ESA 2005: 520-531 |
| 74 | EE | Günter Rote:
Strictly convex drawings of planar graphs.
SODA 2005: 728-734 |
| 73 | EE | Adrian Dumitrescu,
Annette Ebbers-Baumann,
Ansgar Grüne,
Rolf Klein,
Günter Rote:
On Geometric Dilation and Halving Chords.
WADS 2005: 244-255 |
| 72 | EE | Imre Bárány,
Günter Rote:
Strictly convex drawings of planar graphs
CoRR abs/cs/0507030: (2005) |
| 71 | EE | Yi-Jen Chiang,
Tobias Lenz,
Xiang Lu,
Günter Rote:
Simple and optimal output-sensitive construction of contour trees using monotone paths.
Comput. Geom. 30(2): 165-195 (2005) |
| 70 | EE | Ruth Haas,
David Orden,
Günter Rote,
Francisco Santos,
Brigitte Servatius,
Herman Servatius,
Diane L. Souvaine,
Ileana Streinu,
Walter Whiteley:
Planar minimally rigid graphs and pseudo-triangulations.
Comput. Geom. 31(1-2): 31-61 (2005) |
| 2004 |
|---|
| 69 | EE | Adrian Dumitrescu,
Günter Rote:
On the Fréchet distance of a set of curves.
CCCG 2004: 162-165 |
| 68 | EE | David Orden,
Günter Rote,
Francisco Santos,
Brigitte Servatius,
Herman Servatius,
Walter Whiteley:
Non-Crossing Frameworks with Non-Crossing Reciprocals.
Discrete & Computational Geometry 32(4): 567-600 (2004) |
| 2003 |
|---|
| 67 | EE | Günter Rote,
Cao An Wang,
Lusheng Wang,
Yin-Feng Xu:
On Constrained Minimum Pseudotriangulations.
COCOON 2003: 445-454 |
| 66 | EE | Sergio Cabello,
Erik D. Demaine,
Günter Rote:
Planar Embeddings of Graphs with Specified Edge Lengths.
Graph Drawing 2003: 283-294 |
| 65 | EE | Helmut Alt,
Alon Efrat,
Günter Rote,
Carola Wenk:
Matching planar maps.
SODA 2003: 589-598 |
| 64 | EE | Günter Rote:
Pursuit-evasion with imprecise target location.
SODA 2003: 747-753 |
| 63 | EE | Ruth Haas,
David Orden,
Günter Rote,
Francisco Santos,
Brigitte Servatius,
Herman Servatius,
Diane L. Souvaine,
Ileana Streinu,
Walter Whiteley:
Planar minimally rigid graphs and pseudo-triangulations.
Symposium on Computational Geometry 2003: 154-163 |
| 62 | EE | Helmut Alt,
Christian Knauer,
Günter Rote,
Sue Whitesides:
The complexity of (un)folding.
Symposium on Computational Geometry 2003: 164-170 |
| 61 | EE | Nina Amenta,
Sunghee Choi,
Günter Rote:
Incremental constructions con BRIO.
Symposium on Computational Geometry 2003: 211-219 |
| 60 | EE | Carola Wenk,
Helmut Alt,
Alon Efrat,
Lingeshwaran Palaniappan,
Günter Rote:
Finding a curve in a map.
Symposium on Computational Geometry 2003: 384-385 |
| 59 | EE | Oswin Aichholzer,
Günter Rote,
Bettina Speckmann,
Ileana Streinu:
The Zigzag Path of a Pseudo-Triangulation.
WADS 2003: 377-388 |
| 58 | EE | Alon Efrat,
Frank Hoffmann,
Christian Knauer,
Klaus Kriegel,
Günter Rote,
Carola Wenk:
Covering with Ellipses.
Algorithmica 38(1): 145-160 (2003) |
| 57 | EE | Robert Connelly,
Erik D. Demaine,
Günter Rote:
Blowing Up Polygonal Linkages.
Discrete & Computational Geometry 30(2): 205-239 (2003) |
| 56 | EE | Helmut Alt,
Alon Efrat,
Günter Rote,
Carola Wenk:
Matching planar maps.
J. Algorithms 49(2): 262-283 (2003) |
| 2002 |
|---|
| 55 | EE | Robert Elsässer,
Burkhard Monien,
Günter Rote,
Stefan Schamberger:
Toward Optimal Diffusion Matrices.
IPDPS 2002 |
| 54 | EE | Alon Efrat,
Frank Hoffmann,
Christian Knauer,
Klaus Kriegel,
Günter Rote,
Carola Wenk:
Covering shapes by ellipses.
SODA 2002: 453-454 |
| 53 | EE | Günter Rote:
Pseudotriangulations, polytopes, and how to expand linkages.
Symposium on Computational Geometry 2002: 133-134 |
| 52 | | Günter Rote:
Crossing the Bridge at Night.
Bulletin of the EATCS 78: 241- (2002) |
| 2001 |
|---|
| 51 | EE | Dana Randall,
Günter Rote,
Francisco Santos,
Jack Snoeyink:
Counting triangulations and pseudo-triangulations of wheels.
CCCG 2001: 149-152 |
| 50 | EE | Friedrich Eisenbrand,
Günter Rote:
Fast Reduction of Ternary Quadratic Forms.
CaLC 2001: 32-44 |
| 49 | EE | Günter Rote:
Division-Free Algorithms for the Determinant and the Pfaffian: Algebraic and Combinatorial Approaches.
Computational Discrete Mathematics 2001: 119-135 |
| 48 | EE | Friedrich Eisenbrand,
Günter Rote:
Fast 2-Variable Integer Programming.
IPCO 2001: 78-89 |
| 47 | EE | Peter Braß,
Günter Rote,
Konrad J. Swanepoel:
Triangles of Extremal Area or Perimeter in a Finite Planar Point Set.
Discrete & Computational Geometry 26(1): 51-58 (2001) |
| 46 | | Oswin Aichholzer,
Franz Aurenhammer,
Christian Icking,
Rolf Klein,
Elmar Langetepe,
Günter Rote:
Generalized self-approaching curves.
Discrete Applied Mathematics 109(1-2): 3-24 (2001) |
| 45 | EE | Rainer E. Burkard,
Helidon Dollani,
Yixun Lin,
Günter Rote:
The Obnoxious Center Problem on a Tree.
SIAM J. Discrete Math. 14(4): 498-509 (2001) |
| 2000 |
|---|
| 44 | | Robert Connelly,
Erik D. Demaine,
Günter Rote:
Every Polygon Can Be Untangled.
EWCG 2000: 62-65 |
| 43 | | Robert Connelly,
Erik D. Demaine,
Günter Rote:
Straighting Polygonal Arcs and Convexifying Polygonal Cycles.
FOCS 2000: 432-442 |
| 42 | EE | Imre Bárány,
Günter Rote,
William L. Steiger,
C.-H. Zhang:
A Central Limit Theorem for Convex Chains in the Square.
Discrete & Computational Geometry 23(1): 35-50 (2000) |
| 41 | EE | Tamás Fleiner,
Volker Kaibel,
Günter Rote:
Upper Bounds on the Maximal Number of Facets of 0/1-Polytopes.
Eur. J. Comb. 21(1): 121-130 (2000) |
| 1998 |
|---|
| 40 | EE | Oswin Aichholzer,
Franz Aurenhammer,
Christian Icking,
Rolf Klein,
Elmar Langetepe,
Günter Rote:
Generalized Self-Approaching Curves.
ISAAC 1998: 317-326 |
| 39 | EE | Günter Rote,
Gerhard J. Woeginger:
Minimizing the Number of Tardy Jobs.
Acta Cybern. 13(4): 423-430 (1998) |
| 38 | | Helmut Alt,
Ulrich Fuchs,
Günter Rote,
Gerald Weber:
Matching Convex Shapes with Respect to the Symmetric Difference.
Algorithmica 21(1): 89-103 (1998) |
| 37 | | Otfried Schwarzkopf,
Ulrich Fuchs,
Günter Rote,
Emo Welzl:
Approximation of convex figures by pairs of rectangles.
Comput. Geom. 10(2): 77-87 (1998) |
| 36 | | Mordecai J. Golin,
Günter Rote:
A Dynamic Programming Algorithm for Constructing Optimal Prefix-Free Codes with Unequal Letter Costs.
IEEE Transactions on Information Theory 44(5): 1770-1781 (1998) |
| 35 | | Oswin Aichholzer,
Franz Aurenhammer,
Günter Rote,
Yin-Feng Xu:
Constant-Level Greedy Triangulations Approximate the MWT Well.
J. Comb. Optim. 2(4): 361-369 (1998) |
| 34 | EE | 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:
A Visibility Representation for Graphs in Three Dimensions.
J. Graph Algorithms Appl. 2(2): (1998) |
| 33 | | Rainer E. Burkard,
Eranda Çela,
Günter Rote,
Gerhard J. Woeginger:
The quadratic assignment problem with a monotone anti-Monge and a symmetric Toeplitz matrix: Easy and hard cases.
Math. Program. 82: 125-158 (1998) |
| 1997 |
|---|
| 32 | | Johann Hagauer,
Günter Rote:
Three-clustering of Points in the Plane.
Comput. Geom. 8: 87-95 (1997) |
| 31 | | Oswin Aichholzer,
Helmut Alt,
Günter Rote:
Matching Shapes with a Reference Point.
Int. J. Comput. Geometry Appl. 7(4): 349-363 (1997) |
| 30 | EE | Günter Rote:
Finding a Shortest Vector in a Two-Dimensional Lattice Modulo m.
Theor. Comput. Sci. 172(1-2): 303-308 (1997) |
| 1996 |
|---|
| 29 | | Helmut Alt,
Ulrich Fuchs,
Günter Rote,
Gerald Weber:
Matching Convex Shapes with Respect to the Symmetric Difference.
ESA 1996: 320-333 |
| 28 | | Rainer E. Burkard,
Eranda Çela,
Günter Rote,
Gerhard J. Woeginger:
The Quadratic Assignment Problem with a Monotone Anti-Monge and a Symmetric Toeplitz Matrix: Easy and Hard Cases.
IPCO 1996: 204-218 |
| 27 | EE | Oswin Aichholzer,
Franz Aurenhammer,
Siu-Wing Cheng,
Naoki Katoh,
Günter Rote,
Michael Taschwer,
Yin-Feng Xu:
Triangulations Intersect Nicely.
Discrete & Computational Geometry 16(4): 339-359 (1996) |
| 1995 |
|---|
| 26 | | Mordecai J. Golin,
Günter Rote:
A Dynamic Programming Algorithm for Constructing Optimal Refix-Free Codes for Unequal Letter Costs.
ICALP 1995: 256-267 |
| 25 | EE | Oswin Aichholzer,
Franz Aurenhammer,
Michael Taschwer,
Günter Rote:
Triangulations Intersect Nicely.
Symposium on Computational Geometry 1995: 220-229 |
| 24 | EE | Joseph S. B. Mitchell,
Günter Rote,
Gopalakrishnan Sundaram,
Gerhard J. Woeginger:
Counting Convex Polygons in Planar Point Sets.
Inf. Process. Lett. 56(1): 45-49 (1995) |
| 1994 |
|---|
| 23 | EE | Helmut Alt,
Oswin Aichholzer,
Günter Rote:
Matching Shapes with a Reference Point.
Symposium on Computational Geometry 1994: 85-92 |
| 22 | | Vladimir G. Deineko,
René van Dal,
Günter Rote:
The Convex-Hull-and-Line Traveling Salesman Problem: A Solvable Case.
Inf. Process. Lett. 51(3): 141-148 (1994) |
| 1993 |
|---|
| 21 | | Alon Efrat,
Günter Rote,
Micha Sharir:
On the Union of Fat Wedges and Separating a Collection of Segments By a Line.
CCCG 1993: 115-120 |
| 20 | | Günter Rote,
Christian Schwarz,
Jack Snoeyink:
Maintaining the Approximate Width of a Set of Points in the Plane.
CCCG 1993: 258-263 |
| 19 | | Johann Hagauer,
Günter Rote:
Three-Clustering of Points in the Plane.
ESA 1993: 192-199 |
| 18 | | Christian Icking,
Günter Rote,
Emo Welzl,
Chee-Keng Yap:
Shortest Paths for Line Segments.
Algorithmica 10(2-4): 182-200 (1993) |
| 17 | | Alon Efrat,
Günter Rote,
Micha Sharir:
On the Union of Fat Wedges and Separating a Collection of Segments By a Line.
Comput. Geom. 3: 277-288 (1993) |
| 1992 |
|---|
| 16 | | Günter Rote:
A New Metric Between Polygons and How to Compute it.
ICALP 1992: 404-415 |
| 15 | EE | Günter Rote:
Degenerate Convex Hulls in High Dimensions without Extra Storage.
Symposium on Computational Geometry 1992: 26-32 |
| 14 | | Rudolf Fleischer,
Kurt Mehlhorn,
Günter Rote,
Emo Welzl,
Chee-Keng Yap:
Simultaneous Inner and Outer Approximation of Shapes.
Algorithmica 8(5&6): 365-389 (1992) |
| 13 | | Joseph S. B. Mitchell,
Günter Rote,
Gerhard J. Woeginger:
Minimum-Link Paths Among Obstacles in the Plan.
Algorithmica 8(5&6): 431-459 (1992) |
| 12 | | David Eppstein,
Mark H. Overmars,
Günter Rote,
Gerhard J. Woeginger:
Finding Minimum Area k-gons.
Discrete & Computational Geometry 7: 45-58 (1992) |
| 11 | | Günter Rote,
Gerhard J. Woeginger:
Counting Convex k-Gons in Planar Point Sets.
Inf. Process. Lett. 41(4): 191-194 (1992) |
| 1991 |
|---|
| 10 | | Günter Rote:
Computing the Minimum Hausdorff Distance Between Two Point Sets on a Line Under Translation.
Inf. Process. Lett. 38(3): 123-127 (1991) |
| 9 | | Günter Rote,
Gerhard J. Woeginger,
Binhai Zhu,
Zhengyan Wang:
Counting k-Subsets and Convex k-gons in the Plane.
Inf. Process. Lett. 38(3): 149-151 (1991) |
| 8 | | Vasilis Capoyleas,
Günter Rote,
Gerhard J. Woeginger:
Geometric Clusterings.
J. Algorithms 12(2): 341-356 (1991) |
| 1990 |
|---|
| 7 | | Otfried Schwarzkopf,
Ulrich Fuchs,
Günter Rote,
Emo Welzl:
Approximation of Convex Figures by Pairs of Rectangles.
STACS 1990: 240-249 |
| 6 | EE | Rudolf Fleischer,
Kurt Mehlhorn,
Günter Rote,
Emo Welzl,
Chee-Keng Yap:
On Simultaneous Inner and Outer Approximation of Shapes.
Symposium on Computational Geometry 1990: 216-224 |
| 5 | EE | Joseph S. B. Mitchell,
Günter Rote,
Gerhard J. Woeginger:
Minimum-Link Paths Among Obstacles in the Plane.
Symposium on Computational Geometry 1990: 63-72 |
| 1989 |
|---|
| 4 | | Richard Pollack,
Micha Sharir,
Günter Rote:
Computing the Geodesic Center of a Simple Polygon.
Discrete & Computational Geometry 4: 611-626 (1989) |
| 3 | | Herbert Edelsbrunner,
Günter Rote,
Emo Welzl:
Testing the Necklace Condition for Shortest Tours and Optimal Factors in the Plane.
Theor. Comput. Sci. 66(2): 157-180 (1989) |
| 1987 |
|---|
| 2 | | Herbert Edelsbrunner,
Günter Rote,
Emo Welzl:
Testing the Necklace Condition for Shortest Tours and Optimal Factors in the Plane.
ICALP 1987: 364-375 |
| 1986 |
|---|
| 1 | | Günter Rote:
On the Connection Between Hexagonal and Unidirectional Rectangular Systolic Arrays.
Aegean Workshop on Computing 1986: 70-83 |
