The orientation theorem of Nash-Williams states that an undirected graph...
For a fixed graph H, the H-Recoloring problem asks whether for two given...
An approximation algorithm for a Constraint Satisfaction Problem is call...
Non-deterministic constraint logic (NCL) is a simple model of computatio...
The overwhelming majority of survivable (fault-tolerant) network design
...
Graph connectivity and network design problems are among the most fundam...
We study the perfect matching reconfiguration problem: Given two perfect...
We present a comprehensive analysis of a discrete particle swarm optimiz...
Imagine that unlabelled tokens are placed on the edges of a graph, such ...
The matching preclusion number of a graph is the minimal number of edges...
We propose a decomposition of the max-min fair curriculum-based course
t...
We consider the problem of creating fair course timetables in the settin...