Research output per year
Research output per year
Vida Dujmović, David R. Wood
Research output: Chapter in Book/Report/Conference proceeding › Conference Paper › Research › peerreview
A threedimensional grid drawing of a graph is a placement of the vertices at distinct points with integer coordinates, such that the straight linesegments representing the edges are pairwise noncrossing. A O(n ^{3/2}) volume bound is proved for threedimensional grid drawings of graphs with bounded degree, graphs with bounded genus, and graphs with no bounded complete graph as a minor. The previous best bound for these graph families was O(n^{2}). These results (partially) solve open problems due to Pach, Thiele, and Tóth [Graph Drawing 1997] and Felsner, Liotta, and Wismath [Graph Drawing 2001].
Original language  English 

Title of host publication  Graph Drawing 
Subtitle of host publication  11th International Symposium, GD 2003 Perugia, Italy, September 2124, 2003 Revised Papers 
Editors  Giuseppe Liotta 
Place of Publication  Berlin Germany 
Publisher  Springer 
Pages  190201 
Number of pages  12 
ISBN (Print)  3540208313 
DOIs  
Publication status  Published  2004 
Externally published  Yes 
Event  Graph Drawing 2003  Perugia, Italy Duration: 21 Sep 2003 → 24 Sep 2003 Conference number: 11th https://link.springer.com/book/10.1007/b94919 (Proceedings) 
Name  Lecture Notes in Computer Science 

Publisher  Springer 
Volume  2912 
ISSN (Print)  03029743 
Conference  Graph Drawing 2003 

Abbreviated title  GD 2003 
Country  Italy 
City  Perugia 
Period  21/09/03 → 24/09/03 
Internet address 

Research output: Chapter in Book/Report/Conference proceeding › Chapter (Book) › Research › peerreview