default search action
Bhaswar B. Bhattacharya
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [j26]Sagnik Nandy
, Bhaswar B. Bhattacharya
Degree Heterogeneity in Higher-Order Networks: Inference in the Hypergraph β-Model. IEEE Trans. Inf. Theory 70(8): 6000-6024 (2024) - [j25]Bhaswar B. Bhattacharya
Sparse Uniformity Testing. IEEE Trans. Inf. Theory 70(9): 6371-6390 (2024) - [c11]Bhaswar B. Bhattacharya, Sandip Das, Sk Samim Islam, Saumya Sen:
Growth Rate of the Number of Empty Triangles in the Plane. CALDAM 2024: 77-87 - [i9]Bhaswar B. Bhattacharya, Sandip Das, Sk Samim Islam, Saumya Sen:
Growth Rate of the Number of Empty Triangles in the Plane. CoRR abs/2402.07775 (2024) - 2023
- [j24]Bhaswar B. Bhattacharya, Anirban Chatterjee, Svante Janson
Fluctuations of subgraph counts in graphon based random graphs. Comb. Probab. Comput. 32(3): 428-464 (2023) - [c10]Sayak Chatterjee, Dibyendu Saha, Soham Dan, Bhaswar B. Bhattacharya:
Two-Sample Tests for Inhomogeneous Random Graphs in Lr Norm: Optimality and Asymptotics. AISTATS 2023: 6903-6911 - [i8]Sagnik Nandy, Bhaswar B. Bhattacharya:
Degree Heterogeneity in Higher-Order Networks: Inference in the Hypergraph β-Model. CoRR abs/2307.02818 (2023) - 2022
- [j23]Aritra Banik, Bhaswar B. Bhattacharya, Sujoy Bhore, Leonardo Martínez-Sandoval
Geometric systems of unbiased representatives. Inf. Process. Lett. 176: 106232 (2022) - [j22]Bhaswar B. Bhattacharya, Xiao Fang, Han Yan:
Normal approximation and fourth moment theorems for monochromatic triangles. Random Struct. Algorithms 60(1): 25-53 (2022) - 2021
- [j21]Bhaswar B. Bhattacharya
Parameter Estimation for Undirected Graphical Models With Hard Constraints. IEEE Trans. Inf. Theory 67(10): 6790-6809 (2021) - [i7]Bhaswar B. Bhattacharya, Rajarshi Mukherjee:
Sparse Uniformity Testing. CoRR abs/2109.10481 (2021) - 2020
- [j20]Somabha Mukherjee, Bhaswar B. Bhattacharya:
Replica symmetry in upper tails of mean-field hypergraphs. Adv. Appl. Math. 119: 102047 (2020) - [j19]Bhaswar B. Bhattacharya, Somabha Mukherjee, Sumit Mukherjee:
The Second-Moment Phenomenon for Monochromatic Subgraphs. SIAM J. Discret. Math. 34(1): 794-824 (2020) - [j18]Bhaswar B. Bhattacharya, Shirshendu Ganguly:
Upper Tails for Edge Eigenvalues of Random Graphs. SIAM J. Discret. Math. 34(2): 1069-1083 (2020) - [c9]Soham Dan, Bhaswar B. Bhattacharya:
Goodness-of-Fit Tests for Inhomogeneous Random Graphs. ICML 2020: 2335-2344 - [i6]Aritra Banik, Bhaswar B. Bhattacharya, Sujoy Bhore, Leonardo Martínez-Sandoval:
Geometric Systems of Unbiased Representatives. CoRR abs/2002.05488 (2020) - [i5]Bhaswar B. Bhattacharya, Sohom Bhattacharya, Shirshendu Ganguly:
Spectral Edge in Sparse Random Graphs: Upper and Lower Tail Large Deviations. CoRR abs/2004.00611 (2020)
2010 – 2019
- 2019
- [j17]Bhaswar B. Bhattacharya, Sumit Mukherjee:
Monochromatic subgraphs in randomly colored graphons. Eur. J. Comb. 81: 328-353 (2019) - [j16]Aritra Banik, Bhaswar B. Bhattacharya, Sandip Das, Sreeja Das:
The 1-dimensional discrete Voronoi game. Oper. Res. Lett. 47(2): 115-121 (2019) - [j15]Bhaswar B. Bhattacharya, Sumit Mukherjee:
Limit theorems for monochromatic stars. Random Struct. Algorithms 55(4): 831-853 (2019) - [j14]Manjari Pradhan
Predicting X-Sensitivity of Circuit-Inputs on Test-Coverage: A Machine-Learning Approach. IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 38(12): 2343-2356 (2019) - [c8]Aritra Banik, Bhaswar B. Bhattacharya, Sujoy Bhore, Leonardo Martínez-Sandoval:
Geometric Systems of Unbiased Representatives. CCCG 2019: 38-43 - 2017
- [j13]Aritra Banik, Bhaswar B. Bhattacharya, Sandip Das, Satyaki Mukherjee:
The discrete Voronoi game in R2. Comput. Geom. 63: 53-62 (2017) - 2016
- [j12]Deepan Basu, Kinjal Basu, Bhaswar B. Bhattacharya, Sandip Das:
Almost empty monochromatic triangles in planar point sets. Discret. Appl. Math. 210: 207-213 (2016) - 2015
- [j11]Bhaswar B. Bhattacharya, Sumit Mukherjee:
Exact and asymptotic results on coarse Ricci curvature of graphs. Discret. Math. 338(1): 23-42 (2015) - [c7]Bhaswar B. Bhattacharya, Gregory Valiant:
Testing Closeness With Unequal Sized Samples. NIPS 2015: 2611-2619 - [i4]Bhaswar B. Bhattacharya, Gregory Valiant:
Testing Closeness With Unequal Sized Samples. CoRR abs/1504.04599 (2015) - 2014
- [j10]Bhaswar B. Bhattacharya, Sayantan Das, Shirshendu Ganguly:
Minimum-Weight Edge Discriminators in Hypergraphs. Electron. J. Comb. 21(3): 3 (2014) - [j9]Aritra Banik, Bhaswar B. Bhattacharya, Sandip Das:
Minimum enclosing circle of a set of fixed points and a mobile point. Comput. Geom. 47(9): 891-898 (2014) - 2013
- [j8]Bhaswar B. Bhattacharya, Sandip Das:
On pseudo-convex partitions of a planar point set. Discret. Math. 313(21): 2401-2408 (2013) - [j7]Deepan Basu, Bhaswar B. Bhattacharya, Sandip Das:
Almost Empty Monochromatic Triangles in Planar Point Sets. Electron. Notes Discret. Math. 44: 53-59 (2013) - [j6]Bhaswar B. Bhattacharya, Subhas C. Nandy:
New variations of the maximum coverage facility location problem. Eur. J. Oper. Res. 224(3): 477-485 (2013) - [j5]Aritra Banik, Bhaswar B. Bhattacharya, Sandip Das:
Optimal strategies for the one-round discrete Voronoi game on a line. J. Comb. Optim. 26(4): 655-669 (2013) - [j4]Bhaswar B. Bhattacharya, Sandip Das:
Disjoint empty convex pentagons in planar point sets. Period. Math. Hung. 66(1): 73-86 (2013) - [c6]Aritra Banik, Bhaswar B. Bhattacharya, Sandip Das, Sreeja Das:
Two-Round Discrete Voronoi Game along a Line. FAW-AAIM 2013: 210-220 - [c5]Aritra Banik, Bhaswar B. Bhattacharya, Sandip Das, Satyaki Mukherjee:
One-Round Discrete Voronoi Game in ℝ2 in Presence of Existing Facilities. CCCG 2013 - [i3]Bhaswar B. Bhattacharya:
Collision Times in Multicolor Urn Models and Sequential Graph Coloring With Applications to Discrete Logarithms. CoRR abs/1311.4243 (2013) - 2012
- [j3]Riddhipratim Basu, Bhaswar B. Bhattacharya, Tanmoy Talukdar:
The Projection Median of a Set of Points in ℝ d. Discret. Comput. Geom. 47(2): 329-346 (2012) - 2011
- [j2]Bhaswar B. Bhattacharya:
On the Fermat-Weber Point of a Polygonal Chain and its Generalizations. Fundam. Informaticae 107(4): 331-343 (2011) - [c4]Aritra Banik, Bhaswar B. Bhattacharya, Sandip Das:
Optimal Strategies for the One-Round Discrete Voronoi Game on a Line. COCOON 2011: 213-224 - [c3]Aritra Banik, Bhaswar B. Bhattacharya, Sandip Das:
Minimum Enclosing Circle of a Set of Fixed Points and a Mobile Point. WALCOM 2011: 98-109 - 2010
- [j1]Bhaswar B. Bhattacharya:
Maximizing Voronoi Regions of a Set of Points Enclosed in a Circle with Applications to Facility Location. J. Math. Model. Algorithms 9(4): 375-392 (2010) - [c2]Riddhipratim Basu, Bhaswar B. Bhattacharya, Tanmoy Talukdar:
The projection median of a set of points in Rd. CCCG 2010: 151-154 - [c1]Bhaswar B. Bhattacharya, Subhas C. Nandy:
New variations of the reverse facility location problem. CCCG 2010: 241-244 - [i2]Bhaswar B. Bhattacharya:
On the Fermat-Weber Point of a Polygonal Chain. CoRR abs/1004.2958 (2010) - [i1]Bhaswar B. Bhattacharya, Sandip Das:
Holes or Empty Pseudo-Triangles in Planar Point Sets. CoRR abs/1011.0517 (2010)
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-10 02:06 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: