default search action
Vincenzo Roselli
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
- [j14]Patrizio Angelini
, Steven Chaplick
Morphing Triangle Contact Representations of Triangulations. Discret. Comput. Geom. 70(3): 991-1024 (2023) - 2022
- [j13]Fidel Barrera-Cruz, Manuel Borrazzo, Giordano Da Lozzo, Giuseppe Di Battista, Fabrizio Frati, Maurizio Patrignani, Vincenzo Roselli
How to Morph a Tree on a Small Grid. Discret. Comput. Geom. 67(3): 743-786 (2022) - 2020
- [j12]Giordano Da Lozzo
Upward Planar Morphs. Algorithmica 82(10): 2985-3017 (2020) - [j11]Fabrizio Frati
LR-drawings of ordered rooted binary trees and near-linear area drawings of outerplanar graphs. J. Comput. Syst. Sci. 107: 28-53 (2020)
2010 – 2019
- 2019
- [c17]Patrizio Angelini
Morphing Contact Representations of Graphs. SoCG 2019: 10:1-10:16 - [c16]Fidel Barrera-Cruz, Manuel Borrazzo, Giordano Da Lozzo
How to Morph a Tree on a Small Grid. WADS 2019: 57-70 - [i13]Patrizio Angelini, Steven Chaplick, Sabine Cornelsen, Giordano Da Lozzo, Vincenzo Roselli:
Morphing Contact Representations of Graphs. CoRR abs/1903.07595 (2019) - [i12]Fidel Barrera-Cruz, Manuel Borrazzo, Giordano Da Lozzo, Giuseppe Di Battista, Fabrizio Frati, Maurizio Patrignani, Vincenzo Roselli:
How to Morph a Tree on a Small Grid. CoRR abs/1909.07093 (2019) - 2018
- [j10]Patrizio Angelini
Small Universal Point Sets for k-Outerplanar Graphs. Discret. Comput. Geom. 60(2): 430-470 (2018) - [j9]Enrico Grande, Gaia Nicosia
An exact algorithm for a multicommodity min-cost flow over time problem. Electron. Notes Discret. Math. 64: 125-134 (2018) - [j8]Patrizio Angelini
Algorithms and Bounds for L-Drawings of Directed Graphs. Int. J. Found. Comput. Sci. 29(4): 461-480 (2018) - [j7]Giordano Da Lozzo, Vida Dujmovic, Fabrizio Frati, Tamara Mchedlidze, Vincenzo Roselli:
Drawing planar graphs with many collinear vertices. J. Comput. Geom. 9(1): 94-130 (2018) - [c15]Giordano Da Lozzo
Upward Planar Morphs. GD 2018: 92-105 - [i11]Giordano Da Lozzo, Giuseppe Di Battista, Fabrizio Frati, Maurizio Patrignani, Vincenzo Roselli:
Upward Planar Morphs. CoRR abs/1808.10826 (2018) - 2017
- [j6]Patrizio Angelini
Vertex-Coloring with Defects. J. Graph Algorithms Appl. 21(3): 313-340 (2017) - [j5]Soroush Alamdari, Patrizio Angelini
How to Morph Planar Graph Drawings. SIAM J. Comput. 46(2): 824-852 (2017) - [c14]Fabrizio Frati, Maurizio Patrignani, Vincenzo Roselli:
LR-Drawings of Ordered Rooted Binary Trees and Near-Linear Area Drawings of Outerplanar Graphs. SODA 2017: 1980-1999 - 2016
- [c13]Giordano Da Lozzo
Drawing Planar Graphs with Many Collinear Vertices. GD 2016: 152-165 - [c12]Patrizio Angelini
L-Drawings of Directed Graphs. SOFSEM 2016: 134-147 - [c11]Patrizio Angelini
Vertex-Coloring with Star-Defects. WALCOM 2016: 40-51 - [i10]Soroush Alamdari, Patrizio Angelini, Fidel Barrera-Cruz, Timothy M. Chan, Giordano Da Lozzo, Giuseppe Di Battista, Fabrizio Frati, Penny Haxell, Anna Lubiw, Maurizio Patrignani, Vincenzo Roselli, Sahil Singla, Bryan T. Wilkinson:
How to morph planar graph drawings. CoRR abs/1606.00425 (2016) - [i9]Giordano Da Lozzo, Vida Dujmovic, Fabrizio Frati, Tamara Mchedlidze, Vincenzo Roselli:
Drawing Planar Graphs with Many Collinear Vertices. CoRR abs/1606.03890 (2016) - [i8]Fabrizio Frati, Maurizio Patrignani, Vincenzo Roselli:
LR-Drawings of Ordered Rooted Binary Trees and Near-Linear Area Drawings of Outerplanar Graphs. CoRR abs/1610.02841 (2016) - 2015
- [j4]Patrizio Angelini
Monotone Drawings of Graphs with Fixed Embedding. Algorithmica 71(2): 233-257 (2015) - [j3]Patrizio Angelini
Relaxing the constraints of clustered planarity. Comput. Geom. 48(2): 42-75 (2015) - [j2]Patrizio Angelini
The importance of being proper: (In clustered-level planarity and T-level planarity). Theor. Comput. Sci. 571: 1-9 (2015) - [c10]Patrizio Angelini
Optimal Morphs of Convex Drawings. SoCG 2015: 126-140 - [c9]Giuseppe Di Battista, Valentino Di Donato, Maurizio Patrignani, Maurizio Pizzonia, Vincenzo Roselli
Bitconeview: visualization of flows in the bitcoin transaction graph. VizSEC 2015: 1-8 - [i7]Patrizio Angelini, Giordano Da Lozzo, Fabrizio Frati, Anna Lubiw, Maurizio Patrignani, Vincenzo Roselli:
Optimal Morphs of Convex Drawings. CoRR abs/1503.09021 (2015) - [i6]Patrizio Angelini, Giordano Da Lozzo, Marco Di Bartolomeo, Valentino Di Donato, Maurizio Patrignani, Vincenzo Roselli, Ioannis G. Tollis:
L-Drawings of Directed Graphs. CoRR abs/1509.00684 (2015) - [i5]Patrizio Angelini, Michael A. Bekos, Michael Kaufmann, Vincenzo Roselli:
Vertex-Coloring with Star-Defects. CoRR abs/1512.02505 (2015) - 2014
- [j1]Michael A. Bekos
Slanted Orthogonal Drawings: Model, Algorithms and Evaluations. J. Graph Algorithms Appl. 18(3): 459-489 (2014) - [c8]Patrizio Angelini, Giordano Da Lozzo, Giuseppe Di Battista, Fabrizio Frati
The Importance of Being Proper - (In Clustered-Level Planarity and T-Level Planarity). GD 2014: 246-258 - [c7]Patrizio Angelini, Giordano Da Lozzo, Marco Di Bartolomeo, Giuseppe Di Battista, Seok-Hee Hong, Maurizio Patrignani, Vincenzo Roselli:
Anchored Drawings of Planar Graphs. GD 2014: 404-415 - [c6]Patrizio Angelini
Morphing Planar Graph Drawings Optimally. ICALP (1) 2014: 126-137 - [i4]Patrizio Angelini, Giordano Da Lozzo, Giuseppe Di Battista, Fabrizio Frati, Maurizio Patrignani, Vincenzo Roselli:
Morphing Planar Graph Drawings Optimally. CoRR abs/1402.4364 (2014) - [i3]Patrizio Angelini, Giordano Da Lozzo, Giuseppe Di Battista, Fabrizio Frati, Vincenzo Roselli:
On the Complexity of Clustered-Level Planarity and T-Level Planarity. CoRR abs/1406.6533 (2014) - 2013
- [c5]Patrizio Angelini, Fabrizio Frati
Morphing Planar Graph Drawings Efficiently. GD 2013: 49-60 - [c4]Michael A. Bekos, Michael Kaufmann, Robert Krug, Stefan Näher, Vincenzo Roselli:
Slanted Orthogonal Drawings. GD 2013: 424-435 - [c3]Soroush Alamdari, Patrizio Angelini, Timothy M. Chan, Giuseppe Di Battista, Fabrizio Frati
Morphing Planar Graph Drawings with a Polynomial Number of Steps. SODA 2013: 1656-1667 - [i2]Patrizio Angelini, Fabrizio Frati, Maurizio Patrignani, Vincenzo Roselli:
Morphing Planar Graphs Drawings Efficiently. CoRR abs/1308.4291 (2013) - 2012
- [i1]Patrizio Angelini, Giordano Da Lozzo, Giuseppe Di Battista, Fabrizio Frati, Vincenzo Roselli:
Beyond Clustered Planarity. CoRR abs/1207.3934 (2012) - 2011
- [c2]Patrizio Angelini
Small Point Sets for Simply-Nested Planar Graphs. GD 2011: 75-85 - [c1]Patrizio Angelini
Monotone Drawings of Graphs with Fixed Embedding. GD 2011: 379-390
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-05-02 21:01 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: