( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
Optimal Dislocation with Persistent Errors in Subquadratic Time.

, , , и . Theory Comput. Syst., 64 (3): 508-521 (2020)

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.

Stefano Meini

Stefano Cracolici

Stefano Cardanobile

Giovanni Stefano

Stefano Carignano

 

Другие публикации лиц с тем же именем

Cutting Bamboo Down to Size., , , , и . CoRR, (2020)The Max-Distance Network Creation Game on General Host Graphs., , , и . CoRR, (2014)Trainyard is NP-Hard., , и . Theor. Comput. Sci., (2018)Approximate Minimum Selection with Unreliable Comparisons., и . Algorithmica, 84 (1): 60-84 (2022)Multiple-Edge-Fault-Tolerant Approximate Shortest-Path Trees., , , и . Algorithmica, 84 (1): 37-59 (2022)Finding single-source shortest p-disjoint paths: fast computation and sparse preservers., , , , , и . CoRR, (2021)Blackout-Tolerant Temporal Spanners., , , , и . ALGOSENSORS, том 13707 из Lecture Notes in Computer Science, стр. 31-44. Springer, (2022)A Faster Computation of All the Best Swap Edges of a Tree Spanner., , , , и . SIROCCO, том 9439 из Lecture Notes in Computer Science, стр. 239-253. Springer, (2015)Path-Fault-Tolerant Approximate Shortest-Path Trees., , , , и . SIROCCO, том 9439 из Lecture Notes in Computer Science, стр. 224-238. Springer, (2015)Network Creation Games with Traceroute-Based Strategies., , , и . SIROCCO, том 8576 из Lecture Notes in Computer Science, стр. 210-223. Springer, (2014)