Stefano Leucci

According to our database1, Stefano Leucci authored at least 38 papers between 2013 and 2020.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

Homepages:

On csauthors.net:

Bibliography

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

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

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

Tracking Routes in Communication Networks.
Proceedings of the Structural Information and Communication Complexity, 2019

Dual-Mode Greedy Algorithms Can Save Energy.
Proceedings of the 30th International Symposium on Algorithms and Computation, 2019

Optimal Sorting with Persistent Comparison Errors.
Proceedings of the 27th Annual European Symposium on Algorithms, 2019

Resilient Dictionaries for Randomly Unreliable Memory.
Proceedings of the 27th Annual European Symposium on Algorithms, 2019

2018
Motif Counting Beyond Five Nodes.
TKDD, 2018

Trainyard is NP-Hard.
Theor. Comput. Sci., 2018

No truthful mechanism can be better than n approximate for two natural problems.
Games Econ. Behav., 2018

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

Fault-Tolerant Approximate Shortest-Path Trees.
Algorithmica, 2018

Optimal Dislocation with Persistent Errors in Subquadratic Time.
Proceedings of the 35th Symposium on Theoretical Aspects of Computer Science, 2018

Efficient Oracles and Routing Schemes for Replacement Paths.
Proceedings of the 35th Symposium on Theoretical Aspects of Computer Science, 2018

On the PSPACE-completeness of Peg Duotaire and other Peg-Jumping Games.
Proceedings of the 9th International Conference on Fun with Algorithms, 2018

On the Complexity of Two Dots for Narrow Boards and Few Colors.
Proceedings of the 9th International Conference on Fun with Algorithms, 2018

Tracks from hell - when finding a proof may be easier than checking it.
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.
CoRR, 2017

Counting Graphlets: Space vs Time.
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.
Proceedings of the Structural Information and Communication Complexity, 2017

Sorting with Recurrent Comparison Errors.
Proceedings of the 28th International Symposium on Algorithms and Computation, 2017

2016
Locality-Based Network Creation Games.
TOPC, 2016

Exact and approximate algorithms for movement problems on (special classes of) graphs.
Theor. Comput. Sci., 2016

Multiple-Edge-Fault-Tolerant Approximate Shortest-Path Trees.
Proceedings of the 33rd Symposium on Theoretical Aspects of Computer Science, 2016

The Limits of Popularity-Based Recommendations, and the Role of Social Ties.
Proceedings of the 22nd ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, 2016

On the Clustered Shortest-Path Tree Problem.
Proceedings of the 17th Italian Conference on Theoretical Computer Science, 2016

Large Peg-Army Maneuvers.
Proceedings of the 8th International Conference on Fun with Algorithms, 2016

Compact and Fast Sensitivity Oracles for Single-Source Distances.
Proceedings of the 24th Annual European Symposium on Algorithms, 2016

2015
Specializations and generalizations of the Stackelberg minimum spanning tree game.
Theor. Comput. Sci., 2015

The max-distance network creation game on general host graphs.
Theor. Comput. Sci., 2015

Dynamic Maintenance of a Shortest-Path Tree on Homogeneous Batches of Updates: New Algorithms and Experiments.
ACM Journal of Experimental Algorithmics, 2015

Path-Fault-Tolerant Approximate Shortest-Path Trees.
Proceedings of the Structural Information and Communication Complexity, 2015

A Faster Computation of All the Best Swap Edges of a Tree Spanner.
Proceedings of the Structural Information and Communication Complexity, 2015

Improved Purely Additive Fault-Tolerant Spanners.
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

Network Creation Games with Traceroute-Based Strategies.
Proceedings of the Structural Information and Communication Complexity, 2014

Bejeweled, Candy Crush and other match-three games are (NP-)hard.
Proceedings of the 2014 IEEE Conference on Computational Intelligence and Games, 2014

2013
Dynamically Maintaining Shortest Path Trees under Batches of Updates.
Proceedings of the Structural Information and Communication Complexity, 2013


  Loading...