| Modified Vertex Support Algorithm: A New approach for approximation of Minimum vertex cover K Imran, K Hasham Research Journal of Computer and Information Technology Sciences ISSN 2320, 6527, 2013 | 17 | 2013 |
| Collision-free allocation of temporally constrained tasks in multi-robot systems M D’Emidio, I Khan Robotics and Autonomous Systems 119, 151-172, 2019 | 15 | 2019 |
| Experimental comparison of five approximation algorithms for minimum vertex cover I Khan, S Khan International Journal of u-and e-Service, Science and Technology 7 (6), 69-84, 2014 | 10 | 2014 |
| Dynamic public transit labeling M D’Emidio, I Khan International Conference on Computational Science and Its Applications, 103-117, 2019 | 8 | 2019 |
| AVSA, modified vertex support algorithm for approximation of MVC I Ahmad, M Khan International Journal of Advanced Science and Technology 67, 71-78, 2014 | 8 | 2014 |
| Multi-robot Task Allocation Problem: Current Trends and New Ideas. M D'Emidio, I Khan ICTCS/CILC, 99-103, 2017 | 6 | 2017 |
| Single level drill down interactive visualization technique for descriptive data mining results M Khan, F Hussain, I Khan International Journal of Grid and Distributed Computing 7 (4), 33-40, 2014 | 6 | 2014 |
| Degree Contribution Algorithm for Approximation of MVC Imran khan, Hasham khan International Journal of Hybrid Information Technology 7 (5), 183-190, 2014 | 3 | 2014 |
| A new and fast approximation algorithm for vertex cover using a maximum independent set (VCUMI) I Khan, N Riaz Operations Research and Decisions 25 (4), 5--18, 2015 | 2 | 2015 |
| Journey planning algorithms for massive delay-prone transit networks M D’Emidio, I Khan, D Frigioni Algorithms 13 (1), 2, 2019 | 1 | 2019 |
| Joint Order Selection, Allocation, Batching and Picking for Large Scale Warehouses I Khan, O Maurer, J Pätzold, P Pszona, JD Salchow arXiv preprint arXiv:2401.04563, 2024 | | 2024 |
Naveed RiazAssistant Professor, College of Computer Science and Information Technology, Univesity of DammamVerified email at seecs.edu.pk
