| Modelling History In Nurse Rostering | 0 | 0.34 | 2021 |
| The Third International Timetabling Competition | 9 | 0.56 | 2016 |
| Repairing high school timetables with polymorphic ejection chains | 4 | 0.49 | 2016 |
| XHSTT: an XML archive for high school timetabling problems in different countries. | 16 | 0.98 | 2014 |
| Resource assignment in high school timetabling. | 7 | 0.78 | 2012 |
| An XML format for benchmarks in High School Timetabling. | 37 | 1.95 | 2012 |
| Hierarchical Timetable Construction | 6 | 0.61 | 2006 |
| The KTS high school timetabling system | 10 | 0.71 | 2006 |
| A tiling algorithm for high school timetabling | 23 | 1.21 | 2004 |
| On reductions for the Steiner problem in graphs | 1 | 0.40 | 2003 |
| Generalizing Bipartite Edge Colouring to Solve Real Instances of the Timetabling Problem | 0 | 0.34 | 2002 |
| On the hardness of computing maximum self-reduction sequences | 0 | 0.34 | 2001 |
| Problem-Based Learning for Foundation Computer Science Courses | 9 | 1.97 | 2000 |
| A Software Architecture for Timetable Construction | 5 | 0.58 | 2000 |
| A Standard Data Format for Timetabling Instances | 11 | 0.91 | 1997 |
| Results of a PBL trial in first-year computer science | 6 | 1.61 | 1997 |
| Automated University Timetabling: The State of the Art | 61 | 3.08 | 1997 |
| Problem-based learning of first year computer science | 8 | 2.73 | 1996 |
| The Complexity of Timetable Construction Problems | 64 | 4.30 | 1995 |
| Are Fibonacci Heaps Optimal? | 5 | 0.59 | 1994 |
| The design and implementation of the lout document formatting language | 6 | 3.06 | 1993 |
| The Solution Of Real Instances Of The Timetabling Problem | 19 | 3.58 | 1993 |
| A new proof of the Garsia-Wachs algorithm | 7 | 0.69 | 1988 |
| The amortized complexity of Henriksen's algorithm | 2 | 1.62 | 1986 |
| Analysis of Henriksen's algorithm for the simulation event set | 7 | 0.81 | 1986 |
| Analysis of tree algorithms for the simulation event list | 13 | 4.55 | 1985 |
