generated by bibbase.org
  2022 (1)
Fairness in Influence Maximization through Randomization. Becker, R.; D'Angelo, G.; Ghobadi, S.; and Gilbert, H. J. Artif. Intell. Res., 73: 1251–1283. 2022.
Fairness in Influence Maximization through Randomization [link]Paper   doi   link   bibtex   1 download  
  2021 (6)
Unveiling the Truth in Liquid Democracy with Misinformed Voters. Becker, R.; D'Angelo, G.; Delfaraz, E.; and Gilbert, H. In Fotakis, D.; and Insua, D. R., editor(s), Algorithmic Decision Theory - 7th International Conference, ADT 2021, Toulouse, France, November 3-5, 2021, Proceedings, volume 13023, of Lecture Notes in Computer Science, pages 132–146, 2021. Springer
Unveiling the Truth in Liquid Democracy with Misinformed Voters [link]Paper   doi   link   bibtex   2 downloads  
Influence Maximization With Co-Existing Seeds. Becker, R.; D'Angelo, G.; and Gilbert, H. In Demartini, G.; Zuccon, G.; Culpepper, J. S.; Huang, Z.; and Tong, H., editor(s), CIKM '21: The 30th ACM International Conference on Information and Knowledge Management, Virtual Event, Queensland, Australia, November 1 - 5, 2021, pages 100–109, 2021. ACM
Influence Maximization With Co-Existing Seeds [link]Paper   doi   link   bibtex  
Maximizing Influence-Based Group Shapley Centrality. Becker, R.; D'Angelo, G.; and Gilbert, H. In AAMAS '21: 20th International Conference on Autonomous Agents and Multiagent Systems, Virtual Event, United Kingdom, May 3-7, 2021, pages 1461–1463, 2021.
Maximizing Influence-Based Group Shapley Centrality [link]Paper   link   bibtex  
Group-Harmonic and Group-Closeness Maximization - Approximation and Engineering. Angriman, E.; Becker, R.; D'Angelo, G.; Gilbert, H.; van der Grinten, A.; and Meyerhenke, H. In Proceedings of the Symposium on Algorithm Engineering and Experiments, ALENEX 2021, Virtual Conference, January 10-11, 2021, pages 154–168, 2021.
Group-Harmonic and Group-Closeness Maximization - Approximation and Engineering [link]Paper   doi   link   bibtex  
Fairness in Influence Maximization through Randomization. Becker, R.; D'Angelo, G.; Ghobadi, S.; and Gilbert, H. In Thirty-Fifth AAAI Conference on Artificial Intelligence, AAAI 2021, Thirty-Third Conference on Innovative Applications of Artificial Intelligence, IAAI 2021, The Eleventh Symposium on Educational Advances in Artificial Intelligence, EAAI 2021, Virtual Event, February 2-9, 2021, pages 14684–14692, 2021.
Fairness in Influence Maximization through Randomization [link]Paper   link   bibtex   1 download  
Near-Optimal Approximate Shortest Paths and Transshipment in Distributed and Streaming Models. Becker, R.; Forster, S.; Karrenbauer, A.; and Lenzen, C. SIAM J. Comput., 50(3): 815–856. 2021.
Near-Optimal Approximate Shortest Paths and Transshipment in Distributed and Streaming Models [link]Paper   doi   link   bibtex  
  2020 (2)
Balancing Spreads of Influence in a Social Network. Becker, R.; Corò, F.; D'Angelo, G.; and Gilbert, H. In The Thirty-Fourth AAAI Conference on Artificial Intelligence, AAAI 2020, The Thirty-Second Innovative Applications of Artificial Intelligence Conference, IAAI 2020, The Tenth AAAI Symposium on Educational Advances in Artificial Intelligence, EAAI 2020, New York, NY, USA, February 7-12, 2020, pages 3–10, 2020.
Balancing Spreads of Influence in a Social Network [link]Paper   link   bibtex   6 downloads  
Low Diameter Graph Decompositions by Approximate Distance Computation. Becker, R.; Emek, Y.; and Lenzen, C. In 11th Innovations in Theoretical Computer Science Conference, ITCS 2020, January 12-14, 2020, Seattle, Washington, USA, pages 50:1–50:29, 2020.
Low Diameter Graph Decompositions by Approximate Distance Computation [link]Paper   doi   link   bibtex   2 downloads  
  2019 (3)
Two results on slime mold computations. Becker, R.; Bonifaci, V.; Karrenbauer, A.; Kolev, P.; and Mehlhorn, K. Theor. Comput. Sci., 773: 79–106. 2019.
Two results on slime mold computations [link]Paper   doi   link   bibtex  
Subspace Determination Through Local Intrinsic Dimensional Decomposition. Becker, R.; Hafnaoui, I.; Houle, M. E.; Li, P.; and Zimek, A. In Similarity Search and Applications - 12th International Conference, SISAP 2019, Newark, NJ, USA, October 2-4, 2019, Proceedings, pages 281–289, 2019.
Subspace Determination Through Local Intrinsic Dimensional Decomposition [link]Paper   doi   link   bibtex  
Distributed Algorithms for Low Stretch Spanning Trees. Becker, R.; Emek, Y.; Ghaffari, M.; and Lenzen, C. In 33rd International Symposium on Distributed Computing, DISC 2019, October 14-18, 2019, Budapest, Hungary, pages 4:1–4:14, 2019.
Distributed Algorithms for Low Stretch Spanning Trees [link]Paper   doi   link   bibtex   4 downloads  
  2018 (3)
On Flows, Paths, Roots, and Zeros. Becker, R. Ph.D. Thesis, Saarland University, Saarbrücken, Germany, 2018.
On Flows, Paths, Roots, and Zeros [link]Paper   link   bibtex  
A near-optimal subdivision algorithm for complex root isolation based on the Pellet test and Newton iteration. Becker, R.; Sagraloff, M.; Sharma, V.; and Yap, C. J. Symb. Comput., 86: 51–96. 2018.
A near-optimal subdivision algorithm for complex root isolation based on the Pellet test and Newton iteration [link]Paper   doi   link   bibtex  
From DQBF to QBF by Dependency Elimination. Wimmer, R.; Karrenbauer, A.; Becker, R.; Scholl, C.; and Becker, B. In Methoden und Beschreibungssprachen zur Modellierung und Verifikation von Schaltungen und Systemen, MBMV 2018, Tübingen, Germany, February 8-9, 2018, 2018.
From DQBF to QBF by Dependency Elimination [link]Paper   link   bibtex  
  2017 (2)
From DQBF to QBF by Dependency Elimination. Wimmer, R.; Karrenbauer, A.; Becker, R.; Scholl, C.; and Becker, B. In Theory and Applications of Satisfiability Testing - SAT 2017 - 20th International Conference, Melbourne, VIC, Australia, August 28 - September 1, 2017, Proceedings, pages 326–343, 2017.
From DQBF to QBF by Dependency Elimination [link]Paper   doi   link   bibtex  
Near-Optimal Approximate Shortest Paths and Transshipment in Distributed and Streaming Models. Becker, R.; Karrenbauer, A.; Krinninger, S.; and Lenzen, C. In 31st International Symposium on Distributed Computing, DISC 2017, October 16-20, 2017, Vienna, Austria, pages 7:1–7:16, 2017.
Near-Optimal Approximate Shortest Paths and Transshipment in Distributed and Streaming Models [link]Paper   doi   link   bibtex  
  2016 (2)
A Novel Dual Ascent Algorithm for Solving the Min-Cost Flow Problem. Becker, R.; Fickert, M.; and Karrenbauer, A. In Proceedings of the Eighteenth Workshop on Algorithm Engineering and Experiments, ALENEX 2016, Arlington, Virginia, USA, January 10, 2016, pages 151–159, 2016.
A Novel Dual Ascent Algorithm for Solving the Min-Cost Flow Problem [link]Paper   doi   link   bibtex  
Complexity Analysis of Root Clustering for a Complex Polynomial. Becker, R.; Sagraloff, M.; Sharma, V.; Xu, J.; and Yap, C. In Proceedings of the ACM on International Symposium on Symbolic and Algebraic Computation, ISSAC 2016, Waterloo, ON, Canada, July 19-22, 2016, pages 71–78, 2016.
Complexity Analysis of Root Clustering for a Complex Polynomial [link]Paper   doi   link   bibtex  
  2014 (1)
A Simple Efficient Interior Point Method for Min-Cost Flow. Becker, R.; and Karrenbauer, A. In Algorithms and Computation - 25th International Symposium, ISAAC 2014, Jeonju, Korea, December 15-17, 2014, Proceedings, pages 753–765, 2014.
A Simple Efficient Interior Point Method for Min-Cost Flow [link]Paper   doi   link   bibtex