Covering regular graphs with forests of small trees. - Hilda Assiyatun; Nicholas C. Wormald (Australas. J Comb., 2000)

Maximum Induced Matchings of Random Regular Graphs. - Hilda Assiyatun (IJCCGGT, 2003)

The Ramsey numbers for disjoint unions of trees. - Edy Tri Baskoro; Hasmawati; Hilda Assiyatun (Discret. Math., 2006)

3-star factors in random d-regular graphs. - Hilda Assiyatun; Nicholas C. Wormald (Eur. J. Comb., 2006)

Ramsey Numbers on a Union of Identical Stars Versus a Small Cycle. - Hasmawati; Hilda Assiyatun; Edy Tri Baskoro; A. N. M. Salman (KyotoCGGT, 2007)

The Ramsey numbers for disjoint unions of graphs. - Hasmawati; Edy Tri Baskoro; Hilda Assiyatun (Discret. Math., 2008)

Small maximal matchings of random cubic graphs. - Hilda Assiyatun; William Duckworth (J. Graph Theory, 2009)

The Ramsey Number for a Linear Forest versus Two identical Copies of Complete Graphs. - I Wayan Sudarsana; Hilda Assiyatun; Adiwijaya; Selvy Musdalifah (Discret. Math. Algorithms Appl., 2010)

On graph of order-n with the metric dimension n-3. - Suhadi Wido Saputro; Rinovia Simanjuntak; Saladin Uttunggadewa; Hilda Assiyatun; Edy Tri Baskoro; A. N. M. Salman (CTW, 2011)

The metric dimension of the lexicographic product of graphs. - Suhadi Wido Saputro; Rinovia Simanjuntak; Saladin Uttunggadewa; Hilda Assiyatun; Edy Tri Baskoro; A. N. M. Salman; Martin Baca (Discret. Math., 2013)

The Bounds on the Locating-Chromatic Number for a Subdivision of a Graph on One Edge. - Ira Apni Purwasih; Edy Tri Baskoro; Hilda Assiyatun; Djoko Suprijanto (ICGTIS, 2015)

Connected Size Ramsey Numbers for Matchings versus Cycles or Paths. - Budi Rahadjeng; Edy Tri Baskoro; Hilda Assiyatun (ICGTIS, 2015)

On Ramsey Minimal Graphs for the Pair Paths. - Desi Rahmadani; Edy Tri Baskoro; Hilda Assiyatun (ICGTIS, 2015)

An Upper Bound On the Total Vertex Irregularity Strength of the Cartesian Product of P2 and an Arbitrary Regular Graph. - Rismawati Ramdani; A. N. M. Salman; Hilda Assiyatun (ICGTIS, 2015)

The Locating-Chromatic Number of Binary Trees. - Dian Kastika Syofyan; Edy Tri Baskoro; Hilda Assiyatun (ICGTIS, 2015)

On Unicyclic Ramsey (mK2, P3)-Minimal Graphs. - Kristiana Wijaya; Edy Tri Baskoro; Hilda Assiyatun; Djoko Suprijanto (ICGTIS, 2015)

On the Ramsey Numbers R(S2, m, K2, q) and R(sK2, Ks+Cn). - I Wayan Sudarsana; Hilda Assiyatun; Saladin Uttunggadewa; Edy Tri Baskoro (Ars Comb., 2015)

The complete list of Ramsey (2K2, K4)-minimal graphs. - Kristiana Wijaya; Edy Tri Baskoro; Hilda Assiyatun; Djoko Suprijanto (Electron. J. Graph Theory Appl., 2015)

Total Irregularity Strength of Three Families of Graphs. - Rismawati Ramdani; A. N. M. Salman; Hilda Assiyatun; Andrea Semanicová-Fenovcíková; Martin Baca (Math. Comput. Sci., 2015)

On Ramsey (mK2,H)-Minimal Graphs. - Kristiana Wijaya; Edy Tri Baskoro; Hilda Assiyatun; Djoko Suprijanto (Graphs Comb., 2017)

On Ramsey (4K2, P3)-minimal graphs. - Kristiana Wijaya; Edy Tri Baskoro; Hilda Assiyatun; Djoko Suprijanto (AKCE Int. J. Graphs Comb., 2018)

The connected size Ramsey number for matchings versus small disconnected graphs. - Hilda Assiyatun; Budi Rahadjeng; Edy Tri Baskoro (Electron. J. Graph Theory Appl., 2019)

Calculating an upper bound of the locating-chromatic number of trees. - Hilda Assiyatun; Dian Kastika Syofyan; Edy Tri Baskoro (Theor. Comput. Sci., 2020)

Ramsey minimal graphs for a pair of a cycle on four vertices and an arbitrary star. - Maya Nabila; Hilda Assiyatun; Edy Tri Baskoro (Electron. J. Graph Theory Appl., 2022)

On Ramsey (C4, K1, n)-minimal graphs. - Hilda Assiyatun; Maya Nabila; Edy Tri Baskoro (Electron. J. Graph Theory Appl., 2023)

The dominating partition dimension and locating-chromatic number of graphs. - Muhammad Ridwan; Hilda Assiyatun; Edy Tri Baskoro (Electron. J. Graph Theory Appl., 2023)