Zobrazeno 1 - 10
of 447
pro vyhledávání: '"David R. Wood"'
Publikováno v:
Discrete Mathematics & Theoretical Computer Science, Vol vol. 24, no 2, Iss Graph Theory (2022)
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 most 4 and a path $P$ such that $G\subseteq H \boxtimes P \boxtimes K_{\max\{2g,3\}}$. We imp
Externí odkaz:
https://doaj.org/article/3d827bc07849483c8334d4642b97daf4
Publikováno v:
Discrete Mathematics & Theoretical Computer Science, Vol vol. 24, no. 1, Iss Graph Theory (2022)
Layered treewidth and row treewidth are recently introduced graph parameters that have been key ingredients in the solution of several well-known open problems. It follows from the definitions that the layered treewidth of a graph is at most its row
Externí odkaz:
https://doaj.org/article/d23df7fef3614138ab44ebc16c748c5b
Autor:
Naomi C. Sacks, Katie Everson, Maia R. Emden, Phillip L. Cyr, David R. Wood, Sajjad Raza, Kathryn A. Wood, Sean D. Pokorney
Publikováno v:
Journal of the American Heart Association: Cardiovascular and Cerebrovascular Disease, Vol 9, Iss 19 (2020)
Background Information on differences in paroxysmal supraventricular tachycardia (PSVT) diagnosis, healthcare resource use, expenditures, and treatment among women versus men is limited. Methods and Results Study participants identified in the IBM Ma
Externí odkaz:
https://doaj.org/article/3f9101184ffc46f3a66e85decaa0d544
Publikováno v:
Journal of Computational Geometry, Vol 5, Iss 1 (2014)
For \(k\ge 3\), a \(k\)-angulation is a 2-connected plane graph in which every internal face is a \(k\)-gon. We say that a point set \(P\) admits a plane graph \(G\) if there is a straight-line drawing of \(G\) that maps \(V(G)\) onto \(P\) and has t
Externí odkaz:
https://doaj.org/article/1b288c90d41d45379fc2afc3f19ceeb5
Autor:
Ruy Fabila-Monroy, David R. Wood
Publikováno v:
Journal of Computational Geometry, Vol 3, Iss 1 (2012)
Let P be a set of n points in general position in the plane. We study the chromatic number of the intersection graph of the open triangles determined by P. It is known that this chromatic number is at least n3/27+O(n2) and, if P is in convex position
Externí odkaz:
https://doaj.org/article/08a98f1d2cc74c57bb8328a4e36ab90e
Autor:
Vida Dujmović, David R. Wood
Publikováno v:
Discrete Mathematics & Theoretical Computer Science, Vol Vol. 13 no. 3, Iss Graph and Algorithms (2011)
Graphs and Algorithms
Externí odkaz:
https://doaj.org/article/911712717c6a4180b81b06980fbb91b7
Autor:
David R. Wood
Publikováno v:
Discrete Mathematics & Theoretical Computer Science, Vol Vol. 13 no. 3, Iss Combinatorics (2011)
Combinatorics
Externí odkaz:
https://doaj.org/article/42027e138cd8472d8b0f8cc597355841
Autor:
David R. Wood
Publikováno v:
Discrete Mathematics & Theoretical Computer Science, Vol Vol. 13 no. 2, Iss Graph and Algorithms (2011)
Graphs and Algorithms
Externí odkaz:
https://doaj.org/article/63d42f18ff9449a6911983e5a1e302ab
Autor:
Attila Pór, David R. Wood
Publikováno v:
Journal of Computational Geometry, Vol 1, Iss 1 (2010)
This expository paper discusses some conjectures related to visibility and blockers for sets of points in the plane.
Externí odkaz:
https://doaj.org/article/6b506a59b60e4dd98c3e57a4b51b247d
Autor:
Oswin Aichholzer, Sergio Cabello, Ruy Fabila-Monroy, David Flores-Peñaloza, Thomas Hackl, Clemens Huemer, Ferran Hurtado, David R. Wood
Publikováno v:
Discrete Mathematics & Theoretical Computer Science, Vol Vol. 12 no. 1, Iss Graph and Algorithms (2010)
Graphs and Algorithms
Externí odkaz:
https://doaj.org/article/bced14a406bb406ea2d51d7796ac040b