Penny graph (English Wikipedia)

Analysis of information sources in references of the Wikipedia article "Penny graph" in English language version.

refsWebsite

Global rank English rank

15doi.org

2^nd place

13ams.org

451^st place

277^th place

3books.google.com

3^rd place

3arxiv.org

69^th place

59^th place

3semanticscholar.org

11^th place

8^th place

1imfm.si

low place

1numdam.org

8,650^th place

7,668^th place

1lse.ac.uk

2,117^th place

1,361^st place

1jstor.org

26^th place

20^th place

1epfl.ch

4,521^st place

4,877^th place

1uwm.edu

7,852^nd place

4,764^th place

1dagstuhl.de

low place

1discrete-notes.github.io

low place

ams.org

mathscinet.ams.org

Pisanski, Tomaž; Randić, Milan (2000), "Bridges between geometry and graph theory" (PDF), in Gorini, Catherine A. (ed.), Geometry at Work, MAA Notes, vol. 53, Cambridge University Press, pp. 174–194, MR 1782654; see especially p. 176
Cerioli, Marcia R.; Faria, Luerbio; Ferreira, Talita O.; Protti, Fábio (2011), "A note on maximum independent sets and minimum clique partitions in unit disk graphs and penny graphs: complexity and approximation", RAIRO Theoretical Informatics and Applications, 45 (3): 331–346, doi:10.1051/ita/2011106, MR 2836493
Csizmadia, G. (1998), "On the independence number of minimum distance graphs", Discrete & Computational Geometry, 20 (2): 179–187, doi:10.1007/PL00009381, MR 1637884
Brass, Peter; Moser, William; Pach, János (2005), Research Problems in Discrete Geometry, New York: Springer, p. 228, ISBN 978-0387-23815-9, MR 2163782
Eades, Peter; Whitesides, Sue (1996), "The logic engine and the realization problem for nearest neighbor graphs", Theoretical Computer Science, 169 (1): 23–37, doi:10.1016/S0304-3975(97)84223-5, MR 1424926
Pach, János; Agarwal, Pankaj K. (1995), Combinatorial Geometry, Wiley-Interscience Series in Discrete Mathematics and Optimization, New York: John Wiley & Sons, Inc., doi:10.1002/9781118033203, ISBN 0-471-58890-3, MR 1354145; see Theorem 13.12, p. 211.
Kupitz, Y. S. (1994), "On the maximal number of appearances of the minimal distance among $n$ points in the plane", Intuitive Geometry (Szeged, 1991), Colloq. Math. Soc. János Bolyai, vol. 63, North-Holland, pp. 217–244, MR 1383628
Eppstein, David (2018), "Edge bounds and degeneracy of triangle-free penny graphs and squaregraphs", Journal of Graph Algorithms and Applications, 22 (3): 483–499, arXiv:1708.05152, doi:10.7155/jgaa.00463, MR 3866392
Swanepoel, Konrad J. (2009), "Triangle-free minimum distance graphs in the plane" (PDF), Geombinatorics, 19 (1): 28–30, MR 2584434
Pach, János; Tóth, Géza (1996), "On the independence number of coin graphs", Geombinatorics, 6 (1): 30–33, MR 1392795
Swanepoel, Konrad J. (2002), "Independence numbers of planar contact graphs", Discrete & Computational Geometry, 28 (4): 649–670, arXiv:math/0403023, doi:10.1007/s00454-002-2897-y, MR 1949907; Swanepoel's result strengthens an earlier $c \geq 9/35 \approx 0.257$ bound of Csizmadia (1998).
Khuller, Samir; Matias, Yossi (1995), "A simple randomized sieve algorithm for the closest-pair problem", Information and Computation, 118 (1): 34–37, doi:10.1006/inco.1995.1049, MR 1329236
Horvat, Boris; Pisanski, Tomaž (2010), "Products of unit distance graphs", Discrete Mathematics, 310 (12): 1783–1792, doi:10.1016/j.disc.2009.11.035, MR 2610282

arxiv.org

Eppstein, David (2018), "Edge bounds and degeneracy of triangle-free penny graphs and squaregraphs", Journal of Graph Algorithms and Applications, 22 (3): 483–499, arXiv:1708.05152, doi:10.7155/jgaa.00463, MR 3866392
Swanepoel, Konrad J. (2002), "Independence numbers of planar contact graphs", Discrete & Computational Geometry, 28 (4): 649–670, arXiv:math/0403023, doi:10.1007/s00454-002-2897-y, MR 1949907; Swanepoel's result strengthens an earlier $c \geq 9/35 \approx 0.257$ bound of Csizmadia (1998).
Dumitrescu, Adrian; Jiang, Minghui (June 2013), "Computational Geometry Column 56" (PDF), SIGACT News, 44 (2), New York, NY, US: ACM: 80–87, arXiv:cs/9908007, doi:10.1145/2491533.2491550, S2CID 52807205

books.google.com

Pisanski, Tomaž; Randić, Milan (2000), "Bridges between geometry and graph theory" (PDF), in Gorini, Catherine A. (ed.), Geometry at Work, MAA Notes, vol. 53, Cambridge University Press, pp. 174–194, MR 1782654; see especially p. 176
Brass, Peter; Moser, William; Pach, János (2005), Research Problems in Discrete Geometry, New York: Springer, p. 228, ISBN 978-0387-23815-9, MR 2163782
Hartsfield, Nora; Ringel, Gerhard (2013), "Problem 8.4.8", Pearls in Graph Theory: A Comprehensive Introduction, Dover Books on Mathematics, Courier Corporation, pp. 177–178, ISBN 9780486315522.

dagstuhl.de

drops.dagstuhl.de

Bhore, Sujoy; Jain, Rahul (2021), "Space-efficient algorithms for reachability in directed geometric graphs", in Ahn, Hee-Kap; Sadakane, Kunihiko (eds.), 32nd International Symposium on Algorithms and Computation (ISAAC 2021), Leibniz International Proceedings in Informatics (LIPIcs), vol. 212, Dagstuhl, Germany: Schloss Dagstuhl – Leibniz-Zentrum für Informatik, pp. 63:1–63:17, doi:10.4230/LIPIcs.ISAAC.2021.63, ISBN 978-3-95977-214-3, S2CID 244731943

discrete-notes.github.io

Feuilloley, Laurent (May 29, 2019), "Graphs defined by matchsticks, pennies and hinges", Discrete notes

doi.org

Cerioli, Marcia R.; Faria, Luerbio; Ferreira, Talita O.; Protti, Fábio (2011), "A note on maximum independent sets and minimum clique partitions in unit disk graphs and penny graphs: complexity and approximation", RAIRO Theoretical Informatics and Applications, 45 (3): 331–346, doi:10.1051/ita/2011106, MR 2836493
Csizmadia, G. (1998), "On the independence number of minimum distance graphs", Discrete & Computational Geometry, 20 (2): 179–187, doi:10.1007/PL00009381, MR 1637884
Veltkamp, Remco C. (1994), "2.2.1 Closest pairs", Closed Object Boundaries from Scattered Points, Lecture Notes in Computer Science, vol. 885, Berlin: Springer-Verlag, p. 12, doi:10.1007/3-540-58808-6, ISBN 3-540-58808-6
Eades, Peter; Whitesides, Sue (1996), "The logic engine and the realization problem for nearest neighbor graphs", Theoretical Computer Science, 169 (1): 23–37, doi:10.1016/S0304-3975(97)84223-5, MR 1424926
Pach, János; Agarwal, Pankaj K. (1995), Combinatorial Geometry, Wiley-Interscience Series in Discrete Mathematics and Optimization, New York: John Wiley & Sons, Inc., doi:10.1002/9781118033203, ISBN 0-471-58890-3, MR 1354145; see Theorem 13.12, p. 211.
Eppstein, David (2018), "Edge bounds and degeneracy of triangle-free penny graphs and squaregraphs", Journal of Graph Algorithms and Applications, 22 (3): 483–499, arXiv:1708.05152, doi:10.7155/jgaa.00463, MR 3866392
Gardner, Martin (March 1975), "From rubber ropes to rolling cubes, a miscellany of refreshing problems", Mathematical Games, Scientific American, 232 (3): 112–117, doi:10.1038/scientificamerican0375-112, JSTOR 24949757; see problem 7, "the colored poker chips", p. 114.
Baker, B. (1994), "Approximation algorithms for NP-complete problems on planar graphs", Journal of the ACM, 41 (1): 153–180, doi:10.1145/174644.174650, S2CID 9706753
Swanepoel, Konrad J. (2002), "Independence numbers of planar contact graphs", Discrete & Computational Geometry, 28 (4): 649–670, arXiv:math/0403023, doi:10.1007/s00454-002-2897-y, MR 1949907; Swanepoel's result strengthens an earlier $c \geq 9/35 \approx 0.257$ bound of Csizmadia (1998).
Dumitrescu, Adrian; Jiang, Minghui (June 2013), "Computational Geometry Column 56" (PDF), SIGACT News, 44 (2), New York, NY, US: ACM: 80–87, arXiv:cs/9908007, doi:10.1145/2491533.2491550, S2CID 52807205
Khuller, Samir; Matias, Yossi (1995), "A simple randomized sieve algorithm for the closest-pair problem", Information and Computation, 118 (1): 34–37, doi:10.1006/inco.1995.1049, MR 1329236
Bowen, Clinton; Durocher, Stephane; Löffler, Maarten; Rounds, Anika; Schulz, André; Tóth, Csaba D. (2015), "Realization of simply connected polygonal linkages and recognition of unit disk contact trees", in Giacomo, Emilio Di; Lubiw, Anna (eds.), Graph Drawing and Network Visualization: 23rd International Symposium, GD 2015, Los Angeles, CA, USA, September 24–26, 2015, Revised Selected Papers, Lecture Notes in Computer Science, vol. 9411, Springer, pp. 447–459, doi:10.1007/978-3-319-27261-0_37, ISBN 978-3-319-27260-3
Kitching, Matthew; Whitesides, Sue (2004), "The Three Dimensional Logic Engine", in Pach, János (ed.), Graph Drawing, 12th International Symposium, GD 2004, New York, NY, USA, September 29 - October 2, 2004, Revised Selected Papers, Lecture Notes in Computer Science, vol. 3383, Springer, pp. 329–339, doi:10.1007/978-3-540-31843-9_33, ISBN 978-3-540-24528-5
Bhore, Sujoy; Jain, Rahul (2021), "Space-efficient algorithms for reachability in directed geometric graphs", in Ahn, Hee-Kap; Sadakane, Kunihiko (eds.), 32nd International Symposium on Algorithms and Computation (ISAAC 2021), Leibniz International Proceedings in Informatics (LIPIcs), vol. 212, Dagstuhl, Germany: Schloss Dagstuhl – Leibniz-Zentrum für Informatik, pp. 63:1–63:17, doi:10.4230/LIPIcs.ISAAC.2021.63, ISBN 978-3-95977-214-3, S2CID 244731943
Horvat, Boris; Pisanski, Tomaž (2010), "Products of unit distance graphs", Discrete Mathematics, 310 (12): 1783–1792, doi:10.1016/j.disc.2009.11.035, MR 2610282

epfl.ch

infoscience.epfl.ch

Pach, János; Tóth, Géza (1996), "On the independence number of coin graphs", Geombinatorics, 6 (1): 30–33, MR 1392795

imfm.si

preprinti.imfm.si

Pisanski, Tomaž; Randić, Milan (2000), "Bridges between geometry and graph theory" (PDF), in Gorini, Catherine A. (ed.), Geometry at Work, MAA Notes, vol. 53, Cambridge University Press, pp. 174–194, MR 1782654; see especially p. 176

jstor.org

Gardner, Martin (March 1975), "From rubber ropes to rolling cubes, a miscellany of refreshing problems", Mathematical Games, Scientific American, 232 (3): 112–117, doi:10.1038/scientificamerican0375-112, JSTOR 24949757; see problem 7, "the colored poker chips", p. 114.

lse.ac.uk

personal.lse.ac.uk

Swanepoel, Konrad J. (2009), "Triangle-free minimum distance graphs in the plane" (PDF), Geombinatorics, 19 (1): 28–30, MR 2584434

numdam.org

Cerioli, Marcia R.; Faria, Luerbio; Ferreira, Talita O.; Protti, Fábio (2011), "A note on maximum independent sets and minimum clique partitions in unit disk graphs and penny graphs: complexity and approximation", RAIRO Theoretical Informatics and Applications, 45 (3): 331–346, doi:10.1051/ita/2011106, MR 2836493

semanticscholar.org

api.semanticscholar.org

Baker, B. (1994), "Approximation algorithms for NP-complete problems on planar graphs", Journal of the ACM, 41 (1): 153–180, doi:10.1145/174644.174650, S2CID 9706753
Dumitrescu, Adrian; Jiang, Minghui (June 2013), "Computational Geometry Column 56" (PDF), SIGACT News, 44 (2), New York, NY, US: ACM: 80–87, arXiv:cs/9908007, doi:10.1145/2491533.2491550, S2CID 52807205
Bhore, Sujoy; Jain, Rahul (2021), "Space-efficient algorithms for reachability in directed geometric graphs", in Ahn, Hee-Kap; Sadakane, Kunihiko (eds.), 32nd International Symposium on Algorithms and Computation (ISAAC 2021), Leibniz International Proceedings in Informatics (LIPIcs), vol. 212, Dagstuhl, Germany: Schloss Dagstuhl – Leibniz-Zentrum für Informatik, pp. 63:1–63:17, doi:10.4230/LIPIcs.ISAAC.2021.63, ISBN 978-3-95977-214-3, S2CID 244731943

uwm.edu

cs.uwm.edu

Dumitrescu, Adrian; Jiang, Minghui (June 2013), "Computational Geometry Column 56" (PDF), SIGACT News, 44 (2), New York, NY, US: ACM: 80–87, arXiv:cs/9908007, doi:10.1145/2491533.2491550, S2CID 52807205