default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDGopinath Mishra
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j9]Anup Bhattacharya, Arijit Bishnu, Arijit Ghosh, Gopinath Mishra
:
Faster Counting and Sampling Algorithms using Colorful Decision Oracle. ACM Trans. Comput. Theory 16(2): 12:1-12:19 (2024)- [c23]Sam Coy, Artur Czumaj, Peter Davies-Peck, Gopinath Mishra:
Parallel Derandomization for Coloring (Abstract). HOPC@SPAA 2024 - [c22]Sam Coy, Artur Czumaj, Peter Davies-Peck, Gopinath Mishra:
Parallel Derandomization for Coloring. IPDPS 2024: 1058-1069 - [c21]Yi-Jun Chang, Gopinath Mishra, Hung Thuan Nguyen, Mingyang Yang, Yu-Cheng Yeh:
A Tight Lower Bound for 3-Coloring Grids in the Online-LOCAL Model. PODC 2024: 106-116 - [c20]Artur Czumaj, Gopinath Mishra, Anish Mukherjee:
Streaming Graph Algorithms in the Massively Parallel Computation Model. PODC 2024: 496-507 - [c19]Sam Coy, Artur Czumaj, Gopinath Mishra, Anish Mukherjee:
Log Diameter Rounds MST Verification and Sensitivity in MPC. SPAA 2024: 269-280 - [i28]Arijit Bishnu, Arijit Ghosh, Gopinath Mishra, Sayantan Sen:
Near Uniform Triangle Sampling Over Adjacency List Graph Streams. CoRR abs/2405.10167 (2024) - [i27]Sam Coy, Artur Czumaj, Gopinath Mishra, Anish Mukherjee:
Log Diameter Rounds MST Verification and Sensitivity in MPC. CoRR abs/2408.00398 (2024) - 2023
- [j8]Arijit Bishnu, Arijit Ghosh, Sudeshna Kolay, Gopinath Mishra, Saket Saurabh:
Almost optimal query algorithm for hitting set using a subset query. J. Comput. Syst. Sci. 137: 50-65 (2023) - [j7]Arijit Bishnu, Arijit Ghosh, Sudeshna Kolay, Gopinath Mishra, Saket Saurabh:
Small Vertex Cover Helps in Fixed-Parameter Tractability of Graph Deletion Problems over Data Streams. Theory Comput. Syst. 67(6): 1241-1267 (2023) - [c18]Arijit Bishnu, Arijit Ghosh, Gopinath Mishra:
On the Complexity of Triangle Counting Using Emptiness Queries. APPROX/RANDOM 2023: 48:1-48:22 - [c17]Sourav Chakraborty, Eldar Fischer, Arijit Ghosh, Gopinath Mishra, Sayantan Sen:
Testing of Index-Invariant Properties in the Huge Object Model. COLT 2023: 3065-3136 - [c16]Sam Coy, Artur Czumaj, Peter Davies, Gopinath Mishra:
Optimal (Degree+1)-Coloring in Congested Clique. ICALP 2023: 46:1-46:20 - [c15]Sam Coy, Artur Czumaj, Gopinath Mishra:
On Parallel k-Center Clustering. SPAA 2023: 65-75 - [i26]Sam Coy, Artur Czumaj, Peter Davies, Gopinath Mishra:
Fast Parallel Degree+1 List Coloring. CoRR abs/2302.04378 (2023) - [i25]Sam Coy, Artur Czumaj, Gopinath Mishra:
On Parallel k-Center Clustering. CoRR abs/2304.05883 (2023) - [i24]Sam Coy, Artur Czumaj, Peter Davies, Gopinath Mishra:
Optimal (degree+1)-Coloring in Congested Clique. CoRR abs/2306.12071 (2023) - [i23]Yi-Jun Chang, Gopinath Mishra, Hung Thuan Nguyen, Mingyang Yang, Yu-Cheng Yeh:
A Tight Lower Bound for 3-Coloring Grids in the Online-LOCAL Model. CoRR abs/2312.01384 (2023) - 2022
- [j6]Anup Bhattacharya, Sourav Chakraborty, Arijit Ghosh, Gopinath Mishra, Manaswi Paraashar:
Disjointness through the Lens of Vapnik-Chervonenkis Dimension: Sparsity and Beyond. Comput. Complex. 31(2): 9 (2022) - [c14]Sourav Chakraborty, Eldar Fischer, Arijit Ghosh, Gopinath Mishra, Sayantan Sen:
Exploring the Gap Between Tolerant and Non-Tolerant Distribution Testing. APPROX/RANDOM 2022: 27:1-27:23 - [c13]Arijit Bishnu, Arijit Ghosh, Gopinath Mishra, Manaswi Paraashar:
Counting and Sampling from Substructures Using Linear Algebraic Queries. FSTTCS 2022: 8:1-8:20 - [c12]Arijit Ghosh, Gopinath Mishra, Rahul Raychaudhury, Sayantan Sen:
Tolerant Bipartiteness Testing in Dense Graphs. ICALP 2022: 69:1-69:19 - [c11]Anup Bhattacharya, Arijit Bishnu, Arijit Ghosh, Gopinath Mishra:
Faster Counting and Sampling Algorithms Using Colorful Decision Oracle. STACS 2022: 10:1-10:16 - [i22]Anup Bhattacharya, Arijit Bishnu, Arijit Ghosh, Gopinath Mishra:
Faster Counting and Sampling Algorithms using Colorful Decision Oracle. CoRR abs/2201.04975 (2022) - [i21]Arijit Ghosh, Gopinath Mishra, Rahul Raychaudhury, Sayantan Sen:
Tolerant Bipartiteness Testing in Dense Graphs. CoRR abs/2204.12397 (2022) - [i20]Sourav Chakraborty, Eldar Fischer, Arijit Ghosh, Gopinath Mishra, Sayantan Sen:
Testing of Index-Invariant Properties in the Huge Object Model. CoRR abs/2207.12514 (2022) - [i19]Sourav Chakraborty, Eldar Fischer, Arijit Ghosh, Gopinath Mishra, Sayantan Sen:
Testing of Index-Invariant Properties in the Huge Object Model. Electron. Colloquium Comput. Complex. TR22 (2022) - 2021
- [j5]Arijit Bishnu, Arijit Ghosh, Rogers Mathew, Gopinath Mishra, Subhabrata Paul:
Grid obstacle representation of graphs. Discret. Appl. Math. 296: 39-51 (2021) - [j4]Anup Bhattacharya, Arijit Bishnu, Arijit Ghosh, Gopinath Mishra:
On Triangle Estimation Using Tripartite Independent Set Queries. Theory Comput. Syst. 65(8): 1165-1192 (2021) - [c10]Arijit Bishnu, Arijit Ghosh, Gopinath Mishra, Manaswi Paraashar:
Query Complexity of Global Minimum Cut. APPROX-RANDOM 2021: 6:1-6:15 - [c9]Sourav Chakraborty, Arijit Ghosh, Gopinath Mishra, Sayantan Sen:
Interplay Between Graph Isomorphism and Earth Mover's Distance in the Query and Communication Worlds. APPROX-RANDOM 2021: 34:1-34:23 - [c8]Arijit Bishnu, Arijit Ghosh, Gopinath Mishra:
Distance Estimation Between Unknown Matrices Using Sublinear Projections on Hamming Cube. APPROX-RANDOM 2021: 44:1-44:22 - [c7]Anup Bhattacharya, Arijit Bishnu, Gopinath Mishra, Anannya Upasana:
Even the Easiest(?) Graph Coloring Problem Is Not Easy in Streaming! ITCS 2021: 15:1-15:19 - [i18]Arijit Bishnu, Arijit Ghosh, Gopinath Mishra:
Distance Estimation Between Unknown Matrices Using Sublinear Projections on Hamming Cube. CoRR abs/2107.02666 (2021) - [i17]Arijit Bishnu, Arijit Ghosh, Gopinath Mishra:
Bipartite Independent Set Oracles and Beyond: Can it Even Count Triangles in Polylogarithmic Queries? CoRR abs/2110.03836 (2021) - [i16]Sourav Chakraborty, Eldar Fischer, Arijit Ghosh, Gopinath Mishra, Sayantan Sen:
Exploring the Gap between Tolerant and Non-tolerant Distribution Testing. CoRR abs/2110.09972 (2021) - 2020
- [j3]Arijit Bishnu, Sameer Desai, Arijit Ghosh, Gopinath Mishra, Subhabrata Paul:
Existence of planar support for geometric hypergraphs using elementary techniques. Discret. Math. 343(6): 111853 (2020) - [j2]Arijit Ghosh, Sudeshna Kolay, Gopinath Mishra:
FPT Algorithms for Embedding into Low-Complexity Graphic Metrics. ACM Trans. Comput. Theory 12(1): 1:1-1:41 (2020) - [c6]Anup Bhattacharya, Sourav Chakraborty, Arijit Ghosh, Gopinath Mishra, Manaswi Paraashar:
Disjointness Through the Lens of Vapnik-Chervonenkis Dimension: Sparsity and Beyond. APPROX-RANDOM 2020: 23:1-23:15 - [c5]Arijit Bishnu, Arijit Ghosh, Sudeshna Kolay, Gopinath Mishra, Saket Saurabh:
Fixed Parameter Tractability of Graph Deletion Problems over Data Streams. COCOON 2020: 652-663 - [i15]Anup Bhattacharya, Sourav Chakraborty, Arijit Ghosh, Gopinath Mishra, Manaswi Paraashar:
Disjointness through the Lens of Vapnik-Chervonenkis Dimension: Sparsity and Beyond. CoRR abs/2006.13712 (2020) - [i14]Arijit Bishnu, Arijit Ghosh, Gopinath Mishra, Manaswi Paraashar:
Query Complexity of Global Minimum Cut. CoRR abs/2007.09202 (2020) - [i13]Anup Bhattacharya, Arijit Bishnu, Gopinath Mishra, Anannya Upasana:
Even the Easiest(?) Graph Coloring Problem is not Easy in Streaming! CoRR abs/2010.13143 (2020) - [i12]Anup Bhattacharya, Sourav Chakraborty, Arijit Ghosh, Gopinath Mishra, Manaswi Paraashar:
Disjointness through the Lens of Vapnik-Chervonenkis Dimension: Sparsity and Beyond. Electron. Colloquium Comput. Complex. TR20 (2020) - [i11]Arijit Bishnu, Arijit Ghosh, Gopinath Mishra, Manaswi Paraashar:
Query Complexity of Global Minimum Cut. Electron. Colloquium Comput. Complex. TR20 (2020) - [i10]Sourav Chakraborty, Arijit Ghosh, Gopinath Mishra, Sayantan Sen:
Estimation of Graph Isomorphism Distance in the Query World. Electron. Colloquium Comput. Complex. TR20 (2020)
2010 – 2019
- 2019
- [c4]Anup Bhattacharya, Arijit Bishnu, Arijit Ghosh, Gopinath Mishra:
Triangle Estimation Using Tripartite Independent Set Queries. ISAAC 2019: 19:1-19:17 - [i9]Arijit Bishnu, Arijit Ghosh, Sudeshna Kolay, Gopinath Mishra, Saket Saurabh:
Fixed-Parameter Tractability of Graph Deletion Problems over Data Streams. CoRR abs/1906.05458 (2019) - [i8]Arijit Bishnu, Arijit Ghosh, Gopinath Mishra, Manaswi Paraashar:
Inner Product Oracle can Estimate and Sample. CoRR abs/1906.07398 (2019) - [i7]Anup Bhattacharya, Arijit Bishnu, Arijit Ghosh, Gopinath Mishra:
Hyperedge Estimation using Polylogarithmic Subset Queries. CoRR abs/1908.04196 (2019) - 2018
- [j1]Gopinath Mishra, Subhra Mazumdar, Arindam Pal:
Improved algorithms for the evacuation route planning problem. J. Comb. Optim. 36(1): 280-306 (2018) - [c3]Arijit Ghosh, Sudeshna Kolay, Gopinath Mishra:
FPT Algorithms for Embedding into Low Complexity Graphic Metrics. ESA 2018: 35:1-35:13 - [c2]Arijit Bishnu, Arijit Ghosh, Sudeshna Kolay, Gopinath Mishra, Saket Saurabh:
Parameterized Query Complexity of Hitting Set Using Stability of Sunflowers. ISAAC 2018: 25:1-25:12 - [i6]Arijit Ghosh, Sudeshna Kolay, Gopinath Mishra:
FPT algorithms for embedding into low complexity graphic metrics. CoRR abs/1801.03253 (2018) - [i5]Arijit Bishnu, Arijit Ghosh, Gopinath Mishra, Sandeep Sen:
On the streaming complexity of fundamental geometric problems. CoRR abs/1803.06875 (2018) - [i4]Arijit Bishnu, Arijit Ghosh, Sudeshna Kolay, Gopinath Mishra, Saket Saurabh:
Parameterized Query Complexity of Hitting Set using Stability of Sunflowers. CoRR abs/1807.06272 (2018) - [i3]Anup Bhattacharya, Arijit Bishnu, Arijit Ghosh, Gopinath Mishra:
Triangle Estimation using Polylogarithmic Queries. CoRR abs/1808.00691 (2018) - 2017
- [i2]Arijit Bishnu, Arijit Ghosh, Rogers Mathew, Gopinath Mishra, Subhabrata Paul:
Grid obstacle representation of graphs. CoRR abs/1708.01765 (2017) - 2016
- [i1]Gopinath Mishra, Subhra Mazumdar, Arindam Pal:
Improved Algorithms for the Evacuation Route Planning Problem. CoRR abs/1605.00065 (2016) - 2015
- [c1]Gopinath Mishra, Subhra Mazumdar, Arindam Pal:
Improved Algorithms for the Evacuation Route Planning Problem. COCOA 2015: 3-19
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-09 20:32 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:
