A simple proof of optimal epsilon nets NH Mustafa, K Dutta, A Ghosh Combinatorica, 1-9, 2017 | 29 | 2017 |
New lower bounds for the independence number of sparse graphs and hypergraphs K Dutta, D Mubayi, CR Subramanian SIAM Journal on Discrete Mathematics 26 (3), 1134-1147, 2012 | 17 | 2012 |
Two proofs for shallow packings K Dutta, E Ezra, A Ghosh Discrete & Computational Geometry 56 (4), 910-939, 2016 | 15 | 2016 |
Shallow packings, semialgebraic set systems, Macbeath regions and polynomial partitioning K Dutta, A Ghosh, B Jartoux, N Mustafa 33rd International Symposium on Computational Geometry (SoCG 2017), 2017 | 14 | 2017 |
Combinatorics of finite abelian groups and Weil representations K Dutta, A Prasad Pacific Journal of Mathematics 275 (2), 295-324, 2015 | 14 | 2015 |
On Induced Paths, Holes and Trees in Random Graphs K Dutta, CR Subramanian 2018 Proceedings of the Fifteenth Workshop on Analytic Algorithmics and …, 2018 | 13 | 2018 |
Degenerations and orbits in finite abelian groups K Dutta, A Prasad Journal of Combinatorial Theory, Series A 118 (6), 1685-1694, 2011 | 13 | 2011 |
Counting independent sets in hypergraphs J Cooper, K Dutta, D Mubayi Combinatorics, Probability and Computing 23 (4), 539-550, 2014 | 10 | 2014 |
Dimensionality Reduction for k-Distance Applied to Persistent Homology S Arya, JD Boissonnat, K Dutta, M Lotz 36th International Symposium on Computational Geometry (SoCG 2020), 2020 | 8 | 2020 |
(1, j)-set problem in graphs A Bishnu, K Dutta, A Ghosh, S Paul Discrete Mathematics 339 (10), 2515-2525, 2016 | 7 | 2016 |
Induced acyclic subgraphs in random digraphs: Improved bounds CR Subramanian, K Dutta Discrete Mathematics & Theoretical Computer Science, 2010 | 5* | 2010 |
Induced acyclic subgraphs in random digraphs: Improved bounds K Dutta, CR Subramanian 21st International Meeting on Probabilistic, Combinatorial, and Asymptotic …, 2010 | 5 | 2010 |
Randomized incremental construction of Delaunay triangulations of nice point sets JD Boissonnat, O Devillers, K Dutta, M Glisse Discrete & Computational Geometry 66 (1), 236-268, 2021 | 4 | 2021 |
On limit constants in last passage percolation in transitive tournaments K Dutta arXiv preprint arXiv:2005.09922, 2020 | 3 | 2020 |
Improved bounds on induced acyclic subgraphs in random digraphs K Dutta, CR Subramanian SIAM Journal on Discrete Mathematics 30 (3), 1848-1865, 2016 | 3 | 2016 |
Induced Acyclic Tournaments in Random Digraphs: Sharp Concentration, Thresholds and Algorithms K Dutta, CR Subramanian Discussiones Mathematicae Graph Theory 34 (3), 467-495, 2014 | 3 | 2014 |
On induced acyclic subgraphs in sparse random digraphs K Dutta, CR Subramanian Electronic Notes in Discrete Mathematics 38, 319-324, 2011 | 3 | 2011 |
On induced paths, holes, and trees in random graphs K Dutta, CR Subramanian SIAM Journal on Discrete Mathematics 37 (1), 279-303, 2023 | 2 | 2023 |
Kernelization of the subset general position problem in geometry JD Boissonnat, K Dutta, A Ghosh, S Kolay LIPIcs-Leibniz International Proceedings in Informatics 83, 2017 | 2 | 2017 |
Degeneration and orbits of tuples and subgroups in an abelian group W Calvert, K Dutta, A Prasad Journal of Group Theory 16 (2), 221-233, 2013 | 2 | 2013 |