83 citations · 606 across the 54 of their papers we have counts for
32 papers · 1 filter
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…
Face flips in origami tessellations
Hugo A. Akitaya, Vida Dujmovi, David Eppstein +3
Given a flat-foldable origami crease pattern (a straight-line drawing of a planar graph on a region of the plane) with a mountain-valley (MV) assignment …
Planar graphs have bounded nonrepetitive chromatic number
Vida Dujmović, Louis Esperet, Gwenaël Joret +2
A colouring of a graph is "nonrepetitive" if for every path of even order, the sequence of colours on the first half of the path is different from the sequence of colours on the se…
Queue Layouts of Graphs with Bounded Degree and Bounded Genus
Vida Dujmović, Pat Morin, David R. Wood
Motivated by the question of whether planar graphs have bounded queue-number, we prove that planar graphs with maximum degree have queue-number , which improves upon…
Every Collinear Set in a Planar Graph Is Free
Vida Dujmović, Fabrizio Frati, Daniel Gonçalves +2
We show that if a planar graph has a plane straight-line drawing in which a subset of its vertices are collinear, then for any set of points, , in the plane with $|X|=|S…
Dual Circumference and Collinear Sets
Vida Dujmović, Pat Morin
We show that, if a -vertex triangulation of maximum degree has a dual that contains a cycle of length , then has a non-crossing straight-line drawing in which…