#### Filter Results:

- Full text PDF available (150)

#### Publication Year

1978

2019

- This year (19)
- Last 5 years (59)
- Last 10 years (110)

#### Publication Type

#### Co-author

#### Journals and Conferences

Learn More

- Vida Dujmovic, David R. Wood
- Graph Drawing
- 2003

A three-dimensional grid drawing of a graph is a placement of the vertices at distinct points with integer coordinates, such that the straight line-segments representing the edges are pairwiseâ€¦ (More)

- Vida Dujmovic, David R. Wood
- Discrete Mathematics & Theoretical Computerâ€¦
- 2004

HAL is a multi-disciplinary open access archive for the deposit and dissemination of scientific research documents, whether they are published or not. The documents may come from teaching andâ€¦ (More)

- Vida Dujmovic, David Eppstein, Matthew Suderman, David R. Wood
- Comput. Geom.
- 2007

We study straight-line drawings of planar graphs with few segments and few slopes. Optimal results are obtained for all trees. Tight bounds are obtained for outerplanar graphs, 2-trees, and planarâ€¦ (More)

- Vida Dujmovic, David R. Wood
- Discrete Mathematics & Theoretical Computerâ€¦
- 2005

A k-stack layout(respectively,k-queue layout ) of a graph consists of a total order of the vertices, and a partition of the edges intok sets of non-crossing (non-nested) edges with respect to theâ€¦ (More)

- JosÃ© CÃ¡ceres, M. Carmen Hernando, +4 authors David R. Wood
- SIAM J. Discrete Math.
- 2007

A set S of vertices in a graph G resolves G if every vertex is uniquely determined by its vector of distances to the vertices in S. The metric dimension of G is the minimum cardinality of a resolvingâ€¦ (More)

- Bruce A. Reed, David R. Wood
- Eur. J. Comb.
- 2012

Robertson and Seymour proved that every graph with sufficiently large treewidth contains a large grid minor. However, the best known bound on the treewidth that forces an l Ã— l grid minor isâ€¦ (More)

- Jan KÃ¡ra, Attila PÃ³r, David R. Wood
- Discrete & Computational Geometry
- 2005

The visibility graph V(P) of a point set P âŠ† R2 has vertex set P , such that two points v,w âˆˆ P are adjacent whenever there is no other point in P on the line segment between v and w. We study theâ€¦ (More)

- Bruce A. Reed, David R. Wood
- ACM Trans. Algorithms
- 2009

Let <i>G</i> be an <i>n</i>-vertex <i>m</i>-edge graph with weighted vertices. A pair of vertex sets <i>A</i>, <i>B</i> âŠ† <i>V</i>(<i>G</i>) is a 2/3<i>-separation</i> of <i>order</i> |<i>A</i> âˆ©â€¦ (More)

- Vida Dujmovic, David R. Wood
- WG
- 2003

A tree-partition of a graph is a partition of its vertices into â€˜bagsâ€™ such that contracting each bag into a single vertex gives a forest. It is proved that every k-tree has a tree-partition suchâ€¦ (More)

- M. Carmen Hernando, MercÃ¨ Mora, Ignacio M. Pelayo, Carlos Seara, David R. Wood
- Electronic Notes in Discrete Mathematics
- 2007

A set of vertices S resolves a connected graph G if every vertex is uniquely determined by its vector of distances to the vertices in S. The metric dimension of G is the minimum cardinality of aâ€¦ (More)