Ruben Becker

ORCID

Publication Activity (10 Years)

Years Active: 2013-2024
Publications (10 Years): 49

Top Venues

Saarland University, Saarbrücken, Germany (PHD)

Education History

Saarland University, Saarbrücken, Germany

PHD

Publications

Ruben Becker, Matteo Canton, Davide Cenzato, Sung-Hwan Kim, Bojana Kodric, Nicola Prezza
Sketching and Streaming for Dictionary Compression. DCC (2024)
Ruben Becker, Davide Cenzato, Sung-Hwan Kim, Bojana Kodric, Riccardo Maso, Nicola Prezza
Random Wheeler Automata. CPM (2024)
Ruben Becker, Sung-Hwan Kim, Nicola Prezza, Carlo Tosoni
Indexing Finite-State Automata Using Forward-Stable Partitions. CoRR (2024)
Ruben Becker, Michael Sagraloff
Counting solutions of a polynomial system locally and exactly. J. Symb. Comput. 120 (2024)
Ruben Becker, Yuval Emek, Mohsen Ghaffari, Christoph Lenzen
Decentralized Low-Stretch Trees via Low Diameter Graph Decompositions. SIAM J. Comput. 53 (2) (2024)
Ruben Becker, Matteo Canton, Davide Cenzato, Sung-Hwan Kim, Bojana Kodric, Nicola Prezza
Sketching and Streaming for Dictionary Compression. CoRR (2023)
Ruben Becker, Davide Cenzato, Sung-Hwan Kim, Bojana Kodric, Alberto Policriti, Nicola Prezza
Optimal Wheeler Language Recognition. CoRR (2023)
Ruben Becker, Davide Cenzato, Sung-Hwan Kim, Bojana Kodric, Alberto Policriti, Nicola Prezza
Optimal Wheeler Language Recognition. SPIRE (2023)
Ruben Becker, Gianlorenzo D'Angelo, Sajjad Ghobadi
On the Cost of Demographic Parity in Influence Maximization. CoRR (2023)
Ruben Becker, Arnaud Casteigts, Pierluigi Crescenzi, Bojana Kodric, Malte Renken, Michael Raskin, Viktor Zamaraev
Giant Components in Random Temporal Graphs. APPROX/RANDOM (2023)
Ruben Becker, Davide Cenzato, Sung-Hwan Kim, Bojana Kodric, Alberto Policriti, Nicola Prezza
Testing Wheelerness of Regular Languages (short paper) (text not included). ICTCS (2023)
Ruben Becker, Gianlorenzo D'Angelo, Sajjad Ghobadi
Improving Fairness in Information Exposure by Adding Links. CoRR (2023)
Ruben Becker, Manuel Cáceres, Davide Cenzato, Sung-Hwan Kim, Bojana Kodric, Francisco Olivares, Nicola Prezza
Sorting Finite Automata via Partition Refinement. ESA (2023)
Ruben Becker, Davide Cenzato, Sung-Hwan Kim, Bojana Kodric, Riccardo Maso, Nicola Prezza
Random Wheeler Automata. CoRR (2023)
Ruben Becker, Pierluigi Crescenzi, Antonio Cruciani, Bojana Kodric
Proxying Betweenness Centrality Rankings in Temporal Networks. SEA (2023)
Ruben Becker, Manuel Cáceres, Davide Cenzato, Sung-Hwan Kim, Bojana Kodric, Francisco Olivares, Nicola Prezza
Sorting Finite Automata via Partition Refinement. CoRR (2023)
Ruben Becker, Gianlorenzo D'Angelo, Sajjad Ghobadi
Improving Fairness in Information Exposure by Adding Links. AAAI (2023)
Ruben Becker, Gianlorenzo D'Angelo, Sajjad Ghobadi
On the Cost of Demographic Parity in Influence Maximization. AAAI (2023)
Ruben Becker, Gianlorenzo D'Angelo, Sajjad Ghobadi, Hugo Gilbert
Fairness in Influence Maximization through Randomization. J. Artif. Intell. Res. 73 (2022)
Ruben Becker, Arnaud Casteigts, Pierluigi Crescenzi, Bojana Kodric, Malte Renken, Michael Raskin, Viktor Zamaraev
Giant Components in Random Temporal Graphs. CoRR (2022)
Eugenio Angriman, Ruben Becker, Gianlorenzo D'Angelo, Hugo Gilbert, Alexander van der Grinten, Henning Meyerhenke
Group-Harmonic and Group-Closeness Maximization - Approximation and Engineering. ALENEX (2021)
Ruben Becker, Gianlorenzo D'Angelo, Hugo Gilbert
Influence Maximization With Co-Existing Seeds. CIKM (2021)
Ruben Becker, Gianlorenzo D'Angelo, Sajjad Ghobadi, Hugo Gilbert
Fairness in Influence Maximization through Randomization. AAAI (2021)
Ruben Becker, Michael Sagraloff, Vikram Sharma, Juan Xu, Chee Yap
Complexity Analysis of Root Clustering for a Complex Polynomial. CoRR (2021)
Ruben Becker, Gianlorenzo D'Angelo, Esmaeil Delfaraz, Hugo Gilbert
When Can Liquid Democracy Unveil the Truth? CoRR (2021)
Ruben Becker, Gianlorenzo D'Angelo, Esmaeil Delfaraz, Hugo Gilbert
Unveiling the Truth in Liquid Democracy with Misinformed Voters. ADT (2021)
Ruben Becker, Sebastian Forster, Andreas Karrenbauer, Christoph Lenzen
Near-Optimal Approximate Shortest Paths and Transshipment in Distributed and Streaming Models. SIAM J. Comput. 50 (3) (2021)
Ruben Becker, Gianlorenzo D'Angelo, Hugo Gilbert
Maximizing Influence-Based Group Shapley Centrality. AAMAS (2021)
Ruben Becker, Federico Corò, Gianlorenzo D'Angelo, Hugo Gilbert
Balancing Spreads of Influence in a Social Network. AAAI (2020)
Eugenio Angriman, Ruben Becker, Gianlorenzo D'Angelo, Hugo Gilbert, Alexander van der Grinten, Henning Meyerhenke
Group-Harmonic and Group-Closeness Maximization - Approximation and Engineering. CoRR (2020)
Ruben Becker, Gianlorenzo D'Angelo, Sajjad Ghobadi, Hugo Gilbert
Fairness in Influence Maximization through Randomization. CoRR (2020)
Ruben Becker, Gianlorenzo D'Angelo, Hugo Gilbert
Maximizing Influence-based Group Shapley Centrality. CoRR (2020)
Ruben Becker, Yuval Emek, Christoph Lenzen
Low Diameter Graph Decompositions by Approximate Distance Computation. ITCS (2020)
Ruben Becker, Vincenzo Bonifaci, Andreas Karrenbauer, Pavel Kolev, Kurt Mehlhorn
Two results on slime mold computations. Theor. Comput. Sci. 773 (2019)
Ruben Becker, Yuval Emek, Christoph Lenzen
Low Diameter Graph Decompositions by Approximate Distance Computation. CoRR (2019)
Ruben Becker, Yuval Emek, Mohsen Ghaffari, Christoph Lenzen
Distributed Algorithms for Low Stretch Spanning Trees. DISC (2019)
Ruben Becker, Federico Corò, Gianlorenzo D'Angelo, Hugo Gilbert
Balancing spreads of influence in a social network. CoRR (2019)
Ruben Becker, Imane Hafnaoui, Michael E. Houle, Pan Li, Arthur Zimek
Subspace Determination through Local Intrinsic Dimensional Decomposition: Theory and Experimentation. CoRR (2019)
Ruben Becker, Imane Hafnaoui, Michael E. Houle, Pan Li, Arthur Zimek
Subspace Determination Through Local Intrinsic Dimensional Decomposition. SISAP (2019)
Ruben Becker, Michael Sagraloff, Vikram Sharma, Chee Yap
A near-optimal subdivision algorithm for complex root isolation based on the Pellet test and Newton iteration. J. Symb. Comput. 86 (2018)
Ralf Wimmer, Andreas Karrenbauer, Ruben Becker, Christoph Scholl, Bernd Becker
From DQBF to QBF by Dependency Elimination. MBMV (2018)
Ruben Becker, Michael Sagraloff
Counting Solutions of a Polynomial System Locally and Exactly. CoRR (2017)
Ralf Wimmer, Andreas Karrenbauer, Ruben Becker, Christoph Scholl, Bernd Becker
From DQBF to QBF by Dependency Elimination. SAT (2017)
Ruben Becker, Andreas Karrenbauer, Sebastian Krinninger, Christoph Lenzen
Near-Optimal Approximate Shortest Paths and Transshipment in Distributed and Streaming Models. DISC (2017)
Ruben Becker, Vincenzo Bonifaci, Andreas Karrenbauer, Pavel Kolev, Kurt Mehlhorn
Two Results on Slime Mold Computations. CoRR (2017)
Ruben Becker, Andreas Karrenbauer, Sebastian Krinninger, Christoph Lenzen
Approximate Undirected Transshipment and Shortest Paths via Gradient Descent. CoRR (2016)
Ruben Becker, Andreas Karrenbauer, Kurt Mehlhorn
An Integer Interior Point Method for Min-Cost Flow Using Arc Contractions and Deletions. CoRR (2016)
Ruben Becker, Michael Sagraloff, Vikram Sharma, Juan Xu, Chee Yap
Complexity Analysis of Root Clustering for a Complex Polynomial. ISSAC (2016)
Ruben Becker, Maximilian Fickert, Andreas Karrenbauer
A Novel Dual Ascent Algorithm for Solving the Min-Cost Flow Problem. ALENEX (2016)
Ruben Becker, Michael Sagraloff, Vikram Sharma, Chee-Keng Yap
A Simple Near-Optimal Subdivision Algorithm for Complex Root Isolation based on the Pellet Test and Newton Iteration. CoRR (2015)
Ruben Becker, Andreas Karrenbauer
A Simple Efficient Interior Point Method for Min-Cost Flow. ISAAC (2014)
Ruben Becker, Andreas Karrenbauer
A Combinatorial $\tilde{O}(m^{3/2})$-time Algorithm for the Min-Cost Flow Problem. CoRR (2013)

Ruben Becker.css-eqlu8i{font-size:small;padding-left:4px;}

Publication Activity (10 Years)

Top Topics

Top Venues

Ruben Becker