Lena Schlipf

Algorithmische Geometrie

• Covering and piercing disks with two centers
  Comput. Geom., Band 46 (3), Seiten 253-262, 2013.
  Hee-Kap Ahn, Sang-Sub Kim, Christian Knauer, Lena Schlipf, Chan-Su Shin, Antoine Vigneron
  [bibtex]

• New Results on Convex Stabbers
  In EuroCG'13, Seiten 57-60, 2013.
  Lena Schlipf
  [bibtex]

• Largest Inscribed Rectangles in Convex Polygons
  J. of Discrete Algorithms, Band 13, Seiten 78–85, 2012.
  Christian Knauer, Lena Schlipf, Jens Schmidt, Hans Tiwary
  [doi]
  [bibtex]

• Covering and Piercing Disks with Two Centers
  CoRR, Band abs/1201.1198, 2012.
  Hee-Kap Ahn, Sang-Sub Kim, Christian Knauer, Lena Schlipf, Chan-Su Shin, Antoine Vigneron
  [bibtex]

• Notes on Convex Transversals
  CoRR, Band abs/1211.5107, 2012.
  Lena Schlipf
  [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]

• Largest Inscribed Rectangles in Simple Polygons
  In EuroCG'10, Seiten 201-204, 2010.
  Christian Knauer, Lena Schlipf, Jens Schmidt, Hans Tiwary
  [bibtex]

• Shortest Inspection-Path Queries in Simple Polygons
  In Proceedings of the 24th European Workshop on Computational Geometry (EuroCG), Seiten 153–156, Nancy, France, March 2008.
  Christian Knauer, Günter Rote, Lena Schlipf
  [bibtex]

Geometrische Muster- und Formenerkennung

• Computing the Discrete Fréchet Distance with Imprecise Input
  Int. J. Comput. Geometry Appl., Band 22 (1), Seiten 27-44, 2012.
  Hee-Kap Ahn, Christian Knauer, Marc Scherfenberg, Lena Schlipf, Antoine Vigneron
  [bibtex]

• Computing the Discrete Fréchet Distance with Imprecise Input
  In Proceedings of the 26th European Workshop on Computational Geometry (EuroCG), Seiten 13–16, Dortmund, Germany, 2010.
  Hee-Kap Ahn, Christian Knauer, Marc Scherfenberg, Lena Schlipf, Antoine Vigneron
  [bibtex] [pdf]

• Computing the Discrete Fréchet Distance with Imprecise Input
  In Proceedings of the 21st International Symposium on Algorithms and Computation (ISAAC 2010), Lecture Notes in Computer Science, Band 6507, Seiten 422–433, Herausgeber Cheong, Otfried and Chwa, Kyung-Yong and Park, Kunsoo, Springer-Verlag, Berlin/Heidelberg, Germany, 2010.
  Hee-Kap Ahn, Christian Knauer, Marc Scherfenberg, Lena Schlipf, Antoine Vigneron
  [bibtex] [pdf]

• Computing the Discrete Fréchet Distance with Imprecise Input
  In Proc.of the 12th Korea-Japan Joint Workhop on Algorithms and Computation (WAAC 2009), Seiten 132–137, July 2009.
  Hee-Kap Ahn, Marc Scherfenberg, Lena Schlipf, Antoine Vigneron
  [bibtex]