Vincenzo Roselli

Orcid: 0000-0002-5412-8136

According to our database1, Vincenzo Roselli authored at least 28 papers between 2011 and 2023.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2023
Morphing Triangle Contact Representations of Triangulations.
Discret. Comput. Geom., October, 2023

2022
How to Morph a Tree on a Small Grid.
Discret. Comput. Geom., 2022

2020
LR-drawings of ordered rooted binary trees and near-linear area drawings of outerplanar graphs.
J. Comput. Syst. Sci., 2020

Upward Planar Morphs.
Algorithmica, 2020

2019
Morphing Contact Representations of Graphs.
Proceedings of the 35th International Symposium on Computational Geometry, 2019

2018
Drawing planar graphs with many collinear vertices.
J. Comput. Geom., 2018

Algorithms and Bounds for L-Drawings of Directed Graphs.
Int. J. Found. Comput. Sci., 2018

An exact algorithm for a multicommodity min-cost flow over time problem.
Electron. Notes Discret. Math., 2018

Small Universal Point Sets for k-Outerplanar Graphs.
Discret. Comput. Geom., 2018

2017
How to Morph Planar Graph Drawings.
SIAM J. Comput., 2017

Vertex-Coloring with Defects.
J. Graph Algorithms Appl., 2017

2016
Vertex-Coloring with Star-Defects.
Proceedings of the WALCOM: Algorithms and Computation - 10th International Workshop, 2016

L-Drawings of Directed Graphs.
Proceedings of the SOFSEM 2016: Theory and Practice of Computer Science, 2016

2015
The importance of being proper: (In clustered-level planarity and T-level planarity).
Theor. Comput. Sci., 2015

Relaxing the constraints of clustered planarity.
Comput. Geom., 2015

Monotone Drawings of Graphs with Fixed Embedding.
Algorithmica, 2015

Bitconeview: visualization of flows in the bitcoin transaction graph.
Proceedings of the 12th IEEE Symposium on Visualization for Cyber Security, 2015

Optimal Morphs of Convex Drawings.
Proceedings of the 31st International Symposium on Computational Geometry, 2015

2014
Slanted Orthogonal Drawings: Model, Algorithms and Evaluations.
J. Graph Algorithms Appl., 2014

On the Complexity of Clustered-Level Planarity and T-Level Planarity.
CoRR, 2014

Morphing Planar Graph Drawings Optimally.
Proceedings of the Automata, Languages, and Programming - 41st International Colloquium, 2014

Anchored Drawings of Planar Graphs.
Proceedings of the Graph Drawing - 22nd International Symposium, 2014

2013
Morphing Planar Graphs Drawings Efficiently.
CoRR, 2013

Morphing Planar Graph Drawings with a Polynomial Number of Steps.
Proceedings of the Twenty-Fourth Annual ACM-SIAM Symposium on Discrete Algorithms, 2013

Slanted Orthogonal Drawings.
Proceedings of the Graph Drawing - 21st International Symposium, 2013

Morphing Planar Graph Drawings Efficiently.
Proceedings of the Graph Drawing - 21st International Symposium, 2013

2012
Beyond Clustered Planarity
CoRR, 2012

2011
Small Point Sets for Simply-Nested Planar Graphs.
Proceedings of the Graph Drawing - 19th International Symposium, 2011


  Loading...