[vc_empty_space][vc_empty_space][vc_row layout=”boxed” css=”.vc_custom_1624509994608{margin-top: 90px !important;}”][vc_column width=”1/3″ css=”.vc_custom_1624519913689{border-right-width: 1px !important;border-right-color: #dbdbdb !important;border-right-style: solid !important;border-radius: 1px !important;}”][vc_row_inner layout=”boxed”][vc_column_inner]
[vc_empty_space][vc_btn title=”Lihat Profil Scopus” style=”gradient-custom” gradient_custom_color_1=”#00316d” gradient_custom_color_2=”#2071ea” size=”sm” align=”center” css_animation=”bounceInDown” link=”url:https%3A%2F%2Fwww.scopus.com%2Fauthid%2Fdetail.uri%3FauthorId%3D14046060500||target:%20_blank|”][/vc_column_inner][/vc_row_inner][vc_row_inner css=”.vc_custom_1624510077690{border-right-width: 1px !important;padding-top: 32px !important;border-right-color: #b2b2b2 !important;border-right-style: solid !important;border-radius: 1px !important;}”][/vc_row_inner][/vc_column][vc_column width=”2/3″][vc_row_inner][vc_column_inner css=”.vc_custom_1624509956940{border-left-width: 1px !important;border-left-color: #969696 !important;border-left-style: solid !important;border-radius: 1px !important;}”][megatron_heading title=”Rinovia Mery Garnierita S.” size=”size-md” sub_title=”FMIPA” text_align=”text-left”][vc_separator][/vc_column_inner][/vc_row_inner][vc_column_text]Statistics and Probability • Statistics, Probability and Uncertainty • Applied Mathematics • Computer Science (miscellaneous) • Theoretical Computer Science • Discrete Mathematics and Combinatorics • Physics and Astronomy (all) • Computer Science (all) • Mathematics (all)[/vc_column_text][/vc_column][/vc_row][vc_row layout=”boxed” css=”.vc_custom_1624522217430{margin-top: 20px !important;}”][vc_column][vc_tta_tabs style=”classic” color=”blue” spacing=”5″ active_section=”1″ no_fill_content_area=”true”][vc_tta_section i_type=”fontawesome” i_icon_fontawesome=”fa fa-book” add_icon=”true” title=”Karya” tab_id=”karya”][vc_empty_space height=”20px”][vc_column_text]
D-magic strongly regular graphs
Rinovia Simanjuntak,Palton Anuwiksa
AKCE International Journal of Graphs and Combinatorics vol:17, issue:j.akcej.2019.12.019, page:1-999
[/vc_column_text]
[vc_column_text css=”.vc_custom_1624700225847{padding-top: 10px !important;}”]
PlumX Widget
[/vc_column_text]
[vc_separator css=”.vc_custom_1624506709952{padding-top: 10px !important;padding-bottom: 15px !important;}”][vc_column_text]
Metric dimension for amalgamations of graphs
Rinovia Simanjuntak,Saladin Uttunggadewa,Suhadi Wido Saputro
Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) vol:8986, issue:978-3-319-19315-1_29, page:1-337
[/vc_column_text]
[vc_column_text css=”.vc_custom_1624700225847{padding-top: 10px !important;}”]
PlumX Widget
[/vc_column_text]
[vc_separator css=”.vc_custom_1624506709952{padding-top: 10px !important;padding-bottom: 15px !important;}”][vc_column_text]
Preface
Rinovia Simanjuntak,Edy Tri Baskoro,Mirka Miller
Procedia Computer Science vol:74, issue:j.procs.2015.12.065, page:1-
[/vc_column_text]
[vc_column_text css=”.vc_custom_1624700225847{padding-top: 10px !important;}”]
PlumX Widget
[/vc_column_text]
[vc_separator css=”.vc_custom_1624506709952{padding-top: 10px !important;padding-bottom: 15px !important;}”][vc_column_text]
On (super) edge-magic total labeling of subdivision of K 1,3
Anak Agung Gede Ngurah,Rinovia Simanjuntak,Edy Tri Baskoro
SUT Journal of Mathematics vol:43, issue:, page:1-136
[/vc_column_text]
[vc_column_text css=”.vc_custom_1624700225847{padding-top: 10px !important;}”]
[/vc_column_text]
[vc_separator css=”.vc_custom_1624506709952{padding-top: 10px !important;padding-bottom: 15px !important;}”][vc_column_text]
A Heuristic for Distance Magic Labeling
Fuad Yasin,Rinovia Simanjuntak
Procedia Computer Science vol:74, issue:j.procs.2015.12.083, page:1-104
[/vc_column_text]
[vc_column_text css=”.vc_custom_1624700225847{padding-top: 10px !important;}”]
PlumX Widget
[/vc_column_text]
[vc_separator css=”.vc_custom_1624506709952{padding-top: 10px !important;padding-bottom: 15px !important;}”][vc_column_text]
Super (a, d)-H-antimagic total labelings for shackles of a connected graph H
N. Inayah,R. Simanjuntak,A.N.M. Salman,K.I.A. Syuhada
Australasian Journal of Combinatorics vol:57, issue:, page:1-138
[/vc_column_text]
[vc_column_text css=”.vc_custom_1624700225847{padding-top: 10px !important;}”]
[/vc_column_text]
[vc_separator css=”.vc_custom_1624506709952{padding-top: 10px !important;padding-bottom: 15px !important;}”][vc_column_text]
The metric dimension of the lexicographic product of graphs
S.W. Saputro,R. Simanjuntak,S. Uttunggadewa,H. Assiyatun,E.T. Baskoro,A.N.M. Salman,M. Bača
Discrete Mathematics vol:313, issue:j.disc.2013.01.021, page:1-1051
[/vc_column_text]
[vc_column_text css=”.vc_custom_1624700225847{padding-top: 10px !important;}”]
PlumX Widget
[/vc_column_text]
[vc_separator css=”.vc_custom_1624506709952{padding-top: 10px !important;padding-bottom: 15px !important;}”][vc_column_text]
Graphs of order two less than the Moore bound
Mirka Miller,Rinovia Simanjuntak
Discrete Mathematics vol:308, issue:j.disc.2006.06.045, page:1-2821
[/vc_column_text]
[vc_column_text css=”.vc_custom_1624700225847{padding-top: 10px !important;}”]
PlumX Widget
[/vc_column_text]
[vc_separator css=”.vc_custom_1624506709952{padding-top: 10px !important;padding-bottom: 15px !important;}”][vc_column_text]
On graph of order-n with the metric dimension n – 3
S.W. Saputro,R. Simanjuntak,S. Uttunggadewa,H. Assiyatun,E.T. Baskoro,A.N.M. Salman
10th Cologne-Twente Workshop on Graphs and Combinatorial Optimization, CTW 2011 – Proceedings of the Conference vol:, issue:, page:1-243
[/vc_column_text]
[vc_column_text css=”.vc_custom_1624700225847{padding-top: 10px !important;}”]
[/vc_column_text]
[vc_separator css=”.vc_custom_1624506709952{padding-top: 10px !important;padding-bottom: 15px !important;}”][vc_column_text]
Large bipartite Cayley graphs of given degree and diameter
Tomáš Vetrík,Rinovia Simanjuntak,Edy Tri Baskoro
Discrete Mathematics vol:311, issue:j.disc.2010.10.015, page:1-326
[/vc_column_text]
[vc_column_text css=”.vc_custom_1624700225847{padding-top: 10px !important;}”]
PlumX Widget
[/vc_column_text]
[vc_separator css=”.vc_custom_1624506709952{padding-top: 10px !important;padding-bottom: 15px !important;}”][vc_column_text]
Directed metric dimension of oriented graphs with cyclic covering
Sigit Pancahayani,Rinovia Simanjuntak
Journal of Combinatorial Mathematics and Combinatorial Computing vol:94, issue:, page:1-25
[/vc_column_text]
[vc_column_text css=”.vc_custom_1624700225847{padding-top: 10px !important;}”]
[/vc_column_text]
[vc_separator css=”.vc_custom_1624506709952{padding-top: 10px !important;padding-bottom: 15px !important;}”][vc_column_text]
A note on a Moore bound for graphs embedded in surfaces
J. Šiagiová,R. Simanjuntak
Acta Mathematica Universitatis Comenianae vol:73, issue:, page:1-117
[/vc_column_text]
[vc_column_text css=”.vc_custom_1624700225847{padding-top: 10px !important;}”]
[/vc_column_text]
[vc_separator css=”.vc_custom_1624506709952{padding-top: 10px !important;padding-bottom: 15px !important;}”][vc_column_text]
Locating-chromatic number for a graph of two components
Des Welyyanti,Rinovia Simanjuntak,Saladin Uttunggadewa,Edy Tri Baskoro
AIP Conference Proceedings vol:1707, issue:1.4940825, page:1-
[/vc_column_text]
[vc_column_text css=”.vc_custom_1624700225847{padding-top: 10px !important;}”]
PlumX Widget
[/vc_column_text]
[vc_separator css=”.vc_custom_1624506709952{padding-top: 10px !important;padding-bottom: 15px !important;}”][vc_column_text]
Super edge-magic deficiency of join-product graphs
A.A.G. Ngurah,Rinovia Simanjuntak
Utilitas Mathematica vol:105, issue:, page:1-289
[/vc_column_text]
[vc_column_text css=”.vc_custom_1624700225847{padding-top: 10px !important;}”]
[/vc_column_text]
[vc_separator css=”.vc_custom_1624506709952{padding-top: 10px !important;padding-bottom: 15px !important;}”][vc_column_text]
The metric dimension of graph with pendant edges
H. Iswadi,Ely Tri Baskoro,Rino Simanjuntak,A.N.M. Salman
Journal of Combinatorial Mathematics and Combinatorial Computing vol:65, issue:, page:1-145
[/vc_column_text]
[vc_column_text css=”.vc_custom_1624700225847{padding-top: 10px !important;}”]
[/vc_column_text]
[vc_separator css=”.vc_custom_1624506709952{padding-top: 10px !important;padding-bottom: 15px !important;}”][vc_column_text]
The rainbow 2-connectivity of Cartesian products of 2-connected graphs and paths
Bety Hayat Susanti,A.N.M. Salman,Rinovia Simanjuntak
Electronic Journal of Graph Theory and Applications vol:8, issue:EJGTA.2020.8.1.11, page:1-156
[/vc_column_text]
[vc_column_text css=”.vc_custom_1624700225847{padding-top: 10px !important;}”]
PlumX Widget
[/vc_column_text]
[vc_separator css=”.vc_custom_1624506709952{padding-top: 10px !important;padding-bottom: 15px !important;}”][vc_column_text]
Total vertex irregularity strength of trees with maximum degree five
None Susilawati,Edy Tri Baskoro,Rinovia Simanjuntak
Electronic Journal of Graph Theory and Applications vol:6, issue:ejgta.2018.6.2.5, page:1-257
[/vc_column_text]
[vc_column_text css=”.vc_custom_1624700225847{padding-top: 10px !important;}”]
PlumX Widget
[/vc_column_text]
[vc_separator css=”.vc_custom_1624506709952{padding-top: 10px !important;padding-bottom: 15px !important;}”][vc_column_text]
On the vertex irregular total labeling for subdivision of trees
None Susilawati,Edy Tri Baskoro,Rinovia Simanjuntak,Joe Ryan
Australasian Journal of Combinatorics vol:71, issue:, page:1-302
[/vc_column_text]
[vc_column_text css=”.vc_custom_1624700225847{padding-top: 10px !important;}”]
[/vc_column_text]
[vc_separator css=”.vc_custom_1624506709952{padding-top: 10px !important;padding-bottom: 15px !important;}”][vc_column_text]
Computing the edge irregularity strengths of chain graphs and the join of two graphs
Ali Ahmad,Ashok Gupta,Rinovia Simanjuntak
Electronic Journal of Graph Theory and Applications vol:6, issue:ejgta.2018.6.1.15, page:1-207
[/vc_column_text]
[vc_column_text css=”.vc_custom_1624700225847{padding-top: 10px !important;}”]
PlumX Widget
[/vc_column_text]
[vc_separator css=”.vc_custom_1624506709952{padding-top: 10px !important;padding-bottom: 15px !important;}”][vc_column_text]
Total vertex irregularity strength of trees with maximum degree four
None Susilawati,Edy Tri Baskoro,Rinovia Simanjuntak
AIP Conference Proceedings vol:1707, issue:1.4940823, page:1-
[/vc_column_text]
[vc_column_text css=”.vc_custom_1624700225847{padding-top: 10px !important;}”]
PlumX Widget
[/vc_column_text]
[vc_separator css=”.vc_custom_1624506709952{padding-top: 10px !important;padding-bottom: 15px !important;}”][vc_column_text]
The rainbow connection number of some subdivided roof graphs
Bety Hayat Susanti,A.N.M. Salman,Rinovia Simanjuntak
AIP Conference Proceedings vol:1707, issue:1.4940822, page:1-
[/vc_column_text]
[vc_column_text css=”.vc_custom_1624700225847{padding-top: 10px !important;}”]
PlumX Widget
[/vc_column_text]
[vc_separator css=”.vc_custom_1624506709952{padding-top: 10px !important;padding-bottom: 15px !important;}”][vc_column_text]
The Partition Dimension of a Subdivision of a Complete Graph
None Amrullah,Edy Tri Baskoro,Rinovia Simanjuntak,Saladin Uttunggadewa
Procedia Computer Science vol:74, issue:j.procs.2015.12.075, page:1-59
[/vc_column_text]
[vc_column_text css=”.vc_custom_1624700225847{padding-top: 10px !important;}”]
PlumX Widget
[/vc_column_text]
[vc_separator css=”.vc_custom_1624506709952{padding-top: 10px !important;padding-bottom: 15px !important;}”][vc_column_text]
Total Vertex-Irregularity Labelings for Subdivision of Several Classes of Trees
None Susilawati,Edy Tri Baskoro,Rinovia Simanjuntak
Procedia Computer Science vol:74, issue:j.procs.2015.12.085, page:1-117
[/vc_column_text]
[vc_column_text css=”.vc_custom_1624700225847{padding-top: 10px !important;}”]
PlumX Widget
[/vc_column_text]
[vc_separator css=”.vc_custom_1624506709952{padding-top: 10px !important;padding-bottom: 15px !important;}”][vc_column_text]
Upper Bounds for Rainbow 2-Connectivity of the Cartesian Product of a Path and a Cycle
Bety Hayat Susanti,A.N.M. Salman,Rinovia Simanjuntak
Procedia Computer Science vol:74, issue:j.procs.2015.12.091, page:1-154
[/vc_column_text]
[vc_column_text css=”.vc_custom_1624700225847{padding-top: 10px !important;}”]
PlumX Widget
[/vc_column_text]
[vc_separator css=”.vc_custom_1624506709952{padding-top: 10px !important;padding-bottom: 15px !important;}”][vc_column_text]
On Locating-chromatic Number for Graphs with Dominant Vertices
Des Welyyanti,Edy Tri Baskoro,Rinovia Simanjuntak,Saladin Uttunggadewa
Procedia Computer Science vol:74, issue:j.procs.2015.12.081, page:1-92
[/vc_column_text]
[vc_column_text css=”.vc_custom_1624700225847{padding-top: 10px !important;}”]
PlumX Widget
[/vc_column_text]
[vc_separator css=”.vc_custom_1624506709952{padding-top: 10px !important;padding-bottom: 15px !important;}”][vc_column_text]
The locating-chromatic number of disconnected graphs
Des Welyyanti,Edy Tri Baskoro,Rinovia Simanjuntak,Saladin Uttunggadewa
Far East Journal of Mathematical Sciences vol:94, issue:, page:1-182
[/vc_column_text]
[vc_column_text css=”.vc_custom_1624700225847{padding-top: 10px !important;}”]
[/vc_column_text]
[vc_separator css=”.vc_custom_1624506709952{padding-top: 10px !important;padding-bottom: 15px !important;}”][vc_column_text]
On locating-chromatic number of complete n-ary tree
Des Welyyanti,Edy Tri Baskoro,Rinovia Simanjuntak,Saladin Uttunggadewa
AKCE International Journal of Graphs and Combinatorics vol:10, issue:, page:1-315
[/vc_column_text]
[vc_column_text css=”.vc_custom_1624700225847{padding-top: 10px !important;}”]
[/vc_column_text]
[vc_separator css=”.vc_custom_1624506709952{padding-top: 10px !important;padding-bottom: 15px !important;}”][vc_column_text]
On the metric dimension of corona product of graphs
H. Iswadi,E.T. Baskoro,R. Simanjuntak
Far East Journal of Mathematical Sciences vol:52, issue:, page:1-170
[/vc_column_text]
[vc_column_text css=”.vc_custom_1624700225847{padding-top: 10px !important;}”]
[/vc_column_text]
[vc_separator css=”.vc_custom_1624506709952{padding-top: 10px !important;padding-bottom: 15px !important;}”][vc_column_text]
On (a, d)-H-antimagic coverings of graphs
Nur Inayah,A.N.M. Salman,R. Simanjuntak
Journal of Combinatorial Mathematics and Combinatorial Computing vol:71, issue:, page:1-281
[/vc_column_text]
[vc_column_text css=”.vc_custom_1624700225847{padding-top: 10px !important;}”]
[/vc_column_text]
[vc_separator css=”.vc_custom_1624506709952{padding-top: 10px !important;padding-bottom: 15px !important;}”][vc_column_text]
On the super edge-magic deficiencies of graphs
A.A.G. Ngurah,E.T. Baskoro,R. Simanjuntak
Australasian Journal of Combinatorics vol:40, issue:, page:1-14
[/vc_column_text]
[vc_column_text css=”.vc_custom_1624700225847{padding-top: 10px !important;}”]
[/vc_column_text]
[vc_separator css=”.vc_custom_1624506709952{padding-top: 10px !important;padding-bottom: 15px !important;}”][vc_column_text]
Rainbow 2-connectivity of edge-comb product of a cycle and a Hamiltonian graph
Martin Bača,A.N.M. Salman,Rinovia Simanjuntak,Bety Hayat Susanti
Proceedings of the Indian Academy of Sciences: Mathematical Sciences vol:130, issue:s12044-019-0549-x, page:1-
[/vc_column_text]
[vc_column_text css=”.vc_custom_1624700225847{padding-top: 10px !important;}”]
PlumX Widget
[/vc_column_text]
[vc_separator css=”.vc_custom_1624506709952{padding-top: 10px !important;padding-bottom: 15px !important;}”][vc_column_text]
On Super edge-magic strength and deficiency of graphs
A.A.G. Ngurah,E.T. Baskoro,R. Simanjuntak,S. Uttunggadewa
Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) vol:4535 LNCS, issue:978-3-540-89550-3_16, page:1-154
[/vc_column_text]
[vc_column_text css=”.vc_custom_1624700225847{padding-top: 10px !important;}”]
PlumX Widget
[/vc_column_text]
[vc_separator css=”.vc_custom_1624506709952{padding-top: 10px !important;padding-bottom: 15px !important;}”][vc_column_text]
On the new families of (super) edge-magic graphs
A.A.G. Ngurah,E.T. Baskoro,R. Simanjuntak
Utilitas Mathematica vol:74, issue:, page:1-120
[/vc_column_text]
[vc_column_text css=”.vc_custom_1624700225847{padding-top: 10px !important;}”]
[/vc_column_text]
[vc_separator css=”.vc_custom_1624506709952{padding-top: 10px !important;padding-bottom: 15px !important;}”][vc_column_text]
Super edge-antimagic labelings of the generalized Petersen graph P(n, (n – 1)/2)
Martin Bača,Edy Tri Baskoro,Rinovia Simanjuntak,Kiki Ariyanti Sugeng
Utilitas Mathematica vol:70, issue:, page:1-127
[/vc_column_text]
[vc_column_text css=”.vc_custom_1624700225847{padding-top: 10px !important;}”]
[/vc_column_text]
[vc_separator css=”.vc_custom_1624506709952{padding-top: 10px !important;padding-bottom: 15px !important;}”][vc_column_text]
The partition dimension of a complete multipartite graph, a special caterpillar and a windmill
None Darmaji,S. Uttunggadewa,R. Simanjuntak,E.T. Baskoro
Journal of Combinatorial Mathematics and Combinatorial Computing vol:71, issue:, page:1-215
[/vc_column_text]
[vc_column_text css=”.vc_custom_1624700225847{padding-top: 10px !important;}”]
[/vc_column_text]
[vc_separator css=”.vc_custom_1624506709952{padding-top: 10px !important;padding-bottom: 15px !important;}”][vc_column_text]
On the super edge-magic deficiency of forests
A.Q. Baig,Ali Ahmad,Edy Tri Baskoro,Rinovia Simanjuntak
Utilitas Mathematica vol:86, issue:, page:1-159
[/vc_column_text]
[vc_column_text css=”.vc_custom_1624700225847{padding-top: 10px !important;}”]
[/vc_column_text]
[vc_separator css=”.vc_custom_1624506709952{padding-top: 10px !important;padding-bottom: 15px !important;}”][vc_column_text]
The resolving graph of amalgamation of cycles
H. Iswadi,E.T. Baskoro,A.N.M. Salman,R. Simanjuntak
Utilitas Mathematica vol:83, issue:, page:1-132
[/vc_column_text]
[vc_column_text css=”.vc_custom_1624700225847{padding-top: 10px !important;}”]
[/vc_column_text]
[vc_separator css=”.vc_custom_1624506709952{padding-top: 10px !important;padding-bottom: 15px !important;}”][vc_column_text]
The metric dimension of amalgamation of cycles
H. Iswadi,E.T. Baskoro,A.N.M. Salman,R. Simanjuntak
Far East Journal of Mathematical Sciences vol:41, issue:, page:1-31
[/vc_column_text]
[vc_column_text css=”.vc_custom_1624700225847{padding-top: 10px !important;}”]
[/vc_column_text]
[vc_separator css=”.vc_custom_1624506709952{padding-top: 10px !important;padding-bottom: 15px !important;}”][vc_column_text]
The partition dimension of subdivision of a graph
None Amrullah,Edy Tri Baskoro,Saladin Uttunggadewa,Rinovia Simanjuntak
AIP Conference Proceedings vol:1707, issue:1.4940802, page:1-
[/vc_column_text]
[vc_column_text css=”.vc_custom_1624700225847{padding-top: 10px !important;}”]
PlumX Widget
[/vc_column_text]
[vc_separator css=”.vc_custom_1624506709952{padding-top: 10px !important;padding-bottom: 15px !important;}”][vc_column_text]
The locating-chromatic number of firecracker graphs
None Asmiati,E.T. Baskoro,H. Assiyatun,D. Suprijanto,R. Simanjuntak,S. Uttunggadewa
Far East Journal of Mathematical Sciences vol:63, issue:, page:1-23
[/vc_column_text]
[vc_column_text css=”.vc_custom_1624700225847{padding-top: 10px !important;}”]
[/vc_column_text]
[vc_separator css=”.vc_custom_1624506709952{padding-top: 10px !important;padding-bottom: 15px !important;}”][vc_column_text]
The partition dimension for a subdivision of homogeneous caterpillars
None Amrullah,Hilda Assiyatun,Edy Tri Baskoro,Saladin Uttunggadewa,Rinovia Simanjuntak
AKCE International Journal of Graphs and Combinatorics vol:10, issue:, page:1-325
[/vc_column_text]
[vc_column_text css=”.vc_custom_1624700225847{padding-top: 10px !important;}”]
[/vc_column_text]
[vc_separator css=”.vc_custom_1624506709952{padding-top: 10px !important;padding-bottom: 15px !important;}”][/vc_tta_section][vc_tta_section i_type=”fontawesome” i_icon_fontawesome=”fa fa-handshake-o” add_icon=”true” title=”Proyek” tab_id=”proyek”][vc_empty_space height=”20px”][/vc_tta_section][vc_tta_section i_type=”fontawesome” i_icon_fontawesome=”fa fa-users” add_icon=”true” title=”Jejaring” tab_id=”jejaring”][vc_empty_space height=”20px”][/vc_tta_section][/vc_tta_tabs][/vc_column][/vc_row]