( en | de | ru )

 

Disambiguation of "Wood, David R."

Author of the publication

copydeleteadd this publication to your clipboard
Every Large Point Set contains Many Collinear Points or an Empty Pentagon.

, , , , , , , , , and . CCCG, page 99-102. (2009)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

David R Anderson

David R Wenger

Gerald Wood

Timothy Wood

Dean Wood

 

Other publications of authors with the same name

Dimension-Exchange Algorithms for Load Balancing on Trees., , and . SIROCCO, volume 13 of Proceedings in Informatics, page 181-196. Carleton Scientific, (2002)Three-Dimensional Orthogonal Graph Drawing with Optimal Volume., , and . Algorithmica, 44 (3): 233-255 (2006)Thickness and Antithickness of Graphs., and . CoRR, (2017)Layered Separators in Minor-Closed Families with Applications., , and . CoRR, (2013)Layouts of Graph Subdivisions., and . GD, volume 3383 of Lecture Notes in Computer Science, page 133-143. Springer, (2004)Really Straight Graph Drawings., , and . GD, volume 3383 of Lecture Notes in Computer Science, page 122-132. Springer, (2004)Planar Decompositions and the Crossing Number of Graphs with an Excluded Minor., and . GD, volume 4372 of Lecture Notes in Computer Science, page 150-161. Springer, (2006)Separating layered treewidth and row treewidth., , , , and . Discret. Math. Theor. Comput. Sci., (2022)Minor-Closed Graph Classes with Bounded Layered Pathwidth., , , , and . SIAM J. Discret. Math., 34 (3): 1693-1709 (2020)Improved upper bounds on the crossing number., , , and . SCG, page 375-384. ACM, (2008)