External Links

example graphic

I am currently a Scheduling Algorithm Specialist at Intelligen, where I develop scheduling and optimization algorithms for industrial planning and manufacturing systems. My work focuses on designing and implementing efficient scheduling algorithms, constraint handling, conflict resolution, and production planning solutions using C# and .NET. My research interests are in theoretical computer science, especially in graph theory. In particular, I am interested in Structural Graph Theory, Graph Colorings, Graph Algorithms, and Complexity Analysis. I received my Ph.D. in Mathematics from Indian Institute of Information Technology Design & Manufacturing (IIITDM Chennai), Kancheepuram, India, in 2017. My supervisors are Dr Shalu M A and Dr S Vijayakumar. From 2017 to 2018, I was a postdoctoral researcher at The Hong Kong Polytechnic University under the supervision of Dr Jesper Jansson. I then worked at the University of Passau, Germany, from 2019 to 2022 as a Research Associate with Prof. Dr. Ignaz Rutter. From 2022 to 2024, I was a postdoctoral researcher at Stockholm University, Sweden, where I worked with Prof. Dr. Marc Hellmuth and Prof. Dr. Lars Arvestad in the Computational Mathematics Division of the Department of Mathematics.

Contact

sandhyatp@intelligen.com
tp.sandhya@gmail.com

Publications

My list of publications can also be found at DBLP and Google Scholar.

    • In journal:

      • Shalu M A, Sandhya T P, A Generalization of Χ-Binding Functions, In: Subrahmanyam, P.V., Vijesh, V.A., Jayaram, B., Veeraraghavan, P. (eds) Synergies in Analysis, Discrete Mathematics, Soft Computing and Modelling (2023). Forum for Interdisciplinary Mathematics. Springer, Singapore.
        [Publisher's Page][Preprint]
      • Shalu M A, Vijayakumar S, Sandhya T P, Joyashree Mondal, Induced Star Partition of Graphs, Discrete Applied Mathematics 319 (2022), 81-91
        [Publisher's Page] [Preprint]
      • Patrizio Angelini, Ignaz Rutter, and Sandhya T P, Extending Partial Orthogonal Drawings, Journal of Graph Algorithms and Applications 25 (2021), 581-602.
        [Publisher's Page]
      • Yuichi Asahiro, Jesper Jansson, Eiji Miyano, Hirotaka Ono, Sandhya T P, Graph Orientation with Edge Modifications, International Journal of Foundations of Computer Science 32 (2021), 209-233
        [Publisher's Page]
      • Shalu M A, Vijayakumar S, Sandhya T P, On the complexity of cd-coloring of graphs, Discrete Applied Mathematics 280 (2020), 171-185
        [Publisher's Page] [Preprint]
      • Shalu M A, Vijayakumar S, Devi Yamini S, Sandhya T P, On the algorithmic aspects of strong subcoloring, Journal of Combinatorial Optimization 35 (2018), 1312-1329.
        [Publisher's Page] [Preprint]
      • Shalu M A, Sandhya T P, Star coloring of graphs with girth at least five, Graphs and Combinatorics 32 (2016), 2121-2134.
        [Publisher's Page] [Preprint]
    • In Conference:
      • Patrizio Angelini, Ignaz Rutter and Sandhya T P, Extending Partial Orthogonal Drawings, In: Auber, D., Valtr, P. (eds) Graph Drawing and Network Visualization. GD 2020. LNCS 12590. Springer.
        [Publisher's Page] [arXiv]
      • Jesper Jansson, Konstantinos Mampentzidis, Sandhya T P, Building a Small and Informative Phylogenetic Supertree, In: Katharina T. Huber and Dan Gusfield (eds) 19th International Workshop on Algorithms in Bioinformatics (WABI 2019), 1:1-1:14
        [Publisher's Page]
      • Yuichi Asahiro, Jesper Jansson, Eiji Miyano, Hirotaka Ono, Sandhya T P, Graph Orientation with Edge Modifications, Proceedings of Frontiers in Algorithmics (FAW2019), LNCS 11458 (2019), 38-50.
        [Publisher's Page]
      • Shalu M A, Vijayakumar S, Sandhya T P, The Induced Star Partition of Graphs, Algorithms and Discrete Applied Mathematics, LNCS, 11394 (2019), 16-28.
        [Publisher's Page]
      • Shalu M A, Vijayakumar S, Sandhya T P, A lower bound of the cd-chromatic number and its complexity, Algorithms and Discrete Applied Mathematics, LNCS 10156 (2017), 344-355.
        [Publisher's Page]
      • Shalu M A, Sandhya T P, The cd-coloring of graphs, Algorithms and Discrete Applied Mathematics, LNCS 9602 (2016), 337-348.
        [Publisher's Page]

    • Submitted:

      • Marc Hellmuth, Peter F. Stadler, Sandhya T P, Fitch Graph Completion
        [ArXiv]
      • Marc Hellmuth, Sandhya T P, On a generalization of median graphs: k-median graphs
        [ArXiv]
      • Jesper Jansson, Konstantinos Mampentzidis, Sandhya T P, Building a Small and Informative Phylogenetic Supertree
    • PhD Thesis: [Graph Coloring and its Variants]

    Teaching

    • University of Passau, Germany
      SemesterCourseRole
      Summer'20,'21Algorithms for Graph Visualization (Master) Lecturer
      Winter '19, '20Parameterized Algorithms (Master) Lecturer
      Summer'19,'20Algorithms and Data structures (Bachelor) T A
      Winter '19, '20Theoretical Computer Science (Bachelor) T A
      Summer '19Efficient Algorithms (Master)T A
      Summer '20Graphs and Networks Algorithms (Practical, Master) T A
      Winter '21Advanced Topics in Parameterized Algorithms and Complexity (Seminar, Master) Supervisor
      Winter '20 Algorithms for Planar Graphs (Seminar, Bachelor) Supervisor
      Summer '19Selected Topics in Graph Visualization (Seminar, Master)Supervisor
    • National Institute of Technology, Calicut, India
      SemesterCourseRole
      Jul-Nov '17Mathematical Methods (Master) Lecturer
      Jul-Nov '17Applied Mathematics (Master) Lecturer
    • IIITDM Kancheepuram, India
      SemesterCourseRole
      2011-2016Computational Engineering (Bachelor) T A
      2011-2016Object Oriented Programming with C++ (Bachelor) T A
      Jul-Dec 2015Data Structures & Algorithms Practice (Bachelor) T A