( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
New algorithms and hardness for incremental single-source shortest paths in directed graphs.

, , и . STOC, стр. 153-166. ACM, (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.

Virginia Teuteberg

Virginia Spanoudaki

Virginia Papailiopoulou

Virginia Smith

Simone Williams

 

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

Knockout Tournaments.. Handbook of Computational Social Choice, Cambridge University Press, (2016)RNA-Folding - From Hardness to Algorithms.. MFCS, том 58 из LIPIcs, стр. 5:1-5:1. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2016)Finding, Minimizing, and Counting Weighted Subgraphs., и . SIAM J. Comput., 42 (3): 831-854 (2013)Simulating Branching Programs with Edit Distance and Friends or: A Polylog Shaved is a Lower Bound Made., , , и . CoRR, (2015)Manipulating Stochastically Generated Single-Elimination Tournaments for Nearly All Players., и . WINE, том 7090 из Lecture Notes in Computer Science, стр. 326-337. Springer, (2011)Subtree Isomorphism Revisited., , , , и . ACM Trans. Algorithms, 14 (3): 27:1-27:23 (2018)Public-Key Cryptography in the Fine-Grained Setting., , и . CRYPTO (3), том 11694 из Lecture Notes in Computer Science, стр. 605-635. Springer, (2019)Simpler and Higher Lower Bounds for Shortcut Sets., , и . CoRR, (2023)Equivalences between triangle and range query problems., , , и . SODA, стр. 30-47. SIAM, (2020)Tight Hardness for Shortest Cycles and Paths in Sparse Graphs., , и . SODA, стр. 1236-1252. SIAM, (2018)