default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID1. ICTCSDM 2016: Krishnankoil, India
- S. Arumugam, Jay S. Bagga, Lowell W. Beineke, B. S. Panda:
Theoretical Computer Science and Discrete Mathematics - First International Conference, ICTCSDM 2016, Krishnankoil, India, December 19-21, 2016, Revised Selected Papers. Lecture Notes in Computer Science 10398, Springer 2017, ISBN 978-3-319-64418-9 - A. Anu, S. Monikandan
:
Degree Associated Reconstruction Number of Biregular Bipartite Graphs Whose Degrees Differ by at Least Two. 1-9 - Abhisek Midya, Lakshmanan Kuppusamy, V. S. Sumitha, Alok Kumar Pani:
1-Normal DRA for Insertion Languages. 10-19 - Anand Mahendran, Lakshmanan Kuppusamy:
Formal Language Representation and Modelling Structures Underlying RNA Folding Process. 20-29 - Anu V., S. Aparna Lakshmanan:
Homometric Number of a Graph and Some Related Concepts. 30-37 - Ashok Kumar Das, Ritapa Chakraborty:
Forbidden Subgraphs of Bigraphs of Ferrers Dimension 2. 38-49 - S. V. Divya Rashmi, S. Arumugam, A. Somasundaram:
Global Secure Domination in Graphs. 50-54 - S. Fepslin Athish Mon, K. Suthendran, K. Arjun, S. Arumugam:
A Novel Reversible Data Hiding Method in Teleradiology to Maximize Data Capacity in Medical Images. 55-62 - P. Francis, S. Francis Raj:
Indicated Coloring of Cartesian Product of Graphs. 63-68 - D. Franklin Vinod, V. Vasudevan:
A Bi-level Security Mechanism for Efficient Protection on Graphs in Online Social Network. 69-75 - Aloysius Godinho, Tarkeshwar Singh, S. Arumugam:
On Nearly Distance Magic Graphs. 76-82 - P. Hemalatha:
Evenly Partite Directed Bigraph Factorization of Wreath Product of Graphs. 83-89 - Jessie Abraham, Micheal Arockiaraj:
Minimum Layout of Circulant Graphs into Certain Height Balanced Trees. 90-97 - J. Julie, J. Baskar Babujee, V. Masilamani:
Dissecting Power of Certain Matrix Languages. 98-105 - N. Kalai Mathi, S. Monikandan:
Degree Associated Reconstruction Number of Split Graphs with Regular Independent Set. 106-112 - Nainarraj Kamatchi, Gurusamy Rengasamy Vijayakumar, A. Ramalakshmi, S. Nilavarasi, S. Arumugam:
Distance Antimagic Labelings of Graphs. 113-118 - K. Kanchan Devi, S. Arumugam:
Probabilistic Conjunctive Grammar. 119-127 - K. Kayathri, S. Vallirani:
(1, 2)-Domination in Graphs. 128-133 - Arockiam Lourdusamy, F. Patrick:
New Construction on SD-Prime Cordial Labeling. 134-143 - J. Maria Jeyaseeli, Nazanin Movarraei, S. Arumugam:
Dominator Coloring of Generalized Petersen Graphs. 144-151 - G. Marimuthu, P. Krishnaveni:
Super Edge-Antimagic Gracefulness of Disconnected Graphs. 152-155 - P. Mohanakrishnan, K. Suthendran, S. Arumugam, T. Panneerselvam:
Mixed Noise Elimination and Data Hiding for Secure Data Transmission. 156-164 - V. Muneeswaran, M. Pallikonda Rajasekaran:
Analysis of Particle Swarm Optimization Based 2D FIR Filter for Reduction of Additive and Multiplicative Noise in Images. 165-174 - K. Muthu Guru Packiam, T. Manimaran, A. Thuraiswamy:
Irregularity Strength of Corona of Two Graphs. 175-181 - K. Muthu Guru Packiam, T. Manimaran, A. Thuraiswamy:
1-Distant Irregularity Strength of Graphs. 182-190 - B. Muthulakshmi, M. Venkatesulu:
Cloud Data Security Based on Data Partitions and Multiple Encryptions. 191-196 - A. Muthuselvi, S. Arumugam:
Upper Majority Domination Number of a Graph. 197-202 - M. Nalliah, S. Arumugam:
Super (a, 3)-edge Antimagic Total Labeling for Union of Two Stars. 203-211 - Olayiwola Babarinsa, Hailiza Kamarulhaili:
On Determinant of Laplacian Matrix and Signless Laplacian Matrix of a Simple Graph. 212-217 - B. S. Panda, Arti Pandey:
On the Complexity of Minimum Cardinality Maximal Uniquely Restricted Matching in Graphs. 218-227 - B. S. Panda, Shaily Verma:
Partial Grundy Coloring in Some Subclasses of Bipartite Graphs and Chordal Graphs. 228-237 - A. Parthiban, N. Gnanamalar David:
On Prime Distance Labeling of Graphs. 238-241 - P. Paulraja, K. Raja Chandrasekar:
Dominator Colorings of Products of Graphs. 242-250 - Balasubramani Perumal, M. Pallikonda Rajasekaran, Thiyagarajan Arun Prasath:
Efficient Hybrid Approach for Compression of Multi Modal Medical Images. 251-261 - Karuvachery Pravas, Ambat Vijayakumar:
The Median Problem on Symmetric Bipartite Graphs. 262-270 - K. Jency Priya, T. Rajaretnam:
Intuitionistic Fuzzy Automaton with Unique Membership and Unique Nonmembership Transitions. 271-280 - Purnima Gupta, Deepti Jain:
Independent 2-Point Set Domination in Graphs. 281-288 - Purnima Gupta, Rajesh Singh:
On Graphs Whose Graphoidal Length Is Half of Its Size. 289-299 - Purnima Gupta, Alka Goyal, Rajesh Singh:
Point-Set Domination in Graphs. VIII: Perfect and Efficient PSD Sets. 300-304 - Purnima Gupta, Rajesh Singh, S. Arumugam:
Graphoidal Length and Graphoidal Covering Number of a Graph. 305-311 - S. Rajeswari, K. Suthendran, K. Rajakumar, S. Arumugam:
An Overview of the MapReduce Model. 312-317 - S. Rajeswari, M. Indhumathy, A. Somasundaram, Neeru Sood, S. Arumugam:
Identification of Salinity Stress Tolerant Proteins in Sorghum Bicolor Computational Approach. 318-325 - P. Roushini Leely Pushpam, Padmapriea Sampath:
On Total Roman Domination in Graphs. 326-331 - P. Roushini Leely Pushpam, D. Yokesh:
Restrained Differential of a Graph. 332-340 - Saeid Alikhani, Samaneh Soltani:
The Distinguishing Number of Kronecker Product of Two Graphs. 341-346 - G. Samdanielthompson, N. Gnanamalar David, K. G. Subramanian:
Grammar Systems Based on Equal Matrix Rules and Alphabetic Flat Splicing. 347-356 - R. Sangeetha, Appu Muthusamy:
3-Simple 2-Fold 5-Cycle Systems. 357-361 - P. Saravanan, C. Sivapragasam, M. Nitin, Saminathan Balamurali, R. K. Ragul, S. Sundar Prakash, G. Selva Ganesan, V. Vel Murugan:
ANN-Based Bias Correction Algorithm for Precipitation in the Yarra River Basin, Australia. 362-370 - K. S. Savitha, M. R. Chithra, Ambat Vijayakumar:
Some Diameter Notions of the Generalized Mycielskian of a Graph. 371-382 - B. K. Sharma, Shambhu Sharan, S. P. Tiwari:
On Minimization of Deterministic Automaton with Rough Output. 383-391 - T. Subburaj, K. Suthendran, S. Arumugam:
Statistical Approach to Trace the Source of Attack Based on the Variability in Data Flows. 392-400 - B. Suganya, S. Arumugam:
Independent Resolving Number of Convex Polytopes. 401-408 - M. Sundarakannan, S. Arumugam:
Signed Cycle Domination in Planar Graphs. 409-414 - R. Sundarrajan, V. Vasudevan:
An Optimization Algorithm for Task Scheduling in Cloud Computing Based on Multi-Purpose Cuckoo Seek Algorithm. 415-424 - A. Tamil Elakkiya, Appu Muthusamy:
P_3 -Factorization of Triangulated Cartesian Product of Complete Graph of Odd Order. 425-434 - Tijo James, Paul Dorbec, Ambat Vijayakumar:
Further Progress on the Heredity of the Game Domination Number. 435-444 - S. Vanitha, C. Sivapragasam, N. V. N. Nampoothiri:
Modeling of Dissolved Oxygen Using Genetic Programming Approach. 445-452 - M. Venkatesulu, M. Ravi:
A Stream Cipher for Real Time Applications. 453-456
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.
last updated on 2026-04-27 01:20 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:
