Vida Vukašinović

Vida Vukašinović

Auto-generated profile, based on publicly available information

Vida Vukašinović

Computer Systems Department Jožef Stefan Institute Ljubljana Slovenia

Research Focus & Metrics

Academic Career Length

17Years (2010-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
21 May 2022 in Renewable and Sustainable Energy Reviews
Verified
Journal Article
Open access
GPGregor Papa
Gregor Papa
MZMarina Santo Zarnik
Marina Santo Zarnik
VVVida Vukašinović
Vida Vukašinović

1 September 2014 in International Journal of Applied Mathematics and Computer Science
Verified
Journal Article
Open access
VVVida Vukašinović
Vida Vukašinović
JŠJurij Šilc
Jurij Šilc
RŠRisth Škrekovski
Risth Škrekovski
An acquaintance network is a social structure made up of a set of actors and the ties between them. These ties change dynamically as a consequence of incessant interactions between the actors. In this paper we introduce a social network model called the Interaction-Based (IB) model that involves well-known sociological principles. The connections between the actors and the strength of the connections are influenced by the continuous positive and negative interactions between the actors and, vice versa, the future interactions are more likely to happen between the actors that are connected with stronger ties. The model is also inspired by the social behavior of animal species, particularly that of ants in their colony. A model evaluation showed that the IB model turned out to be sparse. The model has a small diameter and an average path length that grows in proportion to the logarithm of the number of vertices. The clustering coefficient is relatively high, and its value stabilizes in larger networks. The degree distributions are slightly right-skewed. In the mature phase of the IB model, i.e., when the number of edges does not change significantly, most of the network properties do not change significantly either. The IB model was found to be the best of all the compared models in simulating the e-mail URV (University Rovira i Virgili of Tarragona) network because the properties of the IB model more closely matched those of the e-mail URV network than the other model

1 July 2013 in Information Sciences
Verified
Journal Article
Closed access
VVVida Vukašinović
Vida Vukašinović
PGPetr Gregor
Petr Gregor
RŠRiste Škrekovski
Riste Škrekovski

1 March 2012 in Engineering Applications of Artificial Intelligence
Verified
Journal Article
Closed access
GPGregor Papa
Gregor Papa
VVVida Vukašinović
Vida Vukašinović
PKPeter Korošec
Peter Korošec

1 January 2012 in SIAM Journal on Discrete Mathematics
Verified
Journal Article
Closed access
PGPetr Gregor
Petr Gregor
RŠRiste Škrekovski
Riste Škrekovski
VVVida Vukašinović
Vida Vukašinović
A queue layout of a graph consists of a linear ordering $\sigma$ of its vertices and a partition of its edges into sets, called queues, such that in each set no two edges are nested with respect to $\sigma$. We show that the n-dimensional hypercube $Q_n$ has a layout into $n-\lfloor \log_2 n \rfloor$ queues for all $n\ge 1$. On the other hand, for every $\varepsilon>0$, every queue layout of $Q_n$ has more than $(\frac{1}{2}-\varepsilon) n-O(1/\varepsilon)$ queues and, in particular, more than $(n-2)/3$ queues. This improves previously known upper and lower bounds on the minimal number of queues in a queue layout of $Q_n$. For the lower bound we employ a new technique of out-in representations and contractions which may be of independent interest.

1 September 2015 in Applied Mathematics and Computation
Verified
Journal Article
Closed access
PGPetr Gregor
Petr Gregor
RŠRiste Škrekovski
Riste Škrekovski
VVVida Vukašinović
Vida Vukašinović