T. Karthick - RankMe

65 papers Misc 1Journal 61Unranked 3

Year	Rank	Type	Title / Venue / Authors
2026	J	`jnl`	On near optimal colorable graphs. Discret. Appl. Math. C. U. Angeliya, Arnab Char, T. Karthick
2025	J	`jnl`	Coloring of (P CoRR C. U. Angeliya, T. Karthick, S. Huang
2025	J	`jnl`	On near optimal colorable graphs. CoRR C. U. Angeliya, Arnab Char, T. Karthick
2025	J	`jnl`	Optimal coloring of (P2 + P3, gem)-free graphs. Discret. Math. Arnab Char, T. Karthick
2025	J	`jnl`	χ-boundedness and related problems on graphs without long induced paths: A survey. Discret. Appl. Math. Arnab Char, T. Karthick
2024	J	`jnl`	Coloring (P5, kite)-free graphs with small cliques. Discret. Appl. Math. Shenwei Huang, Yiao Ju, T. Karthick
2023	J	`jnl`	A Hybrid Approach for Plant Disease Detection Using E-GAN and CapsNet. Comput. Syst. Sci. Eng. N. Vasudevan, T. Karthick
2023	J	`jnl`	Human Stress Recognition by Correlating Vision and EEG Data. Comput. Syst. Sci. Eng. S. Praveenkumar, T. Karthick
2023	J	`jnl`	Improved bounds on the chromatic number of ( Discret. Math. Arnab Char, T. Karthick
2023	J	`jnl`	On graphs with no induced P CoRR Arnab Char, T. Karthick
2022	J	`jnl`	Coloring Graph Classes with no Induced Fork via Perfect Divisibility. Electron. J. Comb. T. Karthick, Jenny Kaufmann, Vaidy Sivaraman
2022	J	`jnl`	Coloring of ( Discret. Math. Arnab Char, T. Karthick
2022	J	`jnl`	Optimal chromatic bound for (P CoRR Arnab Char, T. Karthick
2021	J	`jnl`	Coloring graph classes with no induced fork via perfect divisibility. CoRR T. Karthick, Jenny Kaufmann, Vaidy Sivaraman
2021	J	`jnl`	On graphs with no induced five-vertex path or paraglider. J. Graph Theory Shenwei Huang, T. Karthick
2021	J	`jnl`	Square-Free Graphs with no Induced Fork. Electron. J. Comb. Maria Chudnovsky, Shenwei Huang, T. Karthick, Jenny Kaufmann
2021	J	`jnl`	Structural domination and coloring of some (P7, C7)-free graphs. Discret. Math. Sheshayya A. Choudum, T. Karthick, Manoj M. Belavadi
2020	J	`jnl`	Behaviour Cloning for Autonomous Driving. Webology T. Kirthiga Devi, Akshat Srivatsava, Kritesh Kumar Mudgal, Ranjnish Raj Jayanti, T. Karthick
2020	J	`jnl`	Coloring graphs with no induced five-vertex path or gem. J. Graph Theory Maria Chudnovsky, T. Karthick, Peter Maceli, Frédéric Maffray
2020	J	`jnl`	Effective Use of Big Data Planning and Analytics in Crop Planting. Webology T. Karthick, T. Kirthiga Devi, M. Ramprasath
2020	J	`jnl`	Primary user emulation attack mitigation using neural network. Comput. Electr. Eng. Vijayakumar Ponnusamy, Kottilingam Kottursamy, T. Karthick, M. B. Mukesh Krishnan, Malathi Devarajan, Tariq Ahamed Ahanger
2020	J	`jnl`	Secure Message Broadcasting in VANET Using RSU based Authentication and Cascade Encryption. Webology T. Kirthiga Devi, R. Mohanakrishnan, T. Karthick
2020	J	`jnl`	Wheel-free graphs with no induced five-vertex path. CoRR Arnab Char, T. Karthick
2019	J	`jnl`	Fog assisted IoT based medical cyber system for cardiovascular diseases affected patients. Concurr. Comput. Pract. Exp. T. Karthick, M. Manikandan
2019	J	`jnl`	On graphs with no induced five-vertex path or paraglider. CoRR Shenwei Huang, T. Karthick
2019	J	`jnl`	Polynomial Cases for the Vertex Coloring Problem. Algorithmica T. Karthick, Frédéric Maffray, Lucas Pastor
2019	J	`jnl`	Square-Free Graphs with No Six-Vertex Induced Path. SIAM J. Discret. Math. T. Karthick, Frédéric Maffray
2019	J	`jnl`	Structural domination and coloring of some (P CoRR Sheshayya A. Choudum, T. Karthick, Manoj M. Belavadi
2018	J	`jnl`	Chromatic bounds for some classes of 2K2-free graphs. Discret. Math. T. Karthick, Suchismita Mishra
2018	J	`jnl`	Coloring (gem, co-gem)-free graphs. J. Graph Theory T. Karthick, Frédéric Maffray
2018	J	`jnl`	Coloring graphs with no induced five-vertex path or gem. CoRR Maria Chudnovsky, T. Karthick, Peter Maceli, Frédéric Maffray
2018	J	`jnl`	On the Chromatic Number of (P Graphs Comb. T. Karthick, Suchismita Mishra
2018	J	`jnl`	Square-free graphs with no six-vertex induced path. CoRR T. Karthick, Frédéric Maffray
2018	J	`jnl`	Star Coloring of Certain Graph Classes. Graphs Comb. T. Karthick
2017	J	`jnl`	Chromatic bounds for some classes of 2K CoRR T. Karthick, Suchismita Mishra
2017	J	`jnl`	Coloring (P CoRR T. Karthick, Suchismita Mishra
2017	J	`jnl`	Efficient domination for classes of P Discret. Appl. Math. Andreas Brandstädt, Elaine M. Eschen, Erik Friese, T. Karthick
2017	J	`jnl`	Independent sets in some classes of S J. Comb. Optim. T. Karthick
2017	J	`jnl`	Maximum weight independent sets in classes related to claw-free graphs. Discret. Appl. Math. T. Karthick, Frédéric Maffray
2017	J	`jnl`	Polynomial Cases for the Vertex Coloring Problem. CoRR T. Karthick, Frédéric Maffray, Lucas Pastor
2016	—	`conf`	Independent Sets in Classes Related to Chair-Free Graphs. CALDAM T. Karthick
2016	J	`jnl`	Independent Sets in Classes Related to Chair/Fork-free Graphs. CoRR T. Karthick
2016	Misc	`conf`	Maximum Weight Independent Sets in ( S_1, 1, 3 , bull)-free Graphs. COCOON T. Karthick, Frédéric Maffray
2016	J	`jnl`	Preface. Electron. Notes Discret. Math. Andreas M. Hinz, S. Arumugam, Rangaswami Balakrishnan, S. Francis Raj, T. Karthick, K. Somasundaram, Xuding Zhu
2016	J	`jnl`	Star chromatic bounds. Electron. Notes Discret. Math. T. Karthick
2016	J	`jnl`	Structure of squares and efficient domination in graph classes. Theor. Comput. Sci. T. Karthick
2016	J	`jnl`	Vizing Bound for the Chromatic Number on Some Graph Classes. Graphs Comb. T. Karthick, Frédéric Maffray
2016	J	`jnl`	Weighted efficient domination in two subclasses of P Discret. Appl. Math. Andreas Brandstädt, T. Karthick
2016	J	`jnl`	Weighted independent sets in a subclass of P Discret. Math. T. Karthick
2016	J	`jnl`	Weighted independent sets in classes of P Discret. Appl. Math. T. Karthick, Frédéric Maffray
2015	—	`conf`	New Polynomial Case for Efficient Domination in P 6-free Graphs. CALDAM T. Karthick
2015	J	`jnl`	Weighted Efficient Domination in Classes of P CoRR Andreas Brandstädt, T. Karthick
2015	J	`jnl`	Weighted Independent Sets in a Subclass of $P_6$-free Graphs. CoRR T. Karthick
2014	J	`jnl`	New polynomial case for efficient domination in $P_6$-free graphs. CoRR T. Karthick
2014	J	`jnl`	Note on equitable colorings of graphs. Australas. J Comb. T. Karthick
2014	J	`jnl`	On atomic structure of P Theor. Comput. Sci. T. Karthick
2013	J	`jnl`	Star coloring subcubic graphs. Discuss. Math. Graph Theory T. Karthick, C. R. Subramanian
2012	J	`jnl`	A characterization of claw-free b-perfect graphs. Discret. Math. T. Karthick, Frédéric Maffray
2012	J	`jnl`	Maximum weight independent sets in hole- and dart-free graphs. Discret. Appl. Math. Manu Basavaraju, L. Sunil Chandran, T. Karthick
2011	J	`jnl`	Bounding χ in terms of ω and Δ for some classes of graphs. Discret. Math. N. R. Aravind, T. Karthick, C. R. Subramanian
2010	J	`jnl`	First-Fit coloring of {P Discret. Appl. Math. Sheshayya A. Choudum, T. Karthick
2010	J	`jnl`	Maximal cliques in {P Discret. Math. Sheshayya A. Choudum, T. Karthick
2010	—	`conf`	Unmanned Air Vehicle Collision Avoidance System and Method for Safety Flying in Civilian Airspace. ICETET T. Karthick, S. Aravind
2008	J	`jnl`	Linear Chromatic Bounds for a Subfamily of 3 Graphs Comb. Sheshayya A. Choudum, T. Karthick, M. A. Shalu
2007	J	`jnl`	Perfect coloring and linearly chi-bound J. Graph Theory Sheshayya A. Choudum, T. Karthick, M. A. Shalu