| Fairness in academic course timetabling M Mühlenthaler, M Mühlenthaler Fairness in Academic Course Timetabling, 75-105, 2015 | 39 | 2015 |
| Fairness in academic course timetabling M Mühlenthaler, R Wanka Annals of Operations Research 239, 171-188, 2016 | 27 | 2016 |
| Discrete Particle Swarm Optimization for TSP: Theoretical Results and Experimental Evaluations. M Hoffmann, M Mühlenthaler, S Helwig, R Wanka ICAIS, 416-427, 2011 | 27 | 2011 |
| The perfect matching reconfiguration problem M Bonamy, N Bousquet, M Heinrich, T Ito, Y Kobayashi, A Mary, ... arXiv preprint arXiv:1904.06184, 2019 | 20 | 2019 |
| Degree-constrained subgraph reconfiguration is in P M Mühlenthaler Mathematical Foundations of Computer Science 2015: 40th International …, 2015 | 15 | 2015 |
| On the connectedness of clash-free timetables M Mühlenthaler, R Wanka arXiv preprint arXiv:1507.02805, 2015 | 11 | 2015 |
| Diameter of colorings under Kempe changes M Bonamy, M Heinrich, T Ito, Y Kobayashi, H Mizuta, M Mühlenthaler, ... Theoretical Computer Science 838, 45-57, 2020 | 10 | 2020 |
| Shortest reconfiguration of matchings N Bousquet, T Hatanaka, T Ito, M Mühlenthaler Graph-Theoretic Concepts in Computer Science: 45th International Workshop …, 2019 | 9 | 2019 |
| Exact Markov chain-based runtime analysis of a discrete particle swarm optimization algorithm on sorting and OneMax M Mühlenthaler, A Raß, M Schmitt, R Wanka Natural Computing, 1-27, 2021 | 7 | 2021 |
| Flexible Graph Connectivity: Approximating Network Design Problems Between 1-and 2-Connectivity D Adjiashvili, F Hommelsheim, M Mühlenthaler Integer Programming and Combinatorial Optimization: 21st International …, 2020 | 7 | 2020 |
| Flexible Graph Connectivity: Approximating Network Design Problems Between 1-and 2-connectivity D Adjiashvili, F Hommelsheim, M Mühlenthaler arXiv preprint arXiv:1910.13297, 2019 | 7 | 2019 |
| ReOrder: Runtime datapath generation for high-throughput multi-stream processing A Becher, S Wildermann, M Mühlenthaler, J Teich 2016 International Conference on ReConFigurable Computing and FPGAs …, 2016 | 7 | 2016 |
| A novel event insertion heuristic for creating feasible course timetables M Mühlenthaler, R Wanka Proc, International Conference on the Practice and Theory of Automated …, 2010 | 7 | 2010 |
| Heterogeneous constraint handling for particle swarm optimization L Omeltschuk, S Helwig, M Mühlenthaler, R Wanka 2011 IEEE Symposium on Swarm Intelligence, 1-7, 2011 | 6 | 2011 |
| Runtime analysis of a discrete particle swarm optimization algorithm on Sorting and OneMax M Mühlenthaler, A Raß, M Schmitt, A Siegling, R Wanka Proceedings of the 14th ACM/SIGEVO Conference on Foundations of Genetic …, 2017 | 4 | 2017 |
| An FPGA implementation of a threat-based strategy for Connect6 T Ziermann, B Schmidt, M Mühlenthaler, D Ziener, J Angermeier, J Teich 2011 International Conference on Field-Programmable Technology, 1-4, 2011 | 4 | 2011 |
| How to secure matchings against edge failures F Hommelsheim, M Mühlenthaler, O Schaudt SIAM Journal on Discrete Mathematics 35 (3), 2265-2292, 2021 | 3 | 2021 |
| Fault-Tolerant Edge-Disjoint Paths--Beyond Uniform Faults D Adjiashvili, F Hommelsheim, M Mühlenthaler, O Schaudt arXiv preprint arXiv:2009.05382, 2020 | 3 | 2020 |
| Shortest reconfiguration of colorings under kempe changes M Bonamy, M Heinrich, T Ito, Y Kobayashi, H Mizuta, M Mühlenthaler, ... 37th International Symposium on Theoretical Aspects of Computer Science …, 2020 | 3 | 2020 |
| Improving bitonic sorting by wire elimination M Mühlenthaler, R Wanka 23th International Conference on Architecture of Computing Systems 2010, 1-8, 2010 | 2 | 2010 |
