Bend minimization (English Wikipedia)

Analysis of information sources in references of the Wikipedia article "Bend minimization" in English language version.

refsWebsite

Global rank English rank

8doi.org

2^nd place

5ams.org

451^st place

277^th place

1psu.edu

207^th place

136^th place

ams.org

mathscinet.ams.org

Di Giacomo, Emilio; Didimo, Walter; Liotta, Giuseppe; Meijer, Henk (2011), "Area, curve complexity, and crossing resolution of non-planar graph drawings", Theory of Computing Systems, 49 (3): 565–575, doi:10.1007/s00224-010-9275-6, MR 2822838.
Eades, Peter; Hong, Seok-Hee; Poon, Sheung-Hung (2010), "On rectilinear drawing of graphs", Graph Drawing: 17th International Symposium, GD 2009, Chicago, IL, USA, September 22-25, 2009, Revised Papers, Lecture Notes in Computer Science, vol. 5849, Springer, pp. 232–243, doi:10.1007/978-3-642-11805-0_23, ISBN 978-3-642-11804-3, MR 2680455.
Garg, Ashim; Tamassia, Roberto (2001), "On the computational complexity of upward and rectilinear planarity testing", SIAM Journal on Computing, 31 (2): 601–625, doi:10.1137/S0097539794277123, MR 1861292.
Tamassia, Roberto (1987), "On embedding a graph in the grid with the minimum number of bends", SIAM Journal on Computing, 16 (3): 421–444, doi:10.1137/0216030, MR 0889400.
Cornelsen, Sabine; Karrenbauer, Andreas (2012), "Accelerated bend minimization", Journal of Graph Algorithms and Applications, 16 (3): 635–650, doi:10.7155/jgaa.00265, MR 2983428.

doi.org

Di Giacomo, Emilio; Didimo, Walter; Liotta, Giuseppe; Meijer, Henk (2011), "Area, curve complexity, and crossing resolution of non-planar graph drawings", Theory of Computing Systems, 49 (3): 565–575, doi:10.1007/s00224-010-9275-6, MR 2822838.
Purchase, Helen (1997), "Which aesthetic has the greatest effect on human understanding?", Graph Drawing: 5th International Symposium, GD '97 Rome, Italy, September 18–20, 1997, Proceedings, Lecture Notes in Computer Science, vol. 1353, pp. 248–261, doi:10.1007/3-540-63938-1_67, ISBN 978-3-540-63938-1.
Eades, Peter; Hong, Seok-Hee; Poon, Sheung-Hung (2010), "On rectilinear drawing of graphs", Graph Drawing: 17th International Symposium, GD 2009, Chicago, IL, USA, September 22-25, 2009, Revised Papers, Lecture Notes in Computer Science, vol. 5849, Springer, pp. 232–243, doi:10.1007/978-3-642-11805-0_23, ISBN 978-3-642-11804-3, MR 2680455.
Garg, Ashim; Tamassia, Roberto (2001), "On the computational complexity of upward and rectilinear planarity testing", SIAM Journal on Computing, 31 (2): 601–625, doi:10.1137/S0097539794277123, MR 1861292.
Tamassia, Roberto (1987), "On embedding a graph in the grid with the minimum number of bends", SIAM Journal on Computing, 16 (3): 421–444, doi:10.1137/0216030, MR 0889400.
Cornelsen, Sabine; Karrenbauer, Andreas (2012), "Accelerated bend minimization", Journal of Graph Algorithms and Applications, 16 (3): 635–650, doi:10.7155/jgaa.00265, MR 2983428.
Mutzel, Petra; Weiskircher, René (2002), "Bend minimization in orthogonal drawings using integer programming", Computing and Combinatorics: 8th Annual International Conference, COCOON 2002, Singapore, August 15–17, 2002, Proceedings, Lecture Notes in Computer Science, vol. 2387, pp. 484–493, CiteSeerX 10.1.1.138.1513, doi:10.1007/3-540-45655-4_52, ISBN 978-3-540-43996-7.
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, ISBN 978-3-642-03366-7.

psu.edu

citeseerx.ist.psu.edu

Mutzel, Petra; Weiskircher, René (2002), "Bend minimization in orthogonal drawings using integer programming", Computing and Combinatorics: 8th Annual International Conference, COCOON 2002, Singapore, August 15–17, 2002, Proceedings, Lecture Notes in Computer Science, vol. 2387, pp. 484–493, CiteSeerX 10.1.1.138.1513, doi:10.1007/3-540-45655-4_52, ISBN 978-3-540-43996-7.