Prof. Dr. Rolf Wanka

Professur für Informatik (Effiziente Algorithmen und Kombinatorische Optimierung)

Markov Chain-based Optimization Time and Variance Analysis of Bivalent Ant Colony Optimization for Sorting and LeadingOnes (2026) Rössler M, Keszöcze O, Wanka R Journal article, Original article Markov Chain-based Optimization Time Analysis of Bivalent Ant Colony Optimization for Sorting and LeadingOnes (2024) Kergaßner M, Keszöcze O, Wanka R Conference contribution, Conference Contribution On the Computation of Robust Examination Timetables: Methods and Experimental Results (2024) Bassimir B, Wanka R Journal article, Original article Exact Markov chain-based runtime analysis of a discrete particle swarm optimization algorithm on sorting and OneMax (2021) Mühlenthaler M, Raß A, Schmitt M, Wanka R Journal article, Original article Self-adaptive potential-based stopping criteria for Particle Swarm Optimization with forced moves (2020) Bassimir B, Schmitt M, Wanka R Journal article, Original article Sample-Based Motion Planning for Multi-Robot Systems (2020) Muradi M, Wanka R Conference contribution, Original article Processing Time Optimization for Robot Applications (2020) Muradi M, Wanka R Conference contribution, Original article Robustness Approaches for the Examination Timetabling Problem under Data Uncertainty (2019) Bassimir B, Wanka R Conference contribution, Original article Swarm Intelligence (2019) Wanka R Journal article, Editorial Runtime Analysis of Discrete Particle Swarm Optimization Applied to Shortest Paths Computation (2019) Raß A, Schreiner J, Wanka R Conference contribution, Original article