21 citations · 30 across the 7 of their papers we have counts for
9 papers
On multiplicativity of directed graphs
Soura Sena Das, Moritz Mühlenthaler, Sagnik Sen +1
A graph category is a category with a set of graphs or similar structures (such as, directed graphs, signed graphs, etc.) playing the role of objects, and an appropriate notion of…
A simple quadratic kernel for Token Jumping on surfaces
Daniel W. Cranston, Moritz Mühlenthaler, Benjamin Peyrille
The problem \textsc{Token Jumping} asks whether, given a graph and two independent sets of \emph{tokens} and of , we can transform into by changing the posit…
Independent set reconfiguration in H-free graphs
Valentin Bartier, Nicolas Bousquet, Moritz Mühlenthaler
Given a graph and two independent sets of , the independent set reconfiguration problem asks whether one independent set can be transformed into the other by moving a single…
Directed hypergraph connectivity augmentation by hyperarc reorientations
Moritz Mühlenthaler, Benjamin Peyrille, Zoltán Szigeti
The orientation theorem of Nash-Williams states that an undirected graph admits a -arc-connected orientation if and only if it is -edge-connected. Recently, Ito et al. showe…
Voting algorithms for unique games on complete graphs
Antoine Méot, Arnaud de Mesmay, Moritz Mühlenthaler +1
An approximation algorithm for a constraint satisfaction problem is called robust if it outputs an assignment satisfying a -fraction of the constraints on any -s…
Exact Markov Chain-based Runtime Analysis of a Discrete Particle Swarm Optimization Algorithm on Sorting and OneMax
Moritz Mühlenthaler, Alexander Raß, Manuel Schmitt +1
Meta-heuristics are powerful tools for solving optimization problems whose structural properties are unknown or cannot be exploited algorithmically. We propose such a meta-heuristi…
Degree-constrained Subgraph Reconfiguration is in P
Moritz Mühlenthaler
The degree-constrained subgraph problem asks for a subgraph of a given graph such that the degree of each vertex is within some specified bounds. We study the following reconfigura…
A Decomposition of the Max-min Fair Curriculum-based Course Timetabling Problem
Moritz Mühlenthaler, Rolf Wanka
We propose a decomposition of the max-min fair curriculum-based course timetabling (MMF-CB-CTT) problem. The decomposition models the room assignment subproblem as a generalized le…
Fairness in Academic Course Timetabling
Moritz Mühlenthaler, Rolf Wanka
We consider the problem of creating fair course timetables in the setting of a university. Our motivation is to improve the overall satisfaction of individuals concerned (students,…