Johannes Rauch
Universität Ulm
Institut für Optimierung und Operations Research
89081 Ulm
Helmholtzstraße 18 / Raum 1.48
Lehre
Sommersemester 2024
- Mathematics of Games
- Seminar Optimierung
- Mathematische Optimierung betrieblicher Prozesse
Wintersemester 2023/24
- Graph Theory 1
- Kombinatorik
Forschung
- JR, Dieter Rautenbach. Cutwidth and Crossings. arXiv
- Nick Brettell, Jelle J. Oostveen, Sukanya Pandey, Daniël Paulusma, JR, Erik Jan van Leeuwen. Computing Subset Vertex Covers in H-Free Graphs. arXiv, Theoretical Computer Science
- JR, Dieter Rautenbach. Revisiting Extremal Graphs Having No Stable Cutsets. arXiv
- Vsevolod Chernyshev, JR, Dieter Rautenbach. Forest Cuts in Sparse Graphs. arXiv
- 6th place out of 25 participants in the exact track of the in PACE Challenge 2024. Source code, results
- JR, Dieter Rautenbach, Uéverton S. Souza. On Conflict-Free Cuts: Algorithms and Complexity. arXiv, Information Processing Letters
- JR, Dieter Rautenbach, Uéverton S. Souza. Exact and Parameterized Algorithms for the Independent Cutset Problem. arXiv, Fundamentals of Computation Theory, Journal of Computer and System Sciences
- Stéphane Bessy, JR, Dieter Rautenbach, Uéverton S. Souza. Sparse vertex cutsets and the maximum degree. arXiv
- JR, Dieter Rautenbach. Efficiently recognizing graphs with equal independence and annihilation numbers. arXiv, Information Processing Letters