Personal information

Emails & domains

Verified email domains

Websites & social links

https://rbnbckr.github.io

Other IDs

Scopus Author ID: 56493938500

Countries

Italy

Activities

Collapse all

Works (21)

Improving Fairness in Information Exposure by Adding Links

Proceedings of the AAAI Conference on Artificial Intelligence
2023-06-26 | Conference paper
DOI: 10.1609/aaai.v37i12.26652
Part of ISSN: 2374-3468
Part of ISSN: 2159-5399
Contributors: Ruben Becker; Gianlorenzo D'Angelo; Sajjad Ghobadi
Source: Self-asserted source
Ruben Becker

On the Cost of Demographic Parity in Influence Maximization

Proceedings of the AAAI Conference on Artificial Intelligence
2023-06-26 | Conference paper
DOI: 10.1609/aaai.v37i12.26651
Part of ISSN: 2374-3468
Part of ISSN: 2159-5399
Contributors: Ruben Becker; Gianlorenzo D'Angelo; Sajjad Ghobadi
Source: Self-asserted source
Ruben Becker

Fairness in Influence Maximization through Randomization

Journal of Artificial Intelligence Research
2022 | Journal article
DOI: 10.1613/jair.1.13367
EID:

2-s2.0-85129588177

Part of ISSN: 10769757
Contributors: Becker, R.; D'Angelo, G.; Ghobadi, S.; Gilbert, H.
Source: Self-asserted source
Ruben Becker via Scopus - Elsevier

Fairness in Influence Maximization through Randomization

35th AAAI Conference on Artificial Intelligence, AAAI 2021
2021 | Conference paper
EID:

2-s2.0-85111190088
Contributors: Becker, R.; D'Angelo, G.; Ghobadi, S.; Gilbert, H.
Source: Self-asserted source
Ruben Becker via Scopus - Elsevier

Group-harmonic and group-closeness maximization - Approximation and engineering

Proceedings of the Workshop on Algorithm Engineering and Experiments
2021 | Conference paper
EID:

2-s2.0-85105367089

Part of ISSN: 21640300
Contributors: Angriman, E.; Becker, R.; D'Angelo, G.; Gilbert, H.; van der Grinten, A.; Meyerhenke, H.
Source: Self-asserted source
Ruben Becker via Scopus - Elsevier

Influence Maximization with Co-Existing Seeds

International Conference on Information and Knowledge Management, Proceedings
2021 | Conference paper
DOI: 10.1145/3459637.3482439
EID:

2-s2.0-85119212470
Contributors: Becker, R.; D'Angelo, G.; Gilbert, H.
Source: Self-asserted source
Ruben Becker via Scopus - Elsevier

Maximizing influence-based group shapley centrality

Proceedings of the International Joint Conference on Autonomous Agents and Multiagent Systems, AAMAS
2021 | Conference paper
EID:

2-s2.0-85112299751

Part of ISSN: 15582914 15488403
Contributors: Becker, R.; D'Angelo, G.; Gilbert, H.
Source: Self-asserted source
Ruben Becker via Scopus - Elsevier

Near-optimal approximate shortest paths and transshipment in distributed and streaming models

SIAM Journal on Computing
2021 | Journal article
DOI: 10.1137/19M1286955
EID:

2-s2.0-85106893020

Part of ISSN: 10957111 00975397
Contributors: BECKER, R.; FORSTER, S.; KARRENBAUER, A.; LENZEN, C.
Source: Self-asserted source
Ruben Becker via Scopus - Elsevier

Unveiling the Truth in Liquid Democracy with Misinformed Voters

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
2021 | Book
DOI: 10.1007/978-3-030-87756-9_9
EID:

2-s2.0-85118986601

Part of ISSN: 16113349 03029743
Contributors: Becker, R.; D’Angelo, G.; Delfaraz, E.; Gilbert, H.
Source: Self-asserted source
Ruben Becker via Scopus - Elsevier

Balancing spreads of influence in a social network

AAAI 2020 - 34th AAAI Conference on Artificial Intelligence
2020 | Conference paper
EID:

2-s2.0-85105122216
Contributors: Becker, R.; Corò, F.; D’Angelo, G.; Gilbert, H.
Source: Self-asserted source
Ruben Becker via Scopus - Elsevier

Low diameter graph decompositions by approximate distance computation

Leibniz International Proceedings in Informatics, LIPIcs
2020 | Conference paper
DOI: 10.4230/LIPIcs.ITCS.2020.50
EID:

2-s2.0-85078051460

Part of ISSN: 18688969
Contributors: Becker, R.; Emek, Y.; Lenzen, C.
Source: Self-asserted source
Ruben Becker via Scopus - Elsevier

Distributed algorithms for low stretch spanning trees

Leibniz International Proceedings in Informatics, LIPIcs
2019 | Conference paper
DOI: 10.4230/LIPIcs.DISC.2019.4
EID:

2-s2.0-85074558237

Part of ISSN: 18688969
Contributors: Becker, R.; Emek, Y.; Ghaffari, M.; Lenzen, C.
Source: Self-asserted source
Ruben Becker via Scopus - Elsevier

Subspace Determination Through Local Intrinsic Dimensional Decomposition

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
2019 | Book
DOI: 10.1007/978-3-030-32047-8_25
EID:

2-s2.0-85076115782

Part of ISSN: 16113349 03029743
Contributors: Becker, R.; Hafnaoui, I.; Houle, M.E.; Li, P.; Zimek, A.
Source: Self-asserted source
Ruben Becker via Scopus - Elsevier

Two results on slime mold computations

Theoretical Computer Science
2019 | Journal article
DOI: 10.1016/j.tcs.2018.08.027
EID:

2-s2.0-85052990361
Contributors: Becker, R.; Bonifaci, V.; Karrenbauer, A.; Kolev, P.; Mehlhorn, K.
Source: Self-asserted source
Ruben Becker via Scopus - Elsevier

A near-optimal subdivision algorithm for complex root isolation based on the Pellet test and Newton iteration

Journal of Symbolic Computation
2018 | Journal article
DOI: 10.1016/j.jsc.2017.03.009
EID:

2-s2.0-85018976768
Contributors: Becker, R.; Sagraloff, M.; Sharma, V.; Yap, C.
Source: Self-asserted source
Ruben Becker via Scopus - Elsevier
grade
Preferred source (of 2)‎

On Flows, Paths, Roots, and Zeros

2018-09-04 | Dissertation or Thesis
DOI: 10.22028/d291-27334
Source: Self-asserted source
Ruben Becker

From DQBF to QBF by dependency elimination

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
2017 | Book
DOI: 10.1007/978-3-319-66263-3_21
EID:

2-s2.0-85028725572
Contributors: Wimmer, R.; Karrenbauer, A.; Becker, R.; Scholl, C.; Becker, B.
Source: Self-asserted source
Ruben Becker via Scopus - Elsevier

Near-Optimal Approximate Shortest Paths and Transshipment in Distributed and Streaming Models

Leibniz International Proceedings in Informatics, LIPIcs
2017 | Conference paper
DOI: 10.4230/LIPIcs.DISC.2017.7
EID:

2-s2.0-85032359417
Contributors: Becker, R.; Karrenbauer, A.; Krinninger, S.; Lenzen, C.
Source: Self-asserted source
Ruben Becker via Scopus - Elsevier

A novel dual ascent algorithm for solving the min-cost flow problem

Proceedings of the Workshop on Algorithm Engineering and Experiments
2016 | Conference paper
EID:

2-s2.0-84964088583
Contributors: Becker, R.; Fickert, M.; Karrenbauer, A.
Source: Self-asserted source
Ruben Becker via Scopus - Elsevier

Complexity analysis of root clustering for a complex polynomial

Proceedings of the International Symposium on Symbolic and Algebraic Computation, ISSAC
2016 | Conference paper
DOI: 10.1145/2930889.2930939
EID:

2-s2.0-84984600078
Contributors: Becker, R.; Sagraloff, M.; Sharma, V.; Xu, J.; Yap, C.
Source: Self-asserted source
Ruben Becker via Scopus - Elsevier

A simple efficient interior point method for min-cost flow

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
2014 | Book
DOI: 10.1007/978-3-319-13075-0_59
EID:

2-s2.0-84921805748
Contributors: Becker, R.; Karrenbauer, A.
Source: Self-asserted source
Ruben Becker via Scopus - Elsevier

Peer review (1 review for 1 publication/grant)

Review activity for Distributed computing. (1)
How many people are using ORCID?