Xavier Chelladurai

@christuniversity.in

Professor, Department of Computer Science and Engineering
Christ University

Xavier Chelladurai


               Download Compact PDF  
https://researchid.co/xavierc
Dr. Xavier Chelladurai is Director HRDC and Professor, Computer Science and Engineering, School of Engineering and Technology, Christ University. He has 19 years of IT industry experience in Capgemini, Tech Mahindra, and HCL Technologies Ltd. and 18 years of education and research. He was the Vice President and Global Head of Artificial Intelligence in Capgemini before joining Christ. His research interest includes Artificial Intelligence Technologies and Parallel Computer Algorithms. He is the author of more than 20 Computer Science Technical books, more than 10 research papers, more than 30 educational videos published in YouTube. He has guided 7 Ph. D. scholars successfully complete degree. He is a Java practitioner for 25 years and his Java book published by McGraw Hill India Education celebrated its Jubilee recently. He is a Senior Member of IEEE and a Senior Life Member of Computer Society of India since 1994.

RESEARCH INTERESTS

Parallel Algorithms, Artificial Intelligence, Machine Learning
5

Scopus Publications

5

Scholar Citations

2

Scholar h-index

Scopus Publications

  • Genetic Algorithms for Graph Theoretic Problems
    Xavier Chelladurai, Joseph Varghese Kureethara
    Bio Inspired Computational Paradigms Security and Privacy in Dynamic Smart Networks, 2024
    The graph vertex colouring problem calls for colouring the vertices with k colours on graph G, which has n vertices and m edges. There are kn distinct colour combinations when there are n vertices and k colours. If two neighbouring vertices in a given k-colouring do not share the same colour, the colouring is said to be perfect. The chromatic number of the graph is the minor integer k, for which G has a perfect k-colouring. It is an NP-complete problem to determine the chromatic number. The construction of solutions using Genetic Algorithms is quite comparable to the development of biological things in genetics. Father and Mother, two potential solution states, are united to create offspring, which is a better solution state than Father and Mother. The vertex colouring problem was examined in this research, and the functions perfect colouring coefficient of vertex (PCCV) and perfect colouring coefficient of the graph (PCCG) were introduced. The functions PCCV(v) and PCCG(C) are used as Fitness Functions in searching for solutions using the approach of Genetic Algorithms. We have defined a few mutation functions and crossover functions. The mutations and crossover defined in this chapter are proven to improve the fitness function value in every generation. We prove that the Genetic Algorithm presented in this chapter moves in the right direction toward an optimal solution.
  • A Mathematical Model to Explore the Details in an Image with Local Binary Pattern Distribution (LBP)
    Denny Dominic, Krishnan Balachandran, C. Xavier
    Lecture Notes in Networks and Systems, 2023
  • Algorithms for the metric dimension of a simple graph
    Xavier Chelladurai, Joseph Varghese Kureethara
    Lecture Notes in Networks and Systems, 2021
  • Parallel Algorithm to find Integer k where a given Well-Distributed Graph is k-Metric Dimensional
    Xavier Chelladurai, Joseph Varghese Kureethara
    Advances in Intelligent Systems and Computing, 2021
  • On Statistical Tools in Finding Equitable Antimagic Labeling of Complete Graphs
    Antony Puthussery, I. Sahul Hamid, Xavier Chelladurai
    Lecture Notes in Networks and Systems, 2021

RECENT SCHOLAR PUBLICATIONS

  • Genetic Algorithms for Graph Theoretic Problems
    X Chelladurai, JV Kureethara
    Bio-Inspired Computational Paradigms, 36-63 , 2024
    2024.0
  • On Statistical Tools in Finding Equitable Antimagic Labeling of Complete Graphs
    A Puthussery, I Sahul Hamid, X Chelladurai
    Information and Communication Technology for Competitive Strategies (ICTCS … , 2021
    2021.0
  • Algorithms for the metric dimension of a simple graph
    X Chelladurai, JV Kureethara
    Data Science and Security: Proceedings of IDSCS 2020, 91-105 , 2020
    2020.0
    Citations: 3
  • Parallel Algorithm to find Integer k where a given Well-Distributed Graph is k-Metric Dimensional
    X Chelladurai, JV Kureethara
    International Symposium on Signal and Image Processing, 145-153 , 2020
    2020.0
    Citations: 2
  • Cloud Computing for Educational Technology
    X Chelladurai, N Sundararaj
    AARE 2010 INTERNATIONAL EDUCATION RESEARCH CONFERENCE-MELBOURNE , 2010
    2010.0
  • Is Application Support and Maintenance the Cost of Failure?
    X Chelladurai, S Chandrasekaran

MOST CITED SCHOLAR PUBLICATIONS

  • Algorithms for the metric dimension of a simple graph
    X Chelladurai, JV Kureethara
    Data Science and Security: Proceedings of IDSCS 2020, 91-105 , 2020
    2020.0
    Citations: 3
  • Parallel Algorithm to find Integer k where a given Well-Distributed Graph is k-Metric Dimensional
    X Chelladurai, JV Kureethara
    International Symposium on Signal and Image Processing, 145-153 , 2020
    2020.0
    Citations: 2
  • Genetic Algorithms for Graph Theoretic Problems
    X Chelladurai, JV Kureethara
    Bio-Inspired Computational Paradigms, 36-63 , 2024
    2024.0
  • On Statistical Tools in Finding Equitable Antimagic Labeling of Complete Graphs
    A Puthussery, I Sahul Hamid, X Chelladurai
    Information and Communication Technology for Competitive Strategies (ICTCS … , 2021
    2021.0
  • Cloud Computing for Educational Technology
    X Chelladurai, N Sundararaj
    AARE 2010 INTERNATIONAL EDUCATION RESEARCH CONFERENCE-MELBOURNE , 2010
    2010.0
  • Is Application Support and Maintenance the Cost of Failure?
    X Chelladurai, S Chandrasekaran