( en | de | ru )

 

Disambiguation of "Leucci, Stefano"

Author of the publication

copydeleteadd this publication to your clipboard
On the Clustered Shortest-Path Tree Problem.

, , , , and . ICTCS, volume 1720 of CEUR Workshop Proceedings, page 263-268. CEUR-WS.org, (2016)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

Stefano Meini

Stefano Cracolici

Stefano Cardanobile

Giovanni Stefano

Stefano Carignano

 

Other publications of authors with the same name

Trainyard is NP-Hard., , and . Theor. Comput. Sci., (2018)Cutting Bamboo Down to Size., , , , and . CoRR, (2020)The Max-Distance Network Creation Game on General Host Graphs., , , and . CoRR, (2014)Approximate Minimum Selection with Unreliable Comparisons., and . Algorithmica, 84 (1): 60-84 (2022)Multiple-Edge-Fault-Tolerant Approximate Shortest-Path Trees., , , and . Algorithmica, 84 (1): 37-59 (2022)Finding single-source shortest p-disjoint paths: fast computation and sparse preservers., , , , , and . CoRR, (2021)Blackout-Tolerant Temporal Spanners., , , , and . ALGOSENSORS, volume 13707 of Lecture Notes in Computer Science, page 31-44. Springer, (2022)A Faster Computation of All the Best Swap Edges of a Tree Spanner., , , , and . SIROCCO, volume 9439 of Lecture Notes in Computer Science, page 239-253. Springer, (2015)Path-Fault-Tolerant Approximate Shortest-Path Trees., , , , and . SIROCCO, volume 9439 of Lecture Notes in Computer Science, page 224-238. Springer, (2015)Efficient Oracles and Routing Schemes for Replacement Paths., , , , , and . STACS, volume 96 of LIPIcs, page 13:1-13:15. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2018)