Dr. Arti Pandey

Assistant Professor
Mathematics

arti [AT] iitrpr.ac.in

Areas of Research

Algorithmic Graph Theory

Education

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.

Work Experience

Assistant Professor, Indian Institute of Technology Ropar, Dec, 2016 - till now.
Assistant Professor, Indian Institute of Information Technology Guwahati, July, 2015 - Dec, 2016.

Selected Publications/Patents

2018
  1. Michael A. Henning, Arti Pandey. Algorithmic Aspects of Semitotal Domination in Graphs. Theoretical Computer Science (2018), Article in Press.
  2. Arti Pandey, B. S. Panda. Domination in some subclasses of bipartite graphs. Discrete Applied Mathematics (2018), Article in Press.
  3. B. S. Panda, Arti Pandey, and S. Paul. Algorithmic aspects of $b$-disjunctive domination in graphs. Journal of Combinatorial Optimization 36 (2018) 572-590.

2017
  1. B. S. Panda, Arti Pandey. Algorithmic aspects of open neighborhood location-domination in graphs. Discrete Applied Mathematics 216 (2017), pp. 290-306.
  2. Arti Pandey, B.S. Panda. Restrained Domination in Some Subclasses of Chordal Graphs. Electronic Notes in Discrete Mathematics 63 (2017), pp. 203-210.
  3. 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) ICTCSDM 2016. Lecture Notes in Computer Sci., vol. 10398. Springer.
  4. Arti Pandey, B.S. Panda, P. Dane, M. Kashyap. Induced Matching in Some Subclasses of Bipartite Graphs. In: Gaur D., Narayanaswamy N. (eds) CALDAM 2017. Lecture Notes in Computer Sci., vol. 10156. Springer.
2016
  1. B. S. Panda, Arti Pandey. Complexity of total outer-connected domination problem in graphs. Discrete Applied Mathematics 199 (2016), pp. 110-122.
  2. Arti Pandey, B. S. Panda. b-Disjunctive Total Domination in Graphs: Algorithm and Hardness Results. In: Govindarajan S., Maheshwari A. (eds) CALDAM 2016. Lecture Notes in Computer Sci., vol. 9602. Springer.
2015
  1. B. S. Panda, Arti Pandey. On the dominator coloring in proper interval graphs and block graphs. Discrete Mathematics, Algorithms and Applications 7 (2015), doi:10.1142/S1793830915500433.
  2. Arti Pandey, B. S. Panda. Domination in Some Subclasses of Bipartite Graphs. In: Ganguly S., Krishnamurti R. (eds) CALDAM 2015. Lecture Notes in Computer Sci., vol. 8959. Springer.
  3. Arti Pandey, Open Neighborhood Locating-Dominating Set in Graphs: Complexity and Algorithms. In: ICIT 2015. IEEE Explore. doi:10.1109/ICIT.2015.14.
  4. B. S. Panda, Arti Pandey, S. Paul. Algorithmic Aspects of Disjunctive Domination in Graphs. In: Xu D., Du D., Du D. (eds) COCOON 2015. Lecture Notes in Computer Sci., vol. 9198. Springer.
  5. B.S. Panda, D. Pushparaj Shetty, Arti Pandey. k-Distinct Strong Minimum Energy Topology Problem in Wireless Sensor Networks. In: Natarajan R., Barua G., Patra M.R. (eds) ICDCIT 2015. Lecture Notes in Computer Sci., vol. 8956. Springer.
2014
  1. B.S. Panda, Arti Pandey. Algorithm and Hardness Results for Outer-connected Dominating Set in Graphs. Journal of Graph Algorithms and Applications 18 (2014), pp. 493-513 (Preliminary version of the paper got accepted in WALCOM 2014, and got published in Lecture Notes in Computer Sci., vol. 8344. Springer).

Other Information

Invited Talks: