Search Results - "Angelini, Patrizio"
-
1
Bitonic st-Orderings for Upward Planar Graphs: Splits and Bends in the Variable Embedding Scenario
Published in Algorithmica (01-09-2023)“…Bitonic st -orderings for st -planar graphs were introduced as a method to cope with several graph drawing problems. Notably, they have been used to obtain the…”
Get full text
Journal Article -
2
Recognizing Map Graphs of Bounded Treewidth
Published in Algorithmica (01-02-2024)“…A map is a partition of the sphere into interior-disjoint regions homeomorphic to closed disks. Some regions are labeled as nations, while the remaining ones…”
Get full text
Journal Article -
3
Graph Planarity by Replacing Cliques with Paths
Published in Algorithms (01-08-2020)“…This paper introduces and studies the following beyond-planarity problem, which we call h-Clique2Path Planarity. Let G be a simple topological graph whose…”
Get full text
Journal Article -
4
Testing the simultaneous embeddability of two graphs whose intersection is a biconnected or a connected graph
Published in Journal of discrete algorithms (Amsterdam, Netherlands) (01-07-2012)“…In this paper we study the time complexity of the problem Simultaneous Embedding with Fixed Edges (Sefe), that takes two planar graphs G1=(V,E1) and G2=(V,E2)…”
Get full text
Journal Article -
5
On the Perspectives Opened by Right Angle Crossing Drawings
Published in Journal of graph algorithms and applications (2011)Get full text
Journal Article -
6
Monotone drawings of graphs with few directions
Published in Information processing letters (01-04-2017)“…•We define k-monotone drawings, where paths are monotone in one of k directions.•We prove that a graph admits a 1-monotone drawing if and only if it can be…”
Get full text
Journal Article -
7
Guest Editors' Foreword
Published in Journal of graph algorithms and applications (01-11-2023)Get full text
Journal Article -
8
On mixed linear layouts of series-parallel graphs
Published in Theoretical computer science (10-11-2022)“…A mixed s-stack q-queue layout of a graph consists of a linear order of its vertices and a partition of its edges into s stacks and q queues, such that no two…”
Get full text
Journal Article -
9
Advancements on SEFE and Partitioned Book Embedding problems
Published in Theoretical computer science (13-04-2015)“…In this work we investigate the complexity of some combinatorial problems related to the Simultaneous Embedding with Fixed Edges (SEFE) and the Partitioned…”
Get full text
Journal Article -
10
3-coloring arrangements of line segments with 4 slopes is hard
Published in Information processing letters (01-09-2018)“…In a paper first appeared at SODA '07, Eppstein proved that testing the 3-colorability of arrangements of line segments is an NP-complete problem. However, if…”
Get full text
Journal Article -
11
On Upward-Planar L-Drawings of Graphs
Published in Journal of graph algorithms and applications (2024)Get full text
Journal Article -
12
Clustered Planarity with Pipes
Published in Algorithmica (01-06-2019)“…We study the version of the C-Planarity problem in which edges connecting the same pair of clusters must be grouped into pipes, which generalizes the Strip…”
Get full text
Journal Article -
13
Planar L-Drawings of Bimodal Graphs
Published in Journal of graph algorithms and applications (01-06-2022)“…In a planar L-drawing of a directed graph (digraph) each edge $e$ is represented as a polyline composed of a vertical segment starting at the tail of $e$ and a…”
Get full text
Journal Article -
14
2-Layer k -Planar Graphs Density, Crossing Lemma, Relationships And Pathwidth
Published in Computer journal (14-04-2024)“…Abstract The $2$-layer drawing model is a well-established paradigm to visualize bipartite graphs where vertices of the two parts lie on two horizontal lines…”
Get full text
Journal Article -
15
Morphing Triangle Contact Representations of Triangulations
Published in Discrete & computational geometry (01-10-2023)“…A morph is a continuous transformation between two representations of a graph. We consider the problem of morphing between contact representations of a plane…”
Get full text
Journal Article -
16
Hierarchical Partial Planarity
Published in Algorithmica (01-06-2019)“…In this paper we consider graphs whose edges are associated with a degree of importance , which may depend on the type of connections they represent or on how…”
Get full text
Journal Article -
17
Extending Partial Orthogonal Drawings
Published in Journal of graph algorithms and applications (01-01-2021)“…We study the planar orthogonal drawing style within the framework of partial representation extension. Let $(G,H,\Gamma_H)$ be a partial orthogonal drawing,…”
Get full text
Journal Article -
18
Strip Planarity Testing for Embedded Planar Graphs
Published in Algorithmica (01-04-2017)“…In this paper we introduce and study the strip planarity testing problem, which takes as an input a planar graph G ( V , E ) and a function γ : V → { 1 , 2 ,…”
Get full text
Journal Article -
19
Intersection-Link Representations of Graphs
Published in Journal of graph algorithms and applications (01-02-2017)“…We consider drawings of graphs that contain dense subgraphs. We introduce intersection-link representations for such graphs, in which each vertex $u$ is…”
Get full text
Journal Article -
20
The importance of being proper
Published in Theoretical computer science (16-03-2015)“…In this paper we study two problems related to the drawing of level graphs, that is, T-Level Planarity and Clustered-Level Planarity. We show that both…”
Get full text
Journal Article