( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
New Algorithms for Examination Timetabling.

, , и . WAE, том 1982 из Lecture Notes in Computer Science, стр. 230-242. Springer, (2000)

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.

Giuseppe F Vercellino

Giuseppe F Miozzari

Giuseppe Veltri

Giuseppe Olivato

Giuseppe Amato

 

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

Concurrent Algorithms and Data Types Animation over the Internet., , , и . IFIP Congress: Fundamentals - Foundations of Computer Science, том 117 из books@ocg.at, стр. 63-80. Austrian Computer Society, (1998)The Set Union Problem With Unlimited Backtracking., , , и . SIAM J. Comput., 23 (1): 50-70 (1994)Planar Reachability Under Single Vertex or Edge Failures., , и . SODA, стр. 2739-2758. SIAM, (2021)Engineering Shortest Path Algorithms., и . WEA, том 3059 из Lecture Notes in Computer Science, стр. 191-198. Springer, (2004)Inferring Tie Strength in Temporal Networks., , и . ECML/PKDD (2), том 13714 из Lecture Notes in Computer Science, стр. 69-85. Springer, (2022)Computing 2-Connected Components and Maximal 2-Connected Subgraphs in Directed Graphs: An Experimental Study., , , , и . ALENEX, стр. 169-183. SIAM, (2018)All-Pairs $2$-reachability in Õ(nω) Time., , , , и . CoRR, (2016)Dominating Sets and Connected Dominating Sets in Dynamic Graphs., , , и . STACS, том 126 из LIPIcs, стр. 35:1-35:17. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2019)The (not so) Critical Nodes of Criminal Networks., , и . SocInfo Workshops, том 8852 из Lecture Notes in Computer Science, стр. 87-96. Springer, (2014)Efficient cross-trees for external memory., и . External Memory Algorithms, том 50 из DIMACS Series in Discrete Mathematics and Theoretical Computer Science, стр. 87-106. DIMACS/AMS, (1998)