Ruben Becker
Cited by
Cited by
Near-Optimal Approximate Shortest Paths and Transshipment in Distributed and Streaming Models
R Becker, S Forster, A Karrenbauer, C Lenzen
SIAM Journal on Computing 50 (3), 815-856, 2021
A near-optimal subdivision algorithm for complex root isolation based on the Pellet test and Newton iteration
R Becker, M Sagraloff, V Sharma, C Yap
Journal of Symbolic Computation 86, 51-96, 2018
Complexity analysis of root clustering for a complex polynomial
R Becker, M Sagraloff, V Sharma, J Xu, C Yap
Proceedings of the ACM on International Symposium on Symbolic and Algebraic …, 2016
From DQBF to QBF by dependency elimination
R Wimmer, A Karrenbauer, R Becker, C Scholl, B Becker
International Conference on Theory and Applications of Satisfiability …, 2017
A simple efficient interior point method for min-cost flow
R Becker, A Karrenbauer
International Symposium on Algorithms and Computation, 753-765, 2014
Two results on slime mold computations
R Becker, V Bonifaci, A Karrenbauer, P Kolev, K Mehlhorn
Theoretical Computer Science 773, 79-106, 2019
Balancing spreads of influence in a social network
R Becker, F Corò, G D'Angelo, H Gilbert
Proceedings of the AAAI Conference on Artificial Intelligence 34 (01), 3-10, 2020
A novel dual ascent algorithm for solving the min-cost flow problem
R Becker, M Fickert, A Karrenbauer
2016 Proceedings of the Eighteenth Workshop on Algorithm Engineering and …, 2016
Subspace determination through local intrinsic dimensional decomposition
R Becker, I Hafnaoui, ME Houle, P Li, A Zimek
International Conference on Similarity Search and Applications, 281-289, 2019
The Bolzano Method to isolate the real roots of a bitstream polynomial
R Becker
Bachelor thesis, Saarland University, Saarbrücken, Germany, 2012
Fairness in Influence Maximization through Randomization
R Becker, G D'Angelo, S Ghobadi, H Gilbert
arXiv preprint arXiv:2010.03438, 2020
When Can Liquid Democracy Unveil the Truth?
R Becker, G D'Angelo, E Delfaraz, H Gilbert
arXiv preprint arXiv:2104.01828, 2021
Distributed algorithms for low stretch spanning trees
R Becker, Y Emek, M Ghaffari, C Lenzen
33rd International Symposium on Distributed Computing (DISC 2019) 146, 4, 2019
Group-Harmonic and Group-Closeness Maximization–Approximation and Engineering∗
E Angriman, R Becker, G D'Angelo, H Gilbert, A van der Grinten, ...
2021 Proceedings of the Workshop on Algorithm Engineering and Experiments …, 2021
Maximizing Influence-based Group Shapley Centrality
R Becker, G D'Angelo, H Gilbert
arXiv preprint arXiv:2003.07966, 2020
Low diameter graph decompositions by approximate distance computation
R Becker, Y Emek, C Lenzen
arXiv preprint arXiv:1909.09002, 2019
Unveiling the Truth in Liquid Democracy with Misinformed Voters
R Becker, G D’angelo, E Delfaraz, H Gilbert
International Conference on Algorithmic Decision Theory, 132-146, 2021
Influence Maximization With Co-Existing Seeds
R Becker, G d'Angelo, H Gilbert
Proceedings of the 30th ACM International Conference on Information …, 2021
Counting Solutions of a Polynomial System Locally and Exactly
R Becker, M Sagraloff
arXiv preprint arXiv:1712.05487, 2017
On Flows, Paths, Roots, and Zeros
R Becker
Saarländische Universitäts-und Landesbibliothek, 2017
The system can't perform the operation now. Try again later.
Articles 1–20