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
462016
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
362018
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
352015
Stable Outcomes in Modified Fractional Hedonic Games
G Monaco, L Moscardelli, V Yllka
17th International Conference on Autonomous Agents and MultiAgent Systems …, 2018
282018
On the maximum betweenness improvement problem
G D'Angelo, L Severini, Y Velaj
Electronic Notes in Theoretical Computer Science 322, 153-168, 2016
212016
Recommending links through influence maximization
G D'Angelo, L Severini, Y Velaj
Theoretical Computer Science 764, 30-41, 2019
202019
Influence Maximization in the Independent Cascade Model.
G D'Angelo, L Severini, Y Velaj
ICTCS, 269-274, 2016
182016
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
152019
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
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
82019
Recommending links to control elections via social influence
F Corò, G D’Angelo, Y Velaj
Algorithms 12 (10), 207, 2019
42019
Hedonic Games with Social Context.
G Monaco, L Moscardelli, Y Velaj
ICTCS, 24-35, 2018
32018
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
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
12021
Additively Separable Hedonic Games with Social Context
G Monaco, L Moscardelli, Y Velaj
Games 12 (3), 71, 2021
2021
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
2021
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
2021
The Multi-budget Maximum Weighted Coverage Problem
F Cellinese, G D’Angelo, G Monaco, Y Velaj
Algorithms and Complexity: 12th International Conference, CIAC 2021, Virtual …, 2021
2021
Approximate pricing in networks: How to boost the betweenness and revenue of a node
R Brokkelkamp, S Polak, G Schäfer, Y Velaj
30th International Symposium on Algorithms and Computation (ISAAC 2019), 2019
2019
Information spreading with network augmentation
Y Velaj
Gran Sasso Science Institute, 2017
2017
The system can't perform the operation now. Try again later.
Articles 1–20