Segui
Alessandra Tappini
Titolo
Citata da
Citata da
Anno
ChordLink: A New Hybrid Visualization Model
L Angori, W Didimo, F Montecchiani, D Pagliuca, A Tappini
International Symposium on Graph Drawing and Network Visualization, 276-290, 2019
162019
Hybrid graph visualizations with ChordLink: algorithms, experiments, and applications
L Angori, W Didimo, F Montecchiani, D Pagliuca, A Tappini
IEEE Transactions on Visualization and Computer Graphics 28 (2), 1288-1300, 2020
132020
Pole Dancing: 3D Morphs for Tree Drawings.
E Arseneva, P Bose, P Cano, A D'Angelo, V Dujmovic, F Frati, ...
J. Graph Algorithms Appl. 23 (3), 579-602, 2019
132019
NodeTrix planarity testing with small clusters
E Di Giacomo, G Liotta, M Patrignani, A Tappini
International Symposium on Graph Drawing and Network Visualization, 479-491, 2017
132017
Storyline visualizations with ubiquitous actors
E Di Giacomo, W Didimo, G Liotta, F Montecchiani, A Tappini
International Symposium on Graph Drawing and Network Visualization, 324-332, 2020
122020
Partial edge drawing: Homogeneity is more important than crossings and ink
C Binucci, G Liotta, F Montecchiani, A Tappini
2016 7th International Conference on Information, Intelligence, Systems …, 2016
122016
NodeTrix planarity testing with small clusters
E Di Giacomo, G Liotta, M Patrignani, I Rutter, A Tappini
Algorithmica 81, 3464-3493, 2019
112019
Turning cliques into paths to achieve planarity
P Angelini, P Eades, SH Hong, K Klein, S Kobourov, G Liotta, A Navarra, ...
International Symposium on Graph Drawing and Network Visualization, 67-74, 2018
112018
(k, p)-planarity: a relaxation of hybrid planarity
E Di Giacomo, WJ Lenhart, G Liotta, TW Randolph, A Tappini
Theoretical Computer Science 896, 19-30, 2021
92021
Simultaneous FPQ-ordering and hybrid planarity testing
G Liotta, I Rutter, A Tappini
Theoretical Computer Science 874, 59-79, 2021
92021
Quasi-upward planar drawings with minimum curve complexity
C Binucci, E Di Giacomo, G Liotta, A Tappini
Graph Drawing and Network Visualization: 29th International Symposium, GD …, 2021
82021
Graph planarity by replacing cliques with paths
P Angelini, P Eades, SH Hong, K Klein, S Kobourov, G Liotta, A Navarra, ...
Algorithms 13 (8), 194, 2020
82020
Parameterized complexity of graph planarity with restricted cyclic orders
G Liotta, I Rutter, A Tappini
International Workshop on Graph-Theoretic Concepts in Computer Science, 383-397, 2022
62022
A user study on hybrid graph visualizations
E Di Giacomo, W Didimo, F Montecchiani, A Tappini
International Symposium on Graph Drawing and Network Visualization, 21-38, 2021
42021
Ortho-polygon visibility representations of 3-connected 1-plane graphs
G Liotta, F Montecchiani, A Tappini
Theoretical Computer Science 863, 40-52, 2021
42021
Packing trees into 1-planar graphs
F De Luca, E Di Giacomo, SH Hong, S Kobourov, W Lenhart, G Liotta, ...
International Workshop on Algorithms and Computation, 81-93, 2020
42020
Ortho-polygon visibility representations of 3-connected 1-plane graphs
G Liotta, F Montecchiani, A Tappini
International Symposium on Graph Drawing and Network Visualization, 524-537, 2018
42018
Planar k-NodeTrix Graphs: A New Family of Beyond Planar Graphs
E Di Giacomo, G Liotta, M Patrignani, A Tappini
Springer 10692, 609-611, 2017
42017
Greedy rectilinear drawings
P Angelini, MA Bekos, W Didimo, L Grilli, P Kindermann, T Mchedlidze, ...
Theoretical Computer Science 795, 375-397, 2019
32019
A matrix approach for weighted argumentation frameworks
S Bistarelli, A Tappini, C Taticchi
The Thirty-First International Flairs Conference, 2018
32018
Il sistema al momento non può eseguire l'operazione. Riprova più tardi.
Articoli 1–20