4 papers
Separation Number and Treewidth, Revisited
Hussein Houdrouge, Babak Miraftab, Pat Morin
We give a constructive proof of the fact that the treewidth of a graph is bounded by a linear function of the separation number of .
Free Sets in Planar Graphs: History and Applications
Vida Dujmović, Pat Morin
A subset of vertices in a planar graph is a free set if, for every set of points in the plane, there exists a straight-line crossing-free drawing of in which…
Tight bound for the Erdős-Pósa property of tree minors
Vida Dujmović, Gwenaël Joret, Piotr Micek +1
Let be a tree on vertices. We prove that for every positive integer and every graph , either contains pairwise vertex-disjoint subgraphs each having a mi…
Patricia's Bad Distributions
Louigi Addario-Berry, Pat Morin, Ralph Neininger
The height of a random PATRICIA tree built from independent, identically distributed infinite binary strings with arbitrary diffuse probability distribution on $\{0,1\}^\mathbb…