activity
20162026
most citedLocal and Union Boxicity

1 citations · 2 across the 7 of their papers we have counts for

collaborators

11 papers

cs.CG2026

Towards the Recognition of Oriented Interval Graphs

Lukas P. Bachmann, Jiří Fiala, Miriam Münch +3

Oriented interval graphs, a recent generalization of interval graphs introduced by Gutowski et al. [GD 2022], are intersection graphs of intervals, each of which is oriented either…

math.CO2026

Two Results on Outer-String Graphs

Todor Antić, Vít Jelínek, Jan Kratochvíl +1

An \emph{outer-string representation} of a graph is an intersection representation of where vertices are represented by curves (strings) inside the unit disk and each curve…

cs.DM2024

Level Planarity Is More Difficult Than We Thought

Simon D. Fink, Matthias Pfretzschner, Ignaz Rutter +1

We consider three simple quadratic time algorithms for the problem Level Planarity and give a level-planar instance that they either falsely report as negative or for which they ou…

cs.DM2023★ 1 cited

On 3-Coloring Circle Graphs

Patricia Bachmann, Ignaz Rutter, Peter Stumpf

Given a graph with a fixed vertex order , one obtains a circle graph whose vertices are the edges of and where two such edges are adjacent if and only if their e…

cs.DS2022

Partial and Simultaneous Transitive Orientations via Modular Decomposition

Miriam Münch, Ignaz Rutter, Peter Stumpf

A natural generalization of the recognition problem for a geometric graph class is the problem of extending a representation of a subgraph to a representation of the whole graph. A…

cs.DS2021

Extending Partial Representations of Circular-Arc Graphs

Jiří Fiala, Ignaz Rutter, Peter Stumpf +1

The partial representation extension problem generalizes the recognition problem for classes of graphs defined in terms of vertex representations. We exhibit circular-arc graphs as…