Rhyd Lewis - RankMe

53 papers B 8C 2Journal 39Unranked 3

Year	Rank	Type	Title / Venue / Authors
2026	B	`conf`	Methods for Finding Paths of a Prescribed Length in Weighted Graphs. EvoCOP Daniel Hambly, Rhyd Lewis, Padraig Corcoran
2025	J	`jnl`	A user-centric model of connectivity in street networks. Comput. Oper. Res. Padraig Corcoran, Rhyd Lewis
2025	J	`jnl`	An Analysis of the Correctness and Computational Complexity of Path Planning in Payment Channel Networks. CoRR Padraig Corcoran, Rhyd Lewis
2025	J	`jnl`	Exact algorithms in bar nesting: How to cut general items from linear stocks so that wastage is minimised. Comput. Ind. Eng. Rhyd Lewis, Louis Bonnet
2025	J	`jnl`	GCol: A High-Performance Python Library for Graph Colouring. J. Open Source Softw. Rhyd Lewis, Geraint Palmer
2025	J	`jnl`	Path Planning in Payment Channel Networks with Multi-Party Channels. Distributed Ledger Technol. Res. Pract. Padraig Corcoran, Rhyd Lewis
2025	J	`jnl`	Soft happy colourings and community structure of networks. Comput. Oper. Res. Mohammad Hadi Shekarriz, Dhananjay R. Thiruvady, Asef Nazari, Rhyd Lewis
2024	B	`conf`	Determining Fixed-Length Paths in Directed and Undirected Edge-Weighted Graphs. SEA Daniel Hambly, Rhyd Lewis, Padraig Corcoran
2024	C	`conf`	Digraphs and k-Domination Models for Facility Location Problems in Road Networks: Greedy Heuristics. INOC Lukas Dijkstra, Andrei Gagarin, Padraig Corcoran, Rhyd Lewis
2024	J	`jnl`	Fast Algorithms for Computing Fixed-Length Round Trips in Real-World Street Networks. SN Comput. Sci. Rhyd Lewis, Padraig Corcoran
2024	J	`jnl`	Greedy and randomized heuristics for optimization of k-domination models in digraphs and road networks. CoRR Lukas Dijkstra, Andrei Gagarin, Padraig Corcoran, Rhyd Lewis
2024	J	`jnl`	Optimisation of livestock routing on farms. Comput. Ind. Eng. Padraig Corcoran, Rhyd Lewis
2024	J	`jnl`	Soft happy colourings and community structure of networks. CoRR Mohammad Hadi Shekarriz, Dhananjay R. Thiruvady, Asef Nazari, Rhyd Lewis
2023	J	`jnl`	A Comparison of Dijkstra's Algorithm Using Fibonacci Heaps, Binary Heaps, and Self-Balancing Binary Trees. CoRR Rhyd Lewis
2023	J	`jnl`	A School Bus Routing Heuristic Algorithm Allowing Heterogeneous Fleets and Bus Stop Selection. SN Comput. Sci. Monique Sciortino, Rhyd Lewis, Jonathan M. Thompson
2023	J	`jnl`	Methods for determining cycles of a specific length in undirected graphs with edge weights. J. Comb. Optim. Rhyd Lewis, Padraig Corcoran, Andrei V. Gagarin
2022	B	`conf`	Exact Algorithms for Finding Fixed-Length Cycles in Edge-Weighted Graphs. ICCCN Rhyd Lewis, Fiona Carroll
2022	J	`jnl`	Exact and approximate methods for the score-constrained packing problem. Eur. J. Oper. Res. Asyl L. Hawa, Rhyd Lewis, Jonathan M. Thompson
2022	J	`jnl`	Finding fixed-length circuits and cycles in undirected edge-weighted graphs: an application with street networks. J. Heuristics Rhyd Lewis, Padraig Corcoran
2022	B	`conf`	Internet Security Aesthetics: Can internet transparency afford social trust? ICCCN Fiona Carroll, Rhyd Lewis
2022	J	`jnl`	Recombinative approaches for the maximum happy vertices problem. Swarm Evol. Comput. Dhananjay R. Thiruvady, Rhyd Lewis
2021	B	`conf`	A Heuristic Algorithm for School Bus Routing with Bus Stop Selection. EvoCOP Monique Sciortino, Rhyd Lewis, Jonathan M. Thompson
2021	J	`jnl`	The maximum happy induced subgraph problem: Bounds and algorithms. Comput. Oper. Res. Rhyd Lewis, Dhananjay R. Thiruvady, Kerri Morgan
2020	—	`conf`	A Heuristic Algorithm for Finding Attractive Fixed-Length Circuits in Street Maps. ICCL Rhyd Lewis
2020	—	`conf`	A Shortest Path Algorithm for Graphs Featuring Transfer Costs at Their Vertices. ICCL Rhyd Lewis
2020	J	`jnl`	Algorithms for Finding Shortest Paths in Networks with Vertex Transfer Penalties. Algorithms Rhyd Lewis
2020	J	`jnl`	Can School Enrolment and Performance be Improved by Maximizing Students' Sense of Choice in Elective Subjects? J. Learn. Anal. Rhyd Lewis, Tom Anderson, Fiona Carroll
2020	J	`jnl`	Editorial for the Special Issue on "Algorithms for Graphs and Networks". Algorithms Rhyd Lewis
2020	J	`jnl`	Effects of update frequencies in a dynamic capacitated arc routing problem. Networks Wasin Padungwech, Jonathan M. Thompson, Rhyd Lewis
2020	J	`jnl`	Evaluating the influence of parameter setup on the performance of heuristics for the graph colouring problem. Int. J. Metaheuristics Paulo Neis, Rhyd Lewis
2020	J	`jnl`	Tackling the maximum happy vertices problem in large networks. 4OR Dhananjay R. Thiruvady, Rhyd Lewis, Kerri Morgan
2020	J	`jnl`	Who is the Centre of the Movie Universe? Using Python and NetworkX to Analyse the Social Network of Movie Stars. CoRR Rhyd Lewis
2019	J	`jnl`	Finding happiness: An analysis of the maximum happy vertices problem. Comput. Oper. Res. Rhyd Lewis, Dhananjay R. Thiruvady, Kerri Morgan
2018	J	`jnl`	A heuristic algorithm for finding cost-effective solutions to real-world school bus routing problems. J. Discrete Algorithms Rhyd Lewis, Kate Smith-Miles
2018	C	`conf`	Heuristics for the Score-Constrained Strip-Packing Problem. COCOA Asyl L. Hawa, Rhyd Lewis, Jonathan M. Thompson
2018	J	`jnl`	Tackling the edge dynamic graph colouring problem with and without future adjacency information. J. Heuristics Bradley Hardy, Rhyd Lewis, Jonathan M. Thompson
2017	J	`jnl`	How to Pack Trapezoids: Exact and Evolutionary Algorithms. IEEE Trans. Evol. Comput. Rhyd Lewis, Penny L. Holborn
2016	J	`jnl`	Creating seating plans: a practical application. J. Oper. Res. Soc. Rhyd Lewis, Fiona Carroll
2016	—	`conf`	Investigating Edge-Reordering Procedures in a Tabu Search Algorithm for the Capacitated Arc Routing Problem. HM Wasin Padungwech, Jonathan M. Thompson, Rhyd Lewis
2016	B	`conf`	Modifying Colourings Between Time-Steps to Tackle Changes in Dynamic Random Graphs. EvoCOP Bradley Hardy, Rhyd Lewis, Jonathan M. Thompson
2015	—	`ch.`	Graph Coloring and Recombination. Handbook of Computational Intelligence Rhyd Lewis
2014	B	`conf`	An Improved Multi-objective Algorithm for the Urban Transit Routing Problem. EvoCOP Matthew P. John, Christine L. Mumford, Rhyd Lewis
2014	J	`jnl`	Towards objective measures of algorithm performance across instance space. Comput. Oper. Res. Kate Smith-Miles, Davaatseren Baatar, Brendan Wreford, Rhyd Lewis
2012	J	`jnl`	A time-dependent metaheuristic algorithm for post enrolment-based course timetabling. Ann. Oper. Res. Rhyd Lewis
2012	J	`jnl`	A wide-ranging computational comparison of high-performance graph colouring algorithms. Comput. Oper. Res. Rhyd Lewis, Jonathan M. Thompson, Christine L. Mumford, J. Gillard
2012	J	`jnl`	An incomplete m-exchange algorithm for solving the large-scale multi-scenario knapsack problem. Comput. Oper. Res. Xiang Song, Rhyd Lewis, Jonathan M. Thompson, Yue Wu
2012	B	`conf`	Combining Heuristic and Exact Methods to Solve the Vehicle Routing Problem with Pickups, Deliveries and Time Windows. EvoCOP Penny L. Holborn, Jonathan M. Thompson, Rhyd Lewis
2011	J	`jnl`	An investigation into two bin packing problems with ordering and orientation implications. Eur. J. Oper. Res. Rhyd Lewis, Xiang Song, Kathryn A. Dowsland, Jonathan M. Thompson
2011	J	`jnl`	On the application of graph colouring techniques in round-robin sports scheduling. Comput. Oper. Res. Rhyd Lewis, Jonathan M. Thompson
2011	J	`jnl`	Revisiting the Restricted Growth Function Genetic Algorithm for Grouping Problems. Evol. Comput. Rhyd Lewis, E. Pullin
2010	J	`jnl`	A worst case analysis of a dynamic programming-based heuristic algorithm for 2D unconstrained guillotine cutting. Eur. J. Oper. Res. Xiang Song, C. B. Chu, Rhyd Lewis, Y. Y. Nie, Jonathan M. Thompson
2009	J	`jnl`	A general-purpose hill-climbing method for order independent minimum grouping problems: A case study in graph colouring and bin packing. Comput. Oper. Res. Rhyd Lewis
2007	J	`jnl`	Metaheuristics can solve sudoku puzzles. J. Heuristics Rhyd Lewis