default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDBhaskar Bagchi
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2022
[j27]Bhaskar Bagchi:
Parametric restrictions on quasi-symmetric designs. Eur. J. Comb. 99: 103434 (2022)
2010 – 2019
- 2019
- [j26]Bhaskar Bagchi:
A coding theoretic approach to the uniqueness conjecture for projective planes of prime order. Des. Codes Cryptogr. 87(10): 2375-2389 (2019) - 2018
- [j25]Bhaskar Bagchi, N. S. Narasimha Sastry:
Corrigendum to the paper "Ovoidal packings of PG(3, q) for even q". Discret. Math. 341(4): 1194 (2018) - 2017
- [j24]Bhaskar Bagchi, Basudeb Datta
, Jonathan Spreer:
A characterization of tightly triangulated 3-manifolds. Eur. J. Comb. 61: 133-137 (2017) - 2016
- [j23]Bhaskar Bagchi:
The mu vector, Morse inequalities and a generalized lower bound theorem for locally tame combinatorial manifolds. Eur. J. Comb. 51: 69-83 (2016) - [j22]Bhaskar Bagchi, Basudeb Datta, Jonathan Spreer:
Tight triangulations of closed 3-manifolds. Eur. J. Comb. 54: 103-120 (2016) - [c1]Bhaskar Bagchi, Basudeb Datta, Benjamin A. Burton, Nitin Singh, Jonathan Spreer:
Efficient Algorithms to Decide Tightness. SoCG 2016: 12:1-12:15 - 2015
- [j21]Bhaskar Bagchi, Basudeb Datta:
Corrigendum to "Combinatorial triangulations of homology spheres" [Discrete Math. 305(2005) 1-17]. Discret. Math. 338(4): 569-570 (2015) - [j20]Bhaskar Bagchi:
A tightness criterion for homology manifolds with or without boundary. Eur. J. Comb. 46: 10-15 (2015) - 2014
- [j19]Bhaskar Bagchi, Basudeb Datta:
On stellated spheres and a tightness criterion for combinatorial manifolds. Eur. J. Comb. 36: 294-313 (2014) - [i2]Bhaskar Bagchi, Benjamin A. Burton, Basudeb Datta, Nitin Singh, Jonathan Spreer:
Efficient algorithms to decide tightness. CoRR abs/1412.1547 (2014) - 2013
- [j18]Bhaskar Bagchi, N. S. Narasimha Sastry:
Ovoidal packings of PG(3, q)PG(3, q) for even qq. Discret. Math. 313(20): 2213-2217 (2013) - [j17]Bhaskar Bagchi, Basudeb Datta:
On kk-stellated and kk-stacked spheres. Discret. Math. 313(20): 2318-2329 (2013) - [j16]Bhaskar Bagchi, Basudeb Datta:
Higher-Dimensional Analogues of the Map Coloring Problem. Am. Math. Mon. 120(8): 733-737 (2013) - 2012
- [j15]Bhaskar Bagchi, Basudeb Datta:
A Triangulation of ℂP 3 as Symmetric Cube of S 2. Discret. Comput. Geom. 48(2): 310-329 (2012) - [i1]Bhaskar Bagchi, Basudeb Datta:
Higher dimensional analogues of the map colouring problem. CoRR abs/1202.0153 (2012) - 2011
- [j14]Bhaskar Bagchi, Basudeb Datta:
From the Icosahedron to Natural Triangulations of ℂP2 and S2×S2. Discret. Comput. Geom. 46(3): 542-560 (2011) - [j13]Bhaskar Bagchi, Basudeb Datta:
On Walkup's class K(d) and a minimal triangulation of (S3 X S1)#3. Discret. Math. 311(12): 989-995 (2011)
2000 – 2009
- 2008
- [j12]Bhaskar Bagchi, Basudeb Datta:
Uniqueness of Walkup's 9-vertex 3-dimensional Klein bottle. Discret. Math. 308(22): 5087-5095 (2008) - [j11]Bhaskar Bagchi, Basudeb Datta:
Minimal triangulations of sphere bundles over the circle. J. Comb. Theory A 115(5): 737-752 (2008) - 2006
- [j10]Bhaskar Bagchi:
On strongly regular graphs with µ <=2. Discret. Math. 306(14): 1502-1504 (2006) - 2005
- [j9]Bhaskar Bagchi, Basudeb Datta:
Combinatorial triangulations of homology spheres. Discret. Math. 305(1-3): 1-17 (2005) - 2003
- [j8]Bhaskar Bagchi:
On strongly regular graphs with µ >= 2. Electron. Notes Discret. Math. 15: 34 (2003) - 2002
- [j7]Bhaskar Bagchi, S. P. Inamdar:
Projective Geometric Codes. J. Comb. Theory A 99(1): 128-142 (2002)
1990 – 1999
- 1998
- [j6]Bhaskar Bagchi, Basudeb Datta:
A structure theorem for pseudomanifolds. Discret. Math. 188(1-3): 41-60 (1998) - 1992
- [j5]Bhaskar Bagchi:
On Quasi-Symmetric Designs. Des. Codes Cryptogr. 2(1): 69-79 (1992)
1980 – 1989
- 1989
- [j4]Sunanda Bagchi, Bhaskar Bagchi:
Designs from pairs of finite fields. A cyclic unital U(6) and other regular steiner 2-designs. J. Comb. Theory A 52(1): 51-61 (1989) - 1988
- [j3]Bhaskar Bagchi, N. S. Narasimha Sastry:
One-Step Completely Orthogonalizable Codes from Generalized Quadrangles. Inf. Comput. 77(2): 123-130 (1988) - [j2]Bhaskar Bagchi:
No extendable biplane of order nine. J. Comb. Theory A 49(1): 1-12 (1988) - 1985
- [j1]Bhaskar Bagchi, N. S. Narasimha Sastry:
Minimum weight words of binary codes associated with finite projective geometries. Discret. Math. 57(3): 307-310 (1985)
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-06-10 21:24 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:
