Alessandra Tappini

Orcid: 0000-0001-9192-2067

According to our database1, Alessandra Tappini authored at least 38 papers between 2016 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
Comparative Study and Evaluation of Hybrid Visualizations of Graphs.
IEEE Trans. Vis. Comput. Graph., July, 2024

Recognizing Map Graphs of Bounded Treewidth.
Algorithmica, February, 2024

Min-<i>k</i>-planar Drawings of Graphs.
J. Graph Algorithms Appl., 2024

Graphs Drawn With Some Vertices per Face: Density and Relationships.
IEEE Access, 2024

Hybrid Multilayer Network Visualization of Bibliographic Data.
Proceedings of the 26th Eurographics Conference on Visualization, 2024

Partial Temporal Vertex Cover with Bounded Activity Intervals.
Proceedings of the 3rd Symposium on Algorithmic Foundations of Dynamic Networks, 2024

Bundling-Aware Graph Drawing.
Proceedings of the 32nd International Symposium on Graph Drawing and Network Visualization, 2024

2023
k-Planar Placement and Packing of Δ-Regular Caterpillars.
Int. J. Found. Comput. Sci., November, 2023

On the parameterized complexity of s-club cluster deletion problems.
Theor. Comput. Sci., August, 2023

Parameterized complexity of graph planarity with restricted cyclic orders.
J. Comput. Syst. Sci., August, 2023

Small Point-Sets Supporting Graph Stories.
J. Graph Algorithms Appl., 2023

Nonplanar Graph Drawings with k Vertices per Face.
Proceedings of the Graph-Theoretic Concepts in Computer Science, 2023

Evaluating Animation Parameters for Morphing Edge Drawings.
Proceedings of the Graph Drawing and Network Visualization - 31st International Symposium, 2023

Min-k-planar Drawings of Graphs.
Proceedings of the Graph Drawing and Network Visualization - 31st International Symposium, 2023

2022
Hybrid Graph Visualizations With ChordLink: Algorithms, Experiments, and Applications.
IEEE Trans. Vis. Comput. Graph., 2022

On the Parameterized Complexity of the s-Club Cluster Edge Deletion Problem.
CoRR, 2022

On the Parametrized Complexity of the s-Club Cluster Edge Deletion Problem.
Proceedings of the 23rd Italian Conference on Theoretical Computer Science, 2022

2021
Simultaneous FPQ-ordering and hybrid planarity testing.
Theor. Comput. Sci., 2021

Ortho-polygon visibility representations of 3-connected 1-plane graphs.
Theor. Comput. Sci., 2021

(<i>k</i>, <i>p</i>)-planarity: A relaxation of hybrid planarity.
Theor. Comput. Sci., 2021

Packing Trees into 1-planar Graphs.
J. Graph Algorithms Appl., 2021

A User Study on Hybrid Graph Visualizations.
Proceedings of the Graph Drawing and Network Visualization - 29th International Symposium, 2021

Quasi-upward Planar Drawings with Minimum Curve Complexity.
Proceedings of the Graph Drawing and Network Visualization - 29th International Symposium, 2021

2020
Graph Planarity by Replacing Cliques with Paths.
Algorithms, 2020

Storyline Visualizations with Ubiquitous Actors.
Proceedings of the Graph Drawing and Network Visualization - 28th International Symposium, 2020

2019
Greedy rectilinear drawings.
Theor. Comput. Sci., 2019

Pole Dancing: 3D Morphs for Tree Drawings.
J. Graph Algorithms Appl., 2019

Coloring outerplanar graphs and planar 3-trees with small monochromatic components.
CoRR, 2019

Graph Planarity Testing with Hierarchical Embedding Constraints.
CoRR, 2019

NodeTrix Planarity Testing with Small Clusters.
Algorithmica, 2019

(k, p)-Planarity: A Relaxation of Hybrid Planarity.
Proceedings of the WALCOM: Algorithms and Computation - 13th International Conference, 2019

ChordLink: A New Hybrid Visualization Model.
Proceedings of the Graph Drawing and Network Visualization - 27th International Symposium, 2019

2018
(k, p)-Planarity: A Generalization of Hybrid Planarity.
CoRR, 2018

A Matrix Approach for Weighted Argumentation Frameworks: a Preliminary Report.
CoRR, 2018

Turning Cliques into Paths to Achieve Planarity.
Proceedings of the Graph Drawing and Network Visualization - 26th International Symposium, 2018

A Matrix Approach for Weighted Argumentation Frameworks.
Proceedings of the Thirty-First International Florida Artificial Intelligence Research Society Conference, 2018

2017
NodeTrix Planarity Testing with Small Clusters.
Proceedings of the Graph Drawing and Network Visualization - 25th International Symposium, 2017

2016
Partial edge drawing: Homogeneity is more important than crossings and ink.
Proceedings of the 7th International Conference on Information, 2016


  Loading...