Crossref Citations
This article has been cited by the following publications. This list is generated based on data provided by Crossref.
Klein, Rolf
and
Lingas, Andrzej
1994.
Algorithms and Computation.
Vol. 834,
Issue. ,
p.
11.
Aichholzer, Oswin
Aurenhammer, Franz
Icking, Christian
Klein, Rolf
Langetepe, Elmar
and
Rote, Günter
1998.
Algorithms and Computation.
Vol. 1533,
Issue. ,
p.
317.
Palios, Leonidas
2000.
Algorithm Theory - SWAT 2000.
Vol. 1851,
Issue. ,
p.
367.
Hoffmann, Frank
Icking, Christian
Klein, Rolf
and
Kriegel, Klaus
2001.
The Polygon Exploration Problem.
SIAM Journal on Computing,
Vol. 31,
Issue. 2,
p.
577.
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
Klein, Rolf
Langetepe, Elmar
and
Lingas, Andrzej
2001.
Algorithms — ESA 2001.
Vol. 2161,
Issue. ,
p.
321.
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.
Aronov, Boris
Har-Peled, Sariel
Knauer, Christian
Wang, Yusu
and
Wenk, Carola
2006.
Algorithms – ESA 2006.
Vol. 4168,
Issue. ,
p.
52.
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.
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.
Bonichon, Nicolas
Bose, Prosenjit
Carmi, Paz
Kostitsyna, Irina
Lubiw, Anna
and
Verdonschot, Sander
2016.
Graph Drawing and Network Visualization.
Vol. 9801,
Issue. ,
p.
519.
Bakhshesh, Davood
and
Farshi, Mohammad
2016.
Topics in Theoretical Computer Science.
Vol. 9541,
Issue. ,
p.
44.
Mastakas, Konstantinos
and
Symvonis, Antonios
2017.
Algorithms and Complexity.
Vol. 10236,
Issue. ,
p.
405.
Lubiw, Anna
and
Mondal, Debajyoti
2018.
Graph-Theoretic Concepts in Computer Science.
Vol. 11159,
Issue. ,
p.
356.
Bose, Prosenjit
Kostitsyna, Irina
and
Langerman, Stefan
2020.
Self-approaching paths in simple polygons.
Computational Geometry,
Vol. 87,
Issue. ,
p.
101595.