Graph cover problems form a critical area within discrete optimisation and theoretical computer science, addressing the challenge of selecting subsets of vertices (or edges) that satisfy predetermined ...
On Monday the 2nd of December 2019, M.Sc. Paul Saikko will defend his doctoral thesis on Implicit Hitting Set Algorithms for Constraint Optimization. The thesis is a part of research done in the ...