Improving Bitonic Sorting by Wire Elimination. - Moritz Mühlenthaler; Rolf Wanka (ARCS Workshops, 2010)

An FPGA implementation of a threat-based strategy for Connect6. - Tobias Ziermann; Bernhard Schmidt; Moritz Mühlenthaler; Daniel Ziener; Josef Angermeier; Jürgen Teich (FPT, 2011)

Discrete Particle Swarm Optimization for TSP: Theoretical Results and Experimental Evaluations. - Matthias Hoffmann; Moritz Mühlenthaler; Sabine Helwig; Rolf Wanka (ICAIS, 2011)

Heterogeneous constraint handling for particle swarm optimization. - Ludmila Omeltschuk; Sabine Helwig; Moritz Mühlenthaler; Rolf Wanka (SWIS, 2011)

A Decomposition of the Max-min Fair Curriculum-based Course Timetabling Problem. - Moritz Mühlenthaler; Rolf Wanka (CoRR, 2013)

Degree-Constrained Subgraph Reconfiguration is in P. - Moritz Mühlenthaler (MFCS (2), 2015)

On the Connectedness of Clash-free Timetables. - Moritz Mühlenthaler; Rolf Wanka (CoRR, 2015)

ReOrder: Runtime datapath generation for high-throughput multi-stream processing. - Andreas Becher; Stefan Wildermann; Moritz Mühlenthaler; Jürgen Teich (ReConFig, 2016)

Fairness in academic course timetabling. - Moritz Mühlenthaler; Rolf Wanka (Ann. Oper. Res., 2016)

Runtime Analysis of a Discrete Particle Swarm Optimization Algorithm on Sorting and OneMax. - Moritz Mühlenthaler; Alexander Raß; Manuel Schmitt; Andreas Siegling; Rolf Wanka (FOGA, 2017)

How to Secure Matchings Against Edge Failures. - Viktor Bindewald; Felix Hommelsheim; Moritz Mühlenthaler; Oliver Schaudt (CoRR, 2018)

The Perfect Matching Reconfiguration Problem. - Marthe Bonamy; Nicolas Bousquet 001; Marc Heinrich; Takehiro Ito; Yusuke Kobayashi 001; Arnaud Mary; Moritz Mühlenthaler; Kunihiro Wasa (MFCS, 2019)

Shortest Reconfiguration of Matchings. - Nicolas Bousquet 001; Tatsuhiko Hatanaka; Takehiro Ito; Moritz Mühlenthaler (WG, 2019)

Flexible Graph Connectivity: Approximating Network Design Problems Between 1- and 2-connectivity. - David Adjiashvili; Felix Hommelsheim; Moritz Mühlenthaler (CoRR, 2019)

Runtime analysis of discrete particle swarm optimization algorithms: A survey. - Moritz Mühlenthaler; Alexander Raß (it Inf. Technol., 2019)

Shortest Reconfiguration of Colorings Under Kempe Changes. - Marthe Bonamy; Marc Heinrich; Takehiro Ito; Yusuke Kobayashi 001; Haruka Mizuta; Moritz Mühlenthaler; Akira Suzuki 001; Kunihiro Wasa (STACS, 2020)

Fault-Tolerant Edge-Disjoint Paths - Beyond Uniform Faults. - David Adjiashvili; Felix Hommelsheim; Moritz Mühlenthaler; Oliver Schaudt (CoRR, 2020)

Diameter of colorings under Kempe changes. - Marthe Bonamy; Marc Heinrich; Takehiro Ito; Yusuke Kobayashi 001; Haruka Mizuta; Moritz Mühlenthaler; Akira Suzuki 001; Kunihiro Wasa (Theor. Comput. Sci., 2020)

How to Secure Matchings against Edge Failures. - Felix Hommelsheim; Moritz Mühlenthaler; Oliver Schaudt (SIAM J. Discret. Math., 2021)

Fault-Tolerant Edge-Disjoint s-t Paths - Beyond Uniform Faults. - David Adjiashvili; Felix Hommelsheim; Moritz Mühlenthaler; Oliver Schaudt (SWAT, 2022)

Flexible Graph Connectivity. - David Adjiashvili; Felix Hommelsheim; Moritz Mühlenthaler (Math. Program., 2022)

Exact Markov chain-based runtime analysis of a discrete particle swarm optimization algorithm on sorting and OneMax. - Moritz Mühlenthaler; Alexander Raß; Manuel Schmitt; Rolf Wanka (Nat. Comput., 2022)

Voting algorithms for unique games on complete graphs. - Antoine Méot; Arnaud de Mesmay; Moritz Mühlenthaler; Alantha Newman (SOSA, 2023)

Directed hypergraph connectivity augmentation by hyperarc reorientations. - Moritz Mühlenthaler; Benjamin Peyrille; Zoltán Szigeti (CoRR, 2023)

Fixed-parameter algorithms for graph constraint logic. - Tatsuhiko Hatanaka; Felix Hommelsheim; Takehiro Ito; Yusuke Kobayashi 001; Moritz Mühlenthaler; Akira Suzuki 001 (Theor. Comput. Sci., 2023)

Feedback vertex set reconfiguration in planar graphs. - Nicolas Bousquet 001; Felix Hommelsheim; Yusuke Kobayashi 001; Moritz Mühlenthaler; Akira Suzuki 001 (Theor. Comput. Sci., 2023)

Independent Set Reconfiguration in H-Free Graphs. - Valentin Bartier; Nicolas Bousquet 001; Moritz Mühlenthaler (WG, 2024)

A simple quadratic kernel for Token Jumping on surfaces. - Daniel W. Cranston; Moritz Mühlenthaler; Benjamin Peyrille (CoRR, 2024)

Reconfiguring homomorphisms to reflexive graphs via a simple reduction. - Moritz Mühlenthaler; Mark H. Siggers; Thomas Suzan (CoRR, 2024)

Reconfiguration of Digraph Homomorphisms. - Benjamin Lévêque; Moritz Mühlenthaler; Thomas Suzan (SIAM J. Discret. Math., 2025)