Anup K. Sen

2009
16	EE	Soumyakanti Chakraborty, Anup K. Sen, Amitava Bagchi: Designing Proxy Bidders for Online Combinatorial Auctions. HICSS 2009: 1-10
15	EE	Soumyakanti Chakraborty, Anup K. Sen, Amitava Bagchi: Revaluation of Bundles by Bidders in Combinatorial Auctions. HICSS 2009: 1-10
2008
14	EE	D. Anurag, Anup K. Sen: The Chronon Based Model for Temporal Databases. DASFAA 2008: 461-469
13	EE	Soumyakanti Chakraborty, Anup K. Sen, Amitava Bagchi: Bidder Valuation of Bundles in Combinatorial Auctions. HICSS 2008: 51
2004
12	EE	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
11		Anup K. Sen, Amitava Bagchi, Weixiong Zhang: An Average-Case Analysis of Graph Search. AAAI/IAAI 2002: 757-
2001
10	EE	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)
9		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
8		Sakib A. Mondal, Anup K. Sen: TCBB Scheme: Applications to Single Machine Job Sequencing Problems. AAAI/IAAI 2000: 792-797
1996
7	EE	Parthasarathi Dasgupta, Anup K. Sen, Subhas C. Nandy, Bhargab B. Bhattacharya: Geometric bipartitioning problem and its applications to VLSI. VLSI Design 1996: 400-405
6	EE	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)
1993
5		Anup K. Sen, Amitava Bagchi: Non-Order-Preserving Evaluation Functions: Recursive Graph-Search Methods for Job Sequencing Problems. IJCAI 1993: 1423-1429
1992
4		R. Ramaswamy, Anup K. Sen: Single Machine Scheduling as a Graph Search Problem with Path-Dependent Arc Costs. ECAI 1992: 11-15
1991
3		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
2		Anup K. Sen, Amitava Bagchi: Fast Recursive Formulations for Best-First Search That Allow Controlled Use of Memory. IJCAI 1989: 297-302
1986
1	EE	Amitava Bagchi, Anup K. Sen: Heuristic search in general tree structures: an average case analysis. ACM Conference on Computer Science 1986: 309-318

Coauthor Index

1	D. Anurag	[14]
2	Amitava Bagchi	[1] [2] [3] [5] [6] [11] [12] [13] [15] [16]
3	Bhargab B. Bhattacharya	[7] [9]
4	Soumyakanti Chakraborty	[13] [15] [16]
5	Parthasarathi Dasgupta (P. S. Dasgupta)	[7] [9]
6	Sakib A. Mondal	[8] [10]
7	Subhas C. Nandy	[7] [9]
8	R. Ramaswamy	[4]
9	Bani K. Sinha	[3]
10	Weixiong Zhang	[11] [12]

Colors in the list of coauthors