Pestov–Ionin theorem (English Wikipedia)

Analysis of information sources in references of the Wikipedia article "Pestov–Ionin theorem" in English language version.

refsWebsite

Global rank English rank

6ams.org

451^st place

277^th place

5doi.org

2^nd place

3semanticscholar.org

11^th place

8^th place

2arxiv.org

69^th place

59^th place

1archive.org

6^th place

1handle.net

102^nd place

76^th place

1psu.edu

207^th place

136^th place

ams.org (Global: 451^st place; English: 277^th place)

mathscinet.ams.org

Pestov, G.; Ionin, V. (1959), "On the largest possible circle imbedded in a given closed curve", Proceedings of the USSR Academy of Sciences (in Russian), 127: 1170–1172, MR 0107214
Ahn, Hee-Kap; Cheong, Otfried; Matoušek, Jiří; Vigneron, Antoine (2012), "Reachability by paths of bounded curvature in a convex polygon", Computational Geometry, 45 (1–2): 21–32, arXiv:1008.4244, doi:10.1016/j.comgeo.2011.07.003, hdl:10754/562037, MR 2842619
Aamand, Anders; Abrahamsen, Mikkel; Thorup, Mikkel (2020), "Disks in curves of bounded convex curvature", The American Mathematical Monthly, 127 (7): 579–593, arXiv:1909.00852, doi:10.1080/00029890.2020.1752602, MR 4128552, S2CID 202539477
Leonardi, Gian Paolo; Neumayer, Robin; Saracco, Giorgio (2017), "The Cheeger constant of a Jordan domain without necks", Calculus of Variations and Partial Differential Equations, 56 (6): 164, doi:10.1007/s00526-017-1263-0, MR 3719067
Agarwal, Pankaj K.; Biedl, Therese; Lazard, Sylvain; Robbins, Steve; Suri, Subhash; Whitesides, Sue (2002), "Curvature-constrained shortest paths in a convex polygon", SIAM Journal on Computing, 31 (6): 1814–1851, CiteSeerX 10.1.1.398.3027, doi:10.1137/S0097539700374550, MR 1954880, S2CID 37983528
Guha, Sumanta; Tran, Son Dinh (2005), "Reconstructing curves without Delaunay computation", Algorithmica, 42 (1): 75–94, doi:10.1007/s00453-004-1141-y, MR 2131830, S2CID 11620890

archive.org (Global: 6^th place; English: 6^th place)

Blaschke, Wilhelm (1916), "24.II: Kleinster und größter Krümmungskreis einer konvexen Kurve", Kreis und Kugel (in German), Veit, pp. 114–117

arxiv.org (Global: 69^th place; English: 59^th place)

Ahn, Hee-Kap; Cheong, Otfried; Matoušek, Jiří; Vigneron, Antoine (2012), "Reachability by paths of bounded curvature in a convex polygon", Computational Geometry, 45 (1–2): 21–32, arXiv:1008.4244, doi:10.1016/j.comgeo.2011.07.003, hdl:10754/562037, MR 2842619
Aamand, Anders; Abrahamsen, Mikkel; Thorup, Mikkel (2020), "Disks in curves of bounded convex curvature", The American Mathematical Monthly, 127 (7): 579–593, arXiv:1909.00852, doi:10.1080/00029890.2020.1752602, MR 4128552, S2CID 202539477

doi.org (Global: 2^nd place; English: 2^nd place)

Ahn, Hee-Kap; Cheong, Otfried; Matoušek, Jiří; Vigneron, Antoine (2012), "Reachability by paths of bounded curvature in a convex polygon", Computational Geometry, 45 (1–2): 21–32, arXiv:1008.4244, doi:10.1016/j.comgeo.2011.07.003, hdl:10754/562037, MR 2842619
Aamand, Anders; Abrahamsen, Mikkel; Thorup, Mikkel (2020), "Disks in curves of bounded convex curvature", The American Mathematical Monthly, 127 (7): 579–593, arXiv:1909.00852, doi:10.1080/00029890.2020.1752602, MR 4128552, S2CID 202539477
Leonardi, Gian Paolo; Neumayer, Robin; Saracco, Giorgio (2017), "The Cheeger constant of a Jordan domain without necks", Calculus of Variations and Partial Differential Equations, 56 (6): 164, doi:10.1007/s00526-017-1263-0, MR 3719067
Agarwal, Pankaj K.; Biedl, Therese; Lazard, Sylvain; Robbins, Steve; Suri, Subhash; Whitesides, Sue (2002), "Curvature-constrained shortest paths in a convex polygon", SIAM Journal on Computing, 31 (6): 1814–1851, CiteSeerX 10.1.1.398.3027, doi:10.1137/S0097539700374550, MR 1954880, S2CID 37983528
Guha, Sumanta; Tran, Son Dinh (2005), "Reconstructing curves without Delaunay computation", Algorithmica, 42 (1): 75–94, doi:10.1007/s00453-004-1141-y, MR 2131830, S2CID 11620890

handle.net (Global: 102^nd place; English: 76^th place)

hdl.handle.net

Ahn, Hee-Kap; Cheong, Otfried; Matoušek, Jiří; Vigneron, Antoine (2012), "Reachability by paths of bounded curvature in a convex polygon", Computational Geometry, 45 (1–2): 21–32, arXiv:1008.4244, doi:10.1016/j.comgeo.2011.07.003, hdl:10754/562037, MR 2842619

psu.edu (Global: 207^th place; English: 136^th place)

citeseerx.ist.psu.edu

Agarwal, Pankaj K.; Biedl, Therese; Lazard, Sylvain; Robbins, Steve; Suri, Subhash; Whitesides, Sue (2002), "Curvature-constrained shortest paths in a convex polygon", SIAM Journal on Computing, 31 (6): 1814–1851, CiteSeerX 10.1.1.398.3027, doi:10.1137/S0097539700374550, MR 1954880, S2CID 37983528

semanticscholar.org (Global: 11^th place; English: 8^th place)

api.semanticscholar.org

Aamand, Anders; Abrahamsen, Mikkel; Thorup, Mikkel (2020), "Disks in curves of bounded convex curvature", The American Mathematical Monthly, 127 (7): 579–593, arXiv:1909.00852, doi:10.1080/00029890.2020.1752602, MR 4128552, S2CID 202539477
Agarwal, Pankaj K.; Biedl, Therese; Lazard, Sylvain; Robbins, Steve; Suri, Subhash; Whitesides, Sue (2002), "Curvature-constrained shortest paths in a convex polygon", SIAM Journal on Computing, 31 (6): 1814–1851, CiteSeerX 10.1.1.398.3027, doi:10.1137/S0097539700374550, MR 1954880, S2CID 37983528
Guha, Sumanta; Tran, Son Dinh (2005), "Reconstructing curves without Delaunay computation", Algorithmica, 42 (1): 75–94, doi:10.1007/s00453-004-1141-y, MR 2131830, S2CID 11620890

Pestov–Ionin theorem (English Wikipedia)

ams.org (Global: 451st place; English: 277th place)

mathscinet.ams.org

archive.org (Global: 6th place; English: 6th place)

arxiv.org (Global: 69th place; English: 59th place)

doi.org (Global: 2nd place; English: 2nd place)

handle.net (Global: 102nd place; English: 76th place)