Graph algorithms lie at the heart of modern computational theory, probing how networks of vertices and edges can be explored, optimised or transformed under constraints that often defy efficient ...

Combinatorial optimisation problems arise in many fields, from logistics and network design to machine learning and bioinformatics. Most classical formulations are NP-hard, rendering exact ...

The proposed algorithm combines variational scheduling with post-processing to achieve near-optimal solutions to combinatorial optimization problems with constraints within the operation time of ...

In this graduate-level course, we will be covering advanced topics in combinatorial optimization. We will start with matchings and cover many results, extending the fundamental results of matchings, ...