Anup K. Sen

According to our database, Anup K. Sen authored at least 29 papers between 1986 and 2020.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2020

Designing information feedback for bidders in multi-item multi-unit combinatorial auctions.

Anup K. Sen, Amitava Bagchi, Soumyakanti Chakraborty

Decis. Support Syst., 2020

2015

Addressing the valuation problem in multi-round combinatorial auctions.

Soumyakanti Chakraborty, Anup K. Sen, Amitava Bagchi

Inf. Syst. Frontiers, 2015

2014

Experimenting with Proxy Agents in Online Combinatorial Auctions.

Soumyakanti Chakraborty, Anup Kumar Sen, Amitava Bagchi

Int. J. Intell. Inf. Technol., 2014

Application of graph search and genetic algorithms for the single machine scheduling problem with sequence-dependent setup times and quadratic penalty function of completion times.

Viswanathan Kodaganallur, Anup K. Sen, Subrata Mitra

Comput. Ind. Eng., 2014

Incremental solutions to online multi-unit combinatorial auctions for information feedback.

Sivaraman Ramanathan, Avinash Kasinathan, Anup K. Sen

Proceedings of the 2014 IEEE/ACM International Conference on Advances in Social Networks Analysis and Mining, 2014

2012

Providing Information Feedback to Bidders in Online Multi-unit Combinatorial Auctions.

Anup K. Sen, Amitava Bagchi

Proceedings of the 18th Americas Conference on Information Systems, 2012

2011

Semantic Notions of Weakly Correct AND/XOR Business Workflows Based on Partial Synchronization.

Akhil Kumar, Anup K. Sen, Meda H. Sundari, Amitava Bagchi

Proceedings of the IEEE International Conference on Services Computing, 2011

2010

On Detecting Data Flow Errors in Workflows.

Hema S. Meda, Anup K. Sen, Amitava Bagchi

ACM J. Data Inf. Qual., 2010

Greedy by Chance - Stochastic Greedy Algorithms.

Viswanathan Kodaganallur, Anup K. Sen

Proceedings of the Sixth International Conference on Autonomic and Autonomous Systems, 2010

2009

Designing Proxy Bidders for Online Combinatorial Auctions.

Soumyakanti Chakraborty, Anup K. Sen, Amitava Bagchi

Proceedings of the 42st Hawaii International International Conference on Systems Science (HICSS-42 2009), 2009

Revaluation of Bundles by Bidders in Combinatorial Auctions.

Soumyakanti Chakraborty, Anup K. Sen, Amitava Bagchi

Proceedings of the 42st Hawaii International International Conference on Systems Science (HICSS-42 2009), 2009

2008

Exploring local search in winner determination problem.

Raj Jog Singh, Anup K. Sen

Inf. Technol. Manag., 2008

Bidder Valuation of Bundles in Combinatorial Auctions.

Soumyakanti Chakraborty, Anup K. Sen, Amitava Bagchi

Proceedings of the 41st Hawaii International International Conference on Systems Science (HICSS-41 2008), 2008

The Chronon Based Model for Temporal Databases.

D. Anurag, Anup K. Sen

Proceedings of the Database Systems for Advanced Applications, 2008

2007

The representation, analysis and verification of business processes: a metagraph-based approach.

Arindam Mukherjee, Anup K. Sen, Amitava Bagchi

Inf. Technol. Manag., 2007

2004

Average-case analysis of best-first search in two representative directed acyclic graphs.

Anup K. Sen, Amitava Bagchi, Weixiong Zhang

Artif. Intell., 2004

2002

An Average-Case Analysis of Graph Search.

Anup K. Sen, Amitava Bagchi, Weixiong Zhang

Proceedings of the Eighteenth National Conference on Artificial Intelligence and Fourteenth Conference on Innovative Applications of Artificial Intelligence, July 28, 2002

2001

Searching networks with unrestricted edge costs.

Parthasarathi Dasgupta, Anup K. Sen, Subhas C. Nandy, Bhargab B. Bhattacharya

IEEE Trans. Syst. Man Cybern. Part A, 2001

Single machine weighted earliness-tardiness penalty problem with a common due date.

Sakib A. Mondal, Anup K. Sen

Comput. Oper. Res., 2001

2000

An improved precedence rule for single machine sequencing problems with quadratic penalty.

Sakib A. Mondal, Anup K. Sen

Eur. J. Oper. Res., 2000

TCBB Scheme: Applications to Single Machine Job Sequencing Problems.

Sakib A. Mondal, Anup K. Sen

Proceedings of the Seventeenth National Conference on Artificial Intelligence and Twelfth Conference on on Innovative Applications of Artificial Intelligence, July 30, 2000

1996

Searching graphs with A*: applications to job sequencing.

Anup K. Sen, Amitava Bagchi, Ramkumar Ramaswamy

IEEE Trans. Syst. Man Cybern. Part A, 1996

Graph Search Methods for Non-Order-Preserving Evaluation Functions: Applications to Job Sequencing Problems.

Anup K. Sen, Amitava Bagchi

Artif. Intell., 1996

Geometric bipartitioning problem and its applications to VLSI.

Parthasarathi Dasgupta, Anup K. Sen, Subhas C. Nandy, Bhargab B. Bhattacharya

Proceedings of the 9th International Conference on VLSI Design (VLSI Design 1996), 1996

1993

Non-Order-Preserving Evaluation Functions: Recursive Graph-Search Methods for Job Sequencing Problems.

Anup K. Sen, Amitava Bagchi

Proceedings of the 13th International Joint Conference on Artificial Intelligence. Chambéry, France, August 28, 1993

1992

Single Machine Scheduling as a Graph Search Problem with Path-Dependent Arc Costs.

R. Ramaswamy, Anup K. Sen

Proceedings of the 10th European Conference on Artificial Intelligence, 1992

1991

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

Proceedings of the 12th International Joint Conference on Artificial Intelligence. Sydney, 1991

1989

Fast Recursive Formulations for Best-First Search That Allow Controlled Use of Memory.

Anup K. Sen, Amitava Bagchi

Proceedings of the 11th International Joint Conference on Artificial Intelligence. Detroit, 1989

1986

Heuristic search in general tree structures: an average case analysis.

Amitava Bagchi, Anup K. Sen

Proceedings of the 14th ACM Annual Conference on Computer Science, 1986