Prof David Wood

Research Overview

I am a member of the Monash Discrete Mathematics Research Group. My research interests are in discrete mathematics and theoretical computer science, especially structural graph theory, extremal graph theory, geometric graph theory, graph colouring, poset dimension, graph drawing, and combinatorial geometry. I collaborate with a broad network of international researchers.

Selected Publications

[1] Dujmovic, Vida ; Joret, Gwenael ; Micek, Piotr ; Morin, Pat ; Ueckerdt, Torsten ; Wood, David. "Planar graphs have bounded queue-number". Proceedings - 2019 IEEE 60th Annual Symposium on Foundations of Computer Science, FOCS 2019: 60th IEEE Annual Symposium on Foundations of Computer Science, FOCS 2019; Baltimore; United States; 9 November 2019 through 12 November 2019. Piscataway NJ USA : IEEE Computer Society, 2020. pp. 862-875 (Proceedings - Annual IEEE Symposium on Foundations of Computer Science, FOCS).

[2] Dujmović, Vida ; Esperet, Louis ; Joret, Gwenaël ; Walczak, Bartosz ; Wood, David. "Planar graphs have bounded nonrepetitive chromatic number". In: Advances in Combinatorics. 2020 ; Vol. 5.

[3] Scott, Alex D ; Wood, David R. "Better bounds for poset dimension and boxicity". In: Transactions of the American Mathematical Society. 2020 ; Vol. 373, No. 3. pp. 2157-2172.

[4] Norin, Sergey ; Scott, Alex ; Seymour, Paul D. ; Wood, David R. "Clustered Colouring in Minor-Closed Classes". In: Combinatorica. 2019 ; Vol. 39, No. 6. pp. 1387-1412.

[5] van den Heuvel, Jan ; Wood, David R. "Improper colourings inspired by Hadwiger's conjecture". In: Journal of the London Mathematical Society. 2018 ; Vol. 98, No. 1. pp. 129-148.