“Mensch, das bisschen Mathe muss man zu schätzen wissen…” © Daniel Ebel aka Dendemann.

PhD thesis

Journal Publications

  • Ruben Becker, Yuval Emek, Mohsen Ghaffari, Christoph Lenzen.
    Decentralized Low Stretch Trees via Low Diameter Graph Decompositions.
    SIAM Journal on Computing (SICOMP). 2024.

  • Ruben Becker, Michael Sagraloff.
    Counting Solutions of a Polynomial System Locally and Exactly.
    Journal of Symbolic Computation (JSC), 2024.

  • Ruben Becker, Gianlorenzo D’Angelo, Sajjad Ghobadi, Hugo Gilbert.
    Fairness in Influence Maximization through Randomization.
    Journal of Artificial Intelligence Research (JAIR). 2022.

  • Ruben Becker, Andreas Karrenbauer, Sebastian Krinninger, Christoph Lenzen.
    Near-Optimal Approximate Shortest Paths and Transshipment in Distributed and Streaming Models.
    SIAM Journal on Computing (SICOMP). 2021.

  • Ruben Becker, Vincenzo Bonifaci, Andreas Karrenbauer, Pavel Kolev, Kurt Mehlhorn.
    Two Results on Slime Mold Computations.
    Theoretical Computer Science (TCS-C), 2019.

  • Ruben Becker, Michael Sagraloff, Vikram Sharma, Chee Yap.
    A Simple Near-Optimal Subdivision Algorithm for Complex Root Isolation based on the Pellet Test and Newton Iteration.
    Journal of Symbolic Computation (JSC), 2018.

Conference Publications

  • Ruben Becker, Giuseppa Castiglione, Giovanna D’Agostino, Alberto Policriti, Nicola Prezza, Antonio Restivo, Brian Riccardi.
    Universally Wheeler Languages.
    29th International Conference on Developments in Language Theory (DLT 2025).

  • Ruben Becker, Nicola Cotumaccio, Sung-Hwan Kim, Nicola Prezza, Carlo Tosoni.
    Encoding Co-Lex Orders of Finite-State Automata in Linear Space
    36th Annual Symposium on Combinatorial Pattern Matching (CPM 2025).

  • Jarno N. Alanko, Ruben Becker, Davide Cenzato, Travis Gagie, Sung-Hwan Kim, Bojana Kodric, Nicola Prezza.
    The Trie Measure, Revisited.
    36th Annual Symposium on Combinatorial Pattern Matching (CPM 2025).

  • Ruben Becker, Sung-Hwan Kim, Nicola Prezza, Carlo Tosoni.
    Indexing Finite-State Automata Using Forward-Stable Partitions.
    31st International Symposium on String Processing and Information Retrieval (SPIRE 2024).

  • Ruben Becker, Davide Cenzato, Sung-Hwan Kim, Bojana Kodric, Riccardo Maso, Nicola Prezza.
    Random Wheeler Automata.
    35th Annual Symposium on Combinatorial Pattern Matching (CPM 2024).

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

  • Ruben Becker, Manuel Cáceres, Davide Cenzato, Sung-Hwan Kim, Bojana Kodric, Francisco Olivares, Nicola Prezza.
    Sorting Finite Automata via Partition Refinement.
    31st European Symposium on Algorithms (ESA 2023).

  • Ruben Becker, Arnaud Casteigts, Pierluigi Crescenzi, Bojana Kodric, Michael Raskin, Malte Renken, Viktor Zamaraev.
    Giant Components in Random Temporal Graphs.
    International Conference on Randomization and Computation (RANDOM 2023).

  • Ruben Becker, Pierluigi Crescenzi, Antonio Cruciani, Bojana Kodric.
    Proxying Betweenness Centrality Rankings in Temporal Networks.
    21st Symposium on Experimental Algorithms (SEA 2023).

  • Ruben Becker, Gianlorenzo D’Angelo, Sajjad Ghobadi.
    Improving Fairness in Information Exposure by Adding Links.
    37th AAAI Conference on Artificial Intelligence (AAAI 2023).

  • Ruben Becker, Gianlorenzo D’Angelo, Sajjad Ghobadi.
    On the Cost of Demographic Parity in Influence Maximization.
    37th AAAI Conference on Artificial Intelligence (AAAI 2023).

  • Ruben Becker, Davide Cenzato, Sung-Hwan Kim, Bojana Kodric, Alberto Policriti, Nicola Prezza.
    Optimal Wheeler Language Recognition.
    30th International Symposium on String Processing and Information Retrieval (SPIRE 2023).

  • Ruben Becker, Gianlorenzo D’Angelo, Sajjad Ghobadi, Hugo Gilbert.
    Fairness in Influence Maximization through Randomization.
    35th AAAI Conference on Artificial Intelligence (AAAI 2021).

  • Ruben Becker, Gianlorenzo D’Angelo, Hugo Gilbert.
    Influence Maximization With Co-Existing Seeds.
    30th ACM International Conference on Information and Knowledge Management (CIKM 2021).

  • Eugenio Angriman, Ruben Becker, Gianlorenzo D’Angelo, Hugo Gilbert, Alexander van der Grinten, Henning Meyerhenke.
    Group Harmonic and Group Closeness Maximization – Approximation and Engineering.
    23rd Symposium on Algorithm Engineering and Experiments (ALENEX 2021).

  • Ruben Becker, Gianlorenzo D’Angelo, Esmaeil Delfaraz, Hugo Gilbert.
    Unveiling the Truth in Liquid Democracy with Misinformed Voters.
    7th International Conference on Algorithmic Decision Theory (ADT 2021).

  • Ruben Becker, Federico Coró, Gianlorenzo D’Angelo, Hugo Gilbert.
    Balancing Spreads of Influence in a Social Network.
    34th AAAI Conference on Artificial Intelligence (AAAI 2020).

  • Ruben Becker, Yuval Emek, Christoph Lenzen.
    Low Diameter Graph Decompositions by Approximate Distance Computation.
    11th Innovations in Theoretical Computer Science Conference (ITCS 2020).

  • Ruben Becker, Yuval Emek, Mohsen Ghaffari, Christoph Lenzen.
    Distributed Algorithms for Low Stretch Spanning Trees.
    33rd International Symposium on Distributed Computing (DISC 2019).

  • Ruben Becker, Imane Hafnaoui, Michael Houle, Pan Li, Arthur Zimek.
    Subspace Determination Through Local Intrinsic Dimensional Decomposition.
    12th International Conference on Similarity Search and Applications (SISAP 2019).

  • Ruben Becker, Andreas Karrenbauer, Sebastian Krinninger, Christoph Lenzen.
    Near-Optimal Approximate Shortest Paths and Transshipment in Distributed and Streaming Models.
    31st International Symposium on Distributed Computing (DISC 2017).

  • Ralf Wimmer, Andreas Karrenbauer, Ruben Becker, Christoph Scholl, Bernd Becker.
    From DQBF to QBF by Dependency Elimination.
    20th International Conference on Theory and Applications of Satisfiability Testing (SAT 2017).

  • Ruben Becker, Maximilian Fickert, Andreas Karrenbauer.
    A Novel Dual Ascent Algorithm for Solving the Min-Cost Flow Problem.
    18th Meeting on Algorithm Engineering and Experiments (ALENEX 2016).

  • Ruben Becker, Michael Sagraloff, Vikram Sharma, Juan Xu, Chee Yap.
    Complexity Analysis of Root Clustering for a Complex Polynomial.
    41st International Symposium on Symbolic and Algebraic Computation (ISSAC 2016).

  • Ruben Becker, Andreas Karrenbauer.
    A Simple Efficient Interior Point Method for Min-Cost Flow.
    25th International Symposium on Algorithms and Computation (ISAAC 2014).

Brief Peer-Reviewed Contributions

  • Ruben Becker, Davide Cenzato, Sung-Hwan Kim, Bojana Kodric, Alberto Policriti, Nicola Prezza.
    Testing Wheelerness of Regular Languages.
    24th Italian Conference on Theoretical Computer Science (ICTCS 2023)

  • Ruben Becker, Gianlorenzo D’Angelo, Hugo Gilbert.
    Maximizing Influence-Based Group Shapley Centrality.
    20th International Conference on Autonomous Agents and Multiagent Systems (AAMAS 2021)

  • Ralf Wimmer, Andreas Karrenbauer, Ruben Becker, Christoph Scholl, Bernd Becker.
    From DQBF to QBF by Dependency Elimination.
    Methoden und Beschreibungssprachen zur Modellierung und Verifikation von Schaltungen und Systemen (MBMV 2018)

  • Ruben Becker, Andreas Karrenbauer, Kurt Mehlhorn.
    An Integer Interior Point Method for Min-Cost Flow using Arc Contractions and Deletions.
    International Network Optimization Conference (INOC 2017).

  • Ruben Becker.
    Towards Efficient Combinatorial Algorithms for the Min-Cost Flow Problem.
    Young Researcher Workshop on Automata, Languages and Programming (YR-ICALP 2014)