Tommaso Piselli

Orcid: 0000-0002-7088-920X

According to our database1, Tommaso Piselli authored at least 17 papers between 2022 and 2026.

Collaborative distances:

Timeline

Legend:

Book  In proceedings  Article  PhD thesis  Dataset  Other 

Links

On csauthors.net:

Bibliography

2026
Collaborative Problem Solving in Mixed Reality: A Study on Visual Graph Analysis - Replication data.
Dataset, February, 2026

F<sup>2</sup>Stories: A Modular Framework for Multi-Objective Optimization of Storylines with a Focus on Fairness.
IEEE Trans. Vis. Comput. Graph., January, 2026

2025
Collaborative Problem Solving in Mixed Reality: A Study on Visual Graph Analysis - Replication data.
Dataset, October, 2025

Graph Drawing for LLMs: An Empirical Evaluation.
CoRR, May, 2025

Bundling-Aware Graph Drawing Revisited.
IEEE Trans. Vis. Comput. Graph., 2025

Introducing fairness in network visualization.
Inf. Sci., 2025

2024
Collaborative Problem Solving in Mixed Reality: A Study on Visual Graph Analysis - Replication data.
Dataset, December, 2024

Collaborative Problem Solving in Mixed Reality: A Study on Visual Graph Analysis.
CoRR, 2024

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

Introducing Fairness in Graph Visualization via Gradient Descent.
Proceedings of the Machine Learning Methods in Visualisation for Big Data 2024, 2024

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

Introducing Fairness in Graph Visualization (Poster Abstract).
Proceedings of the 32nd International Symposium on Graph Drawing and Network Visualization, 2024

2023
On the Parameterized Complexity of s-club Cluster Deletion Problems.
Proceedings of the SOFSEM 2023: Theory and Practice of Computer Science, 2023

On the Parameterized Complexity of Computing st-Orientations with Few Transitive Edges.
Proceedings of the 48th International Symposium on Mathematical Foundations of Computer Science, 2023

On the Parameterized Complexity of Computing st-Orientations with Few Transitive Edges (short paper).
Proceedings of the 24th Italian Conference on Theoretical Computer Science, 2023

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


  Loading...