| 2012 | ||
|---|---|---|
| c15 | Anup K. Sen, Amitava Bagchi: Providing Information Feedback to Bidders in Online Multi-unit Combinatorial Auctions. AMCIS 2012 | |
| 2011 | ||
| c14 | 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 | ||
| j9 | Hema S. Meda, Anup K. Sen, Amitava Bagchi: On Detecting Data Flow Errors in Workflows. J. Data and Information Quality 2(1) (2010) | |
| c13 | Viswanathan Kodaganallur, Anup K. Sen: Greedy by Chance - Stochastic Greedy Algorithms. ICAS 2010: 182-187 | |
| 2009 | ||
| c12 | Soumyakanti Chakraborty, Anup K. Sen, Amitava Bagchi: Revaluation of Bundles by Bidders in Combinatorial Auctions. HICSS 2009: 1-10 | |
| c11 | Soumyakanti Chakraborty, Anup K. Sen, Amitava Bagchi: Designing Proxy Bidders for Online Combinatorial Auctions. HICSS 2009: 1-10 | |
| 2008 | ||
| j8 | Raj Jog Singh, Anup K. Sen: Exploring local search in winner determination problem. Information Technology and Management 9(2): 105-119 (2008) | |
| c10 | ||
| c9 | Soumyakanti Chakraborty, Anup K. Sen, Amitava Bagchi: Bidder Valuation of Bundles in Combinatorial Auctions. HICSS 2008: 51 | |
| 2007 | ||
| j7 | Arindam Mukherjee, Anup K. Sen, Amitava Bagchi: The representation, analysis and verification of business processes: a metagraph-based approach. Information Technology and Management 8(1): 65-81 (2007) | |
| 2004 | ||
| j6 | 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) | |
| 2002 | ||
| c8 | Anup K. Sen, Amitava Bagchi, Weixiong Zhang: An Average-Case Analysis of Graph Search. AAAI/IAAI 2002: 757-763 | |
| 2001 | ||
| j5 | Sakib A. Mondal, Anup K. Sen: Single machine weighted earliness-tardiness penalty problem with a common due date. Computers & OR 28(7): 649-669 (2001) | |
| j4 | Parthasarathi Dasgupta, Anup K. Sen, Subhas C. Nandy, Bhargab B. Bhattacharya: Searching networks with unrestricted edge costs. IEEE Transactions on Systems, Man, and Cybernetics, Part A 31(6): 497-507 (2001) | |
| 2000 | ||
| j3 | Sakib A. Mondal, Anup K. Sen: An improved precedence rule for single machine sequencing problems with quadratic penalty. European Journal of Operational Research 125(2): 425-428 (2000) | |
| c7 | Sakib A. Mondal, Anup K. Sen: TCBB Scheme: Applications to Single Machine Job Sequencing Problems. AAAI/IAAI 2000: 792-797 | |
| 1996 | ||
| j2 | 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) | |
| j1 | 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) | |
| c6 | Parthasarathi Dasgupta, Anup K. Sen, Subhas C. Nandy, Bhargab B. Bhattacharya: Geometric bipartitioning problem and its applications to VLSI. VLSI Design 1996: 400-405 | |
| 1993 | ||
| c5 | Anup K. Sen, Amitava Bagchi: Non-Order-Preserving Evaluation Functions: Recursive Graph-Search Methods for Job Sequencing Problems. IJCAI 1993: 1423-1429 | |
| 1992 | ||
| c4 | R. Ramaswamy, Anup K. Sen: Single Machine Scheduling as a Graph Search Problem with Path-Dependent Arc Costs. ECAI 1992: 11-15 | |
| 1991 | ||
| c3 | 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 | ||
| c2 | Anup K. Sen, Amitava Bagchi: Fast Recursive Formulations for Best-First Search That Allow Controlled Use of Memory. IJCAI 1989: 297-302 | |
| 1986 | ||
| c1 | Amitava Bagchi, Anup K. Sen: Heuristic search in general tree structures: an average case analysis. ACM Conference on Computer Science 1986: 309-318 | |
Colors in the list of coauthors
Last update Thu May 23 17:16:39 2013 CET by the DBLP Team —
Data released under the ODC-BY 1.0 license — See also our legal information page