Abboud, Amir; Grandoni, Fabrizio; Vassilevska Williams, Virginia Subcubic equivalences between graph centrality problems, APSP, and diameter. (English) Zbl 07753154 ACM Trans. Algorithms 19, No. 1, Article No. 3, 30 p. (2023). MSC: 68-XX PDFBibTeX XMLCite \textit{A. Abboud} et al., ACM Trans. Algorithms 19, No. 1, Article No. 3, 30 p. (2023; Zbl 07753154) Full Text: DOI
Sheridan, Kristin; Berleant, Joseph; Bathe, Mark; Condon, Anne; Vassilevska Williams, Virginia Factorization and pseudofactorization of weighted graphs. (English) Zbl 1519.05108 Discrete Appl. Math. 337, 81-105 (2023). MSC: 05C22 05C70 05C60 05C76 PDFBibTeX XMLCite \textit{K. Sheridan} et al., Discrete Appl. Math. 337, 81--105 (2023; Zbl 1519.05108) Full Text: DOI arXiv
Backurs, Arturs; Roditty, Liam; Segal, Gilad; Williams, Virginia Vassilevska; Wein, Nicole Toward tight approximation bounds for graph diameter and eccentricities. (English) Zbl 1522.68753 SIAM J. Comput. 50, No. 4, 1155-1199 (2021). MSC: 68W25 05C12 05C85 68Q17 68Q25 68R10 PDFBibTeX XMLCite \textit{A. Backurs} et al., SIAM J. Comput. 50, No. 4, 1155--1199 (2021; Zbl 1522.68753) Full Text: DOI
Dalirrooyfard, Mina; Williams, Virginia Vassilevska; Vyas, Nikhil; Wein, Nicole Tight approximation algorithms for bichromatic graph diameter and related problems. (English) Zbl 07561540 Baier, Christel (ed.) et al., 46th international colloquium on automata, languages, and programming, ICALP 2019, Patras, Greece, July 9–12, 2019. Proceedings. Wadern: Schloss Dagstuhl – Leibniz-Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 132, Article 47, 15 p. (2019). MSC: 68Nxx 68Qxx PDFBibTeX XMLCite \textit{M. Dalirrooyfard} et al., LIPIcs -- Leibniz Int. Proc. Inform. 132, Article 47, 15 p. (2019; Zbl 07561540) Full Text: DOI arXiv
Dalirrooyfard, Mina; Williams, Virginia Vassilevska; Vyas, Nikhil; Wein, Nicole; Xu, Yinzhan; Yu, Yuancheng Approximation algorithms for min-distance problems. (English) Zbl 07561539 Baier, Christel (ed.) et al., 46th international colloquium on automata, languages, and programming, ICALP 2019, Patras, Greece, July 9–12, 2019. Proceedings. Wadern: Schloss Dagstuhl – Leibniz-Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 132, Article 46, 14 p. (2019). MSC: 68Nxx 68Qxx PDFBibTeX XMLCite \textit{M. Dalirrooyfard} et al., LIPIcs -- Leibniz Int. Proc. Inform. 132, Article 46, 14 p. (2019; Zbl 07561539) Full Text: DOI arXiv
Ancona, Bertie; Henzinger, Monika; Roditty, Liam; Williams, Virginia Vassilevska; Wein, Nicole Algorithms and hardness for diameter in dynamic graphs. (English) Zbl 07561506 Baier, Christel (ed.) et al., 46th international colloquium on automata, languages, and programming, ICALP 2019, Patras, Greece, July 9–12, 2019. Proceedings. Wadern: Schloss Dagstuhl – Leibniz-Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 132, Article 13, 14 p. (2019). MSC: 68Nxx 68Qxx PDFBibTeX XMLCite \textit{B. Ancona} et al., LIPIcs -- Leibniz Int. Proc. Inform. 132, Article 13, 14 p. (2019; Zbl 07561506) Full Text: DOI arXiv
Chen, Lijie; Demaine, Erik D.; Gu, Yuzhou; Vassilevska Williams, Virginia; Xu, Yinzhan; Yu, Yuancheng Nearly optimal separation between partially and fully retroactive data structures. (English) Zbl 1477.68077 Eppstein, David (ed.), 16th Scandinavian symposium and workshops on algorithm theory. SWAT 2018, June 18–20, 2018, Malmö University, Malmö, Sweden. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 101, Article 33, 12 p. (2018). MSC: 68P05 68Q17 68Q25 PDFBibTeX XMLCite \textit{L. Chen} et al., LIPIcs -- Leibniz Int. Proc. Inform. 101, Article 33, 12 p. (2018; Zbl 1477.68077) Full Text: DOI arXiv
Abboud, Amir; Vassilevska Williams, Virginia; Yu, Huacheng Matching triangles and basing hardness on an extremely popular conjecture. (English) Zbl 1396.68052 SIAM J. Comput. 47, No. 3, 1098-1122 (2018). MSC: 68Q25 05C21 68Q17 PDFBibTeX XMLCite \textit{A. Abboud} et al., SIAM J. Comput. 47, No. 3, 1098--1122 (2018; Zbl 1396.68052) Full Text: DOI
Henzinger, Monika; Lincoln, Andrea; Neumann, Stefan; Vassilevska Williams, Virginia Conditional hardness for sensitivity problems. (English) Zbl 1402.68075 Papadimitriou, Christos H. (ed.), 8th innovations in theoretical computer science conference, ITCS 2017, Berkeley, CA, USA, January 9–11, 2017. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik (ISBN 978-3-95977-029-3). LIPIcs – Leibniz International Proceedings in Informatics 67, Article 26, 31 p. (2017). MSC: 68Q17 05C85 68W25 PDFBibTeX XMLCite \textit{M. Henzinger} et al., LIPIcs -- Leibniz Int. Proc. Inform. 67, Article 26, 31 p. (2017; Zbl 1402.68075) Full Text: DOI arXiv