%0 Journal Article %1 journals/jgaa/BannisterDEG15 %A Bannister, Michael J. %A Devanny, William E. %A Eppstein, David %A Goodrich, Michael T. %D 2015 %J J. Graph Algorithms Appl. %K dblp %N 2 %P 619-656 %T The Galois Complexity of Graph Drawing: Why Numerical Solutions are Ubiquitous for Force-Directed, Spectral, and Circle Packing Drawings. %U http://dblp.uni-trier.de/db/journals/jgaa/jgaa19.html#BannisterDEG15 %V 19

@article{journals/jgaa/BannisterDEG15, added-at = {2021-02-16T00:00:00.000+0100}, author = {Bannister, Michael J. and Devanny, William E. and Eppstein, David and Goodrich, Michael T.}, biburl = {https://www.bibsonomy.org/bibtex/2a323dabde2ae26c6adc4bbd35d5500b7/dblp}, ee = {https://doi.org/10.7155/jgaa.00349}, interhash = {0ccf8c55f1edfec415efb4b1e79cc271}, intrahash = {a323dabde2ae26c6adc4bbd35d5500b7}, journal = {J. Graph Algorithms Appl.}, keywords = {dblp}, number = 2, pages = {619-656}, timestamp = {2024-04-08T16:44:45.000+0200}, title = {The Galois Complexity of Graph Drawing: Why Numerical Solutions are Ubiquitous for Force-Directed, Spectral, and Circle Packing Drawings.}, url = {http://dblp.uni-trier.de/db/journals/jgaa/jgaa19.html#BannisterDEG15}, volume = 19, year = 2015 }