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 6 of 6 Go to next page Go to last page

Wanka, R., Meyer auf der Heide, F., & Storch, M. (1997). Optimal tradeoffs between size and slowdown for universal parallel networks. Theory of Computing Systems, 30(6), 627-644. https://dx.doi.org/10.1007/s002240000071
Kutylowski, M., & Wanka, R. (1997). Playing Tetris on Meshes and Multi-Dimensional SHEARSORT. In In Proc. of 8th International Symposium on Algorithms and Computation (ISAAC) (pp. 32-41).
Wachsmann, A., & Wanka, R. (1997). Sorting on a massively parallel system using a library of basic primitives: Modeling and experimental results. In Proc 3rd International Conference on Parallel Processing (Euro-Par) (pp. 399-408). Passau.
Wanka, R. (1996). Strongly Adaptive Token Distribution. Algorithmica, 15(5), 413-427. https://dx.doi.org/10.1007/BF01955042
Kutylowski, M., Lorys, K., Oesterdiekhoff, B., & Wanka, R. (1994). Fast and Feasible Periodic Sorting Networks of Constant Depth. In Proceedings of the 35th IEEE Symposium on Foundations of Computer Science (FOCS) (pp. 369-380).

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