Tommaso Piselli

According to our database, Tommaso Piselli authored at least 13 papers between 2022 and 2025.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2025

Graph Drawing for LLMs: An Empirical Evaluation.

Walter Didimo, Fabrizio Montecchiani, Tommaso Piselli

CoRR, May, 2025

Introducing fairness in network visualization.

Peter Eades, Seokhee Hong, Giuseppe Liotta, Fabrizio Montecchiani, Martin Nöllenburg, Tommaso Piselli, Stephen K. Wismath

Inf. Sci., 2025

2024

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

Dimitar Garkov, Tommaso Piselli, Emilio Di Giacomo, Karsten Klein, Giuseppe Liotta, Fabrizio Montecchiani, Falk Schreiber

Dataset, December, 2024

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

Dimitar Garkov, Tommaso Piselli, Emilio Di Giacomo, Karsten Klein, Giuseppe Liotta, Fabrizio Montecchiani, Falk Schreiber

CoRR, 2024

Partial Temporal Vertex Cover with Bounded Activity Intervals.

Riccardo Dondi, Fabrizio Montecchiani, Giacomo Ortali, Tommaso Piselli, Alessandra Tappini

Proceedings of the 3rd Symposium on Algorithmic Foundations of Dynamic Networks, 2024

Introducing Fairness in Graph Visualization via Gradient Descent.

Seok-Hee Hong, Giuseppe Liotta, Fabrizio Montecchiani, Martin Nöllenburg, Tommaso Piselli

Proceedings of the Machine Learning Methods in Visualisation for Big Data 2024, 2024

Bundling-Aware Graph Drawing.

Daniel Archambault, Giuseppe Liotta, Martin Nöllenburg, Tommaso Piselli, Alessandra Tappini, Markus Wallinger

Proceedings of the 32nd International Symposium on Graph Drawing and Network Visualization, 2024

Introducing Fairness in Graph Visualization (Poster Abstract).

Seok-Hee Hong, Giuseppe Liotta, Fabrizio Montecchiani, Martin Nöllenburg, Tommaso Piselli

Proceedings of the 32nd International Symposium on Graph Drawing and Network Visualization, 2024

2023

On the parameterized complexity of s-club cluster deletion problems.

Fabrizio Montecchiani, Giacomo Ortali, Tommaso Piselli, Alessandra Tappini

Theor. Comput. Sci., August, 2023

On the Parameterized Complexity of Computing st-Orientations with Few Transitive Edges.

Carla Binucci, Giuseppe Liotta, Fabrizio Montecchiani, Giacomo Ortali, Tommaso Piselli

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).

Carla Binucci, Giuseppe Liotta, Fabrizio Montecchiani, Giacomo Ortali, Tommaso Piselli

Proceedings of the 24th Italian Conference on Theoretical Computer Science, 2023

2022

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

Fabrizio Montecchiani, Giacomo Ortali, Tommaso Piselli, Alessandra Tappini

CoRR, 2022

On the Parametrized Complexity of the s-Club Cluster Edge Deletion Problem.

Fabrizio Montecchiani, Giacomo Ortali, Tommaso Piselli, Alessandra Tappini

Proceedings of the 23rd Italian Conference on Theoretical Computer Science, 2022