Search Results - "Dujmovic, Vida"

Graph layouts via layered separators by Dujmović, Vida

“…A k-queue layout of a graph consists of a total order of the vertices, and a partition of the edges into k sets such that no two edges that are in the same set…”
Get full text

Layered separators in minor-closed graph classes with applications by Dujmović, Vida, Morin, Pat, Wood, David R.

“…Graph separators are a ubiquitous tool in graph theory and computer science. However, in some applications, their usefulness is limited by the fact that the…”
Get full text

Dual Circumference and Collinear Sets by Dujmović, Vida, Morin, Pat

“…We show that, if an n -vertex triangulation G of maximum degree Δ has a dual that contains a cycle of length  ℓ , then G has a non-crossing straight-line…”
Get full text

Graph product structure for non-minor-closed classes by Dujmović, Vida, Morin, Pat, Wood, David R.

“…Dujmović et al. [J. ACM '20] proved that every planar graph is isomorphic to a subgraph of the strong product of a bounded treewidth graph and a path…”
Get full text

On dispersable book embeddings by Alam, Jawaherul Md, Bekos, Michael A., Dujmović, Vida, Gronemann, Martin, Kaufmann, Michael, Pupyrev, Sergey

“…In a dispersable book embedding, the vertices of a given graph G must be ordered along a line ℓ, called spine, and the edges of G must be drawn in different…”
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

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

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

Proof of the Clustered Hadwiger Conjecture by Dujmovic, Vida, Esperet, Louis, Morin, Pat, Wood, David R.

“…Hadwiger's Conjecture asserts that every K_{h}-minor-free graph is properly (h-1)-colourable. We prove the following improper analogue of Hadwiger's…”
Get full text

Adjacency Labelling for Planar Graphs (and Beyond) by Dujmovic, Vida, Esperet, Louis, Gavoille, Cyril, Joret, Gwenael, Micek, Piotr, Morin, Pat

“…We show that there exists an adjacency labelling scheme for planar graphs where each vertex of an n -vertex planar graph G is assigned a…”
Get full text

On Obstacle Numbers by Dujmović, Vida, Morin, Pat

“…The obstacle number is a new graph parameter introduced by Alpert, Koch, and Laison (2010). Mukkamala et al. (2012) show that there exist graphs with $n$…”
Get full text

Graphs Drawn With Some Vertices per Face: Density and Relationships by Binucci, Carla, Di Battista, Giuseppe, Didimo, Walter, Dujmovic, Vida, Hong, Seok-Hee, Kaufmann, Michael, Liotta, Giuseppe, Morin, Pat, Tappini, Alessandra

“…Graph drawing beyond planarity is a research area that has received an increasing attention in the last twenty years, driven by the necessity to mitigate the…”
Get full text

Geodesic obstacle representation of graphs by Bose, Prosenjit, Carmi, Paz, Dujmović, Vida, Mehrabi, Saeed, Montecchiani, Fabrizio, Morin, Pat, Xavier da Silveira, Luís Fernando Schultz

“…An obstacle representation of a graph is a mapping of the vertices onto points in the plane and a set of connected regions of the plane (called obstacles) such…”
Get full text

Notes on growing a tree in a graph by Devroye, Luc, Dujmović, Vida, Frieze, Alan, Mehrabian, Abbas, Morin, Pat, Reed, Bruce

“…We study the height of a spanning tree T of a graph G obtained by starting with a single vertex of G and repeatedly selecting, uniformly at random, an edge of…”
Get full text

A Center Transversal Theorem for Hyperplanes and Applications to Graph Drawing by Dujmović, Vida, Langerman, Stefan

“…Motivated by an open problem from graph drawing, we study several partitioning problems for line and hyperplane arrangements. We prove a ham-sandwich cut…”
Get full text

New Bounds for Facial Nonrepetitive Colouring by Bose, Prosenjit, Dujmović, Vida, Morin, Pat, Rioux-Maldague, Lucas

“…We prove that the facial nonrepetitive chromatic number of any outerplanar graph is at most 11 and of any planar graph is at most 22…”
Get full text

Average Stretch Factor: How Low Does It Go? by Dujmović, Vida, Morin, Pat, Smid, Michiel

“…In a geometric graph G , the stretch factor between two vertices u and w is the ratio between the Euclidean length of the shortest path from u to w in G and…”
Get full text

Drawings of planar graphs with few slopes and segments by Dujmović, Vida, Eppstein, David, Suderman, Matthew, Wood, David R.

“…We study straight-line drawings of planar graphs with few segments and few slopes. Optimal results are obtained for all trees. Tight bounds are obtained for…”
Get full text

An affine invariant k-nearest neighbor regression estimate by Biau, Gérard, Devroye, Luc, Dujmović, Vida, Krzyżak, Adam

“…We design a data-dependent metric in Rd and use it to define the k-nearest neighbors of a given point. Our metric is invariant under all affine…”
Get full text

Compatible Connectivity Augmentation of Planar Disconnected Graphs by Aloupis, Greg, Barba, Luis, Carmi, Paz, Dujmović, Vida, Frati, Fabrizio, Morin, Pat

“…We consider the following compatible connectivity-augmentation problem : We are given a labeled n -vertex planar graph G that has r ≥ 2 connected components,…”
Get full text