Stefano Leucci

Available identifiers

zbMath Open leucci.stefanoMaRDI QIDQ338391

List of research outcomes

Publication	Date of Publication	Type
Blackout-tolerant temporal spanners	2024-01-22	Paper
Finding diameter-reducing shortcuts in trees	2024-01-16	Paper
https://portal.mardi4nfdi.de/entity/Q6187834	2024-01-15	Paper
Blackout-tolerant temporal spanners	2023-08-04	Paper
Resilient level ancestor, bottleneck, and lowest common ancestor queries in dynamic trees	2023-06-05	Paper
https://portal.mardi4nfdi.de/entity/Q5875632	2023-02-03	Paper
New approximation algorithms for the heterogeneous weighted delivery problem	2022-09-16	Paper
https://portal.mardi4nfdi.de/entity/Q5075792	2022-05-11	Paper
https://portal.mardi4nfdi.de/entity/Q5075817	2022-05-11	Paper
New approximation algorithms for the heterogeneous weighted delivery problem	2022-03-22	Paper
Cutting bamboo down to size	2022-03-01	Paper
Multiple-edge-fault-tolerant approximate shortest-path trees	2022-02-01	Paper
Approximate minimum selection with unreliable comparisons	2022-02-01	Paper
https://portal.mardi4nfdi.de/entity/Q5136230	2020-11-25	Paper
https://portal.mardi4nfdi.de/entity/Q5136257	2020-11-25	Paper
Tracking routes in communication networks	2020-10-21	Paper
Tracks from hell -- when finding a proof may be easier than checking it	2020-09-03	Paper
https://portal.mardi4nfdi.de/entity/Q3305722	2020-08-11	Paper
https://portal.mardi4nfdi.de/entity/Q3305725	2020-08-11	Paper
https://portal.mardi4nfdi.de/entity/Q3305726	2020-08-11	Paper
https://portal.mardi4nfdi.de/entity/Q3304107	2020-08-05	Paper
https://portal.mardi4nfdi.de/entity/Q3304135	2020-08-05	Paper
Optimal dislocation with persistent errors in subquadratic time	2020-04-15	Paper
An improved algorithm for computing all the best swap edges of a tree spanner	2020-04-09	Paper
Tracking routes in communication networks	2020-03-03	Paper
Hardness, approximability, and fixed-parameter tractability of the clustered shortest-path tree problem	2019-06-25	Paper
Trainyard is NP-hard	2018-11-23	Paper
Fault-tolerant approximate shortest-path trees	2018-10-18	Paper
No truthful mechanism can be better than \(n\) approximate for two natural problems	2018-10-12	Paper
Effective edge-fault-tolerant single-source spanners via best (or good) swap edges	2018-04-12	Paper
https://portal.mardi4nfdi.de/entity/Q4606282	2018-03-02	Paper
https://portal.mardi4nfdi.de/entity/Q4601870	2018-01-24	Paper
https://portal.mardi4nfdi.de/entity/Q5282799	2017-07-17	Paper
https://portal.mardi4nfdi.de/entity/Q5282816	2017-07-17	Paper
Exact and approximate algorithms for movement problems on (special classes of) graphs	2016-11-04	Paper
Dynamic Maintenance of a Shortest-Path Tree on Homogeneous Batches of Updates	2016-10-24	Paper
Path-Fault-Tolerant Approximate Shortest-Path Trees	2016-01-08	Paper
A Faster Computation of All the Best Swap Edges of a Tree Spanner	2016-01-08	Paper
Improved Purely Additive Fault-Tolerant Spanners	2015-11-19	Paper
The max-distance network creation game on general host graphs	2015-02-24	Paper
Specializations and generalizations of the Stackelberg minimum spanning tree game	2014-12-02	Paper
Fault-Tolerant Approximate Shortest-Path Trees	2014-10-08	Paper
Network Creation Games with Traceroute-Based Strategies	2014-08-07	Paper
Dynamically Maintaining Shortest Path Trees under Batches of Updates	2013-12-17	Paper
Exact and Approximate Algorithms for Movement Problems on (Special Classes of) Graphs	2013-12-17	Paper
The Max-Distance Network Creation Game on General Host Graphs	2013-04-11	Paper

Research outcomes over time

Doctoral students

No records found.

Known relations from the MaRDI Knowledge Graph

Property	Value
MaRDI profile type	MaRDI person profile
instance of	human

This page was built for person: Stefano Leucci