default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDSaladin Uttunggadewa
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j7]Sigit Pancahayani, Rinovia Simanjuntak, Saladin Uttunggadewa:
Magic labeling on graphs with ascending subgraph decomposition. Electron. J. Graph Theory Appl. 12(2): 189-203 (2024)- 2020
- [j6]Denny Riama Silaban, Edy Tri Baskoro, Saladin Uttunggadewa:
On the restricted size Ramsey number for P3 versus dense connected graphs. Electron. J. Graph Theory Appl. 8(2): 383-389 (2020)
2010 – 2019
- 2019
- [j5]Edy Tri Baskoro, Denny Riama Silaban
, Saladin Uttunggadewa:
On the restricted size Ramsey number involving a path P3. Discuss. Math. Graph Theory 39(3): 757-769 (2019) - 2017
- [j4]Denny Riama Silaban, Edy Tri Baskoro, Saladin Uttunggadewa:
Restricted size Ramsey number for path of order three versus graph of order five. Electron. J. Graph Theory Appl. 5(1): 155-162 (2017) - 2015
- [j3]I Wayan Sudarsana, Hilda Assiyatun, Saladin Uttunggadewa, Edy Tri Baskoro:
On the Ramsey Numbers R(S2, m, K2, q) and R(sK2, Ks+Cn). Ars Comb. 119: 235-246 (2015) - [c8]Denny Riama Silaban, Edy Tri Baskoro, Saladin Uttunggadewa:
On The Restricted Size Ramsey Number. ICGTIS 2015: 21-26 - [c7]Amrullah, Edy Tri Baskoro, Rinovia Simanjuntak, Saladin Uttunggadewa:
The Partition Dimension of a Subdivision of a Complete Graph. ICGTIS 2015: 53-59 - [c6]Des Welyyanti, Edy Tri Baskoro, Rinovia Simanjuntak, Saladin Uttunggadewa:
On Locating-chromatic Number for Graphs with Dominant Vertices. ICGTIS 2015: 89-92 - [i1]Gabriel A. Barragán-Ramírez, Rinovia Simanjuntak, Saladin Uttunggadewa, Suhadi Wido Saputro:
Local metric dimension of subgraph-amalgamation of graphs. CTW 2015: 285-288 - 2014
- [c5]Rinovia Simanjuntak, Saladin Uttunggadewa, Suhadi Wido Saputro:
Metric Dimension for Amalgamations of Graphs. IWOCA 2014: 330-337 - 2013
- [j2]Suhadi Wido Saputro, Rinovia Simanjuntak, Saladin Uttunggadewa, Hilda Assiyatun, Edy Tri Baskoro, A. N. M. Salman, Martin Baca:
The metric dimension of the lexicographic product of graphs. Discret. Math. 313(9): 1045-1051 (2013) - 2011
- [c4]Suhadi Wido Saputro, Rinovia Simanjuntak, Saladin Uttunggadewa, Hilda Assiyatun, Edy Tri Baskoro, A. N. M. Salman:
On graph of order-n with the metric dimension n-3. CTW 2011: 239-243
2000 – 2009
- 2009
- [j1]I Wayan Sudarsana, Edy Tri Baskoro, Saladin Uttunggadewa, D. Ismaimuza:
An Expansion Technique on Super Edge-Magic Total Graphs. Ars Comb. 91 (2009) - 2007
- [c3]Ngurah Anak Agung Gede, Edy Tri Baskoro, Rinovia Simanjuntak, Saladin Uttunggadewa:
On Super Edge-Magic Strength and Deficiency of Graphs. KyotoCGGT 2007: 144-154 - 2003
- [c2]Yus Mochamad Cholily, Edy Tri Baskoro, Saladin Uttunggadewa:
Some Conditions for the Existence of ( d, k)-Digraphs. IJCCGGT 2003: 87-93 - [c1]Surahmat, Edy Tri Baskoro, Saladin Uttunggadewa, Hajo Broersma:
An Upper Bound for the Ramsey Number of a Cycle of Length Four Versus Wheels. IJCCGGT 2003: 181-184
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-11-25 23:44 CET 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:
