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 34 matches
- 2015
- Amrullah, Edy Tri Baskoro, Rinovia Simanjuntak, Saladin Uttunggadewa:
The Partition Dimension of a Subdivision of a Complete Graph. ICGTIS 2015: 53-59 - K. Ida Bagus Kade Puja Arimbawa, Edy Tri Baskoro:
Partition Dimension of Some Classes of Trees. ICGTIS 2015: 67-72 - S. Arumugam, B. Jayaram, Krishnaiyan Thulasiraman:
Independent Dominator Sequence Number of a Graph. ICGTIS 2015: 43-46 - S. Arumugam, J. Saral:
Identification of Bottleneck Elements in Cellular Manufacturing Problem. ICGTIS 2015: 181-185 - Widi Astuti, Adiwijaya:
Graph Coloring Based on Evolutionary Algorithms to Support Data Hiding Scheme on Medical Images. ICGTIS 2015: 173-177 - P. Jeya Bala Chitra, S. Arumugam:
Resolving Sets without Isolated Vertices. ICGTIS 2015: 38-42 - Dafik, A. K. Purnapraja, R. Hidayat:
Cycle-Super Antimagicness of Connected and Disconnected Tensor Product of Graphs. ICGTIS 2015: 93-99 - Ketut Queena Fredlina, Edy Tri Baskoro:
The Partition Dimension of Some Families of Trees. ICGTIS 2015: 60-66 - Debi Oktia Haryeni, Edy Tri Baskoro:
Partition Dimension of Some Classes of Homogenous Disconnected Graphs. ICGTIS 2015: 73-78 - Diari Indriati, Widodo, Indah Emilia Wijayanti, Kiki Ariyanti Sugeng:
On Total Irregularity Strength of Double-Star and Related Graphs. ICGTIS 2015: 118-123 - Daniel A. Krismanto, Suhadi Wido Saputro:
Fractional Metric Dimension of Tree and Unicyclic Graph. ICGTIS 2015: 47-52 - Irvania Sukma Kumala, A. N. M. Salman:
The Rainbow Connection Number of a Flower (Cm, Kn) Graph and a Flower (C3, Fn) Graph. ICGTIS 2015: 168-172 - Nacho López, Hebert Pérez-Rosés:
Degree/diameter Problem for Mixed Graphs. ICGTIS 2015: 2-9 - Anie Lusiani, Syafrizal Sy, Edy Tri Baskoro, Chula J. Jayawardene:
On Size Multipartite Ramsey Numbers for Stars versus Cycles. ICGTIS 2015: 27-31 - S. Nabila, A. N. M. Salman:
The Rainbow Connection Number of Origami Graphs and Pizza Graphs. ICGTIS 2015: 162-167 - Ira Apni Purwasih, Edy Tri Baskoro, Hilda Assiyatun, Djoko Suprijanto:
The Bounds on the Locating-Chromatic Number for a Subdivision of a Graph on One Edge. ICGTIS 2015: 84-88 - Budi Rahadjeng, Edy Tri Baskoro, Hilda Assiyatun:
Connected Size Ramsey Numbers for Matchings versus Cycles or Paths. ICGTIS 2015: 32-37 - Budi Rahardjo, Kuspriyanto, Intan Muchtadi-Alamsyah, Marisa W. Paryasto:
Information Concealment Through Noise Addition. ICGTIS 2015: 178-180 - Desi Rahmadani, Edy Tri Baskoro, Hilda Assiyatun:
On Ramsey Minimal Graphs for the Pair Paths. ICGTIS 2015: 15-20 - Rismawati Ramdani, A. N. M. Salman, Hilda Assiyatun:
An Upper Bound On the Total Vertex Irregularity Strength of the Cartesian Product of P2 and an Arbitrary Regular Graph. ICGTIS 2015: 105-111 - D. Resty, A. N. M. Salman:
The Rainbow Connection Number of an n-Crossed Prism Graph and its Corona Product with a Trivial Graph. ICGTIS 2015: 143-150 - Fendy Septyanto, Kiki Ariyanti Sugeng:
On the Rainbow and Strong Rainbow Connection Numbers of the m-Splitting of the Complete Graph Kn. ICGTIS 2015: 155-161 - Denny Riama Silaban, Edy Tri Baskoro, Saladin Uttunggadewa:
On The Restricted Size Ramsey Number. ICGTIS 2015: 21-26 - Denny Riama Silaban, Hikmatiarahmah Kekaleniate, Siti Lutpiah, Kiki Ariyanti Sugeng, Edy Tri Baskoro:
Algorithm to Construct Graph with Total Vertex Irregularity Strength Two. ICGTIS 2015: 132-137 - Dian N. S. Simamora, A. N. M. Salman:
The Rainbow (Vertex) Connection Number of Pencil Graphs. ICGTIS 2015: 138-142 - Bety Hayat Susanti, A. N. M. Salman, Rinovia Simanjuntak:
Upper Bounds for Rainbow 2-Connectivity of the Cartesian Product of a Path and a Cycle. ICGTIS 2015: 151-154 - Susilawati, Edy Tri Baskoro, Rinovia Simanjuntak:
Total Vertex-Irregularity Labelings for Subdivision of Several Classes of Trees. ICGTIS 2015: 112-117 - Dian Kastika Syofyan, Edy Tri Baskoro, Hilda Assiyatun:
The Locating-Chromatic Number of Binary Trees. ICGTIS 2015: 79-83 - Meilin I. Tilukay, A. N. M. Salman, E. R. Persulessy:
On the Total Irregularity Strength of Fan, Wheel, Triangular Book, and Friendship Graphs. ICGTIS 2015: 124-131 - Des Welyyanti, Edy Tri Baskoro, Rinovia Simanjuntak, Saladin Uttunggadewa:
On Locating-chromatic Number for Graphs with Dominant Vertices. ICGTIS 2015: 89-92
skipping 4 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-09-21 11:14 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