No. Title Author Year
1 Faster Counting and Sampling Algorithms Using Colorful Decision Oracle Bhattacharya, Anup et al. 2022
2 Tolerant Bipartiteness Testing in Dense Graphs Ghosh, Arijit et al. 2022
3 Uniform Brackets, Containers, and Combinatorial Macbeath Regions Dutta, Kunal et al. 2022
4 Distance Estimation Between Unknown Matrices Using Sublinear Projections on Hamming Cube Bishnu, Arijit et al. 2021
5 Interplay Between Graph Isomorphism and Earth Mover’s Distance in the Query and Communication Worlds Chakraborty, Sourav et al. 2021
6 Query Complexity of Global Minimum Cut Bishnu, Arijit et al. 2021
7 Disjointness Through the Lens of Vapnik–Chervonenkis Dimension: Sparsity and Beyond Bhattacharya, Anup et al. 2020
8 Triangle Estimation Using Tripartite Independent Set Queries Bhattacharya, Anup et al. 2019
9 FPT Algorithms for Embedding into Low Complexity Graphic Metrics Ghosh, Arijit et al. 2018
10 Local Criteria for Triangulation of Manifolds Boissonnat, Jean-Daniel et al. 2018
11 Parameterized Query Complexity of Hitting Set Using Stability of Sunflowers Bishnu, Arijit et al. 2018
12 Kernelization of the Subset General Position Problem in Geometry Boissonnat, Jean-Daniel et al. 2017
13 Shallow Packings, Semialgebraic Set Systems, Macbeath Regions, and Polynomial Partitioning Dutta, Kunal et al. 2017
14 Two Proofs for Shallow Packings Dutta, Kunal et al. 2015
Current Page :
Number of result pages: 1
Number of documents: 14


DROPS-Home | Fulltext Search | Imprint | Privacy Published by LZI