default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDVesna Irsic
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j14]Bostjan Bresar, Csilla Bujtás, Vesna Irsic
, Douglas F. Rall, Zsolt Tuza:
Indicated domination game. Discret. Math. 347(9): 114060 (2024)- [i2]Vesna Irsic, Bojan Mohar, Alexandra Wesolek:
Cops and Robber on Hyperbolic Manifolds. CoRR abs/2402.05753 (2024) - [i1]Calum Buchanan, MacKenzie Carr, Alexander Clifton, Stephen G. Hartke, Vesna Irsic, Nicholas Sieger, Rebecca Whitman:
Trail Trap: a variant of Partizan Edge Geography. CoRR abs/2405.05195 (2024) - 2023
- [j13]Vesna Irsic, Marusa Lekse, Mihael Pacnik, Petra Podlogar, Martin Pracek:
Domination and independence number of large 2-crossing-critical graphs. Ars Math. Contemp. 23(4) (2023) - 2022
- [j12]Csilla Bujtás, Vesna Irsic, Sandi Klavzar:
1/2-conjectures on the domination game and claw-free graphs. Eur. J. Comb. 101: 103467 (2022) - [j11]Csilla Bujtás, Vesna Irsic, Sandi Klavzar:
Predominating a Vertex in the Connected Domination Game. Graphs Comb. 38(3): 77 (2022) - 2021
- [j10]Kexiang Xu, Aleksandar Ilic, Vesna Irsic, Sandi Klavzar, Huimin Li:
Comparing Wiener complexity with eccentric complexity. Discret. Appl. Math. 290: 7-16 (2021) - [j9]Ömer Egecioglu, Vesna Irsic:
Fibonacci-run graphs I: Basic properties. Discret. Appl. Math. 295: 70-84 (2021) - [j8]Ömer Egecioglu, Vesna Irsic:
Fibonacci-run graphs II: Degree sequences. Discret. Appl. Math. 300: 56-71 (2021) - 2020
- [j7]Valentin Gledel, Michael A. Henning, Vesna Irsic, Sandi Klavzar:
Maker-Breaker total domination game. Discret. Appl. Math. 282: 96-107 (2020) - [j6]Csilla Bujtás, Vesna Irsic, Sandi Klavzar:
Z-domination game. Discret. Math. 343(11): 112076 (2020)
2010 – 2019
- 2019
- [j5]Valentin Gledel, Vesna Irsic, Sandi Klavzar:
Strong geodetic cores and Cartesian product graphs. Appl. Math. Comput. 363 (2019) - [j4]Vesna Irsic, Matjaz Konvalinka:
Strong geodetic problem on complete multipartite graphs. Ars Math. Contemp. 17(2): 481-491 (2019) - [j3]Vesna Irsic:
Effect of predomination and vertex removal on the game total domination number of a graph. Discret. Appl. Math. 257: 216-225 (2019) - [c1]Valentin Gledel, Vesna Irsic, Sandi Klavzar:
Fast Winning Strategies for the Maker-Breaker Domination Game. LAGOS 2019: 473-484 - 2018
- [j2]Vesna Irsic:
Strong Geodetic Number of Complete Bipartite Graphs and of Graphs with Specified Diameter. Graphs Comb. 34(3): 443-456 (2018) - [j1]Vesna Irsic, Sandi Klavzar:
Strong geodetic problem on Cartesian products of graphs. RAIRO Oper. Res. 52(1): 205-216 (2018)
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-05 21:08 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:
