2011
[bibtex]Algorithmische Geometrie
On Inducing Polygons and Related Problems
Computational Geometry, Theory and Applications (CGTA), 2011.
Eyal Ackerman, Rom Pinchasi, Ludmila Scharf, Marc Scherfenberg
http://dx.doi.org/10.1016/j.comgeo.2011.06.003
[bibtex]Efficient Dynamical Computation of Principal Components
In Proceedings of International Conference on Computer Graphics Theory and Applications - GRAPP, Seiten 85–93, Vilamoura, Portugal, 2011.
Darko Dimitrov, Mathias Holst, Christian Knauer, Klaus Kriegel
[bibtex]Every Simple Arrangement of n Lines Contains an Inducing Simple n-gon
The American Mathematical Monthly (AMM), Band 118 (2), Seiten 164-167, February 2011.
Eyal Ackerman, Rom Pinchasi, Ludmila Scharf, Marc Scherfenberg
http://dx.doi.org/10.4169/amer.math.monthly.118.02.164
[bibtex] [pdf]Fixed-parameter tractability and lower bounds for stabbing problems
Special Issue on the 25th European Workshop an Computational Geometry, 2011.
Panos Giannopoulos, Christian Knauer, Günter Rote, Daniel Werner
[bibtex]Hardness of discrepacy computation and epsilon-net verification in high dimension
CoRR, Band abs/1103.4503, 2011.
Panos Giannopoulos, Christian Knauer, Magnus Wahlström, Daniel Werner
[Eprint:arXiv:1103.4503]
[bibtex]On the computational complexitiy of Ham-Sandwich cuts, Helly sets, and related problems
In Proceedings of the 28th International Symposium on Theoretical Aspects of Computer Science (STACS), 2011.
Christian Knauer, Hans Tiwary, Daniel Werner
[bibtex]A Proof of the Oja-Depth Conjecture in the Plane
In Proceedings of teh 27th European Workshop on Computational Geometry (EuroCG), 2011.
Nabil H. Mustafa, Hans Tiwary, Daniel Werner
[bibtex]Covering and Piercing Disks with Two Centers
In Proceedings of the 27th European Workshop on Computational Geometry (EuroCG), Seiten 63–66, Morschach, Switzerland, 2011.
Hee-Kap Ahn, Sang-Sub Kim, Christian Knauer, Hyeon-Suk Na, Lena Schlipf, Chan-Su Shin, Antoine Vigneron
[bibtex]Computing Barrier Resilience for Line Segments is NP-hard and APX-hard
In Proc.of the 14th Korea-Japan Joint Workhop on Algorithms and Computation (WAAC 2011), 2011.
Otfried Cheong (geb. Schwarzkopf), Hyo-Sil Kim, Lena Schlipf
[bibtex]Convex Transversals
In Algorithms and Data Structures, Lecture Notes in Computer Science, Band 6844, Seiten 49-60, Herausgeber Dehne, Frank and Iacono, John and Sack, Jörg-Rüdiger, Springer Berlin / Heidelberg, 2011.
Esther Arkin, Claudia Dieckmann, Christian Knauer, Joseph Mitchell, Valentin Polishchuk, Lena Schlipf, Shang Yang
[bibtex]Covering and Piercing Disks with Two Centers
In Algorithms and Computation, Band 7074, Seiten 50-59, Herausgeber Takao Asano, Shin-ichi Nakano, Okamoto Yoshio, Osamu Watanabe, Springer Berlin/Heidelberg, 2011.
Hee-Kap Ahn, Sang-Sub Kim, Christian Knauer, Lena Schlipf, Chan-Su Shin, Antoine Vigneron
[bibtex]Approximate nearest neighbor search under translation invariant Hausdorff distance
International Journal on Computational Geometry and Applications (IJCGA), Band 21 (3), Seiten 369-381, 2011.
Christian Knauer, Marc Scherfenberg
[bibtex]Inducing polygons of line arrangements
International Journal on Computational Geometry and Applications (IJCGA), Band 21 (3), Seiten 351-368, June 2011.
Ludmila Scharf, Marc Scherfenberg
[bibtex]Domain Adaptation for Visual Recognition
Diplomarbeit, Universitat Politècnica de Catalunya, July 2011.
Rafel Jaume
[url] [pdf]
[bibtex]
Discrete Geometry
Notes on lattice points of zonotopes and lattice-face polytopes
Discrete Mathematics, Band 311 (8-9), Seiten 634–644, 2011.
Christian Bey, Martin Henk, Matthias Henze, Eva Linke
[bibtex]Blichfeldt-type inequalities and central symmetry
Advances in Geometry, Band 11 (4), Seiten 731–744, 2011.
Martin Henk, Matthias Henze, Jörg M. Wills
[bibtex]
Geometrische Optimierungsprobleme
Integer Point Sets Minimizing Average Pairwise L1 Distance: What is the Optimal Shape of a Town?
Computational Geometry, Theory and Applications, Band 44 (2), Seiten 82-94, 2011.
Erik D. Demaine, Sándor P. Fekete, Günter Rote, Nils Schweer, Daria Schymura, Mariano Zelke
[bibtex]
Geometrische Muster- und Formenerkennung
The directed Hausdorff distance between imprecise point sets
Theoretical Computer Science (TCS), Band 412 (32), Seiten 4173-4186, 2011.
Christian Knauer, Maarten Löffler, Marc Scherfenberg, Thomas Wolle
[bibtex] [pdf]Probabilistic matching of solids in arbitrary dimension
In Proceedings of the 27th European Workshop on Computational Geometry (EuroCG), Morschach, Switzerland, March 2011.
Daria Schymura
[bibtex] [pdf]
Graphentheorie und Algorithmen
Some Observations on Comparing Zagreb Indices
MATCH Communications in Mathematical and in Computer Chemistry, Band 66 (2), Seiten 627–645, 2011.
Vesna Andova, Darko Dimitrov, Boris Furtula, Ivan Gutman, Damir Vukicevic
[bibtex]On the Zagreb Index Inequality of Graphs with Prescribed Vertex Degrees
Discrete Applied Mathematics, Band 159, Seiten 852–858, 2011.
Vesna Andova, Sašo Bogoev, Darko Dimitrov, Marcin Pilipczuk, Riste Škrekovski
[bibtex]On the Zagreb Indices Equality
CoRR, Band abs/1106.1809v1, 2011.
Hosam Abdo, Darko Dimitrov, Ivan Gutman
[bibtex]