2006
[bibtex]Computational Algebra
Deterministic Splitter Finding in a Stream with Constant Storage and Guarantees
In 17th International Symposium on Algorithms and Computation, Pages 26 - 35, Kolkata, India, December 2006.
Tobias Lenz
[bibtex]
Computational Geometry
Minimum-Cost Coverage of Point Sets by Disks
In Proc. 22nd Annual ACM Symposium on Computational Geometry, Pages 449-458, Sedona (Arizona), USA, 2006.
Helmut Alt, E. M. Arkin, H. Brönnimann, Jeff Erickson, S. P. Fekete, Christian Knauer, L. Lenchner and J. S. B. Mitchell, Kim Whittlesey
[bibtex]Approximation of polygonal curves with min number of circular arcs - prototype software
Technical Report ACS-TR-122202-01, Freie Universität Berlin, May 2006.
Scot Drysdale, Günter Rote, Astrid Sturm
[bibtex]Approximation of an open polygonal curve with a minimum number of circular arcs
In Proceedings of the 22nd European Workshop on Computational Geometry (EWCG), Pages 25-28, 2006.
Scot Drysdale, Günter Rote, Astrid Sturm
[bibtex]How to Sample and Reconstruct Curves With Unusual Features
In Proceedings of the 22nd European Workshop on Computational Geometry (EWCG), Delphi, Greece, March 2006.
Tobias Lenz
[bibtex]Computing the Fr\'echet Distance between Simple Polygons in Polynomial Time
In Proc. 22nd Annual ACM Symposium on Computational Geometry, Pages 80–87, ACM Press, 2006.
Kevin Buchin, Maike Buchin, Carola Wenk
[bibtex]Computing the Fr\'echet Distance between Simple Polygons
In Proc. 22nd European Workshop on Computational Geometry, Pages 103–106, 2006.
Kevin Buchin, Maike Buchin, Carola Wenk
[bibtex]The Existence of a Pseudo-triangulation in a given Geometric Graph
In Proc. 22nd European Workshop on Computational Geometry, Pages 17–20, Mach 2006.
André Schulz
[bibtex]On the Bounding Boxes Obtained by Principal Component Analysis
In Proc. 22nd European Workshop on Computational Geometry, Pages 193–196, Delphi, Greece, 2006.
Darko Dimitrov, Christian Knauer, Klaus Kriegel, Günter Rote
[bibtex]Acyclic Orientation of Drawings
In Proc. 22nd European Workshop on Computational Geometry, Pages 207–210, Delphi, Greece, 2006.
Eyal Ackerman, Kevin Buchin, Christian Knauer, Günter Rote
Unrefereed conference publication
[bibtex]Acyclic Orientation of Drawings
In Proc. 10th Scandinavian Workshop on Algorithm Theory, Pages 268-279, 2006.
Eyal Ackerman, Kevin Buchin, Christian Knauer, Günter Rote
[bibtex]Upper and Lower Bounds on the Quality of the PCA Bounding Boxes
Technical Report B 06-10, Freie Universität Berlin, September 2006.
Darko Dimitrov, Christian Knauer, Klaus Kriegel, Günter Rote
[bibtex] [pdf]Guarding art galleries by guarding witnesses
In International Journal of Computational Geometry and Applications, Special Issue: Selected Papers from the 15th Annual International Symposium on Algorithms and Computation (ISAAC), Volume 16 (2-3), Pages 205 - 226, HKUST, Hong Kong, China, 2006.
K.-Y. Chwa, B.-C. Jo, Christian Knauer, Esther Moet, R. van Oostrum, C.-S. Shin
[bibtex]Frechet distance for curves, revisited
Proceedings of the 14th Annual European Symposium on Algorithms (ESA), Pages 53-63, Zurich, Switzerland, 2006.
B. Aronov, S. Har-Peled, Christian Knauer, Y. Wang, Carola Wenk
[bibtex]On the parameterized complexity of d-dimensional point set pattern matching
Proceedings of the 2nd International Workshop on Parametrized and Exact Computation (IWPEC), Pages 175-183, Zurich, Switzerland, 2006.
Sergio Cabello, Panos Giannopoulos, Christian Knauer
[bibtex]A polynomial-time approximation algorithm for a geometrc dispersion problem
Proceedings of the 12th Annual International Computing and Combinatorics Conference (COCOON), Pages 166-175, Taipe, Taiwan, 2006.
, M. Benkert, J. Gudmundsson, Christian Knauer, Esther Moet, R. van Oostrum, Alexander Wolff
[bibtex]Approximation algorithms for the minimum convex partition problem
Proceedings of the 10th Scandinavian Workshop in Algorithm Theory (SWAT), Pages 232-241, Riga, Latvia, 2006.
Christian Knauer, A. Spillner
[bibtex]Visibility maps of segments and triangles in 3d
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, Glasgow, United Kingdom., 2006.
Christian Knauer, M. van Kreveld, Esther Moet
[bibtex]A slow approximation algorithm for a geometric dispersion problem
Proceedings of the 22nd European Workshop on Computational Geometry (EWCG), Pages 141-144, Delphi, Greece, 2006.
M. Benkert, J. Gudmundsson, Christian Knauer, Esther Moet, R. van Oostrum, Alexander Wolff
[bibtex]A disk-covering problem with application in optical interferometry
Technical Report cs/0612026, arXiv.org Computer Science Preprint, 2006.
P. Blanc, J.-D. Boissonnat, F. Falzon, Christian Knauer, Trung Nguyen, E. Thomas
[bibtex]Fixed-parameter algorithmsfor findingcrossing-free spanning trees in geometric graphs
Technical Report 06-07, Friedrich-Schiller-Universität Jena, 2006.
Christian Knauer, A. Spillner
[bibtex]Computational topology: an introduction.
In Effective Computational Geometry for Curves and Surfaces, Chapter 7, Mathematics and Visualization, Pages 277-312, Editor(s) Jean-Daniel Boissonnat and Monique Teillaud, Springer-Verlag, 2006.
Günter Rote, Gert Vegter
[bibtex]Meshing of surfaces
In Effective Computational Geometry for Curves and Surfaces, Chapter Chapter 5. Mathematics and Visualization, Pages 181-229, Editor(s) Jean-Daniel Boissonnat and Monique Teillaud, Springer Verlag, 2006.
J.-D. Boissonnat, D. Cohen-Steiner, B. Mourrain, Günter Rote, and G. Vegter
[bibtex]Minimum weight triangulation is NP-hard
Proceedings of the 22nd Annual Symposium on Computational Geometry, Pages 1-10, Sedona, USA, June 2006.
Wolfgang Mulzer, Günter Rote
Association for Computing Machinery
[bibtex]Locked and unlocked chains of planar shapes
Proceedings of the 22nd Annual Symposium on Computational Geometry, Pages 61-70, Sedona, USA, June 2006.
R. Connelly, E. D. Demaine, M. L. Demaine, S. P. Fekete, S. Langerman, J. S. B. Mitchell, Ares Ribo Mor, Günter Rote
Association for Computing Machinery
[bibtex]On the geometric dilation of closed curves, graphs, and point sets
Computational Geometry, Theory and Applications, Pages 16-38, 2006.
A. Dumitrescu, A. Ebbers-Baumann, A. Grüne, R. Klein, Günter Rote
[bibtex]Dilation and Detours in Geometric Networks
In Handbook on Approximation Algorithms and Metaheuristics, Pages 52-1 – 52-16, Editor(s) T.F. Gonzales, Chapman & Hall/CRC, Boca Raton, FL, 2006.
J. Gudmundsson, Christian Knauer
[bibtex]
Discrete Geometry
Domino-Pflasterungen und Aztekensterne
Mathematische Semesterberichte, Volume 53 (1), Pages 81–99, 2006.
Felix Breuer, Daria Schymura
http://dx.doi.org/10.1007/s00591-005-0102-0
[bibtex]
Discrete Mathematics
Counting polyominoes on twisted cylinders
INTEGERS: The Electronic Journal of Combinatorial Number Theory 6, Pages 37, 2006.
G. Barequet, M. Moffie, Ares Ribo Mor, Günter Rote
[bibtex]Threshold arrangements and the knapsack problem
Applied Mathematics Letters, Volume 19 (Issue 1), Pages 108-112, 2006.
Günter Rote, André Schulz
[bibtex]
Dynamic Geometry
On the Decidability of Tracing Problems in Dynamic Geometry
Lecture Notes in Computer Science, Springer Verlag, Pages 111-129, 2006.
Britta Denner-Broser
[bibtex]
Geometric Shape and Pattern Matching
Probabilistic matching of sets of Polygonal curves
In Proceedings of the 22nd European Workshop on Computational Geometry (EWCG), Pages 107–110, Delphi, Greece, March 2006.
Helmut Alt, Ludmila Scharf, Sven Scholz
[bibtex] [pdf]Registration of 3D - Patterns and Shapes with Characteristic Points
In Proceedings of International Conference on Computer Vision Theory and Applications - VISAPP 2006, Pages 393–400, Setùbal, Portugal, 2006.
Darko Dimitrov, Christian Knauer, Klaus Kriegel
[bibtex]
Graph Theory and Algorithms
A fixed-parameter algorithm for the minimum weight triangulation problem baded on small graph separators
Proceedings of The 32nd International Workshop on Graph-Theoretic Concepts in Computer Science (WG), Pages 49-57, Bergen, Norway, 2006.
Christian Knauer, A. Spillner
[bibtex]Strictly convex drawings of planar graphs
Documenta Mathematica, Pages 369-391, 2006.
Imre Bárány, Günter Rote
[bibtex]
Image Processing
Extending the SIOX Algorithm: Alternative Clustering Methods, Sub-pixel Accurate Object Extraction from Still Images, and Generic Video Segmentation
Technical Report B 06-06, Freie Universität Berlin, 2006.
G. Friedland, K. Jantz, Tobias Lenz, R. Rojas
[bibtex] [html]A Practical Approach to Boundary Accurate Multi-Object Extraction from Still Images and Videos
In 8th IEEE International Symposium on Multimedia, Pages 307 - 314, San Diego, California, December 2006.
Gerald Friedland, Kristian Jantz, Tobias Lenz, and Raul Rojas, Fabian Wiesel
[bibtex]
Iterated prisoners dilemma
The impact of group reputation in multiagent environments
In Proc. Congress on Evolutionary Computation (CEC'06) within Fourth IEEE World Congress on Computational Intelligence (WCCI'06), Vancouver BC, Pages 1224–1231, Editor(s) D. B. Fogel and others, IEEE Press, Piscataway NJ, 2006.
B. Baranski, T. Bartz-Beielstein, R. Ehlers, T. Kajendran, B. Kosslers, J. Mehnen, T. Polazek, R. Reimholz, Jens Schmidt, K. Schmitt, D. Seis, R. Slodzinski, S. Steeg, N. Wiemann, M. Zimmermann
[bibtex]Advanced strategy representations for the iterated prisoner's dilemma
In Proc. 21st European Conf. Operational Research (EURO XXI), 2006.
B. Baranski, T. Bartz-Beielstein, R. Ehlers, T. Kajendran, B. Kosslers, J. Mehnen, T. Polazek, R. Reimholz, Jens Schmidt, K. Schmitt, D. Seis, R. Slodzinski, S. Steeg, N. Wiemann, M. Zimmermann
[bibtex]High-order punishment and the evolution of cooperation
In Proc. Genetic and Evolutionary Computation Conf. (GECCO'06), Pages 379–380, Editor(s) H.-G.Beyer and others, ACM Press, New York, 2006.
B. Baranski, T. Bartz-Beielstein, R. Ehlers, T. Kajendran, B. Kosslers, J. Mehnen, T. Polazek, R. Reimholz, Jens Schmidt, K. Schmitt, D. Seis, R. Slodzinski, S. Steeg, N. Wiemann, M. Zimmermann
http://doi.acm.org/10.1145/1143997.1144065
[bibtex]