( en | de | ru )

 

Disambiguation of "Williams, Virginia Vassilevska"

Author of the publication

copydeleteadd this publication to your clipboard
Algorithms and Hardness for Diameter in Dynamic Graphs.

, , , , and . ICALP, volume 132 of LIPIcs, page 13:1-13:14. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2019)

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.

Virginia Teuteberg

Virginia Spanoudaki

Virginia Papailiopoulou

Virginia Smith

Simone Williams

 

Other publications of authors with the same name

RNA-Folding - From Hardness to Algorithms.. MFCS, volume 58 of LIPIcs, page 5:1-5:1. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2016)Manipulating Stochastically Generated Single-Elimination Tournaments for Nearly All Players., and . WINE, volume 7090 of Lecture Notes in Computer Science, page 326-337. Springer, (2011)Knockout Tournaments.. Handbook of Computational Social Choice, Cambridge University Press, (2016)Simulating Branching Programs with Edit Distance and Friends or: A Polylog Shaved is a Lower Bound Made., , , and . CoRR, (2015)Finding, Minimizing, and Counting Weighted Subgraphs., and . SIAM J. Comput., 42 (3): 831-854 (2013)Subtree Isomorphism Revisited., , , , and . ACM Trans. Algorithms, 14 (3): 27:1-27:23 (2018)3SUM and Related Problems in Fine-Grained Complexity (Invited Talk).. SoCG, volume 189 of LIPIcs, page 2:1-2:2. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2021)New Lower Bounds and Upper Bounds for Listing Avoidable Vertices., , and . MFCS, volume 241 of LIPIcs, page 41:1-41:14. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2022)Complexity of the Stable Invitations Problem., and . AAAI, page 579-585. AAAI Press, (2017)Simpler and Higher Lower Bounds for Shortcut Sets., , and . CoRR, (2023)