Moritz Mühlenthaler

Available identifiers

Publication	Date of Publication	Type
Reconfiguration of digraph homomorphisms	2024-10-08	Paper
Fault-tolerant edge-disjoint \(s\)-\(t\) paths -- beyond uniform faults	2024-05-27	Paper
Voting algorithms for unique games on complete graphs	2024-05-14	Paper
https://portal.mardi4nfdi.de/entity/Q6089660	2023-11-13	Paper
Feedback vertex set reconfiguration in planar graphs	2023-10-26	Paper
Exact Markov chain-based runtime analysis of a discrete particle swarm optimization algorithm on sorting and OneMax	2023-08-31	Paper
Fixed-parameter algorithms for graph constraint logic	2023-05-12	Paper
Directed hypergraph connectivity augmentation by hyperarc reorientations	2023-04-28	Paper
Shortest Reconfiguration of Colorings Under Kempe Changes	2023-02-07	Paper
Flexible Graph Connectivity	2022-10-14	Paper
The Perfect Matching Reconfiguration Problem	2022-07-21	Paper
How to Secure Matchings Against Edge Failures	2022-07-18	Paper
Reconfiguration of Digraph Homomorphisms	2022-05-18	Paper
Flexible graph connectivity	2022-03-22	Paper
How to Secure Matchings against Edge Failures	2021-10-18	Paper
Diameter of colorings under Kempe changes	2020-09-01	Paper
Shortest reconfiguration of matchings	2020-02-24	Paper
Diameter of colorings under Kempe changes	2020-02-24	Paper
Runtime analysis of a discrete particle swarm optimization algorithm on sorting and OneMax	2017-06-13	Paper
Fairness in academic course timetabling	2016-05-18	Paper
Degree-constrained subgraph reconfiguration is in P	2015-09-16	Paper

This page was built for person: Moritz Mühlenthaler