96 citations · 337 across the 43 of their papers we have counts for
71 papers
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…
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…
On the Complexity of Extending Storylines
Alexander Dobler, Siddharth Gupta, Philipp Kindermann +2
Storyline layouts visualize temporal interactions by drawing each character as an x-monotone curve and enforcing that the participants of every meeting form a contiguous vertical g…
Graph Drawing for LLMs: An Empirical Evaluation
Walter Didimo, Fabrizio Montecchiani, Tommaso Piselli
Our work contributes to the fast-growing literature on the use of Large Language Models (LLMs) to perform graph-related tasks. In particular, we focus on usage scenarios that rely…
Geometric realizations of dichotomous ordinal graphs
Patrizio Angelini, Sabine Cornelsen, Carolina Haase +5
A dichotomous ordinal graph consists of an undirected graph with a partition of the edges into short and long edges. A geometric realization of a dichotomous ordinal graph in a…
Flipping Matchings is Hard
Carla Binucci, Fabrizio Montecchiani, Daniel Perz +1
Given a point set and a plane perfect matching on , a flip is an operation that replaces two edges of such that another plane…