Follow
Akash Kumar
Akash Kumar
IIT Bombay
Verified email at purdue.edu - Homepage
Title
Cited by
Cited by
Year
Finding forbidden minors in sublinear time: A n^ 1/2+ o (1)-query one-sided tester for minor closed properties on bounded degree graphs
A Kumar, C Seshadhri, A Stolman
2018 IEEE 59th Annual Symposium on Foundations of Computer Science (FOCS …, 2018
282018
Random walks and forbidden minors II: a poly(d ε-1)-query tester for minor-closed properties of bounded degree graphs
A Kumar, C Seshadhri, A Stolman
Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing …, 2019
272019
Testing -Monotonicity: The Rise and Fall of Boolean Functions
CL Canonne, E Grigorescu, S Guo, A Kumar, K Wimmer
Theory of Computing 15 (1), 1-55, 2019
27*2019
Approximation algorithms for digraph width parameters
S Kintali, N Kothari, A Kumar
Theoretical Computer Science 562, 365-376, 2015
12*2015
Flipping out with many flips: Hardness of testing k-monotonicity
E Grigorescu, A Kumar, K Wimmer
Approximation, Randomization, and Combinatorial Optimization. Algorithms and …, 2018
6*2018
Finding pseudorandom colorings of pseudorandom graphs
A Kumar, A Louis, M Tulsiani
37th IARCS Annual Conference on Foundations of Software Technology and …, 2018
52018
Learning hierarchical structure of clusterable graphs
M Kapralov, A Kumar, S Lattanzi, A Mousavifar
arXiv preprint arXiv:2207.02581, 2022
42022
Learning hierarchical cluster structure of graphs in sublinear time
M Kapralov, A Kumar, S Lattanzi, A Mousavifar
Proceedings of the 2023 Annual ACM-SIAM Symposium on Discrete Algorithms …, 2023
22023
The complexity of testing all properties of planar graphs, and the role of isomorphism
S Basu, A Kumar, C Seshadhri
Proceedings of the 2022 Annual ACM-SIAM Symposium on Discrete Algorithms …, 2022
22022
Random walks and forbidden minors III: -time partition oracles for minor-free graph classes
A Kumar, C Seshadhri, A Stolman
2021 IEEE 62nd Annual Symposium on Foundations of Computer Science (FOCS …, 2022
12022
Sublinear Time Oracles for Hierarchical Clustering
A Mousavifar, A Kumar, M Kapralov, S Lattanzi
2023
Exact Recovery Algorithm for Planted Bipartite Graph in Semi-Random Graphs
A Kumar, A Louis, R Paul
arXiv preprint arXiv:2205.03727, 2022
2022
Spectral Approach to Modern Algorithm Design
A Kumar
Purdue University, 2020
2020
Review of combinatorial optimization by B. Korte and J. Vygen
A Kumar
ACM SIGACT News 44 (3), 31-35, 2013
2013
Review of polynomia and related realms by Dan Kalman
A Kumar
ACM SIGACT News 43 (2), 15-20, 2012
2012
THL4
AH Chiplunkar, M Elias, GA Gluch, M Kapralov, A Kumar, M Makarov, ...
The system can't perform the operation now. Try again later.
Articles 1–16