Department: Management Information Systems

Email am@iimcal.ac.in Contact Details Indian Institute of Management Calcutta Joka, D. H. Road Kolkata 700104 Phone Number +91 92316 85403, +913324619917

Academic Background
M.Sc. (Statistics), University of Calcutta, Post-Graduate Diploma (Computer Science), Indian Statistical Institute Calcutta, Post-Graduate Diploma (Operations Research), O.R.S.I. Calcutta, D.Sc.(Computer Science), University of Calcutta

Courses Taught
Currently Teaching:

* Artificial Intelligence
* Business Intelligence

Have taught many Computer Science and MIS Courses.

Awards
Doctor of Science (D.Sc.)in Computer Science
Doctoral Theses Guidance:
Subrata Ghosh, University of Maryland, College Park, USA, (Co-guide: Dana S. Nau).
Thesis Title: Heuristic Search with Limited Resources
(Xerox Corporation, USA)

Krishna Ray, Jadavpur University, Calcutta, (Co-guide: Mohit Roy).
Thesis Title: Design and Analysis of Heuristic Search Algorithms for Networks
(Director, DOEACC, Jadavpur University Campus, Kolkata)

Supriyo Ghosh, IIM Calcutta.
Thesis Title: Best-First Search Algorithms for AND/OR Graphs with Cycles.
(Ex-Visiting Faculty of IIM Calcutta, Currently with Satyam Computers, USA)

Swarup Mandal, IIM Calcutta, (Co-guide: Debasish Saha)
Thesis Title: Radio Resource Management in Mobile Cellular Networks
(Ex-Faculty, XLRI, Jamshedpur, Currently with Wipro, Kolkata)

Rajanish Das, IIM Calcutta.
Thesis Title: Efficient Techniques for Real–Time Frequent Pattern Mining
in Business Applications
(MIS Faculty, IIM Ahmedabad)

Sethuraman J., IIM Calcutta, (Co-guide: Debasish Saha)
Thesis Title: Resource Management in WDM Optical Networks
(Inductis Corporation, New Delhi)

Arunabha Mukhopadhyay, IIM Calcutta, (Co-guide: Debasish Saha)
Thesis Title: A Novel Framework for Mitigating E-Risk through Insurance
(MIS Faculty, IIM Luknow)

Sinnakkrishnan Perumal, IIM Calcutta (thesis submitted)
Thesis Title: Verifying Workflow Graph for Structural Conflicts using
Graph Search Techniques
(Tech Mahindra, Pune)

Samir Sadhukhan, (thesis to be submitted to the Jadavpur University)
Thesis Topic: Bidirectional Heuristic Search and Applications
(Senior Systems Analyst, IIM Calcutta)

Sanjog Ray, IIM Calcutta (Currently working)
Thesis Topic: Heuristically Guided Recommender Systems
(FP Student, IIM Calcutta)

Publications
Ray, S., Mahanti, A. 2009. “Filler Item Strategies for Shilling Attacks against Recommender Systems”, 42nd Hawaii International Conference on Systems Science, Hawaii, U.S.

Mireault, P., Ray, S., Mahanti, A. 2008. “Categorizing User Interests in Recommender Systems”, 3rd International Symposium of Information Systems, Hyderabad, India.

Ray, S., Mahanti, A. 2008. “Strategies for Effective Shilling Attacks against Recommender Systems”, 2nd ACM SIGKDD International Workshop on Privacy, Security, and Trust in KDD, Las Vegas, LNCS 5456, Springer, pp. 111-125.

Ray, S., Mahanti, A. 2008. “Filler Item Strategies for Effective Shilling Attacks”, 18th European Conference of Artificial Intelligence - Workshop on Recommender systems, Pratas, Greece.

Sanjog Ray and Ambuj Mahanti
Weighted Class based Hybrid Algorithm for Top-N Recommender Systems
Artificial Intelligence and Applications (AIA), Innsbruck, Austria, 2008

Ambuj Mahanti and Sinnakkrishnan Perumal
Workflow Graph Verification Using Graph Search Techniques
Working Paper Series-621, IIM Calcutta, February 2008

Ambuj Mahanti and Sinnakkrishnan Perumal
Acyclic Workflow Graph Verification Using Graph Search Techniques
Submitted to a journal, February 2008

Sinnakkrishnan Perumal and Ambuj Mahanti
Formal Foundation of Workflow Hyperpaths and a Graph Search
Algorithm for Workflow Hyperpath Generation, presented in Hawaii International Conference On System Sciences held in Waikaloa, Hawaii, USA during January 2008.

Arunabha Mukhopadhyay, Samir Chatterjee, Debashis Saha, Ambuj Mahanti, Samir K. Sadhukhan
E- risk management through insurance, Social and Human Elements of Information Security: Emerging Trends and Countermeasures, Idea Group Publishing, Information Science Publishing, IRM Press, CyberTech Publishing and Idea Group Reference imprints, USA, (Forthcoming 2008).

Sinnakkrishnan Perumal and Ambuj Mahanti
MSCWV: Cyclic Workflow Verification Algorithm for Workflow Graphs
Published in "2007 BPM and Workflow Handbook", by Future Strategies Inc., in association with Workflow Management Coalition.

Sinnakkrishnan Perumal and Ambuj Mahanti
Applying Graph Search Techniques for Workflow Verification
Presented in Hawaii International Conference On System Sciences held in Waikaloa, Hawaii, USA during January 2007.

Arunabha Mukhopadhyay, Samir Chatterjee, Debashis Saha, Ambuj Mahanti, Samir K. Sadhukhan
Tiered approach for mitigating big security losses: A variance reduction model, Proceedings of the Americas Conference on Information System (AMCIS) 2007, Colarado, August 9-12, 2007.

Arunabha Mukhopadhyay, Binay Bhushan, Debashis Saha, Ambuj Mahanti
E-Risk Management through Self Insurance: An Option Model. HICSS 2007: 158

Arunabha Mukhopadhyay, Samir Chatterjee, Rahul Roy, Debashis Saha, Ambuj Mahanti, Samir K. Sadhukhan
Insuring Big Losses Due to Security Breaches through Insurance: A Business Model. HICSS 2007: 158

Sinnakkrishnan Perumal and Ambuj Mahanti
Applying Graph Search Techniques for Workflow Verification. HICSS 2007: 48

Sethuraman Janardhanan, Ambuj Mahanti, Debashis Saha, Samir K. Sadhukhan
BDFS: A Real-Time Search Algorithm for Central Office (CO) Optimization.
HICSS 2007: 48

Sethuraman J, Ambuj Mahanti and Debashis Saha
An Optimal Uninformed Best First Search Based Wavelength Assignment Algorithm to Minimize the Number of SONET ADMs in WDM Rings , Telecommunications Planning:Innovations in Pricing,Network Design and Management,Eds: Dr.G. Anandalingam & Dr.S. Raghavan,Springer (formerly KAP),2006.

Sethuraman Janardhanan, Ambuj Mahanti, Debashis Saha, Samir K. Sadhukhan
A Routing and Wavelength Assignment (RWA) Technique to Minimize the Number of SONET ADMs in WDM Rings. HICSS 2006

Rajanish Dass and Ambuj Mahanti
An Efficient Algorithm for Real-Time Frequent Pattern Mining for Real-Time Business Intelligence Analytics. HICSS 2006

Rajanish Dass and Ambuj Mahanti
An Efficient Heuristic Search for Real-Time Frequent Pattern Mining. HICSS 2006

Arunabha Mukhopadhyay, Samir Chatterjee, Debashis Saha, Ambuj Mahanti, Samir K. Sadhukhan
e-Risk Management with Insurance: A Framework Using Copula Aided Bayesian Belief Networks. HICSS 2006

Sinnakkrishnan Perumal and Ambuj Mahanti
Working Paper Series-599, IIM Calcutta, December 2006
Cyclic Workflow Verification Algorithm for Workflow Graphs

Ambuj Mahanti and Sinnakkrishnan Perumal
Working Paper Series-539, IIM Calcutta, February 2005
A Simple Graph-based Technique for Workflow Verification

Arunabha Mukhopadhyay, Debashis Saha, Ambuj Mahanti, Binay Bhusan Chakraborty, A K Poddar
Insurance for cyber-risk: A Utility Model, Decision, Vol 32, No 1, 153-170, June 2005

Arunabha Mukhopadhyay, Samir Chatterjee, Debashis Saha, Ambuj Mahanti, A. K. Poddar
e-risk:A case for insurance, Proceedings of the Conference on Information Systems and Technology Management (CISTM), New Delhi, July 23-26, 2005.

Arunabha Mukhopadhyay, Samir Chatterjee, Debashis Saha, Ambuj Mahanti, Binay Bhusan Chakraborty, A. K. Poddar
Mitigating Security breach losses in e-commerce through Insurance, Proceedings of 4th Security Conference, Las Vegas, Nevada, March 30-31, 2005.

Arunabha Mukhopadhyay, Debashis Saha, Ambuj Mahanti, Binay Bhusan Chakraborty, A. K. Poddar
E-risk Mitigation a case for Insurance, WPS-537, January 2005, (IIM Calcutta).

Arunabha Mukhopadhyay, Debashis Saha, Ambuj Mahanti, A. K. Poddar,
Binay Bhusan Chakraborty,
Mitigating Security Breach Losses in e-commerce through Insurance, WPS-538, January 2005 (IIM Calcutta).

Arunabha Mukhopadhyay, Debashis Saha, Ambuj Mahanti, Binay Bhusan Chakraborty, A. K. Poddar
Mitigating e-risk through Insurance, WPS-524, October 2004 (IIM Calcutta).

Rajanish Dass, Ambuj Mahanti: Fast Frequent Pattern Mining in Real-Time
COMAD 2005: 156-167

Sethuraman Janardhanan, Ambuj Mahanti, Debashis Saha
A heuristic search based optimal wavelength assignment algorithm to minimize the number of sonet ADMS in WDM rings. Communications and Computer Networks 2005: 152-157.

Sinnakkrishnan Perumal, Ambuj Mahanti
"A Simple and Efficient Algorithm for Verifying Workflow Graphs"
Published in "Workflow Handbook 2005", by Future Strategies Inc., in association with Workflow Management Coalition.
.
Sinnakkrishnan Perumal, Ambuj Mahanti
A Graph-Search Based Algorithm for Verifying Workflow Graphs, presented in International Workshop on Business Process Monitoring & Performance Management held in Copenhagen, Denmark during August 2005: 992-996

Rajanish Dass, Ambuj Mahanti
h1-max: A Domain Independent Heuristic for Real-Time Frequent Pattern Mining, in the proceedings of 12th. International Conference on Management of Data. (COMAD 2005b), CSI, December 20-22 2005, Hyderabad, India.
Rajanish Dass, Ambuj Mahanti
An Efficient Technique for Frequent Pattern Mining in Real-Time Business Applications. HICSS 2005

Rajanish Dass, Ambuj Mahanti
An Efficient Real-Time Frequent Pattern Mining Technique Using Diff-Sets. International Conference on Computational Science (3) 2005: 818-821

Rajanish Dass, Ambuj Mahanti
Implementing BDFS(b) with Diff-Sets for Real-Time Frequent Pattern Mining in Dense Datasets - First Findings. UDM 2005: 113-120

Rajanish Dass, Ambuj Mahanti
Frequent Pattern Mining in Real-Time - First Results, in proceedings of TDM 2004/ACM SIGKDD 2004, Seattle, WA, August 22-25, 2004.


S. Mandal, D. Saha, and A. Mahanti, “Heuristic Search Techniques for Cell to Switch Assignment in Location Area Planning for Cellular Networks”, to be published in proc. IEEE ICC’04, Dec.2004

Merlin Nandy, Ambuj Mahanti
An Improved Search Technique for Optimal Winner Determination in Combinatorial Auctions. HICSS 2004

Swarup Mandal, Debashis Saha, Ambuj Mahanti
A real-time heuristic search technique for fixed channel allocation (FCA) in mobile cellular communications. Microprocessors and Microsystems 28(8): 411-416 (2004)

Merlin Nandy, Ambuj Mahanti
An Efficient Search Technique Using A Lower Bound Heuristic For Maximal Revenue Determination in Combinatorial Auctions. IICAI 2003: 914-927

Swarup Mandal, Debashis Saha, Ambuj Mahanti
A Real-time Search Technique for Fixed Channel Allocation in Cellular Mobile Communications. IICAI 2003: 966-979

Swarup Mandal, Debashis Saha, Sougata Bera, Shubhadip Ray, Ambuj Mahanti
An Efficient Technique for Dynamic Lightpath Establishment in Survivable Local/Metro WDM Optical Networks. IWDC 2003: 350-360

Ambuj Mahanti, Supriyo Ghose, Samir K. Sadhukhan
A Framework for Searching AND/OR Graphs with Cycles CoRR cs.AI/0305001: (2003)
A. Mahanti, S. Mandal, and D. Saha, “A Real-time Search Technique for Fixed Channel Allocation in Cellular Mobile Communications”, Proc. CIT’2003, Dec., 2003, pp 205-210
S. Mandal, D. Saha, and A. Mahanti, “An Optimal Real-time Technique for Cell to Switch Assignment in Location Area Planning for Cellular Networks”, IIMCAL, WPS-476/2003, July, 2003
S. Mandal, D. Saha, and A. Mahanti, “An Efficient Heuristic Technique for Fixed Channel Allocation in Cellular Mobile Networks”, IIMCAL, WPS-473/2003, July 2003
S. Mandal, D. Saha, and A. Mahanti, “A Heuristic Search for Generalized Cellular Network Planning”, Proc. IEEE ICPWC’02, Dec. 2002

Ambuj Mahanti, Subrata Ghosh, Dana S. Nau, Asim K. Pal, Laveen N. Kanal
On the Asymptotic Performance of IDA*, Annals of Mathematics Artificial Intelligence 20(1-4): 161-193 (1997)

Subrata Ghosh, Ambuj Mahanti, Rakesh Nagi and Dana S. Nau
Manufacturing Cell Formation by State-Space Search
Annals of Operations Research, Springer Netherlands, Volume 65, Number 1, August, 1996

Matthew P. Evett, James A. Hendler, Ambuj Mahanti, Dana S. Nau
PRA*: Massively Parallel Heuristic Search. J. Parallel Distrib. Comput. 25(2): 133-143 (1995)
Subrata Ghosh, Ambuj Mahanti, Dana S. Nau
ITS: An Efficient Limited-Memory Heuristic Tree Search Algorithm. AAAI 1994: 1353-1358

Ambuj Mahanti, Charles J. Daniels
A SIMD Approach to Parallel Heuristic Search. Artif. Intell. 60(2): 243-282 (1993)

Ambuj Mahanti, Subrata Ghosh, Dana S. Nau, Asim K. Pal, Laveen N. Kanal Performance of IDA on Trees and Graphs, AAAI 1992: 539-544

Ambuj Mahanti, Charles J. Daniels
IDPS: A Massively Parallel Heuristic Search Algorithm. IPPS 1992: 220-223

Ambuj Mahanti, Raghu Karinthi, Subrata Ghosh and Asim Kumar Pal
AI Search for Minimum-Cost Set Cover and Multiple-Goal Plan Optimization Problems: Applications to Manufacturing, Planning and Scheduling. Proceedings of the Fourth International Conference on Industrial and Engineering Applications of Artificial Intelligence and Expert Systems (IEA/AIE-91). Kauai, Hawaii, June 2-5, 1991.

Ambuj Mahanti and Subrata Ghosh
Controlled Best-First Search for Near Optimal Solutions, Proceedings of the ACM and IEEE-CS Symposium on Applied Computing, Kansas City, April 1991.

Ambuj Mahanti, Asim Kumar Pal, Subrata Ghosh, Laveen N. Kanal and Dana S. Nau
Performance of A* and IDA* - A Worst-Case Analysis, Proceedings of the ACM and IEEE-CS Symposium on Applied Computing, Kansas City , April 1991.

Ambuj Mahanti, Charles Daniels, Subrata Ghosh, Mathew Evett and Asim K. Pal
Massively Parallel Search for Approximate Optimization Problems, 6th Distributed Memory Computing Conference, OACIS and University of Michigan, 1991.

Ambuj Mahanti and Charles Daniels
Massively Parallel Heuristic Search, IJCAI Parallel Processing Workshop in AI (PPAI91), Sydney, Australia, August 1991.

Subrata Ghosh and Ambuj Mahanti
Bidirectional Heuristic Search with Limited Resources. Information Processing Letters 40(6): 335-340 (1991)

Mathew Evett, James Handler, Ambuj Mahanti, and Dana S. Nau
PRA*: A Memory-Limited Heuristic Search Procedure for the Connection Machine. Proceedings of the IEEE Conference Frontiers of Massively Parallel Computation, University of Maryland at College Park (UMCP), October 1990.

Subrata Ghosh and Ambuj Mahanti
A New Bi-directional Inadmissible Heuristic Search Algorithm. Proceedings of the Knowledge Based Computer Systems (KBCS-90), Pune, India, December 1990.

Ambuj Mahanti and Asim Kumar Pal
Worst-Case Time Complexity of IDA*, Proceedings of the 10th International Conference in Computer Science, Santiago de Chile, July 1990, pp. 35-45.

Ambuj Mahanti and Subrata Ghosh
Best-First Search with Controlled Time and Storage, Technical Report UMIACS-TR-90-108 & CS-TR-2519, August 1990, 23p.

Ambuj Mahanti, Asim K. al, Subrata hosh, Laveen N. Kanal and Dana S. Nau
Performance of A* and IDA* - Worst-Case Analysis, Technical Report UMIACS-TR-90-107 & CS-TR-2518, UMCP, August 1990, 13p.

Ambuj Mahanti, Asim K. al, and Larry S. Davis
Performance of A* Under Inadmissible Heuristics – A Probabilistic Analysis, Technical Report UMIACS – TR – 90 – 114 & C-TR-2526, UMCP, August 1990, 12p.

Ambuj Mahanti, Raghu Karinthi, Subrata Ghosh and Asim Kumar Pal
AI Search for Minmum Cost Set Cover and Multiple-Goal Plan Optimization Problems: Applications to Process Planning, Technical Report UMIACS-TR-125&CS-TR-2540, UMCP, September 1990, 26p.

Ambuj Mahanti and Asim Kumar Pal
Search with Limited Horizon, UMCP Technical Report, 1990

Ambuj Mahanti, Subrata Ghosh and Asim K. Pal
BDFS: A New Real-Time and Admissible Search Algorithm for Networks, UMCP Technical Report, 1990

Ambuj Mahanti and Krishna Ray
Network Search with Inadmissible Heuristics. KBCS 1989: 441-450, Ed. By S. Ramani, R. Chandrashekhar, and K.S.R. Anjaneyulu, Narosa Publishing, India.

Ambuj Mahanti and Krishna Ray
A New Algorithm for Searching Networks with Loops, Proceedings of IASTED Conference, Switzerland, 1989.

Ambuj Mahanti and Krishna Ray
Network Search Algorithms with Modifiable Heuristics, Search in AI, Synbolic Computation, Springer Verlag, Ed. By L. Kanal and V. Kumar, 1988 pp. 200-222.

Ambuj Mahanti and Krishna Ray
Heuristic search in networks with modifiable estimate. ACM Conference on Computer Science 1987: 166-174

Amitava Bagchi and Ambuj Mahanti
Three Approaches to Heuristic Search in Networks J. ACM 32(1): 1-27 (1985)

Ambuj Mahanti and Amitava Bagchi
AND/OR Graph Heuristic Search Methods J. ACM 32(1): 28-51 (1985)

Amitava Bagchi and Ambuj Mahanti
Search Algorithms Under Different Kinds of Heuristics-A Comparative Study J. ACM 30(1): 1-21 (1983)


Amitava Bagchi and Ambuj Mahanti
Admissible Heuristic Search in And/Or Graphs. Theoretical Computer Science, July 1983, Vol. 24, No. 2, 207-219 (1983)

Ambuj Mahanti
Aspects of Heuristic Search in Networks and AND/OR Graphs, D.Sc. Thesis, University of Calcutta, 1983, 220p.

Amitava Bagchi, Ambuj Mahanti
Admissible Heuristic Search in And/Or Graphs, Proceedings of the Foundations in Software Technology and Theoretical Computer Science (FST & TCS – 82), Bangalore, India, December 1982.

Consulting Interests
Some of the companies consulted:
* Indian Oil Corporation (IOC)
* Hindustan Copper Limited (HCL)
* Hindustan Paper Corporation
* Royal Norwegian Embassy, New Delhi
* Tea Board of India
* Andrew Yule Ltd

Research Interests
Workflow Management, Data Mining, Combinatorial Auctions, Recommendation Systems, Artificial Intelligence, Network Optimization, Business Intelligence.

Work Experience
-- Senior Programmer (August 1978 to February 1981) at National Informatics Centre, Kolkata.
-- Research Fellow (Lecturer)(MIS) at Indian Institute of Management Calcutta (IIMC) (February 1981 - November 1983).
-- Assistant Professor at IIMC from November 1983.
-- Associate Project Co-ordinator, CAM Project, IIMC from 1984 to 1988.
-- Visited UCLA, USA, as a United Nation's Fellow in 1985.
-- Represented India in Asian Productivity Council in 1989.
-- Visited University of Maryland at College as a United Nation's Fellow in 1989.

-- Visiting Faculty at University of Maryland College Park from January 1990 to September 1992.

-- Worked as Dean (Planning and Administration), IIM Calcutta during 2005-2007.
-- Working as Professor, MIS at IIMC since 1990.