Parameterized Query Complexity of Hitting Set Using Stability of Sunflowers. - Arijit Bishnu; Arijit Ghosh; Sudeshna Kolay; Gopinath Mishra; Saket Saurabh 001 (ISAAC, 2018)

On the streaming complexity of fundamental geometric problems. - Arijit Bishnu; Arijit Ghosh; Gopinath Mishra; Sandeep Sen (CoRR, 2018)

Triangle Estimation using Polylogarithmic Queries. - Anup Bhattacharya; Arijit Bishnu; Arijit Ghosh; Gopinath Mishra (CoRR, 2018)

Improved algorithms for the evacuation route planning problem. - Gopinath Mishra; Subhra Mazumdar 001; Arindam Pal 001 (J. Comb. Optim., 2018)

Inner Product Oracle can Estimate and Sample. - Arijit Bishnu; Arijit Ghosh; Gopinath Mishra; Manaswi Paraashar (CoRR, 2019)

Hyperedge Estimation using Polylogarithmic Subset Queries. - Anup Bhattacharya; Arijit Bishnu; Arijit Ghosh; Gopinath Mishra (CoRR, 2019)

Fixed Parameter Tractability of Graph Deletion Problems over Data Streams. - Arijit Bishnu; Arijit Ghosh; Sudeshna Kolay; Gopinath Mishra; Saket Saurabh 001 (COCOON, 2020)

Existence of planar support for geometric hypergraphs using elementary techniques. - Arijit Bishnu; Sameer Desai; Arijit Ghosh; Gopinath Mishra; Subhabrata Paul (Discret. Math., 2020)

Query Complexity of Global Minimum Cut. - Arijit Bishnu; Arijit Ghosh; Gopinath Mishra; Manaswi Paraashar (Electron. Colloquium Comput. Complex., 2020)

Estimation of Graph Isomorphism Distance in the Query World. - Sourav Chakraborty 001; Arijit Ghosh; Gopinath Mishra; Sayantan Sen (Electron. Colloquium Comput. Complex., 2020)

FPT Algorithms for Embedding into Low-Complexity Graphic Metrics. - Arijit Ghosh; Sudeshna Kolay; Gopinath Mishra (ACM Trans. Comput. Theory, 2020)

Interplay Between Graph Isomorphism and Earth Mover's Distance in the Query and Communication Worlds. - Sourav Chakraborty 001; Arijit Ghosh; Gopinath Mishra; Sayantan Sen (APPROX-RANDOM, 2021)

Distance Estimation Between Unknown Matrices Using Sublinear Projections on Hamming Cube. - Arijit Bishnu; Arijit Ghosh; Gopinath Mishra (APPROX-RANDOM, 2021)

Even the Easiest(?) Graph Coloring Problem Is Not Easy in Streaming! - Anup Bhattacharya; Arijit Bishnu; Gopinath Mishra; Anannya Upasana (ITCS, 2021)

Bipartite Independent Set Oracles and Beyond: Can it Even Count Triangles in Polylogarithmic Queries? - Arijit Bishnu; Arijit Ghosh; Gopinath Mishra (CoRR, 2021)

Grid obstacle representation of graphs. - Arijit Bishnu; Arijit Ghosh; Rogers Mathew; Gopinath Mishra; Subhabrata Paul (Discret. Appl. Math., 2021)

On Triangle Estimation Using Tripartite Independent Set Queries. - Anup Bhattacharya; Arijit Bishnu; Arijit Ghosh; Gopinath Mishra (Theory Comput. Syst., 2021)

Counting and Sampling from Substructures Using Linear Algebraic Queries. - Arijit Bishnu; Arijit Ghosh; Gopinath Mishra; Manaswi Paraashar (FSTTCS, 2022)

Tolerant Bipartiteness Testing in Dense Graphs. - Arijit Ghosh; Gopinath Mishra; Rahul Raychaudhury; Sayantan Sen (ICALP, 2022)

Disjointness through the Lens of Vapnik-Chervonenkis Dimension: Sparsity and Beyond. - Anup Bhattacharya; Sourav Chakraborty 001; Arijit Ghosh; Gopinath Mishra; Manaswi Paraashar (Comput. Complex., 2022)

Testing of Index-Invariant Properties in the Huge Object Model. - Sourav Chakraborty 001; Eldar Fischer; Arijit Ghosh; Gopinath Mishra; Sayantan Sen (Electron. Colloquium Comput. Complex., 2022)

On the Complexity of Triangle Counting Using Emptiness Queries. - Arijit Bishnu; Arijit Ghosh; Gopinath Mishra (APPROX/RANDOM, 2023)

Optimal (Degree+1)-Coloring in Congested Clique. - Sam Coy; Artur Czumaj; Peter Davies 001; Gopinath Mishra (ICALP, 2023)

On Parallel k-Center Clustering. - Sam Coy; Artur Czumaj; Gopinath Mishra (SPAA, 2023)

Fast Parallel Degree+1 List Coloring. - Sam Coy; Artur Czumaj; Peter Davies 001; Gopinath Mishra (CoRR, 2023)

Almost optimal query algorithm for hitting set using a subset query. - Arijit Bishnu; Arijit Ghosh; Sudeshna Kolay; Gopinath Mishra; Saket Saurabh 001 (J. Comput. Syst. Sci., 2023)

Small Vertex Cover Helps in Fixed-Parameter Tractability of Graph Deletion Problems over Data Streams. - Arijit Bishnu; Arijit Ghosh; Sudeshna Kolay; Gopinath Mishra; Saket Saurabh 001 (Theory Comput. Syst., 2023)

Parallel Derandomization for Coloring (Abstract). - Sam Coy; Artur Czumaj; Peter Davies-Peck; Gopinath Mishra (HOPC@SPAA, 2024)

Parallel Derandomization for Coloring. - Sam Coy; Artur Czumaj; Peter Davies-Peck; Gopinath Mishra (IPDPS, 2024)

A Tight Lower Bound for 3-Coloring Grids in the Online-LOCAL Model. - Yi-Jun Chang; Gopinath Mishra; Hung Thuan Nguyen; Mingyang Yang; Yu-Cheng Yeh (PODC, 2024)

Streaming Graph Algorithms in the Massively Parallel Computation Model. - Artur Czumaj; Gopinath Mishra; Anish Mukherjee 001 (PODC, 2024)

Log Diameter Rounds MST Verification and Sensitivity in MPC. - Sam Coy; Artur Czumaj; Gopinath Mishra; Anish Mukherjee 001 (SPAA, 2024)

Near Uniform Triangle Sampling Over Adjacency List Graph Streams. - Arijit Bishnu; Arijit Ghosh; Gopinath Mishra; Sayantan Sen (CoRR, 2024)

The Complexity Landscape of Dynamic Distributed Subgraph Finding. - Yi-Jun Chang; Lyuting Chen; Yanyu Chen 002; Gopinath Mishra; Mingyang Yang (CoRR, 2024)

Overlay Network Construction: Improved Overall and Node-Wise Message Complexity. - Yi-Jun Chang; Yanyu Chen 002; Gopinath Mishra (CoRR, 2024)

Testing vs Estimation for Index-Invariant Properties in the Huge Object Model. - Sourav Chakraborty 001; Eldar Fischer; Arijit Ghosh; Amit Levi; Gopinath Mishra; Sayantan Sen (Electron. Colloquium Comput. Complex., 2024)

Faster Counting and Sampling Algorithms using Colorful Decision Oracle. - Anup Bhattacharya; Arijit Bishnu; Arijit Ghosh; Gopinath Mishra (ACM Trans. Comput. Theory, 2024)

Brief Announcement: The Complexity Landscape of Dynamic Distributed Subgraph Finding. - Yi-Jun Chang; Lyuting Chen; Yanyu Chen 002; Gopinath Mishra; Mingyang Yang (PODC, 2025)

Optimal Distributed Replacement Paths. - Yi-Jun Chang; Yanyu Chen 002; Dipan Dey; Gopinath Mishra; Hung Thuan Nguyen; Bryce Sanchez (PODC, 2025)

Round and Communication Efficient Graph Coloring. - Yi-Jun Chang; Gopinath Mishra; Hung Thuan Nguyen; Farrel D. Salim (PODC, 2025)

Arboricity and Random Edge Queries Matter for Triangle Counting using Sublinear Queries. - Arijit Bishnu; Debarshi Chanda; Gopinath Mishra (CoRR, 2025)

Exploring the Gap Between Tolerant and Non-Tolerant Distribution Testing. - Sourav Chakraborty 001; Eldar Fischer; Arijit Ghosh; Gopinath Mishra; Sayantan Sen (IEEE Trans. Inf. Theory, 2025)

Towards Tight Bounds for Estimating Degree Distribution in Streaming and Query Models. - Arijit Bishnu; Debarshi Chanda; Gopinath Mishra (CoRR, 2025)