Folgen
Yllka Velaj
Yllka Velaj
Faculty of Computer Science, University of Vienna
Bestätigte E-Mail-Adresse bei univie.ac.at
Titel
Zitiert von
Zitiert von
Jahr
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
672016
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
532018
Stable Outcomes in Modified Fractional Hedonic Games
G Monaco, L Moscardelli, V Yllka
17th International Conference on Autonomous Agents and MultiAgent Systems …, 2018
392018
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
392015
Recommending links through influence maximization
G D'Angelo, L Severini, Y Velaj
Theoretical Computer Science 764, 30-41, 2019
352019
Influence Maximization in the Independent Cascade Model.
G D'Angelo, L Severini, Y Velaj
ICTCS 1, 269-274, 2016
242016
On the maximum betweenness improvement problem
G D'Angelo, L Severini, Y Velaj
Electronic Notes in Theoretical Computer Science 322, 153-168, 2016
242016
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
232019
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
152021
Recommending links to maximize the influence in social networks
F Corò, G D'Angelo, Y Velaj
Proceedings of the Twenty-Eighth International Joint Conference on …, 2019
132019
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
132017
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
112021
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
102021
Recommending links to control elections via social influence
F Corò, G D’Angelo, Y Velaj
Algorithms 12 (10), 207, 2019
52019
Hedonic Games with Social Context.
G Monaco, L Moscardelli, Y Velaj
ICTCS, 24-35, 2018
52018
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
42018
Analyzing the Communication Clusters in Datacenters✱
KT Foerster, T Marette, S Neumann, C Plant, Y Sadikaj, S Schmid, Y Velaj
Proceedings of the ACM Web Conference 2023, 3022-3032, 2023
12023
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 IEEE Frontiers in Education Conference (FIE), 1-9, 2022
12022
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
12021
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
12019
Das System kann den Vorgang jetzt nicht ausführen. Versuchen Sie es später erneut.
Artikel 1–20