Search Results - "Wood, David R"

Towards a new framework for evaluating systemic problem structuring methods by Midgley, Gerald, Cavana, Robert Y., Brocklesby, John, Foote, Jeff L., Wood, David R.R., Ahuriri-Driscoll, Annabel

“…► Provides a new evaluation framework for systemic problem structuring methods. ► Integrates case study and comparative evaluation approaches. ► Provides a…”
Get full text

Separating layered treewidth and row treewidth by Bose, Prosenjit, Dujmović, Vida, Javarsineh, Mehrnoosh, Morin, Pat, Wood, David R.

“…Layered treewidth and row treewidth are recently introduced graph parameters that have been key ingredients in the solution of several well-known open…”
Get full text

Improved product structure for graphs on surfaces by Distel, Marc, Hickingbotham, Robert, Huynh, Tony, Wood, David R.

“…Dujmovi\'c, Joret, Micek, Morin, Ueckerdt and Wood [J. ACM 2020] proved that for every graph $G$ with Euler genus $g$ there is a graph $H$ with treewidth at…”
Get full text

Disparities in the Management of Newly Diagnosed Paroxysmal Supraventricular Tachycardia for Women Versus Men in the United States by Sacks, Naomi C, Everson, Katie, Emden, Maia R, Cyr, Phillip L, Wood, David R, Raza, Sajjad, Wood, Kathryn A, Pokorney, Sean D

“…Background Information on differences in paroxysmal supraventricular tachycardia (PSVT) diagnosis, healthcare resource use, expenditures, and treatment among…”
Get full text

Treewidth of Cartesian Products of Highly Connected Graphs by Wood, David R.

“…The following theorem is proved: for all k‐connected graphs G and H each with at least n vertices, the treewidth of the cartesian product of G and H is at…”
Get full text

Graph Treewidth and Geometric Thickness Parameters by Dujmovic, Vida, Wood, David R.

“…Consider a drawing of a graph G in the plane such that crossing edges are coloured differently. The minimum number of colours, taken over all drawings of G, is…”
Get full text

Parameters Tied to Treewidth by Harvey, Daniel J., Wood, David R.

“…Treewidth is a graph parameter of fundamental importance to algorithmic and structural graph theory. This article surveys several graph parameters tied to…”
Get full text

Defective coloring of hypergraphs by Girão, António, Illingworth, Freddie, Scott, Alex, Wood, David R.

“…We prove that the vertices of every (r+1)$$ \left(r+1\right) $$‐uniform hypergraph with maximum degree Δ$$ \Delta $$ may be colored with cΔd+11/r$$…”
Get full text

Track Layouts, Layered Path Decompositions, and Leveled Planarity by Bannister, Michael J., Devanny, William E., Dujmović, Vida, Eppstein, David, Wood, David R.

“…We investigate two types of graph layouts, track layouts and layered path decompositions, and the relations between their associated parameters track-number…”
Get full text

The product structure of squaregraphs by Hickingbotham, Robert, Jungeblut, Paul, Merker, Laura, Wood, David R.

“…A squaregraph is a plane graph in which each internal face is a 4‐cycle and each internal vertex has degree at least 4. This paper proves that every…”
Get full text

A Polynomial Bound for Untangling Geometric Planar Graphs by Bose, Prosenjit, Dujmović, Vida, Hurtado, Ferran, Langerman, Stefan, Morin, Pat, Wood, David R.

“…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…”
Get full text

On the number of maximal independent sets in a graph by Wood, David R.

“…Combinatorics Miller and Muller (1960) and independently Moon and Moser (1965) determined the maximum number of maximal independent sets in an n-vertex graph…”
Get full text

Nonrepetitive colouring via entropy compression by Dujmović, Vida, Joret, Gwenaël, Kozik, Jakub, Wood, David R.

“…A vertex colouring of a graph is nonrepetitive if there is no path whose first half receives the same sequence of colours as the second half. A graph is…”
Get full text

Stack-Number is Not Bounded by Queue-Number by Dujmović, Vida, Eppstein, David, Hickingbotham, Robert, Morin, Pat, Wood, David R.

“…We describe a family of graphs with queue-number at most 4 but unbounded stack-number. This resolves open problems of Heath, Leighton and Rosenberg (1992) and…”
Get full text

On Linear Layouts of Graphs by Dujmović, Vida, Wood, David R.

“…In a total order of the vertices of a graph, two edges with no endpoint in common can be \emphcrossing, \emphnested, or \emphdisjoint. A \emphk-stack…”
Get full text

Stacks, Queues and Tracks: Layouts of Graph Subdivisions by Dujmović, Vida, Wood, David R.

“…A \emphk-stack layout (respectively, \emphk-queuelayout) of a graph consists of a total order of the vertices, and a partition of the edges into k sets of…”
Get full text

Clustered Colouring in Minor-Closed Classes by Norin, Sergey, Scott, Alex, Seymour, Paul, Wood, David R.

“…The clustered chromatic number of a class of graphs is the minimum integer k such that for some integer c every graph in the class is k -colourable with…”
Get full text

Three-Dimensional Graph Products with Unbounded Stack-Number by Eppstein, David, Hickingbotham, Robert, Merker, Laura, Norin, Sergey, Seweryn, Michał T., Wood, David R.

“…We prove that the stack-number of the strong product of three n -vertex paths is Θ ( n 1 / 3 ) . The best previously known upper bound was O ( n ). No…”
Get full text

Nonrepetitive colorings of graphs excluding a fixed immersion or topological minor by Wollan, Paul, Wood, David R.

“…We prove that graphs excluding a fixed immersion have bounded nonrepetitive chromatic number. More generally, we prove that if H is a fixed planar graph that…”
Get full text

A variant of the Erdős‐Sós conjecture by Havet, Frédéric, Reed, Bruce, Stein, Maya, Wood, David R.

“…A well‐known conjecture of Erdős and Sós states that every graph with average degree exceeding m−1 contains every tree with m edges as a subgraph. We propose a…”
Get full text