D. Wood | Semantic Scholar

Publications
Influence

On the Metric Dimension of Cartesian Products of Graphs

J. Cáceres, M. Hernando, D. Wood
Mathematics
SIAM J. Discret. Math.
26 July 2005

It is proved that the metric dimension of G\,\square\,G$ is tied in a strong sense to the minimum order of a so-called doubly resolving set in $G$.

View PDF on arXiv

Extremal Graph Theory for Metric Dimension and Diameter

M. Hernando, M. Mora, I. Pelayo, C. Seara, D. Wood
Mathematics
Electron. J. Comb.
7 May 2007

The first contribution is to characterize the graphs in Gβ,D with order β+D for all values of β and D and to determine the maximum order of a graph in the set of graphs with metric dimension β and diameter D.

View PDF on arXiv

On Linear Layouts of Graphs

V. Dujmovic, D. Wood
Mathematics
Discret. Math. Theor. Comput. Sci.
2004

This is the first paper to investigate arch layouts, and characterisation of k-arch graphs as the \emphalmost (k+1)-colourable graphs; that is, the graphs G with a set S of at most k vertices, such that G S is (k-1-colourable.

View Paper

Layout of Graphs with Bounded Tree-Width

V. Dujmovic, Pat Morin, D. Wood
Mathematics
SIAM J. Comput.
16 June 2004

It is proved that the queue-number is bounded by the tree-width, thus resolving an open problem due to Ganley and Heath and disproving a conjecture of Pemmaraju.

View PDF on arXiv

Stacks, Queues and Tracks: Layouts of Graph Subdivisions

V. Dujmovic, D. Wood
Mathematics
Discret. Math. Theor. Comput. Sci.
2005

The best known upper bound on the number of division vertices per edge in a 3-stack subdivision of an n-vertex graph G is improved from O(log n) to O (log min\sn(G),qn(G) ), which reduces the question of whether queue-number is bounded by stack-number to whether 3- stack graphs have bounded queue number.

View Paper

Drawings of planar graphs with few slopes and segments

V. Dujmovic, D. Eppstein, M. Suderman, D. Wood
Mathematics
Comput. Geom.
19 June 2006

View PDF on arXiv

Notes on Nonrepetitive Graph Colouring

J. Barát, D. Wood
Mathematics
Electron. J. Comb.
26 September 2005

It is proved that every graph with treewidth $k$ and maximum degree $\Delta$ has a $O(k\Delta)$-colouring that is nonrepetitive on paths, and a “O( k\Delta^3)”-colours that isNonre petitive on walks.

View PDF on arXiv

An algorithm for finding a maximum clique in a graph

D. Wood
Mathematics
Oper. Res. Lett.
1997

View via Publisher

Track Layouts of Graphs

V. Dujmovic, A. Pór, D. Wood
Computer Science
Discret. Math. Theor. Comput. Sci.
13 July 2004

This thesis introduces and comprehensively study so-called track layouts of graphs and their subdivisions, and establishes that graphs of bounded treewidth have three-dimensional straight-line grid drawings with linear volume.

View PDF on arXiv

Planar Graphs have Bounded Queue-Number

V. Dujmovic, G. Joret, Piotr Micek, Pat Morin, T. Ueckerdt, D. Wood
Mathematics
IEEE 60th Annual Symposium on Foundations of…
9 April 2019

It is proved that every proper minor-closed class of graphs has bounded queue-number, and it is shown that every planar graph is a subgraph of the strong product of a path with some graph of bounded treewidth.

View on ACM