Stefano Leucci

Orcid: 0000-0002-8848-7006

Affiliations:

University of L'Aquila, Italy
ETH Zürich, Switzerland

According to our database¹, Stefano Leucci authored at least 49 papers between 2013 and 2024.

Collaborative distances:

Dijkstra number² of four.
Erdős number³ of three.

Timeline

Legend:

Book

In proceedings

Article

PhD thesis

Dataset

Other

Bibliography

2024

Blackout-tolerant temporal spanners.

[BibT_eX]

[DOI]

J. Comput. Syst. Sci., May, 2024

2023

Resilient Level Ancestor, Bottleneck, and Lowest Common Ancestor Queries in Dynamic Trees.

[BibT_eX]

[DOI]

Luciano Gualà

Stefano Leucci

Isabella Ziccardi

Algorithmica, June, 2023

Finding Diameter-Reducing Shortcuts in Trees.

[BibT_eX]

[DOI]

Proceedings of the Algorithms and Data Structures - 18th International Symposium, 2023

2022

New approximation algorithms for the heterogeneous weighted delivery problem.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2022

Cutting bamboo down to size.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2022

Approximate Minimum Selection with Unreliable Comparisons.

[BibT_eX]

[DOI]

Stefano Leucci

Chih-Hung Liu

Algorithmica, 2022

Multiple-Edge-Fault-Tolerant Approximate Shortest-Path Trees.

[BibT_eX]

[DOI]

Algorithmica, 2022

Single-Source Shortest p-Disjoint Paths: Fast Computation and Sparse Preservers.

[BibT_eX]

[DOI]

Proceedings of the 39th International Symposium on Theoretical Aspects of Computer Science, 2022

Sparse Temporal Spanners with Low Stretch.

[BibT_eX]

[DOI]

Proceedings of the 30th Annual European Symposium on Algorithms, 2022

2021

Faster Motif Counting via Succinct Color Coding and Adaptive Sampling.

[BibT_eX]

[DOI]

Marco Bressan

Stefano Leucci

Alessandro Panconesi

ACM Trans. Knowl. Discov. Data, 2021

Finding single-source shortest p-disjoint paths: fast computation and sparse preservers.

[BibT_eX]

[DOI]

CoRR, 2021

Network Creation Games with Traceroute-Based Strategies.

[BibT_eX]

[DOI]

Algorithms, 2021

2020

Tracking routes in communication networks.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2020

Tracks from hell - When finding a proof may be easier than checking it.

[BibT_eX]

[DOI]

Matteo Almanza

Stefano Leucci

Alessandro Panconesi

Theor. Comput. Sci., 2020

Optimal Dislocation with Persistent Errors in Subquadratic Time.

[BibT_eX]

[DOI]

Theory Comput. Syst., 2020

An Improved Algorithm for Computing All the Best Swap Edges of a Tree Spanner.

[BibT_eX]

[DOI]

Algorithmica, 2020

2019

Motivo: Fast Motif Counting via Succinct Color Coding and Adaptive Sampling.

[BibT_eX]

[DOI]

Marco Bressan

Stefano Leucci

Alessandro Panconesi

Proc. VLDB Endow., 2019

Hardness, approximability, and fixed-parameter tractability of the clustered shortest-path tree problem.

[BibT_eX]

[DOI]

J. Comb. Optim., 2019

Dual-Mode Greedy Algorithms Can Save Energy.

[BibT_eX]

[DOI]

Proceedings of the 30th International Symposium on Algorithms and Computation, 2019

Optimal Sorting with Persistent Comparison Errors.

[BibT_eX]

[DOI]

Proceedings of the 27th Annual European Symposium on Algorithms, 2019

Resilient Dictionaries for Randomly Unreliable Memory.

[BibT_eX]

[DOI]

Stefano Leucci

Chih-Hung Liu

Simon Meierhans

Proceedings of the 27th Annual European Symposium on Algorithms, 2019

2018

Motif Counting Beyond Five Nodes.

[BibT_eX]

[DOI]

ACM Trans. Knowl. Discov. Data, 2018

Trainyard is NP-Hard.

[BibT_eX]

[DOI]

Matteo Almanza

Stefano Leucci

Alessandro Panconesi

Theor. Comput. Sci., 2018

No truthful mechanism can be better than <i>n</i> approximate for two natural problems.

[BibT_eX]

[DOI]

Stefano Leucci

Akaki Mamageishvili

Paolo Penna

Games Econ. Behav., 2018

A Nearly Optimal Algorithm for Approximate Minimum Selection with Unreliable Comparisons.

[BibT_eX]

[DOI]

Stefano Leucci

Chih-Hung Liu

CoRR, 2018

Fault-Tolerant Approximate Shortest-Path Trees.

[BibT_eX]

[DOI]

Algorithmica, 2018

Efficient Oracles and Routing Schemes for Replacement Paths.

[BibT_eX]

[DOI]

Proceedings of the 35th Symposium on Theoretical Aspects of Computer Science, 2018

On the PSPACE-completeness of Peg Duotaire and other Peg-Jumping Games.

[BibT_eX]

[DOI]

Proceedings of the 9th International Conference on Fun with Algorithms, 2018

On the Complexity of Two Dots for Narrow Boards and Few Colors.

[BibT_eX]

[DOI]

Proceedings of the 9th International Conference on Fun with Algorithms, 2018

2017

No truthful mechanism can be better than n approximate for two natural problems.

[BibT_eX]

[DOI]

Stefano Leucci

Akaki Mamageishvili

Paolo Penna

CoRR, 2017

Counting Graphlets: Space vs Time.

[BibT_eX]

[DOI]

Proceedings of the Tenth ACM International Conference on Web Search and Data Mining, 2017

Effective Edge-Fault-Tolerant Single-Source Spanners via Best (or Good) Swap Edges.

[BibT_eX]

[DOI]

Proceedings of the Structural Information and Communication Complexity, 2017

Sorting with Recurrent Comparison Errors.

[BibT_eX]

[DOI]

Proceedings of the 28th International Symposium on Algorithms and Computation, 2017

2016

On the size-stretch tradeoff in fault-tolerant spanners and autonomous networks.

[BibT_eX]

[DOI]

Stefano Leucci

PhD thesis, 2016

Locality-Based Network Creation Games.

[BibT_eX]

[DOI]

ACM Trans. Parallel Comput., 2016

Exact and approximate algorithms for movement problems on (special classes of) graphs.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2016

The Limits of Popularity-Based Recommendations, and the Role of Social Ties.

[BibT_eX]

[DOI]

Proceedings of the 22nd ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, 2016

On the Clustered Shortest-Path Tree Problem.

[BibT_eX]

[DOI]

Proceedings of the 17th Italian Conference on Theoretical Computer Science, 2016

Large Peg-Army Maneuvers.

[BibT_eX]

[DOI]

Proceedings of the 8th International Conference on Fun with Algorithms, 2016

Compact and Fast Sensitivity Oracles for Single-Source Distances.

[BibT_eX]

[DOI]

Proceedings of the 24th Annual European Symposium on Algorithms, 2016

2015

Specializations and generalizations of the Stackelberg minimum spanning tree game.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2015

The max-distance network creation game on general host graphs.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2015

Dynamic Maintenance of a Shortest-Path Tree on Homogeneous Batches of Updates: New Algorithms and Experiments.

[BibT_eX]

[DOI]

ACM J. Exp. Algorithmics, 2015

Path-Fault-Tolerant Approximate Shortest-Path Trees.

[BibT_eX]

[DOI]

Proceedings of the Structural Information and Communication Complexity, 2015

A Faster Computation of All the Best Swap Edges of a Tree Spanner.

[BibT_eX]

[DOI]

Proceedings of the Structural Information and Communication Complexity, 2015

Improved Purely Additive Fault-Tolerant Spanners.

[BibT_eX]

[DOI]

Proceedings of the Algorithms - ESA 2015, 2015

2014

Experimental Evaluation of Dynamic Shortest Path Tree Algorithms on Homogeneous Batches.

[BibT_eX]

[DOI]

Proceedings of the Experimental Algorithms - 13th International Symposium, 2014

Bejeweled, Candy Crush and other match-three games are (NP-)hard.

[BibT_eX]

[DOI]

Luciano Gualà

Stefano Leucci

Emanuele Natale

Proceedings of the 2014 IEEE Conference on Computational Intelligence and Games, 2014

2013

Dynamically Maintaining Shortest Path Trees under Batches of Updates.

[BibT_eX]

[DOI]

Proceedings of the Structural Information and Communication Complexity, 2013

Stefano Leucci

Timeline

Legend:

Links

Online presence:

On csauthors.net:

Bibliography

Loading...