default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDRinovia Simanjuntak
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j24]Sigit Pancahayani, Rinovia Simanjuntak, Saladin Uttunggadewa:
Magic labeling on graphs with ascending subgraph decomposition. Electron. J. Graph Theory Appl. 12(2): 189-203 (2024)- 2023
- [j23]Yeva Fadhilah Ashari
, A. N. M. Salman, Rinovia Simanjuntak, Andrea Semanicová-Fenovcíková, Martin Baca:
On (F, H)-simultaneously-magic labelings of graphs. Electron. J. Graph Theory Appl. 11(1): 49-64 (2023) - [j22]Risma Yulina Wulandari, Rinovia Simanjuntak:
Distance antimagic labelings of product graphs. Electron. J. Graph Theory Appl. 11(1): 111-123 (2023) - 2022
- [j21]I Wayan Palton Anuwiksa, Rinovia Simanjuntak, Edy Tri Baskoro:
Multipartite Ramsey Numbers of Union of Stars. Electron. J. Graph Theory Appl. 10(2): 637-643 (2022) - [j20]Rinovia Simanjuntak, Aholiab Tritama:
Distance Antimagic Product Graphs. Symmetry 14(7): 1411 (2022) - 2021
- [j19]Marcin Anholcer, Sylwia Cichacz, Dalibor Froncek, Rinovia Simanjuntak, Jiangyi Qiu:
Group distance magic and antimagic hypercubes. Discret. Math. 344(12): 112625 (2021) - [j18]Ngurah Anak Agung Gede, Rinovia Simanjuntak:
On distance labelings of 2-regular graphs. Electron. J. Graph Theory Appl. 9(1): 25-37 (2021) - [j17]Yeva Fadhilah Ashari, A. N. M. Salman, Rinovia Simanjuntak:
On Forbidden Subgraphs of (K2, H)-Sim-(Super)Magic Graphs. Symmetry 13(8): 1346 (2021) - [j16]Rinovia Simanjuntak, Tamaro Nadeak, Fuad Yasin, Kristiana Wijaya, Nurdin Hinding, Kiki Ariyanti Sugeng:
Another Antimagic Conjecture. Symmetry 13(11): 2071 (2021) - [j15]Alison Marr, Rinovia Simanjuntak:
D-Magic Oriented Graphs. Symmetry 13(12): 2261 (2021) - 2020
- [j14]Rinovia Simanjuntak, Palton Anuwiksa:
D-magic strongly regular graphs. AKCE Int. J. Graphs Comb. 17(3): 995-999 (2020) - [j13]Bety Hayat Susanti, A. N. M. Salman, Rinovia Simanjuntak:
The rainbow 2-connectivity of Cartesian products of 2-connected graphs and paths. Electron. J. Graph Theory Appl. 8(1): 145-156 (2020) - [j12]Rinovia Simanjuntak, Susilawati, Edy Tri Baskoro:
Total vertex irregularity strength for trees with many vertices of degree two. Electron. J. Graph Theory Appl. 8(2): 415-421 (2020)
2010 – 2019
- 2019
- [j11]Ngurah Anak Agung Gede, Rinovia Simanjuntak:
On the super edge-magic deficiency of join product and chain graphs. Electron. J. Graph Theory Appl. 7(1): 157-167 (2019) - 2018
- [j10]Ali Ahmad, Ashok Gupta, Rinovia Simanjuntak:
Computing the edge irregularity strengths of chain graphs and the join of two graphs. Electron. J. Graph Theory Appl. 6(1): 201-207 (2018) - [j9]Susilawati, Edy Tri Baskoro, Rinovia Simanjuntak:
Total vertex irregularity strength of trees with maximum degree five. Electron. J. Graph Theory Appl. 6(2): 250-257 (2018) - 2017
- [j8]Ngurah Anak Agung Gede, Rinovia Simanjuntak:
Super edge-magic labeling of graphs: deficiency and maximality. Electron. J. Graph Theory Appl. 5(2): 212-220 (2017) - 2015
- [c9]Amrullah, Edy Tri Baskoro, Rinovia Simanjuntak, Saladin Uttunggadewa:
The Partition Dimension of a Subdivision of a Complete Graph. ICGTIS 2015: 53-59 - [c8]Des Welyyanti, Edy Tri Baskoro, Rinovia Simanjuntak, Saladin Uttunggadewa:
On Locating-chromatic Number for Graphs with Dominant Vertices. ICGTIS 2015: 89-92 - [c7]Fuad Yasin, Rinovia Simanjuntak:
A Heuristic for Distance Magic Labeling. ICGTIS 2015: 100-104 - [c6]Susilawati, Edy Tri Baskoro, Rinovia Simanjuntak:
Total Vertex-Irregularity Labelings for Subdivision of Several Classes of Trees. ICGTIS 2015: 112-117 - [c5]Bety Hayat Susanti, A. N. M. Salman, Rinovia Simanjuntak:
Upper Bounds for Rainbow 2-Connectivity of the Cartesian Product of a Path and a Cycle. ICGTIS 2015: 151-154 - [e1]Rinovia Simanjuntak, Edy Tri Baskoro, Mirka Miller:
The 2nd International Conference of Graph Theory and Information Security, ICGTIS 2015, Bandung, Indonesia, 21-23 September 2015. Procedia Computer Science 74, Elsevier 2015 [contents] - [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
- [c4]Rinovia Simanjuntak, Saladin Uttunggadewa, Suhadi Wido Saputro:
Metric Dimension for Amalgamations of Graphs. IWOCA 2014: 330-337 - 2013
- [j7]Nur Inayah, Rinovia Simanjuntak, A. N. M. Salman, K. I. A. Syuhada:
Super (a, d)-H-antimagic total labelings for shackles of a connected graph H. Australas. J Comb. 57: 127-138 (2013) - [j6]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
- [j5]Tomás Vetrík, Rinovia Simanjuntak, Edy Tri Baskoro:
Large bipartite Cayley graphs of given degree and diameter. Discret. Math. 311(4): 324-326 (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
2000 – 2009
- 2008
- [j4]Ngurah Anak Agung Gede, Edy Tri Baskoro, Rinovia Simanjuntak:
On the super edge-magic deficiencies of graphs. Australas. J Comb. 40: 3-14 (2008) - [j3]Mirka Miller, Rinovia Simanjuntak:
Graphs of order two less than the Moore bound. Discret. Math. 308(13): 2810-2821 (2008) - 2007
- [c2]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
- [j2]Mirka Miller, Chris Rodger, Rinovia Simanjuntak:
Distance magic labelings of graphs. Australas. J Comb. 28: 305- (2003) - [j1]Martin Baca, François Bertault, James Arthur MacDougall, Mirka Miller, Rinovia Simanjuntak, Slamin:
Vertex-antimagic total labelings of graphs. Discuss. Math. Graph Theory 23(1): 67-83 (2003) - [c1]Rinovia Simanjuntak, Mirka Miller:
Maximum Order of Planar Digraphs. IJCCGGT 2003: 159-168
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 2025-01-21 00:13 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:
