Ruben Becker

According to our database, Ruben Becker authored at least 36 papers between 2013 and 2024.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2024

Decentralized Low-Stretch Trees via Low Diameter Graph Decompositions.

Ruben Becker, Yuval Emek, Mohsen Ghaffari, Christoph Lenzen

SIAM J. Comput., 2024

Counting solutions of a polynomial system locally and exactly.

Ruben Becker, Michael Sagraloff

J. Symb. Comput., 2024

On the Complexity of Computing the Co-lexicographic Width of a Regular Language.

Ruben Becker, Davide Cenzato, Sung-Hwan Kim, Tomasz Kociumaka, Bojana Kodric, Alberto Policriti, Nicola Prezza

CoRR, 2024

Indexing Finite-State Automata Using Forward-Stable Partitions.

Ruben Becker, Sung-Hwan Kim, Nicola Prezza, Carlo Tosoni

Proceedings of the String Processing and Information Retrieval, 2024

Sketching and Streaming for Dictionary Compression.

Ruben Becker, Matteo Canton, Davide Cenzato, Sung-Hwan Kim, Bojana Kodric, Nicola Prezza

Proceedings of the Data Compression Conference, 2024

Random Wheeler Automata.

Ruben Becker, Davide Cenzato, Sung-Hwan Kim, Bojana Kodric, Riccardo Maso, Nicola Prezza

Proceedings of the 35th Annual Symposium on Combinatorial Pattern Matching, 2024

2023

Proxying Betweenness Centrality Rankings in Temporal Networks.

Ruben Becker, Pierluigi Crescenzi, Antonio Cruciani, Bojana Kodric

Proceedings of the 21st International Symposium on Experimental Algorithms, 2023

Optimal Wheeler Language Recognition.

Ruben Becker, Davide Cenzato, Sung-Hwan Kim, Bojana Kodric, Alberto Policriti, Nicola Prezza

Proceedings of the String Processing and Information Retrieval, 2023

Testing Wheelerness of Regular Languages (short paper) (text not included).

Ruben Becker, Davide Cenzato, Sung-Hwan Kim, Bojana Kodric, Alberto Policriti, Nicola Prezza

Proceedings of the 24th Italian Conference on Theoretical Computer Science, 2023

Sorting Finite Automata via Partition Refinement.

Ruben Becker, Manuel Cáceres, Davide Cenzato, Sung-Hwan Kim, Bojana Kodric, Francisco Olivares, Nicola Prezza

Proceedings of the 31st Annual European Symposium on Algorithms, 2023

Giant Components in Random Temporal Graphs.

Ruben Becker, Arnaud Casteigts, Pierluigi Crescenzi, Bojana Kodric, Malte Renken, Michael Raskin, Viktor Zamaraev

Proceedings of the Approximation, 2023

Improving Fairness in Information Exposure by Adding Links.

Ruben Becker, Gianlorenzo D'Angelo, Sajjad Ghobadi

Proceedings of the Thirty-Seventh AAAI Conference on Artificial Intelligence, 2023

On the Cost of Demographic Parity in Influence Maximization.

Ruben Becker, Gianlorenzo D'Angelo, Sajjad Ghobadi

Proceedings of the Thirty-Seventh AAAI Conference on Artificial Intelligence, 2023

2022

Fairness in Influence Maximization through Randomization.

Ruben Becker, Gianlorenzo D'Angelo, Sajjad Ghobadi, Hugo Gilbert

J. Artif. Intell. Res., 2022

2021

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

Ruben Becker, Sebastian Forster, Andreas Karrenbauer, Christoph Lenzen

SIAM J. Comput., 2021

When Can Liquid Democracy Unveil the Truth?

Ruben Becker, Gianlorenzo D'Angelo, Esmaeil Delfaraz, Hugo Gilbert

CoRR, 2021

Influence Maximization With Co-Existing Seeds.

Ruben Becker, Gianlorenzo D'Angelo, Hugo Gilbert

Proceedings of the CIKM '21: The 30th ACM International Conference on Information and Knowledge Management, Virtual Event, Queensland, Australia, November 1, 2021

Maximizing Influence-Based Group Shapley Centrality.

Ruben Becker, Gianlorenzo D'Angelo, Hugo Gilbert

Proceedings of the AAMAS '21: 20th International Conference on Autonomous Agents and Multiagent Systems, 2021

Group-Harmonic and Group-Closeness Maximization - Approximation and Engineering.

Eugenio Angriman, Ruben Becker, Gianlorenzo D'Angelo, Hugo Gilbert, Alexander van der Grinten, Henning Meyerhenke

Proceedings of the Symposium on Algorithm Engineering and Experiments, 2021

Unveiling the Truth in Liquid Democracy with Misinformed Voters.

Ruben Becker, Gianlorenzo D'Angelo, Esmaeil Delfaraz, Hugo Gilbert

Proceedings of the Algorithmic Decision Theory - 7th International Conference, 2021

2020

Low Diameter Graph Decompositions by Approximate Distance Computation.

Ruben Becker, Yuval Emek, Christoph Lenzen

Proceedings of the 11th Innovations in Theoretical Computer Science Conference, 2020

Balancing Spreads of Influence in a Social Network.

Ruben Becker, Federico Corò, Gianlorenzo D'Angelo, Hugo Gilbert

Proceedings of the Thirty-Fourth AAAI Conference on Artificial Intelligence, 2020

2019

Two results on slime mold computations.

Ruben Becker, Vincenzo Bonifaci, Andreas Karrenbauer, Pavel Kolev, Kurt Mehlhorn

Theor. Comput. Sci., 2019

Subspace Determination through Local Intrinsic Dimensional Decomposition: Theory and Experimentation.

Ruben Becker, Imane Hafnaoui, Michael E. Houle, Pan Li, Arthur Zimek

CoRR, 2019

Distributed Algorithms for Low Stretch Spanning Trees.

Ruben Becker, Yuval Emek, Mohsen Ghaffari, Christoph Lenzen

Proceedings of the 33rd International Symposium on Distributed Computing, 2019

Subspace Determination Through Local Intrinsic Dimensional Decomposition.

Ruben Becker, Imane Hafnaoui, Michael E. Houle, Pan Li, Arthur Zimek

Proceedings of the Similarity Search and Applications - 12th International Conference, 2019

2018

On Flows, Paths, Roots, and Zeros.

Ruben Becker

PhD thesis, 2018

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

Ruben Becker, Michael Sagraloff, Vikram Sharma, Chee Yap

J. Symb. Comput., 2018

2017

From DQBF to QBF by Dependency Elimination.

Ralf Wimmer, Andreas Karrenbauer, Ruben Becker, Christoph Scholl, Bernd Becker

Proceedings of the Theory and Applications of Satisfiability Testing - SAT 2017 - 20th International Conference, Melbourne, VIC, Australia, August 28, 2017

2016

An Integer Interior Point Method for Min-Cost Flow Using Arc Contractions and Deletions.

Ruben Becker, Andreas Karrenbauer, Kurt Mehlhorn

CoRR, 2016

Approximate Undirected Transshipment and Shortest Paths via Gradient Descent.

Ruben Becker, Andreas Karrenbauer, Sebastian Krinninger, Christoph Lenzen

CoRR, 2016

Complexity Analysis of Root Clustering for a Complex Polynomial.

Ruben Becker, Michael Sagraloff, Vikram Sharma, Juan Xu, Chee Yap

Proceedings of the ACM on International Symposium on Symbolic and Algebraic Computation, 2016

A Novel Dual Ascent Algorithm for Solving the Min-Cost Flow Problem.

Ruben Becker, Maximilian Fickert, Andreas Karrenbauer

Proceedings of the Eighteenth Workshop on Algorithm Engineering and Experiments, 2016

2015

A Simple Near-Optimal Subdivision Algorithm for Complex Root Isolation based on the Pellet Test and Newton Iteration.

Ruben Becker, Michael Sagraloff, Vikram Sharma, Chee-Keng Yap

CoRR, 2015

2014

A Simple Efficient Interior Point Method for Min-Cost Flow.

Ruben Becker, Andreas Karrenbauer

Proceedings of the Algorithms and Computation - 25th International Symposium, 2014

2013

A Combinatorial $\tilde{O}(m^{3/2})$-time Algorithm for the Min-Cost Flow Problem.

Ruben Becker, Andreas Karrenbauer

CoRR, 2013