default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDVida Vukasinovic
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2022
[j11]Rok Hribar, Timotej Hrga, Gregor Papa
, Gasper Petelin, Janez Povh, Natasa Przulj, Vida Vukasinovic:
Four algorithms to solve symmetric multi-type non-negative matrix tri-factorization problem. J. Glob. Optim. 82(2): 283-312 (2022)- 2020
- [c3]Vida Vukasinovic, David Kubon, Riste Skrekovski, Petr Gregor:
Redundant binary representations with rigorous trade-off between connectivity and locality. GECCO Companion 2020: 325-326 - [i2]Rok Hribar, Timotej Hrga, Gregor Papa, Gasper Petelin, Janez Povh, Natasa Przulj, Vida Vukasinovic:
Four algorithms to solve symmetric multi-type non-negative matrix tri-factorization problem. CoRR abs/2012.05963 (2020)
2010 – 2019
- 2019
- [j10]Qiang Sun, Barbara Ikica, Riste Skrekovski, Vida Vukasinovic:
Graphs with a given diameter that maximise the Wiener index. Appl. Math. Comput. 356: 438-448 (2019) - 2018
- [j9]Petr Gregor, Riste Skrekovski, Vida Vukasinovic:
Modelling simultaneous broadcasting by level-disjoint partitions. Appl. Math. Comput. 325: 15-23 (2018) - [j8]Petr Gregor, Riste Skrekovski, Vida Vukasinovic:
Broadcasting multiple messages in the 1-in port model in optimal time. J. Comb. Optim. 36(4): 1333-1355 (2018) - 2016
- [j7]Jelena Govorcin, Riste Skrekovski, Vida Vukasinovic, Damir Vukicevic:
A measure for a balanced workload and its extremal values. Discret. Appl. Math. 200: 59-66 (2016) - [c2]Petr Gregor, Riste Skrekovski, Vida Vukasinovic:
Time-Optimal Broadcasting of Multiple Messages in 1-in Port Model. COCOA 2016: 144-158 - [i1]Petr Gregor, Riste Skrekovski, Vida Vukasinovic:
Modelling simultaneous broadcasting by level-disjoint partitions. CoRR abs/1609.01116 (2016) - 2015
- [j6]Petr Gregor, Riste Skrekovski, Vida Vukasinovic:
Rooted level-disjoint partitions of Cartesian products. Appl. Math. Comput. 266: 244-258 (2015) - 2014
- [j5]Vida Vukasinovic, Jurij Silc, Riste Skrekovski:
Modeling acquaintance networks based on balance theory. Int. J. Appl. Math. Comput. Sci. 24(3): 683-696 (2014) - 2013
- [j4]Vida Vukasinovic, Petr Gregor, Riste Skrekovski:
On the mutually independent Hamiltonian cycles in faulty hypercubes. Inf. Sci. 236: 224-235 (2013) - 2012
- [j3]Gregor Papa, Vida Vukasinovic, Peter Korosec:
Guided restarting local search for production planning. Eng. Appl. Artif. Intell. 25(2): 242-253 (2012) - [j2]Petr Gregor, Riste Skrekovski, Vida Vukasinovic:
Queue Layouts of Hypercubes. SIAM J. Discret. Math. 26(1): 77-88 (2012) - 2011
- [j1]Petr Gregor, Riste Skrekovski, Vida Vukasinovic:
On the queue-number of the hypercube. Electron. Notes Discret. Math. 38: 413-418 (2011) - 2010
- [c1]Vida Vukasinovic, Peter Korosec, Gregor Papa:
Hybrid Parameter-less Evolutionary Algorithm in Production Planning. IJCCI (ICEC) 2010: 231-236
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-04-24 22:56 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:
