Angular resolution (graph drawing) (English Wikipedia)

Analysis of information sources in references of the Wikipedia article "Angular resolution (graph drawing)" in English language version.

refsWebsite

Global rank English rank

10doi.org

2^nd place

4ams.org

451^st place

277^th place

3arxiv.org

69^th place

59^th place

2handle.net

102^nd place

76^th place

1semanticscholar.org

11^th place

8^th place

ams.org

mathscinet.ams.org

Malitz & Papakostas (1994); Garg & Tamassia (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. Garg, Ashim; Tamassia, Roberto (1994), "Planar drawings and angular resolution: Algorithms and bounds", Algorithms, Second Annual European Symposium, Utrecht, The Netherlands, September 26–28, 1994, Proceedings, Lecture Notes in Computer Science, vol. 855, Springer-Verlag, pp. 12–23, doi:10.1007/BFb0049393.
Kramer & Kramer (2008); Molloy & Salavatipour (2005). Kramer, Florica; Kramer, Horst (2008), "A survey on the distance-colouring of graphs", Discrete Mathematics, 308 (2–3): 422–426, doi:10.1016/j.disc.2006.11.059, MR 2378044. Molloy, Michael; Salavatipour, Mohammad R. (2005), "A bound on the chromatic number of the square of a planar graph", Journal of Combinatorial Theory, Series B, 94 (2): 189–213, doi:10.1016/j.jctb.2004.12.005, hdl:1807/9473, MR 2145512.
Formann et al. (1993); Garg & Tamassia (1995). Formann, M.; Hagerup, T.; Haralambides, J.; Kaufmann, M.; Leighton, F. T.; Symvonis, A.; Welzl, E.; Woeginger, G. (1993), "Drawing graphs in the plane with high resolution", SIAM Journal on Computing, 22 (5): 1035–1052, doi:10.1137/0222063, MR 1237161. Garg, Ashim; Tamassia, Roberto (1995), "On the computational complexity of upward and rectilinear planarity testing", in Tamassia, Roberto; Tollis, Ioannis (eds.), Graph Drawing, Lecture Notes in Computer Science, vol. 894, Springer Berlin / Heidelberg, pp. 286–297, doi:10.1007/3-540-58950-3_384.
Kant (1996); Gutwenger & Mutzel (1998). Kant, G. (1996), "Drawing planar graphs using the canonical ordering", Algorithmica, 16 (1): 4–32, doi:10.1007/s004539900035, hdl:1874/16676, MR 1394492. Gutwenger, Carsten; Mutzel, Petra (1998), "Planar polyline drawings with good angular resolution", Graph drawing (Montréal, QC, 1998), Lecture Notes in Comput. Sci., vol. 1547, Berlin: Springer, pp. 167–182, doi:10.1007/3-540-37623-2_13, MR 1717450.

arxiv.org

Duncan et al. (2011); Halupczok & Schulz (2011). Duncan, Christian A.; Eppstein, David; Goodrich, Michael T.; Kobourov, Stephen G.; Nöllenburg, Martin (2011), "Drawing trees with perfect angular resolution and polynomial area", in Brandes, Ulrik; Cornelsen, Sabine (eds.), Proc. 18th Int. Symp. Graph Drawing, Lecture Notes in Computer Science, vol. 6502, Springer-Verlag, pp. 183–194, arXiv:1009.0581, doi:10.1007/978-3-642-18469-7_17. Halupczok, Immanuel; Schulz, André (2011), "Pinning balloons with perfect angles and optimal area", Proceedings of the 19th International Symposium on Graph Drawing.
Carlson & Eppstein (2007); Eppstein & Wortman (2011). Carlson, Josiah; Eppstein, David (2007), "Trees with convex faces and optimal angles", in Kaufmann, Michael; Wagner, Dorothea (eds.), Proc. 14th Int. Symp. Graph Drawing (GD'06), LNCS, vol. 4372, Springer-Verlag, pp. 77–88, arXiv:cs.CG/0607113, doi:10.1007/978-3-540-70904-6_9, S2CID 12598338. Eppstein, D.; Wortman, K. (2011), "Optimal angular resolution for face-symmetric drawings", Journal of Graph Algorithms and Applications, 15 (4): 551–564, arXiv:0907.5474, doi:10.7155/jgaa.00238, S2CID 10356432.
Cheng et al. (1999); Duncan et al. (2011). Cheng, C. C.; Duncan, C. A.; Goodrich, M. T.; Kobourov, S. G. (1999), "Drawing planar graphs with circular arcs", Graph Drawing, 7th International Symposium, GD'99, Štirín Castle, Czech Republic September 15–19, 1999, Proceedings, Lecture Notes in Computer Science, vol. 1731, Springer-Verlag, pp. 117–126, doi:10.1007/3-540-46648-7_12. Duncan, Christian A.; Eppstein, David; Goodrich, Michael T.; Kobourov, Stephen G.; Nöllenburg, Martin (2011), "Drawing trees with perfect angular resolution and polynomial area", in Brandes, Ulrik; Cornelsen, Sabine (eds.), Proc. 18th Int. Symp. Graph Drawing, Lecture Notes in Computer Science, vol. 6502, Springer-Verlag, pp. 183–194, arXiv:1009.0581, doi:10.1007/978-3-642-18469-7_17.

doi.org

Duncan et al. (2011); Halupczok & Schulz (2011). Duncan, Christian A.; Eppstein, David; Goodrich, Michael T.; Kobourov, Stephen G.; Nöllenburg, Martin (2011), "Drawing trees with perfect angular resolution and polynomial area", in Brandes, Ulrik; Cornelsen, Sabine (eds.), Proc. 18th Int. Symp. Graph Drawing, Lecture Notes in Computer Science, vol. 6502, Springer-Verlag, pp. 183–194, arXiv:1009.0581, doi:10.1007/978-3-642-18469-7_17. Halupczok, Immanuel; Schulz, André (2011), "Pinning balloons with perfect angles and optimal area", Proceedings of the 19th International Symposium on Graph Drawing.
Malitz & Papakostas (1994); Garg & Tamassia (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. Garg, Ashim; Tamassia, Roberto (1994), "Planar drawings and angular resolution: Algorithms and bounds", Algorithms, Second Annual European Symposium, Utrecht, The Netherlands, September 26–28, 1994, Proceedings, Lecture Notes in Computer Science, vol. 855, Springer-Verlag, pp. 12–23, doi:10.1007/BFb0049393.
Kramer & Kramer (2008); Molloy & Salavatipour (2005). Kramer, Florica; Kramer, Horst (2008), "A survey on the distance-colouring of graphs", Discrete Mathematics, 308 (2–3): 422–426, doi:10.1016/j.disc.2006.11.059, MR 2378044. Molloy, Michael; Salavatipour, Mohammad R. (2005), "A bound on the chromatic number of the square of a planar graph", Journal of Combinatorial Theory, Series B, 94 (2): 189–213, doi:10.1016/j.jctb.2004.12.005, hdl:1807/9473, MR 2145512.
Garg & Tamassia (1994). Garg, Ashim; Tamassia, Roberto (1994), "Planar drawings and angular resolution: Algorithms and bounds", Algorithms, Second Annual European Symposium, Utrecht, The Netherlands, September 26–28, 1994, Proceedings, Lecture Notes in Computer Science, vol. 855, Springer-Verlag, pp. 12–23, doi:10.1007/BFb0049393.
Formann et al. (1993); Garg & Tamassia (1995). Formann, M.; Hagerup, T.; Haralambides, J.; Kaufmann, M.; Leighton, F. T.; Symvonis, A.; Welzl, E.; Woeginger, G. (1993), "Drawing graphs in the plane with high resolution", SIAM Journal on Computing, 22 (5): 1035–1052, doi:10.1137/0222063, MR 1237161. Garg, Ashim; Tamassia, Roberto (1995), "On the computational complexity of upward and rectilinear planarity testing", in Tamassia, Roberto; Tollis, Ioannis (eds.), Graph Drawing, Lecture Notes in Computer Science, vol. 894, Springer Berlin / Heidelberg, pp. 286–297, doi:10.1007/3-540-58950-3_384.
Carlson & Eppstein (2007); Eppstein & Wortman (2011). Carlson, Josiah; Eppstein, David (2007), "Trees with convex faces and optimal angles", in Kaufmann, Michael; Wagner, Dorothea (eds.), Proc. 14th Int. Symp. Graph Drawing (GD'06), LNCS, vol. 4372, Springer-Verlag, pp. 77–88, arXiv:cs.CG/0607113, doi:10.1007/978-3-540-70904-6_9, S2CID 12598338. Eppstein, D.; Wortman, K. (2011), "Optimal angular resolution for face-symmetric drawings", Journal of Graph Algorithms and Applications, 15 (4): 551–564, arXiv:0907.5474, doi:10.7155/jgaa.00238, S2CID 10356432.
Kant (1996); Gutwenger & Mutzel (1998). Kant, G. (1996), "Drawing planar graphs using the canonical ordering", Algorithmica, 16 (1): 4–32, doi:10.1007/s004539900035, hdl:1874/16676, MR 1394492. Gutwenger, Carsten; Mutzel, Petra (1998), "Planar polyline drawings with good angular resolution", Graph drawing (Montréal, QC, 1998), Lecture Notes in Comput. Sci., vol. 1547, Berlin: Springer, pp. 167–182, doi:10.1007/3-540-37623-2_13, MR 1717450.
Cheng et al. (1999); Duncan et al. (2011). Cheng, C. C.; Duncan, C. A.; Goodrich, M. T.; Kobourov, S. G. (1999), "Drawing planar graphs with circular arcs", Graph Drawing, 7th International Symposium, GD'99, Štirín Castle, Czech Republic September 15–19, 1999, Proceedings, Lecture Notes in Computer Science, vol. 1731, Springer-Verlag, pp. 117–126, doi:10.1007/3-540-46648-7_12. Duncan, Christian A.; Eppstein, David; Goodrich, Michael T.; Kobourov, Stephen G.; Nöllenburg, Martin (2011), "Drawing trees with perfect angular resolution and polynomial area", in Brandes, Ulrik; Cornelsen, Sabine (eds.), Proc. 18th Int. Symp. Graph Drawing, Lecture Notes in Computer Science, vol. 6502, Springer-Verlag, pp. 183–194, arXiv:1009.0581, doi:10.1007/978-3-642-18469-7_17.
Brandes, Shubina & Tamassia (2000); Finkel & Tamassia (2005). Finkel, Benjamin; Tamassia, Roberto (2005), "Curvilinear graph drawing using the force-directed method", 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-Verlag, pp. 448–453, doi:10.1007/978-3-540-31843-9_46.
Didimo, Eades & Liotta (2009). Didimo, Walter; Eades, Peter; Liotta, Giuseppe (2009), "Drawing graphs with right angle crossings", Algorithms and Data Structures: 11th International Symposium, WADS 2009, Banff, Canada, August 21-23, 2009. Proceedings, Lecture Notes in Computer Science, vol. 5664, pp. 206–217, doi:10.1007/978-3-642-03367-4_19.

handle.net

hdl.handle.net

Kramer & Kramer (2008); Molloy & Salavatipour (2005). Kramer, Florica; Kramer, Horst (2008), "A survey on the distance-colouring of graphs", Discrete Mathematics, 308 (2–3): 422–426, doi:10.1016/j.disc.2006.11.059, MR 2378044. Molloy, Michael; Salavatipour, Mohammad R. (2005), "A bound on the chromatic number of the square of a planar graph", Journal of Combinatorial Theory, Series B, 94 (2): 189–213, doi:10.1016/j.jctb.2004.12.005, hdl:1807/9473, MR 2145512.
Kant (1996); Gutwenger & Mutzel (1998). Kant, G. (1996), "Drawing planar graphs using the canonical ordering", Algorithmica, 16 (1): 4–32, doi:10.1007/s004539900035, hdl:1874/16676, MR 1394492. Gutwenger, Carsten; Mutzel, Petra (1998), "Planar polyline drawings with good angular resolution", Graph drawing (Montréal, QC, 1998), Lecture Notes in Comput. Sci., vol. 1547, Berlin: Springer, pp. 167–182, doi:10.1007/3-540-37623-2_13, MR 1717450.

semanticscholar.org

api.semanticscholar.org

Carlson & Eppstein (2007); Eppstein & Wortman (2011). Carlson, Josiah; Eppstein, David (2007), "Trees with convex faces and optimal angles", in Kaufmann, Michael; Wagner, Dorothea (eds.), Proc. 14th Int. Symp. Graph Drawing (GD'06), LNCS, vol. 4372, Springer-Verlag, pp. 77–88, arXiv:cs.CG/0607113, doi:10.1007/978-3-540-70904-6_9, S2CID 12598338. Eppstein, D.; Wortman, K. (2011), "Optimal angular resolution for face-symmetric drawings", Journal of Graph Algorithms and Applications, 15 (4): 551–564, arXiv:0907.5474, doi:10.7155/jgaa.00238, S2CID 10356432.