research
∙
04/28/2023
Directed hypergraph connectivity augmentation by hyperarc reorientations
The orientation theorem of Nash-Williams states that an undirected graph...
share
research
∙
05/18/2022
Reconfiguration of Digraph Homomorphisms
For a fixed graph H, the H-Recoloring problem asks whether for two given...
research
∙
10/22/2021
Voting algorithms for unique games on complete graphs
An approximation algorithm for a Constraint Satisfaction Problem is call...
research
∙
11/20/2020
Fixed-Parameter Algorithms for Graph Constraint Logic
Non-deterministic constraint logic (NCL) is a simple model of computatio...
research
∙
09/10/2020
Fault-Tolerant Edge-Disjoint Paths – Beyond Uniform Faults
The overwhelming majority of survivable (fault-tolerant) network design ...
research
∙
10/29/2019
Flexible Graph Connectivity: Approximating Network Design Problems Between 1- and 2-connectivity
Graph connectivity and network design problems are among the most fundam...
research
∙
04/12/2019
The Perfect Matching Reconfiguration Problem
We study the perfect matching reconfiguration problem: Given two perfect...
research
∙
02/05/2019
Exact Markov Chain-based Runtime Analysis of a Discrete Particle Swarm Optimization Algorithm on Sorting and OneMax
We present a comprehensive analysis of a discrete particle swarm optimiz...
research
∙
12/13/2018
Shortest Reconfiguration of Matchings
Imagine that unlabelled tokens are placed on the edges of a graph, such ...
research
∙
05/03/2018
How to Secure Matchings Against Edge Failures
The matching preclusion number of a graph is the minimal number of edges...
research
∙
06/24/2013
A Decomposition of the Max-min Fair Curriculum-based Course Timetabling Problem
We propose a decomposition of the max-min fair curriculum-based course t...
research
∙
03/12/2013
