%0 Conference Paper %1 conf/gd/BannisterDEG14 %A Bannister, Michael J. %A Devanny, William E. %A Eppstein, David %A Goodrich, Michael T. %B GD %D 2014 %E Duncan, Christian A. %E Symvonis, Antonios %I Springer %K dblp %P 149-161 %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/conf/gd/gd2014.html#BannisterDEG14 %V 8871 %@ 978-3-662-45802-0

@inproceedings{conf/gd/BannisterDEG14, added-at = {2022-11-13T00: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/2f0a0d49a8068f1ca4f8937efeaf58a97/dblp}, booktitle = {GD}, crossref = {conf/gd/2014}, editor = {Duncan, Christian A. and Symvonis, Antonios}, ee = {https://doi.org/10.1007/978-3-662-45803-7_13}, interhash = {f67c892bc6f9192dd5986efddf44205b}, intrahash = {f0a0d49a8068f1ca4f8937efeaf58a97}, isbn = {978-3-662-45802-0}, keywords = {dblp}, pages = {149-161}, publisher = {Springer}, series = {Lecture Notes in Computer Science}, timestamp = {2024-04-09T20:16:07.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/conf/gd/gd2014.html#BannisterDEG14}, volume = 8871, year = 2014 }