List of Scientific Papers

→ all papers with abstracts

1.	A systolic array for the algebraic path problem (which includes the inverse of a matrix and shortest distances in a graph). Günter Rote Rechenzentrum Graz, Bericht 101, 1984, 69 pages.
1a.	A systolic array algorithm for the algebraic path problem. Günter Rote Diplomarbeit (Master's thesis), February 1985. (Supervisor: Prof. Dr. R. E. Burkard). (This is a corrected version of 1.)
2.	A systolic array algorithm for the algebraic path problem (shortest paths; matrix inversion). Günter Rote (This is a shortened and extended version of 1.) Computing 34 (1985), 191–219, (Zentralblatt für Mathematik 546.68047 (562.68056); Mathematical Reviews #86k:68046). doi:10.1007/BF02253318 Abstract pdf file (gzipped)
3.	The solution sets of extremal equations. Günter Rote Rechenzentrum Graz, Bericht 104, 1985, 58 pages. Abstract pdf file (gzipped)
4.	Minimizing the density of terminal assignments in layout design. Günter Rote and Franz Rendl Operations Research Letters 5 (1986), 111–118, (Zbl 626.90069, MR #87k:90103). doi:10.1016/0167-6377(86)90083-0 Abstract
5.	On the connection between hexagonal and unidirectional rectangular systolic arrays. Günter Rote In: "VLSI Algorithms and Architectures—Aegean Workshop on Computing. Loutraki, Greece, July 1986". Proceedings of AWOC'86. Editors: F. Makedon, K. Mehlhorn, T. Papatheodorou, P. Spirakis. Lecture Notes in Computer Science 227, Springer-Verlag, 1986, pp. 70–83. doi:10.1007/3-540-16766-8_7 Abstract
6.	A parallel scheduling algorithm for minimizing the number of unscheduled jobs. Günter Rote In: "Parallel Algorithms & Architectures". Proceedings of the International Workshop on Parallel Algorithms and Architectures, Centre National de Rencontres Mathématiques, Luminy, France, April 14–18, 1986. Editors: M. Cosnard, Y. Robert, P. Quinton, and M. Tchuente. North-Holland, 1986, pp. 99–108, (Zbl 639.68031). Abstract pdf file (gzipped)
7.	Testing the necklace condition for shortest tours and optimal factors in the plane. Herbert Edelsbrunner, Günter Rote, and Emo Welzl Theoretical Computer Science 66 (1989), 157–180, (MR #90i:90042). doi:10.1016/0304-3975(89)90133-3 Abstract
7a.	Testing the necklace condition for shortest tours and optimal factors in the plane. Herbert Edelsbrunner, Günter Rote, and Emo Welzl (This is a shortened and slightly modified version of 7.) In: "Automata, Languages, and Programming". Proceedings of the 14th International Colloquium on Automata, Languages, and Programming (ICALP), Karlsruhe, Juli 1987. Editor: T. Ottmann. Lecture Notes in Computer Science 267, Springer-Verlag, 1987, pp. 364–375, (Zbl 636.68042, MR #88k:90065). doi:10.1007/3-540-18088-5_31
8.	The N-line traveling salesman problem. Günter Rote Networks 22 (1992), 91–108, (Zbl 783.90118, MR #92k:90045). doi:10.1002/net.3230220106 Abstract PostScript file (gzipped) pdf file (gzipped) TeX .dvi file (gzipped)
9.	Two solvable cases of the traveling salesman problem. Günter Rote Ph. D. thesis, May 1988, 55 pages. (Supervisor: Prof. Dr. R. E. Burkard). (This contains 8 and an extension of 7.) Abstract PostScript file (gzipped) pdf file (gzipped)
10.	Approximation of convex curves with application to the bicriterial minimum cost flow problem. Bernd Fruhwirth, Rainer E. Burkard, and Günter Rote European Journal of Operational Research 42 (1989), 326–338, (MR #91e:90107). doi:10.1016/0377-2217(89)90443-8 Abstract
11.	Algorithmische Untersuchungen zu bikriteriellen kostenminimalen Flüssen in Netzwerken. Rainer E. Burkard, Günter Rote, Günther Ruhe, and Norbert Sieber Wissenschaftliche Zeitschrift der Technischen Hochschule Leipzig 33 (1989), 333–341, (Zbl 706.90024). Abstract pdf file (gzipped)
12.	Computing the geodesic center of a simple polygon. Richard Pollack, Micha Sharir, and Günter Rote Discrete and Computational Geometry 4 (1989), 611–626, (Zbl 689.68067, MR #90g:68141). doi:10.1007/BF02187751 Abstract
13.	Approximation of convex figures by pairs of rectangles. Otfried Schwarzkopf, Ulrich Fuchs, Günter Rote, and Emo Welzl In: Proceedings of the 7th Annual Symposium on Theoretical Aspects of Computer Science (STACS'90), Rouen, February 1990. Lecture Notes in Computer Science 415, Springer-Verlag, 1990, pp. 240–249, (Zbl 729.68087, MR #91e:68148). doi:10.1007/3-540-52282-4_47
13a.	Approximating a convex figure by a pair of homothetic rectangles. Otfried Schwarzkopf, Ulrich Fuchs, Günter Rote, and Emo Welzl (improved and extended version of 13). Computational Geometry, Theory and Applications 10 (1998), 77–87. doi:10.1016/S0925-7721(96)00019-3 Abstract PostScript file (gzipped) pdf file (gzipped)
14.	Path problems in graphs. Günter Rote In: "Computational Graph Theory". Editors: G. Tinhofer, E. Mayr, H. Noltemeier, and M. Syslo, in cooperation with R. Albrecht. Springer-Verlag, 1990. Computing Supplementum 7 (1990), pp. 155–189, (Zbl 699.68088, MR #91m:05122). Abstract PostScript file (gzipped) pdf file (gzipped) TeX .dvi file (gzipped)
15.	Shortest polygonal paths in space. Rainer E. Burkard, Günter Rote, En-Yu Yao, and Zhong-Liang Yu Computing 45 (1990), 51–68, (Zbl. 722.68098, MR #91g:68157). doi:10.1007/BF02250584 Abstract
16.	Geometric clusterings. Vasilis Capoyleas, Günter Rote, and Gerhard Woeginger Journal of Algorithms 12 (1991), 341–356, (Zbl 734.68092, MR #92d:52033). doi:10.1016/0196-6774(91)90007-L Abstract PostScript file (gzipped) pdf file (gzipped) TeX .dvi file (gzipped)
16a.	Geometric clusterings (extended abstract). Vasilis Capoyleas, Günter Rote, and Gerhard Woeginger In: Proceedings of the Second Canadian Conference on Computational Geometry, Ottawa, August 6–10, 1990. Editor: J. Urrutia; pp. 28–31.
17.	Sandwich approximation of univariate convex functions with an application to separable convex programming. Rainer E. Burkard, Horst W. Hamacher, and Günter Rote Naval Research Logistics 38 (1991), 911–924, (Zbl 755.90066, MR #92h:90098). Abstract
18.	Flattening a rooted tree. Paul Hilfinger, Eugene L. Lawler, and Günter Rote In: "Applied Geometry and Discrete Mathematics." The Victor Klee Festschrift. Editors: Peter Gritzmann and Bernd Sturmfels. DIMACS series in discrete mathematics and theoretical computer science, American Mathematical Society and Association for Computing Machinery, 1991; pp. 335–340, (Zbl 733.68061, MR #92i:68122). Abstract
19.	Computing the minimum Hausdorff distance between two point sets on a line under translation. Günter Rote Information Processing Letters 38 (1991), 123–127, (Zbl 736.68078, MR #92d:68114). doi:10.1016/0020-0190(91)90233-8 Abstract PostScript file (gzipped) pdf file (gzipped) TeX .dvi file (gzipped)
20a.	Counting k-subsets and convex k-gons in the plane. Gerhard Woeginger, Günter Rote, Binhai Zhu, and Zhengyan Wang Information Processing Letters 38 (1991), 149–151, (Zbl 737.68084, MR #92i:68183). doi:10.1016/0020-0190(91)90237-C Abstract
20b.	Counting convex k-gons in planar point sets. Günter Rote and Gerhard Woeginger Information Processing Letters 41 (1992), 191–194, (Zbl 751.68077, MR #93c:68108). doi:10.1016/0020-0190(92)90178-X Abstract
20c.	Counting convex polygons in planar point sets. Joseph S. B. Mitchell, Günter Rote, Gopalakrishnan Sundaram, and Gerhard Woeginger Information Processing Letters 56 (1995), 45–49, (Zbl 875.68899). doi:10.1016/0020-0190(95)00130-5 Abstract PostScript file (gzipped) pdf file (gzipped) TeX .dvi file (gzipped)
21.	Shortest paths for line segments. Christian Icking, Günter Rote, Emo Welzl, and Chee Yap Algorithmica 10 (1993), 182–200. (Zbl 781.68118). doi:10.1007/BF01891839 Abstract
22.	A heuristic for decomposing traffic matrices in TDMA satellite communication. Günter Rote and Andreas Vogel ZOR—Methods and Models of Operations Research 38 (1993), 281–307, (Zbl 785.90069). doi:10.1007/BF01416610 Abstract
22a.	A heuristic for decomposing traffic matrices in TDMA satellite communication. Günter Rote and Andreas Vogel Bericht 73-1990, Technische Universität Graz, 28 pages; (slightly extended version of 22.)
22b.	Eine Heuristik für ein Matrizenzerlegungsproblem, das in der Telekommunikation via Satelliten auftritt (Kurzfassung). Günter Rote (short and preliminary version of 22.) ZAMM · Zeitschrift für angewandte Mathematik und Mechanik 69 (1989), T29–T31. doi:10.1002/zamm.19890690402
23.	On simultaneous inner and outer approximation of shapes. Rudolf Fleischer, Kurt Mehlhorn, Günter Rote, Emo Welzl, and Chee Yap In: Proceedings of the Sixth Annual Symposium on Computational Geometry, Berkeley, California, June 6–8, 1990. Association for Computing Machinery, 1990; pp. 216–224. doi:10.1145/98524.98572
23a.	Simultaneous inner and outer approximation of shapes. Rudolf Fleischer, Kurt Mehlhorn, Günter Rote, Emo Welzl, and Chee Yap Algorithmica 8 (1992), 365–389, (Zbl 760.68083). doi:10.1007/BF01758852 (This is a more detailed version of 23.) Abstract
24.	Minimum-link paths among obstacles in the plane. Joseph S. B. Mitchell, Günter Rote, and Gerhard Woeginger Algorithmica 8 (1992), 431–459, (Zbl 788.68144). doi:10.1007/BF01758855 Abstract PostScript file (gzipped) pdf file (gzipped)
24a.	Minimum-link paths among obstacles in the plane (extended abstract). Joseph S. B. Mitchell, Günter Rote, and Gerhard Woeginger In: Proceedings of the Sixth Annual Symposium on Computational Geometry, Berkeley, California, June 6–8, 1990. Association for Computing Machinery, 1990; pp. 63–72. doi:10.1145/98524.98537 (This is a preliminary and shortened version of 24.)
25.	The convergence rate of the Sandwich algorithm for approximating convex functions. Günter Rote Computing 48 (1992), 337–361, (Zbl 787.65006). doi:10.1007/BF02238642 Abstract PostScript file (gzipped) pdf file (gzipped) TeX .dvi file (gzipped)
25a.	The convergence rate of the Sandwich algorithm for approximating convex figures in the plane (extended abstract). Günter Rote In: Proceedings of the Second Canadian Conference on Computational Geometry, Ottawa, August 6–10, 1990. Editor: J. Urrutia; pp. 287–290.
26.	Finding minimum area k-gons. David Eppstein, Mark Overmars, Günter Rote, and Gerhard Woeginger Discrete and Computational Geometry 7 (1992), 45–58, (Zbl 746.68038, MR #92k:52026). doi:10.1007/BF02187823
27.	Vehicle routing in an automated warehouse: analysis and optimization. Rainer E. Burkard, Bernd Fruhwirth, and Günter Rote Annals of Operations Research 57 (1995), 29–44, (Zbl 831.90053). doi:10.1007/BF02099689 Abstract PostScript file (gzipped) pdf file (gzipped) TeX .dvi file (gzipped)
28.	Degenerate convex hulls in high dimensions without extra storage (extended abstract). Günter Rote In: Proceedings of the Eighth Annual Symposium on Computational Geometry, Berlin, June 10–12, 1992. Association for Computing Machinery, 1992; pp. 26–32. doi:10.1145/142675.142685 Abstract PostScript file (gzipped) pdf file (gzipped) free PDF @ACM
29.	A new metric between polygons, and how to compute it (extended abstract). Günter Rote In: "Automata, Languages and Programming". Proceedings of the 19th International Colloquium on Automata, Languages, and Programming (ICALP 92), Wien, Austria, July 1992. Editor: W. Kuich. Lecture Notes in Computer Science 623, Springer-Verlag, 1992, pp. 404–415. doi:10.1007/3-540-55719-9_92 Abstract PostScript file (gzipped) pdf file (gzipped)
30.	Sequences with subword complexity 2n. Günter Rote Journal of Number Theory 46 (1993), 196–213, (Zbl 804.11023). doi:10.1006/jnth.1994.1012 Abstract PostScript file (gzipped) pdf file (gzipped) TeX .dvi file (gzipped)
31.	On the union of fat wedges and separating a collection of segments by a line. Alon Efrat, Günter Rote, and Micha Sharir Computational Geometry: Theory and Applications 3 (1993), 277–288, (Zbl 801.68167). doi:10.1016/0925-7721(93)90018-2 Abstract
31a.	On the union of fat wedges and separating a collection of segments by a line. Alon Efrat, Günter Rote, and Micha Sharir In: Proceedings of the Fifth Canadian Conference on Computational Geometry, Waterloo, August 5–9, 1993. Editor: A. Lubiw, J. Urrutia; pp. 115–120.
32.	Maintaining the approximate width of a set of points in the plane (extended abstract). Günter Rote, Christian Schwarz, and Jack Snoeyink In: Proceedings of the Fifth Canadian Conference on Computational Geometry, Waterloo, August 5–9, 1993. Editor: A. Lubiw, J. Urrutia; pp. 258–263. Abstract PostScript file (gzipped) pdf file (gzipped)
33.	The convex-hull-and-line traveling salesman problem: A solvable case. Vladimir G. Deineko, René van Dal, and Günter Rote Information Processing Letters 51 (1994), 141–148, (Zbl 806.90121). doi:10.1016/0020-0190(94)00071-9 Abstract PostScript file (gzipped) pdf file (gzipped)
34.	Curves with increasing chords. Günter Rote Mathematical Proceedings of the Cambridge Philosophical Society 115 (1994), 1–12, (Zbl 802.51023). doi:10.1017/S0305004100071875 Abstract PostScript file (gzipped) pdf file (gzipped) TeX .dvi file (gzipped)
35.	Spherical dispersion with an application to polygonal approximation of curves. Günter Rote and Robert Franz Tichy Anzeiger der Österreichischen Akademie der Wissenschaften, Mathematisch-naturwissenschaftliche Klasse, Abteilung II 132 (1995), 3–10, (Zbl 865.11054). Abstract PostScript file (gzipped) pdf file (gzipped) TeX .dvi file (gzipped)
36.	Quasi-Monte-Carlo methods and the dispersion of point sequences. Günter Rote and Robert Franz Tichy Mathematical and Computer Modelling 23 (1996), 9–23, (Zbl 855.11041). doi:10.1016/0895-7177(96)00036-2 Abstract PostScript file (gzipped) pdf file (gzipped) TeX .dvi file (gzipped)
37.	Three-clustering of points in the plane. Johannes Hagauer and Günter Rote In: "Algorithms—ESA '93", Proc. First Annual European Symposium on Algorithms, Bad Honnef, Germany, September 30 – October 2, 1993. Editor: Thomas Lengauer. Lecture Notes in Computer Science 726, Springer-Verlag, 1993, pp. 192–199. doi:10.1007/3-540-57273-2_55
37a.	Three-clustering of points in the plane. Johannes Hagauer and Günter Rote Computational Geometry, Theory and Applications 8 (1997), 87–95; doi:10.1016/S0925-7721(96)00022-3 (slightly extended version of 37). Abstract PostScript file (gzipped) pdf file (gzipped) TeX .dvi file (gzipped)
38.	Webs, iteration groups, and equivalent changes in probabilities. János Aczél, Günter Rote, and Jens Schwaiger Quarterly of Applied Mathematics 54 (1996), 475–499, (Zbl 859.39010). Abstract PostScript file (gzipped) pdf file (gzipped)
38a.	Webs, iteration groups, and equivalent changes in probabilities. János Aczél, Günter Rote, and Jens Schwaiger In: "VIII. Mathematikertreffen Zagreb-Graz", Universität Graz, 9.–11. 12. 1993. Editors: Detlef Gronau and Ludwig Reich. Grazer Mathematische Berichte 323, 1994, pp. 1–20, (Zbl 816.39003).
38b.	Equivalence of changes in proportions at crossroads of mathematical theories. János Aczél, Günter Rote, and Jens Schwaiger In: "Actes 5e Conférence Internationale/Proc. Fifth International Conference IPMU, Traitement d'information et gestion d'incertitutes dans les systèmes à base de connaissances/Information Processing and Management of Incertainty in Knowledge-Based Systems, Paris, 4–8 juillet/July, 1994, Cité Internationale Universitaire", Paris 1994, Vol. 1, pp. 569–570.
38c.	Equivalence of changes in proportions at crossroads of mathematical theories. János Aczél, Günter Rote, and Jens Schwaiger In: The Ordered Weighted Averaging Operators—Theory and Applications. Editors: Ronald R. Yager and Janusz Kacprzyk, Elsevier, Dordrecht 1997, pp. 36–38.
39.	Finding a shortest vector in a two-dimensional lattice modulo m. Günter Rote Theoretical Computer Science 172 (1997), 303–308. doi:10.1016/S0304-3975(96)00185-5 Abstract PostScript file (gzipped) pdf file (gzipped) TeX .dvi file (gzipped)
40.	Matching shapes with a reference point. Helmut Alt, Oswin Aichholzer, and Günter Rote In: Proceedings of the Tenth Annual Symposium on Computational Geometry, Stony Brook, New York, June 6–8, 1994. Association for Computing Machinery, 1994, pp. 85–92. doi:10.1145/177424.177555
40a.	Matching shapes with a reference point. Oswin Aichholzer, Helmut Alt, and Günter Rote International Journal on Computational Geometry and Applications 7 (1997), 349–363, (Zbl 883.68118). doi:10.1142/S0218195997000211 Abstract PostScript file (gzipped) pdf file (gzipped)
41.	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, and Gerhard J. Woeginger Mathematical Programming 82 (1998), 125–158. doi:10.1007/BF01585868 Abstract PostScript file (gzipped) pdf file (gzipped) TeX .dvi file (gzipped)
41a.	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, and Gerhard J. Woeginger (This is an extended abstract of 41.) In: "Integer Programming and Combinatorial Optimization". Proceedings of the 5th International IPCO Conference, Vancouver, Canada, June 1996. Editors: W. H. Cunningham, S. T. McCormick, and M. Queyranne. Lecture Notes in Computer Science 1084, Springer-Verlag, 1996, pp. 204–218. doi:10.1007/3-540-61310-2_16
42.	A dynamic programming algorithm for constructing optimal prefix-free codes for unequal letter costs. Mordecai J. Golin and Günter Rote IEEE Transactions on Information Theory 44 (1998), 1770–1781. doi:10.1109/18.705558 Abstract PostScript file (gzipped) pdf file (gzipped) TeX .dvi file (gzipped)
42a.	A dynamic programming algorithm for constructing optimal prefix-free codes for unequal letter costs. Mordecai J. Golin and Günter Rote (This is an extended abstract of 42.) In: "Automata, Languages and Programming". Proceedings of the 22nd International Colloquium on Automata, Languages, and Programming (ICALP 95), Szeged, Hungary, July 1995. Editor: F. Gécseg. Lecture Notes in Computer Science 944, Springer-Verlag, 1995, pp. 256–267. doi:10.1007/3-540-60084-1_79
43.	A simple linear time greedy triangulation algorithm for uniformly distributed points. Robert L. Scot Drysdale, Günter Rote, and Oswin Aichholzer Bericht IIG-408, February 1995, Technische Universität Graz, Institute für Informationsverarbeitung, February 1995, 16 pages. PostScript file (gzipped) pdf file (gzipped) TeX .dvi file (gzipped)
44.	Triangulations intersect nicely. Oswin Aichholzer, Franz Aurenhammer, Siu-Wing Cheng, Naoki Katoh, Michael Taschwer, Günter Rote, and Yin-Feng Xu Discrete and Computational Geometry 16 (1996), 339–359, (Zbl 857.68110). doi:10.1007/BF02712872 Abstract PostScript file (gzipped) pdf file (gzipped) TeX .dvi file (gzipped)
44a.	Triangulations intersect nicely. Oswin Aichholzer, Franz Aurenhammer, Günter Rote, and Michael Taschwer In: Proceedings of the Eleventh Annual Symposium on Computational Geometry, Vancouver, June 5–7, 1995. Association for Computing Machinery, 1995; pp. 220–229. doi:10.1145/220279.220303 This is an extended abstract of 44.
45.	On-line q-adic covering by the method of the n-th segment and its application to on-line covering by cubes. Marek Lassak, Janusz Januszewski, Günter Rote, and Gerhard Woeginger Beiträge zur Algebra und Geometrie—Contributions to Algebra and Geometry 37 (no. 1) (1996), 51–65, (Zbl 863.52010). Abstract PostScript file (gzipped) pdf file (gzipped) TeX .dvi file (gzipped)
45a.	Solution to problem 74. Marek Lassak, Janusz Januszewski, Günter Rote, and Gerhard Woeginger Mathematische Semesterberichte 43 (1996), 94–100. (This paper contains a different proof of a special case of the main result of 45, complemented by a lower-bound construction.) PostScript file (gzipped) pdf file (gzipped)
46.	Matching convex shapes with respect to the symmetric difference. Helmut Alt, Ulrich Fuchs, Günter Rote, and Gerald Weber In: "Algorithms—ESA '96", Proc. Fourth Annual European Symposium on Algorithms, Barcelona, September 25–27, 1996. Editors: Josep Díaz and María Serna. Lecture Notes in Computer Science 1136, Springer-Verlag, 1996, pp. 320–333. doi:10.1007/3-540-61680-2_65
46a.	Matching convex shapes with respect to the symmetric difference. Helmut Alt, Ulrich Fuchs, Günter Rote, and Gerald Weber Algorithmica 21 (1998), 89–103. doi:10.1007/PL00009210 Abstract PostScript file (gzipped) pdf file (gzipped) TeX .dvi file (gzipped)
47.	Optimal logistics for expeditions—the jeep problem with complete refilling. Günter Rote and Guochuan Zhang SFB-Bericht Nr. 71, Technische Universität Graz, Spezialforschungsbereich Optimierung und Kontrolle, June 1996, 34 pages. Abstract PostScript file (gzipped) pdf file (gzipped)
48.	Constant-level greedy triangulations approximate the MWT well. Oswin Aichholzer, Franz Aurenhammer, Günter Rote, and Yin-Feng Xu Journal of Combinatorial Optimization 2 (1999), 361–369. doi:10.1023/A:1009776619164 Abstract PostScript file (gzipped) pdf file (gzipped)
48a.	Constant-level greedy triangulations approximate the MWT well. Oswin Aichholzer, Franz Aurenhammer, Günter Rote, and Yin-Feng Xu In: Proceedings of the Second International Symposium on Operations Research and its Applications (ISORA'96), Guilin, China, December 11–13, 1996. Editors: Ding-Zhu Du, Xiang-Sun Zhang, and Kan Cheng. Lecture Notes in Operations Research 2, World Publishing Corporation, Beijing 1996, pp. 309–318.
49.	A central limit theorem for convex chains in the square. Imre Bárány, Günter Rote, William Steiger, and Cun-Hui Zhang Discrete and Computational Geometry 23 (2000), 35–50. doi:10.1007/PL00009490 Abstract PostScript file (gzipped) pdf file (gzipped) TeX .dvi file (gzipped)
50.	A visibility representation for graphs in three dimensions. Prosenjit Bose, Hazel Everett, Sándor Fekete, Michael E. Houle, Anna Lubiw, Henk Meijer, Kathleen Romanik, Günter Rote, Tom Shermer, Sue Whitesides, and Christian Zelle Journal of Graph Algorithms and Applications 2, no. 3 (1998), 1–16. Abstract PostScript file (gzipped) pdf file (gzipped)
51.	On the distribution of sums of vectors in general position. Jerrold R. Griggs and Günter Rote In: "Contemporary Trends in Discrete Mathematics." Editors: Ronald L. Graham, Jan Kratochvíl, Jaroslav Nešetril, and Fred S. Roberts. DIMACS series in discrete mathematics and theoretical computer science, American Mathematical Society, 1999; pp. 139–142. Abstract PostScript file (gzipped) pdf file (gzipped)
52.	Generalized self-approaching curves. Oswin Aichholzer, Franz Aurenhammer, Christian Icking, Rolf Klein, Elmar Langetepe, and Günter Rote In: "Algorithms and Computation—Ninth Annual International Symposium on Algorithms and Computation. Taejon, Korea, December 1998". Proceedings of ISAAC'98. Editors: Kyung-Yong Chwa and Oscar H. Ibarra. Lecture Notes in Computer Science 1533, Springer-Verlag, 1998, pp. 317–327. doi:10.1007/3-540-49381-6_34
52a.	Generalized self-approaching curves. Oswin Aichholzer, Franz Aurenhammer, Christian Icking, Rolf Klein, Elmar Langetepe, and Günter Rote Discrete Applied Mathematics 109 (2001), 3–24. doi:10.1016/S0166-218X(00)00233-X Abstract PostScript file (gzipped) pdf file (gzipped)
53.	Time complexity and linear-time approximation of the ancient two machine flow shop. Günter Rote and Gerhard J. Woeginger Journal of Scheduling 1 (1998), 149–155. doi:10.1002/(SICI)1099-1425(1998100)1:3<149::AID-JOS10>3.0.CO;2-4 Abstract PostScript file (gzipped) pdf file (gzipped) TeX .dvi file (gzipped)
54.	Reachability of fuzzy matrix period. Martin Gavalec and Günter Rote Tatra Mountains Mathematical Publications 16 (1999), 61–79. Abstract PostScript file (gzipped) pdf file (gzipped) TeX .dvi file (gzipped)
55.	The obnoxious center problem on a tree. Rainer E. Burkard, Helidon Dollani, Yixun Lin, and Günter Rote SIAM Journal on Discrete Mathematics 14 (2001), 498–509. doi:10.1137/S0895480198340967 Abstract PostScript file (gzipped) pdf file (gzipped)
56.	Upper bounds on the maximal number of facets of 0/1-polytopes. Tamás Fleiner, Volker Kaibel, and Günter Rote European Journal of Combinatorics 21 (2000), 121–130. doi:10.1006/eujc.1999.0326 Abstract PostScript file (gzipped) pdf file (gzipped) TeX .dvi file (gzipped)
57.	Minimizing the number of tardy jobs on a single machine with batch setup times. Günter Rote and Gerhard J. Woeginger Acta Cybernetica 13 (1998), 423–429. Abstract PostScript file (gzipped) pdf file (gzipped) TeX .dvi file (gzipped)
58.	Division-free algorithms for the determinant and the Pfaffian: algebraic and combinatorial approaches. Günter Rote In: "Computational Discrete Mathematics." Editor: Helmut Alt. Lecture Notes in Computer Science 2122, Springer-Verlag, 2001, pp. 119–135. doi:10.1007/3-540-45506-X_9 Abstract PostScript file (gzipped) pdf file (gzipped)
59.	Every polygon can be untangled. Robert Connelly, Erik D. Demaine, and Günter Rote In: Proceedings of the 16th European Workshop on Computational Geometry, Ben-Gurion University of the Negev, Israel, January 2000, pp. 62–65.
59a.	Straightening polygonal arcs and convexifying polygonal cycles. Robert Connelly, Erik D. Demaine, and Günter Rote In: Proceedings of the 41st Annual Symposium on Foundations of Computer Science, Redondo Beach, California, (FOCS), November 12–14, 2000. IEEE Computer Society Press, 2000, pp. 432–442. doi:10.1109/SFCS.2000.892131
59b.	Straightening polygonal arcs and convexifying polygonal cycles. Robert Connelly, Erik D. Demaine, and Günter Rote Discrete and Computational Geometry 30 (2003) 205–239. doi:10.1007/s00454-003-0006-7 (This is a more detailed version of 59a.) Abstract
59c.	Straightening polygonal arcs and convexifying polygonal cycles. Robert Connelly, Erik D. Demaine, and Günter Rote Bericht B 02-02, Freie Universität Berlin, Institut für Informatik, February 2002, 49 pages. (This is a version of 59b expanded by an appendix with supplementary proofs.) Abstract pdf file (gzipped)
60.	Fast reduction of ternary quadratic forms. Friedrich Eisenbrand and Günter Rote In: Cryptography and Lattices—International Conference, CaLC 2001, Providence, Rhode Island, March 29–30, 2001, Revised Papers. Editor: Joseph H. Silverman. Lecture Notes in Computer Science 2146, Springer-Verlag, 2001, pp. 32–44. doi:10.1007/3-540-44670-2_4 Abstract PostScript file (gzipped) pdf file (gzipped) TeX .dvi file (gzipped)
61.	Fast 2-variable integer programming. Friedrich Eisenbrand and Günter Rote In: IPCO 2001—Proceedings of the 8th Conference on Integer Programming and Combinatorial Optimization, Utrecht, June 13–15, 2001. Editors: K. Aardal, B. Gerards. Lecture Notes in Computer Science 2081, Springer-Verlag, 2001, pp. 78–89. doi:10.1007/3-540-45535-3_7 Abstract PostScript file (gzipped) pdf file (gzipped)
62.	Triangles of extremal area or perimeter in a finite planar point set. Peter Braß, Günter Rote, and Konrad J. Swanepoel Discrete and Computational Geometry 26 (2001), 51–58. doi:10.1007/s00454-001-0010-6 Abstract
63.	Counting triangulations and pseudo-triangulations of wheels. Dana Randall, Günter Rote, Francisco Santos, and Jack Snoeyink In: Proceedings of the 13th Canadian Conference on Computational Geometry, Waterloo, August 6–10, 2001. Editor: T. Biedl; pp. 149–152. Abstract PostScript file (gzipped) pdf file (gzipped)
64.	Expansive motions and the polytope of pointed pseudo-triangulations. Günter Rote, Francisco Santos, and Ileana Streinu In: Discrete and Computational Geometry—The Goodman-Pollack Festschrift. Editors: Boris Aronov, Saugata Basu, János Pach, and Micha Sharir, Algorithms and Combinatorics, 25, Springer Verlag, Berlin 2003, pp. 699–736, arXiv:math/0206027 [math.CO]. Abstract PostScript file (gzipped) pdf file (gzipped)
65.	Infinitesimally locked self-touching linkages with applications to locked trees. Robert Connelly, Erik D. Demaine, and Günter Rote in: "Physical Knots: Knotting, Linking, and Folding Geometric Objects in R³." Editors: Jorge Alberto Calvo, Kenneth C. Millett, and Eric J. Rawdon. Contemporary Mathematics 304, American Mathematical Society 2002, pp. 287–311. Abstract PostScript file (gzipped) pdf file (gzipped)
66.	Binary trees having a given number of nodes with 0, 1, and 2 children. Günter Rote Séminaire Lotharingien de Combinatoire B38b, (1997), 6 pages, (Zbl 980.13720). Comment on a paper by Helmut Prodinger in the same issue. Abstract PostScript file (gzipped) pdf file (gzipped) TeX .dvi file (gzipped)
67.	Toward optimal diffusion matrices. Robert Elsässer, Burkhard Monien, Günter Rote, and Stefan Schamberger In: "International Parallel and Distributed Processing Symposium." IPDPS 2002, Proceedings. 15–19 April 2002, Fort Lauderdale, California. IEEE Computer Society Press 2002, pp. 0067b, 8 pages. doi:10.1109/IPDPS.2002.1015569 PostScript file (gzipped) pdf file (gzipped)
67a.	Toward optimal diffusion matrices. Robert Elsässer, Burkhard Monien, Günter Rote, and Stefan Schamberger Technical report ALCOMFT-TR-02-98, May 2002, 8 pages.
68.	Covering shapes by ellipses. Alon Efrat, Franz Hoffmann, Christian Knauer, Klaus Kriegel, Günter Rote, and Carola Wenk In: Proceedings of the 13th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), San Francisco, January 2002, pp. 453–454. doi:10.1145/545381.545441
68a.	Covering with ellipses. Alon Efrat, Franz Hoffmann, Christian Knauer, Klaus Kriegel, Günter Rote, and Carola Wenk Algorithmica 38 (2003), 145–160. doi:10.1007/s00453-003-1047-0 Abstract
69.	Pseudotriangulations, polytopes, and how to expand linkages (invited talk). Günter Rote in: Proceedings of the Eighteenth Annual Symposium on Computational Geometry, Barcelona, June 2002. Association for Computing Machinery, 2002, pp. 133–134. doi:10.1145/513400.513442 free PDF @ACM
70.	On constrained minimum pseudotriangulations. Günter Rote, Cao An Wang, Lusheng Wang, and Yinfeng Xu In: "Computing and Combinatorics". Proceedings of the 9th Annual International Computing and Combinatorics Conference (COCOON 2003), Big Sky, Montana, USA, July 2003. Editors: Tandy Warnow and Binhai Zhu. Lecture Notes in Computer Science 2697, Springer-Verlag, 2003, pp. 445–454. doi:10.1007/3-540-45071-8_45 Abstract PostScript file (gzipped) pdf file (gzipped)
71.	Matching planar maps. Helmut Alt, Alon Efrat, Günter Rote, and Carola Wenk In: Proceedings of the 14th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), Baltimore, January 12–14, 2003. pp. 589–598.
71a.	Matching planar maps. Helmut Alt, Alon Efrat, Günter Rote, and Carola Wenk Journal of Algorithms 49 (2003), 262–283. doi:10.1016/S0196-6774(03)00085-3 Abstract PostScript file (gzipped) pdf file (gzipped)
71b.	Finding a curve in a map (Video). Carola Wenk, Helmut Alt, Alon Efrat, Lingeshwaran Palaniappan, and Günter Rote in: Video and Multimedia Review of Computational Geometry, Proceedings of the Nineteenth Annual Symposium on Computational Geometry, San Diego, June 8–10, 2003. Association for Computing Machinery, 2003, pp. 384–385. doi:10.1145/777792.777855 free PDF @ACM
72.	Pursuit-evasion with imprecise target location. Günter Rote In: Proceedings of the 14th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), Baltimore, January 12–14, 2003. pp. 747–753. doi:10.1145/644108.644231
73.	Crossing the bridge at night. Günter Rote EATCS Bulletin (Bulletin of the European Association for Theoretical Computer Science), No. 78, October 2002, 241–246. Abstract PostScript file (gzipped) pdf file (gzipped)
74.	Incremental constructions con BRIO. Nina Amenta, Sunghee Choi, and Günter Rote in: Proceedings of the Nineteenth Annual Symposium on Computational Geometry, San Diego, June 8–10, 2003. Association for Computing Machinery, 2003, pp. 211–219. doi:10.1145/777792.777824 Abstract PostScript file (gzipped) pdf file (gzipped) free PDF @ACM
75.	The complexity of (un)folding. Helmut Alt, Christian Knauer, Günter Rote, and Sue Whitesides in: Proceedings of the Nineteenth Annual Symposium on Computational Geometry, San Diego, June 8–10, 2003. Association for Computing Machinery, 2003, pp. 164–170. doi:10.1145/777792.777818 PostScript file (gzipped) pdf file (gzipped)
75a.	On the complexity of the linkage reconfiguration problem. Helmut Alt, Christian Knauer, Günter Rote, and Sue Whitesides In: "Towards a Theory of Geometric Graphs". Editor: János Pach, American Mathematical Society, 2004, Contemporary Mathematics, Vol. 342, pp. 1–13. Abstract PostScript file (gzipped) pdf file (gzipped)
76.	Planar minimally rigid graphs and pseudo-triangulations. Ruth Haas, David Orden, Günter Rote, Francisco Santos, Brigitte Servatius, Herman Servatius, Diane Souvaine, Ileana Streinu, and Walter Whiteley in: Proceedings of the Nineteenth Annual Symposium on Computational Geometry, San Diego, June 8–10, 2003. Association for Computing Machinery, 2003, pp. 154–163. doi:10.1145/777792.777817
76a.	Planar minimally rigid graphs and pseudo-triangulations. Ruth Haas, David Orden, Günter Rote, Francisco Santos, Brigitte Servatius, Herman Servatius, Diane Souvaine, Ileana Streinu, and Walter Whiteley Computational Geometry, Theory and Applications 31 (2005), 31–61. doi:10.1016/j.comgeo.2004.07.003, arXiv:math/0307347 [math.CO]. (This is an extended version of parts of the results of 76.) Abstract pdf file (gzipped)
77.	Non-crossing frameworks with non-crossing reciprocals. David Orden, Günter Rote, Francisco Santos, Brigitte Servatius, Herman Servatius, and Walter Whiteley Discrete and Computational Geometry 32 (2004), 567–600. (Special issue in honor of Lou Billera), doi:10.1007/s00454-004-1139-x, arXiv:math/0309156 [math.MG]. Abstract PostScript file (gzipped) pdf file (gzipped)
78.	The zigzag path of a pseudo-triangulation. Oswin Aichholzer, Günter Rote, Bettina Speckmann, and Ileana Streinu In: "Algorithms and Data Structures". Proceedings of the 8th International Workshop on Algorithms and Data Structures (WADS 2003), Ottawa, July 2003. Editors: Frank Dehne, Jörg-Rüdiger Sack, and Michiel Smid. Lecture Notes in Computer Science 2748, Springer-Verlag, 2003, pp. 377–388. doi:978-3-540-40545-0 Abstract PostScript file (gzipped) pdf file (gzipped)
79.	Simple and optimal output-sensitive construction of contour trees using monotone paths. Yi-Jen Chiang, Tobias Lenz, Xiang Lu, and Günter Rote Computational Geometry, Theory and Applications 30 (2005), 165–195. doi:10.1016/j.comgeo.2004.05.002 Abstract PostScript file (gzipped) pdf file (gzipped)
80.	Computing the Fréchet distance between piecewise smooth curves. Günter Rote In: Abstracts of the 20th European Workshop on Computational Geometry, Seville, March 2004, pp. 147–150.
80a.	Computing the Fréchet distance between piecewise smooth curves. Günter Rote Computational Geometry, Theory and Applications 37 (2007), 162–174. doi:10.1016/j.comgeo.2005.01.004 Abstract PostScript file (gzipped) pdf file (gzipped)
81.	Planar embeddings of graphs with specified edge lengths. Sergio Cabello, Erik D. Demaine, and Günter Rote In: "Graph Drawing". GD 2003, Proceedings of the 11th International Symposium on Graph Drawing, Perugia, September 2003, Revised Papers. Editor: Giuseppe Liotta. Lecture Notes in Computer Science, 2912, Springer-Verlag, 2004, pp. 283–294. doi:10.1007/978-3-540-24595-7_26
81a.	Planar embeddings of graphs with specified edge lengths. Sergio Cabello, Erik D. Demaine, and Günter Rote Journal of Graph Algorithms and Applications 11, No. 1 (2007), 259–276. Abstract pdf file (gzipped)
82.	On the Fréchet distance of a set of curves. Adrian Dumitrescu and Günter Rote In: Proceedings of the 16th Canadian Conference on Computational Geometry (CCCG'04), Montreal, August 9–11, 2004, pp. 162–165. Abstract PostScript file (gzipped) pdf file (gzipped)
83.	Proceedings of the Twenty-First Annual Symposium on Computational Geometry (SCG'05). Joe S. B. Mitchell, Günter Rote, and Lutz Kettner (editors) Pisa, June 6–8, 2005, Association for Computing Machinery, 2005; x+387 pages.
84.	Improved lower bound on the geometric dilation of point sets. Adrian Dumitrescu, Ansgar Grüne, and Günter Rote In: Abstracts of the 21st European Workshop on Computational Geometry, Eindhoven, March 2005, pp. 37–40.
84a.	On geometric dilation and halving chords. Adrian Dumitrescu, Annette Ebbers-Baumann, Ansgar Grüne, Rolf Klein, and Günter Rote In: Proceedings of the Workshop on Algorithms and Data Structures (WADS 2005), Waterloo, Canada, August 2005, Editors: Alexandro López-Ortiz, Frank Dehne, and Jörg-Rüdiger Sack. Lecture Notes in Computer Science, 3608, Springer-Verlag, 2005, pp. 244–255. doi:10.1007/11534273_22 Abstract pdf file (gzipped)
84b.	On the geometric dilation of closed curves, graphs, and point sets. Adrian Dumitrescu, Annette Ebbers-Baumann, Ansgar Grüne, Rolf Klein, and Günter Rote Computational Geometry, Theory and Applications 36 (2006), 16–38. doi:10.1016/j.comgeo.2005.07.004, arXiv:math/0407135 [math.MG]. (This is a detailed and combined version of 84 and 84a.) Abstract PostScript file (gzipped) pdf file (gzipped)
85.	Strictly convex drawings of planar graphs. Günter Rote In: Proceedings of the 16th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), Vancouver, January 2005, pp. 728–734. doi:10.1145/1070432.1070535 Abstract
86.	Strictly convex drawings of planar graphs. Imre Bárány and Günter Rote Documenta Mathematica 11 (2006), 369–391. Abstract PostScript file (gzipped) pdf file (gzipped)
87.	Threshold arrangements and the knapsack problem. Günter Rote and André Schulz Applied Mathematics Letters 19 (2006), 108–112. doi:10.1016/j.aml.2005.03.010 Abstract PostScript file (gzipped) pdf file (gzipped)
88.	Counting polyominoes on twisted cylinders. Gill Barequet, Micha Moffie, Ares Ribó, and Günter Rote Discrete Mathematics and Theoretical Computer Science AE (2005), 369–374.
88a.	Counting polyominoes on twisted cylinders. Gill Barequet, Micha Moffie, Ares Ribó, and Günter Rote INTEGERS: The Electronic Journal of Combinatorial Number Theory 6 (2006), article #A22, 37 pages. Abstract PostScript file (gzipped) pdf file (gzipped)
89.	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ó, and Günter Rote In: Proceedings of the 22nd Annual Symposium on Computational Geometry, Sedona, June 5–7, 2006. Association for Computing Machinery, 2006, pp. 61–70, arXiv:cs/0604022v2 [cs.CG], doi:10.1145/1137856.1137868.
89a.	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ó, and Günter Rote Discrete and Computational Geometry 44 (2010), 439–462. doi:10.1007/s00454-010-9262-3, arXiv:cs/0604022 [cs.CG], Abstract pdf file (gzipped)
90.	A pointed Delaunay pseudo-triangulation of a simple polygon. Günter Rote and André Schulz In: Abstracts of the 21st European Workshop on Computational Geometry, Eindhoven, March 2005, pp. 77–80. Abstract pdf file (gzipped)
91.	Matching point sets with respect to the earth mover's distance. Sergio Cabello, Panos Giannopoulos, Christian Knauer, and Günter Rote In: Abstracts of the 21st European Workshop on Computational Geometry, Eindhoven, March 2005, pp. 57–60.
91a.	Matching point sets with respect to the earth mover's distance. Sergio Cabello, Panos Giannopoulos, Christian Knauer, and Günter Rote In: "Algorithms—ESA 2005", Proc. Thirteenth Annual European Symposium on Algorithms, Palma de Mallorca, 2005. Editors: Gerth Stolting Brodal and Stefano Leonardi. Lecture Notes in Computer Science 3669, Springer-Verlag, 2005, pp. 520–531. doi:10.1007/11561071_47
91b.	Matching point sets with respect to the Earth Mover's Distance. Sergio Cabello, Panos Giannopoulos, Christian Knauer, and Günter Rote Computational Geometry, Theory and Applications 39 (2008), 118–133. doi:10.1016/j.comgeo.2006.10.001 Abstract pdf file (gzipped)
92.	Upper bounds for the number of spanning trees of a planar graph. Ares Ribó Mor, Günter Rote, and Xuerong Yong manuscript, March 2009, (in preparation). Abstract PostScript file (gzipped) pdf file (gzipped)
92a.	The number of spanning trees in a planar graph. Günter Rote In: Oberwolfach Reports, 2, European Mathematical Society - Publishing House, 2005, pp. 969–973. Abstract PostScript file (gzipped) pdf file (gzipped)
93.	Lower bounds for the maximum number of spanning trees of a planar graph. Ares Ribó Mor and Günter Rote manuscript, March 2009, (in preparation).
94.	Minimum-weight triangulation is NP-hard. Wolfgang Mulzer and Günter Rote Technical report B-05-23-revised, Freie Universität Berlin, Institut für Informatik, February 2008, 45 pages, arXiv:cs/0601002 [cs.CG]. Complete version with additional appendices. Abstract PostScript file (gzipped) pdf file (gzipped)
94a.	Minimum weight triangulation is NP-hard. Wolfgang Mulzer and Günter Rote In: Proceedings of the 22nd Annual Symposium on Computational Geometry, Sedona, June 5–7, 2006. Association for Computing Machinery, 2006, pp. 1–10. doi:10.1145/1137856.1137859
94b.	Minimum-weight triangulation is NP-hard. Wolfgang Mulzer and Günter Rote Journal of the ACM 55, no. 2 (May 2008), Article 11, 29 pp. doi:10.1145/1346330.1346336 Abstract PostScript file (gzipped) pdf file (gzipped) free PDF @ACM
95.	Acyclic orientation of drawings. Eyal Ackerman, Kevin Buchin, Christian Knauer, and Günter Rote In: Proceedings of the 10th Scandinavian Workshop on Algorithm Theory (SWAT). Riga, July 2006, Editors: Lars Arge and Rusins Freivalds. Lecture Notes in Computer Science, 4059, Springer-Verlag, 2006, pp. 266–277. doi:10.1007/11785293_26
95a.	Acyclic orientation of drawings. Eyal Ackerman, Kevin Buchin, Christian Knauer, and Günter Rote In: Abstracts of the 22nd European Workshop on Computational Geometry, Delphi, March 2006, pp. 207–210.
95b.	Acyclic orientation of drawings. Eyal Ackerman, Kevin Buchin, Christian Knauer, and Günter Rote Journal of Graph Algorithms and Applications 14, No. 2 (2010), 367–384. Abstract pdf file (gzipped)
96.	Piecewise linear Morse theory. Günter Rote In: Oberwolfach Reports, 3, European Mathematical Society - Publishing House, 2006, pp. 696–698. Abstract PostScript file (gzipped) pdf file (gzipped)
97.	On the bounding boxes obtained by principal component analysis. Darko Dimitrov, Christian Knauer, Klaus Kriegel, and Günter Rote In: Abstracts of the 22nd European Workshop on Computational Geometry, Delphi, March 2006, pp. 193–196.
97a.	Upper and lower bounds on the quality of the PCA bounding boxes. Darko Dimitrov, Christian Knauer, Klaus Kriegel, and Günter Rote In: WSCG'2007, Prof. 15th Int. Conf. in Central Europe on Computer Graphics, Visualization and Computer Vision, Plzen, Czech Republic, January 29 - February 1, 2007, Editors: Jarek Rossignac and Vaclav Skala, pp. 185–192. Abstract pdf file (gzipped)
98.	Obnoxious centers in graphs. Sergio Cabello and Günter Rote In: Proceedings of the 18th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), New Orleans, January 2007, pp. 98–107. doi:10.1145/1283383.1283395
98a.	Obnoxious centers in graphs. Sergio Cabello and Günter Rote SIAM Journal on Discrete Mathematics 24 (2010), 1713–1730. doi:10.1137/09077638X Abstract PostScript file (gzipped) pdf file (gzipped)
99.	Approximation of an open polygonal curve with a minimum number of circular arcs and biarcs. R. L. Scot Drysdale, Günter Rote, and Astrid Sturm Computational Geometry, Theory and Applications 41 (2008), 31–47. doi:10.1016/j.comgeo.2007.10.009 Abstract pdf file (gzipped)
99a.	Approximation of an open polygonal curve with a minimum number of circular arcs. R. L. Scot Drysdale, Günter Rote, and Astrid Sturm (Preliminary version of 99 with partial results.) In: Abstracts of the 22nd European Workshop on Computational Geometry, Delphi, March 2006, pp. 25–28.
100.	Matrix scaling by network flow. Günter Rote and Martin Zachariasen In: Proceedings of the 18th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), New Orleans, January 2007, pp. 848–854. doi:10.1145/1283383.1283474 Abstract PostScript file (gzipped) pdf file (gzipped)
101.	Meshing of surfaces. Jean-Daniel Boissonnat, David Cohen-Steiner, Bernard Mourrain, Günter Rote, and Gert Vegter In: "Effective Computational Geometry for Curves and Surfaces". Editors: Jean-Daniel Boissonnat and Monique Teillaud, Chapter 5. Mathematics and Visualization, Springer-Verlag, 2006, pp. 181–229. doi:10.1007/978-3-540-33259-6_5 Abstract PostScript file (gzipped) pdf file (gzipped)
102.	Computational topology: an introduction. Günter Rote and Gert Vegter In: "Effective Computational Geometry for Curves and Surfaces". Editors: Jean-Daniel Boissonnat and Monique Teillaud, Chapter 7. Mathematics and Visualization, Springer-Verlag, 2006, pp. 277–312. doi:10.1007/978-3-540-33259-6_7 Abstract PostScript file (gzipped) pdf file (gzipped)
103.	Pseudo-triangulations — a survey. Günter Rote, Francisco Santos, and Ileana Streinu In: Surveys on Discrete and Computational Geometry-Twenty Years Later. Editors: Jacob E. Goodman, János Pach, and Richard Pollack, Contemporary Mathematics, volume 453, American Mathematical Society, 2008, pp. 343–410. arXiv:math/0612672 [math.CO]. Abstract PostScript file (gzipped) pdf file (gzipped)
104.	Wooden geometric puzzles: design and hardness proofs. Helmut Alt, Hans Bodlaender, Marc van Kreveld, Günter Rote, and Gerard Tel In: Proceedings of the fourth conference on Fun with Algorithms (FUN 2007). Castiglioncello, June 2007, Editors: Pilu Crescenzi, Giuseppe Prencipe, and Geppino Pucci. Lecture Notes in Computer Science, 4475, Springer-Verlag, 2007, pp. 16–29. doi:10.1007/978-3-540-72914-3_4
104a.	Wooden geometric puzzles: design and hardness proofs. Helmut Alt, Hans Bodlaender, Marc van Kreveld, Günter Rote, and Gerard Tel Theory of Computing Systems 44 (2009), 160–174. doi:10.1007/s00224-008-9104-3 Abstract pdf file (gzipped)
105.	Convex approximation by spherical patches. Kevin Buchin, Simon Plantinga, Günter Rote, Astrid Sturm, and Gert Vegter In: Abstracts of the 23rd European Workshop on Computational Geometry, Graz, March 2007, pp. 26–29. Abstract pdf file (gzipped)
106.	How difficult is it to walk the dog? Kevin Buchin, Maike Buchin, Christian Knauer, Günter Rote, and Carola Wenk In: Abstracts of the 23rd European Workshop on Computational Geometry, Graz, March 2007, pp. 170–173. Abstract PostScript file (gzipped) pdf file (gzipped)
107.	There are not too many magic configurations. Eyal Ackerman, Kevin Buchin, Christian Knauer, Rom Pinchasi, and Günter Rote In: Proceedings of the 23rd Annual Symposium on Computational Geometry, Gyeongju, South Korea, June 6–8, 2007. Association for Computing Machinery, 2007, pp. 142–149. doi:10.1145/1247069.1247098 free PDF @ACM
107a.	There are not too many magic configurations. Eyal Ackerman, Kevin Buchin, Christian Knauer, Rom Pinchasi, and Günter Rote Discrete and Computational Geometry 39 (2008), 3–16. doi:10.1007/s00454-007-9023-0 Abstract PostScript file (gzipped) pdf file (gzipped)
107b.	There are not too many magic configurations. Eyal Ackerman, Kevin Buchin, Christian Knauer, Rom Pinchasi, and Günter Rote In: Twentieth Anniversary Volume—Discrete & Computational Geometry. Editors: Jacob E. Goodman, János Pach, and Richard Pollack, Springer-Verlag, New York 2008, pp. 1–14. (This is identical to 107a.) doi:10.1007/978-0-387-87363-3_1 Abstract PostScript file (gzipped) pdf file (gzipped)
108.	Embedding 3-polytopes on a small grid. Ares Ribó Mor, Günter Rote, and André Schulz In: Proceedings of the 23rd Annual Symposium on Computational Geometry, Gyeongju, South Korea, June 6–8, 2007. Association for Computing Machinery, 2007, pp. 112–118. doi:10.1145/1247069.1247086 Abstract pdf file (gzipped)
108a.	Small grid embeddings of 3-polytopes. Ares Ribó Mor, Günter Rote, and André Schulz Discrete and Computational Geometry 45 (2011), 65–87. doi:10.1007/s00454-010-9301-0, arXiv:0908.0488 [cs.CG]. Abstract pdf file (gzipped)
109.	New upper bounds on the quality of PCA bounding boxes in R² and R³. Darko Dimitrov, Christian Knauer, Klaus Kriegel, and Günter Rote In: Proceedings of the 23rd Annual Symposium on Computational Geometry, Gyeongju, South Korea, June 6–8, 2007. Association for Computing Machinery, 2007, pp. 275–283. doi:10.1145/1247069.1247119
109a.	New upper bounds on the quality of PCA bounding boxes in R² and R³. Darko Dimitrov, Christian Knauer, Klaus Kriegel, and Günter Rote In: Abstracts of the 23rd European Workshop on Computational Geometry, Graz, March 2007, pp. 122–125.
109b.	Bounds on the quality of the PCA bounding boxes. Darko Dimitrov, Christian Knauer, Klaus Kriegel, and Günter Rote Computational Geometry, Theory and Applications 42 (2009), 772–789. doi:10.1016/j.comgeo.2008.02.007 Abstract pdf file (gzipped)
110.	Pointed drawings of planar graphs. Oswin Aichholzer, Günter Rote, André Schulz, and Birgit Vogtenhuber In: Proceedings of the 19th Canadian Conference on Computational Geometry, Ottawa, August 20–22, 2007, Editor: Prosenjit Bose, pp. 237–240.
110a.	Pointed drawings of planar graphs. Oswin Aichholzer, Günter Rote, André Schulz, and Birgit Vogtenhuber manuscript, March 2008, 19 pages, to appear in Computational Geometry, Theory and Applications. (2012). Abstract pdf file (gzipped)
111.	On the maximum size of an anti-chain of linearly separable sets and convex pseudo-discs. Rom Pinchasi and Günter Rote Israel Journal of Mathematics 172 (2009), 337–348. doi:10.1007/s11856-009-0076-z, arXiv:0707.0311 [math.MG]. Abstract PostScript file (gzipped) pdf file (gzipped)
112.	Geometric clustering: fixed-parameter tractability and lower bounds with respect to the dimension. Sergio Cabello, Panos Giannopoulos, Christian Knauer, and Günter Rote In: Proceedings of the 19th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), San Francisco, January 2008, pp. 836–843. doi:10.1145/1347082.1347174
112a.	Geometric clustering: fixed-parameter tractability and lower bounds with respect to the dimension. Sergio Cabello, Panos Giannopoulos, Christian Knauer, Dániel Marx, and Günter Rote ACM Transactions on Algorithms 7 (2011), Article 43, 27 pages. doi:10.1145/2000807.2000811 Abstract pdf file (gzipped) free PDF @ACM
113.	Seed polytopes for incremental approximation. Oswin Aichholzer, Franz Aurenhammer, Thomas Hackl, Bernhard Kornberger, Simon Plantinga, Günter Rote, Astrid Sturm, and Gert Vegter In: Abstracts of the 24th European Workshop on Computational Geometry, Nancy, March 2008, pp. 13–16. Abstract PostScript file (gzipped) pdf file (gzipped)
113a.	Recovering structure from r-sampled objects. Oswin Aichholzer, Franz Aurenhammer, Bernhard Kornberger, Simon Plantinga, Günter Rote, Astrid Sturm, and Gert Vegter In: Eurographics Symposium on Geometry Processing, Berlin, July 2009, Editors: Marc Alexa, Michael Kazhdan, Computer Graphics Forum 28 (2009), pp. 1349–1360. doi:10.1111/j.1467-8659.2009.01512.x Abstract PostScript file (gzipped) pdf file (gzipped)
114.	Shortest inspection-path queries in simple polygons. Christian Knauer, Günter Rote, and Lena Schlipf In: Abstracts of the 24th European Workshop on Computational Geometry, Nancy, March 2008, pp. 153–156. Abstract pdf file (gzipped)
115.	Detecting hotspots in geographic networks. Kevin Buchin, Sergio Cabello, Joachim Gudmundsson, Maarten Löffler, Jun Luo, Günter Rote, Rodrigo I. Silveira, Bettina Speckmann, and Thomas Wolle In: Proceedings of the 12th AGILE International Conference on Geographic Information Science, Hannover, Germany, June 2009, Editors: Monika Sester, Lars Bernard, Volker Paelke. Lecture Notes in Geoinformation and Cartography, Springer-Verlag, 2009, pp. 217–231. (Best paper award). doi:10.1007/978-3-642-00318-9_11
115a.	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, and Thomas Wolle Journal of Graph Algorithms and Applications 14 (2010), 307–336. Abstract pdf file (gzipped)
116.	Curve intersection by the Subdivision-Supercomposition Method. Günter Rote Technical report ACS-TR-361503-01, Freie Universität Berlin, Institut für Informatik, May 2008, 12 pages. Abstract PostScript file (gzipped) pdf file (gzipped)
117.	Partitioning a polygon into two mirror congruent pieces. Dania El-Khechen, Thomas Fevens, John Iacono, and Günter Rote In: Proceedings of the 20th Canadian Conference on Computational Geometry, Montréal, August 13–15, 2008, pp. 131–134. pdf file (gzipped)
118.	Fixed-parameter tractability and lower bounds for stabbing problems. Panos Giannopoulos, Christian Knauer, Günter Rote, and Daniel Werner In: Abstracts of the 25th European Workshop on Computational Geometry (EuroCG'09), Brussels, March 2009, pp. 281–284.
118a.	Fixed-parameter tractability and lower bounds for stabbing problems. Panos Giannopoulos, Christian Knauer, Günter Rote, and Daniel Werner manuscript, June 2009, 28 pages, submitted for publication, Computational Geometry, Theory and Applications. (Special issue for the 25th European Workshop on Computational Geometry (EuroCG'09)). arXiv:0906.3896 [cs.CG]. Abstract pdf file (gzipped)
119.	Two applications of point matching. Günter Rote In: Abstracts of the 25th European Workshop on Computational Geometry (EuroCG'09), Brussels, March 2009, pp. 187–189. Abstract pdf file (gzipped)
120.	Formulae and growth rates of high-dimensional polycubes. Ronnie Barequet, Gill Barequet, and Günter Rote In: European Conference on Combinatorics, Graph Theory and Applications (EuroComb 2009), Bordeaux, September 2009, Editors: Jaroslav Nešetril and André Raspaud, Electronic Notes in Discrete Mathematics 34 (2009), 459–463. doi:10.1016/j.endm.2009.07.076
120a.	Formulae and growth rates of high-dimensional polycubes. Ronnie Barequet, Gill Barequet, and Günter Rote Combinatorica 30 (2010), 257–275. doi:10.1007/s00493-010-2448-8 Abstract pdf file (gzipped)
121.	The parameterized complexity of some geometric problems in unbounded dimension. Panos Giannopoulos, Christian Knauer, and Günter Rote In: Proc. 4th Int. Workshop on Parameterized and Exact Computation-IWPEC 2009, Copenhagen, September 2009, Editors: Jianer Chen and Fedor V. Fomin, Lecture Notes in Computer Science, 5917, Springer-Verlag, 2009, pp. 198–209. doi:10.1007/978-3-642-11269-0_16, arXiv:0906.3469 [cs.CG]. Abstract
122.	Plane graphs with parity constraints. Oswin Aichholzer, Thomas Hackl, Michael Hoffmann, Alexander Pilz, Günter Rote, Bettina Speckmann, and Birgit Vogtenhuber In: Algorithms and Data Structures Symposium-WADS 2009, Banff, August 2009, Editors: Frank Dehne, Ian Munro, Jörg-Rüdiger Sack, and Roberto Tamassia, Lecture Notes in Computer Science, 5664, Springer-Verlag, 2009, pp. 13–24. doi:10.1007/978-3-642-03367-4_2 Abstract pdf file (gzipped)
122a.	Plane graphs with parity constraints. Oswin Aichholzer, Thomas Hackl, Michael Hoffmann, Alexander Pilz, Günter Rote, Bettina Speckmann, and Birgit Vogtenhuber manuscript, May 2010, 18 pages, in preparation. Abstract pdf file (gzipped)
123.	Resolving loads with positive interior stresses. Günter Rote and André Schulz In: Algorithms and Data Structures Symposium-WADS 2009, Banff, August 2009, Editors: Frank Dehne, Ian Munro, Jörg-Rüdiger Sack, and Roberto Tamassia, Lecture Notes in Computer Science, 5664, Springer-Verlag, 2009, pp. 530–541. doi:10.1007/978-3-642-03367-4_46 Abstract pdf file (gzipped)
124.	Flip graphs of degree-bounded (pseudo-)triangulations. Oswin Aichholzer, Thomas Hackl, Davíd Orden, Pedro Ramos, Günter Rote, André Schulz, and Bettina Speckmann manuscript, March 2009, 9 pages, arXiv:0903.2184 [math.CO]. Abstract PostScript file (gzipped) pdf file (gzipped)
124a.	Flip graphs of bounded-degree triangulations. Oswin Aichholzer, Thomas Hackl, Davíd Orden, Pedro Ramos, Günter Rote, André Schulz, and Bettina Speckmann In: European Conference on Combinatorics, Graph Theory and Applications (EuroComb 2009), Bordeaux, September 2009, Editors: Jaroslav Nešetril and André Raspaud, Electronic Notes in Discrete Mathematics 34 (2009), 509–513. doi:10.1016/j.endm.2009.07.084 Abstract PostScript file (gzipped) pdf file (gzipped)
125.	Constant-work-space algorithms for geometric problems. Tetsuo Asano, Wolfgang Mulzer, Günter Rote, and Yajun Wang Journal of Computational Geometry 2 (2011), 46–68. Abstract pdf file (gzipped)
125a.	Constant-working-space algorithms for geometric problems. Tetsuo Asano and Günter Rote In: Proceedings of the 21st Annual Canadian Conference on Computational Geometry, Vancouver, August 17–19, 2009, pp. 87–90. (This is a preliminary short version with parts of the results of 125.)
126.	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, and Mariano Zelke In: Proceedings of the 21st Annual Canadian Conference on Computational Geometry, Vancouver, August 17–19, 2009, pp. 145–148.
126a.	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, and Mariano Zelke Computational Geometry, Theory and Applications 44 (2011), 82–94. (Special issue for the 21st Canadian Conference on Computational Geometry, Vancouver, 2009) doi:10.1016/j.comgeo.2010.09.004, arXiv:1009.5628. Abstract PostScript file (gzipped) pdf file (gzipped)
127.	Lines pinning lines. Boris Aronov, Otfried Cheong, Xavier Goaoc, and Günter Rote Discrete and Computational Geometry 45 (2011), 230–260. doi:10.1007/s00454-010-9288-6, arXiv:1002.3294 [math.MG]. Abstract pdf file (gzipped)
128.	Partial least-squares point matching under translations. Günter Rote In: 26th European Workshop on Computational Geometry (EuroCG'10), Dortmund, March 2010, pp. 249–251, Editor: Jan Vahrenhold. Abstract pdf file (gzipped)
129.	Collapse. Günter Rote and Uri Zwick In: Proceedings of the 22nd Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), San Francisco, January 2011, pp. 606–613. Abstract pdf file (gzipped)
130.	Proper n-cell polycubes in n - 3 dimensions. Andrei Asinowski, Ronnie Barequet, Gill Barequet, and Günter Rote In: "Computing and Combinatorics". Proceedings of the 17th Annual International Computing and Combinatorics Conference (COCOON 2011), Dallas, Texas, August 2011. Editors: Bin Fu and Ding-Zhu Du. Lecture Notes in Computer Science 6842, Springer-Verlag, 2011, pp. 181–191. doi:10.1007/978-3-642-22685-4_16 Abstract pdf file (gzipped)
131.	Monotone paths in planar convex subdivisions and polytopes. Adrian Dumitrescu, Günter Rote, and Csaba D. Tóth manuscript, March 2012, 21 pages, submitted for publication.
131a.	Monotone paths in planar convex subdivisions. Adrian Dumitrescu, Günter Rote, and Csaba D. Tóth to appear in: "Computing and Combinatorics". Proceedings of the 18th Annual International Computing and Combinatorics Conference (COCOON 2012), Sidney, August 2012. Editors: Joachim Gudmundsson, Julian Mestre, and Anastasios Viglas. Lecture Notes in Computer Science, 6842, Springer-Verlag, 2012, 12 pages.
131b.	Long monotone paths in convex subdivisions. Günter Rote In: Abstracts of the 27th European Workshop on Computational Geometry (EuroCG'11), Morschach, Switzerland, March 2011, pp. 183–184, Editor: Michael Hoffmann. pdf file (gzipped)
132.	Common developments of several different orthogonal boxes. Zachary Abel, Erik Demaine, Martin Demaine, Hiroaki Matsui, Günter Rote, and Ryuhei Uehara In: Proceedings of the 23rd Annual Canadian Conference on Computational Geometry, Vancouver, August 10–12, 2011, pp. 77–82. Abstract pdf file (gzipped)
133.	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, and Andrew Winslow In: Proceedings of the 23rd Annual Canadian Conference on Computational Geometry, Vancouver, August 10–12, 2011, pp. 229–234. Abstract pdf file (gzipped)
134.	Arc triangulations. Oswin Aichholzer, Wolfgang Aigner, Franz Aurenhammer, Katerina Cech Dobiášová, Bert Jüttler, and Günter Rote In: "Graph Drawing". GD 2011, Proceedings of the 19th International Symposium on Graph Drawing, Eindhoven, September 2011, Revised Selected Papers. Editors: Marc van Kreveld and Bettina Speckmann, Lecture Notes in Computer Science, 7034, Springer-Verlag, 2011, pp. 296–307. doi:10.1007/978-3-642-25878-7_29 Abstract pdf file (gzipped)
135.	Realizing planar graphs as convex polytopes. Günter Rote In: "Graph Drawing". GD 2011, Proceedings of the 19th International Symposium on Graph Drawing, Eindhoven, September 2011, Revised Selected Papers. Editors: Marc van Kreveld and Bettina Speckmann, Lecture Notes in Computer Science, 7034, Springer-Verlag, 2011, pp. 238–241. doi:10.1007/978-3-642-25878-7_23 Abstract pdf file (gzipped)
136.	Memory-constrained algorithms for simple polygons. Tetsuo Asano, Kevin Buchin, Maike Buchin, Matias Korman, Wolfgang Mulzer, Günter Rote, and André Schulz manuscript, December 2011, 13 pages, submitted for publication, arXiv:1112.5904 [cs.CG]. Abstract pdf file (gzipped)
136a.	Memory-constrained algorithms for simple polygons. Tetsuo Asano, Kevin Buchin, Maike Buchin, Matias Korman, Wolfgang Mulzer, Günter Rote, and André Schulz In: Abstracts of the 28th European Workshop on Computational Geometry (EuroCG'12), Assisi, Italy, March 2012, pp. 49–52, Editor: Walter Didimo and Giuseppe Liotta. Abstract pdf file (gzipped)
137.	Coloring dynamic point sets on a line. Jean Cardinal, Nathann Cohen, Sébastien Collette, Michael Hoffmann, Stefan Langerman, and Günter Rote In: Abstracts of the 28th European Workshop on Computational Geometry (EuroCG'12), Assisi, Italy, March 2012, pp. 209–212, Editor: Walter Didimo and Giuseppe Liotta. Abstract
138.	Add isotropic Gaussian kernels at own risk: more and more resilient modes in higher dimensions. Herbert Edelsbrunner, Brittany Terese Fasy, and Günter Rote to appear in: Proceedings of the 28th Annual Symposium on Computational Geometry, Chapel Hill, USA, June 17–20, 2012. Association for Computing Machinery, 2012, 10 pages. pdf file (gzipped)
139.	Configuration space visualization (video). Dror Atariah and Günter Rote to appear in: Proceedings of the 28th Annual Symposium on Computational Geometry, Chapel Hill, USA, June 17–20, 2012. Association for Computing Machinery, 2012, 2 pages. Abstract pdf file (gzipped)

Last update: May 4, 2012.