Circle packing theorem (English Wikipedia)

Analysis of information sources in references of the Wikipedia article "Circle packing theorem" in English language version.

refsWebsite

Global rank English rank

14doi.org

2^nd place

9ams.org

451^st place

277^th place

5semanticscholar.org

11^th place

8^th place

2jhu.edu

699^th place

479^th place

2projecteuclid.org

3,707^th place

2,409^th place

2washington.edu

1,067^th place

749^th place

1msri.org

low place

1harvard.edu

18^th place

17^th place

1psu.edu

207^th place

136^th place

1handle.net

102^nd place

76^th place

1arxiv.org

69^th place

59^th place

1e-periodica.ch

6,247^th place

low place

ams.org

mathscinet.ams.org

Stephenson (1999). Stephenson, Kenneth (1999), "The approximation of conformal structures via circle packing" (PDF), Computational methods and function theory 1997 (Nicosia), Ser. Approx. Decompos., vol. 11, World Sci. Publ., River Edge, NJ, pp. 551–582, MR 1700374
Stephenson (1999): "Circle packing certainly cannot compete with the classical numerical methods for speed and accuracy." Stephenson, Kenneth (1999), "The approximation of conformal structures via circle packing" (PDF), Computational methods and function theory 1997 (Nicosia), Ser. Approx. Decompos., vol. 11, World Sci. Publ., River Edge, NJ, pp. 551–582, MR 1700374
Benjamini & Schramm (2001). Benjamini, Itai; Schramm, Oded (2001), "Recurrence of distributional limits of finite planar graphs", Electronic Journal of Probability, 6, doi:10.1214/EJP.v6-96, MR 1873300, S2CID 2862151
Malitz & Papakostas (1994). Malitz, Seth; Papakostas, Achilleas (1994), "On the angular resolution of planar graphs", SIAM Journal on Discrete Mathematics, 7 (2): 172–183, doi:10.1137/S0895480193242931, MR 1271989
Keszegh, Pach & Pálvölgyi (2011). Keszegh, Balázs; Pach, János; Pálvölgyi, Dömötör (2011), "Drawing planar graphs of bounded degree with few slopes", in Brandes, Ulrik; Cornelsen, Sabine (eds.), Graph Drawing: 18th International Symposium, GD 2010, Konstanz, Germany, September 21-24, 2010, Revised Selected Papers, Lecture Notes in Computer Science, vol. 6502, Heidelberg: Springer, pp. 293–304, arXiv:1009.1315, doi:10.1007/978-3-642-18469-7_27, ISBN 978-3-642-18468-0, MR 2781274, S2CID 817874
He & Schramm (1995). He, Zheng-Xu; Schramm, O. (1995), "Hyperbolic and parabolic packings", Discrete & Computational Geometry, 14 (2): 123–149, doi:10.1007/BF02570699, MR 1331923
Coxeter (2006). Coxeter, H. S. M. (2006), "An absolute property of four mutually tangent circles", Non-Euclidean geometries, Math. Appl. (N. Y.), vol. 581, New York: Springer, pp. 109–114, doi:10.1007/0-387-29555-0_5, ISBN 978-0-387-29554-1, MR 2191243
Bowers & Stephenson (2004). Bowers, Philip L.; Stephenson, Kenneth (2004), "8.2 Inversive distance packings", Uniformizing dessins and Belyĭ maps via circle packing, Memoirs of the American Mathematical Society, vol. 170, pp. 78–82, doi:10.1090/memo/0805, MR 2053391

ams.org

Beardon & Stephenson (1991); Carter & Rodin (1992). Beardon, Alan F.; Stephenson, Kenneth (1991), "The Schwarz-Pick lemma for circle packings", Illinois J. Math., 35 (4): 577–606, doi:10.1215/ijm/1255987673 Carter, Ithiel; Rodin, Burt (1992), "An inverse problem for circle packing and conformal mapping", Trans. Amer. Math. Soc., 334 (2): 861–875, doi:10.1090/S0002-9947-1992-1081937-X

arxiv.org

Keszegh, Pach & Pálvölgyi (2011). Keszegh, Balázs; Pach, János; Pálvölgyi, Dömötör (2011), "Drawing planar graphs of bounded degree with few slopes", in Brandes, Ulrik; Cornelsen, Sabine (eds.), Graph Drawing: 18th International Symposium, GD 2010, Konstanz, Germany, September 21-24, 2010, Revised Selected Papers, Lecture Notes in Computer Science, vol. 6502, Heidelberg: Springer, pp. 293–304, arXiv:1009.1315, doi:10.1007/978-3-642-18469-7_27, ISBN 978-3-642-18468-0, MR 2781274, S2CID 817874

doi.org

Beardon & Stephenson (1991); Carter & Rodin (1992). Beardon, Alan F.; Stephenson, Kenneth (1991), "The Schwarz-Pick lemma for circle packings", Illinois J. Math., 35 (4): 577–606, doi:10.1215/ijm/1255987673 Carter, Ithiel; Rodin, Burt (1992), "An inverse problem for circle packing and conformal mapping", Trans. Amer. Math. Soc., 334 (2): 861–875, doi:10.1090/S0002-9947-1992-1081937-X
Colin de Verdière (1991). Colin de Verdière, Yves (1991), "Une principe variationnel pour les empilements de cercles", Inventiones Mathematicae, 104 (1): 655–669, Bibcode:1991InMat.104..655C, doi:10.1007/BF01245096, S2CID 121028882
Lipton & Tarjan (1979). Lipton, Richard J.; Tarjan, Robert E. (1979), "A separator theorem for planar graphs", SIAM Journal on Applied Mathematics, 36 (2): 177–189, CiteSeerX 10.1.1.104.6528, doi:10.1137/0136016
Miller et al. (1997). Miller, Gary L.; Teng, Shang-Hua; Thurston, William; Vavasis, Stephen A. (1997), "Separators for sphere-packings and nearest neighbor graphs", J. ACM, 44 (1): 1–29, doi:10.1145/256292.256294, S2CID 17331739
Benjamini & Schramm (2001). Benjamini, Itai; Schramm, Oded (2001), "Recurrence of distributional limits of finite planar graphs", Electronic Journal of Probability, 6, doi:10.1214/EJP.v6-96, MR 1873300, S2CID 2862151
Kelner (2006). Kelner, Jonathan A. (2006), "Spectral partitioning, eigenvalue bounds, and circle packings for graphs of bounded genus", SIAM Journal on Computing, 35 (4): 882–902, doi:10.1137/S0097539705447244, hdl:1721.1/30169
Malitz & Papakostas (1994). Malitz, Seth; Papakostas, Achilleas (1994), "On the angular resolution of planar graphs", SIAM Journal on Discrete Mathematics, 7 (2): 172–183, doi:10.1137/S0895480193242931, MR 1271989
Keszegh, Pach & Pálvölgyi (2011). Keszegh, Balázs; Pach, János; Pálvölgyi, Dömötör (2011), "Drawing planar graphs of bounded degree with few slopes", in Brandes, Ulrik; Cornelsen, Sabine (eds.), Graph Drawing: 18th International Symposium, GD 2010, Konstanz, Germany, September 21-24, 2010, Revised Selected Papers, Lecture Notes in Computer Science, vol. 6502, Heidelberg: Springer, pp. 293–304, arXiv:1009.1315, doi:10.1007/978-3-642-18469-7_27, ISBN 978-3-642-18468-0, MR 2781274, S2CID 817874
He & Schramm (1995). He, Zheng-Xu; Schramm, O. (1995), "Hyperbolic and parabolic packings", Discrete & Computational Geometry, 14 (2): 123–149, doi:10.1007/BF02570699, MR 1331923
Brightwell & Scheinerman (1993). Brightwell, Graham R.; Scheinerman, Edward R. (1993), "Representations of planar graphs", SIAM J. Discrete Math., 6 (2): 214–229, doi:10.1137/0406017
Coxeter (2006). Coxeter, H. S. M. (2006), "An absolute property of four mutually tangent circles", Non-Euclidean geometries, Math. Appl. (N. Y.), vol. 581, New York: Springer, pp. 109–114, doi:10.1007/0-387-29555-0_5, ISBN 978-0-387-29554-1, MR 2191243
Bowers & Stephenson (2004). Bowers, Philip L.; Stephenson, Kenneth (2004), "8.2 Inversive distance packings", Uniformizing dessins and Belyĭ maps via circle packing, Memoirs of the American Mathematical Society, vol. 170, pp. 78–82, doi:10.1090/memo/0805, MR 2053391
Harrington (1982). Harrington, Andrew N. (1982), "Conformal mappings onto domains with arbitrarily specified boundary shapes", Journal d'Analyse Mathématique, 41 (1): 39–53, doi:10.1007/BF02803393, S2CID 120752035
Rodin & Sullivan (1987). Rodin, Burton; Sullivan, Dennis (1987), "The convergence of circle packings to the Riemann mapping", Journal of Differential Geometry, 26 (2): 349–360, doi:10.4310/jdg/1214441375

e-periodica.ch

Emch (1910). Emch, Arnold (1910), "Sur quelques exemples mathématiques dans les sciences naturelles", L'Enseignement mathématique (in French), 12: 114–123

handle.net

hdl.handle.net

Kelner (2006). Kelner, Jonathan A. (2006), "Spectral partitioning, eigenvalue bounds, and circle packings for graphs of bounded genus", SIAM Journal on Computing, 35 (4): 882–902, doi:10.1137/S0097539705447244, hdl:1721.1/30169

harvard.edu

ui.adsabs.harvard.edu

Colin de Verdière (1991). Colin de Verdière, Yves (1991), "Une principe variationnel pour les empilements de cercles", Inventiones Mathematicae, 104 (1): 655–669, Bibcode:1991InMat.104..655C, doi:10.1007/BF01245096, S2CID 121028882

jhu.edu

cs.jhu.edu

Stephenson (1999). Stephenson, Kenneth (1999), "The approximation of conformal structures via circle packing" (PDF), Computational methods and function theory 1997 (Nicosia), Ser. Approx. Decompos., vol. 11, World Sci. Publ., River Edge, NJ, pp. 551–582, MR 1700374
Stephenson (1999): "Circle packing certainly cannot compete with the classical numerical methods for speed and accuracy." Stephenson, Kenneth (1999), "The approximation of conformal structures via circle packing" (PDF), Computational methods and function theory 1997 (Nicosia), Ser. Approx. Decompos., vol. 11, World Sci. Publ., River Edge, NJ, pp. 551–582, MR 1700374

msri.org

Thurston (1978–1981), Chap. 13. Thurston, William (1978–1981), The geometry and topology of 3-manifolds, Princeton lecture notes

projecteuclid.org

Beardon & Stephenson (1991); Carter & Rodin (1992). Beardon, Alan F.; Stephenson, Kenneth (1991), "The Schwarz-Pick lemma for circle packings", Illinois J. Math., 35 (4): 577–606, doi:10.1215/ijm/1255987673 Carter, Ithiel; Rodin, Burt (1992), "An inverse problem for circle packing and conformal mapping", Trans. Amer. Math. Soc., 334 (2): 861–875, doi:10.1090/S0002-9947-1992-1081937-X
Rodin & Sullivan (1987). Rodin, Burton; Sullivan, Dennis (1987), "The convergence of circle packings to the Riemann mapping", Journal of Differential Geometry, 26 (2): 349–360, doi:10.4310/jdg/1214441375

psu.edu

citeseerx.ist.psu.edu

Lipton & Tarjan (1979). Lipton, Richard J.; Tarjan, Robert E. (1979), "A separator theorem for planar graphs", SIAM Journal on Applied Mathematics, 36 (2): 177–189, CiteSeerX 10.1.1.104.6528, doi:10.1137/0136016

semanticscholar.org

api.semanticscholar.org

Colin de Verdière (1991). Colin de Verdière, Yves (1991), "Une principe variationnel pour les empilements de cercles", Inventiones Mathematicae, 104 (1): 655–669, Bibcode:1991InMat.104..655C, doi:10.1007/BF01245096, S2CID 121028882
Miller et al. (1997). Miller, Gary L.; Teng, Shang-Hua; Thurston, William; Vavasis, Stephen A. (1997), "Separators for sphere-packings and nearest neighbor graphs", J. ACM, 44 (1): 1–29, doi:10.1145/256292.256294, S2CID 17331739
Benjamini & Schramm (2001). Benjamini, Itai; Schramm, Oded (2001), "Recurrence of distributional limits of finite planar graphs", Electronic Journal of Probability, 6, doi:10.1214/EJP.v6-96, MR 1873300, S2CID 2862151
Keszegh, Pach & Pálvölgyi (2011). Keszegh, Balázs; Pach, János; Pálvölgyi, Dömötör (2011), "Drawing planar graphs of bounded degree with few slopes", in Brandes, Ulrik; Cornelsen, Sabine (eds.), Graph Drawing: 18th International Symposium, GD 2010, Konstanz, Germany, September 21-24, 2010, Revised Selected Papers, Lecture Notes in Computer Science, vol. 6502, Heidelberg: Springer, pp. 293–304, arXiv:1009.1315, doi:10.1007/978-3-642-18469-7_27, ISBN 978-3-642-18468-0, MR 2781274, S2CID 817874
Harrington (1982). Harrington, Andrew N. (1982), "Conformal mappings onto domains with arbitrarily specified boundary shapes", Journal d'Analyse Mathématique, 41 (1): 39–53, doi:10.1007/BF02803393, S2CID 120752035

washington.edu

math.washington.edu

Benjamini & Schramm (2001). Benjamini, Itai; Schramm, Oded (2001), "Recurrence of distributional limits of finite planar graphs", Electronic Journal of Probability, 6, doi:10.1214/EJP.v6-96, MR 1873300, S2CID 2862151
Jonnason & Schramm (2000). Jonnason, Johan; Schramm, Oded (2000), "On the cover time of planar graphs", Electronic Communications in Probability, 5: 85–90