1 citations · 1 across the 6 of their papers we have counts for
Showing cs.CCShow all
3 papers · 1 filter
cs.CC2026
The Parameterized Complexity of Geometric 1-Planarity
Alexander Firbas
A graph is geometric 1-planar if it admits a straight-line drawing where each edge is crossed at most once. We provide the first systematic study of the parameterized complexity of…
cs.CC2024
Pathways to Tractability for Geometric Thickness
Thomas Depian, Simon Dominik Fink, Alexander Firbas +2
We study the classical problem of computing geometric thickness, i.e., finding a straight-line drawing of an input graph and a partition of its edges into as few parts as possible…
cs.CC2024
On the Complexity of Establishing Hereditary Graph Properties via Vertex Splitting
Alexander Firbas, Manuel Sorge
Vertex splitting is a graph operation that replaces a vertex with two nonadjacent new vertices and makes each neighbor of adjacent with one or both of the introduced vertic…