Dr. Arti Pandey

Associate Professor
  • Department of Mathematics
  • Indian Institute of Technology Ropar
  • Rupnagar, Punjab - 140001, India
sgt_poster-1
Dr. Arti Pandey is working as an Associate Professor in the Department of Mathematics at IIT Ropar. She obtained her M. Sc. in Mathematics, M. Tech. in Computer Applications and Ph.D from IIT Delhi. After submitting her Ph.D thesis, she joined IIIT Guwahati as an Assistant Professor in the department of computer science & engineering. She also visited Georgia Tech, Simon Fraser University and Carleton University as a visiting researcher for short durations. She joined IIT Ropar as an Assistant Professor in December 2016. Later on, in September 2025, she became an Associate Professor. Dr. Pandey’s research interests include designing algorithms for graph optimization problems, specifically different packing and covering problem in graphs.
  • Ph.D from Indian Institute of Technology Delhi, India, 2016.
  • M.Tech in Computer Applications from Indian Institute of Technology Delhi, India, 2011.
  • M.Sc in Mathematics from Indian Institute of Technology Delhi, India, 2009.
  • Associate Professor, Indian Institute of Technology Ropar: Sep, 2025 - Till now.
  • Assistant Professor, Indian Institute of Technology Ropar: Dec, 2016 – August, 2025.
  • Assistant Professor, Indian Institute of Information Technology Guwahati: July, 2015 – Dec, 2016.
  • Kaustav Paul, Arti Pandey. Eternal connected vertex cover problem in graphs: Complexity and algorithms. Theoretical Computer Science 1055 (2025) 115509.
  • Michael A. Henning, Arti Pandey, Vikash Tripathi. More on the Complexity of Defensive Domination in Graphs. Discrete Applied Mathematics 362 (2025) 167-179.
  • Kaustav Paul, Ankit Sharma, Arti Pandey. Exploring algorithmic solutions for the Independent Roman Domination problem in graphs. Discrete Applied Mathematics 364 (2025) 143-152.
  • Kusum, Arti Pandey. Hardness Results and Approximability of Cosecure Domination in Graphs. Discrete Mathematics, Algorithms and Applications 17 (2025) 2450063.
  • Vikash Tripathi, Kusum, Arti Pandey. Some Complexity Results on Semipaired Domination in Graphs. AKCE International Journal of Graphs and Combinatorics (2025) 1-7.
  • Gopika Sharma, Arti Pandey. Double dominating sequences in bipartite and co-bipartite graphs. Discussiones Mathematicae Graph Theory 45 (2025) 545-564.
  • Kaustav Paul, Arti Pandey. Some Algorithmic Results for Eternal Vertex Cover Problem in Graphs. Journal of Graph Algorithms and Applications 28 (2024) 69-85.
  • Kaustav Paul, Arti Pandey. Perfect Italian Domination on some generalisations of Cographs. Computational and Applied Mathematics 43 (2024) 390.
  • Kusum, Arti Pandey. Some new algorithmic results on co-secure domination in graphs. Theoretical Computer Science 992 (2024) 114451.
  • Kaustav Paul, Ankit Sharma, Arti Pandey. Algorithmic results for weak Roman domination problem in graphs. Discrete Applied Mathematics 359 (2024) 278-289.
  • Michael A. Henning, Arti Pandey, Gopika Sharma, Vikash Tripathi. Algorithms and hardness results for edge total domination problem in graphs. Theoretical Computer Science 982 (2024) 114270.
  • Michael A. Henning, Kusum, Arti Pandey, Kaustav Paul. Complexity of total domination coloring in graphs. Graphs and Combinatorics 39 (2023) 1-18.
  • BoÅ¡tjan BreÅ¡ar, Arti Pandey, Gopika Sharma. Computation of Grundy dominating sequences in (co-)bipartite graphs. Computational and Applied Mathematics 42 (2023) 1-17.
  • Michael A. Henning, Arti Pandey, Vikash Tripathi. Algorithmc aspects of paired disjunctive domination in graphs. Theoretical Computer Science 966-967 (2023) 113990.
  • Vikash Tripathi, Arti Pandey, Anil Maheshwari. A linear-time algorithms for semimetal domination in strongly chordal graphs. Discrete Applied Mathematics 338 (2023) 77-88.
  • Gopika Sharma, Arti Pandey, Michael C. Wigal. Algorithm for Maximum Internal Spanning Tree Problem for Some Graph Classes. Journal of Combinatorial Optimization 44 (2022) 3419-3445.
  • Vikash Tripathi, Ton Kloks, Arti Pandey, Kaustav Paul, Hung-Lung Wang. Complexity of Paired Domination in AT-free and Planar graphs. Theoretical Computer Science 930 (2022) 53-62.
  • BoÅ¡tjan BreÅ¡ar, Arti Pandey, Gopika Sharma. Computational Aspects of Some Vertex Sequences of Grundy Domination-Type. Indian Journal of Discrete Mathematics 8 (2022) 21-38.
  • Michael A. Henning, Arti Pandey, Vikash Tripathi. Semipaired Domination in Some Subclasses of Chordal Graphs. Discrete Mathematics and Theoretical Computer Science 23 (1) 2021.
  • B.S. Panda, Arti Pandey, Juhi Chaudhary, Piyush Dane, Manav Kashyap. Maximum weight induced matching in some subclasses of bipartite graphs. Journal of Combinatorial Optimization 40 (2020) 713-732.
  • Michael A. Henning, Arti Pandey, Vikash Tripathi. Complexity and Algorithms for Semipaired Domination in Graphs. Theory of Computing Systems 64 (2020) 1225-1241.
  • Michael A. Henning, Arti Pandey. Algorithmic Aspects of Semitotal Domination in Graphs, Theoretical Computer Science, 766 (2019) 46-57.
  • Arti Pandey, B. S. Panda. Domination in some subclasses of bipartite graphs, Discrete Applied Mathematics, 252 (2019) 51-66.
  • B. S. Panda, Arti Pandey, S. Paul. Algorithmic aspects of b-disjunctive domination in graphs, Journal of Combinatorial Optimization, 36 (2018) 572-590.
  • B. S. Panda, Arti Pandey. Algorithmic aspects of open neighborhood location domination in graphs, Discrete Applied Mathematics 216 (2017) 290-306.
  • Arti Pandey, B. S. Panda. Restrained Domination in Some Subclasses of Chordal Graphs. Electronic Notes in Discrete Mathematics, 63 (2017) 203-210.
  • B. S. Panda, Arti Pandey. Complexity of total outer-connected domination problem in graphs, Discrete Applied Mathematics, 199 (2016) 110-122.
  • B. S. Panda, Arti Pandey. On the dominator coloring in proper interval graphs and block graphs. Discrete Mathematics Algorithms and Applications, 7(4): 1550043:1 - 1550043:17 (2015).
  • B. S. Panda, Arti Pandey. Algorithm and Hardness Results for Outer-connected Dominating Set in Graphs, Journal of Graph Algorithms and Applications, 18(4) (2014) 493-513.
  • Pradeesha Ashok, Gautam K Das, Arti Pandey, Kaustav Paul. (Independent) Roman Domination Parameterized by Distance to Cluster. In: Du, D., Han, L., Xu, D. (eds) Combinatorial Optimization and Applications. COCOA 2024. Lecture Notes in Computer Science , vol 15435. Springer, Singapore.
  • Kaustav Paul, Arti Pandey. Eternal Connected Vertex Cover Problem in Graphs: Complexity and Algorithms. In: Kalyanasundaram, S., Maheshwari, A. (eds) Algorithms and Discrete Applied Mathematics. CALDAM 2024. Lecture Notes in Computer Science, vol 14508. Springer, Cham.
  • Kaustav Paul, Arti Pandey. Some Algorithmic Results for Eternal Vertex Cover Problem in Graphs. In: Lin, CC., Lin, B.M.T., Liotta, G. (eds) WALCOM: Algorithms and Computation. WALCOM 2023. Lecture Notes in Computer Science, vol 13973. Springer, Cham.
  • Kusum, Arti Pandey. Cosecure Domination: Hardness Results and Algorithms. In: Hsieh, SY., Hung, LJ. Lee, CW. (eds) Combinatorial Algorithms. IWOCA 2023. Lecture Notes in Computer Science, vol 13889. Springer, Cham.
  • Kusum, Arti Pandey. Complexity Results on Cosecure Domination in Graphs. In: Bagchi, A., Muthu, R. (eds) Algorithms and Discrete Applied Mathematics. CALDAM 2023. Lecture Notes in Computer Science, vol 13947. Springer, Cham.
  • Gopika Sharma, Arti Pandey. Computational Aspects of Double Dominating Sequences in Graphs. In: Bagchi, A., Muthu, R. (eds) Algorithms and Discrete Applied Mathematics. CALDAM 2023. Lecture Notes in Computer Science, vol 13947. Springer, Cham.
  • Vikash Tripathi, Ton Kolks, Arti Pandey, Kaustav Paul, Hung-Lung Wang. Complexity of Paired Domination in AT-free and Planar Graphs. In: BAlachandran, N., Inkulu, R. (eds) Algorithms and Discrete Applied Mathematics. CALDAM 2022. Lecture Notes in Computer Science, vol 13179. Springer, Cham.
  • Ton Kloks, Arti Pandey. Semitotal Domination on AT-Free Graphs and Circle Graphs. In: Mudgal, A., Subramaniam, C.R. (eds) Algorithms and Discrete Applied Mathematics. CALDAM 2021. Lecture Notes in Computer Science, vol 12601. Springer, Cham.
  • Michael A. Henning, Arti Pandey, Vikash Tripathi. Approximation Algorithm and Hardness Results for Defensive Domination in Graphs. In: Du, DZ., Du, D., Wu, C, Xu, D. (eds) Combinatorial Optimization and Applications. COCOA 2021. Lecture Notes in Computer Science, vol 13135. Springer, Cham.
  • Arti Pandey, Gopika Sharma, Nivedit Jain. Maximum Weighted Edge Biclique Problem on Bipartite Graphs. In: Changat, M. Das, S. (eds) Algorithms and Discrete Applied Mathematics. CALDAM 2020. Lecture Notes in Computer Science, vol 12016. Springer, Cham.
  • Michael A. Henning, Arti Pandey, Vikash Tripathi. Complexity and Algorithms for Semipaired Domination in Graphs. In: Colbourn, C., Grossi, R., Pisanti, N. (eds) Combinatorial Algorithms. IWOCA 2019. Lecture Notes in Computer Science, vol 11638. Springer, Cham.
  • Michael A. Henning, Arti Pandey, Vikash Tripathi. Algorithm and Hardness Result for Semipaired Domination in Graphs. In proceedings of CTW-2019 (17th Cologne_Twente Workshop on Graphs and Combinatorial Optimization).
  • Arti Pandey, B.S. Panda, P. Dane, M. Kashyap. Induced Matching in Some Subclasses of Bipartite Graphs. In: Gaur, D., Narayanaswamy, N. (eds) Algorithms and Discrete Applied Mathematics. CALDAM 2017. Lecture Notes in Computer Science, vol 10156. Springer, Cham.
  • Arti Pandey, B. S. Panda. b-Disjunctive Total Domination in Graphs: Algorithm and Hardness Results. In: Govindrajan, S. Maheshwari, A. (eds) Algorithms and Discrete Applied Mathematics. CALDAM 2016. Lecture Notes in Computer Science, vol 9602. Springer.
  • B.S. Panda, Arti Pandey. On the Complexity of Minimum Cardinality Maximal Uniquely Restricted Matching in Graphs. In: Arumugam, S., Bagga, J., Beineke, L., Panda, B. (eds) Theoretical Computer Science and Discrete Mathematics. ICTCSDM 2016. Lecture Notes in Computer Science, vol 10398. Springer, Cham.
  • Arti Pandey. Open Neighorhood Locating-Dominating Set in Graphs: Complexity and Algorithms. In: 2015 International Conference on Information Technology, ICIT-2015, IEEE.
  • Arti Pandey, B.S. Panda. Domination in Some Subclasses of Bipartite Graphs. In: Ganguly, S. Krishnamurti, R. (eds) Algorithms and Discrete Applied Mathematics. CALDAM 2015. Lecture Notes in Computer Science, vol 8959. Springer.
  • B.S. Panda, Arti Pandey, S. Paul. Algorithmic Aspects of Disjunctive Domination in Graphs.In: Xu, D., Du, D., Du, D. (eds) Computing and Combinatorics. COCOON 2015. Lecture Notes in Computer Science, vol 9198. Springer.
  • B.S. Panda, D.P. Shetty, Arti Pandey. k-Distinct Strong Minimum Energy Topology Problem in Wireless Sensor Networks. In: In: Natarajan, R., Barua, G. Patra, M.R. (eds) Distributed Computing and Internet Technology. ICDCIT 2015. Lecture Notes in Computer Science, vol 8956. Springer.
  • B.S. Panda, Arti Pandey. Algorithm and Hardness Results for Outer-connected Dominating Set in Graphs. In: Pal, S.P., Sadakane, K. (eds) Algorithms and Computation. WACLOM 2014. Lecture Notes in Computer Science,m vol 8344. Springer, Cham.
Present PhD Students

Ankit Sharma

Research Scholar
Department of Mathematics
Indian Institute of Technology (IIT) Ropar, Punjab, India
Email: ankit.23maz0013@iitrpr.ac.in

Reeta Sharma

Research Scholar
Department of Mathematics
Indian Institute of Technology (IIT) Ropar, Punjab, India
Email: reeta.24maz0005@iitrpr.ac.in

Himanshu Kumar

Research Scholar
Department of Mathematics
Indian Institute of Technology (IIT) Ropar, Punjab, India
Email: himanshu.24maz0021@iitrpr.ac.in

Shivani Sharma

Research Scholar
Department of Mathematics
Indian Institute of Technology (IIT) Ropar, Punjab, India and Indian Institute of Technology (IIT) Mandi, Himachal Pradesh, India
Email: shivani.25maz0006@iitrpr.ac.in

Deepika Garg

Research Scholar
Department of Mathematics
Indian Institute of Technology (IIT) Ropar, Punjab, India
Email: deepika.25maz0003@iitrpr.ac.in

Dr. Vikash Tripathi

(August 2017 - November 2022)
Current Position: Assistant Professor, IIT Mandi
Email: vikash@iitmandi.ac.in

Dr. Gopika Sharma

(January 2018 - March 2024)
Current Position: Assistant Professor, IMS Noida
Email: gopika.sharma.maz2023@alumni.iitrpr.ac.in

Dr. Kusum

(January 2019 - May 2024)
Current Position: Game Developer, Aristocrat Technologies
Email: kusum.maz2024@alumni.iitrpr.ac.in

Dr. Kaustav Paul

(September 2020 - September 2025)
Current Position: Postdoctoral Position, Tel-Aviv University, Israel
Email: kaustav.20maz0010@iitrpr.ac.in

Mr. Mayank Agarwal

(July 2025 - )
JRF Fellow, IIT Ropar
Email: staff.mayank.agarwal@iitrpr.ac.in

Dr. Kamal

(February 2025 - June 2025)
Current Position: IPDF, IIT Guwahati
Email: kamal72013@gmail.com
Scroll to Top