default search action
Search dblp
Full-text search
- > Home
Please enter a search query
- case-insensitive prefix search: default
e.g., sig matches "SIGIR" as well as "signal" - exact word search: append dollar sign ($) to word
e.g., graph$ matches "graph", but not "graphics" - boolean and: separate words by space
e.g., codd model - boolean or: connect words by pipe symbol (|)
e.g., graph|network
Update May 7, 2017: Please note that we had to disable the phrase search operator (.) and the boolean not operator (-) due to technical problems. For the time being, phrase search queries will yield regular prefix search result, and search terms preceded by a minus will be interpreted as regular (positive) search terms.
Author search results
no matches
Venue search results
no matches
Refine list
refine by author
- no options
- temporarily not available
refine by venue
- no options
- temporarily not available
refine by type
- no options
- temporarily not available
refine by access
- no options
- temporarily not available
refine by year
- no options
- temporarily not available
Publication search results
found 58 matches
- 2017
- 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 [contents] - 2016
- Jessie Abraham, Micheal Arockiaraj:
Minimum Layout of Circulant Graphs into Certain Height Balanced Trees. ICTCSDM 2016: 90-97 - Saeid Alikhani, Samaneh Soltani:
The Distinguishing Number of Kronecker Product of Two Graphs. ICTCSDM 2016: 341-346 - A. Anu, S. Monikandan:
Degree Associated Reconstruction Number of Biregular Bipartite Graphs Whose Degrees Differ by at Least Two. ICTCSDM 2016: 1-9 - Olayiwola Babarinsa, Hailiza Kamarulhaili:
On Determinant of Laplacian Matrix and Signless Laplacian Matrix of a Simple Graph. ICTCSDM 2016: 212-217 - Ashok Kumar Das, Ritapa Chakraborty:
Forbidden Subgraphs of Bigraphs of Ferrers Dimension 2. ICTCSDM 2016: 38-49 - K. Kanchan Devi, S. Arumugam:
Probabilistic Conjunctive Grammar. ICTCSDM 2016: 119-127 - A. Tamil Elakkiya, Appu Muthusamy:
P_3 -Factorization of Triangulated Cartesian Product of Complete Graph of Odd Order. ICTCSDM 2016: 425-434 - P. Francis, S. Francis Raj:
Indicated Coloring of Cartesian Product of Graphs. ICTCSDM 2016: 63-68 - Aloysius Godinho, Tarkeshwar Singh, S. Arumugam:
On Nearly Distance Magic Graphs. ICTCSDM 2016: 76-82 - Purnima Gupta, Alka Goyal, Rajesh Singh:
Point-Set Domination in Graphs. VIII: Perfect and Efficient PSD Sets. ICTCSDM 2016: 300-304 - Purnima Gupta, Deepti Jain:
Independent 2-Point Set Domination in Graphs. ICTCSDM 2016: 281-288 - Purnima Gupta, Rajesh Singh:
On Graphs Whose Graphoidal Length Is Half of Its Size. ICTCSDM 2016: 289-299 - Purnima Gupta, Rajesh Singh, S. Arumugam:
Graphoidal Length and Graphoidal Covering Number of a Graph. ICTCSDM 2016: 305-311 - P. Hemalatha:
Evenly Partite Directed Bigraph Factorization of Wreath Product of Graphs. ICTCSDM 2016: 83-89 - Tijo James, Paul Dorbec, Ambat Vijayakumar:
Further Progress on the Heredity of the Game Domination Number. ICTCSDM 2016: 435-444 - J. Maria Jeyaseeli, Nazanin Movarraei, S. Arumugam:
Dominator Coloring of Generalized Petersen Graphs. ICTCSDM 2016: 144-151 - J. Julie, J. Baskar Babujee, V. Masilamani:
Dissecting Power of Certain Matrix Languages. ICTCSDM 2016: 98-105 - Nainarraj Kamatchi, Gurusamy Rengasamy Vijayakumar, A. Ramalakshmi, S. Nilavarasi, S. Arumugam:
Distance Antimagic Labelings of Graphs. ICTCSDM 2016: 113-118 - K. Kayathri, S. Vallirani:
(1, 2)-Domination in Graphs. ICTCSDM 2016: 128-133 - Arockiam Lourdusamy, F. Patrick:
New Construction on SD-Prime Cordial Labeling. ICTCSDM 2016: 134-143 - Anand Mahendran, Lakshmanan Kuppusamy:
Formal Language Representation and Modelling Structures Underlying RNA Folding Process. ICTCSDM 2016: 20-29 - G. Marimuthu, P. Krishnaveni:
Super Edge-Antimagic Gracefulness of Disconnected Graphs. ICTCSDM 2016: 152-155 - N. Kalai Mathi, S. Monikandan:
Degree Associated Reconstruction Number of Split Graphs with Regular Independent Set. ICTCSDM 2016: 106-112 - Abhisek Midya, Lakshmanan Kuppusamy, V. S. Sumitha, Alok Kumar Pani:
1-Normal DRA for Insertion Languages. ICTCSDM 2016: 10-19 - P. Mohanakrishnan, K. Suthendran, S. Arumugam, T. Panneerselvam:
Mixed Noise Elimination and Data Hiding for Secure Data Transmission. ICTCSDM 2016: 156-164 - 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. ICTCSDM 2016: 55-62 - V. Muneeswaran, M. Pallikonda Rajasekaran:
Analysis of Particle Swarm Optimization Based 2D FIR Filter for Reduction of Additive and Multiplicative Noise in Images. ICTCSDM 2016: 165-174 - B. Muthulakshmi, M. Venkatesulu:
Cloud Data Security Based on Data Partitions and Multiple Encryptions. ICTCSDM 2016: 191-196 - A. Muthuselvi, S. Arumugam:
Upper Majority Domination Number of a Graph. ICTCSDM 2016: 197-202
skipping 28 more matches
loading more results
failed to load more results, please try again later
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.
retrieved on 2024-10-06 18:58 CEST from data curated by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint