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 58 papers between 2010 and 2025.

Collaborative distances:

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

Timeline

Legend:

Book

In proceedings

Article

PhD thesis

Dataset

Other

Bibliography

2025

An Optimal Sorting Algorithm for Persistent Random Comparison Faults.

[BibT_eX]

[DOI]

CoRR, August, 2025

On the (In)Approximability of the Monitoring Edge Geodetic Set Problem.

[BibT_eX]

[DOI]

CoRR, July, 2025

On the Approximability of Graph Visibility Problems.

[BibT_eX]

[DOI]

Proceedings of the WALCOM: Algorithms and Computation, 2025

2024

On the Inapproximability of Finding Minimum Monitoring Edge-Geodetic Sets.

[BibT_eX]

[DOI]

CoRR, 2024

Temporal Queries for Dynamic Temporal Forests.

[BibT_eX]

[DOI]

Proceedings of the 35th International Symposium on Algorithms and Computation, 2024

On the Inapproximability of Finding Minimum Monitoring Edge-Geodetic Sets (short paper).

[BibT_eX]

[DOI]

Proceedings of the 25th Italian Conference on Theoretical Computer Science, 2024

Swapping Mixed-Up Beers to Keep Them Cool.

[BibT_eX]

[DOI]

Proceedings of the 12th International Conference on Fun with Algorithms, 2024

Uniform-Budget Solo Chess with Only Rooks or Only Knights Is Hard.

[BibT_eX]

[DOI]

Proceedings of the 12th International Conference on Fun with Algorithms, 2024

Graph Spanners for Group Steiner Distances.

[BibT_eX]

[DOI]

Proceedings of the 32nd Annual European Symposium on Algorithms, 2024

2023

Finding Diameter-Reducing Shortcuts in Trees.

[BibT_eX]

[DOI]

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

2022

Approximate Minimum Selection with Unreliable Comparisons.

[BibT_eX]

[DOI]

Stefano Leucci

Chih-Hung Liu

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

Blackout-Tolerant Temporal Spanners.

[BibT_eX]

[DOI]

Proceedings of the Algorithmics of Wireless Networks, 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

New Approximation Algorithms for the Heterogeneous Weighted Delivery Problem.

[BibT_eX]

[DOI]

Proceedings of the Structural Information and Communication Complexity, 2021

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

[BibT_eX]

[DOI]

Luciano Gualà

Stefano Leucci

Isabella Ziccardi

Proceedings of the 32nd International Symposium on Algorithms and Computation, 2021

Cutting Bamboo down to Size.

[BibT_eX]

[DOI]

Proceedings of the 10th International Conference on Fun with Algorithms, 2021

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

Tracking Routes in Communication Networks.

[BibT_eX]

[DOI]

Proceedings of the Structural Information and Communication Complexity, 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

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

Optimal Dislocation with Persistent Errors in Subquadratic Time.

[BibT_eX]

[DOI]

Proceedings of the 35th Symposium on Theoretical Aspects of Computer Science, 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

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

[BibT_eX]

[DOI]

Matteo Almanza

Stefano Leucci

Alessandro Panconesi

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

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

[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

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

[BibT_eX]

[DOI]

Proceedings of the 33rd Symposium on Theoretical Aspects of Computer Science, 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

Trainyard is NP-hard.

[BibT_eX]

[DOI]

Matteo Almanza

Stefano Leucci

Alessandro Panconesi

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

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

Locality-based network creation games.

[BibT_eX]

[DOI]

Proceedings of the 26th ACM Symposium on Parallelism in Algorithms and Architectures, 2014

Network Creation Games with Traceroute-Based Strategies.

[BibT_eX]

[DOI]

Proceedings of the Structural Information and Communication Complexity, 2014

Fault-Tolerant Approximate Shortest-Path Trees.

[BibT_eX]

[DOI]

Proceedings of the Algorithms - ESA 2014, 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

Exact and Approximate Algorithms for Movement Problems on (Special Classes of) Graphs.

[BibT_eX]

[DOI]

Proceedings of the Structural Information and Communication Complexity, 2013

2012

The Max-Distance Network Creation Game on General Host Graphs.

[BibT_eX]

[DOI]

Proceedings of the Internet and Network Economics - 8th International Workshop, 2012

2010

Specializations and Generalizations of the Stackelberg Minimum Spanning Tree Game.

[BibT_eX]

[DOI]

Proceedings of the Internet and Network Economics - 6th International Workshop, 2010

Stefano Leucci

Timeline

Legend:

Links

Online presence:

On csauthors.net:

Bibliography

Loading...