1 citations · 2 across the 6 of their papers we have counts for
6 papers
Flip Graphs of Pseudo-Triangulations With Face Degree at Most 4
Maarten Löffler, Tamara Mchedlidze, David Orden +2
A pseudo-triangle is a simple polygon with exactly three convex vertices, and all other vertices (if any) are distributed on three concave chains. A pseudo-triangulation~$\mathcal{…
On 1-bend Upward Point-set Embeddings of -digraphs
Emilio Di Giacomo, Henry Förster, Daria Kokhovich +4
We study the upward point-set embeddability of digraphs on one-sided convex point sets with at most 1 bend per edge. We provide an algorithm to compute a 1-bend upward point-set em…
Identifying Cluttering Edges in Near-Planar Graphs
Simon van Wageningen, Tamara Mchedlidze, Alexandru Telea
Planar drawings of graphs tend to be favored over non-planar drawings. Testing planarity and creating a planar layout of a planar graph can be done in linear time. However, creatin…
Recognizing DAGs with Page-Number 2 is NP-complete
Michael A. Bekos, Giordano Da Lozzo, Fabrizio Frati +3
The page-number of a directed acyclic graph (a DAG, for short) is the minimum for which the DAG has a topological order and a -coloring of its edges such that no two edges o…
Monotone Simultaneous Embeddings of Paths in R^d
David Bremner, Olivier Devillers, Marc Glisse +5
We study the following problem: Given paths that share the same vertex set, is there a simultaneous geometric embedding of these paths such that each individual drawing is mono…
Embedding Four-directional Paths on Convex Point Sets
Oswin Aichholzer, Thomas Hackl, Sarah Lutteropp +2
A directed path whose edges are assigned labels "up", "down", "right", or "left" is called \emph{four-directional}, and \emph{three-directional} if at most three out of the four la…