default search action
Slamin
Person information
- affiliation: Jember University, Indonesia
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
- [j24]Md. Saidur Rahman, Petra Mutzel
, Slamin:
Special Issue Dedicated to 16th International Conference and Workshops on Algorithms and Computation, WALCOM 2022. Algorithmica 85(11): 3325-3326 (2023) - [j23]Liliek Susilowati
The local complement metric dimension of graphs. Discret. Math. Algorithms Appl. 15(2): 2250073:1-2250073:19 (2023) - [j22]Dian Eka Wijayanti, Noor Hidayat, Diari Indriati, Abdul Rouf Alghofari, S. Slamin
Total distance vertex irregularity strength of some corona product graphs. Electron. J. Graph Theory Appl. 11(1): 209-222 (2023) - [j21]Md. Saidur Rahman, Petra Mutzel
Guest Editors' forewords. J. Graph Algorithms Appl. 27(4): 239-240 (2023) - [j20]Md. Saidur Rahman, Petra Mutzel
Special issue on selected papers from the 16th International Conference and Workshops on Algorithms and Computation (WALCOM 2022). Theor. Comput. Sci. 973: 114095 (2023) - 2022
- [j19]Arika Indah Kristiana
On the local irregularity vertex coloring of volcano, broom, parachute, double broom and complete multipartite graphs. Discret. Math. Algorithms Appl. 14(6): 2250022:1-2250022:6 (2022) - [j18]Faisal Susanto
Non-inclusive and inclusive distance irregularity strength for the join product of graphs. Electron. J. Graph Theory Appl. 10(1): 1 (2022) - [e1]Petra Mutzel
WALCOM: Algorithms and Computation - 16th International Conference and Workshops, WALCOM 2022, Jember, Indonesia, March 24-26, 2022, Proceedings. Lecture Notes in Computer Science 13174, Springer 2022, ISBN 978-3-030-96730-7 [contents] - 2020
- [j17]Slamin
Local Super Antimagic Total Labeling for Vertex Coloring of Graphs. Symmetry 12(11): 1843 (2020)
2010 – 2019
- 2018
- [j16]Martin Baca
On inclusive distance vertex irregular labelings. Electron. J. Graph Theory Appl. 6(1): 61-83 (2018) - 2017
- [j15]Dafik, Slamin, Dushyant Tanna, Andrea Semanicová-Fenovcíková, Martin Baca:
Constructions Of H-Antimagic Graphs Using Smaller Edge-Antimagic Graphs. Ars Comb. 133: 233-245 (2017) - 2016
- [j14]S. Arumugam, Joe Ryan, Martin Baca, Kiki Ariyanti Sugeng, S. Slamin, Bharathi Rajan, Dalibor Froncek:
In memoriam Emeritus Professor Mirka Miller 09-05-1949 : 02-01-2016. AKCE Int. J. Graphs Comb. 13(2): 210-211 (2016) - 2014
- [j13]Josep M. Aroca, Anna S. Lladó, S. Slamin
On the ascending subgraph decomposition problem for bipartite graphs. Electron. Notes Discret. Math. 46: 19-26 (2014) - 2013
- [c3]Mirka Miller, Slamin
Construction Techniques for Digraphs with Minimum Diameter. IWOCA 2013: 327-336 - 2012
- [j12]M. Tariq Rahim, Slamin:
Vertex-magic total labeling of the union of suns. Ars Comb. 103: 305-310 (2012) - 2011
- [j11]Ali Ahmad, K. M. Awan, Imran Javaid, Slamin:
Total vertex irregularity strength of wheel related graphs. Australas. J Comb. 51: 147-156 (2011)
2000 – 2009
- 2007
- [j10]Ioan Tomescu, Imran Javaid, Slamin:
On the partition dimension and connected partition dimension of wheels. Ars Comb. 84 (2007) - 2006
- [j9]Camino Balbuena, Ewan Barker, Kinkar Chandra Das, Yuqing Lin
On the degrees of a strongly vertex-magic graph. Discret. Math. 306(6): 539-551 (2006) - 2004
- [j8]Yuqing Lin, Slamin, Martin Baca, Mirka Miller:
On d-antimagic labelings of prisms. Ars Comb. 72 (2004) - 2003
- [j7]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) - [c2]Kiki A. Sugeng, Mirka Miller, Slamin, Martin Baca:
(a, d)-Edge-Antimagic Total Labelings of Caterpillars. IJCCGGT 2003: 169-180 - 2002
- [j6]Martin Baca
Vertex-Magic Total Labelings of Generalized Petersen Graphs. Int. J. Comput. Math. 79(12): 1259-1263 (2002) - 2001
- [j5]Hiroshi Nagamochi, Mirka Miller, Slamin
Bounds on the number of isolates in sum graph labeling. Discret. Math. 240(1-3): 175-185 (2001) - 2000
- [j4]Walter D. Wallis, Edy Tri Baskoro, Mirka Miller, Slamin:
Edge-magic total labelings. Australas. J Comb. 22: 177-190 (2000) - [j3]Mirka Miller, Joan Gimbert, Jozef Sirán, Slamin:
Almost Moore digraphs are diregular. Discret. Math. 218(1-3): 265-270 (2000) - [j2]Martin Baca, Jim A. MacDougall, Mirka Miller, Slamin, Walter D. Wallis:
Survey of certain valuations of graphs. Discuss. Math. Graph Theory 20(2): 219-229 (2000) - [c1]Mirka Miller, Slamin:
On the Monotonicity of Minimum Diameter with Respect to Order and Maximum Out-Degree. COCOON 2000: 193-201
1990 – 1999
- 1999
- [j1]Martin Sutton, Mirka Miller, Joseph F. Ryan, Slamin:
Connected graphs which are not mod sum graphs. Discret. Math. 195(1-3): 287-293 (1999)
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-07-23 21:03 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: