Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDYllka Velaj
Person information
- affiliation: University of Vienna, Faculty of Computer Science, Austria
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
Journal Articles
- 2021
[j9]Gianpiero Monaco, Luca Moscardelli, Yllka Velaj:
Additively Separable Hedonic Games with Social Context. Games 12(3): 71 (2021)- [j8]Francesco Cellinese, Gianlorenzo D'Angelo
, Gianpiero Monaco, Yllka Velaj:
Generalized budgeted submodular set function maximization. Inf. Comput. 281: 104741 (2021) - [j7]Arkaprava Saha, Ruben Brokkelkamp, Yllka Velaj, Arijit Khan, Francesco Bonchi:
Shortest Paths and Centrality in Uncertain Networks. Proc. VLDB Endow. 14(7): 1188-1201 (2021) - [j6]Federico Coro, Gianlorenzo D'Angelo, Yllka Velaj:
Link Recommendation for Social Influence Maximization. ACM Trans. Knowl. Discov. Data 15(6): 94:1-94:23 (2021) - 2020
- [j5]Gianpiero Monaco, Luca Moscardelli, Yllka Velaj:
Stable outcomes in modified fractional hedonic games. Auton. Agents Multi Agent Syst. 34(1): 4 (2020) - 2019
- [j4]Federico Corò, Gianlorenzo D'Angelo, Yllka Velaj:
Recommending Links to Control Elections via Social Influence. Algorithms 12(10): 207 (2019) - [j3]Gianlorenzo D'Angelo, Lorenzo Severini, Yllka Velaj:
Recommending links through influence maximization. Theor. Comput. Sci. 764: 30-41 (2019) - 2018
- [j2]Elisabetta Bergamini, Pierluigi Crescenzi, Gianlorenzo D'Angelo, Henning Meyerhenke, Lorenzo Severini, Yllka Velaj:
Improving the Betweenness Centrality of a Node by Adding Links. ACM J. Exp. Algorithmics 23 (2018) - 2016
- [j1]Pierluigi Crescenzi, Gianlorenzo D'Angelo, Lorenzo Severini, Yllka Velaj:
Greedily Improving Our Own Closeness Centrality in a Network. ACM Trans. Knowl. Discov. Data 11(1): 9:1-9:32 (2016)
Conference and Workshop Papers
- 2024
- [c17]Peter Dolog, Ylli Sadikaj, Yllka Velaj, Andreas Stephan, Benjamin Roth, Claudia Plant:
The Impact of Cluster Centroid and Text Review Embeddings on Recommendation Methods. WWW (Companion Volume) 2024: 589-592 - 2023
- [c16]Yllka Velaj, Dominik Dolezal, Roland Ambros, Claudia Plant, Renate Motschnig:
Teaching Data Science to Non-Computer Science Students: A Learner-Centered Approach. FIE 2023: 1-9 - [c15]Ylli Sadikaj, Justus Rass, Yllka Velaj, Claudia Plant:
Semi-Supervised Embedding of Attributed Multiplex Networks. WWW 2023: 578-587 - [c14]Klaus-Tycho Foerster, Thibault Marette, Stefan Neumann, Claudia Plant, Ylli Sadikaj, Stefan Schmid, Yllka Velaj:
Analyzing the Communication Clusters in Datacenters✱. WWW 2023: 3022-3032 - 2022
- [c13]Yllka Velaj, Dominik Dolezal, Roland Ambros, Claudia Plant, Renate Motschnig:
Designing a Data Science Course for Non-Computer Science Students: Practical Considerations and Findings. FIE 2022: 1-9 - 2021
- [c12]Francesco Cellinese, Gianlorenzo D'Angelo, Gianpiero Monaco, Yllka Velaj:
The Multi-budget Maximum Weighted Coverage Problem. CIAC 2021: 173-186 - [c11]Ylli Sadikaj, Yllka Velaj, Sahar Behzadi, Claudia Plant:
Spectral Clustering of Attributed Multi-relational Graphs. KDD 2021: 1431-1440 - 2019
- [c10]Gianpiero Monaco, Luca Moscardelli, Yllka Velaj:
On the Performance of Stable Outcomes in Modified Fractional Hedonic Games with Egalitarian Social Welfare. AAMAS 2019: 873-881 - [c9]Federico Corò, Gianlorenzo D'Angelo, Yllka Velaj:
Recommending Links to Maximize the Influence in Social Networks. IJCAI 2019: 2195-2201 - [c8]Ruben Brokkelkamp, Sven C. Polak, Guido Schäfer, Yllka Velaj:
Approximate Pricing in Networks: How to Boost the Betweenness and Revenue of a Node. ISAAC 2019: 13:1-13:15 - 2018
- [c7]Gianpiero Monaco, Luca Moscardelli, Yllka Velaj:
Stable Outcomes in Modified Fractional Hedonic Games. AAMAS 2018: 937-945 - [c6]Gianpiero Monaco, Luca Moscardelli, Yllka Velaj:
Hedonic Games with Social Context. ICTCS 2018: 24-35 - [c5]Francesco Cellinese, Gianlorenzo D'Angelo, Gianpiero Monaco, Yllka Velaj:
Generalized Budgeted Submodular Set Function Maximization. MFCS 2018: 31:1-31:14 - 2017
- [c4]Gianlorenzo D'Angelo, Lorenzo Severini, Yllka Velaj:
Selecting Nodes and Buying Links to Maximize the Information Diffusion in a Network. MFCS 2017: 75:1-75:14 - 2016
- [c3]Gianlorenzo D'Angelo, Lorenzo Severini, Yllka Velaj:
Influence Maximization in the Independent Cascade Model. ICTCS 2016: 269-274 - 2015
- [c2]Pierluigi Crescenzi, Gianlorenzo D'Angelo, Lorenzo Severini, Yllka Velaj:
Greedily Improving Our Own Centrality in A Network. SEA 2015: 43-55 - [c1]Gianlorenzo D'Angelo, Lorenzo Severini, Yllka Velaj:
On the Maximum Betweenness Improvement Problem. ICTCS 2015: 153-168
Informal and Other Publications
- 2023
- [i6]Ylli Sadikaj, Yllka Velaj, Sahar Behzadi, Claudia Plant:
Spectral Clustering of Attributed Multi-relational Graphs. CoRR abs/2311.01840 (2023) - 2018
- [i5]Gianpiero Monaco, Luca Moscardelli, Yllka Velaj:
Stable Outcomes in Modified Fractional Hedonic Games. CoRR abs/1804.05040 (2018) - [i4]Francesco Cellinese, Gianlorenzo D'Angelo, Gianpiero Monaco, Yllka Velaj:
Generalized budgeted submodular set function maximization. CoRR abs/1808.03085 (2018) - 2017
- [i3]Elisabetta Bergamini, Pierluigi Crescenzi, Gianlorenzo D'Angelo, Henning Meyerhenke, Lorenzo Severini, Yllka Velaj:
Improving the betweenness centrality of a node by adding links. CoRR abs/1702.05284 (2017) - [i2]Gianlorenzo D'Angelo, Lorenzo Severini, Yllka Velaj:
Recommending links through influence maximization. CoRR abs/1706.04368 (2017) - [i1]Gianlorenzo D'Angelo, Lorenzo Severini, Yllka Velaj:
Selecting nodes and buying links to maximize the information diffusion in a network. CoRR abs/1706.06466 (2017)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-05-19 02:40 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
