#### Filter Results:

- Full text PDF available (96)

#### Publication Year

1999

2018

- This year (7)
- Last 5 years (39)
- Last 10 years (79)

#### Publication Type

#### Co-author

#### Journals and Conferences

Learn 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
- 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

In a total order of the vertices of a graph, two edges with no en dpoint in common can be crossing, nested, or disjoint. A k-stack(respectively,k-queue, k-arch) layout of a graph consists of a totalâ€¦ (More)

- Vida Dujmovic, Pat Morin, David R. Wood
- SIAM J. Comput.
- 2005

A queue layout of a graph consists of a total order of the vertices, and a partition of the edges into queues, such that no two edges in the same queue are nested. The minimum number of queues in aâ€¦ (More)

- Vida Dujmovic, Sue Whitesides
- Algorithmica
- 2002

We give an O(Ï†k Â· n2) fixed parameter tractable algorithm for the 1-Sided Crossing Minimization. The constant Ï† in the running time is the golden ratio Ï† = (1+âˆš5)/2 â‰ˆ 1.618. The constant k is theâ€¦ (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 (after deleting loops and replacing parallel edges by aâ€¦ (More)

- Prosenjit Bose, Vida Dujmovic, Ferran Hurtado, Stefan Langerman, Pat Morin, David R. Wood
- Discrete & Computational Geometry
- 2008

To untangle a geometric graph means to move some of the vertices so that the resulting geometric graph has no crossings. Pach and Tardos [Discrete Comput. Geom., 2002] asked if every n-vertexâ€¦ (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 par tition of the edges intok sets of non-crossing (non-nested) edges with respect to theâ€¦ (More)

- HervÃ© BrÃ¶nnimann, Olivier Devillers, +6 authors Sue Whitesides
- SIAM J. Comput.
- 2007

Motivated by visibility problems in three dimensions, we inve stigate the complexity and construction of the set of tangent lines in a scene of three-dimensional pol yhedra. We prove that the set ofâ€¦ (More)

- Vida Dujmovic, Mike Fellows, +9 authors David R. Wood
- 2001

A bipartite graph is biplanar if the vertices can be placed on two parallel lines (layers) in the plane such that there are no edge crossings when edges are drawn as line segments between the layers.â€¦ (More)