default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDJelena Sedlar
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j18]Jelena Sedlar
, Riste Skrekovski:
Normal 5-edge-coloring of some snarks superpositioned by the Petersen graph. Appl. Math. Comput. 467: 128493 (2024)- [j17]Iztok Peterin, Jelena Sedlar, Riste Skrekovski, Ismael G. Yero:
Resolving vertices of graphs with differences. Comput. Appl. Math. 43(5): 275 (2024) - [j16]Jelena Sedlar, Riste Skrekovski:
Local Irregularity Conjecture vs. cacti. Discret. Appl. Math. 343: 115-133 (2024) - [j15]Jelena Sedlar, Riste Skrekovski:
Normal 5-edge-coloring of some snarks superpositioned by Flower snarks. Eur. J. Comb. 122: 104038 (2024) - 2022
- [j14]Jelena Sedlar, Riste Skrekovski:
Metric dimensions vs. cyclomatic number of graphs with minimum degree at least two. Appl. Math. Comput. 427: 127147 (2022) - [j13]Jelena Sedlar, Riste Skrekovski:
Vertex and edge metric dimensions of unicyclic graphs. Discret. Appl. Math. 314: 81-92 (2022) - [j12]Jelena Sedlar, Riste Skrekovski:
Vertex and edge metric dimensions of cacti. Discret. Appl. Math. 320: 126-139 (2022) - 2021
- [j11]Jelena Sedlar, Riste Skrekovski:
Bounds on metric dimensions of graphs with edge disjoint cycles. Appl. Math. Comput. 396: 125908 (2021) - [j10]Jelena Sedlar, Riste Skrekovski:
Extremal mixed metric dimension with respect to the cyclomatic number. Appl. Math. Comput. 404: 126238 (2021) - [j9]Jelena Sedlar, Riste Skrekovski:
Mixed metric dimension of graphs with edge disjoint cycles. Discret. Appl. Math. 300: 1-8 (2021) - 2020
- [c1]Martina Milat, Snjezana Knezic, Jelena Sedlar:
A new surrogate measure for resilient approach to construction scheduling. CENTERIS/ProjMAN/HCist 2020: 468-476
2010 – 2019
- 2018
- [j8]Jelena Sedlar:
On Wiener inverse interval problem of trees. Ars Math. Contemp. 15(1): 19-37 (2018) - [j7]Damir Vukicevic, Jelena Sedlar:
On indices of Wiener and anti-Wiener type. Discret. Appl. Math. 251: 290-298 (2018) - [j6]Damir Vukicevic, Shuang Zhao, Jelena Sedlar, Shou-Jun Xu, Tomislav Doslic:
Global forcing number for maximal matchings. Discret. Math. 341(3): 801-809 (2018) - 2015
- [j5]Jelena Sedlar, Dragan Stevanovic, Alexander Vasilyev:
On the inverse sum indeg index. Discret. Appl. Math. 184: 202-212 (2015) - 2014
- [j4]Jelena Sedlar, Damir Vukicevic, Franco Cataldo, Ottorino Ori, Ante Graovac:
Compression ratio of Wiener index in 2-d rectangular and polygonal lattices. Ars Math. Contemp. 7(1): 1-12 (2014) - 2012
- [j3]Jelena Sedlar:
The global forcing number of the parallelogram polyhex. Discret. Appl. Math. 160(15): 2306-2313 (2012) - 2011
- [j2]Jelena Sedlar, Damir Vukicevic, Pierre Hansen:
Using size for bounding expressions of graph invariants. Ann. Oper. Res. 188(1): 415-427 (2011) - 2010
- [j1]Jelena Sedlar, Damir Vukicevic, Mustapha Aouchiche, Pierre Hansen:
Variable Neighborhood Search for Extremal Graphs, 24. Results about the clique number. Stud. Inform. Univ. 8(2): 281-316 (2010)
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-10-07 21:22 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:
