Moritz Mühlenthaler

46 papers A 4B 6Misc 1Journal 27Unranked 8

Year	Rank	Type	Title / Venue / Authors
2026	J	`jnl`	Reconfiguring homomorphisms to reflexive graphs via a simple reduction. Eur. J. Comb. Moritz Mühlenthaler, Mark H. Siggers, Thomas Suzan
2025	B	`conf`	A Simple Quadratic Kernel for Token Jumping on Surfaces. WG Daniel W. Cranston, Moritz Mühlenthaler, Benjamin Peyrille
2025	J	`jnl`	Reconfiguration of Digraph Homomorphisms. SIAM J. Discret. Math. Benjamin Lévêque, Moritz Mühlenthaler, Thomas Suzan
2024	J	`jnl`	A simple quadratic kernel for Token Jumping on surfaces. CoRR Daniel W. Cranston, Moritz Mühlenthaler, Benjamin Peyrille
2024	B	`conf`	Independent Set Reconfiguration in H-Free Graphs. WG Valentin Bartier, Nicolas Bousquet, Moritz Mühlenthaler
2024	J	`jnl`	Independent set reconfiguration in H-free graphs. CoRR Valentin Bartier, Nicolas Bousquet, Moritz Mühlenthaler
2024	J	`jnl`	Reconfiguring homomorphisms to reflexive graphs via a simple reduction. CoRR Moritz Mühlenthaler, Mark H. Siggers, Thomas Suzan
2023	J	`jnl`	Directed hypergraph connectivity augmentation by hyperarc reorientations. CoRR Moritz Mühlenthaler, Benjamin Peyrille, Zoltán Szigeti
2023	J	`jnl`	Feedback vertex set reconfiguration in planar graphs. Theor. Comput. Sci. Nicolas Bousquet, Felix Hommelsheim, Yusuke Kobayashi, Moritz Mühlenthaler, Akira Suzuki
2023	J	`jnl`	Fixed-parameter algorithms for graph constraint logic. Theor. Comput. Sci. Tatsuhiko Hatanaka, Felix Hommelsheim, Takehiro Ito, Yusuke Kobayashi, Moritz Mühlenthaler, Akira Suzuki
2023	A	`conf`	Reconfiguration of Digraph Homomorphisms. STACS Benjamin Lévêque, Moritz Mühlenthaler, Thomas Suzan
2023	—	`conf`	Voting algorithms for unique games on complete graphs. SOSA Antoine Méot, Arnaud de Mesmay, Moritz Mühlenthaler, Alantha Newman
2022	J	`jnl`	Exact Markov chain-based runtime analysis of a discrete particle swarm optimization algorithm on sorting and OneMax. Nat. Comput. Moritz Mühlenthaler, Alexander Raß, Manuel Schmitt, Rolf Wanka
2022	—	`conf`	Fault-Tolerant Edge-Disjoint s-t Paths - Beyond Uniform Faults. SWAT David Adjiashvili, Felix Hommelsheim, Moritz Mühlenthaler, Oliver Schaudt
2022	J	`jnl`	Flexible Graph Connectivity. Math. Program. David Adjiashvili, Felix Hommelsheim, Moritz Mühlenthaler
2022	J	`jnl`	Reconfiguration of Digraph Homomorphisms. CoRR Benjamin Lévêque, Moritz Mühlenthaler, Thomas Suzan
2021	J	`jnl`	How to Secure Matchings against Edge Failures. SIAM J. Discret. Math. Felix Hommelsheim, Moritz Mühlenthaler, Oliver Schaudt
2021	J	`jnl`	Voting algorithms for unique games on complete graphs. CoRR Antoine Méot, Arnaud de Mesmay, Moritz Mühlenthaler, Alantha Newman
2020	J	`jnl`	Diameter of colorings under Kempe changes. Theor. Comput. Sci. Marthe Bonamy, Marc Heinrich, Takehiro Ito, Yusuke Kobayashi, Haruka Mizuta, Moritz Mühlenthaler, Akira Suzuki, Kunihiro Wasa
2020	J	`jnl`	Fault-Tolerant Edge-Disjoint Paths - Beyond Uniform Faults. CoRR David Adjiashvili, Felix Hommelsheim, Moritz Mühlenthaler, Oliver Schaudt
2020	B	`conf`	Fixed-Parameter Algorithms for Graph Constraint Logic. IPEC Tatsuhiko Hatanaka, Felix Hommelsheim, Takehiro Ito, Yusuke Kobayashi, Moritz Mühlenthaler, Akira Suzuki
2020	J	`jnl`	Fixed-Parameter Algorithms for Graph Constraint Logic. CoRR Tatsuhiko Hatanaka, Felix Hommelsheim, Takehiro Ito, Yusuke Kobayashi, Moritz Mühlenthaler, Akira Suzuki
2020	B	`conf`	Flexible Graph Connectivity. IPCO David Adjiashvili, Felix Hommelsheim, Moritz Mühlenthaler
2020	A	`conf`	Shortest Reconfiguration of Colorings Under Kempe Changes. STACS Marthe Bonamy, Marc Heinrich, Takehiro Ito, Yusuke Kobayashi, Haruka Mizuta, Moritz Mühlenthaler, Akira Suzuki, Kunihiro Wasa
2019	Misc	`conf`	Diameter of Colorings Under Kempe Changes. COCOON Marthe Bonamy, Marc Heinrich, Takehiro Ito, Yusuke Kobayashi, Haruka Mizuta, Moritz Mühlenthaler, Akira Suzuki, Kunihiro Wasa
2019	J	`jnl`	Exact Markov Chain-based Runtime Analysis of a Discrete Particle Swarm Optimization Algorithm on Sorting and OneMax. CoRR Moritz Mühlenthaler, Alexander Raß, Manuel Schmitt, Rolf Wanka
2019	J	`jnl`	Flexible Graph Connectivity: Approximating Network Design Problems Between 1- and 2-connectivity. CoRR David Adjiashvili, Felix Hommelsheim, Moritz Mühlenthaler
2019	A	`conf`	How to Secure Matchings Against Edge Failures. STACS Felix Hommelsheim, Moritz Mühlenthaler, Oliver Schaudt
2019	J	`jnl`	Runtime analysis of discrete particle swarm optimization algorithms: A survey. it Inf. Technol. Moritz Mühlenthaler, Alexander Raß
2019	B	`conf`	Shortest Reconfiguration of Matchings. WG Nicolas Bousquet, Tatsuhiko Hatanaka, Takehiro Ito, Moritz Mühlenthaler
2019	B	`conf`	The Perfect Matching Reconfiguration Problem. MFCS Marthe Bonamy, Nicolas Bousquet, Marc Heinrich, Takehiro Ito, Yusuke Kobayashi, Arnaud Mary, Moritz Mühlenthaler, Kunihiro Wasa
2019	J	`jnl`	The Perfect Matching Reconfiguration Problem. CoRR Marthe Bonamy, Nicolas Bousquet, Marc Heinrich, Takehiro Ito, Yusuke Kobayashi, Arnaud Mary, Moritz Mühlenthaler, Kunihiro Wasa
2018	J	`jnl`	How to Secure Matchings Against Edge Failures. CoRR Viktor Bindewald, Felix Hommelsheim, Moritz Mühlenthaler, Oliver Schaudt
2018	J	`jnl`	Shortest Reconfiguration of Matchings. CoRR Nicolas Bousquet, Tatsuhiko Hatanaka, Takehiro Ito, Moritz Mühlenthaler
2017	A	`conf`	Runtime Analysis of a Discrete Particle Swarm Optimization Algorithm on Sorting and OneMax. FOGA Moritz Mühlenthaler, Alexander Raß, Manuel Schmitt, Andreas Siegling, Rolf Wanka
2016	J	`jnl`	Fairness in academic course timetabling. Ann. Oper. Res. Moritz Mühlenthaler, Rolf Wanka
2016	—	`conf`	ReOrder: Runtime datapath generation for high-throughput multi-stream processing. ReConFig Andreas Becher, Stefan Wildermann, Moritz Mühlenthaler, Jürgen Teich
2015	—	`conf`	Degree-Constrained Subgraph Reconfiguration is in P. MFCS (2) Moritz Mühlenthaler
2015	J	`jnl`	Degree-constrained Subgraph Reconfiguration is in P. CoRR Moritz Mühlenthaler
2015	J	`jnl`	On the Connectedness of Clash-free Timetables. CoRR Moritz Mühlenthaler, Rolf Wanka
2013	J	`jnl`	A Decomposition of the Max-min Fair Curriculum-based Course Timetabling Problem. CoRR Moritz Mühlenthaler, Rolf Wanka
2013	J	`jnl`	Fairness in Academic Course Timetabling CoRR Moritz Mühlenthaler, Rolf Wanka
2011	—	`conf`	An FPGA implementation of a threat-based strategy for Connect6. FPT Tobias Ziermann, Bernhard Schmidt, Moritz Mühlenthaler, Daniel Ziener, Josef Angermeier, Jürgen Teich
2011	—	`conf`	Discrete Particle Swarm Optimization for TSP: Theoretical Results and Experimental Evaluations. ICAIS Matthias Hoffmann, Moritz Mühlenthaler, Sabine Helwig, Rolf Wanka
2011	—	`conf`	Heterogeneous constraint handling for particle swarm optimization. SWIS Ludmila Omeltschuk, Sabine Helwig, Moritz Mühlenthaler, Rolf Wanka
2010	—	`conf`	Improving Bitonic Sorting by Wire Elimination. ARCS Workshops Moritz Mühlenthaler, Rolf Wanka