Partial functions and domination. - C. T. Chong; Gordon Hoi; Frank Stephan 001; Daniel Turetsky (Log. Methods Comput. Sci., 2015)

A Fast Exponential Time Algorithm for Max Hamming Distance X3SAT. - Gordon Hoi; Sanjay Jain 001; Frank Stephan 001 (FSTTCS, 2019)

Measure and Conquer for Max Hamming Distance XSAT. - Gordon Hoi; Frank Stephan 001 (ISAAC, 2019)

Exact Satisfiabitity with Jokers. - Gordon Hoi; Sanjay Jain 001; Sibylle Schwarz; Frank Stephan 001 (TAMC, 2019)

An Improved Exact Algorithm for the Exact Satisfiability Problem. - Gordon Hoi (COCOA, 2020)

A Faster Exact Algorithm to Count X3SAT Solutions. - Gordon Hoi; Sanjay Jain 001; Frank Stephan 001 (CP, 2020)

Improved algorithms for the general exact satisfiability problem. - Gordon Hoi; Frank Stephan 001 (Theor. Comput. Sci., 2021)

An Exact Algorithm for finding Maximum Induced Matching in Subcubic Graphs. - Gordon Hoi; Ammar Fathin Sabili; Frank Stephan 001 (CoRR, 2022)

Languages given by Finite Automata over the Unary Alphabet. - Gordon Hoi; Sanjay Jain 001; Frank Stephan 001; Christopher Tan (CoRR, 2023)

A Bisection Approach to Subcubic Maximum Induced Matching. - Gordon Hoi; Sanjay Jain 001; Ammar Fathin Sabili; Frank Stephan 001 (WALCOM, 2024)

Languages given by finite automata over the unary alphabet. - Wojciech Czerwinski; Maciej Debski; Tomasz Gogasz; Gordon Hoi; Sanjay Jain 001; Michal Skrzypczak; Frank Stephan 001; Christopher Tan (J. Comput. Syst. Sci., 2025)