Publications

For a recent list of publications see dblp or my profile on google scholar.

List of publications (updated ocasionally)

  1. David Adjiashvili, Felix Hommelsheim, and Moritz Mühlenthaler. Flexible graph connectivity: Approximating network design problems between 1- and 2-connectivity. In Integer Programming and Combinatorial Optimization (IPCO), 2020. (to appear).
  2. Marthe Bonamy, Nicolas Bousquet, Marc Heinrich, Takehiro Ito, Yusuke Kobayashi, Arnaud Mary, Moritz Mühlenthaler, and Kunihiro Wasa. Shortest reconfiguration of colorings under Kempe changes. In Symposium on Theoretical Aspects of Computer Science (STACS), 2020 (to appear).
  3. Moritz Mühlenthaler and Alexander Raß. Runtime analysis of discrete particle swarm optimization algorithms: A survey. it-Information Technology, 61(4):177–185, 2019.
  4. Marthe Bonamy, Nicolas Bousquet, Marc Heinrich, Takehiro Ito, Yusuke Kobayashi, Arnaud Mary, Moritz Mühlenthaler, and Kunihiro Wasa. The perfect matching reconfiguration problem. In 44th International Symposium on Mathematical Foundations of Computer Science (MFCS), Proceedings, pages 80:1–80:14, 2019.
  5. Marthe Bonamy, Marc Heinrich, Takehiro Ito, Yusuke Kobayashi, Haruka Mizuta, Moritz Mühlenthaler, Akira Suzuki, and Kunihiro Wasa. Diameter of colorings under Kempe changes. In Computing and Combinatorics (COCOON), Proceedings, pages 52–64. Springer, 2019.
  6. Nicolas Bousquet, Tatsuhiko Hatanaka, Takehiro Ito, and Moritz Mühlenthaler. Shortest reconfiguration of matchings. In Workshop on Graph-theoretic Concepts in Computer Science (WG), Proceedings, pages 162–174, 2019.
  7. Felix Hommelsheim, Moritz Mühlenthaler, and Oliver Schaudt. How to secure matchings against edge failures. In Symposium on Theoretical Aspects of Computer Science (STACS), Proceedings, pages 38:1–38:16, 2019.
  8. Moritz Mühlenthaler, Alexander Raß, Manuel Schmitt, Andreas Siegling, and Rolf Wanka. Runtime analysis of a discrete particle swarm optimization algorithm on Sorting and OneMax. In Proceedings of the 14th ACM/SIGEVO Conference on Foundations of Genetic Algorithms, FOGA ’17, pages 13–24. ACM, 2017.
  9. Andreas Becher, Stefan Wildermann, Moritz Mühlenthaler, and Jürgen Teich. ReOrder: Runtime Datapath Generation for High-Throughput Multi-Stream Processing. In Proceedings of the International Conference on Reconfigurable Computing and FPGAs, pages 1–8, 2016.
  10. Moritz Mühlenthaler. Degree-constrained subgraph reconfiguration is in P. In Mathematical Foundations of Computer Science 2015, volume 9235 of LNCS, pages 505–516. Springer Berlin Heidelberg, 2015.
  11. Moritz Mühlenthaler. Fairness in Academic Course Timetabling. Lecture Notes in Economics and Mathematical Systems. Springer International Publishing, 2015. Dissertation.
  12. Moritz Mühlenthaler and Rolf Wanka. Fairness in academic course timetabling. Annals of Operations Research, pages 1–18, 2014.
  13. Moritz Mühlenthaler and Rolf Wanka. The connectedness of clash-free timetables. In Proceedings of the 10th International Conference on the Practice and Theory of Automated Timetabling (PATAT), pages 330–346, 2014.
  14. Moritz Mühlenthaler and Rolf Wanka. A decomposition of the max-min fair curriculum-based course timetabling problem. In Proceedings of the 6th Multidisciplinary International Conference on Scheduling: Theory and Applications (MISTA), pages 300–313, 2013.
  15. Moritz Mühlenthaler and Rolf Wanka. Fairness in academic course timetabling. In Proceedings of the 9th International Conference on the Practice and Theory of Automated Timetabling (PATAT), pages 114–130, 2012.
  16. Matthias Hoffmann, Moritz Mühlenthaler, Sabine Helwig, and Rolf Wanka. Discrete Particle Swarm Optimization for the TSP: Theoretical results and experimental evaluations. In Proceedings of the International Conference on Adaptive and Intelligent Systems (ICAIS), pages 416–427, 2011.
  17. Ludmila Omeltschuk, Sabine Helwig, Moritz Mühlenthaler, and Rolf Wanka. Heterogeneous constraint handling for particle swarm optimization. In Proceedings of the IEEE Swarm Intelligence Symposium (SIS), pages 37–43, 2011.
  18. Moritz Mühlenthaler and Rolf Wanka. A novel event insertion heuristic for finding feasible solutions of course timetabling problems. In Proceedings of the 8th International Conference on the Practice and Theory of Automated Timetabling (PATAT), pages 294–304, 2010.
  19. Moritz Mühlenthaler and Rolf Wanka. Improving Bitonic sorting by wire elimination. In Proceedings of the 23rd PARS-Workshop on Parallel Systems and Architectures of Computing Systems (ARCS), pages 15–22, 2010.

Les commentaires sont fermés.