DeepAI

# Monotone Arc Diagrams with few Biarcs

We show that every planar graph can be represented by a monotone topological 2-page book embedding where at most 15n/16 (of potentially 3n-6) edges cross the spine exactly once.

• 23 publications
• 12 publications
• 17 publications
• 28 publications
04/16/2020

### Four Pages Are Indeed Necessary for Planar Graphs

An embedding of a graph in a book consists of a linear order of its vert...
03/17/2020

### Book Embeddings of Nonplanar Graphs with Small Faces in Few Pages

An embedding of a graph in a book, called book embedding, consists of a ...
08/07/2021

### SpEuler: Semantics-preserving Euler Diagrams

Creating comprehensible visualizations of highly overlapping set-typed d...
03/27/2018

### On Dispersable Book Embeddings

In a dispersable book embedding, the vertices of a given graph G must be...
08/21/2015

### Representation of Quasi-Monotone Functionals by Families of Separating Hyperplanes

We characterize when the level sets of a continuous quasi-monotone funct...
11/21/2019

### Implementing the Topological Model Succinctly

We show that the topological model, a semantically rich standard to repr...
08/22/2017

### Upward Partitioned Book Embeddings

We analyze a directed variation of the book embedding problem when the p...