Emilio Di Giacomo | DeepAI

AI Chat

Featured Co-authors

Stephen Kobourov
51 publications
Martin Nöllenburg
51 publications
Robert Ganian
39 publications
Giuseppe Liotta
39 publications
Fabrizio Montecchiani
37 publications
Michael A. Bekos
35 publications
Michael Kaufmann
34 publications
Giordano Da Lozzo
28 publications
Kirill Simonov
25 publications
Steven Chaplick
25 publications
Walter Didimo
24 publications

∙ 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. ∙

∙ 01/03/2023

k-planar Placement and Packing of Δ-regular Caterpillars

This paper studies a packing problem in the so-called beyond-planar sett...

0 Carla Binucci, et al. ∙

∙ 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. ∙

∙ 08/26/2022

Testing Upward Planarity of Partial 2-Trees

We present an O(n^2)-time algorithm to test whether an n-vertex directed...

0 Steven Chaplick, et al. ∙

∙ 03/10/2022

Parameterized Algorithms for Upward Planarity

We obtain new parameterized algorithms for the classical problem of dete...

0 Steven Chaplick, et al. ∙

∙ 08/24/2021

Quasi-upward Planar Drawings with Minimum Curve Complexity

This paper studies the problem of computing quasi-upward planar drawings...

0 Carla Binucci, et al. ∙

∙ 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. ∙

∙ 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. ∙

∙ 08/10/2020

Storyline Visualizations with Ubiquitous Actors

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

0 Emilio Di Giacomo, et al. ∙

∙ 11/05/2019

Packing Trees into 1-planar Graphs

We introduce and study the 1-planar packing problem: Given k graphs with...

0 Felice De Luca, et al. ∙

∙ 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. ∙

∙ 03/19/2019

Upward Book Embeddings of st-Graphs

We study k-page upward book embeddings (kUBEs) of st-graphs, that is, bo...

0 Carla Binucci, et al. ∙

∙ 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. ∙

∙ 06/29/2018

(k,p)-Planarity: A Relaxation of Hybrid Planarity

We present a new model for hybrid planarity that relaxes existing hybrid...

0 Emilio Di Giacomo, et al. ∙

∙ 06/29/2018

(k,p)-Planarity: A Generalization of Hybrid Planarity

A graph G is (k,p)-planar if its vertices can be partitioned into cluste...

0 Emilio Di Giacomo, et al. ∙

∙ 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. ∙

∙ 08/30/2017

Colored Point-set Embeddings of Acyclic Graphs

We show that any planar drawing of a forest of three stars whose vertice...

0 Emilio Di Giacomo, et al. ∙

Are you a researcher?
Expose your work
to one of the largest
A.I. communities in the world