(C = Conference, J = Journal, M = Manuscript, P = Preprint, R = Research Monograph, T = Technical Report)

[27T] Tejas Nareddy and Abhishek Mishra. “Recovery reductions, conjectures, and barriers.” Electronic Colloquium on Computational Complexity, report no. 157, 2025.
DOI / Link: https://eccc.weizmann.ac.il/report/2025/157/

[26R] Abhishek Mishra. Special Integrals. University Texts in the Mathematical Sciences. Springer Nature Singapore, 2025.
DOI / Link: https://doi.org/10.1007/978-981-97-7514-9

[25P] Tejas Nareddy and Abhishek Mishra. “New techniques for constructing rare-case hard functions.” arXiv:2411.09597v2 [cs.CC], 2025.
DOI / Link: https://doi.org/10.48550/arXiv.2411.09597

[24P] Ravi Kant, Sarthak Agarwal, Aakash Gupta, and Abhishek Mishra. “Exploring the performance of genetic algorithm and variable neighborhood search for solving the single depot multiple set orienteering problem: A comparative study.” arXiv:2411.12300 [math.OC], 2024.
DOI / Link: https://doi.org/10.48550/arXiv.2411.12300

[23P] Tejas Nareddy and Abhishek Mishra. “Hardness amplification via group theory.” arXiv:2411.09619 [cs.CC], 2024.
DOI / Link: https://doi.org/10.48550/arXiv.2411.09619

[22P] Ravi Kant, Salmaan Shahid, Anuvind Bhat, and Abhishek Mishra. “Variable neighborhood search for the multi-depot multiple set orienteering problem.” arXiv:2408.08922 [math.OC], 2024.
DOI / Link: https://doi.org/10.48550/arXiv.2408.08922

[21C] Ravi Kant and Abhishek Mishra. “The multi-depot multiple set orienteering problem: An integer linear programming formulation.” In Proceedings of the 13th International Conference on Operations Research and Enterprise Systems (ICORES), pages 350–355, 2024.
DOI / Link: https://www.scitepress.org/Papers/2024/124205/124205.pdf

[20C] Ravi Kant and Abhishek Mishra. “A compact formulation for the mDmSOP: Theoretical and computational time analysis.” In Proceedings of the 11th International Conference on Frontiers of Intelligent Computing: Theory and Applications (FICTA), pages 115–124, 2023.
DOI / Link: https://link.springer.com/chapter/10.1007/978-981-99-6702-5_9

[19C] Ravi Kant, Abhishek Mishra, and Siddharth Sharma. “The single depot multiple set orienteering problem.” In Proceedings of the 12th International Conference on Operations Research and Enterprise Systems (ICORES), pages 175–179, 2023.
DOI / Link: https://www.scitepress.org/Papers/2023/116818/116818.pdf

[18C] Ravi Kant and Abhishek Mishra. “The orienteering problem: A review of variants and solution approaches.” In Proceedings of the 26th World Multi-Conference on Systemics, Cybernetics and Informatics (WMSCI), pages 41–46, 2022.
DOI / Link: https://www.iiis.org/CDs2022/CD2022Summer/papers/SA919CB.pdf

[17C] Pratik S. and Abhishek Mishra. “A simulated annealing based energy efficient task scheduling algorithm for multi-core processors.” In Proceedings of the 13th International Joint Conference on Computational Intelligence (IJCCI), pages 81–87, 2021.
DOI / Link: https://www.scitepress.org/Papers/2021/106259/106259.pdf

[16C] Abhishek Mishra, Kamal~Sheel Mishra, and Pramod~Kumar Mishra. “Performance evaluation of simulated annealing-based task scheduling algorithms.” In Springer Proceedings of Information Management and Machine Intelligence (ICIMMI), pages 145–152, 2021.
DOI / Link: https://link.springer.com/chapter/10.1007/978-981-15-4936-6_15

[15J] Abhishek Mishra and Prasoon Trivedi. “Benchmarking the contention aware nature inspired metaheuristic task scheduling algorithms.” Cluster Computing, 23:537–553, 2020.
DOI / Link: https://link.springer.com/article/10.1007/s10586-019-02943-z

[14J] Rohan Sharma, Bibhas Adhikari, and Abhishek Mishra. “Structural and spectral properties of corona graphs.” Discrete Applied Mathematics, 228:14–31, 2017.
DOI / Link: https://doi.org/10.1016/j.dam.2017.01.005

[13J] Abhishek Mishra and Pramod~Kumar Mishra. “A randomized scheduling algorithm for multiprocessor environments using local search.” Parallel Processing Letters, 26(1):1650002, 2016.
DOI / Link: https://www.worldscientific.com/doi/abs/10.1142/S012962641650002X

[12C] Rohan Sharma, Bibhas Adhikari, and Abhishek Mishra. “On spectra of corona graphs.” In Proceedings of the Conference on Algorithms and Discrete Applied Mathematics (CALDAM), pages 126–137, 2015.
DOI / Link: https://link.springer.com/chapter/10.1007/978-3-319-14974-5_13

[11J] Abhishek Mishra and Anil~Kumar Tripathi. “Complexity of a problem of energy efficient real-time task scheduling on a multicore processor.” Complexity, 21(1):259–267, 2015.
DOI / Link: https://onlinelibrary.wiley.com/doi/epdf/10.1002/cplx.21561

[10J] Abhishek Mishra and Anil~Kumar Tripathi. “Energy efficient voltage scheduling for multi-core processors with software controlled dynamic voltage scaling.” Applied Mathematical Modelling, 38(14):3456–3466, 2014.
DOI / Link: https://www.sciencedirect.com/science/article/pii/S0307904X13008147

[09J] Abhishek Mishra and Anil~Kumar Tripathi. “A monte carlo algorithm for real time task scheduling on multi-core processors with software controlled dynamic voltage scaling.” Applied Mathematical Modelling, 38(7-8):1929–1947, 2014.
DOI / Link: https://www.sciencedirect.com/science/article/pii/S0307904X13006355

[08J] Pramod~Kumar Mishra, Abhishek Mishra, Kamal~Sheel Mishra, and Anil~Kumar Tripathi. “Benchmarking the clustering algorithms for multiprocessor environments using dynamic priority of modules.” Applied Mathematical Modelling, 36(12):6243–6263, 2012.
DOI / Link: https://www.sciencedirect.com/science/article/pii/S0307904X12000935

[07J] Pramod~Kumar Mishra, Kamal~Sheel Mishra, Abhishek Mishra, and Anil~Kumar Tripathi. “A randomized scheduling algorithm for multiprocessor environments.” Parallel Processing Letters, 22(4):1250015, 2012.
DOI / Link: https://www.worldscientific.com/doi/abs/10.1142/S0129626412500156

[06J] Pramod~Kumar Mishra, Kamal~Sheel Mishra, and Abhishek Mishra. “A clustering algorithm for multiprocessor environments using dynamic priority of modules.” Annales mathematicae et informaticae, 38:99–110, 2011.
DOI / Link: https://ami.uni-eszterhazy.hu/uploads/papers/finalpdf/AMI_38_from99to110.pdf

[05J] Abhishek Mishra and Anil~Kumar Tripathi. “An extension of edge zeroing heuristic for scheduling precedence constrained task graphs on parallel systems using cluster dependent priority scheme.” Journal of Information and Computing Science, 6(2):83–96, 2011.
DOI / Link: https://doc.global-sci.org/uploads/Issue/JICS/jicvol6no2paper01short.pdf

[04J] Abhishek Mishra and Anil~Kumar Tripathi. “Energy efficient task scheduling of send-receive task graphs on distributed multi-core processors with software controlled dynamic voltage scaling.” International Journal of Computer Science & Information Technology, 3(2):204–210, 2011.
DOI / Link: https://airccse.org/journal/jcsit/0411csit15.pdf

[03J] Pramod~Kumar Mishra, Kamal~Sheel Mishra, and Abhishek Mishra. “A clustering heuristic for multiprocessor environments using computation and communication loads of modules.” International Journal of Computer Science & Information Technology, 2(5):170–182, 2010.
DOI / Link: https://airccse.org/journal/jcsit/1010ijcsit13.pdf

[02C] Abhishek Mishra and Anil~Kumar Tripathi. “An extention of edge zeroing heuristic for scheduling precedence constrained task graphs on parallel systems using cluster dependent priority scheme.” In Proceedings of the IEEE International Conference on Computer & Communication Technology (ICCCT), pages 647–651, 2010.
DOI / Link: https://ieeexplore.ieee.org/document/5640450

[01M] Abhishek Mishra. “A 150-page list of identities and theorems.” The ‘Special Integrals’ monograph refers to this handwritten manuscript. 1997.
DOI / Link: https://drive.google.com/file/d/15Mkmny3bumOxaM-YLc2qlcSoufFekjyt/view?usp=sharing