@Article{,
author = { Hee-Kap Ahn and Sang-Sub Kim and Christian Knauer and Lena Schlipf and Chan-Su Shin and Antoine Vigneron },
title = { Covering and piercing disks with two centers },
journal = { Comput. Geom. },
year = { 2013 },
volume = { 46 },
number = { 3 },
pages = { 253-262 },
}
@InProceedings{,
author = { Lena Schlipf },
title = { New Results on Convex Stabbers },
booktitle = { EuroCG'13 },
year = { 2013 },
pages = { 57-60 },
}
@InProceedings{,
author = { Matthias Henze and Rafel Jaume and Balász Keszegh },
title = { On the complexity of the partial least-squares matching Voronoi diagram },
booktitle = { Proceedings of the 29th European Workshop on Computational Geometry (EuroCG) },
year = { 2013 },
month = { March },
pages = { 193--196 },
note = { Proceedings URL [pdf] },
}
@InProceedings{,
author = { Helmut Alt and Ludmila Scharf },
title = { Parallel Computation of the Hausdorff Distance between Shapes },
booktitle = { Proceedings of the 29th European Workshop on Computational Geometry (EuroCG) },
year = { 2013 },
month = { March },
pages = { 47--50 },
note = { Proceedings URL },
}
@Article{,
author = { Matthias Henze },
title = { A Blichfeldt-type inequality for centrally symmetric convex bodies },
journal = { Monatshefte f\"ur Mathematik },
year = { 2013 },
volume = { 170 },
number = { 3--4 },
pages = { 371--379 },
note = { [Eprint:arXiv:1203.4075] },
}
@Article{,
author = { Ragnar Freij and Matthias Henze and Moritz W. Schmitt and G\"unter M. Ziegler },
title = { Face numbers of centrally symmetric polytopes from split graphs },
journal = { Electronic Journal of Combinatorics },
year = { 2013 },
volume = { 20 },
number = { 2 },
pages = { #P32 },
note = { [Eprint:arXiv:1201.5790] },
}
@Article{,
author = { Helmut Alt and Ludmila Scharf },
title = { Shape Matching by Random Sampling },
journal = { Theoretical Computer Science },
year = { 2012 },
volume = { 442 },
pages = { 2--12 },
note = { [doi] },
}
@Article{,
author = { Vesna Andova and Darko Dimitrov and Ji\v{r}i Fink and Riste \v{S}krekovski },
title = { Bounds on Gutman Index },
journal = { MATCH Communications in Mathematical and in Computer Chemistry },
year = { 2012 },
volume = { 67 },
number = { 2 },
pages = { 515 -524 },
}
@Article{,
author = { Daria Schymura },
title = { Matching solid shapes in arbitrary dimension via random sampling },
year = { 2012 },
note = { extended abstract (submitted) },
}
@Article{DBLP:journals/dam/AbdoDG12,
author = { Hosam Abdo and Darko Dimitrov and Ivan Gutman },
title = { On the Zagreb indices equality },
journal = { Discrete Applied Mathematics },
year = { 2012 },
volume = { 160 },
number = { 1-2 },
pages = { 1-8 },
}
@Article{,
author = { Christian Knauer and Lena Schlipf and Jens Schmidt and Hans Tiwary },
title = { Largest Inscribed Rectangles in Convex Polygons },
journal = { J. of Discrete Algorithms },
year = { 2012 },
volume = { 13 },
pages = { 78--85 },
note = { [doi] },
}
@PhdThesis{,
author = { Matthias Henze },
title = { Lattice Point Inequalities and Face Numbers of Polytopes in View of Central Symmetry },
year = { 2012 },
month = { May },
school = { Otto-von-Guericke-Universit{\"a}t Magdeburg },
address = { Institut f{\"u}r Algebra und Geometrie },
note = { URL },
}
@Article{,
author = { Helmut Alt and Ludmila Scharf },
title = { Computation of the Hausdorff distance between sets of line segments in parallel },
journal = { CoRR },
year = { 2012 },
volume = { abs/1207.3962 },
note = { [arxiv] },
}
@Manual{,
author = { M. Drechsler and K. Johst and M. Mewes and Astrid Sturm and F. W{\"a}tzold },
title = { Handbuch der Software Ecopay zur Bestimmung kosteneffizienter Ausgleichszahlungen f{\"u}r Ma{\ss}nahmen zum Schutz gef{\"a}hrdeter Arten und Lebensraumtypen im Gr{\"u}nland. },
year = { 2012 },
}
@Article{,
author = { Hee-Kap Ahn and Christian Knauer and Marc Scherfenberg and Lena Schlipf and Antoine Vigneron },
title = { Computing the Discrete Fréchet Distance with Imprecise Input },
journal = { Int. J. Comput. Geometry Appl. },
year = { 2012 },
volume = { 22 },
number = { 1 },
pages = { 27-44 },
}
@Article{,
author = { Hee-Kap Ahn and Sang-Sub Kim and Christian Knauer and Lena Schlipf and Chan-Su Shin and Antoine Vigneron },
title = { Covering and Piercing Disks with Two Centers },
journal = { CoRR },
year = { 2012 },
volume = { abs/1201.1198 },
}
@Article{,
author = { Lena Schlipf },
title = { Notes on Convex Transversals },
journal = { CoRR },
year = { 2012 },
volume = { abs/1211.5107 },
}
@Article{,
author = { Eyal Ackerman and Rom Pinchasi and Ludmila Scharf and Marc Scherfenberg },
title = { On Inducing Polygons and Related Problems },
journal = { Computational Geometry, Theory and Applications (CGTA) },
year = { 2011 },
note = { http://dx.doi.org/10.1016/j.comgeo.2011.06.003 },
}
@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 },
}
@InProceedings{,
author = { Darko Dimitrov and Mathias Holst and Christian Knauer and Klaus Kriegel },
title = { Efficient Dynamical Computation of Principal Components },
booktitle = { Proceedings of International Conference on Computer Graphics Theory and Applications - GRAPP },
year = { 2011 },
pages = { 85--93 },
address = { Vilamoura, Portugal },
}
@Article{,
author = { Vesna Andova and Darko Dimitrov and Boris Furtula and Ivan Gutman and Damir Vukicevic },
title = { Some Observations on Comparing Zagreb Indices },
journal = { MATCH Communications in Mathematical and in Computer Chemistry },
year = { 2011 },
volume = { 66 },
number = { 2 },
pages = { 627--645 },
}
@Article{,
author = { Vesna Andova and Sa\v{s}o Bogoev and Darko Dimitrov and Marcin Pilipczuk and Riste \v{S}krekovski },
title = { On the Zagreb Index Inequality of Graphs with Prescribed Vertex Degrees },
journal = { Discrete Applied Mathematics },
year = { 2011 },
volume = { 159 },
pages = { 852–858 },
}
@Article{,
author = { Eyal Ackerman and Rom Pinchasi and Ludmila Scharf and Marc Scherfenberg },
title = { Every Simple Arrangement of n Lines Contains an Inducing Simple n-gon },
journal = { The American Mathematical Monthly (AMM) },
year = { 2011 },
month = { February },
volume = { 118 },
number = { 2 },
pages = { 164-167 },
note = { http://dx.doi.org/10.4169/amer.math.monthly.118.02.164 },
}
@Article{,
author = { Christian Knauer and Maarten L{\"o}ffler and Marc Scherfenberg and Thomas Wolle },
title = { The directed {H}ausdorff distance between imprecise point sets },
journal = { Theoretical Computer Science (TCS) },
year = { 2011 },
volume = { 412 },
number = { 32 },
pages = { 4173-4186 },
}
@InProceedings{,
author = { Daria Schymura },
title = { Probabilistic matching of solids in arbitrary dimension },
journal = { Proceedings },
booktitle = { Proceedings of the 27th European Workshop on Computational Geometry (EuroCG) },
year = { 2011 },
month = { March },
address = { Morschach, Switzerland },
}
@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 = { Panos Giannopoulos and Christian Knauer and Magnus Wahlstr{\"o}m and Daniel Werner },
title = { Hardness of discrepacy computation and epsilon-net verification in high dimension },
journal = { CoRR },
year = { 2011 },
volume = { abs/1103.4503 },
note = { [Eprint:arXiv:1103.4503] },
}
@InProceedings{,
author = { Christian Knauer and Hans Tiwary and Daniel Werner },
title = { On the computational complexitiy of Ham-Sandwich cuts, Helly sets, and related problems },
booktitle = { Proceedings of the 28th International Symposium on Theoretical Aspects of Computer Science (STACS) },
year = { 2011 },
}
@InProceedings{,
author = { Nabil H. Mustafa and Hans Tiwary and Daniel Werner },
title = { A Proof of the Oja-Depth Conjecture in the Plane },
booktitle = { Proceedings of teh 27th European Workshop on Computational Geometry (EuroCG) },
year = { 2011 },
}
@Article{,
author = { Hosam Abdo and Darko Dimitrov and Ivan Gutman },
title = { On the Zagreb Indices Equality },
journal = { CoRR },
year = { 2011 },
volume = { abs/1106.1809v1 },
}
@InProceedings{,
author = { Hee-Kap Ahn and Sang-Sub Kim and Christian Knauer and Hyeon-Suk Na and Lena Schlipf and Chan-Su Shin and Antoine Vigneron },
title = { Covering and Piercing Disks with Two Centers },
booktitle = { Proceedings of the 27th European Workshop on Computational Geometry (EuroCG) },
year = { 2011 },
pages = { 63--66 },
address = { Morschach, Switzerland },
}
@InProceedings{,
author = { Otfried Cheong (geb. Schwarzkopf) and Hyo-Sil Kim and Lena Schlipf },
title = { Computing Barrier Resilience for Line Segments is NP-hard and APX-hard },
booktitle = { Proc.of the 14th Korea-Japan Joint Workhop on Algorithms and Computation (WAAC 2011) },
year = { 2011 },
}
@InCollection{,
author = { Esther Arkin and Claudia Dieckmann and Christian Knauer and Joseph Mitchell and Valentin Polishchuk and Lena Schlipf and Shang Yang },
title = { Convex Transversals },
booktitle = { Algorithms and Data Structures },
year = { 2011 },
volume = { 6844 },
editor = { Dehne, Frank and Iacono, John and Sack, J{\"o}rg-R{\"u}diger },
publisher = { Springer Berlin / Heidelberg },
series = { Lecture Notes in Computer Science },
pages = { 49-60 },
}
@InCollection{,
author = { Hee-Kap Ahn and Sang-Sub Kim and Christian Knauer and Lena Schlipf and Chan-Su Shin and Antoine Vigneron },
title = { Covering and Piercing Disks with Two Centers },
booktitle = { Algorithms and Computation },
year = { 2011 },
volume = { 7074 },
editor = { Takao Asano, Shin-ichi Nakano, Okamoto Yoshio, Osamu Watanabe },
publisher = { Springer Berlin/Heidelberg },
pages = { 50-59 },
}
@Article{,
author = { Christian Knauer and Marc Scherfenberg },
title = { Approximate nearest neighbor search under translation invariant {H}ausdorff distance },
journal = { International Journal on Computational Geometry and Applications (IJCGA) },
year = { 2011 },
volume = { 21 },
number = { 3 },
pages = { 369-381 },
}
@Article{,
author = { Ludmila Scharf and Marc Scherfenberg },
title = { Inducing polygons of line arrangements },
journal = { International Journal on Computational Geometry and Applications (IJCGA) },
year = { 2011 },
month = { June },
volume = { 21 },
number = { 3 },
pages = { 351-368 },
}
@Article{,
author = { Martin Henk and Matthias Henze and J\"org M. Wills },
title = { Blichfeldt-type inequalities and central symmetry },
journal = { Advances in Geometry },
year = { 2011 },
volume = { 11 },
number = { 4 },
pages = { 731--744 },
}
@Article{,
author = { Christian Bey and Martin Henk and Matthias Henze and Eva Linke },
title = { Notes on lattice points of zonotopes and lattice-face polytopes },
journal = { Discrete Mathematics },
year = { 2011 },
volume = { 311 },
number = { 8-9 },
pages = { 634--644 },
}
@MastersThesis{,
author = { Rafel Jaume },
title = { Domain Adaptation for Visual Recognition },
year = { 2011 },
month = { July },
school = { Universitat Politècnica de Catalunya },
note = { [url] [pdf] },
}
@Article{Alt201099,
author = { Helmut Alt and Ludmila Scharf and Daria Schymura },
title = { Probabilistic Matching of Planar Regions },
journal = { Computational Geometry, Theory and Applications (CGTA) },
year = { 2010 },
volume = { 43 },
number = { 2 },
pages = { 99--114 },
note = { Special Issue on the 24th European Workshop on Computational Geometry (EuroCG'08)
view at ScienceDirect },
}
@InProceedings{Schmidt2010,
author = { Jens Schmidt },
title = { Construction Sequences and Certifying 3-Connectedness },
booktitle = { 27th International Symposium on Theoretical Aspects of Computer Science (STACS'10) },
year = { 2010 },
address = { Nancy, France },
note = { http://page.mi.fu-berlin.de/jeschmid/pub },
}
@Article{,
author = { Helmut Alt and Maike Buchin },
title = { Can We Compute the Similarity between Surfaces? },
journal = { Discrete and Computational Geometry },
year = { 2010 },
volume = { 43 },
number = { 1 },
pages = { 78--99 },
}
@InProceedings{,
author = { Helmut Alt and Ludmila Scharf },
title = { Computing the depth of an arrangement of axis-aligned rectangles in parallel },
booktitle = { Proceedings of the 26th European Workshop on Computational Geometry (EuroCG) },
year = { 2010 },
month = { March },
pages = { 33--36 },
address = { Dortmund, Germany },
}
@Article{,
author = { Nathann Cohen and Darko Dimitrov and Roi Krakovski and Vida Vuka\v{s}inovi{\'c} and Riste \v{S}krekovski },
title = { On Wiener Index of Graphs and Their Line Graphs },
journal = { MATCH Communications in Mathematical and in Computer Chemistry },
year = { 2010 },
volume = { 64 },
number = { 3 },
pages = { 683--698 },
}
@InProceedings{,
author = { Christian Knauer and Lena Schlipf and Jens Schmidt and Hans Tiwary },
title = { Largest Inscribed Rectangles in Simple Polygons },
booktitle = { EuroCG'10 },
year = { 2010 },
pages = { 201-204 },
}
@InProceedings{,
author = { Hee-Kap Ahn and Christian Knauer and Marc Scherfenberg and Lena Schlipf and Antoine Vigneron },
title = { Computing the Discrete Fréchet Distance with Imprecise Input },
booktitle = { Proceedings of the 26th European Workshop on Computational Geometry (EuroCG) },
year = { 2010 },
pages = { 13--16 },
address = { Dortmund, Germany },
}
@Article{,
author = { Romain Grunert },
title = { Directed free pseudospaces },
journal = { Journal of Symbolic Logic },
year = { 2010 },
volume = { 75 },
number = { 4 },
pages = { 1176--1198 },
}
@Article{,
author = { A. Elmasry and K. Mehlhorn and Jens Schmidt },
title = { A Linear-Time Certifying Triconnnectivity Algorithm for Hamiltonian Graphs },
journal = { Algorithmica },
year = { 2010 },
}
@Article{,
author = { Jens Schmidt },
title = { Construction Sequences and Certifying 3-Connectivity },
journal = { Algorithmica },
year = { 2010 },
}
@TechReport{,
author = { Jens Schmidt },
title = { Contractions, Removals and Certifying 3-Connectivity in Linear Time },
year = { 2010 },
institution = { Freie Universit\"at Berlin, Germany },
}
@InProceedings{,
author = { Jens Schmidt },
title = { Point sets with planar embeddings of cubic, connected graphs },
booktitle = { KAM-DIMATIA Series 959 },
year = { 2010 },
editor = { Charles University, Prague },
publisher = { Jivri Fink },
}
@InCollection{,
author = { Hee-Kap Ahn and Christian Knauer and Marc Scherfenberg and Lena Schlipf and Antoine Vigneron },
title = { Computing the Discrete {F}réchet Distance with Imprecise Input },
booktitle = { Proceedings of the 21st International Symposium on Algorithms and Computation (ISAAC 2010) },
year = { 2010 },
volume = { 6507 },
editor = { Cheong, Otfried and Chwa, Kyung-Yong and Park, Kunsoo },
publisher = { Springer-Verlag, Berlin/Heidelberg, Germany },
series = { Lecture Notes in Computer Science },
pages = { 422--433 },
}
@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 = { Daria Schymura },
title = { An upper bound on the volume of the symmetric difference of a body and a congruent copy },
journal = { CoRR },
year = { 2010 },
volume = { abs/1010.2446 },
note = { [Eprint:arXiv:1010.2446] },
}
@InProceedings{,
author = { Panos Giannopoulos and Christian Knauer and Magnus Wahlstr{\"o}m and Daniel Werner },
title = { Hardness of discrepancy computation and epsilon-net verification in high dimension },
booktitle = { Proccedings of the 26 th European Workshop on Computational Geometry (EuroCG) },
year = { 2010 },
month = { March },
address = { Dortmund, Germany },
}
@InProceedings{,
author = { Mike Fellows and Panos Giannopoulos and Christian Knauer and Christophe Paul and Frances A. Rosamond and Sue Whitesides and Nathan Yu },
title = { Milling a Graph with Turn Costs: A Parametrized Complexity Perspective },
booktitle = { WG },
year = { 2010 },
volume = { 6410 },
series = { Lecture Notes in Computer Science },
pages = { 123-134 },
note = { [doi] },
}
@Article{,
author = { Panos Giannopoulos and Rolf Klein and Christian Knauer and Martin Kutz and D{\'a}niel Marx },
title = { Computing Geometric Minimum-Dilation Graphs is NP-Hard },
journal = { Int. J. Comput. Geometry appl. },
year = { 2010 },
volume = { 20 },
number = { 2 },
pages = { 147-173 },
note = { [doi] },
}
@InProceedings{eurocg-gs-09,
author = { Otfried Cheong and Joachim Gudmundsson and Hyo-Sil Kim and Daria Schymura and Fabian Stehn },
title = { Measuring the Similarity of Geometric Graphs },
booktitle = { Proceedings of the 25th European Workshop on Computational Geometry (EuroCG) },
year = { 2009 },
month = { March },
address = { Brussels, Belgium },
}
@Article{npcrp-08,
author = { Darko Dimitrov and Elad Horev and Roi Krakovski },
title = { A Note on Polychromatic Coloring of Rectangular Partitions },
journal = { Discrete Mathematics },
year = { 2009 },
month = { May },
volume = { 309 },
number = { 9 },
pages = { 2957-2960 },
}
@InProceedings{09-smrs,
author = { Helmut Alt and Ludmila Scharf },
title = { Shape matching by random sampling },
booktitle = { 3rd Annual Workshop on Algorithms and Computation (WALCOM 2009) },
year = { 2009 },
volume = { 5431 },
editor = { S. Das and R. Uehara },
publisher = { Springer-Verlag Berlin Heidelberg },
series = { Lecture Note in Computer Science },
pages = { 381--393 },
}
@InProceedings{eurocg-wdhd-09,
author = { Christian Knauer and Klaus Kriegel and Fabian Stehn },
title = { Minimizing the weighted directed Hausdorff distance between colored point sets under translations and rigid motions },
booktitle = { Proceedings of the 25th European Workshop on Computational Geometry (EuroCG) },
year = { 2009 },
month = { March },
address = { Brussels, Belgium },
}
@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 = { Ludmila Scharf and Marc Scherfenberg },
title = { Inducing n-gon of an arrangement of lines },
booktitle = { Proceedings of the 25th European Workshop on Computational Geometry (EuroCG) },
year = { 2009 },
month = { March },
pages = { 129--132 },
address = { Brussels, Belgium },
}
@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 },
}
@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 },
}
@Article{aabbcknsw-coh-09,
author = { Hee-Kap Ahn and Helmut Alt and Tetsuo Asano and Sang Won Bae and Peter Bra{\ss} and Otfried Cheong and Christian Knauer and Hyeon-Suk Na and Chan-Su Shin and Alexander Wolff },
title = { Constructing Optimal Highways },
journal = { Internat. J. Found. Comput. Sci. },
year = { 2009 },
volume = { 20 },
number = { 1 },
pages = { 3--23 },
note = { [doi] },
}
@TechReport{,
author = { Jens Schmidt },
title = { Construction Sequences and Certifying 3-Connectedness },
year = { 2009 },
month = { March },
number = { B 09-01 },
institution = { Freie Universit\"at Berlin, Germany },
note = { [pdf] },
}
@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 },
}
@TechReport{,
author = { Darko Dimitrov and Tom\'a\v{s} Dvo\v{r}\'ak and Petr Gregor and and Riste \v{S}krekovski },
title = { Gray Code Compression },
journal = { TechReport },
year = { 2009 },
month = { March },
number = { B 09-02 },
institution = { Institut f{\"u}r Informatik },
address = { Freie Universit{\"a}t Berlin },
}
@InProceedings{chd-09,
author = { Christian Knauer and Klaus Kriegel and Fabian Stehn },
title = { Minimizing the weighted directed Hausdorff distance between colored point sets under translations and rigid motions },
booktitle = { Proc. Frontiers in Algorithmics Workshop },
year = { 2009 },
volume = { 5598 },
publisher = { Springer },
series = { Lecture Notes in Computer Science },
pages = { 108--119 },
address = { Hefei, China },
}
@InProceedings{sgg-09,
author = { Otfried Cheong and Joachim Gudmundsson and Hyo-Sil Kim and Daria Schymura and Fabian Stehn },
title = { Measuring the Similarity of Geometric Graphs },
booktitle = { Proc. 8th International Symposium on Experimental Algorithms },
year = { 2009 },
volume = { 5526 },
publisher = { Springer },
series = { Lecture Notes in Computer Science },
pages = { 101--112 },
address = { Dortmund, Germany },
}
@PhdThesis{,
author = { Ludmila Scharf },
title = { Probabilistic Matching of Planar Shapes },
year = { 2009 },
month = { June },
school = { Freie Universit{\"a}t Berlin },
address = { Institut f{\"u}r Informatik },
note = { diss-online },
}
@InProceedings{,
author = { Eyal Ackerman and Rom Pinchasi and Ludmila Scharf and Marc Scherfenberg },
title = { On Inducing Polygons and Related Problems },
booktitle = { Proc. of 17th Annual European Symposium on Algorithms (ESA) },
year = { 2009 },
month = { September },
publisher = { Springer },
series = { Lecture Notes in Computer Science },
note = { Springer LNCS },
}
@TechReport{,
author = { Lutz Mei{\ss}ner },
title = { Polygonal Chains with pairwise identical Hausdorff Distance },
year = { 2009 },
number = { B 09-10 },
institution = { Freie Universit\"at Berlin, Germany },
}
@InProceedings{,
author = { Jens Schmidt },
title = { Interval Stabbing Problems in Small Integer Ranges },
booktitle = { 20th International Symposium on Algorithms and Computation (ISAAC 09) },
year = { 2009 },
address = { Hawaii, USA },
note = { accepted for publication
[pdf and source code] },
}
@InBook{,
author = { Helmut Alt },
title = { The Computational Geometry of Comparing Shapes },
booktitle = { Efficient Algorithms },
year = { 2009 },
volume = { LNCS 5760 },
editor = { Susanne Albers, Helmut Alt, Stefan N{\"a}her },
publisher = { Springer Berlin / Heidelberg },
pages = { 235--248 },
note = { Essays Dedicated to Kurt Mehlhorn on the Occasion of His 60th Birthday
SpringerLink },
}
@Proceedings{,
title = { Efficient Algorithms },
year = { 2009 },
volume = { LNCS 5760 },
editor = { Susanne Albers, Helmut Alt, Stefan N{\"a}her },
publisher = { Springer Berlin / Heidelberg },
note = { Essays Dedicated to Kurt Mehlhorn on the Occasion of His 60th Birthday
SpringerLink },
}
@Article{,
author = { Darko Dimitrov and Tom\'a\v{s} Dvo\v{r}\'ak and Petr Gregor and and Riste \v{S}krekovski },
title = { Gray Code Compression },
journal = { IWOCA’09, Lecture Notes in Computer Science },
year = { 2009 },
volume = { 5874 },
pages = { 83–-193 },
}
@Article{,
author = { Darko Dimitrov and Mathias Holst and Christian Knauer and Klaus Kriegel },
title = { Closed-Form Solutions for Continuous PCA and Bounding Box Algorithms },
journal = { A. Ranchordas et al. (Eds.): VISIGRAPP 2008, CCIS , Springer },
year = { 2009 },
volume = { 2 },
pages = { 26--40 },
}
@Article{,
author = { Christian Knauer and Maarten L{\"o}ffler and Marc Scherfenberg and Thomas Wolle },
title = { The Directed {H}ausdorff Distance between Imprecise Point Sets },
year = { 2009 },
note = { [Eprint:arXiv:0909.4642] },
}
@InProceedings{,
author = { Hee-Kap Ahn and Marc Scherfenberg and Lena Schlipf and Antoine Vigneron },
title = { Computing the Discrete Fréchet Distance with Imprecise Input },
booktitle = { Proc.of the 12th Korea-Japan Joint Workhop on Algorithms and Computation (WAAC 2009) },
year = { 2009 },
month = { July },
pages = { 132--137 },
}
@InCollection{,
author = { Christian Knauer and Maarten L{\"o}ffler and Marc Scherfenberg and Thomas Wolle },
title = { The Directed {H}ausdorff Distance between Imprecise Point Sets },
booktitle = { Proceedings of the 20th International Symposium on Algorithms and Computation (ISAAC 2009) },
year = { 2009 },
volume = { 5878 },
editor = { Dong, Yingfei and Du, Ding-Zhu and Ibarra, Oscar },
publisher = { Springer-Verlag, Berlin/Heidelberg, Germany },
series = { Lecture Notes in Computer Science },
pages = { 720--729 },
note = { [doi] },
}
@Misc{,
author = { Jens Schmidt },
title = { Point sets with planar embeddings of cubic, connected graphs },
year = { 2009 },
note = { (to appear) },
howpublished = { KAM-DIMATIA Series, Charles University, Prague },
}
@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 },
}
@Article{,
author = { Darko Dimitrov and Tom\'a\v{s} Dvo\v{r}\'ak and Petr Gregor and Riste \v{S}krekovski },
title = { Gray Codes Avoiding Matchings },
journal = { Discrete Mathematics & Theoretical Computer Science },
year = { 2009 },
volume = { 11 },
number = { 2 },
pages = { 123--148 },
}
@TechReport{,
author = { Nathann Cohen and Darko Dimitrov and Roi Krakovski and Vida Vuka\v{s}inovi{\'c} and Riste \v{S}krekovsi },
title = { On Wiener Index of Graphs and Their Line Graphs },
year = { 2009 },
month = { December },
number = { B 09-03 },
institution = { Institut f{\"u}r Informatik, Freie Universit{\"a}t Berlin },
}
@Article{,
author = { Helmut Alt and Ludmila Scharf and Daria Schymura },
title = { Probabilistic Matching of Planar Regions },
journal = { CoRR },
year = { 2009 },
volume = { abs/0902.4337 },
note = { [Eprint:arXiv:0902.4337] },
}
@Article{,
author = { Darko Dimitrov and Mathias Holst and Christian Knauer and Klaus Kriegel },
title = { Computing Principal Components Dynamically },
journal = { CoRR },
year = { 2009 },
volume = { abs/0912.5380 },
}
@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 },
}
@TechReport{08-smrs,
author = { Helmut Alt and Ludmila Scharf },
title = { Shape matching by random sampling },
year = { 2008 },
number = { B 08-02 },
institution = { Freie Universit{\"a}t Berlin },
}
@InProceedings{08-esbba,
author = { Darko Dimitrov and Mathias Holst and Christian Knauer and Klaus Kriegel },
title = { Experimental Study of Bounding Box Algorithms },
booktitle = { Proceedings of International Conference on Computer Graphics Theory and Applications - GRAPP },
year = { 2008 },
pages = { 15--22 },
address = { Funchal, Portugal },
}
@InProceedings{08-ap2sr,
author = { Darko Dimitrov and Christian Knauer and Klaus Kriegel and Fabian Stehn },
title = { Approximate point-to-surface registration with a single characteristic point },
booktitle = { Proceedings of International Conference on Computer Vision Theory and Applications - VISAPP },
year = { 2008 },
pages = { 188-195 },
address = { Funchal, Portugal },
}
@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] },
}
@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{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] },
}
@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{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] },
}
@TechReport{s-ipla-08,
author = { Ludmila Scharf },
title = { An inducing simple polygon of a line arrangement },
year = { 2008 },
number = { B 08-03 },
institution = { Freie Universit{\"a}t Berlin },
}
@InProceedings{s-seip,
author = { Sven Scholz },
title = { Similarity Evaluation based on Image Primitives },
booktitle = { The Fifth IASTED International Conference on Signal Processing, Pattern Recognition, and Applications (SPPRA) },
year = { 2008 },
month = { February },
address = { Innsbruck, Austria },
}
@InProceedings{ass-pmp-08,
author = { Helmut Alt and Ludmila Scharf and Daria Schymura },
title = { Probabilistic Matching of Polygons },
booktitle = { Proceedings of the 24th European Workshop on Computational Geometry (EuroCG) },
year = { 2008 },
month = { March },
pages = { 255--258 },
address = { Nancy, France },
}
@InProceedings{mss-ipla-08,
author = { Elena Mumford and Ludmila Scharf and Marc Scherfenberg },
title = { Inducing polygons of line arrangements },
booktitle = { Proceedings of the 24th European Workshop on Computational Geometry (EuroCG) },
year = { 2008 },
month = { March },
pages = { 107--110 },
address = { Nancy, France },
}
@InProceedings{p4cr-08,
author = { Darko Dimitrov and Elad Horev and Roi Krakovski },
title = { Polyhromatic 4-Colorings of Rectangular Partitions },
journal = { Proc. 24th European Workshop on Computational Geometry },
booktitle = { Proc. 24th European Workshop on Computational Geometry },
year = { 2008 },
pages = { 79--81 },
address = { Nancy, France },
}
@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 },
}
@Article{as-chdco-08,
author = { Helmut Alt and Ludmila Scharf },
title = { Computing the {H}ausdorff Distance between Curved Objects },
journal = { Int. J. Comput. Geometry Appl. },
year = { 2008 },
month = { August },
volume = { 18 },
number = { 4 },
pages = { 307--320 },
}
@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 },
}
@InProceedings{intervalalg,
author = { Britta Denner-Broser },
title = { An Algorithm for the Tracing Problem Using Interval Analysis },
booktitle = { SAC 2008; session Geometric constraints and reasoning },
year = { 2008 },
pages = { 1832--1837 },
}
@InProceedings{ss-08-ipla,
author = { Ludmila Scharf and Marc Scherfenberg },
title = { Inducing polygons of line arrangements },
booktitle = { Proceedings of the 19th International Symposium on Algorithms and Computation (ISAAC 2008) },
year = { 2008 },
month = { December },
editor = { S.-H. Hong and H. Nagamochi and T. Fukunaga },
publisher = { Springer-Verlag Berlin Heidelberg },
series = { Lecture Notes in Computer Science (LNCS 5369) },
pages = { 508--520 },
note = { best student paper award },
}
@InProceedings{ss-08-ipla,
author = { Christian Knauer and Marc Scherfenberg },
title = { Approximate nearest neighbor search under translation invariant Hausdorff distance },
booktitle = { Proceedings of the 19th International Symposium on Algorithms and Computation (ISAAC 2008) },
year = { 2008 },
month = { December },
editor = { S.-H. Hong and H. Nagamochi and T. Fukunaga },
publisher = { Springer-Verlag Berlin Heidelberg },
series = { Lecture Notes in Computer Science (LNCS 5369) },
pages = { 532--543 },
}
@InProceedings{ss-08-ipla,
author = { Hee-Kap Ahn and Peter Brass and Christian Knauer and Hyeon-Suk Na and Chan-Su Shin },
title = { Covering a Simple Polygon by Monotone Directions },
booktitle = { Proceedings of the 19th International Symposium on Algorithms and Computation (ISAAC 2008) },
year = { 2008 },
month = { December },
editor = { S.-H. Hong and H. Nagamochi and T. Fukunaga },
publisher = { Springer-Verlag Berlin Heidelberg },
series = { Lecture Notes in Computer Science (LNCS 5369) },
pages = { 668--679 },
}
@TechReport{,
author = { Ludmila Scharf and Marc Scherfenberg },
title = { Inducing n-gon of a line arrangement },
year = { 2008 },
number = { B-08-14 },
institution = { Institut f\"ur Informatik, Freie Universit\"at Berlin },
note = { (updated Feb. 2009) },
}
@PhdThesis{phddennerbroser,
author = { Britta Denner-Broser },
title = { Tracing-Problems in Dynamic Geometry },
year = { 2008 },
school = { FU-Berlin, Fachbereich Mathematik und Informatik },
note = { DissOnline },
}
@InProceedings{dpa-0807,
author = { Darko Dimitrov and Klaus Kriegel },
title = { Detection of Perfect and Approximate Reflective Symmetry in Arbitrary Dimension },
booktitle = { Proceedings of International Conference on Computer Vision Theory and Applications - VISAPP 2007 },
year = { 2007 },
pages = { 128--136 },
address = { Barcelona, Spain },
}
@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{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] },
}
@InProceedings{bps-ic-07,
author = { Kevin Buchin and Igor Pak and André Schulz },
title = { Inflating the Cube by Shrinking },
booktitle = { Proc. 23rd European Workshop on Computational Geometry },
year = { 2007 },
month = { March },
pages = { 46--49 },
address = { Graz, Austria },
}
@InProceedings{bruw-tst-07,
author = { Kevin Buchin and Andreas Razen and Takeaki Uno and Uli Wagner },
title = { Transforming Spanning Trees: A Lower Bound },
booktitle = { Proc. 23rd European Workshop on Computational Geometry },
year = { 2007 },
month = { March },
pages = { 166--169 },
address = { Graz, Austria },
}
@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] },
}
@InProceedings{bs-ics-07,
author = { Kevin Buchin and André Schulz },
title = { Inflating the Cube by Shrinking (Multimedia Abstract) },
booktitle = { SCG '07: Proceedings of the twenty-third annual symposium on Computational geometry },
year = { 2007 },
publisher = { ACM },
pages = { 125--126 },
address = { Gyeongju, South Korea },
note = { [doi] },
}
@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{ass-pmre-07,
author = { Helmut Alt and Ludmila Scharf and Sven Scholz },
title = { Probabilistic Matching and Resemblance Evaluation of Shapes in Trademark Images },
booktitle = { Proceedings of the ACM International Conference on Image and Video Retrieval (CIVR) },
year = { 2007 },
month = { July },
pages = { 533--540 },
address = { Amsterdam, The Netherlands },
}
@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 },
}
@InProceedings{crplb-07,
author = { Oliver Klein and Tobias Lenz },
title = { Carpenter's Rule Packings - A Lower Bound },
booktitle = { 23rd European Workshop on Computational Geometry },
year = { 2007 },
month = { March },
pages = { 34 - 37 },
address = { Graz, Austria },
}
@InProceedings{mdtNPh-07,
author = { Panos Giannopoulos and Christian Knauer and D. Marx },
title = { Minimum-Dilation Tour is NP-hard },
booktitle = { 23rd European Workshop on Computational Geometry },
year = { 2007 },
month = { March },
pages = { 18 - 25 },
address = { Graz, Austria },
}
@InProceedings{smna-07,
author = { J. Gudmundsson and Oliver Klein and Christian Knauer and M. Smid },
title = { Small Manhattan Networks and Algorithmic for the Earth Mover's Distance },
booktitle = { 23rd European Workshop on Computational Geometry },
year = { 2007 },
month = { March },
pages = { 174 - 177 },
address = { Graz, Austria },
}
@InProceedings{bkkss-ncpg-07,
author = { Kevin Buchin and Christian Knauer and Klaus Kriegel and André Schulz and Raimund Seidel },
title = { On the Number of Cycles in Planar Graphs },
booktitle = { Proc. 13th International Computing and Combinatorics Conference (COCOON) },
year = { 2007 },
pages = { 97--107 },
}
@InProceedings{aap-07,
author = { Darko Dimitrov and Christian Knauer and Klaus Kriegel and Fabian Stehn },
title = { Approximation algorithms for a point-to-surface registration problem in medical navigation },
booktitle = { Proc. Frontiers in Algorithmics Workshop },
year = { 2007 },
volume = { 4613 },
publisher = { Springer },
series = { Lecture Notes in Computer Science },
pages = { 26--37 },
address = { Lanzhou, China },
}
@InBook{bb-tc-07,
author = { Kevin Buchin and Maike Buchin },
title = { Topology Control },
booktitle = { Algorithms for Sensor and Ad Hoc Networks },
year = { 2007 },
volume = { 4621 },
editor = { Dorothea Wagner and Roger Wattenhofer },
publisher = { Springer },
series = { Lecture Notes in Computer Science },
pages = { 81--98 },
note = { Springer LNCS },
}
@InBook{s-dg-07,
author = { Ludmila Scharf },
title = { Data Gathering in Sensor Networks },
booktitle = { Algorithms for Sensor and Ad Hoc Networks },
year = { 2007 },
volume = { 4621 },
editor = { Dorothea Wagner and Roger Wattenhofer },
publisher = { Springer },
series = { Lecture Notes in Computer Science },
pages = { 237--263 },
note = { Springer LNCS },
}
@TechReport{gcfm-07,
author = { Darko Dimitrov and Tom\'a\v{s} Dvo\v{r}\'ak and Petr Gregor and and Riste \v{S}krekovski },
title = { Gray Codes Faulting Matchings },
year = { 2007 },
month = { July },
number = { B 07-13 },
pages = { pp. 22 },
institution = { Institut f{\"u}r Informatik },
address = { Freie Universit{\"a}t Berlin },
}
@InProceedings{bbks-07-rcp,
author = { Kevin Buchin and Maike Buchin and Erik D. Demaine and Martin L. Demaine and Dania El-Khechen and Sándor Fekete and Christian Knauer and André Schulz and Perouz Taslakian },
title = { On Rolling Cube Puzzles },
booktitle = { Proceedings of the 19th Canadian Conference on Computational Geometry },
year = { 2007 },
pages = { 141--144 },
}
@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 },
}
@Article{ocpiv-07,
author = { Gerald Friedland and Kristian Jantz and Tobias Lenz and Raul Rojas and Fabian Wiesel },
title = { OBJECT CUT AND PASTE IN IMAGES AND VIDEOS },
journal = { International Journal of Semantic Computing },
booktitle = { International Journal of Semantic Computing },
year = { 2007 },
volume = { 1 },
number = { 2 },
pages = { 1--27 },
}
@InProceedings{s-eemks-07,
author = { Markus Chimani and Petra Mutzel and Jens Schmidt },
title = { Efficient Extraction of Multiple {K}uratowski Subdivisions },
booktitle = { 15th International Symposium on Graph Drawing },
year = { 2007 },
publisher = { Springer },
series = { LNCS 4875 },
pages = { 159--170 },
address = { Sydney },
}
@TechReport{TR07-1-002,
author = { Markus Chimani and Petra Mutzel and Jens Schmidt },
title = { Efficient Extraction of Multiple {K}uratowski Subdivisions },
year = { 2007 },
month = { June },
number = { TR07-1-002 },
pages = { pp 17 },
institution = { Chair for Algorithm Engineering, Dep. of Comp. Science, University of Dortmund },
}
@MastersThesis{eeks-07,
author = { Jens Schmidt },
title = { Effiziente Extraktion von {K}uratowski-Teilgraphen },
year = { 2007 },
month = { March },
school = { Department of Computer Science, University of Dortmund, ISSN 1864-4503 },
note = { [pdf] },
}
@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 },
}
@Article{ab-ccsms-07,
author = { Helmut Alt and Maike Buchin },
title = { Can we Compute the Similarity Between Surfaces? },
year = { 2007 },
pages = { pp. 21 },
note = { http://www.citebase.org/abstract?id=oai:arXiv.org:cs/0703011 },
}
@InProceedings{CRPITV65P7-14,
author = { Hee-Kap Ahn and Helmut Alt and Tetsuo Asano and Sang Won Bae and Peter Bra{\ss} and Otfried Cheong and Christian Knauer and Hyeon-Suk Na and Chan-Su Shin and Alexander Wolff },
title = { Constructing Optimal Highways },
booktitle = { Thirteenth Computing: The Australasian Theory Symposium (CATS2007) },
year = { 2007 },
volume = { 65 },
editor = { Joachim Gudmundsson, Barry Jay },
publisher = { ACS },
series = { CRPIT },
pages = { 7-14 },
address = { Ballarat, Australia },
}
@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{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] },
}
@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{hkt-vgrpwh-07,
author = { Frank Hoffmann and Klaus Kriegel and Csaba Toth },
title = { Vertex Guards in Rectilinear Polygons with Holes },
booktitle = { The Kyoto International Conference on Computational Geometry and Graph Theory (Abstracts) },
year = { 2007 },
pages = { Session 04A, 2 pages },
address = { Kyoto, Japan },
}
@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-243304-01,
author = { Astrid Sturm },
title = { Library of benchmark instances for surface approximation },
year = { 2007 },
month = { May },
number = { ACS-TR-243304-01 },
institution = { Freie Universit{\"a}t Berlin },
}
@TechReport{ACS-TR-243401-01,
author = { Felix Jachan and Astrid Sturm },
title = { CGAL package for piecewise approximation of curves by pieces of higher order },
year = { 2007 },
month = { May },
number = { ACS-TR-243401-01 },
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 },
}
@InProceedings{ass-pmspc-06,
author = { Helmut Alt and Ludmila Scharf and Sven Scholz },
title = { Probabilistic matching of sets of Polygonal curves },
booktitle = { Proceedings of the 22nd European Workshop on Computational Geometry (EWCG) },
year = { 2006 },
month = { March },
pages = { 107--110 },
address = { Delphi, Greece },
}
@InProceedings{,
author = { Helmut Alt and E. M. Arkin and H. Br{\"o}nnimann and Jeff Erickson and S. P. Fekete and Christian Knauer and L. Lenchner and J. S. B. Mitchell and Kim Whittlesey },
title = { Minimum-Cost Coverage of Point Sets by Disks },
booktitle = { Proc. 22nd Annual ACM Symposium on Computational Geometry },
year = { 2006 },
pages = { 449-458 },
address = { Sedona (Arizona), USA },
}
@InProceedings{,
author = { Christian Knauer and M. van Kreveld and Esther Moet },
title = { Visibility maps of segments and triangles in 3d },
year = { 2006 },
series = { Proceedings of the 6th Annual International Workshop on Computational Geometry and Applications (CGA) (in conjunction with the 6th International Conference on Computer Science and its Applications (ICCSA)) },
pages = { 20-29 },
address = { Glasgow, United Kingdom. },
}
@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 },
}
@TechReport{,
author = { G. Friedland and K. Jantz and Tobias Lenz and R. Rojas },
title = { Extending the SIOX Algorithm: Alternative Clustering Methods, Sub-pixel Accurate Object Extraction from Still Images, and
Generic Video Segmentation },
year = { 2006 },
number = { B 06-06 },
institution = { Freie Universit{\"a}t Berlin },
}
@InProceedings{,
author = { Tobias Lenz },
title = { How to Sample and Reconstruct Curves With Unusual Features },
booktitle = { Proceedings of the 22nd European Workshop on Computational Geometry (EWCG) },
year = { 2006 },
month = { March },
address = { Delphi, Greece },
}
@InProceedings{bbw-cfdsp-06,
author = { Kevin Buchin and Maike Buchin and Carola Wenk },
title = { Computing the {F}r\'echet Distance between Simple Polygons in Polynomial Time },
booktitle = { Proc. 22nd Annual ACM Symposium on Computational Geometry },
year = { 2006 },
publisher = { ACM Press },
pages = { 80--87 },
}
@InProceedings{bbw-cfdsp-06b,
author = { Kevin Buchin and Maike Buchin and Carola Wenk },
title = { Computing the {F}r\'echet Distance between Simple Polygons },
booktitle = { Proc. 22nd European Workshop on Computational Geometry },
year = { 2006 },
pages = { 103--106 },
}
@InProceedings{,
author = { André Schulz },
title = { The Existence of a Pseudo-triangulation in a given Geometric Graph },
booktitle = { Proc. 22nd European Workshop on Computational Geometry },
year = { 2006 },
month = { Mach },
pages = { 17--20 },
}
@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 },
}
@InProceedings{,
author = { Darko Dimitrov and Christian Knauer and Klaus Kriegel },
title = { Registration of 3D - Patterns and Shapes with Characteristic Points },
booktitle = { Proceedings of International Conference on Computer Vision Theory and Applications - VISAPP 2006 },
year = { 2006 },
pages = { 393--400 },
address = { Setùbal, Portugal },
}
@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 },
}
@InProceedings{,
author = { Gerald Friedland and Kristian Jantz and Tobias Lenz and and Raul Rojas and Fabian Wiesel },
title = { A Practical Approach to Boundary Accurate Multi-Object
Extraction from Still Images and Videos },
booktitle = { 8th IEEE International Symposium on Multimedia },
year = { 2006 },
month = { December },
pages = { 307 - 314 },
address = { San Diego, California },
}
@InProceedings{,
author = { Tobias Lenz },
title = { Deterministic Splitter Finding in a Stream with Constant
Storage and Guarantees },
booktitle = { 17th International Symposium on Algorithms and
Computation },
year = { 2006 },
month = { December },
pages = { 26 - 35 },
address = { Kolkata, India },
}
@InProceedings{,
author = { K.-Y. Chwa and B.-C. Jo and Christian Knauer and Esther Moet and R. van Oostrum and C.-S. Shin },
title = { Guarding art galleries by guarding witnesses },
booktitle = { International Journal of Computational Geometry and Applications },
year = { 2006 },
volume = { 16 (2-3) },
series = { Special Issue: Selected Papers from the 15th Annual International Symposium on Algorithms and Computation (ISAAC) },
pages = { 205 - 226 },
address = { HKUST, Hong Kong, China },
}
@InProceedings{,
author = { B. Aronov and S. Har-Peled and Christian Knauer and Y. Wang and Carola Wenk },
title = { Frechet distance for curves, revisited },
year = { 2006 },
series = { Proceedings of the 14th Annual European Symposium on Algorithms (ESA) },
pages = { 53-63 },
address = { Zurich, Switzerland },
}
@InProceedings{,
author = { Sergio Cabello and Panos Giannopoulos and Christian Knauer },
title = { On the parameterized complexity of d-dimensional point set pattern matching },
year = { 2006 },
series = { Proceedings of the 2nd International Workshop on Parametrized and Exact Computation (IWPEC) },
pages = { 175-183 },
address = { Zurich, Switzerland },
}
@InProceedings{,
author = { Christian Knauer and A. Spillner },
title = { A fixed-parameter algorithm for the minimum weight triangulation problem baded on small graph separators },
year = { 2006 },
series = { Proceedings of The 32nd International Workshop on Graph-Theoretic Concepts in Computer Science (WG) },
pages = { 49-57 },
address = { Bergen, Norway },
}
@InProceedings{,
author = { and M. Benkert and J. Gudmundsson and Christian Knauer and Esther Moet and R. van Oostrum and Alexander Wolff },
title = { A polynomial-time approximation algorithm for a geometrc dispersion problem },
year = { 2006 },
series = { Proceedings of the 12th Annual International Computing and Combinatorics Conference (COCOON) },
pages = { 166-175 },
address = { Taipe, Taiwan },
}
@InProceedings{,
author = { Christian Knauer and A. Spillner },
title = { Approximation algorithms for the minimum convex partition problem },
year = { 2006 },
series = { Proceedings of the 10th Scandinavian Workshop in Algorithm Theory (SWAT) },
pages = { 232-241 },
address = { Riga, Latvia },
}
@InProceedings{,
author = { M. Benkert and J. Gudmundsson and Christian Knauer and Esther Moet and R. van Oostrum and Alexander Wolff },
title = { A slow approximation algorithm for a geometric dispersion problem },
year = { 2006 },
series = { Proceedings of the 22nd European Workshop on Computational Geometry (EWCG) },
pages = { 141-144 },
address = { Delphi, Greece },
}
@TechReport{,
author = { P. Blanc and J.-D. Boissonnat and F. Falzon and Christian Knauer and Trung Nguyen and E. Thomas },
title = { A disk-covering problem with application in optical interferometry },
year = { 2006 },
number = { cs/0612026 },
institution = { arXiv.org Computer Science Preprint },
}
@TechReport{,
author = { Christian Knauer and A. Spillner },
title = { Fixed-parameter algorithmsfor findingcrossing-free spanning trees in geometric graphs },
year = { 2006 },
number = { 06-07 },
institution = { Friedrich-Schiller-Universit{\"a}t Jena },
}
@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 = { 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{,
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 = { Britta Denner-Broser },
title = { On the Decidability of Tracing Problems in Dynamic Geometry },
journal = { Lecture Notes in Computer Science, Springer Verlag },
year = { 2006 },
number = { LNCS 3763/2006 },
pages = { 111-129 },
}
@InProceedings{,
author = { B. Baranski and T. Bartz-Beielstein and R. Ehlers and T. Kajendran and B. Kosslers and J. Mehnen and T. Polazek and R. Reimholz and Jens Schmidt and K. Schmitt and D. Seis and R. Slodzinski and S. Steeg and N. Wiemann and M. Zimmermann },
title = { The impact of group reputation in multiagent environments },
booktitle = { Proc. Congress on Evolutionary Computation (CEC'06) within Fourth IEEE World Congress on Computational Intelligence (WCCI'06), Vancouver BC },
year = { 2006 },
editor = { D.~B.~Fogel and others },
publisher = { IEEE Press },
pages = { 1224--1231 },
address = { Piscataway NJ },
}
@InProceedings{,
author = { B. Baranski and T. Bartz-Beielstein and R. Ehlers and T. Kajendran and B. Kosslers and J. Mehnen and T. Polazek and R. Reimholz and Jens Schmidt and K. Schmitt and D. Seis and R. Slodzinski and S. Steeg and N. Wiemann and M. Zimmermann },
title = { Advanced strategy representations for the iterated prisoner's dilemma },
booktitle = { Proc.~21st European Conf.~Operational Research (EURO XXI) },
year = { 2006 },
}
@InProceedings{,
author = { B. Baranski and T. Bartz-Beielstein and R. Ehlers and T. Kajendran and B. Kosslers and J. Mehnen and T. Polazek and R. Reimholz and Jens Schmidt and K. Schmitt and D. Seis and R. Slodzinski and S. Steeg and N. Wiemann and M. Zimmermann },
title = { High-order punishment and the evolution of cooperation },
booktitle = { Proc.~Genetic and Evolutionary Computation Conf.~(GECCO'06) },
year = { 2006 },
editor = { H.-G.Beyer and others },
publisher = { ACM Press },
pages = { 379--380 },
address = { New York },
note = { http://doi.acm.org/10.1145/1143997.1144065 },
}
@InCollection{,
author = { J. Gudmundsson and Christian Knauer },
title = { Dilation and Detours in Geometric Networks },
booktitle = { Handbook on Approximation Algorithms and Metaheuristics },
year = { 2006 },
editor = { T.F. Gonzales },
publisher = { Chapman & Hall/CRC, Boca Raton, FL },
pages = { 52-1 -- 52-16 },
}
@Article{,
author = { Felix Breuer and Daria Schymura },
title = { Domino-Pflasterungen und Aztekensterne },
journal = { Mathematische Semesterberichte },
year = { 2006 },
volume = { 53 },
number = { 1 },
pages = { 81--99 },
note = { http://dx.doi.org/10.1007/s00591-005-0102-0 },
}
@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{,
author = { Darko Dimitrov and Christian Knauer and Klaus Kriegel },
title = { Matching surfaces with characteristic points },
booktitle = { Proceedings of the 21st European Workshop on Computational Geometry (EWCG) },
year = { 2005 },
pages = { 49--51 },
address = { Eindhoven, Netherlands },
}
@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 = { Christian Knauer and Wolfgang Mulzer },
title = { An exclusion region for minimum dilation triangulations },
booktitle = { Proceedings of the 21st European Workshop on Computational Geometry (EWCG), Eindhoven, Netherlands },
year = { 2005 },
}
@InProceedings{,
author = { Christian Knauer and Etienne Schramm and Andreas Spillner and Alexander Wolff },
title = { Spanning trees with few crossings in geometric graphs (Extended Abstract) },
booktitle = { Proceedings of the 21st European Workshop on Computational Geometry (EWCG), Eindhoven, Netherlands },
year = { 2005 },
}
@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 },
}
@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 },
}
@TechReport{,
author = { Tobias Lenz },
title = { Simple Reconstruction of Non-Simple Curves },
year = { 2005 },
month = { March },
number = { B 05-02 },
institution = { Freie Universit{\"a}t Berlin },
}
@InProceedings{,
author = { Tobias Lenz },
title = { Reconstructing Collections of Arbitrary Curves },
booktitle = { 21st Annual ACM Symposium on Computational Geometry },
year = { 2005 },
month = { June },
address = { Pisa, Italy },
}
@InProceedings{,
author = { M. Farshi and Panos Giannopoulos and J. Gudmundsson },
title = { Finding the Best Shortcut in a Geometric Network },
booktitle = { 21st Annual ACM Symposium on Computational Geometry },
year = { 2005 },
month = { June },
pages = { to appear },
address = { Pisa, Italy },
}
@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 },
}
@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 },
}
@TechReport{,
author = { Christian Knauer and Wolfgang Mulzer },
title = { Minimum Dilation Triangulations },
year = { 2005 },
month = { April },
number = { B-05-06 },
institution = { Freie Universit{\"a}t Berlin },
}
@Article{,
author = { Helmut Alt and Otfried Cheong and Antoine Vigneron },
title = { The {V}oronoi diagram of curved objects },
journal = { Discrete & Computational Geometry },
year = { 2005 },
volume = { 34 },
pages = { 439-453 },
}
@InProceedings{,
author = { A. Ebbers-Baumann and A. Gr{\"u}ne and M. Karpinski and R. Klein and Christian Knauer and A. Lingas },
title = { Embedding point sets into plane graphs of small dilation },
booktitle = { Proceedings of the 16th Annual International Symposium on Algorithms and Computation (ISAAC), Hainan, China },
year = { 2005 },
pages = { 5-16 },
}
@InProceedings{,
author = { R. Klein and Christian Knauer and G. Narasimhan and M. Smid },
title = { Exact and approximation algorithms for computing the dilation spectrum of paths, trees and cycles },
booktitle = { Proceedings of the 16th Annual International Symposium on Algorithms and Computation (ISAAC), Hainan, China },
year = { 2005 },
pages = { 849-858 },
}
@Article{,
author = { Christian Knauer and E. Schramm and A. Spillner and A. Wolff },
title = { Configurations with few crossings in topological graphs. },
journal = { Proceedings of the 16th Annual International Symposium on Algorithms and Computation (ISAAC), Hainan, China },
year = { 2005 },
pages = { 604-613 },
}
@InProceedings{as-chdco-05,
author = { Helmut Alt and Ludmila Scharf },
title = { Computing the {H}ausdorff Distance between Curved Objects },
booktitle = { Proceedings of the 2nd International Symposium on Voronoi Diagrams in Science and Engineering },
year = { 2005 },
month = { October },
pages = { 196-204 },
address = { Hanyang University, Seoul, Korea },
}
@InProceedings{b-cdtsfc-05,
author = { Kevin Buchin },
title = { Constructing {D}elaunay Triangulations along Space-Filling Curves },
booktitle = { Proceedings of the 2nd International Symposium on Voronoi Diagrams in Science and Engineering },
year = { 2005 },
month = { October },
pages = { 184 -- 195 },
address = { Hanyang University, Seoul, Korea },
}
@InProceedings{b-icsfc-05,
author = { Kevin Buchin },
title = { Incremental Construction along Space-filling Curves },
booktitle = { Proceedings of the 21st European Workshop on Computational Geometry (EWCG) },
year = { 2005 },
pages = { 17 -- 20 },
address = { Eindhoven, Netherlands },
}
@InProceedings{ab-scfds-05,
author = { Helmut Alt and Maike Buchin },
title = { Semi-Computability of the {F}r\'echet Distance between Surfaces },
booktitle = { Proceedings of the 21st European Workshop on Computational Geometry (EWCG) },
year = { 2005 },
pages = { 45 -- 48 },
address = { Eindhoven, Netherlands },
}
@InProceedings{bg-fcgsa-05,
author = { Kevin Buchin and Joachim Giesen },
title = { Flow Complex: General Structure and Algorithm },
booktitle = { Proceedings of the 17th Canadian Conference on Computational Geometry (CCCG) },
year = { 2005 },
pages = { 279 -- 282 },
address = { Windsor, Canada },
}
@InProceedings{bg-mtagcth-05,
author = { Maike Buchin and Joachim Giesen },
title = { Minimizing the Total Absolute {G}aussian Curvature in a Terrain is Hard },
booktitle = { Proceedings of the 17th Canadian Conference on Computational Geometry (CCCG) },
year = { 2005 },
pages = { 192 -- 195 },
address = { Windsor, Canada },
}
@InProceedings{bbw-fdsp-05,
author = { Kevin Buchin and Maike Buchin and Carola Wenk },
title = { {F}r\'echet Distance between Simple Polygons },
booktitle = { Proceedings 15th Annual Fall Workshop on Computational Geometry },
year = { 2005 },
pages = { 7--8 },
}
@InProceedings{,
author = { Oliver Klein and Remco C. Veltkamp },
title = { Approximation Algorithms for the Earth Mover's Distance Under Transformations Using Reference Points },
booktitle = { Proceedings of the 21st European Workshop on Computational Geometry (EWCG) },
year = { 2005 },
pages = { 53 - 56 },
address = { Eindhoven, Netherlands },
}
@InProceedings{,
author = { Oliver Klein and Remco C. Veltkamp },
title = { Approximation Algorithms for Computing the Earth Mover's Distance Under Transformations },
booktitle = { Proceedings of the 16th Annual Symposium on Algorithms and Computation (ISAAC) },
year = { 2005 },
address = { Sanya, Hainan, China },
}
@TechReport{,
author = { Oliver Klein and Remco C. Veltkamp },
title = { Approximation Algorithms for the Earth Mover's Distance Under Transformations Using Reference Points },
year = { 2005 },
number = { UU-CS-2005-003 },
institution = { Department of Information and Computing Sciences, Universiteit Utrecht },
}
@TechReport{,
author = { Christian Knauer and M. van Kreveld and Esther Moet },
title = { Visibility maps of segments and triangles in 3d },
year = { 2005 },
number = { UU-CS-2005-049 },
institution = { Institute of Information and Computing Sciences, Universiteit Utrecht },
}
@TechReport{,
author = { Christian Knauer and E. Schramm and A. Spillner and Alexander Wolff },
title = { Configurations with few crossings in topological },
year = { 2005 },
number = { 2005-24 },
institution = { Fakult{\"a}t f{\"u}r Informatik, Universit{\"a}t Karlsruhe },
}
@TechReport{,
author = { J. Gudmundsson and Christian Knauer },
title = { Dilation and Detours in Geometric Networks },
year = { 2005 },
number = { B05-16 },
institution = { Freie Universit{\"a}t Berlin, Fachbereich Mathematik und Informatik },
}
@Proceedings{,
title = { Theory of Computing Systems },
year = { 2005 },
volume = { 38 },
number = { 2 },
publisher = { Springer New York },
}
@InProceedings{,
author = { André Schulz },
title = { New results on Pseudo-triangulations with low vertex degree },
booktitle = { Proceedings of the 17th Canadian Conference on Computational Geometry (CCCG'05) },
year = { 2005 },
pages = { 130-133 },
address = { Windsor },
}
@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{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 },
}
@InProceedings{er-f2vip-01,
author = { Marc Noy and Ares Ribo Mor },
title = { Recursively Constructible Families of Graphs },
booktitle = { Special Issue on the Tutte Polynomial },
year = { 2004 },
month = { Januar - Februar },
volume = { 32 },
number = { Issues 1-2 },
publisher = { Elsevier Science },
series = { Advances in Applied Mathematics },
pages = { 350-363 },
}
@InProceedings{ghkksw-naafb-04,
author = { Robert G{\"u}nzler and Frank Hoffmann and Christian Knauer and Klaus Kriegel and Sven Sch{\"o}nherr and Udo Warschewske },
title = { Ein neues algorithmisches Verfahren zur Fluoroskopie-basierten Neuronavigation },
booktitle = { Proceedings Workshop Bildverarbeitung f{\"u}r die Medizin (BVM) 2004 },
year = { 2004 },
publisher = { Springer },
address = { Berlin, Germany },
}
@InProceedings{ghkksw-naafb-04,
author = { Robert G{\"u}nzler and Frank Hoffmann and Christian Knauer and Klaus Kriegel and Sven Sch{\"o}nherr and Udo Warschewske },
title = { Ein neuer algorithmischer Ansatz zur Fluoroskopie-basierten Neuronavigation },
booktitle = { Proceedings Workshop Bildverarbeitung f{\"u}r die Medizin (BVM) 2004 },
year = { 2004 },
publisher = { Springer },
address = { Berlin, Germany },
}
@Article{ad-sist-04,
author = { Helmut Alt and Jerome Durand-Lose, Eds. },
title = { Special Issue with selected contributions from STACS 2002 },
journal = { Theory of Computing Systems },
year = { 2004 },
volume = { 37 },
}
@Article{akw-cdmpc-04,
author = { Helmut Alt and Christian Knauer and Carola Wenk },
title = { Comparison of distance measures for planar curves },
journal = { Algorithmica },
year = { 2004 },
volume = { 38 },
number = { 1 },
pages = { 45-58 },
note = { Special Issue on Shape Algorithmics },
}
@Article{bk-tcsg3-04,
author = { Peter Bra{\ss} and Christian Knauer },
title = { Testing Congruence and Symmetry for General 3-dimensional Objects },
journal = { IJCGA },
year = { 2004 },
volume = { 27 },
number = { 1 },
pages = { 3-11 },
note = { Special Issue: Selected Papers from the 18th European Workshop on Computational Geometry (EWCG), Warszawa - Miedzeszyn, Poland },
}
@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 },
}
@InProceedings{dcgkvv-maotu-04,
author = { Mark de Berg and Sergio Cabello and Panos Giannopoulos and Christian Knauer and René van Oostrum and Remco Veltkamp },
title = { Maximizing the Area of Overlap of two Unions of Disks under Rigid Motion },
booktitle = { Proceedings of the 20th European Workshop on Computational Geometry (EWCG), Seville, Spain },
year = { 2004 },
}
@InProceedings{k-sssps-04,
author = { Christian Knauer },
title = { Similarity Search in Semialgebraic Pattern Spaces },
booktitle = { Proceedings of the 20th European Workshop on Computational Geometry (EWCG), Seville, Spain },
year = { 2004 },
pages = { 115--118 },
}
@InProceedings{as-chdco-04,
author = { Helmut Alt and Ludmila Scharf },
title = { Computing the {H}ausdorff distance between curved objects },
booktitle = { Proceedings of the 20th European Workshop on Computational Geometry (EWCG), Seville, Spain },
year = { 2004 },
pages = { 233 - 236 },
}
@InProceedings{cjkmos-gaggw-04,
author = { Kyung-Yong Chwa and Byung-Cheol Jo and Christian Knauer and Esther Moet and René van Oostrum and Chan-Su Shin },
title = { Guarding Art Galleries by Guarding Witnesses },
booktitle = { Proceedings of the 20th European Workshop on Computational Geometry (EWCG), Seville, Spain },
year = { 2004 },
pages = { 352 -363 },
}
@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 },
}
@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{,
author = { Mark de Berg and Sergio Cabello and Panos Giannopoulos and Christian Knauer and Rene van Oostrum and Remco Veltkamp },
title = { Maximizing the Area of Overlap of two Unions of Disks under Rigid Motion },
booktitle = { Proceedings of the 9th Scandinavian Workshop on Algorithm Theory (SWAT), Humlebaek, Denmark },
year = { 2004 },
pages = { 138 - 149 },
}
@InProceedings{,
author = { Kyung-Yong Chwa and Byung-Cheol Jo and Christian Knauer and Esther Moet and Rene van Oostrum and Chan-Su Shin },
title = { Guarding Art Galleries by Guarding Witnesses },
booktitle = { Proceedings of the The 15th Annual International Symposium on Algorithms and Computation (ISAAC), HKUST, Hong Kong },
year = { 2004 },
}
@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 },
}
@Article{,
author = { Christian Knauer and Hans-Bernd Lindemann and Peter Pfeiffer },
title = { Morphometric Relations between Tooth and Face Shapes },
journal = { Journal of Oral Rehabilitation },
year = { 2004 },
volume = { 31 },
pages = { 972--978 },
}
@MastersThesis{,
author = { Wolfgang Mulzer },
title = { Umwegprobleme in Graphen und Polygonen },
year = { 2004 },
school = { Institut f{\"u}r Informatik, Freie Universit{\"a}t Berlin },
}
@MastersThesis{s-dipl-04,
author = { Ludmila Scharf },
title = { Computing the {H}ausdorff distance between sets of curves },
year = { 2004 },
month = { January },
school = { Institut f{\"u}r Informatik, Freie Universit{\"a}t Berlin },
}
@InProceedings{,
author = { M. Fellows and Christian Knauer and N. Nishimura and P. Ragde and F. Rosamond and U. Stege and D. Thilikos and S. Whitesides },
title = { Faster Fixed-Parameter Tractable Algorithms for Matching and Packing Problems },
booktitle = { Proceeding or the 12th Annual European Symposium on Algorithms (ESA), Bergen, Norwegen },
year = { 2004 },
}
@TechReport{b-ikdtzp-04,
author = { Kevin Buchin },
title = { {I}nkrementelle {K}onstruktion der {D}elaunay {T}riangulierung von zuf{\"a}lligen {P}unkten },
year = { 2004 },
number = { B-04-15 },
institution = { Doktoranden-Workshop der FU Berlin },
}
@InProceedings{bsdw-itdsl-04,
author = { Kevin Buchin and J{\"u}rgen D{\"o}llner and Faramarz Samavati and Mario Costa Sousa and Maike Walther },
title = { Illustrating terrains using direction of slope and lighting },
booktitle = { Proc. 4th ICA Mountain Cartography Workshop },
year = { 2004 },
pages = { 259--269 },
organization = { Institut Cartogr{\`a}phic de Catalunya },
note = { Technical Report No.~8 },
}
@TechReport{,
author = { Darko Dimitrov },
title = { Matching surfaces with characteristic points },
year = { 2004 },
number = { B-04-15 },
institution = { Doktoranden-Workshop der FU Berlin },
}
@InProceedings{agg-wccsp-03,
author = { Helmut Alt and Marc Glisse and Xavier Goaoc },
title = { On the worst-case complexity of the silhouette of a polytope },
booktitle = { Proceedings of the 15th Canadian Conference on Computational Geometry },
year = { 2003 },
}
@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 },
}
@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{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 },
}
@InCollection{abgkw-chdgp-03,
author = { Helmut Alt and Peter Bra{\ss} and Michael Godau and Christian Knauer and Carola Wenk },
title = { Computing the {H}ausdorff distance of geometric patterns and shapes },
booktitle = { Discrete and Computational Geometry. The Goodman--Pollack Festschrift },
year = { 2003 },
volume = { 25 },
editor = { B. Aronov and S. Basu and J. Pach and M. Sharir },
publisher = { Springer },
series = { Algorithms and Combinatorics },
pages = { 65--76 },
address = { Berlin },
note = { Special Issue: The Goodman-Pollack-Festschrift (B. Aronov, S. Basu, J. Pach, M. Sharir eds.) },
}
@Article{bk-cphi-03,
author = { Peter Bra{\ss} and Christian Knauer },
title = { On counting point-hyperplane incidences },
journal = { CGTA },
year = { 2003 },
volume = { 25 },
pages = { 13-20 },
note = { Special Issue: Selected Papers from the 17th European Workshop on Computational Geometry (EWCG) (EuroCG 2001). },
}
@Proceedings{alt03:_proceed_twent_annual_sympos_theor,
title = { STACS 2003 },
booktitle = { Proceedings of the 20th Annual Symposium on Theoretical Aspects of Computer Science held at the Freie Universit{\"a}t Berlin, Berlin, February 27--March 1, 2003 },
year = { 2003 },
volume = { 2607 },
editor = { Helmut Alt and Michel Habib },
publisher = { Springer-Verlag },
series = { Lecture Notes in Computer Science },
address = { Berlin },
}
@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{,
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 },
}
@TechReport{dgkvv-aotuc-03,
author = { Mark de Berg and Panos Giannopoulos and Christian Knauer and René van Oostrum and Remco Veltkamp },
title = { The Area of Overlap of two Unions of Convex Objects under Translation },
year = { 2003 },
number = { UU-CS-2003-025 },
}
@TechReport{cjkmos-gaggw-03,
author = { Kyung-Yong Chwa and Byung-Cheol Jo and Christian Knauer and Esther Moet and René van Oostrum and Chan-Su Shin },
title = { Guarding Art Galleries by Guarding Witnesses },
year = { 2003 },
number = { UU-CS-2003-044 },
institution = { Institute of Information and Computing Sciences, Universiteit Utrecht },
}
@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 },
}
@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 },
}
@InProceedings{AS_03,
author = { André Schulz },
title = { Über die Extrempunkte des PPT Polytopes },
booktitle = { Doktoranden-Workshop der FU Berlin },
year = { 2003 },
number = { B-03-17 },
note = { Technical Report },
}
@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{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{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 = { 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 },
}
@TechReport{,
author = { Tobias Lenz },
title = { Topologie von Konturen d-dimensionaler Funktionen },
year = { 2003 },
month = { Oct },
number = { B 03-17 },
institution = { Freie Universit{\"a}t Berlin },
note = { Doktorandenworkshop des Instituts f{\"u}r Informatik der FU },
}
@MastersThesis{b-eierndg-03,
author = { Kevin Buchin },
title = { Entwurf und Implementierung echtzeitf{\"a}higer Renderingverfahren zur nicht-realistischen Darstellung digitaler Gel{\"a}ndemodelle (Design and Implementation of Real-Time Rendering Techniques for the Non-Realistic Illustration of Digital Terrain Models) },
year = { 2003 },
school = { Fachbereich Mathematik und Informatik, Universit{\"a}t M{\"u}nster },
}
@InProceedings{AS_03,
author = { Oliver Klein },
title = { Untere Schranken f{\"u}r den Vergleich geometrischer Formen mit Hilfe von Referenzpunkten },
booktitle = { Doktoranden-Workshop der FU Berlin },
year = { 2003 },
number = { B-03-17 },
note = { Technical Report },
}
@MastersThesis{w-eienrs-03,
author = { },
title = { {E}ntwurf und {I}mplementierung echtzeitf{\"a}higer nicht-photorealistischer {R}enderingverfahren f{\"u}r 3D-{S}tadtmodelle (Design and Implementation of Real-Time Non-Photorealistic Rendering Techniques for 3D City Models) },
year = { 2003 },
school = { Fachbereich Mathematik und Informatik, Universit{\"a}t M{\"u}nster },
}
@InProceedings{bw-rprst-03,
author = { Kevin Buchin and Maike Walther },
title = { Real-time per-pixel rendering with stroke textures },
booktitle = { Proceedings of the 19th spring conference on Computer graphics (SCCG '03) },
year = { 2003 },
publisher = { ACM Press, New York, NY, USA },
pages = { 125--129 },
address = { Budmerice, Slovakia },
note = { isbn: 1-58113-861-X },
}
@InBook{bw-hssp-03,
author = { Kevin Buchin and Maike Walther },
title = { Hatching, Stroke Styles \& Pointillism },
year = { 2003 },
month = { September },
volume = { ShaderX2 - Shader Tips and Tricks },
editor = { Wolfgang Engel },
publisher = { Wordware Publishing },
chapter = { Rendering Techniques },
}
@InProceedings{dw-rtercm-03,
author = { },
title = { Real-Time Expressive Rendering of City Models },
booktitle = { Proceedings of the Seventh International Conference on Information Visualization (IV '03) },
year = { 2003 },
publisher = { IEEE Computer Society },
pages = { 245 -- 251 },
}
@InBook{,
author = { Gerald Friedland and C{\"u}neyt G{\"o}ktekin and Mike Kr{\"u}ger and Denis Kuni{\ss} and Olaf Langmack and Raúl Rojas and Ludmila Scharf },
title = { Konrad Zuses Plankalk{\"u}l -- Seine Genese und eine moderne Implementierung },
booktitle = { Geschichten der Informatik: Visionen, Paradigmen, Leitmotive },
year = { 2003 },
editor = { Hans D. Hellige },
publisher = { Springer },
pages = { 215--236 },
note = { Springer },
}
@TechReport{akks-cdpc-02,
author = { Pankaj K. Agarwal and Rolf Klein and Christian Knauer and Micha Sharir },
title = { Computing the Detour of Polygonal Curves },
year = { 2002 },
number = { B 02-03 },
institution = { Freie Universit{\"a}t Berlin, Fachbereich Mathematik und Informatik },
}
@InProceedings{bk-csncp-02,
author = { Peter Bra{\ss} and Christian Knauer },
title = { Computing the symmetries of non-convex polyhedral objects in 3-space (Extended Abstract) },
booktitle = { Proceedings of the 18th European Workshop on Computational Geometry, Warszawa - Miedzeszyn, Poland },
year = { 2002 },
}
@Article{bk-tcddp-02,
author = { Peter Bra{\ss} and Christian Knauer },
title = { Testing the congruence of d-dimensional point sets },
journal = { International Journal of Computational Geometry and Applications },
year = { 2002 },
volume = { 12 },
number = { 1/2 },
pages = { 115-124 },
note = { Special Issue: Selected Papers from the 16th Annual Symposium on Computational Geometry (SoCG 2000) },
}
@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{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 },
}
@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 },
}
@PhdThesis{k-acgp-02,
author = { Christian Knauer },
title = { Algorithms for Comparing Geometric Patterns },
year = { 2002 },
school = { Freie Universit{\"a}t Berlin, Germany },
}
@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 },
}
@InProceedings{r-peitl-02,
author = { G{\"u}nter Rote },
title = { Pursuit-evasion with imprecise target location },
year = { 2002 },
month = { July },
}
@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 },
}
@Proceedings{alt02:_proceed_ninet_annual_sympos_theor,
title = { STACS 2002 },
booktitle = { Proceedings of the 19th Annual Symposium on Theoretical Aspects of Computer Science held in Antibes-Juan les Pins, March 14--16, 2002 },
year = { 2002 },
volume = { 2285 },
editor = { Helmut Alt and Afonso Ferreira },
publisher = { Springer-Verlag },
series = { Lecture Notes in Computer Science },
address = { Berlin },
}
@Article{,
author = { Christian Knauer and H.-B. Lindemann and P. Pfeiffer },
title = { Correaltion of maxillary central incisor shape with body-form. },
journal = { Journal of Dental Research },
year = { 2002 },
note = { Special Issue },
}
@TechReport{s-ecg-tr-02,
author = { Astrid Sturm },
title = { A Survey of Methods for Approximating Curves },
year = { 2002 },
number = { ECG-TR-124101-01 },
institution = { Freie Universit{\"a}t Berlin },
}
@Book{a-cdmal-01,
author = { Helmut Alt },
title = { Computational Discrete Mathematics, Advanced Lectures (Ed.) },
year = { 2001 },
volume = { 2122 },
publisher = { Springer },
series = { Lecture Notes in Computer Science },
note = { ISBN: 3-540-42775-9 },
}
@InCollection{a-nn-01,
author = { Helmut Alt },
title = { The nearest neighbor },
booktitle = { Computational Discrete Mathematics },
year = { 2001 },
volume = { 2122 },
publisher = { Springer },
series = { Lecture Notes in Computer Science },
pages = { 13--24 },
}
@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 },
}
@TechReport{abgkw-chdgp-01,
author = { Helmut Alt and Peter Bra{\ss} and Michael Godau and Christian Knauer and Carola Wenk },
title = { Computing the {H}ausdorff distance of geometric patterns and shapes },
year = { 2001 },
number = { B 01-07 },
institution = { Freie Universit{\"a}t Berlin, Fachbereich Mathematik und Informatik },
}
@InProceedings{ah-elnns-01,
author = { Helmut Alt and Laura Heinrich-Litan },
title = { Exact Linfty-Nearest Neighbor Search in High Dimensions },
booktitle = { Proceedings of the 17th ACM Symposium on Computational Geometry },
year = { 2001 },
month = { June },
publisher = { Association for Computing Machinery },
pages = { 157-163 },
}
@InProceedings{ah-pcprb-01,
author = { Helmut Alt and Ferran Hurtado },
title = { Packing Convex Polygons into Rectangular Boxes },
booktitle = { Japanese Conference on Discrete and Computational Geometry 2000 },
year = { 2001 },
volume = { 2098 },
editor = { J. Akiyama and M. Kano and M. Urabe },
publisher = { Springer-Verlag },
series = { Lecture Notes in Computer Science },
pages = { 67-80 },
}
@InProceedings{akw-bfdhd-01,
author = { Helmut Alt and Christian Knauer and Carola Wenk },
title = { Bounding the {F}r\'echet distance by the {H}ausdorff distance },
booktitle = { Proceedings of the Seventeenth European Workshop on Computational Geometry, Berlin, Germany },
year = { 2001 },
pages = { 166-169 },
}
@TechReport{akw-cdmgs-01,
author = { Helmut Alt and Christian Knauer and Carola Wenk },
title = { Comparison of distance measures for geometric shapes },
year = { 2001 },
month = { December },
number = { B 01-09 },
institution = { Freie Universit{\"a}t Berlin, Fachbereich Mathematik und Informatik },
}
@InProceedings{akw-mpcrf-01,
author = { Helmut Alt and Christian Knauer and Carola Wenk },
title = { Matching polygonal curves with respect to the {F}r\'echet distance },
booktitle = { Proceedings 18th International Symposium on Theoretical Aspects of Computer Science },
year = { 2001 },
pages = { 63-74 },
}
@TechReport{bk-nnshd-01,
author = { Peter Bra{\ss} and Christian Knauer },
title = { Nearest neighbour search in {H}ausdorff distance pattern spaces },
year = { 2001 },
number = { B 01-10 },
institution = { Freie Universit{\"a}t Berlin, Fachbereich Mathematik und Informatik },
}
@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{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 },
}
@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 },
}
@InProceedings{ehksw-gaa2d-01,
author = { Alon Efrat and Frank Hoffmann and Klaus Kriegel and Christof Schultz and Carola Wenk },
title = { Geometric Algorithms for the Analysis of 2D-Electrophoresis Gels },
booktitle = { Proceedings of the Fifth Annual International Conference on Computational Molecular Biology (RECOMB) },
year = { 2001 },
pages = { 114-123 },
address = { Montreal, Canada },
}
@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 },
}
@Article{hikk-pep-01,
author = { Frank Hoffmann and Christian Icking and Rolf Klein and Klaus Kriegel },
title = { The Polygon Exploration Problem },
journal = { SIAM Journal on Computing },
year = { 2001 },
volume = { 31(2) },
pages = { 577-600 },
}
@Article{k-dg-01,
author = { Ulrich Kortenkamp },
title = { Dynamische Geometrie },
journal = { Mitteilungen der DMV },
year = { 2001 },
volume = { 3 },
pages = { 33-40 },
}
@Article{k-digsc-01,
author = { Ulrich Kortenkamp },
title = { Die interaktive Geometrie-Software Cinderella },
journal = { Tagungsband Learntec 2001 },
year = { 2001 },
month = { October },
volume = { 2 },
pages = { 525-532 },
}
@InProceedings{k-fms-01,
author = { Ulrich Kortenkamp },
title = { The Future of Mathematical Software },
booktitle = { Proceedings of MTCM 2000 },
year = { 2001 },
publisher = { Springer-Verlag },
}
@InProceedings{kr-dcdg-01,
author = { Ulrich Kortenkamp and J{\"u}rgen Richter-Gebert },
title = { Decision Complexity in Dynamic Geometry },
booktitle = { Proceedings of ADG 2000 },
year = { 2001 },
number = { 2061 },
editor = { Dongming Wang },
publisher = { Springer-Verlag },
series = { Lecture Notes in Artificial Intelligence },
pages = { 167-172 },
address = { Heidelberg },
}
@InProceedings{kr-dseg-01,
author = { Ulrich Kortenkamp and J{\"u}rgen Richter-Gebert },
title = { A Dynamic Setup For Elementary Geometry },
booktitle = { Proceedings of MTCM 2000 },
year = { 2001 },
publisher = { Springer-Verlag },
}
@InProceedings{kr-gdg-01,
author = { Ulrich Kortenkamp and J{\"u}rgen Richter-Gebert },
title = { Grundlagen Dynamischer Geometrie },
booktitle = { Oberwolfach-Tagungsband },
year = { 2001 },
publisher = { Franzbecker },
}
@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 },
}
@Book{rk-csidg-01,
author = { Ulrich Kortenkamp and J{\"u}rgen Richter-Gebert },
title = { Cinderella - Software interattivo di geometria },
year = { 2001 },
publisher = { Springer-Verlag },
address = { Mailand },
note = { Italian translation. },
}
@InProceedings{rk-cidg-01,
author = { Ulrich Kortenkamp and J{\"u}rgen Richter-Gebert },
title = { Complexity issues in Dynamic Geometry },
booktitle = { Proceedings of the Smale Fest 2000} },
year = { 2001 },
note = { To appear, currently available as technical report TRB-2000/22, Freie Universit{\"a}t Berlin },
}
@Book{rk-cpidg-01,
author = { Ulrich Kortenkamp and J{\"u}rgen Richter-Gebert },
title = { Cinderella - Programa interactivo di Geometria },
year = { 2001 },
publisher = { CMAFUL },
address = { Lisbon },
note = { Portuguese translation. },
}
@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 },
}
@Proceedings{,
title = { Computational Discrete Mathematics: advanced lectures },
year = { 2001 },
publisher = { Springer-Verlag New York, Inc. },
series = { Lecture Notes In Computer Science },
}
@MastersThesis{diplbroser,
author = { Britta Denner-Broser },
title = { Zeitreihenanalyse und Chaos },
year = { 2001 },
school = { FU-Berlin, Fachbereich Mathematik und Informatik },
note = { [pdf] },
}
@Article{afhnw-cpsfk-00,
author = { Helmut Alt and Stefan Felsner and Ferran Hurtado and Marc Noy and Emo Welzl },
title = { A class of point-sets with few k-sets },
journal = { Comp. Geom. Theory and Appl. },
year = { 2000 },
volume = { 16 },
pages = { 95-101 },
}
@TechReport{afs-sanof-00,
author = { Helmut Alt and Stefan Felsner and Ludmila Scharf },
title = { Storage Area Network Optimization: Final Report },
year = { 2000 },
number = { B 00-18 },
institution = { Freie Universit{\"a}t Berlin },
}
@InProceedings{b-eppmn-00,
author = { Peter Bra{\ss} },
title = { Exact point pattern matching and the number of congruent triangles in a threedimensional point set },
booktitle = { ESA 2000 -- European Symposium on Algorithms },
year = { 2000 },
volume = { 1879 },
editor = { M. Paterson },
publisher = { Springer-Verlag },
series = { Lecture Notes in Computer Science },
pages = { 112-119 },
}
@InProceedings{b-gdm-00,
author = { Peter Bra{\ss} },
title = { Geometrie in der Mustererkennung },
booktitle = { Mathematik - Interdisziplin{\"a}r },
year = { 2000 },
editor = { J. Flachsmeyer and R. Fritsch and H.-C. Reichel },
publisher = { Shaker Verlag },
pages = { 67-75 },
}
@TechReport{bk-fephi-00,
author = { Peter Bra{\ss} and Christian Knauer },
title = { Fast enumeration of point-hyperplane incidences },
year = { 2000 },
number = { B 00-13 },
institution = { Freie Universit{\"a}t Berlin, Fachbereich Mathematik und Informatik },
}
@InProceedings{bk-tcddp-00,
author = { Peter Bra{\ss} and Christian Knauer },
title = { Testing the congruence of d-dimensional point sets },
booktitle = { Proc. 16th Annu. ACM Symp. on Computational Geometry },
year = { 2000 },
pages = { 310-314 },
}
@InProceedings{bk-tcddp-00b,
author = { Peter Bra{\ss} and Christian Knauer },
title = { Testing the congruence of d-dimensional point sets (Extended Abstract) },
booktitle = { Proceedings of the Sixteenth European Workshop on Computational Geometry, Eilat, Israel },
year = { 2000 },
pages = { 104-107 },
}
@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 },
}
@Article{hr-euneg-00,
author = { Ulrich Kortenkamp and J{\"u}rgen Richter-Gebert },
title = { Euklidische und Nicht-Euklidische Geometrie in Cinderella },
journal = { Journal f{\"u}r Mathematikdidaktik },
year = { 2000 },
volume = { 22 },
pages = { 303-324 },
}
@Article{k-fdg-00,
author = { Ulrich Kortenkamp },
title = { Foundations of Dynamic Geometry },
journal = { Journal f{\"u}r Mathematikdidaktik },
year = { 2000 },
volume = { 21 },
number = { 2 },
pages = { 161-162 },
}
@Article{k-isfli-00,
author = { Ulrich Kortenkamp },
title = { Internetf{\"a}hige Software f{\"u}rs Lernen im 21. Jahrhundert },
journal = { FU-Nachrichten },
year = { 2000 },
month = { June },
number = { 6 },
}
@InProceedings{k-kdg-00,
author = { Ulrich Kortenkamp },
title = { Kontinuit{\"a}t in Dynamischer Geometrie },
booktitle = { Beitr{\"a}ge zum Mathematikunterricht },
year = { 2000 },
publisher = { Franzbecker },
pages = { 358-361 },
}
@InProceedings{kr-dcdge-00,
author = { Ulrich Kortenkamp and J{\"u}rgen Richter-Gebert },
title = { Decision Complexity in Dynamic Geometry - Extended Abstract },
booktitle = { Proceedings of ADG 2000 },
year = { 2000 },
volume = { 3 },
series = { International Workshop on Automatic Deduction in Geometry },
pages = { 216-220 },
}
@Article{kr-euneg-00,
author = { Ulrich Kortenkamp and J{\"u}rgen Richter-Gebert },
title = { Euklidische und Nicht-Euklidische Geometrie in Cinderella },
journal = { Journal f{\"u}r Mathematikdidaktik },
year = { 2000 },
volume = { 22 },
pages = { 303-324 },
}
@Article{kshswrof-aadgu-00,
author = { Eckart Fleck and Frank Hoffmann and Klaus Kriegel and Helmut Oswald and Vera Regitz-Zagrosek and Christof Schultz and Ingo Seefeldt and Carola Wenk },
title = { An alternative approach to deal with geometric uncertainties in computer analysis of two-dimensional electrophoresis gels },
journal = { Electrophoresis },
year = { 2000 },
volume = { 21 },
pages = { 2637-2640 },
}
@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 },
}
@TechReport{rh-cidg-00,
author = { Ulrich Kortenkamp and J{\"u}rgen Richter-Gebert },
title = { Complexity issues in Dynamic Geometry },
year = { 2000 },
institution = { Freie Universit{\"a}t Berlin },
}
@Book{rh-digsc-00,
author = { Ulrich Kortenkamp and J{\"u}rgen Richter-Gebert },
title = { Die interaktive Geometry-Software Cinderella },
year = { 2000 },
month = { December },
publisher = { Springer-Verlag },
address = { Heidelberg },
}
@Book{rh-csidg-00,
author = { Ulrich Kortenkamp and J{\"u}rgen Richter-Gebert },
title = { Cinderella - die interaktive Geometriesoftware },
year = { 2000 },
month = { January },
publisher = { HEUREKA-Klett Softwareverlag },
address = { Stuttgart },
}
@Article{rk-cniu-00,
author = { Ulrich Kortenkamp and J{\"u}rgen Richter-Gebert },
title = { Cinderella - Nachmittagssoftware im Unterricht? },
journal = { Rundgang },
year = { 2000 },
month = { June },
number = { 2 },
}
@InProceedings{rk-dacg-00,
author = { Ulrich Kortenkamp and J{\"u}rgen Richter-Gebert },
title = { Dynamic Aspects in Computational Geometry },
booktitle = { Proceedings of the EACA 2000, Barcelona, pp 51-61. },
year = { 2000 },
editor = { Antonio Montes },
}
@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 },
}
@Article{aft-mnegb-99,
author = { Geir Agnarsson and Stefan Felsner and William T. Trotter },
title = { The Maximum Number of Edges in a Graph of Bounded Dimension, with Applications to Ring Theory },
journal = { Discrete Mathematics },
year = { 1999 },
volume = { 201 },
pages = { 5-19 },
}
@InCollection{ag-dgsmi-99,
author = { Helmut Alt and Leonidas Guibas },
title = { Discrete Geometric Shapes: Matching, Interpolation, and Approximation },
booktitle = { Handbook of Computational Geometry },
year = { 1999 },
publisher = { Elsevier Science Publishers B.V. North-Holland },
pages = { 121-153 },
address = { Amsterdam },
}
@InProceedings{ak-msrsd-99,
author = { Helmut Alt and Christian Knauer },
title = { Matching shapes with respect to the symmetric difference (Extended Abstract) },
booktitle = { Proceedings of the Fifteenth European Workshop on Computational Geometry, Antibes-Juan-les-Pins, France },
year = { 1999 },
pages = { 195-197 },
}
@Article{b-esns-99,
author = { Peter Bra{\ss} },
title = { Equilateral Simplices in Normed Spaces },
journal = { Beitr{\"a}ge zur Algebra und Geometrie },
year = { 1999 },
volume = { 40 },
pages = { 303-307 },
note = { appeared also as preprint Freie Universit{\"a}t Berlin, Fachbereich Mathematik und Informatik Serie B 97-12 },
}
@TechReport{bk-tcddp-99,
author = { Peter Bra{\ss} and Christian Knauer },
title = { Testing the congruence of d-dimensional point sets },
year = { 1999 },
number = { B 99-18 },
institution = { Freie Universit{\"a}t Berlin, Fachbereich Mathematik und Informatik },
}
@Article{fk-tea-99,
author = { Stefan Felsner and Klaus Kriegel },
title = { Triangles in Euclidean Arrangements },
journal = { Discrete and Computational Geometry },
year = { 1999 },
volume = { 22 },
pages = { 429-438 },
}
@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 },
}
@TechReport{hksw-srgal-99,
author = { Frank Hoffmann and Klaus Kriegel and Sven Sch{\"o}nherr and Carola Wenk },
title = { A Simple and Robust Geometric Algorithm for Landmark Registration in Computer Assisted Neurosurgery },
year = { 1999 },
month = { December },
number = { B 99-21 },
institution = { Freie Universit{\"a}t Berlin, Fachbereich Mathematik und Informatik, Germany },
}
@Article{hkw-appmp-99,
author = { Frank Hoffmann and Klaus Kriegel and Carola Wenk },
title = { An applied point pattern matching problem: comparing 2D patterns of protein spots },
journal = { Discrete Applied Mathematics },
year = { 1999 },
volume = { 93 },
pages = { 75-88 },
}
@Article{phkwwsoaf-naaps-99,
author = { Helmut Alt and Eckart Fleck and Frank Hoffmann and Klaus Kriegel and Helmut Oswald and Klaus-Peter Plei{\ss}ner and Anders Sahlstr{\"o}hm and Susan Wegner and Carola Wenk },
title = { New algorithmic approaches to protein spot detection and pattern matching in two-dimensional electrophoresis gel databases },
journal = { Electrophoresis },
year = { 1999 },
volume = { 20 },
pages = { 755-765 },
}
@MastersThesis{,
author = { Ares Ribo Mor },
title = { Determinaci de la forma d'un objecte volads a partir de les
seves ombres (Extraction of a Projecting Object from its Shadows) },
year = { 1999 },
}
@TechReport{aft-mnegb-98,
author = { Geir Agnarsson and Stefan Felsner and William T. Trotter },
title = { The Maximum Number of Edges in a Graph of Bounded Dimension, with Applications to Ring Theory },
year = { 1998 },
number = { B 98-10 },
institution = { Freie Universit{\"a}t Berlin },
}
@InProceedings{afhn-psfks-98,
author = { Helmut Alt and Stefan Felsner and Ferran Hurtado and Marc Noy },
title = { Point-sets with few k-sets },
booktitle = { Proc. ACM Symposium on Computational Geometry },
year = { 1998 },
pages = { 200-205 },
}
@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{agw-u3dvr-98,
author = { Helmut Alt and Michael Godau and Sue Whitesides },
title = { Universal 3-Dimensional Visibility Representations for Graphs },
journal = { Computational Geometry: Theory and Applications },
year = { 1998 },
volume = { 9 },
pages = { 111-125 },
}
@Article{b-dsmnu-98,
author = { Peter Bra{\ss} },
title = { On the diameter of sets with maximum number of unit distances },
journal = { Geombinatorics },
year = { 1998 },
volume = { 8 },
pages = { 149-153 },
note = { appeared also as preprint Freie Universit{\"a}t Berlin, Fachbereich Mathematik und Informatik Serie B 98-02 },
}
@Article{b-eowfs-98,
author = { Peter Bra{\ss} },
title = { Extremal orthoposets without forbidden substructures },
journal = { Int. J. Theoretical Physics },
year = { 1998 },
volume = { 38 },
pages = { 3-9 },
}
@InProceedings{fk-tea-98,
author = { Stefan Felsner and Klaus Kriegel },
title = { Triangles in Euclidean Arrangements },
booktitle = { Proceedings WG'98, Springer Lecture Notes in Computer Science 1517 },
year = { 1998 },
volume = { 1517 },
series = { Lecture Notes in Comput. Sci. },
pages = { 137-148 },
address = { Smolenice },
}
@InProceedings{hikk-maar-98,
author = { Frank Hoffmann and Christian Icking and Rolf Klein and Klaus Kriegel },
title = { Moving an angle around a region },
booktitle = { Proceedings SWAT'98, Springer Lecture Notes in Computer Science 1432 },
year = { 1998 },
pages = { 71-82 },
address = { Stockholm },
}
@TechReport{hikk-pep1c-98,
author = { Frank Hoffmann and Christian Icking and Rolf Klein and Klaus Kriegel },
title = { The Polygon Exploration Problem I : A Competitive Strategy },
year = { 1998 },
number = { 241 },
institution = { Fernuniversit{\"a}t Hagen, Praktische Informatik VI },
}
@TechReport{hikk-pep2a-98,
author = { Frank Hoffmann and Christian Icking and Rolf Klein and Klaus Kriegel },
title = { The Polygon Exploration Problem II : The Angle Hull },
year = { 1998 },
number = { 245 },
institution = { Fernuniversit{\"a}t Hagen, Praktische Informatik VI },
}
@InProceedings{hikk-pepns-98,
author = { Frank Hoffmann and Christian Icking and Rolf Klein and Klaus Kriegel },
title = { The Polygon Exploration Problem: A New Strategy and a New Analysis Technique },
booktitle = { Proceedings WAFR'98 },
year = { 1998 },
publisher = { A K Peters, Natick, Massachusetts },
pages = { 211-222 },
address = { Houston },
}
@InProceedings{hkw-m2dpp-98,
author = { Frank Hoffmann and Klaus Kriegel and Carola Wenk },
title = { Matching 2D patterns of protein spots },
booktitle = { Proceedings SoCG'98 },
year = { 1998 },
pages = { 231-239 },
address = { Minneapolis },
}
@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 },
}
@TechReport{afhn-psfks-97,
author = { Helmut Alt and Stefan Felsner and Ferran Hurtado and Marc Noy },
title = { Point-sets with few k-sets },
year = { 1997 },
number = { B 97-10 },
institution = { Freie Universit{\"a}t Berlin },
}
@InProceedings{afk-nscpg-97,
author = { Helmut Alt and Ulrich Fuchs and Klaus Kriegel },
title = { On the Number of Simple Cycles in Planar Graphs },
booktitle = { Springer Lecture Notes in Computer Science },
year = { 1997 },
volume = { 1335 },
pages = { 15-24 },
organization = { Proceedings, Workshop on Graph-Theoretic Concepts in Computer Science - WG '97 },
address = { Berlin },
}
@InProceedings{aww-plabc-97,
author = { Helmut Alt and Emo Welzl and Barbara Wolfers },
title = { Piecewise Linear Approximation of Bézier-Curves },
booktitle = { Proc. 13th Annu. ACM Sympos. Comput. Geom. },
year = { 1997 },
pages = { 433-435 },
}
@TechReport{b-esns-97,
author = { Peter Bra{\ss} },
title = { Equilateral Simplices in Normed Spaces },
year = { 1997 },
number = { B 97-12 },
institution = { Freie Universit{\"a}t Berlin, Fachbereich Mathematik und Informatik },
}
@TechReport{fk-tea-97,
author = { Stefan Felsner and Klaus Kriegel },
title = { Triangles in Euclidean Arrangements },
year = { 1997 },
number = { B 97-09 },
institution = { Freie Universit{\"a}t Berlin },
}
@InProceedings{hikk-cslp-97,
author = { Frank Hoffmann and Christian Icking and Rolf Klein and Klaus Kriegel },
title = { A Competitive Strategy for Learning a Polygon },
booktitle = { Proceedings SODA'97 },
year = { 1997 },
pages = { 166-174 },
address = { New Orleans },
}
@TechReport{hkw-m2dpp-97,
author = { Frank Hoffmann and Klaus Kriegel and Carola Wenk },
title = { Matching 2D patterns of protein spots },
year = { 1997 },
number = { B 97-13 },
institution = { Institut f{\"u}r Informatik, FU Berlin },
}
@MastersThesis{k-susve-97,
author = { Christian Knauer },
title = { Spezifikation und Synthese von endlichen Automaten zum Entwurf reaktiver Systeme mit Hilfe algebraischer Methoden },
year = { 1997 },
month = { May },
school = { Universit{\"a}t Erlangen-N{\"u}rnberg, Institut f{\"u}r Mathematische Maschinen und Datenverarbeitung (Informatik), Germany },
}
@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 },
}
@TechReport{ag-dgsmi-96,
author = { Helmut Alt and Leonidas Guibas },
title = { Discrete Geometric Shapes: Matching, Interpolation, and Approximation - A Survey },
year = { 1996 },
number = { 96-11 },
institution = { Freie Universit{\"a}t Berlin, Fachbereich Mathematik und Informatik },
note = { to appear in Handbook on Computational Geometry, Eds. J{\"o}rg Sack and Jorge Urrutia },
}
@Article{agkmw-mopas-96,
author = { Helmut Alt and Leonidas Guibas and Richard Karp and Kurt Mehlhorn and Avi Widgerson },
title = { A Method for Obtaining Probabilistic Algorithms with Small Tail Probabilities },
journal = { Algorithmica },
year = { 1996 },
volume = { 16 },
pages = { 543-547 },
}
@InProceedings{agw-u3dvr-96,
author = { Helmut Alt and Michael Godau and Sue Whitesides },
title = { Universal 3-Dimensional Visibility Representations for Graphs },
booktitle = { Graph Drawing (Proc. GD '95) },
year = { 1996 },
volume = { 1027 },
publisher = { Springer-Verlag },
series = { Lecture Notes Comput. Sci. },
pages = { 8-19 },
}
@Article{ghks-ggprp-96,
author = { Ervin Gy{\"o}ri and Frank Hoffmann and Klaus Kriegel and Tom Shermer },
title = { Generalized guarding and partitioning for rectilinear polygons },
journal = { Coputational Geometry: Theory and Applictions },
year = { 1996 },
volume = { 6 },
pages = { 21-44 },
}
@Article{hk-gcric-96,
author = { Frank Hoffmann and Klaus Kriegel },
title = { A graph coloring result and its consequences for polygon guarding problems },
journal = { SIAM Journal on Discrete Mathematics },
year = { 1996 },
volume = { 9(2) },
pages = { 210-224 },
address = { Hong Kong },
}
@Misc{,
author = { Christian Knauer },
title = { Eine modulare Implementierung des Berlekamp-Massey-Algorithmus },
journal = { Journal of Dental Research },
year = { 1996 },
school = { Universit{\"a}t Erlangen-N{\"u}rnberg },
howpublished = { Studienarbeit },
}
@Article{abb-amps-95,
author = { Helmut Alt and Bernd Behrends and Johannes Bl{\"o}mer },
title = { Approximate matching of polygonal shapes },
journal = { Ann. Math. Artif. Intell. },
year = { 1995 },
volume = { 13 },
pages = { 251-266 },
}
@Article{ag-cfdbt-95,
author = { Helmut Alt and Michael Godau },
title = { Computing the {F}r\'echet distance between two polygonal curves },
journal = { Internat. J. Comput. Geom. Appl. },
year = { 1995 },
volume = { 5 },
pages = { 75-91 },
}
@InProceedings{ahs-cliir-95,
author = { Helmut Alt and David Hsu and Jack Snoeyink },
title = { Computing the Largest Inscribed Isothetic Rectangle },
booktitle = { Proc. 7th Canad. Conf. Comput. Geom. },
year = { 1995 },
pages = { 67-72 },
}
@InProceedings{as-vdco-95,
author = { Helmut Alt and Otfried Cheong (geb. Schwarzkopf) },
title = { The {V}oronoi diagram of curved objects },
booktitle = { Proc. 11th Annu. ACM Sympos. Comput. Geom. },
year = { 1995 },
pages = { 89-97 },
}
@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{ghks-ggprp-94,
author = { Ervin Gy{\"o}ri and Frank Hoffmann and Klaus Kriegel and Tom Shermer },
title = { Generalized guarding and partitioning for rectilinear polygons },
booktitle = { Proceedings CCCG'94 },
year = { 1994 },
pages = { 302-307 },
address = { Saskatoon },
}
@TechReport{h-agtrp-94,
author = { Frank Hoffmann },
title = { The art gallery theorem for rectilinear polygons with holes (revised version) },
year = { 1994 },
number = { 94-22 },
}
@Article{wka-appma-94,
author = { Helmut Alt and Lars Knipping and Gerald Weber },
title = { An Application of Point Pattern Matching in Astronautics },
journal = { J. Symbolic Comput. },
year = { 1994 },
volume = { 17 },
pages = { 321-340 },
}
@InProceedings{hk-gcric-93,
author = { Frank Hoffmann and Klaus Kriegel },
title = { A graph coloring result and its consequences for polygon guarding problems },
booktitle = { Proceedings ISAAC'93 },
year = { 1993 },
pages = { 78-87 },
address = { Hong Kong },
}
@Article{,
author = { Helmut Alt and Viliam Geffert and Kurt Mehlhorn },
title = { Nondeterministic Space Complexity for the Recognition of Context-Free Languages. },
journal = { Inform. Process. Lett. },
year = { 1992 },
volume = { 42 },
pages = { 25-27 },
}
@InProceedings{ag-mrpc-92,
author = { Helmut Alt },
title = { Measuring the resemblance of polygonal curves. },
booktitle = { Proc. 8th Annu. ACM Sympos. Comput. Geom. },
year = { 1992 },
pages = { 102-109 },
}
@Article{afkmnsu-ampcb-92,
author = { Helmut Alt and Rudolf Fleischer and Michael Kaufmann and Kurt Mehlhorn and Stefan N{\"a}her and Stefan Schirra and Christian Uhrig },
title = { Approximate motion planning and the complexity of the boundary of the union of simple geometric figures },
journal = { Algorithmica },
year = { 1992 },
volume = { 8 },
pages = { 391-406 },
}
@InProceedings{ag-mrpc-92,
author = { Helmut Alt and Michael Godau },
title = { Measuring the resemblance of polygonal curves },
booktitle = { Proc. 8th Annu. ACM Sympos. Comput. Geom. },
year = { 1992 },
pages = { 102-109 },
}
@Article{agm-nscrc-92,
author = { Helmut Alt and Viliam Geffert and Kurt Mehlhorn },
title = { Nondeterministic Space Complexity for the Recognition of Context-Free Languages },
journal = { Inform. Process. Lett. },
year = { 1992 },
volume = { 42 },
pages = { 25-27 },
}
@InProceedings{abb-amps-91,
author = { Helmut Alt and Bernd Behrends and Johannes Bl{\"o}mer },
title = { Approximate matching of polygonal shapes },
booktitle = { Proc. 7th Annu. ACM Sympos. Comput. Geom. },
year = { 1991 },
pages = { 186-193 },
}
@Article{abmp-cmcmb-91,
author = { Helmut Alt and Norbert Blum and Kurt Mehlhorn and Markus Paul },
title = { Computing a Maximum Cardinality Matching of a Bipartite Graph in Time O(n1.5 sqrt(m/log n)) },
journal = { Inform. Process. Lett. },
year = { 1991 },
volume = { 37 },
pages = { 237-240 },
}
@InProceedings{ag-mamrc-91,
author = { Helmut Alt and Michael Godau },
title = { Metrics and Algorithms for Measuring the Resemblance of Curves },
booktitle = { Proc. 13th IMACS World Congress on Computation and Applied Mathematics },
year = { 1991 },
pages = { 135-136 },
}
@InProceedings{abgw-acp-90,
author = { Helmut Alt and Johannes Bl{\"o}mer and Michael Godau and Hubert Wagener },
title = { Approximation of convex polygons },
booktitle = { Proc. 17th Internat. Colloq. Automata Lang. Program. },
year = { 1990 },
volume = { 443 },
publisher = { Springer-Verlag },
series = { Lecture Notes Comput. Sci. },
pages = { 703-716 },
}
@InProceedings{afkmnsu-ampcb-90,
author = { Helmut Alt and Rudolf Fleischer and Michael Kaufmann and Kurt Mehlhorn and Stefan N{\"a}her and Stefan Schirra and Christian Uhrig },
title = { Approximate motion planning and the complexity of the boundary of the union of simple geometric figures },
booktitle = { Proc. 6th Annu. ACM Sympos. Comput. Geom. },
year = { 1990 },
pages = { 281-289 },
}
@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 },
}
@Article{ay-aampt1-90,
author = { Helmut Alt and Chee K. Yap },
title = { Algorithmic aspect of motion planning: a tutorial, part 1 },
journal = { Algorithms Rev. },
year = { 1990 },
volume = { 1 },
number = { 1 },
pages = { 43-60 },
}
@Article{ay-aampt2-90,
author = { Helmut Alt and Chee K. Yap },
title = { Algorithmic aspect of motion planning: a tutorial, part 2 },
journal = { Algorithms Rev. },
year = { 1990 },
volume = { 1 },
number = { 2 },
pages = { 61-77 },
}
@InProceedings{ay-aart-89,
author = { Helmut Alt and Chee K. Yap },
title = { Algorithmic Aspects of Robotics: a Tutorial },
booktitle = { Proceedings SOFSEM `89 },
year = { 1989 },
pages = { 7-40 },
}
@InProceedings{ay-mpce-89,
author = { Helmut Alt },
title = { Motion Planning in the {CL}-Environment },
booktitle = { Proc. 2nd Workshop Algorithms Data Struct. },
year = { 1989 },
volume = { 382 },
publisher = { Springer-Verlag },
series = { Lecture Notes Comput. Sci. },
pages = { 373-380 },
}
@Article{a-cccaf-88,
author = { Helmut Alt },
title = { Comparing the combinational complexities of arithmetic functions },
journal = { J. ACM },
year = { 1988 },
volume = { 35 },
pages = { 447-460 },
}
@Article{amww-cssgo-88,
author = { },
title = { Congruence, similarity and symmetries of geometric objects },
journal = { Discrete Comput. Geom. },
year = { 1988 },
volume = { 3 },
}
@Article{aw-vgoas-88,
author = { Helmut Alt and Emo Welzl },
title = { Visibility graphs and obstacle-avoiding shortest paths },
journal = { Zeitschrift f{\"u}r Operations Research },
year = { 1988 },
volume = { 32 },
number = { 145-164 },
}
@Article{mna-lbcus-88,
author = { Helmut Alt and Kurt Mehlhorn and Stefan N{\"a}her },
title = { A lower bound on the complexity of the union-split-find problem },
journal = { SIAM J. Comput. },
year = { 1988 },
volume = { 17 },
pages = { 1093-1102 },
}
@Article{amhp-simpc-87,
author = { Helmut Alt and Torben Hagerup and Kurt Mehlhorn and Franco Preparata },
title = { Simulation of Idealized Models of Parallel Computers on More Realistic ones },
journal = { SIAM J. Comput. },
year = { 1987 },
volume = { 16 },
pages = { 808-835 },
}
@InProceedings{amww-cssgo-87,
author = { Helmut Alt and Kurt Mehlhorn and Hubert Wagener and Emo Welzl },
title = { Congruence, similarity and symmetries of geometric objects },
booktitle = { Proc. 3rd Annu. ACM Sympos. Comput. Geom. },
year = { 1987 },
pages = { 308-315 },
}
@InProceedings{amhp-simpc-86,
author = { Helmut Alt and Torben Hagerup and Kurt Mehlhorn and Franco Preparata },
title = { Simulation of Idealized Models of Parallel Computers on More Realistic ones },
booktitle = { Proc. MFCS 1986, Springer Lecture Notes in Computer Science 233 },
year = { 1986 },
pages = { 199-208 },
}
@MastersThesis{,
author = { },
}
