default search action
T. Karthick
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [j41]Shenwei Huang, Yiao Ju, T. Karthick:
Coloring (P5, kite)-free graphs with small cliques. Discret. Appl. Math. 344: 129-139 (2024) - 2023
- [j40]S. Praveenkumar
, T. Karthick:
Human Stress Recognition by Correlating Vision and EEG Data. Comput. Syst. Sci. Eng. 45(3): 2417-2433 (2023) - [j39]N. Vasudevan
A Hybrid Approach for Plant Disease Detection Using E-GAN and CapsNet. Comput. Syst. Sci. Eng. 46(1): 337-356 (2023) - [j38]Arnab Char, T. Karthick
Improved bounds on the chromatic number of (P5, flag)-free graphs. Discret. Math. 346(9): 113501 (2023) - [i15]Arnab Char, T. Karthick:
On graphs with no induced P5 or K5-e. CoRR abs/2308.08166 (2023) - 2022
- [j37]T. Karthick, Jenny Kaufmann, Vaidy Sivaraman:
Coloring Graph Classes with no Induced Fork via Perfect Divisibility. Electron. J. Comb. 29(3) (2022) - [j36]Arnab Char, T. Karthick
Coloring of (P5, 4-wheel)-free graphs. Discret. Math. 345(5): 112795 (2022) - [i14]Arnab Char, T. Karthick:
Optimal chromatic bound for (P2+P3, P2∓P3)-free graphs. CoRR abs/2205.07447 (2022) - 2021
- [j35]Maria Chudnovsky
Square-Free Graphs with no Induced Fork. Electron. J. Comb. 28(2): 2 (2021) - [j34]Sheshayya A. Choudum, T. Karthick
Structural domination and coloring of some (P7, C7)-free graphs. Discret. Math. 344(3): 112244 (2021) - [j33]Shenwei Huang, T. Karthick
On graphs with no induced five-vertex path or paraglider. J. Graph Theory 97(2): 305-323 (2021) - [i13]T. Karthick, Jenny Kaufmann, Vaidy Sivaraman:
Coloring graph classes with no induced fork via perfect divisibility. CoRR abs/2104.02807 (2021) - 2020
- [j32]Vijayakumar Ponnusamy
Primary user emulation attack mitigation using neural network. Comput. Electr. Eng. 88: 106849 (2020) - [j31]Maria Chudnovsky
Coloring graphs with no induced five-vertex path or gem. J. Graph Theory 95(4): 527-542 (2020) - [j30]T. Karthick, T. Kirthiga Devi, M. Ramprasath:
Effective Use of Big Data Planning and Analytics in Crop Planting. Webology 17(2): 677-693 (2020) - [j29]T. Kirthiga Devi, Akshat Srivatsava, Kritesh Kumar Mudgal, Ranjnish Raj Jayanti, T. Karthick:
Behaviour Cloning for Autonomous Driving. Webology 17(2): 694-705 (2020) - [j28]T. Kirthiga Devi, R. Mohanakrishnan, T. Karthick:
Secure Message Broadcasting in VANET Using RSU based Authentication and Cascade Encryption. Webology 17(2): 706-716 (2020) - [i12]Arnab Char, T. Karthick:
Wheel-free graphs with no induced five-vertex path. CoRR abs/2004.01365 (2020)
2010 – 2019
- 2019
- [j27]T. Karthick, Frédéric Maffray
Polynomial Cases for the Vertex Coloring Problem. Algorithmica 81(3): 1053-1074 (2019) - [j26]T. Karthick
Fog assisted IoT based medical cyber system for cardiovascular diseases affected patients. Concurr. Comput. Pract. Exp. 31(12) (2019) - [j25]T. Karthick
Square-Free Graphs with No Six-Vertex Induced Path. SIAM J. Discret. Math. 33(2): 874-909 (2019) - [i11]Shenwei Huang, T. Karthick:
On graphs with no induced five-vertex path or paraglider. CoRR abs/1903.11268 (2019) - [i10]Sheshayya A. Choudum, T. Karthick, Manoj M. Belavadi:
Structural domination and coloring of some (P7, C7)-free graphs. CoRR abs/1907.05018 (2019) - 2018
- [j24]T. Karthick, Suchismita Mishra:
Chromatic bounds for some classes of 2K2-free graphs. Discret. Math. 341(11): 3079-3088 (2018) - [j23]T. Karthick:
Star Coloring of Certain Graph Classes. Graphs Comb. 34(1): 109-128 (2018) - [j22]T. Karthick, Suchismita Mishra:
On the Chromatic Number of (P6 , Diamond)-Free Graphs. Graphs Comb. 34(4): 677-692 (2018) - [j21]T. Karthick, Frédéric Maffray
Coloring (gem, co-gem)-free graphs. J. Graph Theory 89(3): 288-303 (2018) - [i9]T. Karthick, Frédéric Maffray:
Square-free graphs with no six-vertex induced path. CoRR abs/1805.05007 (2018) - [i8]Maria Chudnovsky, T. Karthick, Peter Maceli, Frédéric Maffray:
Coloring graphs with no induced five-vertex path or gem. CoRR abs/1810.06186 (2018) - 2017
- [j20]T. Karthick, Frédéric Maffray:
Maximum weight independent sets in classes related to claw-free graphs. Discret. Appl. Math. 216: 233-239 (2017) - [j19]Andreas Brandstädt, Elaine M. Eschen, Erik Friese, T. Karthick:
Efficient domination for classes of P6-free graphs. Discret. Appl. Math. 223: 15-27 (2017) - [j18]T. Karthick:
Independent sets in some classes of Si, j, k-free graphs. J. Comb. Optim. 34(2): 612-630 (2017) - [i7]T. Karthick, Suchismita Mishra:
Chromatic bounds for some classes of 2K2-free graphs. CoRR abs/1702.00622 (2017) - [i6]T. Karthick, Suchismita Mishra:
Coloring (P6, diamond, K4)-free graphs. CoRR abs/1703.00606 (2017) - [i5]T. Karthick, Frédéric Maffray, Lucas Pastor:
Polynomial Cases for the Vertex Coloring Problem. CoRR abs/1709.07712 (2017) - 2016
- [j17]Andreas Brandstädt, T. Karthick:
Weighted efficient domination in two subclasses of P6-free graphs. Discret. Appl. Math. 201: 38-46 (2016) - [j16]T. Karthick, Frédéric Maffray:
Weighted independent sets in classes of P6-free graphs. Discret. Appl. Math. 209: 217-226 (2016) - [j15]T. Karthick:
Weighted independent sets in a subclass of P6-free graphs. Discret. Math. 339(4): 1412-1418 (2016) - [j14]Andreas M. Hinz, S. Arumugam
Preface. Electron. Notes Discret. Math. 53: 1-2 (2016) - [j13]T. Karthick:
Star chromatic bounds. Electron. Notes Discret. Math. 53: 413-419 (2016) - [j12]T. Karthick, Frédéric Maffray:
Vizing Bound for the Chromatic Number on Some Graph Classes. Graphs Comb. 32(4): 1447-1460 (2016) - [j11]T. Karthick:
Structure of squares and efficient domination in graph classes. Theor. Comput. Sci. 652: 38-46 (2016) - [c4]T. Karthick:
Independent Sets in Classes Related to Chair-Free Graphs. CALDAM 2016: 224-232 - [c3]T. Karthick, Frédéric Maffray:
Maximum Weight Independent Sets in ( S_1, 1, 3 , bull)-free Graphs. COCOON 2016: 385-392 - [i4]T. Karthick:
Independent Sets in Classes Related to Chair/Fork-free Graphs. CoRR abs/1603.02011 (2016) - 2015
- [c2]T. Karthick:
New Polynomial Case for Efficient Domination in P 6-free Graphs. CALDAM 2015: 81-88 - [i3]Andreas Brandstädt, T. Karthick:
Weighted Efficient Domination in Classes of P6-free Graphs. CoRR abs/1503.06025 (2015) - [i2]T. Karthick:
Weighted Independent Sets in a Subclass of $P_6$-free Graphs. CoRR abs/1504.05401 (2015) - 2014
- [j10]T. Karthick:
Note on equitable colorings of graphs. Australas. J Comb. 59: 251-259 (2014) - [j9]T. Karthick:
On atomic structure of P5-free subclasses and Maximum Weight Independent Set problem. Theor. Comput. Sci. 516: 78-85 (2014) - [i1]T. Karthick:
New polynomial case for efficient domination in $P_6$-free graphs. CoRR abs/1409.1676 (2014) - 2013
- [j8]T. Karthick, C. R. Subramanian:
Star coloring subcubic graphs. Discuss. Math. Graph Theory 33(2): 373-385 (2013) - 2012
- [j7]Manu Basavaraju, L. Sunil Chandran, T. Karthick:
Maximum weight independent sets in hole- and dart-free graphs. Discret. Appl. Math. 160(16-17): 2364-2369 (2012) - [j6]T. Karthick, Frédéric Maffray:
A characterization of claw-free b-perfect graphs. Discret. Math. 312(2): 324-330 (2012) - 2011
- [j5]N. R. Aravind, T. Karthick, C. R. Subramanian:
Bounding χ in terms of ω and Δ for some classes of graphs. Discret. Math. 311(12): 911-920 (2011) - 2010
- [j4]Sheshayya A. Choudum, T. Karthick:
First-Fit coloring of {P5, K4-e}-free graphs. Discret. Appl. Math. 158(6): 620-626 (2010) - [j3]Sheshayya A. Choudum, T. Karthick:
Maximal cliques in {P2 UNION P3, C4}-free graphs. Discret. Math. 310(23): 3398-3403 (2010) - [c1]T. Karthick, S. Aravind:
Unmanned Air Vehicle Collision Avoidance System and Method for Safety Flying in Civilian Airspace. ICETET 2010: 116-119
2000 – 2009
- 2008
- [j2]Sheshayya A. Choudum, T. Karthick, M. A. Shalu:
Linear Chromatic Bounds for a Subfamily of 3 K 1-free Graphs. Graphs Comb. 24(5): 413-428 (2008) - 2007
- [j1]Sheshayya A. Choudum, T. Karthick, M. A. Shalu:
Perfect coloring and linearly chi-bound P6-free graphs. J. Graph Theory 54(4): 293-306 (2007)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-18 19:28 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: