default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDAkash Kumar 0003
Person information
- affiliation: Purdue University, IN, USA
Other persons with the same name
- Akash Kumar 0001
![[0000-0001-7125-1737]](https://dblp1.uni-trier.de/img/orcid-mark.12x12.png "0000-0001-7125-1737")
— Ruhr University Bochum, Germany (and 2 more) - Akash Kumar 0002 — Yahoo!
- Akash Kumar 0004 — Indian Institute of Technology Mandi, India (and 1 more)
- Akash Kumar 0005 — Indian Institute of Technology Indore, Department of Mathematics, India
- Akash Kumar 0006 — Max Planck Institute for Software Systems (MPI-SWS), Saarbrücken, Germany
- Akash Kumar 0007 — West Chester University, PA, USA
- Akash Kumar 0008 — Indian Institute of Technology Jammu, India
- Akash Kumar 0009 — EPFL, Lausanne, Switzerland
- Akash Kumar 0010 — University of California San Diego, CA, USA
- Akash Kumar 0011 — Indian Institute of Information Technology Allahabad, India
- Akash Kumar 0012 — Rochester Institute of Technology, USA (and 1 more)
- Akash Kumar 0013 — University of Washington, Department of Genome Sciences, Seattle, WA, USA
- Akash Kumar 0014 — Indian Institute of Technology Kanpur, Department of Mechanical Engineering, India
- Akash Kumar 0015 — Indian Institute of Information Technology Dharwad, India
- Akash Kumar 0016 — University of Central Florida, Center for Research in Computer Vision, Orlando, FL, USA
- Akash Kumar 0017 — College of Lake County, Grayslake, IL, USA
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
[j4]Akash Kumar, C. Seshadhri, Andrew Stolman:
Random Walks and Forbidden Minors I: An $n^{1/2+o(1)}$-Query One-Sided Tester for Minor Closed Properties on Bounded Degree Graphs. SIAM J. Comput. 52(6): S18-216 (2023)- 2022
- [c8]Akash Kumar, Anand Louis, Rameesh Paul:
Exact Recovery Algorithm for Planted Bipartite Graph in Semi-Random Graphs. ICALP 2022: 84:1-84:20 - [c7]Sabyasachi Basu, Akash Kumar, C. Seshadhri:
The complexity of testing all properties of planar graphs, and the role of isomorphism. SODA 2022: 1702-1714 - [i15]Akash Kumar, Anand Louis, Rameesh Paul:
Exact recovery algorithm for Planted Bipartite Graph in Semi-random Graphs. CoRR abs/2205.03727 (2022) - 2021
- [c6]Akash Kumar, C. Seshadhri, Andrew Stolman:
Random walks and forbidden minors III: $\text{poly}\left(d\varepsilon ^{-1}\right)$-time partition oracles for minor-free graph classes. FOCS 2021: 257-268 - [i14]Akash Kumar, C. Seshadhri, Andrew Stolman:
Random walks and forbidden minors III: poly(d/ε)-time partition oracles for minor-free graph classes. CoRR abs/2102.00556 (2021) - [i13]Sabyasachi Basu, Akash Kumar, C. Seshadhri:
The complexity of testing all properties of planar graphs, and the role of isomorphism. CoRR abs/2108.10547 (2021) - [i12]Sabyasachi Basu, Akash Kumar, C. Seshadhri:
The complexity of testing all properties of planar graphs, and the role of isomorphism. Electron. Colloquium Comput. Complex. TR21 (2021) - [i11]Akash Kumar, C. Seshadhri, Andrew Stolman:
Random walks and forbidden minors III: poly(d/?)-time partition oracles for minor-free graph classes. Electron. Colloquium Comput. Complex. TR21 (2021)
2010 – 2019
- 2019
- [j3]Elena Grigorescu, Akash Kumar, Karl Wimmer:
Flipping Out with Many Flips: Hardness of Testing k-Monotonicity. SIAM J. Discret. Math. 33(4): 2111-2125 (2019) - [j2]Clément L. Canonne, Elena Grigorescu, Siyao Guo, Akash Kumar, Karl Wimmer:
Testing k-Monotonicity: The Rise and Fall of Boolean Functions. Theory Comput. 15: 1-55 (2019) - [c5]Akash Kumar, C. Seshadhri, Andrew Stolman:
Random walks and forbidden minors II: a poly(d ε-1)-query tester for minor-closed properties of bounded degree graphs. STOC 2019: 559-567 - [i10]Akash Kumar, C. Seshadhri, Andrew Stolman:
Random walks and forbidden minors II: A poly(dε-1)-query tester for minor-closed properties of bounded-degree graphs. CoRR abs/1904.01055 (2019) - [i9]Akash Kumar, C. Seshadhri, Andrew Stolman:
andom walks and forbidden minors II: A poly(dε-1)$-query tester for minor-closed properties of bounded degree graphs. Electron. Colloquium Comput. Complex. TR19 (2019) - 2018
- [c4]Elena Grigorescu, Akash Kumar, Karl Wimmer:
Flipping out with Many Flips: Hardness of Testing k-Monotonicity. APPROX-RANDOM 2018: 40:1-40:17 - [c3]Akash Kumar, C. Seshadhri, Andrew Stolman:
Finding Forbidden Minors in Sublinear Time: A n^1/2+o(1)-Query One-Sided Tester for Minor Closed Properties on Bounded Degree Graphs. FOCS 2018: 509-520 - [i8]Akash Kumar, C. Seshadhri, Andrew Stolman:
Fiding forbidden minors in sublinear time: a O(n1/2 + o(1))-query one-sided tester for minor closed properties on bounded degree graphs. CoRR abs/1805.08187 (2018) - [i7]Akash Kumar, C. Seshadhri, Andrew Stolman:
Finding forbidden minors in sublinear time: a n1/2+o(1)-query one-sided tester for minor closed properties on bounded degree graphs. Electron. Colloquium Comput. Complex. TR18 (2018) - [i6]Akash Kumar, C. Seshadhri, Andrew Stolman:
Finding forbidden minors in sublinear time: a O(n1/2+o(1))-query one-sided tester for minor closed properties on bounded degree graphs. Electron. Colloquium Comput. Complex. TR18 (2018) - 2017
- [c2]Akash Kumar, Anand Louis, Madhur Tulsiani:
Finding Pseudorandom Colorings of Pseudorandom Graphs. FSTTCS 2017: 37:1-37:12 - [c1]Clément L. Canonne, Elena Grigorescu, Siyao Guo, Akash Kumar, Karl Wimmer:
Testing k-Monotonicity. ITCS 2017: 29:1-29:21 - [i5]Elena Grigorescu, Akash Kumar, Karl Wimmer:
K-Monotonicity is Not Testable on the Hypercube. CoRR abs/1705.04205 (2017) - [i4]Elena Grigorescu, Akash Kumar, Karl Wimmer:
K-Monotonicity is Not Testable on the Hypercube. Electron. Colloquium Comput. Complex. TR17 (2017) - 2016
- [i3]Clément L. Canonne, Elena Grigorescu, Siyao Guo, Akash Kumar, Karl Wimmer:
Testing k-Monotonicity. CoRR abs/1609.00265 (2016) - [i2]Clément L. Canonne, Elena Grigorescu, Siyao Guo, Akash Kumar, Karl Wimmer:
Testing k-Monotonicity. Electron. Colloquium Comput. Complex. TR16 (2016) - 2015
- [j1]Shiva Kintali, Nishad Kothari, Akash Kumar:
Approximation algorithms for digraph width parameters. Theor. Comput. Sci. 562: 365-376 (2015) - 2011
- [i1]Shiva Kintali, Nishad Kothari, Akash Kumar:
Approximation Algorithms for Directed Width Parameters. CoRR abs/1107.4824 (2011)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-23 21:24 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
