A Combinatorial $ tilde{O}(m^{3/2})$-time Algorithm for the Min-Cost Flow Problem. - Ruben Becker; Andreas Karrenbauer (CoRR, 2013)

A Simple Efficient Interior Point Method for Min-Cost Flow. - Ruben Becker; Andreas Karrenbauer (ISAAC, 2014)

A Simple Near-Optimal Subdivision Algorithm for Complex Root Isolation based on the Pellet Test and Newton Iteration. - Ruben Becker; Michael Sagraloff; Vikram Sharma 001; Chee-Keng Yap (CoRR, 2015)

A Novel Dual Ascent Algorithm for Solving the Min-Cost Flow Problem. - Ruben Becker; Maximilian Fickert; Andreas Karrenbauer (ALENEX, 2016)

Complexity Analysis of Root Clustering for a Complex Polynomial. - Ruben Becker; Michael Sagraloff; Vikram Sharma 001; Juan Xu; Chee Yap (ISSAC, 2016)

Approximate Undirected Transshipment and Shortest Paths via Gradient Descent. - Ruben Becker; Andreas Karrenbauer; Sebastian Krinninger; Christoph Lenzen 001 (CoRR, 2016)

An Integer Interior Point Method for Min-Cost Flow Using Arc Contractions and Deletions. - Ruben Becker; Andreas Karrenbauer; Kurt Mehlhorn (CoRR, 2016)

From DQBF to QBF by Dependency Elimination. - Ralf Wimmer 001; Andreas Karrenbauer; Ruben Becker; Christoph Scholl 001; Bernd Becker 001 (SAT, 2017)

A near-optimal subdivision algorithm for complex root isolation based on the Pellet test and Newton iteration. - Ruben Becker; Michael Sagraloff; Vikram Sharma 001; Chee Yap (J. Symb. Comput., 2018)

On Flows, Paths, Roots, and Zeros. - Ruben Becker (2018)

Subspace Determination Through Local Intrinsic Dimensional Decomposition. - Ruben Becker; Imane Hafnaoui; Michael E. Houle; Pan Li; Arthur Zimek (SISAP, 2019)

Distributed Algorithms for Low Stretch Spanning Trees. - Ruben Becker; Yuval Emek; Mohsen Ghaffari 001; Christoph Lenzen 001 (DISC, 2019)

Subspace Determination through Local Intrinsic Dimensional Decomposition: Theory and Experimentation. - Ruben Becker; Imane Hafnaoui; Michael E. Houle; Pan Li; Arthur Zimek (CoRR, 2019)

Two results on slime mold computations. - Ruben Becker; Vincenzo Bonifaci; Andreas Karrenbauer; Pavel Kolev; Kurt Mehlhorn (Theor. Comput. Sci., 2019)

Balancing Spreads of Influence in a Social Network. - Ruben Becker; Federico Corò; Gianlorenzo D'Angelo; Hugo Gilbert (AAAI, 2020)

Low Diameter Graph Decompositions by Approximate Distance Computation. - Ruben Becker; Yuval Emek; Christoph Lenzen 001 (ITCS, 2020)

Unveiling the Truth in Liquid Democracy with Misinformed Voters. - Ruben Becker; Gianlorenzo D'Angelo; Esmaeil Delfaraz; Hugo Gilbert (ADT, 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 (ALENEX, 2021)

Maximizing Influence-Based Group Shapley Centrality. - Ruben Becker; Gianlorenzo D'Angelo; Hugo Gilbert (AAMAS, 2021)

Influence Maximization With Co-Existing Seeds. - Ruben Becker; Gianlorenzo D'Angelo; Hugo Gilbert (CIKM, 2021)

When Can Liquid Democracy Unveil the Truth? - Ruben Becker; Gianlorenzo D'Angelo; Esmaeil Delfaraz; Hugo Gilbert (CoRR, 2021)

Near-Optimal Approximate Shortest Paths and Transshipment in Distributed and Streaming Models. - Ruben Becker; Sebastian Forster; Andreas Karrenbauer; Christoph Lenzen 001 (SIAM J. Comput., 2021)

Fairness in Influence Maximization through Randomization. - Ruben Becker; Gianlorenzo D'Angelo; Sajjad Ghobadi; Hugo Gilbert (J. Artif. Intell. Res., 2022)

On the Cost of Demographic Parity in Influence Maximization. - Ruben Becker; Gianlorenzo D'Angelo; Sajjad Ghobadi (AAAI, 2023)

Improving Fairness in Information Exposure by Adding Links. - Ruben Becker; Gianlorenzo D'Angelo; Sajjad Ghobadi (AAAI, 2023)

Giant Components in Random Temporal Graphs. - Ruben Becker; Arnaud Casteigts; Pierluigi Crescenzi; Bojana Kodric; Malte Renken; Michael Raskin; Viktor Zamaraev (APPROX/RANDOM, 2023)

Sorting Finite Automata via Partition Refinement. - Ruben Becker; Manuel Cáceres; Davide Cenzato; Sung-Hwan Kim; Bojana Kodric; Francisco Olivares; Nicola Prezza (ESA, 2023)

Testing Wheelerness of Regular Languages (short paper) (text not included). - Ruben Becker; Davide Cenzato; Sung-Hwan Kim; Bojana Kodric; Alberto Policriti; Nicola Prezza (ICTCS, 2023)

Optimal Wheeler Language Recognition. - Ruben Becker; Davide Cenzato; Sung-Hwan Kim; Bojana Kodric; Alberto Policriti; Nicola Prezza (SPIRE, 2023)

Proxying Betweenness Centrality Rankings in Temporal Networks. - Ruben Becker; Pierluigi Crescenzi; Antonio Cruciani; Bojana Kodric (SEA, 2023)

Random Wheeler Automata. - Ruben Becker; Davide Cenzato; Sung-Hwan Kim; Bojana Kodric; Riccardo Maso; Nicola Prezza (CPM, 2024)

Sketching and Streaming for Dictionary Compression. - Ruben Becker; Matteo Canton; Davide Cenzato; Sung-Hwan Kim; Bojana Kodric; Nicola Prezza (DCC, 2024)

Indexing Finite-State Automata Using Forward-Stable Partitions. - Ruben Becker; Sung-Hwan Kim; Nicola Prezza; Carlo Tosoni (SPIRE, 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)

Counting solutions of a polynomial system locally and exactly. - Ruben Becker; Michael Sagraloff (J. Symb. Comput., 2024)

Decentralized Low-Stretch Trees via Low Diameter Graph Decompositions. - Ruben Becker; Yuval Emek; Mohsen Ghaffari 001; Christoph Lenzen 001 (SIAM J. Comput., 2024)

The Trie Measure, Revisited. - Jarno N. Alanko; Ruben Becker; Davide Cenzato; Travis Gagie; Sung-Hwan Kim; Bojana Kodric; Nicola Prezza (CPM, 2025)

Encoding Co-Lex Orders of Finite-State Automata in Linear Space. - Ruben Becker; Nicola Cotumaccio; Sung-Hwan Kim; Nicola Prezza; Carlo Tosoni (CPM, 2025)

Universally Wheeler Languages. - Ruben Becker; Giuseppa Castiglione; Giovanna D'Agostino; Alberto Policriti; Nicola Prezza; Antonio Restivo; Brian Riccardi (DLT, 2025)

Compressing Suffix Trees by Path Decompositions. - Ruben Becker; Davide Cenzato; Travis Gagie; Sung-Hwan Kim; Ragnar Groot Koerkamp; Giovanni Manzini; Nicola Prezza (CoRR, 2025)