Back close

Dr. Debasis Dwibedy

Assistant Professor , School of Computing, Coimbatore

Qualification: B-Tech, M.Tech, Ph.D
d_debasis@cb.amrita.edu
Dr. Debasis Dwibedy's google scholar

Bio

Dr. Debasis Dwibedy is currently working as an Assistant Professor in the School of Computing at Amrita Vishwa Vidyapeetham, Coimbatore campus. He received his Ph.D. from Veer Surendra Sai University of Technology (VSSUT), Burla, Odisha. His Ph.D. thesis focuses on computational hardness, algorithmic competitiveness, and fairness in online and semi-online scheduling problems. He completed pre-conference school on algorithms and discrete mathematics at IIT, Kharagpur. Previously, he worked in various academic capacities at VSSUT, Burla, Odisha State Open University, Sambalpur, Odisha, and Maharishi Markandeswar University, Ambala, Haryana. He served as a domain expert in the design of automated task delegation in industrial project management software at Shivam Infosystems, New Delhi. His expertise includes problem formulation, feasibility studies, mathematical modeling, design, and analysis of algorithms.

His current research interests include emerging scheduling problems that arise in offline, online, and semi-online algorithmic frameworks. Specifically, the design of fair-competitive online scheduling algorithms in k-user and m-machine settings. In semi-online scheduling, he focuses on the look-ahead models, where an online algorithm knows the processing time of some future jobs. The following non-trivial research challenge motivates his current work in semi-online scheduling: how much improvement in competitiveness will be gained by considering Lookahead over online scheduling for practically-significant m-machine settings In data science, he is focusing on problems such as high-precision sentiment analysis with application-specific and user-centric recommendations, and applications of geospatial data analytics in healthcare.  In graph theory, he is interested in the design of improved competitive algorithms for online and semi-online rainbow coloring in topology-based graph classes. He has served as a Reviewer for Journals, such as. Omega, an International Journal of Management Science (Elsevier), Computer Science (AGH, Poland), and American Journal of Computer Science and Engineering (Science).  He is an active member of ACM, IEEE, IAENG, ACCS, ASR, SDIWC, EAI, and the European Operational Research Society’s project management and Scheduling research group.

He has published several peer-reviewed articles in highly reputed Journals and Conferences.

Publications

Journal Article

Year : 2023

Semi-online Scheduling with Lookahead

Cite this Research Publication : Debasis Dwibedy and Rakesh Mohanty. “Semi-online Scheduling with Lookahead”. arXiv:2306.06003 [cs.DS], 2023,Cornell University Library, USA

Publisher : Cornell University Library, USA

Year : 2023

A Note on Hardness of Multi-processor Scheduling with Scheduling Solution Space Tree

Cite this Research Publication : Debasis Dwibedy and Rakesh Mohanty. A Note on Hardness of Multi-processor Scheduling with Scheduling Solution Space Tree. Computer Science, vol. 24, no. 1, pp. 53-74, March 2023, AGH University of Science and Technology, Krakow, Poland. AGH University of Science and Technology Press, Krakow, Poland.

Publisher : AGH University of Science and Technology Press, Krakow, Poland

Year : 2022

Semi-online Scheduling: A Survey

Cite this Research Publication : Debasis Dwibedy and Rakesh Mohanty. Semi-online Scheduling: A Survey. Computers & Operations Research 139, 105646, 2022,Elsevier

Publisher : Elsevier

Year : 2022

Online List Scheduling for Makespan Minimization: A Review of the State-of-the-art Results, Research Challenges, and Open Problems

Cite this Research Publication : Debasis Dwibedy and Rakesh Mohanty. Online List Scheduling for Makespan Minimization: A Review of the State-of-the-art Results, Research Challenges, and Open Problems. ACM SIGACT News, vol. 53, no. 2, pp. 84-105, 2022.

Publisher : ACM

Year : 2021

New Competitive Semi-online Scheduling Algorithms for Small Number of Identical Machines

Cite this Research Publication : Debasis Dwibedy and Rakesh Mohanty. New Competitive Semi-online Scheduling Algorithms for Small Number of Identical Machines. arXiv:2106.04629 [cs.DS], 2021,Cornell University Library, USA

Publisher : Cornell University Library, USA

Year : 2015

Implementation of a Novel System for cross-platform communication of Diversified Applications over a Network

Cite this Research Publication : Debasis Dwibedy and Manish Kumar. Implementation of a Novel System for cross-platform communication of Diversified Applications over a Network. International Journal of Computer Applications, vol. 128, no. 9, 2015.

Publisher : Foundation of Computer Science, USA

Year : 2015

System Architecture and Data Flow in Applications for Cross-Platform Communication in a Secure Network

Cite this Research Publication : Debasis Dwibedy and Manish Kumar. System Architecture and Data Flow in Applications for Cross-Platform Communication in a Secure Network. International Journal of Computer Applications, vol. 130, no. 7, 2015,Foundation of Computer Science, USA

Publisher : Foundation of Computer Science, USA

Admissions Apply Now