Fabrizio Montecchiani

research

∙ 09/03/2023

Upward and Orthogonal Planarity are W[1]-hard Parameterized by Treewidth

Upward planarity testing and Rectilinear planarity testing are central p...

0 Bart M. P. Jansen, et al. ∙

research

∙ 08/25/2023

On the Parameterized Complexity of Bend-Minimum Orthogonal Planarity

Computing planar orthogonal drawings with the minimum number of bends is...

0 Emilio Di Giacomo, et al. ∙

research

∙ 06/05/2023

On the Parameterized Complexity of Computing st-Orientations with Few Transitive Edges

Orienting the edges of an undirected graph such that the resulting digra...

0 Carla Binucci, et al. ∙

research

∙ 02/20/2023

Extending Orthogonal Planar Graph Drawings is Fixed-Parameter Tractable

The task of finding an extension to a given partial drawing of a graph w...

0 Sujoy Bhore, et al. ∙

research

∙ 09/01/2022

On the Complexity of the Storyplan Problem

Motivated by dynamic graph visualization, we study the problem of repres...

0 Carla Binucci, et al. ∙

research

∙ 08/29/2022

Strictly-Convex Drawings of 3-Connected Planar Graphs

Strictly-convex straight-line drawings of 3-connected planar graphs in s...

0 Michael A. Bekos, et al. ∙

research

∙ 06/29/2022

Recognizing Map Graphs of Bounded Treewidth

A map graph is a graph admitting a representation in which vertices are ...

0 Patrizio Angelini, et al. ∙

research

∙ 05/22/2022

On the Parameterized Complexity of the s-Club Cluster Edge Deletion Problem

We study the parameterized complexity of the s-Club Cluster Edge Deletio...

0 Fabrizio Montecchiani, et al. ∙

research

∙ 05/16/2022

The Influence of Dimensions on the Complexity of Computing Decision Trees

A decision tree recursively splits a feature space ℝ^d and then assigns ...

0 Stephen G. Kobourov, et al. ∙

research

∙ 04/29/2022

Convex Grid Drawings of Planar Graphs with Constant Edge-Vertex Resolution

We continue the study of the area requirement of convex straight-line gr...

0 Michael A. Bekos, et al. ∙

research

∙ 08/27/2021

On the Upward Book Thickness Problem: Combinatorial and Complexity Results

A long-standing conjecture by Heath, Pemmaraju, and Trenk states that th...

0 Sujoy Bhore, et al. ∙

research

∙ 08/26/2021

Optimal-area visibility representations of outer-1-plane graphs

This paper studies optimal-area visibility representations of n-vertex o...

0 Therese Biedl, et al. ∙

research

∙ 08/23/2021

A User Study on Hybrid Graph Visualizations

Hybrid visualizations mix different metaphors in a single layout of a ne...

0 Emilio Di Giacomo, et al. ∙

research

∙ 05/27/2021

On Morphing 1-Planar Drawings

Computing a morph between two drawings of a graph is a classical problem...

0 Patrizio Angelini, et al. ∙

research

∙ 05/17/2021

Planar Drawings with Few Slopes of Halin Graphs and Nested Pseudotrees

The planar slope number psn(G) of a planar graph G is the minimum number...

0 Steven Chaplick, et al. ∙

research

∙ 05/14/2021

Generalized LR-drawings of trees

The LR-drawing-method is a method of drawing an ordered rooted binary tr...

0 Therese Biedl, et al. ∙

research

∙ 08/20/2020

VAIM: Visual Analytics for Influence Maximization

In social networks, individuals' decisions are strongly influenced by re...

0 Alessio Arleo, et al. ∙

research

∙ 08/19/2020

Parameterized Algorithms for Queue Layouts

An h-queue layout of a graph G consists of a linear order of its vertice...

0 Sujoy Bhore, et al. ∙

research

∙ 08/10/2020

Storyline Visualizations with Ubiquitous Actors

Storyline visualizations depict the temporal dynamics of social interact...

0 Emilio Di Giacomo, et al. ∙

research

∙ 05/05/2020

Grid Drawings of Graphs with Constant Edge-Vertex Resolution

We study the algorithmic problem of computing drawings of graphs in whic...

0 Michael A. Bekos, et al. ∙

research

∙ 03/17/2020

Book Embeddings of Nonplanar Graphs with Small Faces in Few Pages

An embedding of a graph in a book, called book embedding, consists of a ...

0 Michael A. Bekos, et al. ∙

research

∙ 02/22/2020

On Layered Fan-Planar Graph Drawings

In this paper, we study fan-planar drawings that use h layers and are pr...

0 Therese Biedl, et al. ∙

research

∙ 11/01/2019

An Experimental Study of a 1-planarity Testing and Embedding Algorithm

The definition of 1-planar graphs naturally extends graph planarity, nam...

0 Carla Binucci, et al. ∙

research

∙ 08/31/2019

Simple k-Planar Graphs are Simple (k+1)-Quasiplanar

A simple topological graph is k-quasiplanar (k≥ 2) if it contains no k p...

0 Patrizio Angelini, et al. ∙

research

∙ 08/23/2019

Parameterized Algorithms for Book Embedding Problems

A k-page book embedding of a graph G draws the vertices of G on a line a...

0 Sujoy Bhore, et al. ∙

research

∙ 08/22/2019

ChordLink: A New Hybrid Visualization Model

Many real-world networks are globally sparse but locally dense. Typical ...

0 Lorenzo Angori, et al. ∙

research

∙ 08/14/2019

Sketched Representations and Orthogonal Planarity of Bounded Treewidth Graphs

Given a planar graph G and an integer b, OrthogonalPlanarity is the prob...

0 Emilio Di Giacomo, et al. ∙

research

∙ 08/08/2019

Crossing Numbers of Beyond-Planar Graphs

We study the 1-planar, quasi-planar, and fan-planar crossing number in c...

0 Markus Chimani, et al. ∙

research

∙ 11/02/2018

Planar Graphs of Bounded Degree have Constant Queue Number

A queue layout of a graph consists of a linear order of its vertices and...

0 Michael A. Bekos, et al. ∙

research

∙ 09/21/2018

Polyline Drawings with Topological Constraints

Let G be a simple topological graph and let Γ be a polyline drawing of G...

0 Emilio Di Giacomo, et al. ∙

research

∙ 08/26/2018

Drawing Subcubic 1-Planar Graphs with Few Bends, Few Slopes, and Large Angles

We show that the 1-planar slope number of 3-connected cubic 1-planar gra...

0 Philipp Kindermann, et al. ∙

research

∙ 07/03/2018

Ortho-polygon Visibility Representations of 3-connected 1-plane Graphs

An ortho-polygon visibility representation Γ of a 1-plane graph G (OPVR ...

0 Giuseppe Liotta, et al. ∙

research

∙ 04/19/2018

A Survey on Graph Drawing Beyond Planarity

Graph Drawing Beyond Planarity is a rapidly growing research area that c...

0 Walter Didimo, et al. ∙

research

∙ 03/27/2018

Universal Slope Sets for Upward Planar Drawings

We prove that every set S of Δ slopes containing the horizontal slope i...

0 Michael A. Bekos, et al. ∙

research

∙ 03/09/2018

Geodesic Obstacle Representation of Graphs

An obstacle representation of a graph is a mapping of the vertices onto ...

0 Prosenjit Bose, et al. ∙

research

∙ 08/25/2017

Gap-planar Graphs

We introduce the family of k-gap-planar graphs for k ≥ 0, i.e., graphs t...

0 Sang Won Bae, et al. ∙

research

∙ 08/21/2017

3D Visibility Representations of 1-planar Graphs

We prove that every 1-planar graph G has a z-parallel visibility represe...

0 Patrizio Angelini, et al. ∙

Fabrizio Montecchiani

Featured Co-authors