default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDAnup K. Sen
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
Journal Articles
- 2020
[j13]Anup K. Sen, Amitava Bagchi, Soumyakanti Chakraborty:
Designing information feedback for bidders in multi-item multi-unit combinatorial auctions. Decis. Support Syst. 130: 113230 (2020)- 2015
- [j12]Soumyakanti Chakraborty, Anup K. Sen, Amitava Bagchi:
Addressing the valuation problem in multi-round combinatorial auctions. Inf. Syst. Frontiers 17(5): 1145-1160 (2015) - 2014
- [j11]Viswanathan Kodaganallur, Anup K. Sen, Subrata Mitra:
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. Comput. Ind. Eng. 67: 10-19 (2014) - [j10]Soumyakanti Chakraborty, Anup Kumar Sen, Amitava Bagchi:
Experimenting with Proxy Agents in Online Combinatorial Auctions. Int. J. Intell. Inf. Technol. 10(2): 56-75 (2014) - 2010
- [j9]Hema S. Meda, Anup K. Sen, Amitava Bagchi:
On Detecting Data Flow Errors in Workflows. ACM J. Data Inf. Qual. 2(1): 4:1-4:31 (2010) - 2008
- [j8]Raj Jog Singh, Anup K. Sen:
Exploring local search in winner determination problem. Inf. Technol. Manag. 9(2): 105-119 (2008) - 2007
- [j7]Arindam Mukherjee, Anup K. Sen, Amitava Bagchi:
The representation, analysis and verification of business processes: a metagraph-based approach. Inf. Technol. Manag. 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) - 2001
- [j5]Sakib A. Mondal, Anup K. Sen:
Single machine weighted earliness-tardiness penalty problem with a common due date. Comput. Oper. Res. 28(7): 649-669 (2001) - [j4]Parthasarathi Dasgupta, Anup K. Sen, Subhas C. Nandy, Bhargab B. Bhattacharya:
Searching networks with unrestricted edge costs. IEEE Trans. Syst. Man Cybern. 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. Eur. J. Oper. Res. 125(2): 425-428 (2000) - 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 Trans. Syst. Man Cybern. Part A 26(1): 168-173 (1996)
Conference and Workshop Papers
- 2014
- [c16]Sivaraman Ramanathan, Avinash Kasinathan, Anup K. Sen:
Incremental solutions to online multi-unit combinatorial auctions for information feedback. ASONAM 2014: 882-889 - 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
- [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
- [c10]D. Anurag, Anup K. Sen:
The Chronon Based Model for Temporal Databases. DASFAA 2008: 461-469 - [c9]Soumyakanti Chakraborty, Anup K. Sen, Amitava Bagchi:
Bidder Valuation of Bundles in Combinatorial Auctions. HICSS 2008: 51 - 2002
- [c8]Anup K. Sen, Amitava Bagchi, Weixiong Zhang:
An Average-Case Analysis of Graph Search. AAAI/IAAI 2002: 757-763 - 2000
- [c7]Sakib A. Mondal, Anup K. Sen:
TCBB Scheme: Applications to Single Machine Job Sequencing Problems. AAAI/IAAI 2000: 792-797 - 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
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2025-01-21 00:12 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
