FU Logo
Institute of Computer Science
123123

Günter Rote

[bibtex]

    Combinatorial Geometry

    • Embedding 3-Polytopes on a Small Grid
      In SCG '07: Proceedings of the twenty-third annual symposium on Computational geometry, Pages 112–118, ACM, New York, NY, USA, 2007.
      Ares Ribo Mor, Günter Rote, André Schulz
      [bibtex]

    • Wooden Geometric Puzzles: Design and Hardness Proofs
      In Fun with Algorithms 4th International Conference (FUN2007), Lecture Notes in Computer Science, Pages 16-29, Springer Berlin / Heidelberg, Castiglioncello, Italy, June 2007.
      Helmut Alt, Hans L. Bodlaender, Marc J. van Kreveld, Günter Rote, Gerard Tel
      [bibtex]

    Complexity Theory

    • On the Complexity of the Linkage Reconfiguration Problem
      In Towards a Theory of Geometric Graphs, Pages 1–14, Editor(s) Janos Pach, American Mathematical Society, 2004.
      Helmut Alt, Christian Knauer, Günter Rote, Sue Whitesides
      [bibtex]

    Computational Geometry

    • Fixed-parameter tractability and lower bounds for stabbing problems
      Special Issue on the 25th European Workshop an Computational Geometry, 2011.
      Panos Giannopoulos, Christian Knauer, Günter Rote, Daniel Werner
      [bibtex]

    • Bounds on the quality of the PCA bounding boxes
      Computational Geometry, Volume 42 (8), Pages 772-789, October 2009.
      Darko Dimitrov, Christian Knauer, Klaus Kriegel, Günter Rote
      Special Issue on the 23rd European Workshop on Computational Geometry
      [bibtex]

    • Fixed-parameter tractability and lower bounds for stabbing problems
      In Proceedings of the 25th European Workshop on Computational Geometry (EuroCG), Brussels, Belgium, March 2009.
      Panos Giannopoulos, Christian Knauer, Günter Rote, Daniel Werner
      [bibtex]

    • Wooden Geometric Puzzles: Design and Hardness Proofs
      Theory Comput. Syst., Volume 44, Pages 160–174, 2009.
      Helmut Alt, Hans Bodlaender, Marc van Kreveld, Günter Rote, Gerard Tel
      [bibtex]

    • Recovering Structure from r-Sampled Objects
      Computer Graphics forum (special issue on Symposium on Geomerty Processing 2009), Volume 28 (5), Pages 1349-1360, July 2009.
      Oswin Aichholzer, Franz Aurenhammer, Thomas Hackl, Bernhard Kornberger, Simon Plantinga, Günter Rote, Astrid Sturm, Gert Vegter
      [bibtex]

    • Pseudo-triangulations –- a survey
      In Surveys on Discrete and Computational Geometry–-Twenty Years Later, Contemporary Mathematics, Editor(s) Eli Goodman, János Pach, Richard Pollack, American Mathematical Society, December 2008.
      Günter Rote, Francisco Santos, Ileana Streinu
      to appear http://www.inf.fu-berlin.de/~rote/Papers/postscript/Pseudo-triangulations+-+a+survey.ps
      Eprint: arXiv:math/0612672
      [bibtex]

    • Wooden Geometric Puzzles: Design and Hardness Proofs
      Theory of Computing Systems, 2008.
      Helmut Alt, Hans Bodlaender, Marc van Kreveld, Günter Rote, Gerard Tel
      [bibtex]

    • PL-approximation of convex surfaces in 3D by the sandwich algorithm
      Technical Report ACS-TR-242403-01, Freie Universität Berlin, May 2008.
      Darko Dimitrov, Günter Rote, Astrid Sturm
      [bibtex]

    • Seed polytopes for incremental approximations of general surfaces in 3D
      Technical Report ACS-TR-362500-01, Freie Universität Berlin, May 2008.
      O. Aichholzer, F. Aurenhammer, T. Hackel, B. Kornberger, S. Plantinga, Günter Rote, Astrid Sturm, G. Vegter
      [bibtex]

    • Shortest Inspection-Path Queries in Simple Polygons
      In Proceedings of the 24th European Workshop on Computational Geometry (EuroCG), Pages 153–156, Nancy, France, March 2008.
      Christian Knauer, Günter Rote, Lena Schlipf
      [bibtex]

    • Upper and Lower Bounds on the Quality of the PCA Bounding Boxes
      In Proceedings of the International Conference in Central Europe on Computer Graphics, Visualization and Computer Vision - WSCG 2007, Pages 185–192, Plzen, Czech Republic, 2007.
      Darko Dimitrov, Christian Knauer, Klaus Kriegel, Günter Rote
      [bibtex]

    • How Difficult is it to Walk the Dog?
      In Proc. 23rd European Workshop on Computational Geometry, Pages 170–173, Graz, Austria, March 2007.
      Kevin Buchin, Maike Buchin, Christian Knauer, Günter Rote, Carola Wenk
      [bibtex]

    • Convex Approximation by Spherical Patches
      In Proc. 23rd European Workshop on Computational Geometry, Pages 26–29, Graz, Austria, March 2007.
      Kevin Buchin, Simon Plantinga, Günter Rote, Astrid Sturm, Gert Vegter
      [bibtex]

    • New Upper Bounds on the Quality of the PCA Bounding Boxes in R^2 and R^3
      In Proc. 23rd ACM Symp. on Computational Geometry, Pages 275–283, ACM, Gyeongju, South Korea, 2007.
      Darko Dimitrov, Christian Knauer, Klaus Kriegel, Günter Rote
      [bibtex]

    • New Upper Bounds on the Quality of the PCA Bounding Boxes in R^2 and R^3 (Extended Abstract)
      In Proceedings of the 23rd European Workshop on Computational Geometry (EWCG), Pages 122–125, Graz, Austria, 2007.
      Darko Dimitrov, Christian Knauer, Klaus Kriegel, Günter Rote
      [bibtex]

    • Computing the Fr\'echet distance between piecewise smooth curves
      Computational Geometry, Theory and Applications, Volume 37, Pages 162–174, 2007.
      Günter Rote
      Doi: doi:10.1016/j.comgeo.2005.01.004
      [ps]
      [bibtex]

    • Approximation of polygonal curves with minimum number of biarcs
      Technical Report ACS-TR-242300-02, Freie Universität Berlin, May 2007.
      Scot Drysdale, Günter Rote, Astrid Sturm
      [bibtex]

    • Spherical approximation of convex shapes
      Technical Report ACS-TR-362501-01, Freie Universität Berlin, May 2007.
      Kevin Buchin, Simon Plantinga, Günter Rote, Astrid Sturm, Gert Vegter
      [bibtex]

    • Approximation of polygonal curves with min number of circular arcs - prototype software
      Technical Report ACS-TR-122202-01, Freie Universität Berlin, May 2006.
      Scot Drysdale, Günter Rote, Astrid Sturm
      [bibtex]

    • Approximation of an open polygonal curve with a minimum number of circular arcs
      In Proceedings of the 22nd European Workshop on Computational Geometry (EWCG), Pages 25-28, 2006.
      Scot Drysdale, Günter Rote, Astrid Sturm
      [bibtex]

    • On the Bounding Boxes Obtained by Principal Component Analysis
      In Proc. 22nd European Workshop on Computational Geometry, Pages 193–196, Delphi, Greece, 2006.
      Darko Dimitrov, Christian Knauer, Klaus Kriegel, Günter Rote
      [bibtex]

    • Acyclic Orientation of Drawings
      In Proc. 22nd European Workshop on Computational Geometry, Pages 207–210, Delphi, Greece, 2006.
      Eyal Ackerman, Kevin Buchin, Christian Knauer, Günter Rote
      Unrefereed conference publication
      [bibtex]

    • Acyclic Orientation of Drawings
      In Proc. 10th Scandinavian Workshop on Algorithm Theory, Pages 268-279, 2006.
      Eyal Ackerman, Kevin Buchin, Christian Knauer, Günter Rote
      [bibtex]

    • Upper and Lower Bounds on the Quality of the PCA Bounding Boxes
      Technical Report B 06-10, Freie Universität Berlin, September 2006.
      Darko Dimitrov, Christian Knauer, Klaus Kriegel, Günter Rote
      [bibtex] [pdf]

    • Computational topology: an introduction.
      In Effective Computational Geometry for Curves and Surfaces, Chapter 7, Mathematics and Visualization, Pages 277-312, Editor(s) Jean-Daniel Boissonnat and Monique Teillaud, Springer-Verlag, 2006.
      Günter Rote, Gert Vegter
      [bibtex]

    • Meshing of surfaces
      In Effective Computational Geometry for Curves and Surfaces, Chapter Chapter 5. Mathematics and Visualization, Pages 181-229, Editor(s) Jean-Daniel Boissonnat and Monique Teillaud, Springer Verlag, 2006.
      J.-D. Boissonnat, D. Cohen-Steiner, B. Mourrain, Günter Rote, and G. Vegter
      [bibtex]

    • Minimum weight triangulation is NP-hard
      Proceedings of the 22nd Annual Symposium on Computational Geometry, Pages 1-10, Sedona, USA, June 2006.
      Wolfgang Mulzer, Günter Rote
      Association for Computing Machinery
      [bibtex]

    • Locked and unlocked chains of planar shapes
      Proceedings of the 22nd Annual Symposium on Computational Geometry, Pages 61-70, Sedona, USA, June 2006.
      R. Connelly, E. D. Demaine, M. L. Demaine, S. P. Fekete, S. Langerman, J. S. B. Mitchell, Ares Ribo Mor, Günter Rote
      Association for Computing Machinery
      [bibtex]

    • On the geometric dilation of closed curves, graphs, and point sets
      Computational Geometry, Theory and Applications, Pages 16-38, 2006.
      A. Dumitrescu, A. Ebbers-Baumann, A. Grüne, R. Klein, Günter Rote
      [bibtex]

    • Simple and optimal output-sensitive construction of contour trees using monotone paths
      Computational Geometry, Theory and Applications, Volume 30, Pages 165–195, 2005.
      Yi-Jen Chiang, Tobias Lenz, Xiang Lu, Günter Rote
      [bibtex]

    • Computing the Fr\'echet distance between piecewise smooth curves
      Technical Report ECG-TR-241108-01, Pages 13, May 2005.
      Günter Rote
      [bibtex]

    • Shortest Inspection-Path Queries in Simple Polygons
      Technical Report B-05-05, Freie Universität Berlin, April 2005.
      Christian Knauer, Günter Rote
      [bibtex] [pdf]

    • A Pointed Delaunay Pseudo-Triangulation of a Simple Polygon
      In Proceedings of the 21st European Workshop on Computational Geometry, Pages 77-80, Eindhoven, 2005.
      Günter Rote, André Schulz
      [bibtex]

    • On the Fr\'echet distance of a set of curves.
      In Proceedings of the 16th Canadian Conference on Computational Geometry, Pages 162 - 165, Montreal, 2004.
      Adrian Dumitrescu, Günter Rote
      [bibtex] [pdf] [ps.gz]

    • Locked and unlocked chains of planar shapes
      August 2004.
      Robert Connelly, Erik D. Demaine, Martin L. Demaine, Sandor Fekete, Stefan Langerman, Joseph S. B. Mitchell, Ares Ribo Mor, Günter Rote
      [bibtex]

    • Counting polyominoes on twisted cylinders
      December 2004.
      Gill Barequet, Micha Moffie, Ares Ribo Mor, Günter Rote
      [bibtex] [ps_]

    • Matching planar maps
      In Proceedings of the 14th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), Baltimore, Pages 589-598, 2003.
      Helmut Alt, Alon Efrat, Günter Rote, Carola Wenk
      [bibtex] [pdf] [ps.gz]

    • Covering with Ellipses
      Algorithmica, Volume 38 (1), 2003.
      Alon Efrat, Frank Hoffmann, Christian Knauer, Klaus Kriegel, Günter Rote, Carola Wenk
      Special Issue on Shape Algorithmics
      [bibtex]

    • Straightening polygonal arcs and convexifying polygonal cycles
      Discrete and Computational Geometry, Volume 30, Pages 205-239, 2003.
      Robert Connelly, Erik D. Demaine, Günter Rote
      [bibtex] [pdf] [ps.gz]

    • Incremental constructions con BRIO
      In Proceedings of the Nineteenth Annual Symposium on Computational Geometry, San Diego, Pages 211-219, Association for Computing Machinery, 2003.
      Nina Amenta, Sunghee Choi, Günter Rote
      [bibtex] [ps.gz] [pdf]

    • The zigzag path of a pseudo-triangulation
      In Algorithms and Data Structures. Proceedings of the 8th International Workshop on Algorithms and Data Structures (WADS 2003), Ottawa, July 2003, Lecture Notes in Computer Science, Volume 2748, Pages 377-388, Editor(s) Frank Dehne and Joerg-Rüdiger Sack and Michiel Smid, Springer-Verlag, 2003.
      Oswin Aichholzer, Günter Rote, Bettina Speckmann, Ileana Streinu
      [bibtex] [ps.gz]

    • Simple and output-sensitive construction of contour trees using monotone paths
      Computational Geometry, Theory and Applications, May 2003.
      Yi-Jen Chiang, Tobias Lenz, Xiang Lu, Günter Rote
      [bibtex] [pdf] [ps.gz]

    • Computing the Fr\'echet distance between piecewise smooth curves
      Technical Report ECG-TR-241108-01, May 2003.
      Günter Rote
      [bibtex] [pdf] [ps.gz]

    • On constrained minimum pseudotriangulations
      In Computing and Combinatorics. Proceedings of the 9th International Computing and Combinatorics Conference (COCOON 2003), Big Sky, Montana, USA, July 2003, Lecture Notes in Computer Science, Volume 2697, Pages 445-454, Editor(s) Tandy Warnow and Binhai Zhu, Springer-Verlag, 2003.
      Günter Rote, Cao An Wang, Lusheng Wang, Yinfeng Xu
      [bibtex] [pdf] [ps.gz]

    • Finding a curve in a map (Video)
      In Proceedings of the Nineteenth Annual Symposium on Computational Geometry, San Diego, Pages 384-385, Association for Computing Machinery, 2003.
      Helmut Alt, Alon Efrat, Lingeshwaran Palaniappan, Günter Rote, Carola Wenk
      [bibtex] [pdf] [ps.gz]

    • The Complexity of (Un)folding
      In 19th ACM Symposium on Computational Geometry, Pages 164-170, 2003.
      Helmut Alt, Christian Knauer, Günter Rote, Sue Whitesides
      [bibtex] [ps.gz]

    • Matching planar maps
      J. of Algorithms, Pages 262-283, 2003.
      Helmut Alt, Alon Efrat, Günter Rote, Carola Wenk
      [bibtex] [pdf] [ps.gz]

    • Efficient Contour Tree Construction and Computation of Betti Numbers in Scalar Fields
      In 19th European Workshop on Computational Geometry, Bonn, Germany, March 2003.
      Tobias Lenz, Günter Rote
      [bibtex]

    • Simple and optimal output-sensitive construction of contour trees using monotone paths
      Technical Report ECG-TR-244300-01, May 2003.
      Yi-Jen Chiang, Tobias Lenz, Xiang Lu, Günter Rote
      [bibtex]

    • Covering shapes by ellipses
      In Proceedings of the 13th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), San Francisco, Pages 453-454, San Francisco, USA, 2002.
      Alon Efrat, Frank Hoffmann, Christian Knauer, Klaus Kriegel, Günter Rote, Carola Wenk
      [bibtex]

    • On constrained minimum pseudotriangulations
      July 2002.
      Günter Rote, Cao An Wang, Lusheng Wang, Yinfeng Xu
      [bibtex] [pdf] [ps.gz]

    • Covering with Ellipses
      Technical Report B 01-08, Freie Universität Berlin, Fachbereich Mathematik und Informatik, December 2001.
      Alon Efrat, Frank Hoffmann, Christian Knauer, Klaus Kriegel, Günter Rote, Carola Wenk
      [bibtex] [ps.gz]

    Discrete Mathematics

    • Counting polyominoes on twisted cylinders
      INTEGERS: The Electronic Journal of Combinatorial Number Theory 6, Pages 37, 2006.
      G. Barequet, M. Moffie, Ares Ribo Mor, Günter Rote
      [bibtex]

    • Threshold arrangements and the knapsack problem
      Applied Mathematics Letters, Volume 19 (Issue 1), Pages 108-112, 2006.
      Günter Rote, André Schulz
      [bibtex]

    Geometric Optimization Problems

    Geometric Shape and Pattern Matching

    Geometry

    • On the maximum size of an anti-chain of $k$-sets and convex pseudo-discs
      Israel Journal of Mathematics, June 2008.
      Rom Pinchasi, Günter Rote
      Eprint:arXiv:0707.0311
      [ps]
      [bibtex]

    • There are not too many Magic Configurations
      Discrete and Computational Geometry, Volume 39 (1), Pages 3–16, Springer-Verlag New York, Inc., Secaucus, NJ, USA, 2008.
      Eyal Ackerman, Kevin Buchin, Christian Knauer, Rom Pinchasi, Günter Rote
      doi:10.1007/s00454-007-9023-0
      [ps]
      [bibtex]

    • There are not too many Magic Configurations
      In SCG '07: Proceedings of the twenty-third annual symposium on Computational geometry, Pages 142–149, ACM, Gyeongju, South Korea, 2007.
      Eyal Ackerman, Kevin Buchin, Christian Knauer, Rom Pinchasi, Günter Rote
      Doi: doi:10.1145/1247069.1247098
      [ps]
      [bibtex]

    • Planar embeddings of graphs with specified edge lengths
      Journal of Graph Algorithms and Applications, Volume 11 (1), Pages 259–276, 2007.
      Sergio Cabello, Erik D. Demaine, Günter Rote
      [pdf]
      [bibtex]

    • Planar minimally rigid graphs and pseudo-triangulations
      Computational Geometry, Theory and Applications, 2005.
      Ruth Haas, David Orden, Günter Rote, Francisco Santos, Brigitte Servatius, Herman Servatius, Diane Souvaine, Ileana Streinu, Walter Whiteley
      [bibtex] [pdf] [pdf]

    • Strictly convex drawings of planar graphs
      In Proceedings of the 16th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), Vancouver, 2005.
      Günter Rote
      [bibtex]

    • Planar embeddings of graphs with specified edge lengths
      In Graph Drawing. GD 2003, Proceedings of the 11th International Symposium on Graph Drawing, Perugia, September 2003, Revised Papers, Lecture Notes in Computer Science, Volume 2912, Pages 283-294, Editor(s) Giuseppe Liotta, Springer-Verlag, 2004.
      Sergio Cabello, Erik D. Demaine, Günter Rote
      [bibtex] [ps.gz]

    • On the geometric dilation of curves and point sets
      Pages 14, July 2004.
      Adrian Dumitrescu, Ansgar Grüne, Günter Rote
      [bibtex] [pdf] [ps.gz]

    • Non-crossing frameworks with non-crossing reciprocals
      Discrete and Computational Geometry, Volume 32, Pages 567–600, 2004.
      David Orden, Günter Rote, Francisco Santos, Brigitte Servatius, Herman Servatius, Walter Whiteley
      [bibtex]

    • Strictly convex drawings of planar graphs
      July 2004.
      Günter Rote
      [bibtex] [ps.gz]

    • Pursuit-evasion with imprecise target location
      In Proceedings of the 14th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), Baltimore, Pages 747-753, 2003.
      Günter Rote
      [bibtex]

    • Planar minimally rigid graphs and pseudo-triangulations
      In Proceedings of the Nineteenth Annual Symposium on Computational Geometry, San Diego, Pages 154-163, Association for Computing Machinery, 2003.
      Ruth Haas, David Orden, Günter Rote, Francisco Santos, Brigitte Servatius, Herman Servatius, Diane Souvaine, Ileana Streinu, Walter Whiteley
      [bibtex] [pdf] [pdf]

    • Pursuit-evasion with imprecise target location
      In Proceedings of the 14th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), Baltimore, Pages 747-753, 2003.
      Günter Rote
      [bibtex]

    • Expansive motions and the polytope of pointed pseudo-triangulations
      Discrete and Computational Geometry–The Goodman-Pollack Festschrift, Volume 25, Pages 699-736, 2003.
      Günter Rote, Francisco Santos, Ileana Streinu
      [bibtex] [pdf] [pdf.gz] [ps.gz]

    • Infinitesimally locked self-touching linkages with applications to locked trees
      In Physical Knots: Knotting, Linking, and Folding Geometric Objects in R3., Contemporary Mathematics, Volume 304, Pages 287-311, Editor(s) Jorge Alberto Calvo and Kenneth C. Millett and Eric J. Rawdon, American Mathematical Society, 2002.
      Robert Connelly, Erik D. Demaine, Günter Rote
      [bibtex] [pdf] [ps.gz]

    • Straightening polygonal arcs and convexifying polygonal cycles
      Technical Report B 02-02, Discrete and Computational Geometry, February 2002.
      Robert Connelly, Erik D. Demaine, Günter Rote
      [bibtex] [pdf] [ps.gz]

    • Pursuit-evasion with imprecise target location
      July 2002.
      Günter Rote
      [bibtex]

    • Generalized self-approaching curves
      Discrete Applied Mathematics, Volume 109, Pages 3–24, 2001.
      Oswin Aichholzer, Franz Aurenhammer, Christian Icking, Rolf Klein, Elmar Langetepe, Günter Rote
      [bibtex] [pdf] [ps.gz]

    • Triangles of extremal area or perimeter in a finite planar point set
      Discrete and Computational Geometry, Volume 26, Pages 51-58, 2001.
      Peter Braß, Günter Rote, Konrad J. Swanepoel
      [bibtex]

    • Fast 2-variable integer programming
      In IPCO 2001–Proceedings of the 8th Conference on Integer Programming and Combinatorial Optimization, Utrecht, Lecture Notes in Computer Science, Volume 2081, Pages 78-89, Editor(s) K. Aardal and B. Gerards, Springer-Verlag, 2001.
      Friedrich Eisenbrand, Günter Rote
      [bibtex] [pdf] [ps.gz]

    • Fast reduction of ternary quadratic forms
      In Cryptography and Lattices –International Conference, CaLC 2001, Lecture Notes in Computer Science, Volume 2146, Pages 32-44, Editor(s) Joseph H. Silverman, Springer-Verlag, 2001.
      Friedrich Eisenbrand, Günter Rote
      [bibtex] [pdf] [ps.gz]

    • Counting triangulations and pseudo-triangulations of wheels
      In Proceedings of the 13th Canadian Conference on Computational Geometry, Waterloo, Pages 149-152, Editor(s) T. Biedl, 2001.
      Dana Randall, Günter Rote, Francisco Santos, Jack Snoeyink
      [bibtex] [pdf] [ps.gz]

    • Expansive motions and the polytope of pointed pseudo-triangulations
      September 2001.
      Günter Rote, Francisco Santos, Ileana Streinu
      [bibtex] [pdf] [pdf.gz] [ps.gz]

    • A central limit theorem for convex chains in the square
      Discrete and Computational Geometry, Volume 23, Pages 35-50, 2000.
      Imre Bárány, Günter Rote, William Steiger, Cun-Hui Zhang
      [bibtex] [pdf] [ps.gz]

    • Straightening polygonal arcs and convexifying polygonal cycles
      In Proceedings of the 41st Annual Symposium on Foundations of Computer Science, Redondo Beach, California, Pages 432-442, IEEE Computer Society Press, 2000.
      Robert Connelly, Erik D. Demaine, Günter Rote
      [bibtex] [pdf] [ps.gz]

    • Upper bounds on the maximal number of facets of 0/1-polytopes
      European Journal of Combinatorics, Volume 21, Pages 121-130, 2000.
      Tamás Fleiner, Volker Kaibel, Günter Rote
      [bibtex] [pdf] [ps.gz]

    • On the distribution of sums of vectors in general position
      In Contemporary Trends in Discrete Mathematics, DIMACS series in discrete mathematics and theoretical computer science, Pages 139-142, Editor(s) Ronald L. Graham and Jan Kratochvíl and Jaroslav Neš}et{řil and Fred S. Roberts, American Mathematical Society, 1999.
      Jerrold R. Griggs, Günter Rote
      [bibtex] [pdf] [ps.gz]

    Graph Theory and Algorithms

    • Pointed Drawings of Planar Graphs
      In Proceedings of the 19th Canadian Conference on Computational Geometry, Pages 237–240, 2007.
      Oswin Aichholzer, Günter Rote, André Schulz, Birgit Vogtenhuber
      [bibtex]

    • Strictly convex drawings of planar graphs
      Documenta Mathematica, Pages 369-391, 2006.
      Imre Bárány, Günter Rote
      [bibtex]

    • Division-free algorithms for the determinant and the Pfaffian: algebraic and combinatorial approaches
      In Computational Discrete Mathematics, Lecture Notes in Computer Science, Volume 2122, Pages 119-135, Editor(s) Helmut Alt, Springer-Verlag, 2001.
      Günter Rote
      [bibtex] [pdf] [ps.gz]

    • Division-free algorithms for determinants and Pfaffians: algebraic and combinatorial approaches
      In Computational Discrete Mathematics, Pages 59-75, Editor(s) Helmut Alt, July 2000.
      Günter Rote
      [bibtex] [pdf] [ps.gz]

    • Reachability of fuzzy matrix period
      Tatra Mountains Mathematical Publications, Volume 16, Pages 61-79, 1999.
      Martin Gavalec, Günter Rote
      [bibtex] [pdf] [ps.gz]

    Optimization Problems

    • Matrix scaling by network flow
      In Proceedings of the 18th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), New Orleans, Pages 848-854, New Orleans, USA, January 2007.
      Günter Rote, M. Zachariasen
      [ps]
      [bibtex]

    • Obnoxious centers in graphs
      In Proceedings of the 18th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), Pages 98-107, New Orleans, January 2007.
      Sergio Cabello, Günter Rote
      doi:10.1145/1283383.1283395
      [ps]
      [bibtex]

    • Toward optimal diffusion matrices
      Technical Report ALCOMFT-TR-02-98, International Parallel and Distributed Processing Symposium. IPDPS 2002, Proceedings., 2002.
      Robert Elsässer, Burkhard Monien, Günter Rote, Stefan Schamberger
      publisher: IEEE Computer Society Press
      [bibtex]

    • Crossing the bridge at night
      EATCS Bulletin, Volume 78, Pages 241-246, October 2002.
      Günter Rote
      [bibtex] [pdf] [ps.gz]

    • The obnoxious center problem on a tree
      SIAM Journal on Discrete Mathematics, Volume 14, Pages 498-509, 2001.
      Rainer E. Burkard, Yixun Lin, Günter Rote
      [bibtex] [pdf] [ps.gz]

    Work Group
    Members
    Projects
    Scholarship Programs
    Publications
    Theses
    Events
    Photo Album
    Impressum