关注
Vincenzo Roselli
Vincenzo Roselli
在 dia.uniroma3.it 的电子邮件经过验证 - 首页
标题
引用次数
引用次数
年份
Bitconeview: visualization of flows in the bitcoin transaction graph
G Di Battista, V Di Donato, M Patrignani, M Pizzonia, V Roselli, ...
2015 IEEE symposium on visualization for cyber security (VizSec), 1-8, 2015
1652015
How to morph planar graph drawings
S Alamdari, P Angelini, F Barrera-Cruz, TM Chan, GD Lozzo, GD Battista, ...
SIAM Journal on Computing 46 (2), 824-852, 2017
502017
Morphing planar graph drawings with a polynomial number of steps
S Alamdari, P Angelini, TM Chan, G Di Battista, F Frati, A Lubiw, ...
Proceedings of the Twenty-Fourth Annual ACM-SIAM Symposium on Discrete …, 2013
372013
The importance of being proper:(in clustered-level planarity and T-level planarity)
P Angelini, G Da Lozzo, G Di Battista, F Frati, V Roselli
Theoretical Computer Science 571, 1-9, 2015
322015
Morphing planar graph drawings optimally
P Angelini, G Da Lozzo, G Di Battista, F Frati, M Patrignani, V Roselli
Automata, Languages, and Programming: 41st International Colloquium, ICALP …, 2014
312014
Monotone drawings of graphs with fixed embedding
P Angelini, W Didimo, S Kobourov, T Mchedlidze, V Roselli, A Symvonis, ...
Algorithmica 71, 233-257, 2015
272015
Morphing planar graph drawings efficiently
P Angelini, F Frati, M Patrignani, V Roselli
Graph Drawing: 21st International Symposium, GD 2013, Bordeaux, France …, 2013
272013
Optimal morphs of convex drawings
P Angelini, G Da Lozzo, F Frati, A Lubiw, M Patrignani, V Roselli
arXiv preprint arXiv:1503.09021, 2015
242015
Relaxing the constraints of clustered planarity
P Angelini, G Da Lozzo, G Di Battista, F Frati, M Patrignani, V Roselli
Computational Geometry 48 (2), 42-75, 2015
222015
Small point sets for simply-nested planar graphs
P Angelini, G Di Battista, M Kaufmann, T Mchedlidze, V Roselli, ...
International Symposium on Graph Drawing, 75-85, 2011
202011
Vertex-coloring with defects
P Angelini, M Bekos, F De Luca, W Didimo, M Kaufmann, S Kobourov, ...
Journal of Graph Algorithms and Applications 21 (3), 313-340, 2017
192017
Upward planar morphs
G Da Lozzo, G Di Battista, F Frati, M Patrignani, V Roselli
Algorithmica 82 (10), 2985-3017, 2020
172020
LR-drawings of ordered rooted binary trees and near-linear area drawings of outerplanar graphs
F Frati, M Patrignani, V Roselli
Journal of Computer and System Sciences 107, 28-53, 2020
132020
Anchored drawings of planar graphs
P Angelini, G Da Lozzo, M Di Bartolomeo, G Di Battista, SH Hong, ...
International Symposium on Graph Drawing, 404-415, 2014
132014
Algorithms and bounds for L-drawings of directed graphs
P Angelini, GD Lozzo, MD Bartolomeo, VD Donato, M Patrignani, ...
International Journal of Foundations of Computer Science 29 (04), 461-480, 2018
112018
Drawing planar graphs with many collinear vertices
G Da Lozzo, V Dujmović, F Frati, T Mchedlidze, V Roselli
Journal of Computational Geometry 9 (1), 94–130-94–130, 2018
102018
Monotone drawings of graphs with fixed embedding
P Angelini, W Didimo, S Kobourov, T Mchedlidze, V Roselli, A Symvonis, ...
International Symposium on Graph Drawing, 379-390, 2011
102011
How to morph a tree on a small grid
F Barrera-Cruz, M Borrazzo, G Da Lozzo, G Di Battista, F Frati, ...
Discrete & Computational Geometry 67 (3), 743-786, 2022
92022
Upward planar morphs
G Da Lozzo, G Di Battista, F Frati, M Patrignani, V Roselli
International Symposium on Graph Drawing and Network Visualization, 92-105, 2018
82018
An exact algorithm for a multicommodity min-cost flow over time problem
E Grande, G Nicosia, A Pacifici, V Roselli
Electronic Notes in Discrete Mathematics 64, 125-134, 2018
82018
系统目前无法执行此操作,请稍后再试。
文章 1–20