default search action
Subir Bhattacharya
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2021
- [j9]Kushal Saha, Subir Bhattacharya:
'Buy online and pick up in-store': Implications for the store inventory. Eur. J. Oper. Res. 294(3): 906-921 (2021)
2010 – 2019
- 2017
- [c13]Kushal Saha, Subir Bhattacharya:
Economic Perspective Of Omnichannel: A Preliminary Analysis. MCIS 2017: 17 - 2015
- [c12]Subir Bhattacharya, Rahul Roy:
IT for Managers: Journey of a core MBA course over ten years. AMCIS 2015 - [c11]Subir Bhattacharya, Kushal Saha:
Perceptions about Agility Enablers and their Relative Importance: a Collation. AMCIS 2015 - 2012
- [j8]Ritesh Kumar, Subir Bhattacharya:
Cooperative Search Using Agents for Cardinality Constrained Portfolio Selection Problem. IEEE Trans. Syst. Man Cybern. Part C 42(6): 1510-1518 (2012) - [c10]K. M. Poonacha, Subir Bhattacharya:
Towards a Framework for Assessing Agility. HICSS 2012: 5329-5338 - 2010
- [c9]Rahul Thakurta, Rahul Roy, Subir Bhattacharya:
A Systems View of Software Requirement volatility. AMCIS 2010: 324
2000 – 2009
- 2009
- [j7]Sumit Kumar Bose, Subir Bhattacharya:
A State Task Network model for scheduling operations in cascaded continuous processing units. Comput. Chem. Eng. 33(1): 287-295 (2009) - [c8]Ritesh Kumar, Subir Bhattacharya:
Multi-agent model for threshold constrained portfolio selection. CASE 2009: 140-145 - [c7]Ritesh Kumar, Subir Bhattacharya:
Agent Based Model for Cardinality Constrained Portfolio Selection Problem: Preliminary Results. HICSS 2009: 1-10 - [c6]Rahul Thakurta
, Rahul Roy, Subir Bhattacharya:
Impact of Requirements Discovery Pattern on Software Project Outcome: Preliminary Results. HICSS 2009: 1-6 - 2008
- [j6]Sumit Kumar Bose, Subir Bhattacharya:
A two pass heuristic algorithm for scheduling 'blocked out' units in continuous process industry. Ann. Oper. Res. 159(1): 293-313 (2008) - 2007
- [j5]Subir Bhattacharya, Sumit Kumar Bose:
Mathematical model for scheduling operations in cascaded continuous processing units. Eur. J. Oper. Res. 182(1): 1-14 (2007)
1990 – 1999
- 1999
- [j4]Terence Nazareth, Sanjay Verma, Subir Bhattacharya, Amitava Bagchi:
The multiple resource constrained project scheduling problem: A breadth-first approach. Eur. J. Oper. Res. 112(2): 347-366 (1999) - 1998
- [j3]Subir Bhattacharya, Rahul Roy, Sumita Bhattacharya:
An exact depth-first algorithm for the pallet loading problem. Eur. J. Oper. Res. 110(3): 610-625 (1998) - 1996
- [c5]Subir Bhattacharya, Amitava Bagchi:
Searching Game Trees Under Memory Constraints. AAAI/IAAI, Vol. 1 1996: 222-227 - 1995
- [c4]Subir Bhattacharya:
Experimenting with Revisits in Game Tree Search. IJCAI 1995: 243-251 - 1994
- [j2]Subir Bhattacharya, Amitava Bagchi:
A General Framework for Minimax Search in Game Trees. Inf. Process. Lett. 52(6): 295-301 (1994) - 1993
- [j1]Subir Bhattacharya, Amitava Bagchi:
A Faster Alternative to SSS* with Extension to Variable Memory. Inf. Process. Lett. 47(4): 209-214 (1993) - 1992
- [c3]Subir Bhattacharya, Amitava Bagchi:
QuickGame: A Compromise Between Pure Depth-first and Pure Best-first Game Tree Search Strategies. IWAR 1992: 211-220
1980 – 1989
- 1989
- [c2]Subir Bhattacharya, Amitava Bagchi:
Searching Game Trees in Parallel Using SSS. IJCAI 1989: 42-47 - 1986
- [c1]Subir Bhattacharya, Amitava Bagchi:
Making Best Use of Available Memory When Searching Game Trees. AAAI 1986: 163-167
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-04-25 05:42 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: