{"id":10,"date":"2020-04-08T10:54:38","date_gmt":"2020-04-08T08:54:38","guid":{"rendered":"https:\/\/pagesperso.g-scop.grenoble-inp.fr\/moritzmuhlenthaler\/?page_id=10"},"modified":"2022-10-17T12:19:04","modified_gmt":"2022-10-17T10:19:04","slug":"publications","status":"publish","type":"page","link":"https:\/\/pagesperso.g-scop.grenoble-inp.fr\/moritzmuhlenthaler\/publications\/","title":{"rendered":"Publications"},"content":{"rendered":"\n

For a recent list of publications see dblp<\/a> or my profile on google scholar<\/a>.<\/p>\n\n\n\n

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

    <\/p>\n","protected":false},"excerpt":{"rendered":"

    For a recent list of publications see dblp or my profile on google scholar. List of publications (updated ocasionally) David Adjiashvili, Felix Hommelsheim, and Moritz M\u00fchlenthaler. Flexible graph connectivity: Approximating network design problems between 1- and 2-connectivity. In Integer Programming and Combinatorial Optimization (IPCO), 2020. (to appear). Marthe Bonamy, Nicolas… Continue reading → <\/span><\/a><\/p>\n","protected":false},"author":10,"featured_media":0,"parent":0,"menu_order":0,"comment_status":"closed","ping_status":"closed","template":"","meta":{"footnotes":""},"class_list":["post-10","page","type-page","status-publish","hentry"],"_links":{"self":[{"href":"https:\/\/pagesperso.g-scop.grenoble-inp.fr\/moritzmuhlenthaler\/wp-json\/wp\/v2\/pages\/10","targetHints":{"allow":["GET"]}}],"collection":[{"href":"https:\/\/pagesperso.g-scop.grenoble-inp.fr\/moritzmuhlenthaler\/wp-json\/wp\/v2\/pages"}],"about":[{"href":"https:\/\/pagesperso.g-scop.grenoble-inp.fr\/moritzmuhlenthaler\/wp-json\/wp\/v2\/types\/page"}],"author":[{"embeddable":true,"href":"https:\/\/pagesperso.g-scop.grenoble-inp.fr\/moritzmuhlenthaler\/wp-json\/wp\/v2\/users\/10"}],"replies":[{"embeddable":true,"href":"https:\/\/pagesperso.g-scop.grenoble-inp.fr\/moritzmuhlenthaler\/wp-json\/wp\/v2\/comments?post=10"}],"version-history":[{"count":5,"href":"https:\/\/pagesperso.g-scop.grenoble-inp.fr\/moritzmuhlenthaler\/wp-json\/wp\/v2\/pages\/10\/revisions"}],"predecessor-version":[{"id":47,"href":"https:\/\/pagesperso.g-scop.grenoble-inp.fr\/moritzmuhlenthaler\/wp-json\/wp\/v2\/pages\/10\/revisions\/47"}],"wp:attachment":[{"href":"https:\/\/pagesperso.g-scop.grenoble-inp.fr\/moritzmuhlenthaler\/wp-json\/wp\/v2\/media?parent=10"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}