default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDKunal Dutta
Person information
- affiliation: University of Warsaw, Department of Mathematics, Poland
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[c13]Prarabdh Shukla, Gagan Raj Gupta, Kunal Dutta:
DiffRed: Dimensionality reduction guided by stable rank. AISTATS 2024: 3430-3438- [c12]Jean-Daniel Boissonnat, Kunal Dutta, Soumik Dutta, Siddharth Pritam:
On Edge Collapse of Random Simplicial Complexes. SoCG 2024: 21:1-21:16 - [c11]Jean-Daniel Boissonnat, Kunal Dutta:
A Euclidean Embedding for Computing Persistent Homology with Gaussian Kernels. ESA 2024: 29:1-29:18 - [i10]Prarabdh Shukla, Gagan Raj Gupta, Kunal Dutta:
DiffRed: Dimensionality Reduction guided by stable rank. CoRR abs/2403.05882 (2024) - 2023
- [j13]Kunal Dutta
, C. R. Subramanian:
On Induced Paths, Holes, and Trees in Random Graphs. SIAM J. Discret. Math. 37(1): 279-303 (2023) - [i9]Jean-Daniel Boissonnat, Kunal Dutta:
Dimensionality Reduction for Persistent Homology with Gaussian Kernels. CoRR abs/2301.03321 (2023) - [i8]Kunal Dutta, Arijit Ghosh:
Sparse Geometric Set Systems and the Beck-Fiala Conjecture. CoRR abs/2301.03329 (2023) - [i7]Jean-Daniel Boissonnat, Kunal Dutta, Soumik Dutta, Siddharth Pritam:
Strong Collapse of Random Simplicial Complexes. CoRR abs/2301.03514 (2023) - 2022
- [c10]Kunal Dutta, Arijit Ghosh, Shay Moran:
Uniform Brackets, Containers, and Combinatorial Macbeath Regions. ITCS 2022: 59:1-59:10 - 2021
- [j12]Jean-Daniel Boissonnat, Olivier Devillers, Kunal Dutta, Marc Glisse:
Randomized Incremental Construction of Delaunay Triangulations of Nice Point Sets. Discret. Comput. Geom. 66(1): 236-268 (2021) - [j11]Shreya Arya, Jean-Daniel Boissonnat, Kunal Dutta, Martin Lotz:
Dimensionality reduction for k-distance applied to persistent homology. J. Appl. Comput. Topol. 5(4): 671-691 (2021) - [i6]Shreya Arya, Jean-Daniel Boissonnat, Kunal Dutta, Martin Lotz:
Dimensionality Reduction for k-Distance Applied to Persistent Homology. CoRR abs/2110.05897 (2021) - [i5]Kunal Dutta, Arijit Ghosh, Shay Moran:
Uniform Brackets, Containers, and Combinatorial Macbeath Regions. CoRR abs/2111.10048 (2021) - 2020
- [c9]Shreya Arya, Jean-Daniel Boissonnat, Kunal Dutta, Martin Lotz:
Dimensionality Reduction for k-Distance Applied to Persistent Homology. SoCG 2020: 10:1-10:15 - [i4]Kunal Dutta:
On Limit Constants in Last Passage Percolation in Transitive Tournaments. CoRR abs/2005.09922 (2020)
2010 – 2019
- 2019
- [j10]Kunal Dutta, Arijit Ghosh, Bruno Jartoux, Nabil H. Mustafa:
Shallow Packings, Semialgebraic Set Systems, Macbeath Regions, and Polynomial Partitioning. Discret. Comput. Geom. 61(4): 756-777 (2019) - [c8]Jean-Daniel Boissonnat, Olivier Devillers, Kunal Dutta, Marc Glisse:
Randomized Incremental Construction of Delaunay Triangulations of Nice Point Sets. ESA 2019: 22:1-22:13 - 2018
- [j9]Nabil H. Mustafa, Kunal Dutta, Arijit Ghosh:
A Simple Proof of Optimal Epsilon Nets. Comb. 38(5): 1269-1277 (2018) - [c7]Kunal Dutta, C. R. Subramanian:
On Induced Paths, Holes and Trees in Random Graphs. ANALCO 2018: 168-177 - [c6]Jean-Daniel Boissonnat, Kunal Dutta, Arijit Ghosh, Sudeshna Kolay:
Tight Kernels for Covering and Hitting: Point Hyperplane Cover and Polynomial Point Hitting Set. LATIN 2018: 187-200 - 2017
- [c5]Kunal Dutta, Arijit Ghosh, Bruno Jartoux, Nabil H. Mustafa:
Shallow Packings, Semialgebraic Set Systems, Macbeath Regions, and Polynomial Partitioning. SoCG 2017: 38:1-38:15 - [c4]Jean-Daniel Boissonnat, Kunal Dutta, Arijit Ghosh, Sudeshna Kolay:
Kernelization of the Subset General Position Problem in Geometry. MFCS 2017: 25:1-25:13 - 2016
- [j8]Kunal Dutta, Esther Ezra, Arijit Ghosh:
Two Proofs for Shallow Packings. Discret. Comput. Geom. 56(4): 910-939 (2016) - [j7]Arijit Bishnu, Kunal Dutta, Arijit Ghosh, Subhabrata Paul:
(1, j)-set problem in graphs. Discret. Math. 339(10): 2515-2525 (2016) - [j6]Kunal Dutta, C. R. Subramanian:
Improved Bounds on Induced Acyclic Subgraphs in Random Digraphs. SIAM J. Discret. Math. 30(3): 1848-1865 (2016) - [c3]Kunal Dutta, Arijit Ghosh:
On Subgraphs of Bounded Degeneracy in Hypergraphs. WG 2016: 295-306 - 2015
- [c2]Kunal Dutta, Esther Ezra, Arijit Ghosh:
Two Proofs for Shallow Packings. SoCG 2015: 96-110 - 2014
- [j5]Jeff Cooper, Kunal Dutta, Dhruv Mubayi:
Counting Independent Sets in Hypergraphs. Comb. Probab. Comput. 23(4): 539-550 (2014) - [j4]Kunal Dutta, C. R. Subramanian:
Induced acyclic tournaments in random digraphs: Sharp concentration, thresholds and algorithms. Discuss. Math. Graph Theory 34(3): 467-495 (2014) - [i3]Arijit Bishnu, Kunal Dutta, Arijit Ghosh, Subhabrata Paul:
$(1, j)$-set problem in graphs. CoRR abs/1410.3091 (2014) - [i2]Kunal Dutta, Arijit Ghosh:
Size sensitive packing number for Hamming cube and its consequences. CoRR abs/1412.3922 (2014) - 2013
- [i1]Jeff Cooper, Kunal Dutta, Dhruv Mubayi:
Counting independent sets in hypergraphs. CoRR abs/1310.6672 (2013) - 2012
- [j3]Kunal Dutta, Dhruv Mubayi, C. R. Subramanian:
New Lower Bounds for the Independence Number of Sparse Graphs and Hypergraphs. SIAM J. Discret. Math. 26(3): 1134-1147 (2012) - 2011
- [j2]Kunal Dutta, C. R. Subramanian:
On induced acyclic subgraphs in sparse random digraphs. Electron. Notes Discret. Math. 38: 319-324 (2011) - [j1]Kunal Dutta, Amritanshu Prasad:
Degenerations and orbits in finite abelian groups. J. Comb. Theory A 118(6): 1685-1694 (2011) - 2010
- [c1]Kunal Dutta, C. R. Subramanian:
Largest Induced Acyclic Tournament in Random Digraphs: A 2-Point Concentration. LATIN 2010: 627-637
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-09-26 01:01 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:
