Publications


The following our publications in Optimal Directed Networks, Ramsey Theory, Graph Labeling, Hamiltonian Graphs,  and Metric, Partition Dimensions of Graphs.
   
International Publications 
  1. K. WIjaya, E.T. Baskoro, H. Assiyatun, D. Suprijanto, On Ramsey (4K2,P3)-minimal graphs, AKCE International Journal of Graphs and Combinatorics 15 (2) (2018), 174-186.
  2. D.R. Silaban, E.T. Baskoro, S. Uttunggadewa, Restricted size Ramsey number for 2K2 versus Dese connected graphs of order six, IOP Conf. Series: Journal of Physics: Conf. Series 1008 (2018) 012034, doi:10.1088/1742-6596/1008/1/012034.
  3. Susilawati, E.T. Baskoro, R. Simanjuntak, J. Ryan, On the vertex irregular total labelling for subdivision of trees, Australas. J. Combin. 71 (2) (2018), 293-302.
  4. A. Lusiani, S. Sy, E.T. Baskoro, C. Jayawardene, On Size Multipartite Ramsey Numbers for Stars versus Cycles, Procedia Computer Science 74 (2015), 27-31.
  5. B. Rahadjeng, E.T. Baskoro, H. Assiyatun, Connected Size Ramsey Numbers for Matchings versus Cycles or Paths, Procedia Computer Science 74 (2015), 32-37.
  6. Amrullah, E.T. Baskoro, R. Simanjuntak, S. Uttunggadewa, The Partition Dimension of a Subdivision of a Complete Graph, Procedia Computer Science 74 (2015), 53-59.
  7. K.Q. Fredlina, E.T. Baskoro, The Partition Dimension of Some Families of Trees, Procedia Computer Science 74 (2015), 60-66.
  8.  Ida Bagus Kade Puja Arimbawa K., E.T. Baskoro, Partition Dimension of Some Classes of Trees, Procedia Computer Science 74 (2015), 67-72.
  9. D.O. Haryeni, E.T. Baskoro, Partition Dimension of Some Classes of Homogenous Disconnected Graphs, Procedia Computer Science 74 (2015), 73-78.
  10. D.K. Syofyan, E.T. Baskoro, H. Assiyatun, The Locating-Chromatic Number of Binary Trees, Procedia Computer Science 74 (2015), 79-83.
  11. I.A. Purwasih, E.T. Baskoro, H. Assiyatun, D. Suprijanto, The Bounds on the Locating-Chromatic Number for a Subdivision of a Graph on One Edge, Procedia Computer Science 74 (2015), 84-88.
  12. D. Welyyanti, E.T. Baskoro, R. Simanjuntak, S. Uttunggadewa, On Locating-Chromatic Number for Graphs with Dominant Vertices, Procedia Computer Science 74 (2015), 89-92.
  13. Susilawati, E.T. Baskoro, R. Simanjuntak, Total Vertex-Irregularity Labelings for Subdivision of Several Classes of Trees, Procedia Computer Science 74 (2015), 112-117.
  14.  D.R. Silaban, H. Kekaleniate, S. Lutpiah, K.A. Sugeng, E.T. Baskoro, Algorithm to Construct Graph with Total Vertex Irregularity Strength Two, Procedia Computer Science 74 (2015), 132-137.
  15. Hadi Muhshi, Edy Tri Baskoro, Matching-star Ramsey minimal graphs, Mathematics in Computer Science 9 (2015), 443-452.
  16. I W. Sudarsana, H. Assiyatun, S. Uttunggadewa, E.T. Baskoro, On the Ramsey numbers R(S2,m, K2,q) and R(sK2, Ks+Cn), Ars Combin. 119 (2015), 235-246.
  17. T.K. Maryati, E.T. Baskoro, A.N.M. Salman, Irawati, On the path- (super) magicness of cycles with some pendants, Utilitas Math. 96 (2015), 319-330.
  18. Edy Tri Baskoro, Kristiana Wijaya, On Ramsey (2K2,K4)-Minimal Graphs, Mathematics in the 21st Century, Springer Proceedings in Mathematics & Statistics 98 (2015), 11-17.
  19. H.A. Ganie, S. Pirzada, E.T. Baskoro, On energy, Laplacian energy and p-fold graphs, Electronic Journal of Graph Theory and Applications 3 (1) (2015), 94-107.
  20. Amrullah, Darmaji, E.T. Baskoro, The partition dimension of homogeneous firecrackers, Far East J. Appl. Math. 90 (1) (2015), 77-98.
  21. Des Welyyanti, E.T. Baskoro, R. Simanjuntak, S. Uttuggadewa, The locating-chromatic number of disconnected graphs, Far East J. Math. Sci. 94:2 (2014), 169--182
  22. M. Imran, A.Q. Baig, S.A. Bokhary, E.T. Baskoro, New classes of convex polytopes with constant metric dimension, Utilitas Mathematica 95 (2014), 97-111.
  23. A.Q. Baig, Edy Tri Baskoro and Andrea Semanicova-Fenovcikova, On the super edge-magic deficiency of a star forest, Ars Combinatoria 115 (2014), 3-12.
  24. M.K. Siddiqui, Nurdin, E.T. Baskoro, Total edge irregularity strength of the disjoint union of Helm graphs, J. Math. Fundam. Sci. 45A (2013), No. 2, 163--171.
  25. E.T. Baskoro, and Asmiati, Characterizing all trees with locating-chromatic number 3, Electronic Journal of Graph Theory and Applications I(2) (2013), 109--117.
  26. D.K. Syofyan, E.T. Baskoro, H. Assiyatun, On the locating-chromatics number of homogeneous lobster, AKCE Int. J. Graphs Combin. 10:3 (2013), 245-252.
  27. D. Welyyanti, E.T. Baskoro, R. Simanjuntak, S. Uttunggadewa, On locating-chromatic number of complete n-ary tree, AKCE Int. J. Graphs Combin.  10:3 (2013), 309-315.
  28. M. Miller, Slamin, J. Ryan, E.T. Baskoro, Construction techniques for digraphs with minimum diameter, LNCS (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) 8288 (2013), 327-336.
  29. Amrullah, H. Assiyatun, E.T. Baskoro, S. Uttunggadewa, R. Simanjuntak, The partition dimension for a subdivision of homogeneous caterpillars, AKCE Int. J. Graphs Combin. 10:3 (2013), 317-325.
  30. I.A. Purwasih, E.T. Baskoro, H. Assiyatun, W. Djohan, The locating-chromatic number for a subdivision of a wheel on one cycle edge, AKCE Int. J. Graphs Combin. 10:3 (2013), 327-336.
  31. M. Roswitha, E.T. Baskoro, T.K. Maryati, N.A. Kurdhi, I. Susanti, Further results on cycle-supermagic labeling, AKCE Int. J. Graphs Combin.  10:2 (2013), 211-220.
  32. S.W. Saputro, R. Simanjuntak, S. Uttunggadewa, H. Assiyatun, E.T. Baskoro, A.N.M. Salman, M. Baca, The metric dimension of the lexicographic product of graphs, Discrete Mathematics, 313:9 (2013), 1045-1051.
  33. T.K. Maryati, A.N.M. Salman, E.T. Baskoro, Supermagic coverings of the disjoint union of graphs and amalgamations, Discrete Mathematics 313:4 (2013), 397-405.
  34. E.T. Baskoro, I.A. Purwasih, The locating chromatic number for corona product of graphs, Southeast Asian Journal of Sciences, 1:1 (2012), 126-136.
  35. Ahmad, E.T. Baskoro, M. Imran, Total vertex irregularity strength of disjoint union of helm graphs, Discussiones Mathematicae – Graph Theory 32:3 (2012), 427-434.
  36. Dedy Tatanta, Edy Tri Baskoro, On Ramsey (2K2, 2Pn)-Minimal Graphs, AIP Conf. Proc. 1450 (2012), 90-95.
  37. Hadi Muhshi, Edy Tri Baskoro, On Ramsey (3K2, P3)-minimal graphs, AIP Conf. Proc. 1450 (2012), 110-117.
  38. Mania Roswitha, Edy Tri Baskoro, H-magic coverings on some classes of graphs, AIP Conf. Proc. 1450 (2012), 135-138.
  39. Syafrizal Sy, Edy Tri Baskoro, A lower bound of the size multipartite Ramsey number mj(Pn, Kjxb), AIP Conf. Proc. 1450 (2012), 259-261.
  40. Ira Apni Purwasih, Edy Tri Baskoro, The Locating Chromatic Number of Certain Halin Graphs, AIP Conf. Proc. 1450 (2012), 342-345.
  41. Asmiati, Edy Tri Baskoro, Characterizing all graphs containing cycles with locating-chromatic number 3, AIP Conf. Proc. 1450 (2012), 351-357.
  42. M. Hussain, E.T. Baskoro, K. Ali, On super antimagic total labeling of Harary graph, Ars Combinatoria 104 (2012), 225-233.
  43. Asmiati, E.T. Baskoro, H. Assiyatun, D. Suprijanto, R. Simanjuntak, S. Uttunggadewa, The locating-chromatics number of firecracker graphs, Far East Journal of Mathematical Sciences 63:1 (2012), 11-23.
  44. E.T. Baskoro, L. Yulianti, Ramsey minimal graphs for 2K2 versus Pn, Advances and Application in Discrete Mathematics 8:2 (2011), 83-90.
  45. A.Q. Baig, A. Ahmad, E.T. Baskoro, R. Simanjuntak, On the super edge-magic deficiency of forests, Utilitas Mathematics 86 (2011) 147-159.
  46. Adiwijaya, A.N.M. Salman, Djoko Suprijanto, Edy Tri Baskoro, A characterization of the corona product of a cycle with some graphs based on its f-chromatic index, AIP Conf. Proc. 1450 (2012), 155-158.
  47. Darmaji, Edy Tri Baskoro, Further results on partition dimension of corona products, AIP Conf. Proc. 1450 (2012), 77-81.
  48. Edy Tri Baskoro, Darmaji, The partition dimension of corona product of two graphs, Far East Journal of Mathematical Sciences, 66:2 (2012), 181-196.
  49. D.R. Silaban, E.T. Baskoro, S. Uttunggadewa, On the Restricted Size Ramsey Number, Procedia Computer Science 74 (2015), 21-26.
  50. D. Rahmadani, E.T. Baskoro, H. Assiyatun, On Ramsey Minimal Graphs for the Pair Paths, Procedia Computer Science 74 (2015), 15-20. 
  51. K. Wijaya, E.T. Baskoro, H. Assiyatun, D. Suprijanto, On unicyclic Ramsey (mK2,P3)-minimal graphs, Procedia Computer Science 74 (2015), 10-14.
  52. Des Welyyanti, Rinovia Simanjuntak, Saladin Uttunggadewa, Edy Tri Baskoro, Locating-chromatic number for a graph of two components, AIP Conf. Proc. 1707, 020024 (2016), 10.1063/1.4940825
  53. Ira Apni Purwasih, Edy Tri Baskoro, Hilda Assiyatun, D. Suprijanto, The locating-coloring on Halin graphs with a certain number of inner faces, AIP Conf. Proc. 1707, 020014 (2016), 10.1063/1.4940815
  54. Budi Rahajeng, Edy Tri Baskoro, Hilda Assiyatun, Connected size ramsey numbers of matchings and stars, AIP Conf. Proc. 1707, 020015 (2016), 10.1063/1.4940816
  55. Dian Kastika Syofyan, Edy Tri Baskoro, Hilda Assiyatun, The locating-chromatic number of trees embedded in 2-dimensional grid, AIP Conf. Proc. 1707, 020023 (2016), 10.1063/1.4940824
  56. Denny Riama Silaban, Edy Tri Baskoro, Saladin Uttunggadewa, Restricted size Ramsey number for P3 versus small paths, AIP Conf. Proc. 1707, 020020 (2016), 10.1063/1.4940821
  57. Anie Lusiani, Edy Tri Baskoro, On size tripartite Ramsey numbers of P3 versus mK1,n, AIP Conf. Proc. 1707, 020010 (2016), 10.1063/1.4940811.
  58. Amrullah, Edy Tri Baskoro, Saladin Uttunggadewa, Rinovia Simanjuntak, The partition dimension of subdivision of a graph, AIP Conf. Proc. 1707, 020001 (2016), 10.1063/1.4940802.
  59. Desi Rahmadani, Edy Tri Baskoro, Hilda Assiyatun, On Ramsey (P3,P6)-minimal graphs, AIP Conf. Proc. 1707, 020016 (2016), 10.1063/1.4940817.
  60. Susilawati, Edy Tri Baskoro, Rinovia Simanjuntak, Total vertex irregularity strength of trees with maximum degree four, AIP Conf. Proc. 1707, 020022 (2016), 10.1063/1.4940823.
  61. K. Wijaya, E.T. Baskoro, H. Assiyatun, D. Suprijanto, On connected Ramsey (3K2,K3)-minimal graphs, AIP Conf. Proc. 1707, 020025 (2016); 10.1063/1.4940826.
  62. Ketut Queena Fredlina dan Edy Tri Baskoro, Some trees with partition dimension three, AIP Conf. Proc. 1707, 020006 (2016); 10.1063/1.4940807.
  63. Ida Bagus Kade Puja Arimbawa K. dan Edy Tri Baskoro, On some trees having partition dimension four, AIP Conf. Proc. 1707, 020002 (2016); 10.1063/1.4940803.
  64. Dian Kastika Syofyan, Edy Tri Baskoro, Hilda Assiyatun, Trees with certain locating-chromatic number, J. Math. Fund. Sci., Vol. 48: 1 (2016), 39-47.
  65. Edy Tri Baskoro, Some open problems of Ramsey minimal graphs, Springer Proc. Math. Stat. 148 (2016), 279-280.
  66. Enik Noviani, Edy Tri Baskoro, On the Ramsey number of 4-cycle versus wheel, Indonesian Journal of Combinatorics 1(1) (2016), 9-21.
  67. K. Wijaya, E.T. Baskoro, On Ramsey (2K2,2H)-minimal graphs, Springer Proc. Math. Stat. 186 (2016), 219-225.
  68. D.R. Silaban, E.T. Baskoro, S. Uttunggadewa, Restricted size Ramsey number for P3 versus dense connected graphs of order six, AIP Conf. Proc. 1862, 030136 (2017); DOI: http://dx.doi.org/10.1063/1.4991240.
  69. A. Lusiani, E.T. Baskoro, S.W. Saputro, On size multipartite Ramsey numbers for stars versus paths and cycles, Electronic Journal of Graph Theory and Applications 5 (1) (2017), 43-50.
  70. D.R. Silaban, E.T. Baskoro, S. Uttunggadewa, Restricted size Ramsey number for path of order three versus graph of order five, Electronic Journal of Graph Theory and Applications 5 (1) (2017), 155-162.
  71. D.O. Haryeni, E.T. Baskoro, S.W. Saputro, On the partition dimension of disconnected graphs, J. Math. Fund. Sci. 49 (1) (2017), 18-32.
  72. K. Wijaya, E.T. Baskoro, H. Assiyatun, D. Suprijanto, On Ramsey (mK2,H)-minimal graphs, Graphs and Combinatorics 33 (1) 2017, 233-243, DOI: 10.1007/s00373-016-1748-1.
  73. Des Welyyanti, Edy Tri Baskoro, Rinovia Simanjuntak, Saladin Uttunggadewa, On the locating-chromatic number for graphs with two homogeneous components, IOP Conf. Series: Journal of Physics: Conf. Series 893  (2017) 012040 doi :10.1088/1742-6596/893/1/012040
  74. M. Baca, E.T. Baskoro, L. Brankovic, Slamin, K.A. Sugeng, A Survey of face-antimagic evaluations of graphs, Australas. J. Combin. 69 (3) (2017), 382-393.
  75. Budi Rahajeng, E.T. Baskoro, H. Assiyatun, Connected size Ramsey number for matching vs. small stars or cycles, Proc. Indian Acad. Sci. (Math. Sci.), 2017, http://doi.org/10.1007/s12044-017-0366-z.
  76. D.O. Haryeni, E.T. Baskoro, S.W. Saputro, M. Baca, A. Semanicova-Fenovcikova, On the partition dimension of two-component graphs, Proc. Indian Acad. Sci. (Math. Sci.), http://doi.org/10.1007/s12044-017-0363-2.
  77. D. Rahmadani, E.T. Baskoro, M. Baca, H. Assiyatun, A. Semanicova-Fenovcikova, Some infinite families of Ramsey (P3,Pn)-minimal trees, Proc. Indian Acad. Sci. (Math. Sci.), http://doi.org/10.1007/s12044-017-0361-4.
  78. H. Iswadi, E.T. Baskoro, R. Simanjuntak, On the metric dimension of corona product of graphs, Far East Journal of Mathematical Sciences (FJMS), 52:2 (2011), 155-170.
  79. A.A.G. Ngurah, E.T. Baskoro, I. Tomescu, Magic graphs with pendant edges, Ars Combinatoria, 99 (2011), 149-160.
  80. T. Vetrik, R. Simanjuntak, E.T. Baskoro, Large bipartite Cayley graphs of given degree and diameter, Discrete Mathematics, 311 (2011), 324-326.
  81.  M. Baca, E.T. Baskoro, A.N.M. Salman, S.W. Saputro, D. Suprijanto, The metric dimension of regular bipartite graphs, Bull. Math. Soc. Sci. Roumanie, Tome 54 (102) No. 1, (2011), 15-28.
  82. Asmiati, H. Assiyatun, E.T. Baskoro, Locating-chromatic number of amalgamation of stars, ITB Journal of Sciences, 43A:1 (2011)
  83. I Wayan Sudarsana, E.T. Baskoro, H. Assiyatun, S. Uttunggadewa, The Ramsey numbers for the union graph with H-good components, Far East Journal on Mathematical Sciences 39:1 (2010), 29-40.
  84. K. Ali, E.T. Baskoro, I. Tomescu, On the Ramsey number for paths and beaded wheels, Journal of Prime Research in Mathematics 5 (2009), 133-138.
  85. K. Ali, A.Q. Baiq, E.T. Baskoro, On the Ramsey number for a linear forest versus a cocktail party graph, J. Combin. Math. Combin. Comput. 71 (2009), 173-177.
  86. Nurdin, A.N.M. Salman, N.N. Gaos, E.T. Baskoro, On the total vertex-irregular strength of a disjoint union of t copies of a path, J. Combin. Math. Combin. Comput. 71 (2009), 227- 233.
  87. I Wayan Sudarsana, E.T. Baskoro, H. Assiyatun, S. Uttunggadewa, The Ramsey number of a certain forest respect to a small wheel, J. Combin. Math. Combin. Comput. 71 (2009), 257 - 264.
  88. Darmaji, S. Uttunggadewa, R. Simanjuntak, E.T. Baskoro, The partition dimension of a complete multipartite graph, a special caterpillar and a windmill, J. Combin. Math. Combin. Comput. 71 (2009), 209-215.
  89. Adiwijaya, A.N.M. Salman, D. Suprijanto, E.T. Baskoro, On f-colorings of the corona product of cycles with some other graphs, J. Combin. Math. Combin. Comput. 71 (2009), 235-241.
  90. Syafrizal Sy, E.T. Baskoro, S. Uttunggadewa, H. Assiyatun, Path-path size multipartite Ramsey numbers, J. Combin. Math. Combin. Comput. 71 (2009), 265-271.
  91. S.W. Saputro, E.T. Baskoro, A.N.M. Salman, D. Suprijanto, The metric dimensions of a complete n-partite graph and its cartesian product with a path, J. Combin. Math. Combin. Comput. 71 (20f09), 283 - 293.
  92. I Wayan Sudarsana, E.T. Baskoro, S. Uttunggadewa, D. Ismaimuza, Expansion techniques on the super edge antimagic total graphs, J. Combin. Math. Combin. Comput. 71 (2009), 189-199.
  93. M. Hussain, E.T. Baskoro, Slamin, On super edge-magic total labeling of banana trees, Utilitas Math. 79 (2009) 243-251.
  94. Hasmawati, E.T. Baskoro, H. Assiyatun, M. Salman A. N., Complete bipartite Ramsey numbers, Utilitas Math. 78 (2009), 129-138.
  95. I W. Sudarsana, E.T. Baskoro, S. Uttunggadewa, D. Ismaimuza, An expansion technique on super edge magic total graphs, Ars Combin. 91 (2009), 231-241.
  96. Hasmawati, H. Assiyatun, E. T. Baskoro, A.N.M. Salman , Ramsey numbers on a union of identical stars versus a small cycle, Computational Geometry and Graph Theory, LNCS 4535 (2008) 85-89.
  97. A.A. G. Ngurah, E.T. Baskoro, R. Simanjuntak, S. Uttunggadewa , On super edge-magic strength and deficiency of graphs, Computational Geometry and Graph Theory, LNCS 4535 (2008) 144-154.
  98. Hasmawati, E.T. Baskoro, H. Assiyatun, The Ramsey numbers for disjoint unions of graphs, Discrete Math. 308:10 (2008) 2046-2049.
  99. E.T. Baskoro, Y.M. Cholily, M. Miller, Enumeration of vertex orders of almost Moore digraphs with selfrepeats, Discrete Math. 308 (2008) 123-128.
  100. A.A.G. Ngurah, E.T. Baskoro, R. Simanjuntak, On the super edge-magic deficiencies of graphs, Australas. J. Combin. 40 (2008), 3-14.
  101. Surahmat, E.T. Baskoro, I. Tomescu, The Ramsey numbers of large cycles versus odd wheels, Graphs Combin. 24 (2008), 53-58.   
  102. A.A.G. Ngurah, R. Simanjuntak, E.T. Baskoro, On (super) edge-magic total labeling of subdivision of K1,3, SUT Journal of Mathematics, 43: 2 (2008), 127-136. 
  103. E.T. Baskoro, Lyra Yulianti, H. Assiyatun, Ramsey (K1,2, C4)-minimal, J. Combin. Math. Combin. Comput. 65 (2008), 79-90.
  104. Kashif Ali, E.T. Baskoro, I. Tomescu, On the Ramsey numbers for paths and generalized Jahangir graphs J(s,m), Bull. Math. Soc. Sci. Math. Roumanie (N.S.) 51: 3 (2008) 177-182. 
  105. Kashif Ali, E.T. Baskoro, On the Ramsey numbers for a combination of paths and Jahangirs, J. Combin. Math. Combin. Comput. 65 (2008), 113-120.
  106. C. Imron, B. Setiyono, R. Simanjuntak, E.T. Baskoro, Critical set of caterpillar graph for secret sharing scheme, J. Combin. Math. Combin. Comput. 65 (2008), 121-126.
  107. H. Iswadi, E.T. Baskoro, R. Simanjuntak, A.N.M. Salman, The metric dimension of graph with pendant edges, J. Combin. Math. Combin. Comput. 65 (2008), 139-146.
  108. Surahmat, E.T. Baskoro, H.J. Broersma, The Ramsey number of large star-like trees versus odd wheels, J. Combin. Math. Combin. Comput. 65 (2008), 153-162.
  109. T. K. Maryati, E.T. Baskoro, A.N.M. Salman, Ph-sypermagic labelings of some trees,  J. Combin. Math. Combin. Comput. 65 (2008), 197-204.
  110. Nurdin, A.N.M. Salman, E.T. Baskoro, the total edge-irregular strengths of the corona product of paths with some graphs, J. Combin. Math. Combin. Comput. 65 (2008), 163-176.
  111. Syafrizal Sy, E.T. Baskoro, S. Uttunggadewa, The size multipartite Ramsey numbers for small paths versus other graphs, Far East J. Appl. Math. 28: 1 (2007), 131-138.
  112. A.A.G. Ngurah, E.T. Baskoro, R. Simanjuntak, On the new families of (super) edge-magic graphs, Utilitas Math. 74 (2007), 111-120.
  113. E.T. Baskoro, Y.M. Cholily, M. Miller, Structure of repeat cycles in almost Moore digraphs with selfrepeats and diameter 3,  Bull. Inst. Combin. Appl. 46 (2006), 99—109.
  114. A.A.G. Ngurah, E.T. Baskoro, R. Simanjuntak, On the (a,d)-antimagic total labelling of $mC_n$, Bull. Inst. Combin. Appl.  48 (2006) 35-44.
  115. A.A.G. Ngurah, E.T. Baskoro, R. Simanjuntak, S. Uttunggadewa, On edge-magic total labeling of kC4-snakes, Congressus Numerantium , 179 (2006), 97-107.
  116. E.T. Baskoro, Hasmawati, H. Assiyatun, The Ramsey numbers for disjoint unions of trees, Discrete Math. 306 (2006) 3297-3301.
  117. Surahmat, E.T. Baskoro, I. Tomescu, The Ramsey numbers of large cycles versus wheels, Discrete Math. 306 (2006) 3334-3337.
  118. E.T. Baskoro, Subanji, Methods of constructing a knight’s tour on rectangular and diamond boards, Math Track 2 (2006) 47-55.
  119. E.T. Baskoro, Y. Nuraeni, A.A.G. Ngurah, Upper bounds for the size Ramsey numbers for $P_3$ versus $C_3^t$ or $P_n$, Journal of Prime Research in Mathematics 2 (2006) 141-146.
  120. M. Baca, E.T. Baskoro, R. Simanjuntak, K.A. Sugeng, Super edge-antimagic labelings of the generalized Petersen graph P(n,(n-1)/2), Utilitas Math. 70 (2006), 119-127.
  121. Y.M. Cholily , E.T. Baskoro,  S. Uttunggadewa, Some conditions of the existence of (d,k)-digraphs, LNCS 3330 (2005) 87- 93.
  122. Surahmat, E.T. Baskoro,  S. Uttunggadewa and H. Broersma, An upper bound for the Ramsey number of cycle of length four versus wheels, LNCS 3330 (2005) 181-184.  
  123. M. Baca , E.T. Baskoro,  M. Miller, Antimagic valuations for the special class of plane graphs, LNCS 3330 (2005) 55- 61.
  124. E.T. Baskoro, M. Miller, J. Siran and M. Sutton, Complete characterisation of almost Moore digraphs of degree three, Journal of Graph Theory, 48:2 (2005), 112-126.
  125. Surahmat, E.T. Baskoro, H.J. Broersma, The Ramsey numbers of fans versus K_4, Bull. Inst. Combin. Appl.  43 (2005) 96-102.
  126. E.T. Baskoro, Surahmat, The Ramsey number of paths with respect to wheels, Discrete Math. 294 (2005) 275-277.
  127. I W. Sudarsana, D. Ismaimuza, E.T. Baskoro, H. Assiyatun, On super (a,d) -edge antimagic total labeling of  disconnected graphs, J. Combin. Math. Combin. Comput. 55 (2005), 149-158.  
  128. Hasmawati, E.T. Baskoro, H. Assiyatun, Star-wheel Ramsey  numbers, J. Combin. Math. Combin. Comput. 55 (2005), 123--128.
  129. Syafrizal Sy., E.T. Baskoro, S. Uttunggadewa, The size multipartite Ramsey numbers for paths. J. Combin. Math. Combin. Comput. 55 (2005), 103-107.
  130. I W. Sudarsana, E.T. Baskoro, D. Ismaimuza, H. Assiyatun, Creating new super edge-magic total labelings from old ones, J. Combin. Math. Combin. Comput. 55 (2005), 83-90.
  131. A.A.G. Ngurah, E.T. Baskoro, R. Simanjuntak, On antimagic total labelings of generalized Petersen graph. J. Combin. Math. Combin. Comput. 55 (2005), 57-70.
  132. E.T. Baskoro, Critical sets in edge-magic total labelings, J. Combin. Math. Combin. Comput. 55 (2005), 33-42.
  133. M. Baca, E.T. Baskoro, Yus M. Cholily, Face antimagic labelings for a special class of plane graphs $C\sb a\sp b$, J. Combin. Math. Combin. Comput. 55 (2005), 5-15.
  134. Surahmat, E.T. Baskoro, H.J. Broersma , The Ramsey numbers of large cycles versus small wheels, INTEGERS: Electronic Journal of Combinatorial Number Theory 4 (2004) A#10, 1-9.
  135. M. Baca, E.T. Baskoro, S. Jendrol, M. Miller, Antimagic labelings of hexagonal planar maps, Utilitas Math. 66 (2004), 231-238.
  136. A.A.G. Ngurah and E.T. Baskoro, On magic and antimagic total labeling of generalized Petersen graph, Utilitas Mathematica 63 (2003) 97-107
  137. E.T. Baskoro and A.A.G. Ngurah, On super edge-magic total labeling of nP3, Bull. Inst. Combin. Appl. 27 (2003), 82-87
  138. A.N.M. Salman, E.T. Baskoro, H.J. Broersma, C.A. Rodger, More on spanning 2-connected subgraph in truncated rectangular grid graphs, Bull. Inst. Combin. Appl. 39 (2003) 31-38.
  139. A.N.M. Salman, H.J. Broersma , and E.T. Baskoro, Spanning 2-connected subgraphs of alphabet graphs, special classes of grid graphs, Journal of Automata, Languanges and Combinatorics 8 (2003) 4,  675-681.
  140. E.T. Baskoro, Surahmat, S.M. Nababan and  M. Miller, On Ramsey numbers  for trees versus wheels of five or six vertices,  Graphs and Combinatorics 18 (2002) 4, 717-721.
  141. E.T. Baskoro, M. Miller and J. Plesnik, Further results on almost Moore digraphs, Ars Combinatoria 56 (2000) 43-63.
  142. H. Iswadi and E.T. Baskoro, On (4,2)-digraphs with containing a cycle of length 2,  Bull. Malaysian Math. Sci. Soc. (2) 23 (2000) 1, 79-91.
  143. W.D. Wallis, E.T. Baskoro, M. Miller and Slamin, Edge-Magic total labelings Australas.  J.  Combin.  22 (2000) 177-190. 
  144. E.T. Baskoro, M. Miller and J. Plesnik, On the structure of digraphs with order close to the Moore bound,  Graphs Comb 14 (1998) 2, 109-119.
  145. E.T. Baskoro, L.Brankovic, M. Miller, J. Plesnik, J. Ryan and J. Siran, Large digraphs with small diameter: A voltage assignment approach, Journal of Combinatorial Mathematics and Combinatorial Computing 24 (1997) 161 - 176.
  146. E.T. Baskoro, M. Miller and J. Siran, A note on almost Moore digraphs of degree three, Acta Mathematica Universitatis Comenianae 66 (1997) 2, 285-291. 
  147. E.T. Baskoro and M. Miller, A procedure for constructing a  minimum-diameter digraph,  Bull. Inst. Combin. Appl. 17 (1996) 8-14.  
  148. E.T. Baskoro, M. Miller, J. Plesnik and S. Znam, Digraphs of degree 3 and order close to the Moore bound, Journal of Graph Theory 20 (1995) 339-349.
  149. E.T. Baskoro, M. Miller, J. Plesnik and S. Znam, Regular digraphs of diameter 2 and maximum order, Australasian Journal of Combinatorics 9 (1994) 291-306. Errata, 13 (1995).
 
National publications 
  1. I Wayan Sudarsana, E.T. Baskoro, H. Assiyatun, S. Uttunggadewa, The Ramsey numbers of linear forest versus 3K3 U 2K4, J. Indones. Math. Soc. (MIHMI) 15:1 (2009), 61-67.
  2. M. Baca, E.T. Baskoro, M. Miller, J. Ryan, R. Simanjuntak, K.A. Sugeng, Survey of edge antimagic labelings of graphs, J. Indones. Math. Soc. 12:1 (2006), 113-130.
  3. Nurdin, E.T. Baskoro, A.N.M. Salman, Total edge irregular strength on the union of K2,n ,  Jurnal Matematika dan Sain 11: 3 (2006) 105-109.
  4. E.T. Baskoro, I.W. Sudarsana, Y.M. Cholily, How to construct new super edge-magic graphs from some old ones, J. Indones. Math. Soc. (MIHMI) 11: 2 (2005), 155-162.
  5. M. Baca, E.T. Baskoro, Y.M. Cholily, S. Jendrol, Y. Lin, M. Miller, J. Ryan, R. Simanjuntak, Slamin, K.A. Sugeng, Conjectures and open problems on face antimagic evaluations of graphs, J. Indones. Math. Soc. (MIHMI) 11: 2 (2005), 175-192.
  6. E.T. Baskoro, Y.M. Cholily, Expanding super edge magic graphs, Proc. ITB Sains & Tek. 36:2 (2004), 117-125.
  7. E.T. Baskoro, On Ramsey-Type Problems, Jurnal Matematika atau Pembelajarannya, 9:1 (2003), 1-11.
  8. A.N.M. Salman, E.T. Baskoro, H.J. Broersma, A note concerning Hamilton cycles in some classes of grid graphs, Proceedings ITB Sains & Teknologi 35A:1 (2003) 65-70.
  9. E.T. Baskoro, The Ramsey number of paths and small wheels, Journal of the Indonesian Mathematical Society (MIHMI) 8 (2002) 1, 13-16.
  10. E.T. Baskoro and Amrullah, Almost Moore digraphs of degree 4 without selfrepeats, Journal of the Indonesian Mathematical Society (MIHMI), 8 (2002) 1,  51 – 60.
  11. Y.M. Cholily, E.T. Baskoro, Digraf Hampir Moore yang memuat segitiga, Jurnal Matematika dan Pembelajarannya, (2002).
  12. R. Simanjuntak and E.T. Baskoro, The uniqueness of almost Moore digraphs with degree 4 and diameter 2, Proceeding ITB 32 (2000) 1, 7-11 .
  13. E.T. Baskoro, On the existence of cubic digraphs with optimum order, The Indonesian Mathematical Society Magazine, MIHMI  2 (1997) 27-34.
Comments