Conditionally optimal approximation algorithms for the girth of a directed graph

by Dalirrooyfard, Mina, Williams, Virginia Vassilevska
Published 2021

Hardness of Approximate Diameter: Now for Undirected Graphs

by Dalirrooyfard, Mina, Li, Ray, Williams, Virginia Vassilevska
Published 2022

Graph Pattern Detection: Hardness for all Induced Patterns and Faster Noninduced Cycles

by Dalirrooyfard, Mina, Vuong, Thuy Duong, Williams, Virginia Vassilevska
Published 2022

Graph pattern detection: Hardness for all induced patterns and faster non-induced cycles

by Dalirrooyfard, Mina, Vuong, Thuy Duong, Williams, Virginia Vassilevska
Published 2021

Tight approximation algorithms for bichromatic graph diameter and related problems

by Dalirrooyfard, Mina, Williams, Virginia Vassilevska, Vyas, Nikhil, Wein, Nicole
Published 2021

Approximation algorithms for min-distance problems

by Williams, Virginia Vassilevska, Wein, Nicole, Dalirrooyfard, Mina, Vyas, Nikhil, Xu, Yinzhan, Yu, Yuancheng
Published 2021