@Article{,
author = { Panos Giannopoulos and Christian Knauer and G{\"u}nter Rote and Daniel Werner },
title = { Fixed-parameter tractability and lower bounds for stabbing problems },
journal = { Special Issue on the 25th European Workshop an Computational Geometry },
year = { 2011 },
}
@Article{,
author = { Erik D. Demaine and Sándor P. Fekete and G{\"u}nter Rote and Nils Schweer and Daria Schymura and Mariano Zelke },
title = { Integer Point Sets Minimizing Average Pairwise L1 Distance: What is the Optimal Shape of a Town? },
journal = { Computational Geometry, Theory and Applications },
year = { 2011 },
volume = { 44 },
number = { 2 },
pages = { 82-94 },
}
@Article{,
author = { Erik D. Demaine and S\'andor P.Fekete and G{\"u}nter Rote and Nils Schweer and Daria Schymura and Mariano Zelke },
title = { Integer Point Sets Minimizing Average Pairwise L1-Distance: What is the Optimal Shape of a Town? },
journal = { CoRR },
year = { 2010 },
volume = { abs/1009.5628 },
note = { [Eprint:arXiv:1009.5628] },
}
@Article{,
author = { Darko Dimitrov and Christian Knauer and Klaus Kriegel and G{\"u}nter Rote },
title = { Bounds on the quality of the PCA bounding boxes },
journal = { Computational Geometry },
year = { 2009 },
month = { October },
volume = { 42 },
number = { 8 },
pages = { 772-789 },
note = { Special Issue on the 23rd European Workshop on Computational Geometry },
}
@InProceedings{,
author = { Panos Giannopoulos and Christian Knauer and G{\"u}nter Rote and Daniel Werner },
title = { Fixed-parameter tractability and lower bounds for stabbing problems },
booktitle = { Proceedings of the 25th European Workshop on Computational Geometry (EuroCG) },
year = { 2009 },
month = { March },
address = { Brussels, Belgium },
}
@Article{,
author = { Helmut Alt and Hans Bodlaender and Marc van Kreveld and G{\"u}nter Rote and Gerard Tel },
title = { Wooden Geometric Puzzles: Design and Hardness Proofs },
journal = { Theory Comput. Syst. },
year = { 2009 },
volume = { 44 },
pages = { 160--174 },
}
@Article{,
author = { Oswin Aichholzer and Franz Aurenhammer and Thomas Hackl and Bernhard Kornberger and Simon Plantinga and G{\"u}nter Rote and Astrid Sturm and Gert Vegter },
title = { Recovering Structure from r-Sampled Objects },
journal = { Computer Graphics forum (special issue on Symposium on Geomerty Processing 2009) },
year = { 2009 },
month = { July },
volume = { 28 },
number = { 5 },
pages = { 1349-1360 },
}
@InProceedings{,
author = { Erik D. Demaine and Sándor P. Fekete and G{\"u}nter Rote and Nils Schweer and Daria Schymura and Mariano Zelke },
title = { Integer Point Sets Minimizing Average Pairwise L1 Distance: What is the Optimal Shape of a Town? },
booktitle = { Proc. of the 21st Canadian Conference on Computational Geometry (CCCG) },
year = { 2009 },
month = { August },
pages = { 145-148 },
address = { Vancouver, Canada },
}
@InProceedings{,
author = { G{\"u}nter Rote },
title = { Two Applications of Point Matching },
booktitle = { Proceedings of the 25th European Workshop on Computational Geometry (EuroCG) },
year = { 2009 },
month = { March },
address = { Brussels, Belgium },
}
@InBook{rss-ptas-08,
author = { G{\"u}nter Rote and Francisco Santos and Ileana Streinu },
title = { Pseudo-triangulations --- a survey },
booktitle = { Surveys on Discrete and Computational Geometry---Twenty Years Later },
year = { 2008 },
month = { December },
editor = { Eli Goodman, J\'anos Pach, Richard Pollack },
publisher = { American Mathematical Society },
series = { Contemporary Mathematics },
note = { to appear http://www.inf.fu-berlin.de/~rote/Papers/postscript/Pseudo-triangulations+-+a+survey.ps
Eprint: arXiv:math/0612672 },
}
@Article{wgp-08,
author = { Helmut Alt and Hans Bodlaender and Marc van Kreveld and G{\"u}nter Rote and Gerard Tel },
title = { Wooden Geometric Puzzles: Design and Hardness Proofs },
journal = { Theory of Computing Systems },
year = { 2008 },
}
@TechReport{ACS-TR-242403-01,
author = { Darko Dimitrov and G{\"u}nter Rote and Astrid Sturm },
title = { PL-approximation of convex surfaces in 3D by the sandwich algorithm },
year = { 2008 },
month = { May },
number = { ACS-TR-242403-01 },
institution = { Freie Universit{\"a}t Berlin },
}
@TechReport{ACS-TR-362500-01,
author = { O. Aichholzer and F. Aurenhammer and T. Hackel and B. Kornberger and S. Plantinga and G{\"u}nter Rote and Astrid Sturm and G. Vegter },
title = { Seed polytopes for incremental approximations of general surfaces in 3D },
year = { 2008 },
month = { May },
number = { ACS-TR-362500-01 },
institution = { Freie Universit{\"a}t Berlin },
}
@InProceedings{,
author = { Christian Knauer and G{\"u}nter Rote and Lena Schlipf },
title = { Shortest Inspection-Path Queries in Simple Polygons },
booktitle = { Proceedings of the 24th European Workshop on Computational Geometry (EuroCG) },
year = { 2008 },
month = { March },
pages = { 153--156 },
address = { Nancy, France },
}
@Article{cgkr-mpsre-08,
author = { Sergio Cabello and Panos Giannopoulos and Christian Knauer and G{\"u}nter Rote },
title = { Matching point sets with respect to the {Earth Mover's Distance} },
journal = { Computational Geometry, Theory and Applications },
year = { 2008 },
volume = { 39 },
pages = { 118--133 },
note = { http://www.inf.fu-berlin.de/~rote/Papers/pdf/Matching+point+sets+with+respect+to+the+earth+movers+distance.pdf },
}
@Article{mr-mwtnh-08,
author = { Wolfgang Mulzer and G{\"u}nter Rote },
title = { Minimum-weight triangulation is NP-hard },
journal = { Journal of the Association for Computing Machinery },
year = { 2008 },
pages = { 31 pp. },
note = { to appear http://www.inf.fu-berlin.de/~rote/Papers/postscript/Minimum-weight+triangulation+is+NP-hard.ps },
}
@Article{drs-aopcm-08,
author = { Scot Drysdale and G{\"u}nter Rote and Astrid Sturm },
title = { Approximation of an open polygonal curve with a minimum number of circular arcs and biarcs },
journal = { Computational Geometry, Theory and Applications (Special Issue on the 22nd EuroCG) },
year = { 2008 },
month = { October },
volume = { 41 },
pages = { 31--47 },
note = { [pdf] },
}
@InProceedings{cgkr-gcfpt-08,
author = { Sergio Cabello and Panos Giannopoulos and Christian Knauer and G{\"u}nter Rote },
title = { Geometric clustering: fixed-parameter tractability and lower bounds with respect to the dimension },
booktitle = { Proceedings of the 19th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), San Francisco },
year = { 2008 },
note = { [ps] },
}
@Article{pr-msack-08,
author = { Rom Pinchasi and G{\"u}nter Rote },
title = { On the maximum size of an anti-chain of $k$-sets and convex pseudo-discs },
journal = { Israel Journal of Mathematics },
year = { 2008 },
month = { June },
note = { Eprint:arXiv:0707.0311
[ps] },
}
@Article{abkpr-tantm-08,
author = { Eyal Ackerman and Kevin Buchin and Christian Knauer and Rom Pinchasi and G{\"u}nter Rote },
title = { There are not too many Magic Configurations },
journal = { Discrete and Computational Geometry },
year = { 2008 },
volume = { 39 },
number = { 1 },
publisher = { Springer-Verlag New York, Inc. },
pages = { 3--16 },
address = { Secaucus, NJ, USA },
note = { doi:10.1007/s00454-007-9023-0
[ps] },
}
@InProceedings{rrs-epsg-07,
author = { Ares Ribo Mor and G{\"u}nter Rote and André Schulz },
title = { Embedding 3-Polytopes on a Small Grid },
booktitle = { SCG '07: Proceedings of the twenty-third annual symposium on Computational geometry },
year = { 2007 },
publisher = { ACM },
pages = { 112--118 },
address = { New York, NY, USA },
}
@InProceedings{wgp07,
author = { Helmut Alt and Hans L. Bodlaender and Marc J. van Kreveld and G{\"u}nter Rote and Gerard Tel },
title = { Wooden Geometric Puzzles: Design and Hardness Proofs },
booktitle = { Fun with Algorithms 4th International Conference (FUN2007) },
year = { 2007 },
month = { June },
publisher = { Springer Berlin / Heidelberg },
series = { Lecture Notes in Computer Science },
pages = { 16-29 },
address = { Castiglioncello, Italy },
}
@InProceedings{ulbq-0807,
author = { Darko Dimitrov and Christian Knauer and Klaus Kriegel and G{\"u}nter Rote },
title = { Upper and Lower Bounds on the Quality of the PCA Bounding Boxes },
booktitle = { Proceedings of the International Conference in Central Europe on Computer Graphics, Visualization and Computer Vision - WSCG 2007 },
year = { 2007 },
pages = { 185--192 },
address = { Plzen, Czech Republic },
}
@InProceedings{bbkrw-hdwd-07,
author = { Kevin Buchin and Maike Buchin and Christian Knauer and G{\"u}nter Rote and Carola Wenk },
title = { How Difficult is it to Walk the Dog? },
booktitle = { Proc. 23rd European Workshop on Computational Geometry },
year = { 2007 },
month = { March },
pages = { 170--173 },
address = { Graz, Austria },
}
@InProceedings{bprsv-casp-07,
author = { Kevin Buchin and Simon Plantinga and G{\"u}nter Rote and Astrid Sturm and Gert Vegter },
title = { Convex Approximation by Spherical Patches },
booktitle = { Proc. 23rd European Workshop on Computational Geometry },
year = { 2007 },
month = { March },
pages = { 26--29 },
address = { Graz, Austria },
}
@InProceedings{nubq-07,
author = { Darko Dimitrov and Christian Knauer and Klaus Kriegel and G{\"u}nter Rote },
title = { New Upper Bounds on the Quality of the PCA Bounding Boxes in R^2 and R^3 },
booktitle = { Proc. 23rd ACM Symp. on Computational Geometry },
year = { 2007 },
publisher = { ACM },
pages = { 275--283 },
address = { Gyeongju, South Korea },
}
@InProceedings{nubq2-07,
author = { Darko Dimitrov and Christian Knauer and Klaus Kriegel and G{\"u}nter Rote },
title = { New Upper Bounds on the Quality of the PCA Bounding Boxes in R^2 and R^3 (Extended Abstract) },
booktitle = { Proceedings of the 23rd European Workshop on Computational Geometry (EWCG) },
year = { 2007 },
pages = { 122--125 },
address = { Graz, Austria },
}
@Article{r-cfdbp-07,
author = { G{\"u}nter Rote },
title = { Computing the {Fr\'echet} distance between piecewise smooth curves },
journal = { Computational Geometry, Theory and Applications },
year = { 2007 },
volume = { 37 },
pages = { 162--174 },
note = { Doi: doi:10.1016/j.comgeo.2005.01.004
[ps] },
}
@TechReport{ACS-TR-242300-02,
author = { Scot Drysdale and G{\"u}nter Rote and Astrid Sturm },
title = { Approximation of polygonal curves with minimum number of biarcs },
year = { 2007 },
month = { May },
number = { ACS-TR-242300-02 },
institution = { Freie Universit{\"a}t Berlin },
}
@TechReport{ACS-TR-362501-01,
author = { Kevin Buchin and Simon Plantinga and G{\"u}nter Rote and Astrid Sturm and Gert Vegter },
title = { Spherical approximation of convex shapes },
year = { 2007 },
month = { May },
number = { ACS-TR-362501-01 },
institution = { Freie Universit{\"a}t Berlin },
}
@TechReport{mr-mwtnh-07,
author = { Wolfgang Mulzer and G{\"u}nter Rote },
title = { Minimum-weight triangulation is NP-hard },
year = { 2007 },
number = { B-05-23-revised },
pages = { pp. 45 },
institution = { Freie Universit\"at Berlin },
note = { arXiv:cs/0601002
[ps] },
}
@InProceedings{abkpr-mc-07,
author = { Eyal Ackerman and Kevin Buchin and Christian Knauer and Rom Pinchasi and G{\"u}nter Rote },
title = { There are not too many Magic Configurations },
booktitle = { SCG '07: Proceedings of the twenty-third annual symposium on Computational geometry },
year = { 2007 },
publisher = { ACM },
pages = { 142--149 },
address = { Gyeongju, South Korea },
note = { Doi: doi:10.1145/1247069.1247098
[ps] },
}
@Article{cdr-pegse-07,
author = { Sergio Cabello and Erik D. Demaine and G{\"u}nter Rote },
title = { Planar embeddings of graphs with specified edge lengths },
journal = { Journal of Graph Algorithms and Applications },
year = { 2007 },
volume = { 11 },
number = { 1 },
pages = { 259--276 },
note = { [pdf] },
}
@InProceedings{asrv-07-pdpg,
author = { Oswin Aichholzer and G{\"u}nter Rote and André Schulz and Birgit Vogtenhuber },
title = { Pointed Drawings of Planar Graphs },
journal = { Proceedings of the 19th Canadian Conference on Computational Geometry },
booktitle = { Proceedings of the 19th Canadian Conference on Computational Geometry },
year = { 2007 },
pages = { 237--240 },
}
@InProceedings{msnf-07,
author = { G{\"u}nter Rote and M. Zachariasen },
title = { Matrix scaling by network flow },
booktitle = { Proceedings of the 18th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), New Orleans },
year = { 2007 },
month = { January },
pages = { 848-854 },
address = { New Orleans, USA },
note = { [ps] },
}
@InProceedings{ocg-07,
author = { Sergio Cabello and G{\"u}nter Rote },
title = { Obnoxious centers in graphs },
booktitle = { Proceedings of the 18th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA) },
year = { 2007 },
month = { January },
pages = { 98-107 },
address = { New Orleans },
note = { doi:10.1145/1283383.1283395
[ps] },
}
@TechReport{s-acs-tr-05,
author = { Scot Drysdale and G{\"u}nter Rote and Astrid Sturm },
title = { Approximation of polygonal curves with min number of circular arcs - prototype software },
year = { 2006 },
month = { May },
number = { ACS-TR-122202-01 },
institution = { Freie Universit{\"a}t Berlin },
}
@InProceedings{,
author = { Scot Drysdale and G{\"u}nter Rote and Astrid Sturm },
title = { Approximation of an open polygonal curve with a minimum number of circular arcs },
booktitle = { Proceedings of the 22nd European Workshop on Computational Geometry (EWCG) },
year = { 2006 },
pages = { 25-28 },
}
@InProceedings{,
author = { Darko Dimitrov and Christian Knauer and Klaus Kriegel and G{\"u}nter Rote },
title = { On the Bounding Boxes Obtained by Principal Component Analysis },
booktitle = { Proc. 22nd European Workshop on Computational Geometry },
year = { 2006 },
pages = { 193--196 },
address = { Delphi, Greece },
}
@InProceedings{abkr-aod-06b,
author = { Eyal Ackerman and Kevin Buchin and Christian Knauer and G{\"u}nter Rote },
title = { Acyclic Orientation of Drawings },
booktitle = { Proc. 22nd European Workshop on Computational Geometry },
year = { 2006 },
pages = { 207--210 },
address = { Delphi, Greece },
note = { Unrefereed conference publication },
}
@InProceedings{abkr-aod-06,
author = { Eyal Ackerman and Kevin Buchin and Christian Knauer and G{\"u}nter Rote },
title = { Acyclic Orientation of Drawings },
booktitle = { Proc. 10th Scandinavian Workshop on Algorithm Theory },
year = { 2006 },
pages = { 268-279 },
}
@TechReport{,
author = { Darko Dimitrov and Christian Knauer and Klaus Kriegel and G{\"u}nter Rote },
title = { Upper and Lower Bounds on the Quality of the PCA Bounding Boxes },
year = { 2006 },
month = { September },
number = { B 06-10 },
institution = { Freie Universit{\"a}t Berlin },
}
@InBook{,
author = { G{\"u}nter Rote and Gert Vegter },
title = { Computational topology: an introduction. },
booktitle = { Effective Computational Geometry for Curves and Surfaces },
year = { 2006 },
editor = { Jean-Daniel Boissonnat and Monique Teillaud },
publisher = { Springer-Verlag },
chapter = { 7, Mathematics and Visualization },
pages = { 277-312 },
}
@InBook{,
author = { J.-D. Boissonnat and D. Cohen-Steiner and B. Mourrain and G{\"u}nter Rote and and G. Vegter },
title = { Meshing of surfaces },
booktitle = { Effective Computational Geometry for Curves and Surfaces },
year = { 2006 },
editor = { Jean-Daniel Boissonnat and Monique Teillaud },
publisher = { Springer Verlag },
chapter = { Chapter 5. Mathematics and Visualization },
pages = { 181-229 },
}
@InProceedings{,
author = { Wolfgang Mulzer and G{\"u}nter Rote },
title = { Minimum weight triangulation is NP-hard },
year = { 2006 },
month = { June },
series = { Proceedings of the 22nd Annual Symposium on Computational Geometry },
pages = { 1-10 },
address = { Sedona, USA },
note = { Association for Computing Machinery },
}
@InProceedings{,
author = { R. Connelly and E. D. Demaine and M. L. Demaine and S. P. Fekete and S. Langerman and J. S. B. Mitchell and Ares Ribo Mor and G{\"u}nter Rote },
title = { Locked and unlocked chains of planar shapes },
year = { 2006 },
month = { June },
series = { Proceedings of the 22nd Annual Symposium on Computational Geometry },
pages = { 61-70 },
address = { Sedona, USA },
note = { Association for Computing Machinery },
}
@Article{,
author = { A. Dumitrescu and A. Ebbers-Baumann and A. Gr{\"u}ne and R. Klein and G{\"u}nter Rote },
title = { On the geometric dilation of closed curves, graphs, and point sets },
journal = { Computational Geometry, Theory and Applications },
year = { 2006 },
number = { 36 },
pages = { 16-38 },
}
@Article{,
author = { G. Barequet and M. Moffie and Ares Ribo Mor and G{\"u}nter Rote },
title = { Counting polyominoes on twisted cylinders },
journal = { INTEGERS: The Electronic Journal of Combinatorial Number Theory 6 },
year = { 2006 },
number = { article #A22 },
pages = { 37 },
}
@Article{,
author = { G{\"u}nter Rote and André Schulz },
title = { Threshold arrangements and the knapsack problem },
journal = { Applied Mathematics Letters },
year = { 2006 },
volume = { 19 },
number = { Issue 1 },
pages = { 108-112 },
}
@Article{,
author = { Imre Bárány and G{\"u}nter Rote },
title = { Strictly convex drawings of planar graphs },
journal = { Documenta Mathematica },
year = { 2006 },
number = { 11 },
pages = { 369-391 },
}
@Article{cllr-soosc-05,
author = { Yi-Jen Chiang and Tobias Lenz and Xiang Lu and G{\"u}nter Rote },
title = { Simple and optimal output-sensitive construction of contour trees using monotone paths },
journal = { Computational Geometry, Theory and Applications },
year = { 2005 },
volume = { 30 },
pages = { 165--195 },
}
@TechReport{r-cfdbp-05,
author = { G{\"u}nter Rote },
title = { Computing the {F}r\'echet distance between piecewise smooth curves },
journal = { Computational Geometry, Theory and Applications },
year = { 2005 },
month = { May },
number = { ECG-TR-241108-01 },
pages = { 13 },
}
@TechReport{,
author = { Christian Knauer and G{\"u}nter Rote },
title = { Shortest Inspection-Path Queries in Simple Polygons },
year = { 2005 },
month = { April },
number = { B-05-05 },
institution = { Freie Universit{\"a}t Berlin },
}
@InProceedings{,
author = { G{\"u}nter Rote and André Schulz },
title = { A Pointed Delaunay Pseudo-Triangulation of a Simple Polygon },
booktitle = { Proceedings of the 21st European Workshop on Computational
Geometry },
year = { 2005 },
pages = { 77-80 },
address = { Eindhoven },
}
@InProceedings{,
author = { Sergio Cabello and Panos Giannopoulos and Christian Knauer and G{\"u}nter Rote },
title = { Matching point sets with respect to the Earth Mover's distance },
booktitle = { Proceedings of the 21st European Workshop on Computational Geometry (EWCG), Eindhoven, Netherlands },
year = { 2005 },
pages = { 27-60 },
}
@InProceedings{,
author = { Sergio Cabello and Panos Giannopoulos and Christian Knauer and G{\"u}nter Rote },
title = { Matching point sets with respect to the Earth
Mover's distance },
booktitle = { Proceedings of the 13th Annual European Symposium on Algorithms (ESA), Ibiza, Spain },
year = { 2005 },
}
@Article{horsssssw-pmrgp-04,
author = { Ruth Haas and David Orden and G{\"u}nter Rote and Francisco Santos and Brigitte Servatius and Herman Servatius and Diane Souvaine and Ileana Streinu and Walter Whiteley },
title = { Planar minimally rigid graphs and pseudo-triangulations },
journal = { Computational Geometry, Theory and Applications },
year = { 2005 },
}
@InProceedings{r-scdpg-05,
author = { G{\"u}nter Rote },
title = { Strictly convex drawings of planar graphs },
booktitle = { Proceedings of the 16th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), Vancouver },
year = { 2005 },
}
@InProceedings{,
author = { Helmut Alt and Christian Knauer and G{\"u}nter Rote and Sue Whitesides },
title = { On the Complexity of the Linkage Reconfiguration Problem },
booktitle = { Towards a Theory of Geometric Graphs },
year = { 2004 },
editor = { Janos Pach },
publisher = { American Mathematical Society },
pages = { 1--14 },
}
@InProceedings{dr-fdsc-04,
author = { Adrian Dumitrescu and G{\"u}nter Rote },
title = { On the {F}r\'echet distance of a set of curves. },
booktitle = { Proceedings of the 16th Canadian Conference on Computational Geometry },
year = { 2004 },
pages = { 162 - 165 },
address = { Montreal },
}
@Unpublished{,
author = { Robert Connelly and Erik D. Demaine and Martin L. Demaine and Sandor Fekete and Stefan Langerman and Joseph S. B. Mitchell and Ares Ribo Mor and G{\"u}nter Rote },
title = { Locked and unlocked chains of planar shapes },
year = { 2004 },
month = { August },
}
@Article{,
author = { Gill Barequet and Micha Moffie and Ares Ribo Mor and G{\"u}nter Rote },
title = { Counting polyominoes on twisted cylinders },
year = { 2004 },
month = { December },
}
@InProceedings{cdr-pegse-04,
author = { Sergio Cabello and Erik D. Demaine and G{\"u}nter Rote },
title = { Planar embeddings of graphs with specified edge lengths },
booktitle = { Graph Drawing. GD 2003, Proceedings of the 11th International Symposium on Graph Drawing, Perugia, September 2003, Revised Papers },
year = { 2004 },
volume = { 2912 },
editor = { Giuseppe Liotta },
publisher = { Springer-Verlag },
series = { Lecture Notes in Computer Science },
pages = { 283-294 },
}
@Article{dgr-gdcps-04,
author = { Adrian Dumitrescu and Ansgar Gr{\"u}ne and G{\"u}nter Rote },
title = { On the geometric dilation of curves and point sets },
year = { 2004 },
month = { July },
pages = { 14 },
}
@Article{orsssw-ncfnc-04,
author = { David Orden and G{\"u}nter Rote and Francisco Santos and Brigitte Servatius and Herman Servatius and Walter Whiteley },
title = { Non-crossing frameworks with non-crossing reciprocals },
journal = { Discrete and Computational Geometry },
year = { 2004 },
volume = { 32 },
pages = { 567--600 },
}
@Article{r-scdpg-04,
author = { G{\"u}nter Rote },
title = { Strictly convex drawings of planar graphs },
year = { 2004 },
month = { July },
}
@InProceedings{aerw-mpm-03,,
author = { Helmut Alt and Alon Efrat and G{\"u}nter Rote and Carola Wenk },
title = { Matching planar maps },
booktitle = { Proceedings of the 14th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), Baltimore },
year = { 2003 },
pages = { 589-598 },
}
@Article{ehkkrw-ce-04,
author = { Alon Efrat and Frank Hoffmann and Christian Knauer and Klaus Kriegel and G{\"u}nter Rote and Carola Wenk },
title = { Covering with Ellipses },
journal = { Algorithmica },
year = { 2003 },
volume = { 38 },
number = { 1 },
note = { Special Issue on Shape Algorithmics },
}
@Article{cdr-spacp-03,
author = { Robert Connelly and Erik D. Demaine and G{\"u}nter Rote },
title = { Straightening polygonal arcs and convexifying polygonal cycles },
journal = { Discrete and Computational Geometry },
year = { 2003 },
volume = { 30 },
pages = { 205-239 },
}
@InProceedings{acr-iccb-03,
author = { Nina Amenta and Sunghee Choi and G{\"u}nter Rote },
title = { Incremental constructions con BRIO },
booktitle = { Proceedings of the Nineteenth Annual Symposium on Computational Geometry, San Diego },
year = { 2003 },
publisher = { Association for Computing Machinery },
pages = { 211-219 },
}
@InProceedings{arss-zppt-03,
author = { Oswin Aichholzer and G{\"u}nter Rote and Bettina Speckmann and Ileana Streinu },
title = { The zigzag path of a pseudo-triangulation },
booktitle = { Algorithms and Data Structures. Proceedings of the 8th International Workshop on Algorithms and Data Structures (WADS 2003), Ottawa, July 2003 },
year = { 2003 },
volume = { 2748 },
editor = { Frank Dehne and Joerg-R{\"u}diger Sack and Michiel Smid },
publisher = { Springer-Verlag },
series = { Lecture Notes in Computer Science },
pages = { 377-388 },
}
@Article{cllr-soscc-03,
author = { Yi-Jen Chiang and Tobias Lenz and Xiang Lu and G{\"u}nter Rote },
title = { Simple and output-sensitive construction of contour trees using monotone paths },
journal = { Computational Geometry, Theory and Applications },
year = { 2003 },
month = { May },
number = { ECG-TR-244300-01 },
}
@TechReport{r-cfdbp-03,
author = { G{\"u}nter Rote },
title = { Computing the {F}r\'echet distance between piecewise smooth curves },
year = { 2003 },
month = { May },
number = { ECG-TR-241108-01 },
}
@InProceedings{rwwx-cmp-03,
author = { G{\"u}nter Rote and Cao An Wang and Lusheng Wang and Yinfeng Xu },
title = { On constrained minimum pseudotriangulations },
booktitle = { Computing and Combinatorics. Proceedings of the 9th International Computing and Combinatorics Conference (COCOON 2003), Big Sky, Montana, USA, July 2003 },
year = { 2003 },
volume = { 2697 },
editor = { Tandy Warnow and Binhai Zhu },
publisher = { Springer-Verlag },
series = { Lecture Notes in Computer Science },
pages = { 445-454 },
}
@InProceedings{waepr-fcmv-03,
author = { Helmut Alt and Alon Efrat and Lingeshwaran Palaniappan and G{\"u}nter Rote and Carola Wenk },
title = { Finding a curve in a map (Video) },
booktitle = { Proceedings of the Nineteenth Annual Symposium on Computational Geometry, San Diego },
year = { 2003 },
publisher = { Association for Computing Machinery },
pages = { 384-385 },
}
@InProceedings{,
author = { Helmut Alt and Christian Knauer and G{\"u}nter Rote and Sue Whitesides },
title = { The Complexity of (Un)folding },
journal = { Proceedings of the 19th ACM Symposium on Computational Geometry (SOCG) },
booktitle = { 19th ACM Symposium on Computational Geometry },
year = { 2003 },
pages = { 164-170 },
}
@Article{aerw-mpm_03,,
author = { Helmut Alt and Alon Efrat and G{\"u}nter Rote and Carola Wenk },
title = { Matching planar maps },
journal = { J. of Algorithms },
year = { 2003 },
pages = { 262-283 },
}
@InProceedings{,
author = { Tobias Lenz and G{\"u}nter Rote },
title = { Efficient Contour Tree Construction and Computation of Betti Numbers in Scalar Fields },
booktitle = { 19th European Workshop on Computational Geometry },
year = { 2003 },
month = { March },
address = { Bonn, Germany },
}
@TechReport{,
author = { Yi-Jen Chiang and Tobias Lenz and Xiang Lu and G{\"u}nter Rote },
title = { Simple and optimal output-sensitive construction of contour trees using monotone paths },
year = { 2003 },
month = { May },
number = { ECG-TR-244300-01 },
}
@InProceedings{r-peitl-03,
author = { G{\"u}nter Rote },
title = { Pursuit-evasion with imprecise target location },
booktitle = { Proceedings of the 14th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), Baltimore },
year = { 2003 },
pages = { 747-753 },
}
@InProceedings{horsssssw-pmrgp-03,
author = { Ruth Haas and David Orden and G{\"u}nter Rote and Francisco Santos and Brigitte Servatius and Herman Servatius and Diane Souvaine and Ileana Streinu and Walter Whiteley },
title = { Planar minimally rigid graphs and pseudo-triangulations },
booktitle = { Proceedings of the Nineteenth Annual Symposium on Computational Geometry, San Diego },
year = { 2003 },
publisher = { Association for Computing Machinery },
pages = { 154-163 },
}
@InProceedings{r-peitl-03,
author = { G{\"u}nter Rote },
title = { Pursuit-evasion with imprecise target location },
booktitle = { Proceedings of the 14th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), Baltimore },
year = { 2003 },
pages = { 747-753 },
}
@Article{rss-emppp-03,
author = { G{\"u}nter Rote and Francisco Santos and Ileana Streinu },
title = { Expansive motions and the polytope of pointed pseudo-triangulations },
journal = { Discrete and Computational Geometry--The Goodman-Pollack Festschrift },
year = { 2003 },
volume = { 25 },
pages = { 699-736 },
}
@InProceedings{ehkkrw-cse-02,
author = { Alon Efrat and Frank Hoffmann and Christian Knauer and Klaus Kriegel and G{\"u}nter Rote and Carola Wenk },
title = { Covering shapes by ellipses },
booktitle = { Proceedings of the 13th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), San Francisco },
year = { 2002 },
pages = { 453-454 },
address = { San Francisco, USA },
}
@Article{rwwx-cmp-02,
author = { G{\"u}nter Rote and Cao An Wang and Lusheng Wang and Yinfeng Xu },
title = { On constrained minimum pseudotriangulations },
year = { 2002 },
month = { July },
}
@InProceedings{cdr-ilstl-02,
author = { Robert Connelly and Erik D. Demaine and G{\"u}nter Rote },
title = { Infinitesimally locked self-touching linkages with applications to locked trees },
booktitle = { Physical Knots: Knotting, Linking, and Folding Geometric Objects in R3. },
year = { 2002 },
volume = { 304 },
editor = { Jorge Alberto Calvo and Kenneth C. Millett and Eric J. Rawdon },
publisher = { American Mathematical Society },
series = { Contemporary Mathematics },
pages = { 287-311 },
}
@TechReport{cdr-spacp-02,
author = { Robert Connelly and Erik D. Demaine and G{\"u}nter Rote },
title = { Straightening polygonal arcs and convexifying polygonal cycles },
year = { 2002 },
month = { February },
number = { B 02-02 },
institution = { Discrete and Computational Geometry },
}
@InProceedings{r-peitl-02,
author = { G{\"u}nter Rote },
title = { Pursuit-evasion with imprecise target location },
year = { 2002 },
month = { July },
}
@TechReport{emrs-todm-02,
author = { Robert Els{\"a}sser and Burkhard Monien and G{\"u}nter Rote and Stefan Schamberger },
title = { Toward optimal diffusion matrices },
year = { 2002 },
number = { ALCOMFT-TR-02-98 },
institution = { International Parallel and Distributed Processing Symposium. IPDPS 2002, Proceedings. },
note = { publisher: IEEE Computer Society Press },
}
@Article{r-cbn-02,
author = { G{\"u}nter Rote },
title = { Crossing the bridge at night },
journal = { EATCS Bulletin },
year = { 2002 },
month = { October },
volume = { 78 },
pages = { 241-246 },
}
@TechReport{ehkkrw-ce-01,
author = { Alon Efrat and Frank Hoffmann and Christian Knauer and Klaus Kriegel and G{\"u}nter Rote and Carola Wenk },
title = { Covering with Ellipses },
year = { 2001 },
month = { December },
number = { B 01-08 },
institution = { Freie Universit{\"a}t Berlin, Fachbereich Mathematik und Informatik },
}
@Article{aaiklr-gsac-01,
author = { Oswin Aichholzer and Franz Aurenhammer and Christian Icking and Rolf Klein and Elmar Langetepe and G{\"u}nter Rote },
title = { Generalized self-approaching curves },
journal = { Discrete Applied Mathematics },
year = { 2001 },
volume = { 109 },
pages = { 3--24 },
}
@Article{brs-teapf-01,
author = { Peter Bra{\ss} and G{\"u}nter Rote and Konrad J. Swanepoel },
title = { Triangles of extremal area or perimeter in a finite planar point set },
journal = { Discrete and Computational Geometry },
year = { 2001 },
volume = { 26 },
pages = { 51-58 },
}
@InProceedings{er-f2vip-01,
author = { Friedrich Eisenbrand and G{\"u}nter Rote },
title = { Fast 2-variable integer programming },
booktitle = { IPCO 2001--Proceedings of the 8th Conference on Integer Programming and Combinatorial Optimization, Utrecht },
year = { 2001 },
volume = { 2081 },
editor = { K. Aardal and B. Gerards },
publisher = { Springer-Verlag },
series = { Lecture Notes in Computer Science },
pages = { 78-89 },
}
@InProceedings{er-frtqf-01,
author = { Friedrich Eisenbrand and G{\"u}nter Rote },
title = { Fast reduction of ternary quadratic forms },
booktitle = { Cryptography and Lattices --International Conference, CaLC 2001 },
year = { 2001 },
volume = { 2146 },
editor = { Joseph H. Silverman },
publisher = { Springer-Verlag },
series = { Lecture Notes in Computer Science },
pages = { 32-44 },
}
@InProceedings{rrss-ctptw-01,
author = { Dana Randall and G{\"u}nter Rote and Francisco Santos and Jack Snoeyink },
title = { Counting triangulations and pseudo-triangulations of wheels },
booktitle = { Proceedings of the 13th Canadian Conference on Computational Geometry, Waterloo },
year = { 2001 },
editor = { T. Biedl },
pages = { 149-152 },
}
@Article{rss-emppp-01,
author = { G{\"u}nter Rote and Francisco Santos and Ileana Streinu },
title = { Expansive motions and the polytope of pointed pseudo-triangulations },
year = { 2001 },
month = { September },
}
@InProceedings{r-dfadp-01,
author = { G{\"u}nter Rote },
title = { Division-free algorithms for the determinant and the Pfaffian: algebraic and combinatorial approaches },
booktitle = { Computational Discrete Mathematics },
year = { 2001 },
volume = { 2122 },
editor = { Helmut Alt },
publisher = { Springer-Verlag },
series = { Lecture Notes in Computer Science },
pages = { 119-135 },
}
@Article{blr-ocpt-01,
author = { Rainer E. Burkard and Yixun Lin and G{\"u}nter Rote },
title = { The obnoxious center problem on a tree },
journal = { SIAM Journal on Discrete Mathematics },
year = { 2001 },
volume = { 14 },
pages = { 498-509 },
}
@Article{brsz-cltcc-00,
author = { Imre Bárány and G{\"u}nter Rote and William Steiger and Cun-Hui Zhang },
title = { A central limit theorem for convex chains in the square },
journal = { Discrete and Computational Geometry },
year = { 2000 },
volume = { 23 },
pages = { 35-50 },
}
@InProceedings{cdr-spacp-00,
author = { Robert Connelly and Erik D. Demaine and G{\"u}nter Rote },
title = { Straightening polygonal arcs and convexifying polygonal cycles },
booktitle = { Proceedings of the 41st Annual Symposium on Foundations of Computer Science, Redondo Beach, California },
year = { 2000 },
publisher = { IEEE Computer Society Press },
pages = { 432-442 },
}
@Article{fkr-ubmnf-00,
author = { Tamás Fleiner and Volker Kaibel and G{\"u}nter Rote },
title = { Upper bounds on the maximal number of facets of 0/1-polytopes },
journal = { European Journal of Combinatorics },
year = { 2000 },
volume = { 21 },
pages = { 121-130 },
}
@InProceedings{r-dfadp-00,
author = { G{\"u}nter Rote },
title = { Division-free algorithms for determinants and Pfaffians: algebraic and combinatorial approaches },
booktitle = { Computational Discrete Mathematics },
year = { 2000 },
month = { July },
editor = { Helmut Alt },
pages = { 59-75 },
}
@Article{aarx-clgta-99,
author = { Oswin Aichholzer and Franz Aurenhammer and G{\"u}nter Rote and Yin-Feng Xu },
title = { Constant-level greedy triangulations approximate the MWT well },
journal = { Journal of Combinatorial Optimization },
year = { 1999 },
volume = { 2 },
pages = { 361-369 },
}
@InProceedings{gr-dsvgp-99,
author = { Jerrold R. Griggs and G{\"u}nter Rote },
title = { On the distribution of sums of vectors in general position },
booktitle = { Contemporary Trends in Discrete Mathematics },
year = { 1999 },
editor = { Ronald L. Graham and Jan Kratochvíl and Jaroslav Ne{\v{s}}et{\v{r}}il and Fred S. Roberts },
publisher = { American Mathematical Society },
series = { DIMACS series in discrete mathematics and theoretical computer science },
pages = { 139-142 },
}
@Article{gr-rfmp-99,
author = { Martin Gavalec and G{\"u}nter Rote },
title = { Reachability of fuzzy matrix period },
journal = { Tatra Mountains Mathematical Publications },
year = { 1999 },
volume = { 16 },
pages = { 61-79 },
}
@Article{afrw-mcsrs-98,
author = { Helmut Alt and Ulrich Fuchs and G{\"u}nter Rote and Gerald Weber },
title = { Matching convex shapes with respect to the symmetric difference },
journal = { Algorithmica },
year = { 1998 },
volume = { 21 },
pages = { 89-103 },
}
@Article{aar-msrp-97,
author = { Oswin Aichholzer and Helmut Alt and G{\"u}nter Rote },
title = { Matching shapes with a reference point },
journal = { International Journal on Computational Geometry and Applications },
year = { 1997 },
volume = { 7 },
pages = { 349-363 },
}
@InProceedings{afrw-mcsrs-96,
author = { Helmut Alt and Ulrich Fuchs and G{\"u}nter Rote and Gerald Weber },
title = { Matching convex shapes with respect to the symmetric difference },
booktitle = { Algorithms - ESA '96. Proc. Fourth Annual European Symposium on Algorithms, Barcelona },
year = { 1996 },
volume = { 1136 },
publisher = { Springer-Verlag },
series = { Lecture Notes in Computer Science },
pages = { 320-333 },
}
@InProceedings{aar-msrp-94,
author = { Oswin Aichholzer and Helmut Alt and G{\"u}nter Rote },
title = { Matching shapes with a reference point },
booktitle = { Proceedings of the Tenth Annual Symposium on Computational Geometry, Stony Brook, New York },
year = { 1994 },
publisher = { Association for Computing Machinery },
pages = { 85-92 },
}
@InProceedings{sfrw-acfpr-90,
author = { Otfried Cheong (geb. Schwarzkopf) and Ulrich Fuchs and G{\"u}nter Rote and Emo Welzl },
title = { Approximation of convex figures by pairs of rectangles },
booktitle = { Proceedings of the 7th Annual Symposium on Theoretical Aspects of Computer Science (STACS'90) },
year = { 1990 },
volume = { 415 },
publisher = { Springer-Verlag },
series = { Lecture Notes in Computer Science },
pages = { 240-249 },
}
