Local Routing in Sparse and Lightweight Geometric Graphs. - Vikrant Ashvinkumar; Joachim Gudmundsson; Christos Levcopoulos; Bengt J. Nilsson; André van Renssen (Algorithmica, 2022)

Evaluating Stability in Massive Social Networks: Efficient Streaming Algorithms for Structural Balance. - Vikrant Ashvinkumar; Sepehr Assadi; Chengyuan Deng; Jie Gao 001; Chen Wang 027 (APPROX/RANDOM, 2023)

Parallel and Distributed Exact Single-Source Shortest Paths with Negative Edge Weights. - Vikrant Ashvinkumar; Aaron Bernstein; Nairen Cao; Christoph Grunau; Bernhard Haeupler; Yonggang Jiang; Danupon Nanongkai; Hsin-Hao Su (CoRR, 2023)

Parallel, Distributed, and Quantum Exact Single-Source Shortest Paths with Negative Edge Weights. - Vikrant Ashvinkumar; Aaron Bernstein; Nairen Cao; Christoph Grunau; Bernhard Haeupler; Yonggang Jiang; Danupon Nanongkai; Hsin-Hao Su (ESA, 2024)

Low Sensitivity Hopsets. - Vikrant Ashvinkumar; Aaron Bernstein; Chengyuan Deng; Jie Gao 001; Nicole Wein (ITCS, 2025)

Faster Approximation Algorithms for Restricted Shortest Paths in Directed Graphs. - Vikrant Ashvinkumar; Aaron Bernstein; Adam Karczmarz (SODA, 2025)

Vantage Point Selection Algorithms for Bottleneck Capacity Estimation. - Vikrant Ashvinkumar; Rezaul Chowdhury; Jie Gao 001; Mayank Goswami 001; Joseph S. B. Mitchell; Valentin Polishchuk (WADS, 2025)

Algorithmic Improvements to List Decoding of Folded Reed-Solomon Codes. - Vikrant Ashvinkumar; Mursalin Habib; Shashank Srivastava (CoRR, 2025)