-
IIITDM

Indian Institute of Information Technology, Design and Manufacturing,
(IIITD&M) Kancheepuram, Chennai - 600 127

(An Institute of National Importance Fully Funded by Govt of India)


Faculty Profile

Dr.N.Sadagopan

Assistant Professor of Computer Science

                           
U. G  :  B.E. in Computer Science & Engineering, Dr.M.G.R. Engg College, University of Madras.
P. G  :  M.S (By Research), IIT Madras (Thesis Advisor: Dr.N.S.Narayanaswamy).
PhD  :  IIT Madras (Thesis Advisor: Dr.N.S.Narayanaswamy).
 
Email   : sadagopan@iiitdm.ac.in       Phone   : +91-44-27476350

Specialization

  • Theoretical Computer Science

Research Interests

  • Graph theory and Combinatorics
  • Data Structures and Algorithms
  • Computer Networks
  • Database Systems
  • Graph Library Generation Package [Code Developer: Kona Harshita (B.Tech COE - Class of 2014)]  

Teaching

            Discrete Structures for Computer Engineering    
Lecture Notes 
    
Problem Session 
    
Assignments 
            Design and Analysis of Algorithms    
Lecture Notes 
    
Problem Session 
    
Assignments 
            Advanced Data Structures and Algorithms    
Lecture Notes 
    
Problem Session 
    
Assignments 
            Computer Networks    
Lecture Notes 
    
Problem Session 
    
Assignments 

Awards

  • Outstanding Teaching Assistant(TA) award for the course "Mathematical Concepts in Computer Science", awarded by the Department of Computer Science, IIT Madras for the year 2008 and 2009.

Other Details

  • Secured All India Rank 592 in GATE-2005 (97.82 percentile)
  • Reviewer WALCOM 2013, Discrete Applied Mathematics
  • Reviewer WALCOM 2013, ICONDM 2013, CALDAM 2016
  • Reviewer Discrete Applied Mathematics 2013, 2015
  • Reviewer Oxford University Press
  • Doctoral Committee Member - Anna university, NIT Trichy, VIT Chennai.
  • B.Tech project evaluation committee member - NIT Trichy.
  • Organizing Committee, Technical Program Commitee Member, ICONDM 2016
  • Member, Board of Studies, Government of College of Engineering (GCT), Trivandrum.
  • Member, Academic Affairs Council, IIIT Kurnool.

Employment

    Research
  • Post Doctoral Researcher at Indian Institute of Science, Bangalore (June 2012-July 2012)
  • Teaching
  • Lecturer at Srivenkateswara College of Engineering, Sriperumbudur, Chennai. (Nov 2003- Jul 2005)
  • Half time teaching assistant at IIT Madras for various computer science related courses at undergraduate and graduate level during 2005-2011.
  • Assistant professor at Srivenkateswara College of Engineering, Sriperumbudur, Chennai. (Nov 2011-June 2012)

Journals

  • S.Dhanalakshmi, V.Manogna and N.Sadagopan: On $2k_{2}$ free graphs, to appear in International Journal of Pure and Applied Mathematics, 2016.
  • S.Dhanalakshmi, N.Sadagopan, D.Sunil Kumar: Tri-connectivity Augmentation in Trees, Electronic notes in Discrete Mathematics, 53, 57-72, 2016.
  • Surabhi Jain and N.Sadagopan: Simpler Sequential and Parallel Biconnectivity Augmentation in Trees, Parallel Processing Letters, Vol. 25, No. 4, 1550010, (2015).
  • N.S.Narayanaswamy and N.Sadagopan: Connected $(s,t)$-Vertex Separator Parameterized by Chordality, Journal of Graph Algorithms and its Applications, vol. 19, no. 1, pp. 549-565, 2015.
  • R.Krithika, Rogers Mathew, N.S.Narayanaswamy, and N.Sadagopan: A Dirac-type characterization of k-chordal graphs. Discrete Mathematics, 313(24): 2865-2867, 2013.
  • N.S.Narayanaswamy and N.Sadagopan: A Unified Framework For Bi(Tri)connectivity and Chordal Augmentation, International Journal of Foundations of Computer Science, 24(1), 67-93, 2013.
  • Anita Das, Mathew C. Francis, Rogers Mathew, and N. Sadagopan: "Non-contractible non-edges in 2-connected graphs", Information Processing Letters, 110(23), 1044-1048, 2010.
  • N.S.Narayanaswamy and N.Sadagopan: "On the Structure of Contractible Vertex Pairs in Chordal Graphs", Electronic notes in Discrete Mathematics, 33, 29-36, 2009.
  • N.S.Narayanaswamy, N.Sadagopan, and L.Sunil Chandran: "On the Structure of Contractible Edges in k-connected Partial k-trees", Graphs and Combinatorics, Springer Publications., 25(4), 557-569, 2009.

Conferences

  • P. Renjith, N. Sadagopan: Hamiltonicity in Split Graphs - A Dichotomy; in the proceedings of International Conference on Algorithms and Discrete Mathematics (CALDAM), BITS Goa, India, 2017.
  • Krishna Mohan Reddy, Renjith.P and N.Sadagopan: Enumeration of Spanning trees in Halin Graphs - Parallel Perspective, in the proceedings of 31$^{st}$ Annual Conference of Ramanujan Mathematical Society, National College, Trichy, June 2016.
  • S.Dhanalakshmi, N.Sadagopan, Nitin Vivek Bharti: $r$-Connectivity Augmentation in Trees, in the proceedings of 31$^{st}$ Annual Conference of Ramanujan Mathematical Society, National College, Trichy, June 2016.
  • Madhu Illuri, P. Renjith, N. Sadagopan: Complexity of Steiner Tree in Split Graphs - Dichotomy Results; in the proceedings of International Conference on Algorithms and Discrete Mathematics (CALDAM), Cochin University, India, 2016.
  • S.Dhanalakshmi, V.Manogna and N.Sadagopan, On $2k_{2}$ free graphs - Structural and Combinatorial View: in the proceedings of International Conference on Mathematical Computer Engineering ICMCE, VIT University, Chennai, 2015.
  • S.Dhanalakshmi, N.Sadagopan, D.Sunil Kumar: Tri-connectivity Augmentation in Trees, in the proceedings of International Conference on Graph Theory and Applications(ICGTA), Amrita University, Coimbatore, India, 2015.
  • Vandhana.C, S.Hima Bindhu, P.Renjith, N.Sadagopan and B.Supraja: Spanning Tree Enumeration in 2-trees: Sequential and Parallel Perspective, in the proceedings of International Conference on Graph Theory and Applications(ICGTA), Amrita University, Coimbatore, India, 2015.
  • Mrinal Kumar, Gaurav Maheswari, and N.Sadagopan: "A Characterization of all Stable Minimal Separator Graphs", accepted for poster presentation in European Conference on Combinatorics, Graph Theory and Applications (EUROCOMB'11), Rome, Italy, 2011.
  • N.S.Narayanaswamy and N.Sadagopan: "A Novel Data Structure for Biconnectivity, Triconnectivity, and k-tree Augmentation", in the proceedings of In Proc. of 17th Computing: The Australasian Theory Symposium (CATS), CRPIT Series, 119, 45-54 (Best Paper), Perth,Australia, 2011.
  • N.S.Narayanaswamy and N.Sadagopan: "Connectivity Augmentation in Chordal Graphs Preserving Chordality", in the proceedings of 16th International Conference on Advanced Computing and Communications(ADCOM), pp. 11-16, Madras Institute of Technology, Chennai, India, 2008.
  • N.S.Narayanaswamy and N.Sadagopan: "Contractible Non-Edges in Chordal Graphs", in the proceedings of International Conference on Graph Theory and Applications(ICGTA), pp.222-233, Amrita University, Coimbatore, India, 2008.