( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
Large Peg-Army Maneuvers.

, , , и . FUN, том 49 из LIPIcs, стр. 18:1-18:15. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (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.

Stefano Meini

Stefano Cracolici

Stefano Cardanobile

Stefano Carignano

Giovanni Stefano

 

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

Specializations and Generalizations of the Stackelberg Minimum Spanning Tree Game., , , и . CoRR, (2014)Tracks from hell - When finding a proof may be easier than checking it., , и . Theor. Comput. Sci., (2020)Fault-Tolerant Approximate Shortest-Path Trees., , , и . Algorithmica, 80 (12): 3437-3460 (2018)Improved Purely Additive Fault-Tolerant Spanners., , , , и . ESA, том 9294 из Lecture Notes in Computer Science, стр. 167-178. Springer, (2015)Sorting with Recurrent Comparison Errors., , , и . ISAAC, том 92 из LIPIcs, стр. 38:1-38:12. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2017)The Max-Distance Network Creation Game on General Host Graphs., , , и . WINE, том 7695 из Lecture Notes in Computer Science, стр. 392-405. Springer, (2012)Experimental Evaluation of Dynamic Shortest Path Tree Algorithms on Homogeneous Batches., , , , и . SEA, том 8504 из Lecture Notes in Computer Science, стр. 283-294. Springer, (2014)Resilient Level Ancestor, Bottleneck, and Lowest Common Ancestor Queries in Dynamic Trees., , и . ISAAC, том 212 из LIPIcs, стр. 66:1-66:17. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2021)Graph Spanners for Group Steiner Distances., , , и . CoRR, (2024)The Max-Distance Network Creation Game on General Host Graphs., , , и . CoRR, (2014)