Yllka Velaj

Orcid: 0000-0002-5734-271X

Affiliations:
  • University of Vienna, Faculty of Computer Science, Austria


According to our database1, Yllka Velaj authored at least 25 papers between 2015 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
The Impact of Cluster Centroid and Text Review Embeddings on Recommendation Methods.
Proceedings of the Companion Proceedings of the ACM on Web Conference 2024, 2024

Estimate and Reduce Uncertainty in Uncertain Graphs.
Proceedings of the 11th IEEE International Conference on Data Science and Advanced Analytics, 2024

2023
Semi-Supervised Embedding of Attributed Multiplex Networks.
Proceedings of the ACM Web Conference 2023, 2023

Analyzing the Communication Clusters in Datacenters✱.
Proceedings of the ACM Web Conference 2023, 2023

Teaching Data Science to Non-Computer Science Students: A Learner-Centered Approach.
Proceedings of the IEEE Frontiers in Education Conference, 2023

2022
Designing a Data Science Course for Non-Computer Science Students: Practical Considerations and Findings.
Proceedings of the IEEE Frontiers in Education Conference, 2022

2021
Link Recommendation for Social Influence Maximization.
ACM Trans. Knowl. Discov. Data, 2021

Shortest Paths and Centrality in Uncertain Networks.
Proc. VLDB Endow., 2021

Generalized budgeted submodular set function maximization.
Inf. Comput., 2021

Additively Separable Hedonic Games with Social Context.
Games, 2021

Spectral Clustering of Attributed Multi-relational Graphs.
Proceedings of the KDD '21: The 27th ACM SIGKDD Conference on Knowledge Discovery and Data Mining, 2021

The Multi-budget Maximum Weighted Coverage Problem.
Proceedings of the Algorithms and Complexity - 12th International Conference, 2021

2020
Stable outcomes in modified fractional hedonic games.
Auton. Agents Multi Agent Syst., 2020

2019
Recommending links through influence maximization.
Theor. Comput. Sci., 2019

Recommending Links to Control Elections via Social Influence.
Algorithms, 2019

Approximate Pricing in Networks: How to Boost the Betweenness and Revenue of a Node.
Proceedings of the 30th International Symposium on Algorithms and Computation, 2019

Recommending Links to Maximize the Influence in Social Networks.
Proceedings of the Twenty-Eighth International Joint Conference on Artificial Intelligence, 2019

On the Performance of Stable Outcomes in Modified Fractional Hedonic Games with Egalitarian Social Welfare.
Proceedings of the 18th International Conference on Autonomous Agents and MultiAgent Systems, 2019

2018
Improving the Betweenness Centrality of a Node by Adding Links.
ACM J. Exp. Algorithmics, 2018

Hedonic Games with Social Context.
Proceedings of the 19th Italian Conference on Theoretical Computer Science, 2018

2017
Selecting Nodes and Buying Links to Maximize the Information Diffusion in a Network.
Proceedings of the 42nd International Symposium on Mathematical Foundations of Computer Science, 2017

2016
Greedily Improving Our Own Closeness Centrality in a Network.
ACM Trans. Knowl. Discov. Data, 2016

Influence Maximization in the Independent Cascade Model.
Proceedings of the 17th Italian Conference on Theoretical Computer Science, 2016

2015
On the Maximum Betweenness Improvement Problem.
Proceedings of the 16th Italian Conference on Theoretical Computer Science, 2015

Greedily Improving Our Own Centrality in A Network.
Proceedings of the Experimental Algorithms - 14th International Symposium, 2015


  Loading...