Square packing (English Wikipedia)

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

refsWebsite

Global rank English rank

9doi.org

2^nd place

8ams.org

451^st place

277^th place

4combinatorics.org

low place

3web.archive.org

1^st place

2arxiv.org

69^th place

59^th place

2ucsd.edu

1,933^rd place

1,342^nd place

1books.google.com

3^rd place

1loc.gov

70^th place

63^rd place

1wolfram.com

513^th place

537^th place

1erich-friedman.github.io

low place

ams.org

mathscinet.ams.org

Brass, Peter; Moser, William; Pach, János (2005), Research Problems in Discrete Geometry, New York: Springer, p. 45, ISBN 978-0387-23815-9, LCCN 2005924022, MR 2163782
Kearney, Michael J.; Shiu, Peter (2002), "Efficient packing of unit squares in a square", Electronic Journal of Combinatorics, 9 (1), Research Paper 14, 14 pp., doi:10.37236/1631, MR 1912796, archived from the original on 2011-06-04, retrieved 2011-06-01
Bentz, Wolfram (2010), "Optimal packings of 13 and 46 unit squares in a square", The Electronic Journal of Combinatorics, 17 (R126), arXiv:1606.03746, doi:10.37236/398, MR 2729375
Friedman, Erich (2009), "Packing unit squares in squares: a survey and new results", Electronic Journal of Combinatorics, 1000, Dynamic Survey 7, doi:10.37236/28, MR 1668055, archived from the original on 2018-02-24, retrieved 2018-02-23
Stromquist, Walter (2003), "Packing 10 or 11 unit squares in a square", Electronic Journal of Combinatorics, 10, Research Paper 8, doi:10.37236/1701, MR 2386538, archived from the original on 2011-06-04, retrieved 2011-06-01
The 2000 version of Friedman (2009) listed this side length as 3.8772; the tighter bound stated here is from Gensane, Thierry; Ryckelynck, Philippe (2005), "Improved dense packings of congruent squares in a square", Discrete & Computational Geometry, 34 (1): 97–109, doi:10.1007/s00454-004-1129-z, MR 2140885
Erdős, P.; Graham, R. L. (1975), "On packing squares with equal squares" (PDF), Journal of Combinatorial Theory, Series A, 19: 119–123, doi:10.1016/0097-3165(75)90099-0, MR 0370368
Roth, K. F.; Vaughan, R. C. (1978), "Inefficiency in packing squares with unit squares", Journal of Combinatorial Theory, Series A, 24 (2): 170–186, doi:10.1016/0097-3165(78)90005-5, MR 0487806

arxiv.org

Bentz, Wolfram (2010), "Optimal packings of 13 and 46 unit squares in a square", The Electronic Journal of Combinatorics, 17 (R126), arXiv:1606.03746, doi:10.37236/398, MR 2729375
Abrahamsen, Mikkel; Stade, Jack (2024), "Hardness of packing, covering and partitioning simple polygons with unit squares", 65th IEEE Annual Symposium on Foundations of Computer Science, FOCS 2024, Chicago, IL, USA, October 27–30, 2024, IEEE, pp. 1355–1371, arXiv:2404.09835, doi:10.1109/FOCS61266.2024.00087

books.google.com

Brass, Peter; Moser, William; Pach, János (2005), Research Problems in Discrete Geometry, New York: Springer, p. 45, ISBN 978-0387-23815-9, LCCN 2005924022, MR 2163782

combinatorics.org

Kearney, Michael J.; Shiu, Peter (2002), "Efficient packing of unit squares in a square", Electronic Journal of Combinatorics, 9 (1), Research Paper 14, 14 pp., doi:10.37236/1631, MR 1912796, archived from the original on 2011-06-04, retrieved 2011-06-01
Bentz, Wolfram (2010), "Optimal packings of 13 and 46 unit squares in a square", The Electronic Journal of Combinatorics, 17 (R126), arXiv:1606.03746, doi:10.37236/398, MR 2729375
Friedman, Erich (2009), "Packing unit squares in squares: a survey and new results", Electronic Journal of Combinatorics, 1000, Dynamic Survey 7, doi:10.37236/28, MR 1668055, archived from the original on 2018-02-24, retrieved 2018-02-23
Stromquist, Walter (2003), "Packing 10 or 11 unit squares in a square", Electronic Journal of Combinatorics, 10, Research Paper 8, doi:10.37236/1701, MR 2386538, archived from the original on 2011-06-04, retrieved 2011-06-01

doi.org

Kearney, Michael J.; Shiu, Peter (2002), "Efficient packing of unit squares in a square", Electronic Journal of Combinatorics, 9 (1), Research Paper 14, 14 pp., doi:10.37236/1631, MR 1912796, archived from the original on 2011-06-04, retrieved 2011-06-01
Bentz, Wolfram (2010), "Optimal packings of 13 and 46 unit squares in a square", The Electronic Journal of Combinatorics, 17 (R126), arXiv:1606.03746, doi:10.37236/398, MR 2729375
Friedman, Erich (2009), "Packing unit squares in squares: a survey and new results", Electronic Journal of Combinatorics, 1000, Dynamic Survey 7, doi:10.37236/28, MR 1668055, archived from the original on 2018-02-24, retrieved 2018-02-23
Stromquist, Walter (2003), "Packing 10 or 11 unit squares in a square", Electronic Journal of Combinatorics, 10, Research Paper 8, doi:10.37236/1701, MR 2386538, archived from the original on 2011-06-04, retrieved 2011-06-01
The 2000 version of Friedman (2009) listed this side length as 3.8772; the tighter bound stated here is from Gensane, Thierry; Ryckelynck, Philippe (2005), "Improved dense packings of congruent squares in a square", Discrete & Computational Geometry, 34 (1): 97–109, doi:10.1007/s00454-004-1129-z, MR 2140885
Erdős, P.; Graham, R. L. (1975), "On packing squares with equal squares" (PDF), Journal of Combinatorial Theory, Series A, 19: 119–123, doi:10.1016/0097-3165(75)90099-0, MR 0370368
Chung, Fan; Graham, Ron (2020), "Efficient packings of unit squares in a large square" (PDF), Discrete & Computational Geometry, 64 (3): 690–699, doi:10.1007/s00454-019-00088-9
Roth, K. F.; Vaughan, R. C. (1978), "Inefficiency in packing squares with unit squares", Journal of Combinatorial Theory, Series A, 24 (2): 170–186, doi:10.1016/0097-3165(78)90005-5, MR 0487806
Abrahamsen, Mikkel; Stade, Jack (2024), "Hardness of packing, covering and partitioning simple polygons with unit squares", 65th IEEE Annual Symposium on Foundations of Computer Science, FOCS 2024, Chicago, IL, USA, October 27–30, 2024, IEEE, pp. 1355–1371, arXiv:2404.09835, doi:10.1109/FOCS61266.2024.00087

erich-friedman.github.io

Friedman, Erich, Squares in Circles

loc.gov

lccn.loc.gov

Brass, Peter; Moser, William; Pach, János (2005), Research Problems in Discrete Geometry, New York: Springer, p. 45, ISBN 978-0387-23815-9, LCCN 2005924022, MR 2163782

ucsd.edu

math.ucsd.edu

Erdős, P.; Graham, R. L. (1975), "On packing squares with equal squares" (PDF), Journal of Combinatorial Theory, Series A, 19: 119–123, doi:10.1016/0097-3165(75)90099-0, MR 0370368
Chung, Fan; Graham, Ron (2020), "Efficient packings of unit squares in a large square" (PDF), Discrete & Computational Geometry, 64 (3): 690–699, doi:10.1007/s00454-019-00088-9

web.archive.org

Kearney, Michael J.; Shiu, Peter (2002), "Efficient packing of unit squares in a square", Electronic Journal of Combinatorics, 9 (1), Research Paper 14, 14 pp., doi:10.37236/1631, MR 1912796, archived from the original on 2011-06-04, retrieved 2011-06-01
Friedman, Erich (2009), "Packing unit squares in squares: a survey and new results", Electronic Journal of Combinatorics, 1000, Dynamic Survey 7, doi:10.37236/28, MR 1668055, archived from the original on 2018-02-24, retrieved 2018-02-23
Stromquist, Walter (2003), "Packing 10 or 11 unit squares in a square", Electronic Journal of Combinatorics, 10, Research Paper 8, doi:10.37236/1701, MR 2386538, archived from the original on 2011-06-04, retrieved 2011-06-01

wolfram.com

mathworld.wolfram.com

Weisstein, Eric W., "Square Packing", MathWorld