Akash Kumar

According to our database, Akash Kumar authored at least 20 papers between 2011 and 2023.

Collaborative distances:

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

2023

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, C. Seshadhri, Andrew Stolman

SIAM J. Comput., December, 2023

2022

Exact Recovery Algorithm for Planted Bipartite Graph in Semi-Random Graphs.

Akash Kumar, Anand Louis, Rameesh Paul

Proceedings of the 49th International Colloquium on Automata, Languages, and Programming, 2022

2021

Random walks and forbidden minors III: poly(d/?)-time partition oracles for minor-free graph classes.

Akash Kumar, C. Seshadhri, Andrew Stolman

Electron. Colloquium Comput. Complex., 2021

The complexity of testing all properties of planar graphs, and the role of isomorphism.

Sabyasachi Basu, Akash Kumar, C. Seshadhri

Electron. Colloquium Comput. Complex., 2021

Random walks and forbidden minors III: poly(d/ε)-time partition oracles for minor-free graph classes.

Akash Kumar, C. Seshadhri, Andrew Stolman

CoRR, 2021

Random walks and forbidden minors III: $\text{poly}\left(d\varepsilon ^{-1}\right)$-time partition oracles for minor-free graph classes.

Akash Kumar, C. Seshadhri, Andrew Stolman

Proceedings of the 62nd IEEE Annual Symposium on Foundations of Computer Science, 2021

2019

Testing k-Monotonicity: The Rise and Fall of Boolean Functions.

Clément L. Canonne, Elena Grigorescu, Siyao Guo, Akash Kumar, Karl Wimmer

Theory Comput., 2019

Flipping Out with Many Flips: Hardness of Testing k-Monotonicity.

Elena Grigorescu, Akash Kumar, Karl Wimmer

SIAM J. Discret. Math., 2019

andom walks and forbidden minors II: A poly(dε^-1)$-query tester for minor-closed properties of bounded degree graphs.

Akash Kumar, C. Seshadhri, Andrew Stolman

Electron. Colloquium Comput. Complex., 2019

Random walks and forbidden minors II: A poly(dε^-1)-query tester for minor-closed properties of bounded-degree graphs.

Akash Kumar, C. Seshadhri, Andrew Stolman

CoRR, 2019

Random walks and forbidden minors II: a poly(<i>d ε</i>^-1)-query tester for minor-closed properties of bounded degree graphs.

Akash Kumar, C. Seshadhri, Andrew Stolman

Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing, 2019

2018

Finding forbidden minors in sublinear time: a O(n^1/2+o(1))-query one-sided tester for minor closed properties on bounded degree graphs.

Akash Kumar, C. Seshadhri, Andrew Stolman

Electron. Colloquium Comput. Complex., 2018

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, C. Seshadhri, Andrew Stolman

Electron. Colloquium Comput. Complex., 2018

Fiding forbidden minors in sublinear time: a O(n^{1/2 + o(1)})-query one-sided tester for minor closed properties on bounded degree graphs.

Akash Kumar, C. Seshadhri, Andrew Stolman

CoRR, 2018

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, C. Seshadhri, Andrew Stolman

Proceedings of the 59th IEEE Annual Symposium on Foundations of Computer Science, 2018

2017

K-Monotonicity is Not Testable on the Hypercube.

Elena Grigorescu, Akash Kumar, Karl Wimmer

Electron. Colloquium Comput. Complex., 2017

Finding Pseudorandom Colorings of Pseudorandom Graphs.

Akash Kumar, Anand Louis, Madhur Tulsiani

Proceedings of the 37th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, 2017

2016

Testing k-Monotonicity.

Clément L. Canonne, Elena Grigorescu, Siyao Guo, Akash Kumar, Karl Wimmer

Electron. Colloquium Comput. Complex., 2016

2015

Approximation algorithms for digraph width parameters.

Shiva Kintali, Nishad Kothari, Akash Kumar

Theor. Comput. Sci., 2015

2011

Approximation Algorithms for Directed Width Parameters

Shiva Kintali, Nishad Kothari, Akash Kumar

CoRR, 2011