Lena Schlipf

Computational Geometry

• Covering and piercing disks with two centers
  Comput. Geom., Volume 46 (3), Pages 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, Pages 57-60, 2013.
  Lena Schlipf
  [bibtex]

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

• Covering and Piercing Disks with Two Centers
  CoRR, Volume 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, Volume 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), Pages 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, Volume 6844, Pages 49-60, Editor(s) 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, Volume 7074, Pages 50-59, Editor(s) 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, Pages 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), Pages 153–156, Nancy, France, March 2008.
  Christian Knauer, Günter Rote, Lena Schlipf
  [bibtex]

Geometric Shape and Pattern Matching

• Computing the Discrete Fréchet Distance with Imprecise Input
  Int. J. Comput. Geometry Appl., Volume 22 (1), Pages 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), Pages 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, Volume 6507, Pages 422–433, Editor(s) 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), Pages 132–137, July 2009.
  Hee-Kap Ahn, Marc Scherfenberg, Lena Schlipf, Antoine Vigneron
  [bibtex]