Please log in to take part in the discussion (add own reviews or comments).
Cite this publication
More citation styles
- please select -
%0 Conference Paper
%1 conf/gd/EverettLLW07
%A Everett, Hazel
%A Lazard, Sylvain
%A Liotta, Giuseppe
%A Wismath, Stephen K.
%B Graph Drawing
%D 2007
%E Hong, Seok-Hee
%E Nishizeki, Takao
%E Quan, Wu
%I Springer
%K dblp
%P 345-351
%T Universal Sets of n Points for 1-Bend Drawings of Planar Graphs with n Vertices.
%U http://dblp.uni-trier.de/db/conf/gd/gd2007.html#EverettLLW07
%V 4875
%@ 978-3-540-77536-2
@inproceedings{conf/gd/EverettLLW07,
added-at = {2019-06-02T00:00:00.000+0200},
author = {Everett, Hazel and Lazard, Sylvain and Liotta, Giuseppe and Wismath, Stephen K.},
biburl = {https://puma.ub.uni-stuttgart.de/bibtex/26b671db79aec73d9e7cd7240cff19d4c/dblp},
booktitle = {Graph Drawing},
crossref = {conf/gd/2007},
editor = {Hong, Seok-Hee and Nishizeki, Takao and Quan, Wu},
ee = {https://www.wikidata.org/entity/Q62042569},
interhash = {9cd7551b66d2cd5a11f4f547743deafc},
intrahash = {6b671db79aec73d9e7cd7240cff19d4c},
isbn = {978-3-540-77536-2},
keywords = {dblp},
pages = {345-351},
publisher = {Springer},
series = {Lecture Notes in Computer Science},
timestamp = {2019-09-27T16:17:07.000+0200},
title = {Universal Sets of n Points for 1-Bend Drawings of Planar Graphs with n Vertices.},
url = {http://dblp.uni-trier.de/db/conf/gd/gd2007.html#EverettLLW07},
volume = 4875,
year = 2007
}