We stand with Ukraine  

T. P. Sandhya

Orcid: 0000-0002-7745-3935

Affiliations:
  • University of Passau, Faculty for Mathematics and Computer Science, Germany
  • Hong Kong Polytechnic University, Department of Computing, Hong Kong
  • Indian Institute of Information Technology, Design and Manufacturing (IIITD&M), Chennai, India


According to our database1, T. P. Sandhya authored at least 14 papers between 2016 and 2025.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2025
The complement of the Djoković-Winkler relation.
[BibTeX]
[DOI]
Marc Hellmuth
,
Bruno J. Schmidt
,
Guillaume E. Scholz
,
Sandhya Thekkumpadan Puthiyaveedu
Discret. Math., 2025

2024
A Simple Partially Embedded Planarity Test Based on Vertex-Addition.
[BibTeX]
[DOI]
Simon D. Fink
,
Ignaz Rutter
,
T. P. Sandhya
CoRR, 2024

2023
Building a small and informative phylogenetic supertree.
[BibTeX]
[DOI]
Jesper Jansson
,
Konstantinos Mampentzidis
,
T. P. Sandhya
Inf. Comput., October, 2023

On a generalization of median graphs: k-median graphs.
[BibTeX]
[DOI]
Marc Hellmuth
,
Sandhya Thekkumpadan Puthiyaveedu
CoRR, 2023

Fitch Graph Completion.
[BibTeX]
[DOI]
Marc Hellmuth
,
Peter F. Stadler
,
Sandhya Thekkumpadan Puthiyaveedu
Proceedings of the Computing and Combinatorics - 29th International Conference, 2023

2022
Induced star partition of graphs.
[BibTeX]
[DOI]
M. A. Shalu
,
S. Vijayakumar
,
T. P. Sandhya
,
Joyashree Mondal
Discret. Appl. Math., 2022

2021
Extending Partial Orthogonal Drawings.
[BibTeX]
[DOI]
Patrizio Angelini
,
Ignaz Rutter
,
T. P. Sandhya
J. Graph Algorithms Appl., 2021

2020
On the complexity of cd-coloring of graphs.
[BibTeX]
[DOI]
M. A. Shalu
,
S. Vijayakumar
,
Sandhya T. P.
Discret. Appl. Math., 2020

2019
Graph Orientation with Edge Modifications.
[BibTeX]
[DOI]
Yuichi Asahiro
,
Jesper Jansson
,
Eiji Miyano
,
Hirotaka Ono
,
Sandhya T. P.
Proceedings of the Frontiers in Algorithmics - 13th International Workshop, 2019

The Induced Star Partition of Graphs.
[BibTeX]
[DOI]
M. A. Shalu
,
S. Vijayakumar
,
T. P. Sandhya
Proceedings of the Algorithms and Discrete Applied Mathematics, 2019

2018
On the algorithmic aspects of strong subcoloring.
[BibTeX]
[DOI]
M. A. Shalu
,
S. Vijayakumar
,
S. Devi Yamini
,
T. P. Sandhya
J. Comb. Optim., 2018

2017
A Lower Bound of the cd-Chromatic Number and Its Complexity.
[BibTeX]
[DOI]
M. A. Shalu
,
S. Vijayakumar
,
T. P. Sandhya
Proceedings of the Algorithms and Discrete Applied Mathematics, 2017

2016
Star Coloring of Graphs with Girth at Least Five.
[BibTeX]
[DOI]
M. A. Shalu
,
T. P. Sandhya
Graphs Comb., 2016

The cd-Coloring of Graphs.
[BibTeX]
[DOI]
M. A. Shalu
,
T. P. Sandhya
Proceedings of the Algorithms and Discrete Applied Mathematics, 2016


  Loading...