| 2011 | ||
|---|---|---|
| 26 | Akhil Kumar, Anup K. Sen, Meda H. Sundari, Amitava Bagchi: Semantic Notions of Weakly Correct AND/XOR Business Workflows Based on Partial Synchronization. IEEE SCC 2011: 128-135 | |
| 2010 | ||
| 25 | Hema S. Meda, Anup K. Sen, Amitava Bagchi: On Detecting Data Flow Errors in Workflows. J. Data and Information Quality 2(1): (2010) | |
| 2009 | ||
| 24 | Soumyakanti Chakraborty, Anup K. Sen, Amitava Bagchi: Designing Proxy Bidders for Online Combinatorial Auctions. HICSS 2009: 1-10 | |
| 23 | Soumyakanti Chakraborty, Anup K. Sen, Amitava Bagchi: Revaluation of Bundles by Bidders in Combinatorial Auctions. HICSS 2009: 1-10 | |
| 2008 | ||
| 22 | Soumyakanti Chakraborty, Anup K. Sen, Amitava Bagchi: Bidder Valuation of Bundles in Combinatorial Auctions. HICSS 2008: 51 | |
| 2007 | ||
| 21 | Rakesh Gupta, Amitava Bagchi, Sumit Sarkar: Improving Linkage of Web Pages. INFORMS Journal on Computing 19(1): 127-136 (2007) | |
| 20 | Rahul Roy, Amitava Bagchi: On estimating the time taken to rectify faults in a software package during the system testing phase. Inf. Process. Lett. 104(5): 168-172 (2007) | |
| 2006 | ||
| 19 | Rahul Roy, Amitava Bagchi: Time Delay in Rectification of Faults in Software Projects. ICIS 2006: 14 | |
| 2004 | ||
| 18 | Rahul Roy, Amitava Bagchi: The Development, Testing, and Release of Software Systems in the Internet Age: A Generalized Analytical Model. ICIS 2004: 399-412 | |
| 17 | Anup K. Sen, Amitava Bagchi, Weixiong Zhang: Average-case analysis of best-first search in two representative directed acyclic graphs. Artif. Intell. 155(1-2): 183-206 (2004) | |
| 2003 | ||
| 16 | Amitava Bagchi, Atul Saroop: Internet Auctions: Some Issues and Problems. IWDC 2003: 112-119 | |
| 15 | Wei T. Yue, Amitava Bagchi: Tuning the Quality Parameters of a Firewall to Maximize Net Benefit. IWDC 2003: 321-329 | |
| 2002 | ||
| 14 | Anup K. Sen, Amitava Bagchi, Weixiong Zhang: An Average-Case Analysis of Graph Search. AAAI/IAAI 2002: 757- | |
| 1999 | ||
| 13 | 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 | ||
| 12 | Subir Bhattacharya, Amitava Bagchi: Searching Game Trees Under Memory Constraints. AAAI/IAAI, Vol. 1 1996: 222-227 | |
| 11 | Anup K. Sen, Amitava Bagchi: Graph Search Methods for Non-Order-Preserving Evaluation Functions: Applications to Job Sequencing Problems. Artif. Intell. 86(1): 43-73 (1996) | |
| 10 | Anup K. Sen, Amitava Bagchi, Ramkumar Ramaswamy: Searching graphs with A*: applications to job sequencing. IEEE Transactions on Systems, Man, and Cybernetics, Part A 26(1): 168-173 (1996) | |
| 1994 | ||
| 9 | Subir Bhattacharya, Amitava Bagchi: A General Framework for Minimax Search in Game Trees. Inf. Process. Lett. 52(6): 295-301 (1994) | |
| 1993 | ||
| 8 | Anup K. Sen, Amitava Bagchi: Non-Order-Preserving Evaluation Functions: Recursive Graph-Search Methods for Job Sequencing Problems. IJCAI 1993: 1423-1429 | |
| 7 | Subir Bhattacharya, Amitava Bagchi: A Faster Alternative to SSS* with Extension to Variable Memory. Inf. Process. Lett. 47(4): 209-214 (1993) | |
| 1992 | ||
| 6 | Subir Bhattacharya, Amitava Bagchi: QuickGame: A Compromise Between Pure Depth-first and Pure Best-first Game Tree Search Strategies. IWAR 1992: 211-220 | |
| 1991 | ||
| 5 | Anup K. Sen, Amitava Bagchi, Bani K. Sinha: Admissible Search Methods for Minimum Penalty Sequencing of Jobs with Setup Times on One and Two Machines. IJCAI 1991: 178-183 | |
| 1989 | ||
| 4 | Anup K. Sen, Amitava Bagchi: Fast Recursive Formulations for Best-First Search That Allow Controlled Use of Memory. IJCAI 1989: 297-302 | |
| 3 | Subir Bhattacharya, Amitava Bagchi: Searching Game Trees in Parallel Using SSS. IJCAI 1989: 42-47 | |
| 1986 | ||
| 2 | Subir Bhattacharya, Amitava Bagchi: Making Best Use of Available Memory When Searching Game Trees. AAAI 1986: 163-167 | |
| 1 | Amitava Bagchi, Anup K. Sen: Heuristic search in general tree structures: an average case analysis. ACM Conference on Computer Science 1986: 309-318 | |
| 1 | Subir Bhattacharya | [2] [3] [6] [7] [9] [12] [13] |
| 2 | Soumyakanti Chakraborty | [22] [23] [24] |
| 3 | Rakesh Gupta | [21] |
| 4 | Akhil Kumar | [26] |
| 5 | Hema S. Meda | [25] |
| 6 | Terence Nazareth | [13] |
| 7 | Ramkumar Ramaswamy | [10] |
| 8 | Rahul Roy | [18] [19] [20] |
| 9 | Sumit Sarkar | [21] |
| 10 | Atul Saroop | [16] |
| 11 | Anup K. Sen | [1] [4] [5] [8] [10] [11] [14] [17] [22] [23] [24] [25] [26] |
| 12 | Bani K. Sinha | [5] |
| 13 | Meda H. Sundari | [26] |
| 14 | Sanjay Verma | [13] |
| 15 | Wei T. Yue | [15] |
| 16 | Weixiong Zhang | [14] [17] |
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