**Dissertation/Thesis (Completed and in Progress)**

Doctor of Philosophy

- Dr. Shree Ram Khadka, Central Department of Mathematics, TU, Nepal, Mixed-Model Just-in-Time Sequencing Problem (January 27, 2012).
- Dr. Gyan Bahadur Thapa, Institute of Engineering, TU, Nepal (Characterizations of Just-in Time Sequencing Problems with Apportionment and Supply Chain (December 28, 2013).
- Dr. Urmila Pyakurel, Central Department of Mathematics, TU, Nepal (Evacuation Planning Problem with Contraflow Approach) (March 4, 2016).
- Dr. Ram Chandra Dhungana, Central Department of Mathematics, TU, Nepal (Efficient Dynamic Flow Algorithms for Evacuation Planning) (March 23, 2021).
- Dr. Iswar Mani Adhikari, Central Department of Mathematics, TU, Nepal (Evacuation Optimization with Minimum Clearance Time) (March 19, 2021).
- Mr. Hari Nandan Nath,Central Department of Mathematics, TU, Nepal (Optimization Models and Algorithms for Evacuation Planning) (in progress).
- (with Dr. Urmila Pyakurel) Mr. Shiva Prasad Gupta, Central Department of Mathematics, TU, Nepal (Models and Algorithms for Flow Over Time Problems) (in progress, since 2017).
- (with Dr. Urmila Pyakurel) Durga Prasad Khanal, Central Department of Mathematics, TU, Nepal (Continuous Dynamic Flow with Flow Dependent Transit Times, in progress, since 2019).
- Badri Pangeni, Central Department of Mathematics, TU, Nepal (Continuous Dynamic Flow Problems with Intermediate Storage, in progress, since 2020).
- Mohan Adhikari (with Urmila Pyakurel), Central Department of Mathematics, TU, Nepal (Discrete Time Dynamic Flow Problems with Intermediate Storage, since 2021).

Master of Philosophy

- Shiva Prakash Gupta, Central Department of Mathematics, TU, Nepal, Earliest Arrival of Evacuees with Contraflow Approach (March, 2016).
- Durga Prasad Khanal (with Dr. Urmila Pyakurel), Central Department of Mathematics, TU, Nepal (Dynamic Flow with Inflow-dependent Transit Times, February 2019).
- Anjana Devi Bhandari, Central Department of Mathematics, TU, Nepal (Quickest Flow Problem and Its Application, January, 2020).
- Santosh Gautam (with Dr. Urmila Pyakurel), Central Department of Mathematics, TU, Nepal (Dynamic Flow on Lossy Network, submitted).
- Madan Bahadur Chand, Central Department of Mathematics, TU, Nepal (Continuous-time Dynamic Flow Problems, in progress).
- Tirtha Bhandari, Central Department of Mathematics, TU, Nepal (Dynamic Shortest Path Problem with Time Windows, in progress, since 2020).
- Meena Machamasi, Central Department of Mathematics, TU, Nepal (A study of A* algorithm in FIFO networks, in progress, since 2020).
- Deepak Amagain, Central Department of Mathematics, TU, Nepal (Quickest flow problem with time dependent attributes, in progress, since 2020).

Master's Thesis

- Tej Prasad Adhikari (in progress), Discrete Facility Location Analysis.
- Binita Bhatta (in progress), Maximum Flow Problem on Dynamic Network.
- Komal Raj Joshi (CDM, 2014), Contraflow Optimization for Evacuation Planning.
- Ajit Poudel (CDM, 2014), Earliest Arrival Flows in Discrete Dynamic Network.
- Sanat Kumar Acharya (CDM, 2014), Earliest Arrival Flows in Dynamic Network.
- Ram Chandra Dhaungana (CDM 2014), Efficient Algorithm on Universally Maximum Contraflow.
- JnaneshwarChalise (CDM, 2014), A Study of Earliest Arrival Flow on Series Parallel Graphs
- Rajendra Joshi (CDCSIT, 2013), Metaheuristic solutions to the Response Time Variability Problem.
- Rabi K.C. (CDM, 2013), Integrated Scheduling Location Problems with Makespan Objectives.
- Prava Shrestha (CDM, 2013), Integrated Scheduling Location Problem with Sum Objectives.
- Min Bd. Rana (with S.R. Khadka) (CDM, 2012), Evacuation Planning and Contraflow Network.
- R.K. Dahal (CDCSIT, 2012), Performance Analysis of Hash Message Digests SHA-2 and SHA-3 Finalists.
- Tej Bd. Shahi (CDCSIT, 2012), Support Vector Machine Based Part of Speech Tagging for Nepali Text.
- Bal Krishna Subedi (CDCSIT, 2012), Minimizing the Evacuation Time of Traffic Management Systems Using Simulated Annealing Algorithm.
- Nanda Kishor Roy (CDCSIT, 2012), Improved Multi-Start Method for Solving the Response Time Variability Problem.
- Prem Prasai (CDM, 2012), On the Stability Analysis of Open Shop Sequences with Bounded Processing Times.
- J. Joshi (CDCSIT, 2012), Heuristic Solution to Single Machine Scheduling Problem to Minimize Total Completion Time.
- Narendra Bohara (CDCSIT, 2012), Implementing Key Establishment Protocol for Secure System.
- Paneru (CDCSIT, 2011), Symmetric encryption algorithm using code reuse technique for authentication based on Needham Schoeders protocol.
- L. Joshi (CDCSIT, 2010), A computational analysis of balanced sequences for JIT optimization problems.
- Puja Bhatt (CDCSIT, 2010), Scheduling jobs on a single machine to minimize the number of tardy jobs with release with time constraints.
- R.P. Bhusal (CDM, 2010), Irreducibility of open shop scheduling problems.
- Deepak Babu Amgain (CDM, 2010), On the structural analysis of shop scheduling problems: algebraic characterizations and potential optimality.
- M. Bdr. Khadka (CDCSIT, 2009), An efficient algorithm for mixed model just-in-time production system with chain constraints.
- T. Pd. Paneru (CDM, 2009), Sequencing approaches to the product rate variation problem.
- P. Bhatta (CDCSIT, 2009), On the cyclic sequences in mixed model JIT production system.
- B. Pandey (CDCSIT, 2009), Cyclic sequences for min-max objective in mixed model JIT production system.
- N.Regmi (CDCSIT, 2008), Evaluating heuristic solutions for NP-hard single machine scheduling problems.
- D. Pandey (CDCSIT, 2008), On the solvability and implementation of mixed model JIT production system.
- C.M. Poudyal (CDM, 2008), Bottleneck just-in-time sequencing for mixed-model production systems.
- D. Poudyal (CDM, 2008), Open shop scheduling problems with unit processing times.
- M. Joshi (CDM, 2008), Open shop scheduling problems with arbitrary processing times.
- U. Pyakurel (CDM, 2008), On the solvability of open shop scheduling problems.
- Y.R. Pant (CDM, 2008), On the relations between the optimal solutions of product rate variation problem with different objectives.
- B. Gautam (CDCSIT, 2004), Complexity analysis of open shop scheduling problems.
- Mulepati (CDCSIT, 2004), Computational complexity analysis of job shop scheduling problems.