Follow
Yllka Velaj
Yllka Velaj
Faculty of Computer Science, University of Vienna
Verified email at univie.ac.at
Title
Cited by
Cited by
Year
Greedily improving our own closeness centrality in a network
P Crescenzi, G D'angelo, L Severini, Y Velaj
ACM Transactions on Knowledge Discovery from Data (TKDD) 11 (1), 1-32, 2016
512016
Improving the betweenness centrality of a node by adding links
E Bergamini, P Crescenzi, G D'angelo, H Meyerhenke, L Severini, Y Velaj
Journal of Experimental Algorithmics (JEA) 23, 1-32, 2018
402018
Greedily improving our own centrality in a network
P Crescenzi, G d’Angelo, L Severini, Y Velaj
International Symposium on Experimental Algorithms, 43-55, 2015
372015
Stable Outcomes in Modified Fractional Hedonic Games
G Monaco, L Moscardelli, V Yllka
17th International Conference on Autonomous Agents and MultiAgent Systemsá…, 2018
322018
Recommending links through influence maximization
G D'Angelo, L Severini, Y Velaj
Theoretical Computer Science 764, 30-41, 2019
262019
On the performance of stable outcomes in modified fractional hedonic games with egalitarian social welfare
G Monaco, L Moscardelli, Y Velaj
Proceedings of the 18th International Conference on Autonomous Agents andá…, 2019
222019
On the maximum betweenness improvement problem
G D'Angelo, L Severini, Y Velaj
Electronic Notes in Theoretical Computer Science 322, 153-168, 2016
212016
Influence Maximization in the Independent Cascade Model.
G D'Angelo, L Severini, Y Velaj
ICTCS 1, 269-274, 2016
182016
Recommending links to maximize the influence in social networks
F Cor˛, G D'Angelo, Y Velaj
IJCAI 2019: the 28th International Joint Conference on Artificialá…, 2019
92019
Selecting Nodes and Buying Links to Maximize the Information Diffusion in a Network
G D'Angelo, L Severini, Y Velaj
42nd International Symposium on Mathematical Foundations of Computer Scienceá…, 2017
92017
Shortest paths and centrality in uncertain networks
A Saha, R Brokkelkamp, Y Velaj, A Khan, F Bonchi
Proceedings of the VLDB Endowment 14 (7), 1188-1201, 2021
72021
Hedonic Games with Social Context.
G Monaco, L Moscardelli, Y Velaj
ICTCS, 24-35, 2018
52018
Recommending links to control elections via social influence
F Cor˛, G D’Angelo, Y Velaj
Algorithms 12 (10), 207, 2019
42019
Spectral Clustering of Attributed Multi-relational Graphs
Y Sadikaj, Y Velaj, S Behzadi, C Plant
Proceedings of the 27th ACM SIGKDD Conference on Knowledge Discovery & Dataá…, 2021
32021
Generalized Budgeted Submodular Set Function Maximization
F Cellinese, G D'Angelo, G Monaco, Y Velaj
43rd International Symposium on Mathematical Foundations of Computer Scienceá…, 2018
32018
Link recommendation for social influence maximization
F Corˇ, G D’angelo, Y Velaj
ACM Transactions on Knowledge Discovery from Data (TKDD) 15 (6), 1-23, 2021
22021
Designing a Data Science Course for Non-Computer Science Students: Practical Considerations and Findings
Y Velaj, D Dolezal, R Ambros, C Plant, R Motschnig
2022
Additively Separable Hedonic Games with Social Context
G Monaco, L Moscardelli, Y Velaj
Games 12 (3), 71, 2021
2021
The Multi-budget Maximum Weighted Coverage Problem
F Cellinese, G D’Angelo, G Monaco, Y Velaj
International Conference on Algorithms and Complexity, 173-186, 2021
2021
MPSP Centrality
A Saha, KR Brokkelkamp, Y Velaj
2021
The system can't perform the operation now. Try again later.
Articles 1–20