1 citations · 4 across the 14 of their papers we have counts for
9 papers · 1 filter
On the Parameterized Complexity of Capacitated Stack and Queue Layouts with Colored Edges
Thomas Depian, Giuseppe Liotta, Fabrizio Montecchiani +1
Stack and queue layouts are two extensively studied and complementary linear representations of graphs. A stack (queue) layout of a graph consists of…
Ramsey Meets Simultaneous Planarity: Vertex Integrity and Pathwidth
Thomas Depian, Simon D. Fink, Alexander Firbas +3
We study the following simultaneous embedding problem: Given k graphs on the same vertex set with the same pairwise intersection, do they admit planar drawings that coincide on the…
A Uniform Algorithm for Strict NP on Bounded-Treedepth Graphs
Thomas Depian, Robert Ganian, Jakob Greilhuber +2
A classical well-quasi-ordering result guarantees the existence of non-uniform linear-time algorithms for all problems in Strict NP on relational structures of bounded treedepth; h…
The (Parameterized) Complexity of Ordering a Graph While Avoiding a Forbidden Pattern
Thomas Depian, Simon D. Fink, Alexander Firbas +3
In this paper, we study the Pattern Avoidance problem of determining whether a given graph admits a linear vertex order which avoids a given pattern , i.e., a vertex sequenc…
On the Recognition of Outerplanar Graphs with Queue Number 1
Michael A. Bekos, Thomas Depian, Stefan Felsner +7
A linear layout of a graph is defined as a total order of the vertices and a partition of the edges to pages. In a stack (queue) layout, no two edges on the same page may cross (ne…
Point Set Embeddability with List Constraints
Thomas Depian, Joseph Dorfer, Boris Klemz +2
Deciding whether a given graph admits a planar straight-line drawing where each vertex is placed on some point from a given finite point set is known as Point Set Embeddability and…
Paged Geophylogenies: A Coloring Approach to External Labeling with Tree Constraints
Thomas Depian, Thomas C. van Dijk, Martin Nöllenburg
Geophylogenies are a common type of diagram for visualizing the evolutionary history of species in a geographic context. As a drawing problem, these diagrams are commonly modeled a…
Realizing Planar Linkages in Polygonal Domains
Thomas Depian, Carolina Haase, Martin Nöllenburg +1
A linkage consists of a graph and an edge-length function . Deciding whether can be realized as a planar straight-line embedding in $\ma…
Revisiting Graph Modification via Disk Scaling: From One Radius to Interval-Based Radii
Thomas Depian, Frank Sommer
For a fixed graph class , the goal of -Modification is to transform an input graph into a graph using at most modifications. Vertex and edge deletions are com…