Approximation Algorithms for Directed Width Parameters - Shiva Kintali; Nishad Kothari; Akash Kumar 003 (CoRR, 2011)

Approximation algorithms for digraph width parameters. - Shiva Kintali; Nishad Kothari; Akash Kumar 003 (Theor. Comput. Sci., 2015)

Testing k-Monotonicity. - Clément L. Canonne; Elena Grigorescu; Siyao Guo; Akash Kumar 003; Karl Wimmer (Electron. Colloquium Comput. Complex., 2016)

Finding Pseudorandom Colorings of Pseudorandom Graphs. - Akash Kumar 003; Anand Louis; Madhur Tulsiani (FSTTCS, 2017)

K-Monotonicity is Not Testable on the Hypercube. - Elena Grigorescu; Akash Kumar 003; Karl Wimmer (Electron. Colloquium Comput. Complex., 2017)

Finding Forbidden Minors in Sublinear Time: A n^1/2+o(1)-Query One-Sided Tester for Minor Closed Properties on Bounded Degree Graphs. - Akash Kumar 003; C. Seshadhri 001; Andrew Stolman (FOCS, 2018)

Fiding forbidden minors in sublinear time: a O(n1/2 + o(1))-query one-sided tester for minor closed properties on bounded degree graphs. - Akash Kumar 003; C. Seshadhri 001; Andrew Stolman (CoRR, 2018)

Finding forbidden minors in sublinear time: a n1/2+o(1)-query one-sided tester for minor closed properties on bounded degree graphs. - Akash Kumar 003; C. Seshadhri 001; Andrew Stolman (Electron. Colloquium Comput. Complex., 2018)

Finding forbidden minors in sublinear time: a O(n1/2+o(1))-query one-sided tester for minor closed properties on bounded degree graphs. - Akash Kumar 003; C. Seshadhri 001; Andrew Stolman (Electron. Colloquium Comput. Complex., 2018)

Random walks and forbidden minors II: a poly(d ε-1)-query tester for minor-closed properties of bounded degree graphs. - Akash Kumar 003; C. Seshadhri 001; Andrew Stolman (STOC, 2019)

Random walks and forbidden minors II: A poly(dε-1)-query tester for minor-closed properties of bounded-degree graphs. - Akash Kumar 003; C. Seshadhri 001; Andrew Stolman (CoRR, 2019)

andom walks and forbidden minors II: A poly(dε-1)$-query tester for minor-closed properties of bounded degree graphs. - Akash Kumar 003; C. Seshadhri 001; Andrew Stolman (Electron. Colloquium Comput. Complex., 2019)

Random Walks and Forbidden Minors II: A $ mathrm{poly}(d varepsilon^{-1})$-Query Tester for Minor-Closed Properties of Bounded-Degree Graphs. - Akash Kumar 003; C. Seshadhri 001; Andrew Stolman (SIAM J. Comput., 2019)

Flipping Out with Many Flips: Hardness of Testing k-Monotonicity. - Elena Grigorescu; Akash Kumar 003; Karl Wimmer (SIAM J. Discret. Math., 2019)

Testing k-Monotonicity: The Rise and Fall of Boolean Functions. - Clément L. Canonne; Elena Grigorescu; Siyao Guo; Akash Kumar 003; Karl Wimmer (Theory Comput., 2019)

Random walks and forbidden minors III: $ text{poly} left(d varepsilon ^{-1} right)$-time partition oracles for minor-free graph classes. - Akash Kumar 003; C. Seshadhri 001; Andrew Stolman (FOCS, 2021)

Random walks and forbidden minors III: poly(d/ε)-time partition oracles for minor-free graph classes. - Akash Kumar 003; C. Seshadhri 001; Andrew Stolman (CoRR, 2021)

The complexity of testing all properties of planar graphs, and the role of isomorphism. - Sabyasachi Basu; Akash Kumar 003; C. Seshadhri 001 (Electron. Colloquium Comput. Complex., 2021)

Random walks and forbidden minors III: poly(d/?)-time partition oracles for minor-free graph classes. - Akash Kumar 003; C. Seshadhri 001; Andrew Stolman (Electron. Colloquium Comput. Complex., 2021)

Exact Recovery Algorithm for Planted Bipartite Graph in Semi-Random Graphs. - Akash Kumar 003; Anand Louis; Rameesh Paul (ICALP, 2022)

Random Walks and Forbidden Minors I: An $n^{1/2+o(1)}$-Query One-Sided Tester for Minor Closed Properties on Bounded Degree Graphs. - Akash Kumar 003; C. Seshadhri 001; Andrew Stolman (SIAM J. Comput., 2023)