| 2012 | ||
|---|---|---|
| 16 | K. M. Poonacha, Subir Bhattacharya: Towards a Framework for Assessing Agility. HICSS 2012: 5329-5338 | |
| 2010 | ||
| 15 | Rahul Thakurta, Rahul Roy, Subir Bhattacharya: A Systems View of Software Requirement volatility. AMCIS 2010: 324 | |
| 2009 | ||
| 14 | Ritesh Kumar, Subir Bhattacharya: Multi-agent model for threshold constrained portfolio selection. CASE 2009: 140-145 | |
| 13 | Ritesh Kumar, Subir Bhattacharya: Agent Based Model for Cardinality Constrained Portfolio Selection Problem: Preliminary Results. HICSS 2009: 1-10 | |
| 12 | Rahul Thakurta, Rahul Roy, Subir Bhattacharya: Impact of Requirements Discovery Pattern on Software Project Outcome: Preliminary Results. HICSS 2009: 1-6 | |
| 11 | Sumit Kumar Bose, Subir Bhattacharya: A State Task Network model for scheduling operations in cascaded continuous processing units. Computers & Chemical Engineering 33(1): 287-295 (2009) | |
| 2008 | ||
| 10 | Sumit Kumar Bose, Subir Bhattacharya: A two pass heuristic algorithm for scheduling 'blocked out' units in continuous process industry. Annals OR 159(1): 293-313 (2008) | |
| 2007 | ||
| 9 | Subir Bhattacharya, Sumit Kumar Bose: Mathematical model for scheduling operations in cascaded continuous processing units. European Journal of Operational Research 182(1): 1-14 (2007) | |
| 1999 | ||
| 8 | Terence Nazareth, Sanjay Verma, Subir Bhattacharya, Amitava Bagchi: The multiple resource constrained project scheduling problem: A breadth-first approach. European Journal of Operational Research 112(2): 347-366 (1999) | |
| 1996 | ||
| 7 | Subir Bhattacharya, Amitava Bagchi: Searching Game Trees Under Memory Constraints. AAAI/IAAI, Vol. 1 1996: 222-227 | |
| 1995 | ||
| 6 | Subir Bhattacharya: Experimenting with Revisits in Game Tree Search. IJCAI 1995: 243-251 | |
| 1994 | ||
| 5 | Subir Bhattacharya, Amitava Bagchi: A General Framework for Minimax Search in Game Trees. Inf. Process. Lett. 52(6): 295-301 (1994) | |
| 1993 | ||
| 4 | Subir Bhattacharya, Amitava Bagchi: A Faster Alternative to SSS* with Extension to Variable Memory. Inf. Process. Lett. 47(4): 209-214 (1993) | |
| 1992 | ||
| 3 | Subir Bhattacharya, Amitava Bagchi: QuickGame: A Compromise Between Pure Depth-first and Pure Best-first Game Tree Search Strategies. IWAR 1992: 211-220 | |
| 1989 | ||
| 2 | Subir Bhattacharya, Amitava Bagchi: Searching Game Trees in Parallel Using SSS. IJCAI 1989: 42-47 | |
| 1986 | ||
| 1 | Subir Bhattacharya, Amitava Bagchi: Making Best Use of Available Memory When Searching Game Trees. AAAI 1986: 163-167 | |
| 1 | Amitava Bagchi | [1] [2] [3] [4] [5] [7] [8] |
| 2 | Sumit Kumar Bose | [9] [10] [11] |
| 3 | Ritesh Kumar | [13] [14] |
| 4 | Terence Nazareth | [8] |
| 5 | K. M. Poonacha | [16] |
| 6 | Rahul Roy | [12] [15] |
| 7 | Rahul Thakurta | [12] [15] |
| 8 | Sanjay Verma | [8] |
Colors in the list of coauthors
Last update Thu May 24 01:13:30 2012 CET by the DBLP Team —
Data released under the ODC-BY 1.0 license — See also our legal information page