Crossref Citations
This article has been cited by the following publications. This list is generated based on data provided by Crossref.
Lee, Jae-Ha
and
Chwa, Kyung-Yong
1999.
Tight analysis of a self-approaching strategy for the online kernel-search problem.
Information Processing Letters,
Vol. 69,
Issue. 1,
p.
39.
Ebbers-Baumann, Annette
Klein, Rolf
Langetepe, Elmar
and
Lingas, Andrzej
2001.
Algorithms — ESA 2001.
Vol. 2161,
Issue. ,
p.
321.
Aichholzer, Oswin
Aurenhammer, Franz
Icking, Christian
Klein, Rolf
Langetepe, Elmar
and
Rote, Günter
2001.
Generalized self-approaching curves.
Discrete Applied Mathematics,
Vol. 109,
Issue. 1-2,
p.
3.
Ebbers-Baumann, Annette
Grüne, Ansgar
and
Klein, Rolf
2003.
Algorithms and Computation.
Vol. 2906,
Issue. ,
p.
250.
Ebbers-Baumann, Annette
Klein, Rolf
Langetepe, Elmar
and
Lingas, Andrzej
2004.
A fast algorithm for approximating the detour of a polygonal chain.
Computational Geometry,
Vol. 27,
Issue. 2,
p.
123.
Ebbers-Baumann, Annette
Grüne, Ansgar
and
Klein, Rolf
2007.
Geometric dilation of closed planar curves: New lower bounds.
Computational Geometry,
Vol. 37,
Issue. 3,
p.
188.
Agarwal, Pankaj K.
Klein, Rolf
Knauer, Christian
Langerman, Stefan
Morin, Pat
Sharir, Micha
and
Soss, Michael
2008.
Computing the Detour and Spanning Ratio of Paths, Trees, and Cycles in 2D and 3D.
Discrete & Computational Geometry,
Vol. 39,
Issue. 1-3,
p.
17.
Martini, Horst
and
Wu, Senlin
2009.
Geometric dilation of closed curves in normed planes.
Computational Geometry,
Vol. 42,
Issue. 4,
p.
315.
Grüne, Ansgar
Lin, Tien-Ching
Yu, Teng-Kai
Klein, Rolf
Langetepe, Elmar
Lee, D. T.
and
Poon, Sheung-Hung
2010.
Algorithms and Computation.
Vol. 6507,
Issue. ,
p.
121.
WULFF-NILSEN, CHRISTIAN
GRÜNE, ANSGAR
KLEIN, ROLF
LANGETEPE, ELMAR
LEE, D. T.
LIN, TIEN-CHING
POON, SHEUNG-HUNG
and
YU, TENG-KAI
2012.
COMPUTING THE STRETCH FACTOR AND MAXIMUM DETOUR OF PATHS, TREES, AND CYCLES IN THE NORMED SPACE.
International Journal of Computational Geometry & Applications,
Vol. 22,
Issue. 01,
p.
45.
Alamdari, Soroush
Chan, Timothy M.
Grant, Elyot
Lubiw, Anna
and
Pathak, Vinayak
2013.
Graph Drawing.
Vol. 7704,
Issue. ,
p.
260.
Nöllenburg, Martin
Prutkin, Roman
and
Rutter, Ignaz
2014.
Progress in Pattern Recognition, Image Analysis, Computer Vision, and Applications.
Vol. 8827,
Issue. ,
p.
476.
Dehkordi, Hooman Reisi
Frati, Fabrizio
and
Gudmundsson, Joachim
2014.
Progress in Pattern Recognition, Image Analysis, Computer Vision, and Applications.
Vol. 8827,
Issue. ,
p.
464.
Mastakas, Konstantinos
and
Symvonis, Antonios
2015.
On the construction of increasing-chord graphs on convex point sets.
p.
1.
Nöllenburg, Martin
Prutkin, Roman
and
Rutter, Ignaz
2015.
Algorithms and Computation.
Vol. 9472,
Issue. ,
p.
637.
Bakhshesh, Davood
and
Farshi, Mohammad
2016.
Topics in Theoretical Computer Science.
Vol. 9541,
Issue. ,
p.
44.
Bonichon, Nicolas
Bose, Prosenjit
Carmi, Paz
Kostitsyna, Irina
Lubiw, Anna
and
Verdonschot, Sander
2016.
Graph Drawing and Network Visualization.
Vol. 9801,
Issue. ,
p.
519.
Longinetti, Marco
Manselli, Paolo
and
Venturi, Adriana
2016.
Bounding Regions to Plane Steepest Descent Curves of Quasiconvex Families.
Journal of Applied Mathematics,
Vol. 2016,
Issue. ,
p.
1.
Mastakas, Konstantinos
and
Symvonis, Antonios
2017.
Algorithms and Complexity.
Vol. 10236,
Issue. ,
p.
405.
Nöllenburg, Martin
Prutkin, Roman
and
Rutter, Ignaz
2017.
Partitioning Graph Drawings and Triangulated Simple Polygons into Greedily Routable Regions.
International Journal of Computational Geometry & Applications,
Vol. 27,
Issue. 01n02,
p.
121.