Search Results - "Angelini, Patrizio"

Refine Results
  1. 1

    Bitonic st-Orderings for Upward Planar Graphs: Splits and Bends in the Variable Embedding Scenario by Angelini, Patrizio, Bekos, Michael A., Förster, Henry, Gronemann, Martin

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

    Recognizing Map Graphs of Bounded Treewidth by Angelini, Patrizio, Bekos, Michael A., Da Lozzo, Giordano, Gronemann, Martin, Montecchiani, Fabrizio, Tappini, Alessandra

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

    Graph Planarity by Replacing Cliques with Paths by Angelini, Patrizio, Eades, Peter, Hong, Seok-Hee, Klein, Karsten, Kobourov, Stephen, Liotta, Giuseppe, Navarra, Alfredo, Tappini, Alessandra

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

    Testing the simultaneous embeddability of two graphs whose intersection is a biconnected or a connected graph by Angelini, Patrizio, Di Battista, Giuseppe, Frati, Fabrizio, Patrignani, Maurizio, Rutter, Ignaz

    “…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. 5
  6. 6

    Monotone drawings of graphs with few directions by Angelini, Patrizio

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

    On mixed linear layouts of series-parallel graphs by Angelini, Patrizio, Bekos, Michael A., Kindermann, Philipp, Mchedlidze, Tamara

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

    Advancements on SEFE and Partitioned Book Embedding problems by Angelini, Patrizio, Da Lozzo, Giordano, Neuwirth, Daniel

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

    3-coloring arrangements of line segments with 4 slopes is hard by Angelini, Patrizio, Da Lozzo, Giordano

    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. 11
  12. 12

    Clustered Planarity with Pipes by Angelini, Patrizio, Da Lozzo, Giordano

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

    Planar L-Drawings of Bimodal Graphs by Angelini, Patrizio, Chaplick, Steven, Cornelsen, Sabine, Da Lozzo, Giordano

    “…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. 14

    2-Layer k -Planar Graphs Density, Crossing Lemma, Relationships And Pathwidth by Angelini, Patrizio, Da Lozzo, Giordano, Förster, Henry, Schneck, Thomas

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

    Morphing Triangle Contact Representations of Triangulations by Angelini, Patrizio, Chaplick, Steven, Cornelsen, Sabine, Da Lozzo, Giordano, Roselli, Vincenzo

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

    Hierarchical Partial Planarity by Angelini, Patrizio, Bekos, Michael A.

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

    Extending Partial Orthogonal Drawings by Angelini, Patrizio, Rutter, Ignaz, T P, Sandhya

    “…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. 18

    Strip Planarity Testing for Embedded Planar Graphs by Angelini, Patrizio, Da Lozzo, Giordano, Di Battista, Giuseppe, Frati, Fabrizio

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

    Intersection-Link Representations of Graphs by Angelini, Patrizio, Da Lozzo, Giordano, Di Battista, Giuseppe, Frati, Fabrizio, Patrignani, Maurizio, Rutter, Ignaz

    “…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. 20

    The importance of being proper by Angelini, Patrizio, Da Lozzo, Giordano, Di Battista, Giuseppe, Frati, Fabrizio, Roselli, Vincenzo

    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