Admissible Heuristic Search in And/Or Graphs. - Amitava Bagchi; A. Mahanti (Theor. Comput. Sci., 1983)

Search Algorithms Under Different Kinds of Heuristics-A Comparative Study - Amitava Bagchi; A. Mahanti (J. ACM, 1983)

Three Approaches to Heuristic Search in Networks - Amitava Bagchi; A. Mahanti (J. ACM, 1985)

AND/OR Graph Heuristic Search Methods - A. Mahanti; Amitava Bagchi (J. ACM, 1985)

Making Best Use of Available Memory When Searching Game Trees. - Subir Bhattacharya; Amitava Bagchi (AAAI, 1986)

Heuristic search in general tree structures: an average case analysis. - Amitava Bagchi; Anup K. Sen (ACM Conference on Computer Science, 1986)

Searching Game Trees in Parallel Using SSS. - Subir Bhattacharya; Amitava Bagchi (IJCAI, 1989)

Fast Recursive Formulations for Best-First Search That Allow Controlled Use of Memory. - Anup K. Sen; Amitava Bagchi (IJCAI, 1989)

Admissible Search Methods for Minimum Penalty Sequencing of Jobs with Setup Times on One and Two Machines. - Anup K. Sen; Amitava Bagchi; Bani K. Sinha (IJCAI, 1991)

QuickGame: A Compromise Between Pure Depth-first and Pure Best-first Game Tree Search Strategies. - Subir Bhattacharya; Amitava Bagchi (IWAR, 1992)

Non-Order-Preserving Evaluation Functions: Recursive Graph-Search Methods for Job Sequencing Problems. - Anup K. Sen; Amitava Bagchi (IJCAI, 1993)

A Faster Alternative to SSS* with Extension to Variable Memory. - Subir Bhattacharya; Amitava Bagchi (Inf. Process. Lett., 1993)

A General Framework for Minimax Search in Game Trees. - Subir Bhattacharya; Amitava Bagchi (Inf. Process. Lett., 1994)

Searching Game Trees Under Memory Constraints. - Subir Bhattacharya; Amitava Bagchi (AAAI/IAAI, Vol. 1, 1996)

Graph Search Methods for Non-Order-Preserving Evaluation Functions: Applications to Job Sequencing Problems. - Anup K. Sen; Amitava Bagchi (Artif. Intell., 1996)

Searching graphs with A*: applications to job sequencing. - Anup K. Sen; Amitava Bagchi; Ramkumar Ramaswamy (IEEE Trans. Syst. Man Cybern. Part A, 1996)

The multiple resource constrained project scheduling problem: A breadth-first approach. - Terence Nazareth; Sanjay Verma; Subir Bhattacharya; Amitava Bagchi (Eur. J. Oper. Res., 1999)

An Average-Case Analysis of Graph Search. - Anup K. Sen; Amitava Bagchi; Weixiong Zhang (AAAI/IAAI, 2002)

Internet Auctions: Some Issues and Problems. - Amitava Bagchi; Atul Saroop (IWDC, 2003)

Tuning the Quality Parameters of a Firewall to Maximize Net Benefit. - Wei T. Yue; Amitava Bagchi (IWDC, 2003)

The Development, Testing, and Release of Software Systems in the Internet Age: A Generalized Analytical Model. - Rahul Roy; Amitava Bagchi (ICIS, 2004)

Average-case analysis of best-first search in two representative directed acyclic graphs. - Anup K. Sen; Amitava Bagchi; Weixiong Zhang (Artif. Intell., 2004)

Time Delay in Rectification of Faults in Software Projects. - Rahul Roy; Amitava Bagchi (ICIS, 2006)

Improving Linkage of Web Pages. - Rakesh Gupta; Amitava Bagchi; Sumit Sarkar (INFORMS J. Comput., 2007)

On estimating the time taken to rectify faults in a software package during the system testing phase. - Rahul Roy; Amitava Bagchi (Inf. Process. Lett., 2007)

The representation, analysis and verification of business processes: a metagraph-based approach. - Arindam Mukherjee; Anup K. Sen; Amitava Bagchi (Inf. Technol. Manag., 2007)

Bidder Valuation of Bundles in Combinatorial Auctions. - Soumyakanti Chakraborty; Anup K. Sen; Amitava Bagchi (HICSS, 2008)

Revaluation of Bundles by Bidders in Combinatorial Auctions. - Soumyakanti Chakraborty; Anup K. Sen; Amitava Bagchi (HICSS, 2009)

Designing Proxy Bidders for Online Combinatorial Auctions. - Soumyakanti Chakraborty; Anup K. Sen; Amitava Bagchi (HICSS, 2009)

On Detecting Data Flow Errors in Workflows. - Hema S. Meda; Anup K. Sen; Amitava Bagchi (ACM J. Data Inf. Qual., 2010)

Semantic Notions of Weakly Correct AND/XOR Business Workflows Based on Partial Synchronization. - Akhil Kumar 001; Anup K. Sen; Meda H. Sundari; Amitava Bagchi (IEEE SCC, 2011)

Providing Information Feedback to Bidders in Online Multi-unit Combinatorial Auctions. - Anup K. Sen; Amitava Bagchi (AMCIS, 2012)

Experimenting with Proxy Agents in Online Combinatorial Auctions. - Soumyakanti Chakraborty; Anup Kumar Sen; Amitava Bagchi (Int. J. Intell. Inf. Technol., 2014)

Addressing the valuation problem in multi-round combinatorial auctions. - Soumyakanti Chakraborty; Anup K. Sen; Amitava Bagchi (Inf. Syst. Frontiers, 2015)

Designing information feedback for bidders in multi-item multi-unit combinatorial auctions. - Anup K. Sen; Amitava Bagchi; Soumyakanti Chakraborty (Decis. Support Syst., 2020)