# Search Results

### Documents authored by Kusters, Vincent

Document
##### The Planar Tree Packing Theorem

Authors: Markus Geyer, Michael Hoffmann, Michael Kaufmann, Vincent Kusters, and Csaba Tóth

Published in: LIPIcs, Volume 51, 32nd International Symposium on Computational Geometry (SoCG 2016)

##### Abstract
Packing graphs is a combinatorial problem where several given graphs are being mapped into a common host graph such that every edge is used at most once. In the planar tree packing problem we are given two trees T1 and T2 on n vertices and have to find a planar graph on n vertices that is the edge-disjoint union of T1 and T2. A clear exception that must be made is the star which cannot be packed together with any other tree. But according to a conjecture of Garcia et al. from 1997 this is the only exception, and all other pairs of trees admit a planar packing. Previous results addressed various special cases, such as a tree and a spider tree, a tree and a caterpillar, two trees of diameter four, two isomorphic trees, and trees of maximum degree three. Here we settle the conjecture in the affirmative and prove its general form, thus making it the planar tree packing theorem. The proof is constructive and provides a polynomial time algorithm to obtain a packing for two given nonstar trees.

##### Cite as

Markus Geyer, Michael Hoffmann, Michael Kaufmann, Vincent Kusters, and Csaba Tóth. The Planar Tree Packing Theorem. In 32nd International Symposium on Computational Geometry (SoCG 2016). Leibniz International Proceedings in Informatics (LIPIcs), Volume 51, pp. 41:1-41:15, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2016)

```@InProceedings{geyer_et_al:LIPIcs.SoCG.2016.41,
author =	{Geyer, Markus and Hoffmann, Michael and Kaufmann, Michael and Kusters, Vincent and T\'{o}th, Csaba},
title =	{{The Planar Tree Packing Theorem}},
booktitle =	{32nd International Symposium on Computational Geometry (SoCG 2016)},
pages =	{41:1--41:15},
series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN =	{978-3-95977-009-5},
ISSN =	{1868-8969},
year =	{2016},
volume =	{51},
editor =	{Fekete, S\'{a}ndor and Lubiw, Anna},
publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
URL =		{https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SoCG.2016.41},
URN =		{urn:nbn:de:0030-drops-59337},
doi =		{10.4230/LIPIcs.SoCG.2016.41},
annote =	{Keywords: graph drawing, simultaneous embedding, planar graph, graph packin}
}```
Document
##### Arc Diagrams, Flip Distances, and Hamiltonian Triangulations

Authors: Jean Cardinal, Michael Hoffmann, Vincent Kusters, Csaba D. Tóth, and Manuel Wettstein

Published in: LIPIcs, Volume 30, 32nd International Symposium on Theoretical Aspects of Computer Science (STACS 2015)

##### Abstract
We show that every triangulation (maximal planar graph) on n\ge 6 vertices can be flipped into a Hamiltonian triangulation using a sequence of less than n/2 combinatorial edge flips. The previously best upper bound uses 4-connectivity as a means to establish Hamiltonicity. But in general about 3n/5 flips are necessary to reach a 4-connected triangulation. Our result improves the upper bound on the diameter of the flip graph of combinatorial triangulations on n vertices from 5.2n-33.6 to 5n-23. We also show that for every triangulation on n vertices there is a simultaneous flip of less than 2n/3 edges to a 4-connected triangulation. The bound on the number of edges is tight, up to an additive constant. As another application we show that every planar graph on n vertices admits an arc diagram with less than n/2 biarcs, that is, after subdividing less than n/2 (of potentially 3n-6) edges the resulting graph admits a 2-page book embedding.

##### Cite as

Jean Cardinal, Michael Hoffmann, Vincent Kusters, Csaba D. Tóth, and Manuel Wettstein. Arc Diagrams, Flip Distances, and Hamiltonian Triangulations. In 32nd International Symposium on Theoretical Aspects of Computer Science (STACS 2015). Leibniz International Proceedings in Informatics (LIPIcs), Volume 30, pp. 197-210, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2015)

```@InProceedings{cardinal_et_al:LIPIcs.STACS.2015.197,
author =	{Cardinal, Jean and Hoffmann, Michael and Kusters, Vincent and T\'{o}th, Csaba D. and Wettstein, Manuel},
title =	{{Arc Diagrams, Flip Distances, and Hamiltonian Triangulations}},
booktitle =	{32nd International Symposium on Theoretical Aspects of Computer Science (STACS 2015)},
pages =	{197--210},
series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN =	{978-3-939897-78-1},
ISSN =	{1868-8969},
year =	{2015},
volume =	{30},
editor =	{Mayr, Ernst W. and Ollinger, Nicolas},
publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
URL =		{https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2015.197},
URN =		{urn:nbn:de:0030-drops-49141},
doi =		{10.4230/LIPIcs.STACS.2015.197},
annote =	{Keywords: graph embeddings, edge flips, flip graph, separating triangles}
}```
X

Feedback for Dagstuhl Publishing