Publications
Refereed Publications in Conference Proceedings
Stability of Special Graph Classes.
R. Weishaupt and J. Rothe.
Proceedings of the 22nd Italian Conference on Theoretical Computer Science (ICTCS 2021), Bologna, Italy. CEUR-WS.org, vol. 3072, paper 20, September 2021.
The Possible Winner Problem with Uncertain Weights Revisited.
M. Neveling, J. Rothe, and R. Weishaupt.
Proceedings of the 23rd International Symposium on Fundamentals of Computation Theory (FCT 2021), Athens, Greece. Best Paper Award. Springer-Verlag Lecture Notes in Computer Science 12867, pages 399-412, September 2021.
A Closer Look at the Cake-Cutting Foundations through the Lens of Measure Theory.
P. Kern, D. Neugebauer, J. Rothe, R. Schilling, D. Stoyan, and R. Weishaupt.
Nonarchival proceedings of the 8th International Workshop on Computational Social Choice (COMSOC 2021), Technion, Haifa, Israel, June 2021.
Complexity of Sequential Rules in Judgment Aggregation.
D. Baumeister, L. Boes, and R. Weishaupt.
Proceedings of the 20th Conference on Autonomous Agents and Multiagent Systems (AAMAS 2021), London, UK. IFAAMAS, pages 187-195, May 2021.
PhD Thesis
Deciding the Uncertain: Axiomatic Aspects of Fair Division and Computational Complexity Studies in Computational Social Choice and Graph Theory.
R. Weishaupt.
PhD Thesis. Institut für Informatik, Heinrich-Heine-Universität Düsseldorf, Düsseldorf, Germany, 173 pages, May 2022.
Master Thesis
Stability of Graphs and Its Costs.
R. Weishaupt.
Master Thesis. Institut für Informatik, Heinrich-Heine-Universität Düsseldorf, Düsseldorf, Germany, 72 pages, Juli 2021.