Experimental Evaluation of a Local Search Approximation Algorithm for the Multiway Cut Problem. - Andrew Bloch-Hansen; Nasim Samei; Roberto Solis-Oba (CALDAM, 2021)

A Polynomial-Time Approximation Scheme for Thief Orienteering on Directed Acyclic Graphs. - Andrew Bloch-Hansen; Daniel R. Page; Roberto Solis-Oba (IWOCA, 2023)

A local search approximation algorithm for the multiway cut problem. - Andrew Bloch-Hansen; Nasim Samei; Roberto Solis-Oba (Discret. Appl. Math., 2023)

The Thief Orienteering Problem on Series-Parallel Graphs. - Andrew Bloch-Hansen; Roberto Solis-Oba (ISCO, 2024)

Algorithms for the thief orienteering problem on directed acyclic graphs. - Andrew Bloch-Hansen; Roberto Solis-Oba; Daniel R. Page (Theor. Comput. Sci., 2025)

High Multiplicity Strip Packing with Three Rectangle Types. - Andrew Bloch-Hansen; Roberto Solis-Oba; Andy Yu (Theory Comput. Syst., 2025)

The thief orienteering problem on 2-terminal series-parallel graphs. - Andrew Bloch-Hansen; Roberto Solis-Oba (Acta Informatica, 2025)