T. Karthick

dblp:62/4649 · DBLP profile ↗
← Back
15ranked-venue papers
8as first author
3since 2021 · last 2026
—ORCID · conflict

Domains — the database's venue-derived domains; a paper can count in several

Theory of computation · 14 · 7 first-author · 3 since 2021Systems, architecture and hardware · 1 · 1 first-author
YearPublicationVenuePosition
2026 On near optimal colorable graphs
C. U. Angeliya, Arnab Char, T. Karthick
Discret. Appl. Math.3
2025 χ-boundedness and related problems on graphs without long induced paths: A survey
Arnab Char, T. Karthick
Discret. Appl. Math.2
2024 Coloring (P5, kite)-free graphs with small cliques
Shenwei Huang, Yiao Ju, T. Karthick
Discret. Appl. Math.3
2019 Polynomial Cases for the Vertex Coloring Problem
T. Karthick, Frédéric Maffray, Lucas Pastor
Algorithmica1
2019 Fog assisted IoT based medical cyber system for cardiovascular diseases affected patients
abstract
Summary IoT based Patient monitoring is the current need of the hour. The critical care services have been a crucial part for patients, who suffer from serious health conditions and heart diseases. Increased population is one of the major reasons behind waiting for clinical health monitoring services in hospitals. The current internet era and IoT based health support systems provide medical services for individuals and hospitals to forecast or early‐detect probable critical care situations. The proposed approach is a new health care support system for heart patients to monitor and report with hospitals. We have introduced a Fog assisted IoT based cardio monitoring application to help the decision support system, which also tested with the existing analogues health care applications to show its elevated performance.
T. Karthick, M. Manikandan
Concurr. Comput. Pract. Exp.1
2019 Square-Free Graphs with No Six-Vertex Induced Path
abstract
We elucidate the structure of $(P_6,C_4)$-free graphs by showing that every such graph either has a clique cutset, or a universal vertex, or belongs to several special classes of graphs. Using this result, we show that for any $(P_6,C_4)$-free graph $G$, $\lceil\frac{5\omega(G)}{4}\rceil$ and $\lceil\frac{\Delta(G) + \omega(G) +1}{2}\rceil$ are tight upper bounds for the chromatic number of $G$. Moreover, our structural results imply that every ($P_6$,$C_4$)-free graph with no clique cutset has bounded clique-width, and thus the existence of a polynomial-time algorithm that computes the chromatic number (or stability number) of any $(P_6,C_4)$-free graph.
T. Karthick, Frédéric Maffray
SIAM J. Discret. Math.1
2017 Efficient domination for classes of P6-free graphs
Andreas Brandstädt, Elaine M. Eschen, Erik Friese, T. Karthick
Discret. Appl. Math.4
2017 Maximum weight independent sets in classes related to claw-free graphs
T. Karthick, Frédéric Maffray
Discret. Appl. Math.1
2016 Maximum Weight Independent Sets in ( S_1, 1, 3 , bull)-free Graphs
T. Karthick, Frédéric Maffray
COCOON1
2016 Weighted efficient domination in two subclasses of P6-free graphs
Andreas Brandstädt, T. Karthick
Discret. Appl. Math.2
2016 Weighted independent sets in classes of P6-free graphs
T. Karthick, Frédéric Maffray
Discret. Appl. Math.1
2016 Structure of squares and efficient domination in graph classes
T. Karthick
Theor. Comput. Sci.1
2014 On atomic structure of P5-free subclasses and Maximum Weight Independent Set problem
T. Karthick
Theor. Comput. Sci.1
2012 Maximum weight independent sets in hole- and dart-free graphs
Manu Basavaraju, L. Sunil Chandran, T. Karthick
Discret. Appl. Math.3
2010 First-Fit coloring of {P5, K4-e}-free graphs
Sheshayya A. Choudum, T. Karthick
Discret. Appl. Math.2