FU Logo
Institute of Computer Science
123123

@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 },
}


@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 = { 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 = { 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 },
}


@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 },
}


@MastersThesis{,
  author = { Rafel Jaume },
  title = { Domain Adaptation for Visual Recognition },
  year = { 2011 },
  month = { July },
  school = { Universitat Politècnica de Catalunya },
  note = { [url] [pdf] },
}


@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 },
}


@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 = { Erik D. Demaine and Sándor P. Fekete and G{\"u}nter Rote and Nils Schweer and Daria Schymura and Mariano Zelke },
  title = { Integer Point Sets Minimizing Average Pairwise L1 Distance: What is the Optimal Shape of a Town? },
  journal = { Computational Geometry, Theory and Applications },
  year = { 2011 },
  volume = { 44 },
  number = { 2 },
  pages = { 82-94 },
}


@Article{,
  author = { 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 = { 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 = { Hosam Abdo and Darko Dimitrov and Ivan Gutman },
  title = { On the Zagreb Indices Equality },
  journal = { CoRR },
  year = { 2011 },
  volume = { abs/1106.1809v1 },
}

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