Stefano Leucci
Orcid: 0000-0002-8848-7006Affiliations:
- University of L'Aquila, Italy
- ETH Zürich, Switzerland
According to our database1,
Stefano Leucci
authored at least 56 papers
between 2013 and 2024.
Collaborative distances:
Collaborative distances:
Timeline
2014
2016
2018
2020
2022
2024
0
1
2
3
4
5
6
7
8
9
3
1
4
3
4
2
5
1
2
3
5
1
2
3
3
3
4
3
2
1
1
Legend:
Book In proceedings Article PhD thesis Dataset OtherLinks
Online presence:
-
on orcid.org
On csauthors.net:
Bibliography
2024
CoRR, 2024
Proceedings of the 35th International Symposium on Algorithms and Computation, 2024
On the Inapproximability of Finding Minimum Monitoring Edge-Geodetic Sets (short paper).
Proceedings of the 25th Italian Conference on Theoretical Computer Science, 2024
Proceedings of the 12th International Conference on Fun with Algorithms, 2024
Proceedings of the 12th International Conference on Fun with Algorithms, 2024
Proceedings of the 32nd Annual European Symposium on Algorithms, 2024
2023
Resilient Level Ancestor, Bottleneck, and Lowest Common Ancestor Queries in Dynamic Trees.
Algorithmica, June, 2023
Proceedings of the Algorithms and Data Structures - 18th International Symposium, 2023
2022
Theor. Comput. Sci., 2022
Proceedings of the 39th International Symposium on Theoretical Aspects of Computer Science, 2022
Proceedings of the 30th Annual European Symposium on Algorithms, 2022
2021
ACM Trans. Knowl. Discov. Data, 2021
Finding single-source shortest p-disjoint paths: fast computation and sparse preservers.
CoRR, 2021
2020
Theor. Comput. Sci., 2020
Theory Comput. Syst., 2020
Algorithmica, 2020
2019
Proc. VLDB Endow., 2019
Hardness, approximability, and fixed-parameter tractability of the clustered shortest-path tree problem.
J. Comb. Optim., 2019
Proceedings of the 30th International Symposium on Algorithms and Computation, 2019
Proceedings of the 27th Annual European Symposium on Algorithms, 2019
Proceedings of the 27th Annual European Symposium on Algorithms, 2019
2018
No truthful mechanism can be better than <i>n</i> approximate for two natural problems.
Games Econ. Behav., 2018
A Nearly Optimal Algorithm for Approximate Minimum Selection with Unreliable Comparisons.
CoRR, 2018
Proceedings of the 35th Symposium on Theoretical Aspects of Computer Science, 2018
Proceedings of the 9th International Conference on Fun with Algorithms, 2018
Proceedings of the 9th International Conference on Fun with Algorithms, 2018
2017
CoRR, 2017
Proceedings of the Tenth ACM International Conference on Web Search and Data Mining, 2017
Proceedings of the Structural Information and Communication Complexity, 2017
Proceedings of the 28th International Symposium on Algorithms and Computation, 2017
2016
PhD thesis, 2016
Exact and approximate algorithms for movement problems on (special classes of) graphs.
Theor. Comput. Sci., 2016
Proceedings of the 22nd ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, 2016
Proceedings of the 17th Italian Conference on Theoretical Computer Science, 2016
Proceedings of the 8th International Conference on Fun with Algorithms, 2016
Proceedings of the 24th Annual European Symposium on Algorithms, 2016
2015
Theor. Comput. Sci., 2015
Theor. Comput. Sci., 2015
Dynamic Maintenance of a Shortest-Path Tree on Homogeneous Batches of Updates: New Algorithms and Experiments.
ACM J. Exp. Algorithmics, 2015
Proceedings of the Structural Information and Communication Complexity, 2015
Proceedings of the Structural Information and Communication Complexity, 2015
Proceedings of the Algorithms - ESA 2015, 2015
2014
Experimental Evaluation of Dynamic Shortest Path Tree Algorithms on Homogeneous Batches.
Proceedings of the Experimental Algorithms - 13th International Symposium, 2014
Proceedings of the 2014 IEEE Conference on Computational Intelligence and Games, 2014
2013
Proceedings of the Structural Information and Communication Complexity, 2013