Prof. Dr. Rolf Wanka

Scopus Author ID: 6602779198



Organisation


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


Awards / Honours


2014 : Best Paper Award: Automatic Graph-based Success Tree Construction and Analysis
2013 : Best Paper Award: Particle Swarm Optimization Almost Surely Finds Local Optima
2009 : Best Paper Award: Particle Swarm Optimization with Velocity Adaptation



Project lead


AlKoP: Algorithmen für kombinatorische Probleme
Prof. Dr. Rolf Wanka
(13/03/2017)

Timetabling: Timetabling at the School of Engineering
Prof. Dr. Rolf Wanka
(01/04/2009 - 31/03/2020)

PSO: Partikelschwarm-Optimierung
Prof. Dr. Rolf Wanka
(24/07/2008 - 28/08/2020)


Project member


AlKoP: Algorithmen für kombinatorische Probleme
Prof. Dr. Rolf Wanka
(13/03/2017)

Timetabling: Timetabling at the School of Engineering
Prof. Dr. Rolf Wanka
(01/04/2009 - 31/03/2020)

PSO: Partikelschwarm-Optimierung
Prof. Dr. Rolf Wanka
(24/07/2008 - 28/08/2020)


Other Research Activities


Memberships in representative bodies / functions (FAU-internal)
Prof. Dr. Rolf Wanka
Board of the Faculty (Membership)
(01/10/2015 - 30/09/2017)


Publications (Download BibTeX)

Go to first page Go to previous page 2 of 6 Go to next page Go to last page

Mühlenthaler, M., & Wanka, R. (2014). The Connectedness of Clash-free Timetables. In Proc. 10th Int. Conf. on the Practice and Theory of Automated Timetabling (PATAT) (pp. 330-346). York, UK.
Lange, V., Schmitt, M., & Wanka, R. (2014). Towards a Better Understanding of the Local Attractor in Particle Swarm Optimization: Speed and Solution Quality. In Proc. International Conference on Adaptive and Intelligent Systems (ICAIS) (pp. 90-99). Bournemouth, UK: Springer Verlag.
Mühlenthaler, M., & Wanka, R. (2013). A Decomposition of the Max-min Fair Curriculum-based Course Timetabling Problem: The Impact of Solving Subproblems to Optimality. In Proc. 6th Multidisciplinary International Scheduling Conference: Theory and Applications (pp. 300-313). Gent, BE.
Schmitt, M., & Wanka, R. (2013). Exploiting Independent Subformulas: A Faster Approximation Scheme for #k-SAT. Information Processing Letters, 113, 337-344. https://dx.doi.org/10.1016/j.ipl.2013.02.013
Schmitt, M., & Wanka, R. (2013). Particles Prefer Walking Along the Axes: Experimental Insights into the Behavior of a Particle Swarm. In Companion of Proc. 15th Genetic and Evolutionary Computation Conference (pp. 17-18). Amsterdam, NL.
Schmitt, M., & Wanka, R. (2013). Particle Swarm Optimization Almost Surely Finds Local Optima. In Proc. 15th Genetic and Evolutionary Computation Conference (pp. 1629-1636). Amsterdam, NL: Elsevier.
Mühlenthaler, M., & Wanka, R. (2012). Fairness in Academic Timetabling. In Proc. 9th Int. Conf. on the Practice and Theory of Automated Timetabling (PATAT) (pp. 114-130). Son, NO.
Riess, C., Strehl, V., & Wanka, R. (2012). The Spectral Relation between the Cube-Connected Cycles and the Shuffle-Exchange Network. In GI (Eds.), Proc. 10th Workshop on Parallel Systems and Algorithms (PASA) of the 25th Int. Conf. on Architecture of Computing Systems (ARCS) (pp. 505-516). München, DE.
Angermeier, J., Sibirko, E., Wanka, R., & Teich, J. (2011). Bitonic Sorting on Dynamically Reconfigurable Architectures. In Proc. IEEE International Symposium on Parallel and Distributed Processing Workshops and Phd Forum (IPDPSW) (pp. 314-317). Anchorage, AL, US: New York, NY, USA: IEEE Press.
Hoffmann, M., Mühlenthaler, M., Helwig, S., & Wanka, R. (2011). Discrete Particle Swarm Optimization for TSP: Theoretical Results and Experimental Evaluations. In Bouchachia A. (Eds.), Proc. International Conference on Adaptive and Intelligent Systems (ICAIS) (pp. 416-427). Klagenfurt: Berlin, Heidelberg: Springer-Verlag.

Last updated on 2019-22-01 at 17:51