( en | de | ru )

 

Disambiguation of "Gualà, Luciano"

Author of the publication

copydeleteadd this publication to your clipboard
New approximation algorithms for the heterogeneous weighted delivery problem.

, , , , and . Theor. Comput. Sci., (2022)

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.

Luciano Trincia

Luciano Lazzaro

Luciano Bello

Luciano Lampante

Luciano Rezzolla

 

Other publications of authors with the same name

Cutting Bamboo Down to Size., , , , and . CoRR, (2020)The Max-Distance Network Creation Game on General Host Graphs., , , and . CoRR, (2014)Multiple-Edge-Fault-Tolerant Approximate Shortest-Path Trees., , , and . Algorithmica, 84 (1): 37-59 (2022)Exact and Approximate Truthful Mechanisms for the Shortest Paths Tree Problem., and . Algorithmica, 49 (3): 171-191 (2007)Finding single-source shortest p-disjoint paths: fast computation and sparse preservers., , , , , and . CoRR, (2021)Hardness of an Asymmetric 2-Player Stackelberg Network Pricing Game., , and . Algorithms, 14 (1): 8 (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)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)Network Verification via Routing Table Queries., , , , , and . SIROCCO, volume 6796 of Lecture Notes in Computer Science, page 270-281. Springer, (2011)