Moritz Mühlenthaler

According to our database, Moritz Mühlenthaler authored at least 31 papers between 2010 and 2026.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2026

A Complexity Dichotomy for Generalized Rainbow Matchings Based on Color Classes.

Felix Hommelsheim, Pia Jehmlich, Moritz Mühlenthaler

CoRR, April, 2026

Reconfiguring homomorphisms to reflexive graphs via a simple reduction.

Moritz Mühlenthaler, Mark H. Siggers, Thomas Suzan

Eur. J. Comb., 2026

Directed hypergraph connectivity augmentation by hyperarc reorientations.

Moritz Mühlenthaler, Benjamin Peyrille, Zoltán Szigeti

Discret. Appl. Math., 2026

2025

A Simple Quadratic Kernel for Token Jumping on Surfaces.

Daniel W. Cranston, Moritz Mühlenthaler, Benjamin Peyrille

Proceedings of the Graph-Theoretic Concepts in Computer Science, 2025

2024

Independent Set Reconfiguration in H-Free Graphs.

Valentin Bartier, Nicolas Bousquet, Moritz Mühlenthaler

Proceedings of the Graph-Theoretic Concepts in Computer Science, 2024

2023

Feedback vertex set reconfiguration in planar graphs.

Nicolas Bousquet, Felix Hommelsheim, Yusuke Kobayashi, Moritz Mühlenthaler, Akira Suzuki

Theor. Comput. Sci., November, 2023

Reconfiguration of Digraph Homomorphisms.

Benjamin Lévêque, Moritz Mühlenthaler, Thomas Suzan

Proceedings of the 40th International Symposium on Theoretical Aspects of Computer Science, 2023

Voting algorithms for unique games on complete graphs.

Antoine Méot, Arnaud de Mesmay, Moritz Mühlenthaler, Alantha Newman

Proceedings of the 2023 Symposium on Simplicity in Algorithms, 2023

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

Fault-Tolerant Edge-Disjoint s-t Paths - Beyond Uniform Faults.

David Adjiashvili, Felix Hommelsheim, Moritz Mühlenthaler, Oliver Schaudt

Proceedings of the 18th Scandinavian Symposium and Workshops on Algorithm Theory, 2022

2020

Fault-Tolerant Edge-Disjoint Paths - Beyond Uniform Faults.

David Adjiashvili, Felix Hommelsheim, Moritz Mühlenthaler, Oliver Schaudt

CoRR, 2020

Shortest Reconfiguration of Colorings Under Kempe Changes.

Marthe Bonamy, Marc Heinrich, Takehiro Ito, Yusuke Kobayashi, Haruka Mizuta, Moritz Mühlenthaler, Akira Suzuki, Kunihiro Wasa

Proceedings of the 37th International Symposium on Theoretical Aspects of Computer Science, 2020

Fixed-Parameter Algorithms for Graph Constraint Logic.

Tatsuhiko Hatanaka, Felix Hommelsheim, Takehiro Ito, Yusuke Kobayashi, Moritz Mühlenthaler, Akira Suzuki

Proceedings of the 15th International Symposium on Parameterized and Exact Computation, 2020

Flexible Graph Connectivity.

David Adjiashvili, Felix Hommelsheim, Moritz Mühlenthaler

Proceedings of the Integer Programming and Combinatorial Optimization, 2020

2019

Runtime analysis of discrete particle swarm optimization algorithms: A survey.

Moritz Mühlenthaler, Alexander Raß

it Inf. Technol., 2019

Flexible Graph Connectivity: Approximating Network Design Problems Between 1- and 2-connectivity.

David Adjiashvili, Felix Hommelsheim, Moritz Mühlenthaler

CoRR, 2019

Shortest Reconfiguration of Matchings.

Nicolas Bousquet, Tatsuhiko Hatanaka, Takehiro Ito, Moritz Mühlenthaler

Proceedings of the Graph-Theoretic Concepts in Computer Science, 2019

How to Secure Matchings Against Edge Failures.

Felix Hommelsheim, Moritz Mühlenthaler, Oliver Schaudt

Proceedings of the 36th International Symposium on Theoretical Aspects of Computer Science, 2019

The Perfect Matching Reconfiguration Problem.

Marthe Bonamy, Nicolas Bousquet, Marc Heinrich, Takehiro Ito, Yusuke Kobayashi, Arnaud Mary, Moritz Mühlenthaler, Kunihiro Wasa

Proceedings of the 44th International Symposium on Mathematical Foundations of Computer Science, 2019

Diameter of Colorings Under Kempe Changes.

Marthe Bonamy, Marc Heinrich, Takehiro Ito, Yusuke Kobayashi, Haruka Mizuta, Moritz Mühlenthaler, Akira Suzuki, Kunihiro Wasa

Proceedings of the Computing and Combinatorics - 25th International Conference, 2019

2018

How to Secure Matchings Against Edge Failures.

Viktor Bindewald, Felix Hommelsheim, Moritz Mühlenthaler, Oliver Schaudt

CoRR, 2018

2017

Runtime Analysis of a Discrete Particle Swarm Optimization Algorithm on Sorting and OneMax.

Moritz Mühlenthaler, Alexander Raß, Manuel Schmitt, Andreas Siegling, Rolf Wanka

Proceedings of the 14th ACM/SIGEVO Conference on Foundations of Genetic Algorithms, 2017

2016

Fairness in academic course timetabling.

Moritz Mühlenthaler, Rolf Wanka

Ann. Oper. Res., 2016

ReOrder: Runtime datapath generation for high-throughput multi-stream processing.

Andreas Becher, Stefan Wildermann, Moritz Mühlenthaler, Jürgen Teich

Proceedings of the International Conference on ReConFigurable Computing and FPGAs, 2016

2015

On the Connectedness of Clash-free Timetables.

Moritz Mühlenthaler, Rolf Wanka

CoRR, 2015

Degree-Constrained Subgraph Reconfiguration is in P.

Moritz Mühlenthaler

Proceedings of the Mathematical Foundations of Computer Science 2015, 2015

2013

A Decomposition of the Max-min Fair Curriculum-based Course Timetabling Problem.

Moritz Mühlenthaler, Rolf Wanka

CoRR, 2013

2011

Heterogeneous constraint handling for particle swarm optimization.

Ludmila Omeltschuk, Sabine Helwig, Moritz Mühlenthaler, Rolf Wanka

Proceedings of the 2011 IEEE Symposium on Swarm Intelligence, 2011

Discrete Particle Swarm Optimization for TSP: Theoretical Results and Experimental Evaluations.

Matthias Hoffmann, Moritz Mühlenthaler, Sabine Helwig, Rolf Wanka

Proceedings of the Adaptive and Intelligent Systems - Second International Conference, 2011

An FPGA implementation of a threat-based strategy for Connect6.

Tobias Ziermann, Bernhard Schmidt, Moritz Mühlenthaler, Daniel Ziener, Josef Angermeier, Jürgen Teich

Proceedings of the 2011 International Conference on Field-Programmable Technology, 2011

2010

Improving Bitonic Sorting by Wire Elimination.

Moritz Mühlenthaler, Rolf Wanka

Proceedings of the ARCS '10, 2010