Vikrant Ashvinkumar

According to our database, Vikrant Ashvinkumar authored at least 8 papers between 2022 and 2025.

Collaborative distances:

• Dijkstra number of three.
• Erdős number of three.

2025

Algorithmic Improvements to List Decoding of Folded Reed-Solomon Codes.

Vikrant Ashvinkumar, Mursalin Habib, Shashank Srivastava

CoRR, August, 2025

Vantage Point Selection Algorithms for Bottleneck Capacity Estimation.

Vikrant Ashvinkumar, Rezaul Chowdhury, Jie Gao, Mayank Goswami, Joseph S. B. Mitchell, Valentin Polishchuk

Proceedings of the 19th International Symposium on Algorithms and Data Structures, 2025

Faster Approximation Algorithms for Restricted Shortest Paths in Directed Graphs.

Vikrant Ashvinkumar, Aaron Bernstein, Adam Karczmarz

Proceedings of the 2025 Annual ACM-SIAM Symposium on Discrete Algorithms, 2025

Low Sensitivity Hopsets.

Vikrant Ashvinkumar, Aaron Bernstein, Chengyuan Deng, Jie Gao, Nicole Wein

Proceedings of the 16th Innovations in Theoretical Computer Science Conference, 2025

2024

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

Proceedings of the 32nd Annual European Symposium on Algorithms, 2024

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

Evaluating Stability in Massive Social Networks: Efficient Streaming Algorithms for Structural Balance.

Vikrant Ashvinkumar, Sepehr Assadi, Chengyuan Deng, Jie Gao, Chen Wang

Proceedings of the Approximation, 2023

2022

Local Routing in Sparse and Lightweight Geometric Graphs.

Vikrant Ashvinkumar, Joachim Gudmundsson, Christos Levcopoulos, Bengt J. Nilsson, André van Renssen

Algorithmica, 2022