default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDHilda Assiyatun
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
[j17]Hilda Assiyatun, Maya Nabila
, Edy Tri Baskoro:
On Ramsey (C4, K1, n)-minimal graphs. Electron. J. Graph Theory Appl. 11(1): 149-154 (2023)- [j16]Muhammad Ridwan, Hilda Assiyatun, Edy Tri Baskoro:
The dominating partition dimension and locating-chromatic number of graphs. Electron. J. Graph Theory Appl. 11(2): 455-465 (2023) - 2022
- [j15]Maya Nabila, Hilda Assiyatun, Edy Tri Baskoro:
Ramsey minimal graphs for a pair of a cycle on four vertices and an arbitrary star. Electron. J. Graph Theory Appl. 10(1): 289 (2022) - 2020
- [j14]Hilda Assiyatun, Dian Kastika Syofyan, Edy Tri Baskoro:
Calculating an upper bound of the locating-chromatic number of trees. Theor. Comput. Sci. 806: 305-309 (2020)
2010 – 2019
- 2019
- [j13]Hilda Assiyatun, Budi Rahadjeng, Edy Tri Baskoro:
The connected size Ramsey number for matchings versus small disconnected graphs. Electron. J. Graph Theory Appl. 7(1): 113-119 (2019) - 2018
- [j12]Kristiana Wijaya, Edy Tri Baskoro, Hilda Assiyatun, Djoko Suprijanto:
On Ramsey (4K2, P3)-minimal graphs. AKCE Int. J. Graphs Comb. 15(2): 174-186 (2018) - 2017
- [j11]Kristiana Wijaya, Edy Tri Baskoro, Hilda Assiyatun, Djoko Suprijanto:
On Ramsey (mK2,H)-Minimal Graphs. Graphs Comb. 33(1): 233-243 (2017) - 2015
- [j10]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) - [j9]Kristiana Wijaya, Edy Tri Baskoro, Hilda Assiyatun, Djoko Suprijanto:
The complete list of Ramsey (2K2, K4)-minimal graphs. Electron. J. Graph Theory Appl. 3(2): 216-227 (2015) - [j8]Rismawati Ramdani, A. N. M. Salman, Hilda Assiyatun, Andrea Semanicová-Fenovcíková, Martin Baca:
Total Irregularity Strength of Three Families of Graphs. Math. Comput. Sci. 9(2): 229-237 (2015) - [c9]Kristiana Wijaya, Edy Tri Baskoro, Hilda Assiyatun, Djoko Suprijanto:
On Unicyclic Ramsey (mK2, P3)-Minimal Graphs. ICGTIS 2015: 10-14 - [c8]Desi Rahmadani, Edy Tri Baskoro, Hilda Assiyatun:
On Ramsey Minimal Graphs for the Pair Paths. ICGTIS 2015: 15-20 - [c7]Budi Rahadjeng, Edy Tri Baskoro, Hilda Assiyatun:
Connected Size Ramsey Numbers for Matchings versus Cycles or Paths. ICGTIS 2015: 32-37 - [c6]Dian Kastika Syofyan, Edy Tri Baskoro, Hilda Assiyatun:
The Locating-Chromatic Number of Binary Trees. ICGTIS 2015: 79-83 - [c5]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 - [c4]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 - 2013
- [j7]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
- [c3]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 - 2010
- [j6]I Wayan Sudarsana, Hilda Assiyatun, Adiwijaya, Selvy Musdalifah:
The Ramsey Number for a Linear Forest versus Two identical Copies of Complete Graphs. Discret. Math. Algorithms Appl. 2(4): 437-444 (2010)
2000 – 2009
- 2009
- [j5]Hilda Assiyatun, William Duckworth:
Small maximal matchings of random cubic graphs. J. Graph Theory 62(4): 293-323 (2009) - 2008
- [j4]Hasmawati, Edy Tri Baskoro, Hilda Assiyatun:
The Ramsey numbers for disjoint unions of graphs. Discret. Math. 308(10): 2046-2049 (2008) - 2007
- [c2]Hasmawati, Hilda Assiyatun, Edy Tri Baskoro, A. N. M. Salman:
Ramsey Numbers on a Union of Identical Stars Versus a Small Cycle. KyotoCGGT 2007: 85-89 - 2006
- [j3]Edy Tri Baskoro, Hasmawati, Hilda Assiyatun:
The Ramsey numbers for disjoint unions of trees. Discret. Math. 306(24): 3297-3301 (2006) - [j2]Hilda Assiyatun, Nicholas C. Wormald:
3-star factors in random d-regular graphs. Eur. J. Comb. 27(8): 1249-1262 (2006) - 2003
- [c1]Hilda Assiyatun:
Maximum Induced Matchings of Random Regular Graphs. IJCCGGT 2003: 44-57 - 2000
- [j1]Hilda Assiyatun, Nicholas C. Wormald:
Covering regular graphs with forests of small trees. Australas. J Comb. 22: 219-226 (2000)
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-08-05 20:19 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:
