An empirical analysis of the grouping genetic algorithm: the timetabling case. - Rhydian Lewis; Ben Paechter (Congress on Evolutionary Computation, 2005)

Application of the Grouping Genetic Algorithm to University Course Timetabling. - Rhydian Lewis; Ben Paechter (EvoCOP, 2005)

Metaheuristics for university course timetabling. - Rhydian Lewis (2006)

On the Combination of Constraint Programming and Stochastic Search: The Sudoku Case. - Rhydian Lewis (Hybrid Metaheuristics, 2007)

Metaheuristics can solve sudoku puzzles. - Rhyd Lewis (J. Heuristics, 2007)

Finding Feasible Timetables Using Group-Based Operators. - Rhydian Lewis; Ben Paechter (IEEE Trans. Evol. Comput., 2007)

Metaheuristics for University Course Timetabling. - Rhydian Lewis; Ben Paechter; Olivia Rossi-Doria (Evolutionary Scheduling, 2007)

A survey of metaheuristic-based techniques for University Timetabling problems. - Rhydian Lewis (OR Spectr., 2008)

A general-purpose hill-climbing method for order independent minimum grouping problems: A case study in graph colouring and bin packing. - Rhyd Lewis (Comput. Oper. Res., 2009)

A worst case analysis of a dynamic programming-based heuristic algorithm for 2D unconstrained guillotine cutting. - Xiang Song 001; C. B. Chu; Rhyd Lewis; Y. Y. Nie; Jonathan M. Thompson (Eur. J. Oper. Res., 2010)

Setting the Research Agenda in Automated Timetabling: The Second International Timetabling Competition. - Barry McCollum; Andrea Schaerf; Ben Paechter; Paul McMullan; Rhydian Lewis; Andrew J. Parkes; Luca Di Gaspero; Rong Qu; Edmund K. Burke (INFORMS J. Comput., 2010)

On the application of graph colouring techniques in round-robin sports scheduling. - Rhyd Lewis; Jonathan M. Thompson (Comput. Oper. Res., 2011)

Revisiting the Restricted Growth Function Genetic Algorithm for Grouping Problems. - Rhyd Lewis; E. Pullin (Evol. Comput., 2011)

An investigation into two bin packing problems with ordering and orientation implications. - Rhyd Lewis; Xiang Song 001; Kathryn A. Dowsland; Jonathan M. Thompson (Eur. J. Oper. Res., 2011)

Combining Heuristic and Exact Methods to Solve the Vehicle Routing Problem with Pickups, Deliveries and Time Windows. - Penny L. Holborn; Jonathan M. Thompson; Rhyd Lewis (EvoCOP, 2012)

A time-dependent metaheuristic algorithm for post enrolment-based course timetabling. - Rhyd Lewis (Ann. Oper. Res., 2012)

A wide-ranging computational comparison of high-performance graph colouring algorithms. - Rhyd Lewis; Jonathan M. Thompson; Christine L. Mumford; J. Gillard (Comput. Oper. Res., 2012)

An incomplete m-exchange algorithm for solving the large-scale multi-scenario knapsack problem. - Xiang Song 001; Rhyd Lewis; Jonathan M. Thompson; Yue Wu (Comput. Oper. Res., 2012)

Optimising large scale public transport network design problems using mixed-mode parallel multi-objective evolutionary algorithms. - Ian M. Cooper; Matthew P. John; Rhydian Lewis; Christine L. Mumford; Andrew Olden (IEEE Congress on Evolutionary Computation, 2014)

An Improved Multi-objective Algorithm for the Urban Transit Routing Problem. - Matthew P. John; Christine L. Mumford; Rhyd Lewis (EvoCOP, 2014)

Towards objective measures of algorithm performance across instance space. - Kate Smith-Miles; Davaatseren Baatar; Brendan Wreford; Rhyd Lewis (Comput. Oper. Res., 2014)

Analysing the effects of solution space connectivity with an effective metaheuristic for the course timetabling problem. - Rhydian Lewis; Jonathan M. Thompson (Eur. J. Oper. Res., 2015)

Graph Coloring and Recombination. - Rhyd Lewis (Handbook of Computational Intelligence, 2015)

Modifying Colourings Between Time-Steps to Tackle Changes in Dynamic Random Graphs. - Bradley Hardy; Rhyd Lewis; Jonathan M. Thompson (EvoCOP, 2016)

Investigating Edge-Reordering Procedures in a Tabu Search Algorithm for the Capacitated Arc Routing Problem. - Wasin Padungwech; Jonathan M. Thompson; Rhyd Lewis (HM, 2016)

Creating seating plans: a practical application. - Rhyd Lewis; Fiona Carroll (J. Oper. Res. Soc., 2016)

The School Bus Routing Problem: An Analysis and Algorithm. - Rhydian Lewis; Kate Smith-Miles; Kyle Phillips (IWOCA, 2017)

How to Pack Trapezoids: Exact and Evolutionary Algorithms. - Rhyd Lewis; Penny L. Holborn (IEEE Trans. Evol. Comput., 2017)

Heuristics for the Score-Constrained Strip-Packing Problem. - Asyl L. Hawa; Rhyd Lewis; Jonathan M. Thompson (COCOA, 2018)

Tackling the edge dynamic graph colouring problem with and without future adjacency information. - Bradley Hardy; Rhyd Lewis; Jonathan M. Thompson (J. Heuristics, 2018)

A heuristic algorithm for finding cost-effective solutions to real-world school bus routing problems. - Rhyd Lewis; Kate Smith-Miles (J. Discrete Algorithms, 2018)

Finding happiness: An analysis of the maximum happy vertices problem. - Rhyd Lewis; Dhananjay R. Thiruvady; Kerri Morgan (Comput. Oper. Res., 2019)

A Heuristic Algorithm for Finding Attractive Fixed-Length Circuits in Street Maps. - Rhyd Lewis (ICCL, 2020)

A Shortest Path Algorithm for Graphs Featuring Transfer Costs at Their Vertices. - Rhyd Lewis (ICCL, 2020)

Tackling the maximum happy vertices problem in large networks. - Dhananjay R. Thiruvady; Rhyd Lewis; Kerri Morgan (4OR, 2020)

Algorithms for Finding Shortest Paths in Networks with Vertex Transfer Penalties. - Rhyd Lewis (Algorithms, 2020)

Editorial for the Special Issue on "Algorithms for Graphs and Networks". - Rhyd Lewis (Algorithms, 2020)

Who is the Centre of the Movie Universe? Using Python and NetworkX to Analyse the Social Network of Movie Stars. - Rhyd Lewis (CoRR, 2020)

Evaluating the influence of parameter setup on the performance of heuristics for the graph colouring problem. - Paulo Neis; Rhyd Lewis (Int. J. Metaheuristics, 2020)

Effects of update frequencies in a dynamic capacitated arc routing problem. - Wasin Padungwech; Jonathan M. Thompson; Rhyd Lewis (Networks, 2020)

Can School Enrolment and Performance be Improved by Maximizing Students' Sense of Choice in Elective Subjects? - Rhyd Lewis; Tom Anderson; Fiona Carroll (J. Learn. Anal., 2020)

A Heuristic Algorithm for School Bus Routing with Bus Stop Selection. - Monique Sciortino; Rhyd Lewis; Jonathan M. Thompson (EvoCOP, 2021)

The maximum happy induced subgraph problem: Bounds and algorithms. - Rhyd Lewis; Dhananjay R. Thiruvady; Kerri Morgan (Comput. Oper. Res., 2021)

Internet Security Aesthetics: Can internet transparency afford social trust? - Fiona Carroll; Rhyd Lewis (ICCCN, 2022)

Exact Algorithms for Finding Fixed-Length Cycles in Edge-Weighted Graphs. - Rhyd Lewis; Fiona Carroll (ICCCN, 2022)

Exact and approximate methods for the score-constrained packing problem. - Asyl L. Hawa; Rhyd Lewis; Jonathan M. Thompson (Eur. J. Oper. Res., 2022)

Finding fixed-length circuits and cycles in undirected edge-weighted graphs: an application with street networks. - Rhyd Lewis; Padraig Corcoran (J. Heuristics, 2022)

Recombinative approaches for the maximum happy vertices problem. - Dhananjay R. Thiruvady; Rhyd Lewis (Swarm Evol. Comput., 2022)

A Comparison of Dijkstra's Algorithm Using Fibonacci Heaps, Binary Heaps, and Self-Balancing Binary Trees. - Rhyd Lewis (CoRR, 2023)

A School Bus Routing Heuristic Algorithm Allowing Heterogeneous Fleets and Bus Stop Selection. - Monique Sciortino; Rhyd Lewis; Jonathan M. Thompson (SN Comput. Sci., 2023)

Methods for determining cycles of a specific length in undirected graphs with edge weights. - Rhyd Lewis; Padraig Corcoran; Andrei V. Gagarin (J. Comb. Optim., 2023)

Digraphs and k-Domination Models for Facility Location Problems in Road Networks: Greedy Heuristics. - Lukas Dijkstra; Andrei Gagarin; Padraig Corcoran; Rhyd Lewis (INOC, 2024)

Determining Fixed-Length Paths in Directed and Undirected Edge-Weighted Graphs. - Daniel Hambly; Rhyd Lewis; Padraig Corcoran (SEA, 2024)

Optimisation of livestock routing on farms. - Padraig Corcoran; Rhyd Lewis (Comput. Ind. Eng., 2024)

Greedy and randomized heuristics for optimization of k-domination models in digraphs and road networks. - Lukas Dijkstra; Andrei Gagarin; Padraig Corcoran; Rhyd Lewis (CoRR, 2024)

Fast Algorithms for Computing Fixed-Length Round Trips in Real-World Street Networks. - Rhyd Lewis; Padraig Corcoran (SN Comput. Sci., 2024)

Exact algorithms in bar nesting: How to cut general items from linear stocks so that wastage is minimised. - Rhyd Lewis; Louis Bonnet (Comput. Ind. Eng., 2025)

A user-centric model of connectivity in street networks. - Padraig Corcoran; Rhyd Lewis (Comput. Oper. Res., 2025)

Soft happy colourings and community structure of networks. - Mohammad Hadi Shekarriz; Dhananjay R. Thiruvady; Asef Nazari; Rhyd Lewis (Comput. Oper. Res., 2025)

An Analysis of the Correctness and Computational Complexity of Path Planning in Payment Channel Networks. - Padraig Corcoran; Rhyd Lewis (CoRR, 2025)

GCol: A High-Performance Python Library for Graph Colouring. - Rhyd Lewis; Geraint Palmer (J. Open Source Softw., 2025)