Fairness in academic course timetabling M Mühlenthaler, M Mühlenthaler Fairness in academic course timetabling, 75-105, 2015 | 68 | 2015 |
Discrete particle swarm optimization for TSP: theoretical results and experimental evaluations M Hoffmann, M Mühlenthaler, S Helwig, R Wanka International Conference on Adaptive and Intelligent Systems, 416-427, 2011 | 31 | 2011 |
The perfect matching reconfiguration problem M Bonamy, N Bousquet, M Heinrich, T Ito, Y Kobayashi, A Mary, ... arXiv preprint arXiv:1904.06184, 2019 | 24 | 2019 |
Degree-constrained subgraph reconfiguration is in P M Mühlenthaler Mathematical Foundations of Computer Science 2015: 40th International …, 2015 | 15 | 2015 |
Flexible Graph Connectivity: Approximating network design problems between 1-and 2-connectivity D Adjiashvili, F Hommelsheim, M Mühlenthaler Mathematical Programming 192 (1), 409-441, 2022 | 14 | 2022 |
Shortest reconfiguration of matchings N Bousquet, T Hatanaka, T Ito, M Mühlenthaler International Workshop on Graph-Theoretic Concepts in Computer Science, 162-174, 2019 | 12 | 2019 |
On the connectedness of clash-free timetables M Mühlenthaler, R Wanka arXiv preprint arXiv:1507.02805, 2015 | 12 | 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 | 11 | 2020 |
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 21 (4), 651-677, 2022 | 10 | 2022 |
Fault-Tolerant Edge-Disjoint Paths--Beyond Uniform Faults D Adjiashvili, F Hommelsheim, M Mühlenthaler, O Schaudt arXiv preprint arXiv:2009.05382, 2020 | 8 | 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 | 7 | 2020 |
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 |
How to secure matchings against edge failures F Hommelsheim, M Mühlenthaler, O Schaudt SIAM Journal on Discrete Mathematics 35 (3), 2265-2292, 2021 | 5 | 2021 |
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 | 5 | 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 |
Feedback vertex set reconfiguration in planar graphs N Bousquet, F Hommelsheim, Y Kobayashi, M Mühlenthaler, A Suzuki Theoretical Computer Science 979, 114188, 2023 | 2 | 2023 |
Directed hypergraph connectivity augmentation by hyperarc reorientations M Mühlenthaler, B Peyrille, Z Szigeti arXiv preprint arXiv:2304.14868, 2023 | 2 | 2023 |
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 |