Author of the publication

Greedily Improving Our Own Closeness Centrality in a Network.

, , , and . ACM Trans. Knowl. Discov. Data, 11 (1): 9:1-9:32 (2016)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

No persons found for author name Velaj, Yllka
add a person with the name Velaj, Yllka
 

Other publications of authors with the same name

Influence Maximization in the Independent Cascade Model., , and . ICTCS, volume 1720 of CEUR Workshop Proceedings, page 269-274. CEUR-WS.org, (2016)Recommending Links to Maximize the Influence in Social Networks., , and . IJCAI, page 2195-2201. ijcai.org, (2019)The Impact of Cluster Centroid and Text Review Embeddings on Recommendation Methods., , , , , and . WWW (Companion Volume), page 589-592. ACM, (2024)Generalized budgeted submodular set function maximization., , , and . Inf. Comput., (2021)The Multi-budget Maximum Weighted Coverage Problem., , , and . CIAC, volume 12701 of Lecture Notes in Computer Science, page 173-186. Springer, (2021)Designing a Data Science Course for Non-Computer Science Students: Practical Considerations and Findings., , , , and . FIE, page 1-9. IEEE, (2022)Greedily Improving Our Own Closeness Centrality in a Network., , , and . ACM Trans. Knowl. Discov. Data, 11 (1): 9:1-9:32 (2016)Stable outcomes in modified fractional hedonic games., , and . Auton. Agents Multi Agent Syst., 34 (1): 4 (2020)Generalized Budgeted Submodular Set Function Maximization., , , and . MFCS, volume 117 of LIPIcs, page 31:1-31:14. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2018)Approximate Pricing in Networks: How to Boost the Betweenness and Revenue of a Node., , , and . ISAAC, volume 149 of LIPIcs, page 13:1-13:15. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2019)