Gopinath Mishra

Orcid: 0000-0003-0540-0292

According to our database1, Gopinath Mishra authored at least 30 papers between 2018 and 2023.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2023
Small Vertex Cover Helps in Fixed-Parameter Tractability of Graph Deletion Problems over Data Streams.
Theory Comput. Syst., December, 2023

Almost optimal query algorithm for hitting set using a subset query.
J. Comput. Syst. Sci., November, 2023

A Tight Lower Bound for 3-Coloring Grids in the Online-LOCAL Model.
CoRR, 2023

Fast Parallel Degree+1 List Coloring.
CoRR, 2023

On Parallel k-Center Clustering.
Proceedings of the 35th ACM Symposium on Parallelism in Algorithms and Architectures, 2023

Optimal (Degree+1)-Coloring in Congested Clique.
Proceedings of the 50th International Colloquium on Automata, Languages, and Programming, 2023

On the Complexity of Triangle Counting Using Emptiness Queries.
Proceedings of the Approximation, 2023

2022
Testing of Index-Invariant Properties in the Huge Object Model.
Electron. Colloquium Comput. Complex., 2022

Disjointness through the Lens of Vapnik-Chervonenkis Dimension: Sparsity and Beyond.
Comput. Complex., 2022

Faster Counting and Sampling Algorithms Using Colorful Decision Oracle.
Proceedings of the 39th International Symposium on Theoretical Aspects of Computer Science, 2022

Tolerant Bipartiteness Testing in Dense Graphs.
Proceedings of the 49th International Colloquium on Automata, Languages, and Programming, 2022

Counting and Sampling from Substructures Using Linear Algebraic Queries.
Proceedings of the 42nd IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, 2022

Exploring the Gap Between Tolerant and Non-Tolerant Distribution Testing.
Proceedings of the Approximation, 2022

2021
On Triangle Estimation Using Tripartite Independent Set Queries.
Theory Comput. Syst., 2021

Grid obstacle representation of graphs.
Discret. Appl. Math., 2021

Bipartite Independent Set Oracles and Beyond: Can it Even Count Triangles in Polylogarithmic Queries?
CoRR, 2021

Even the Easiest(?) Graph Coloring Problem Is Not Easy in Streaming!
Proceedings of the 12th Innovations in Theoretical Computer Science Conference, 2021

Distance Estimation Between Unknown Matrices Using Sublinear Projections on Hamming Cube.
Proceedings of the Approximation, 2021

Interplay Between Graph Isomorphism and Earth Mover's Distance in the Query and Communication Worlds.
Proceedings of the Approximation, 2021

2020
FPT Algorithms for Embedding into Low-Complexity Graphic Metrics.
ACM Trans. Comput. Theory, 2020

Estimation of Graph Isomorphism Distance in the Query World.
Electron. Colloquium Comput. Complex., 2020

Query Complexity of Global Minimum Cut.
Electron. Colloquium Comput. Complex., 2020

Existence of planar support for geometric hypergraphs using elementary techniques.
Discret. Math., 2020

Fixed Parameter Tractability of Graph Deletion Problems over Data Streams.
Proceedings of the Computing and Combinatorics - 26th International Conference, 2020

2019
Hyperedge Estimation using Polylogarithmic Subset Queries.
CoRR, 2019

Inner Product Oracle can Estimate and Sample.
CoRR, 2019

2018
Improved algorithms for the evacuation route planning problem.
J. Comb. Optim., 2018

Triangle Estimation using Polylogarithmic Queries.
CoRR, 2018

On the streaming complexity of fundamental geometric problems.
CoRR, 2018

Parameterized Query Complexity of Hitting Set Using Stability of Sunflowers.
Proceedings of the 29th International Symposium on Algorithms and Computation, 2018


  Loading...