Jeffrey H. Kingston

Orcid: 0000-0002-9911-0001

According to our database1, Jeffrey H. Kingston authored at least 33 papers between 1985 and 2021.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of two.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2021
Modelling history in nurse rostering.
Ann. Oper. Res., 2021

2016
The Third International Timetabling Competition.
Ann. Oper. Res., 2016

Repairing high school timetables with polymorphic ejection chains.
Ann. Oper. Res., 2016

2014
XHSTT: an XML archive for high school timetabling problems in different countries.
Ann. Oper. Res., 2014

Timetable construction: the algorithms and complexity perspective.
Ann. Oper. Res., 2014

2013
Educational Timetabling.
Proceedings of the Automated Scheduling and Planning - From Theory to Practice, 2013

2012
An XML format for benchmarks in High School Timetabling.
Ann. Oper. Res., 2012

Resource assignment in high school timetabling.
Ann. Oper. Res., 2012

2006
The KTS High School Timetabling System.
Proceedings of the Practice and Theory of Automated Timetabling VI, 2006

Hierarchical Timetable Construction.
Proceedings of the Practice and Theory of Automated Timetabling VI, 2006

2004
A Tiling Algorithm for High School Timetabling.
Proceedings of the Practice and Theory of Automated Timetabling V, 2004

2003
On reductions for the Steiner Problem in Graphs.
J. Discrete Algorithms, 2003

Colorings and Related Topics.
Proceedings of the Handbook of Graph Theory., 2003

2002
Generalizing Bipartite Edge Colouring to Solve Real Instances of the Timetabling Problem.
Proceedings of the Practice and Theory of Automated Timetabling IV, 2002

2001
On the hardness of computing maximum self-reduction sequences.
Discret. Math., 2001

2000
Problem-Based Learning for Foundation Computer Science Courses.
Comput. Sci. Educ., 2000

Supporting reflection in introductory computer science.
Proceedings of the 31st SIGCSE Technical Symposium on Computer Science Education, 2000

A Software Architecture for Timetable Construction.
Proceedings of the Practice and Theory of Automated Timetabling III, 2000

Modelling Timetabling Problems with STTL.
Proceedings of the Practice and Theory of Automated Timetabling III, 2000

1998
Conveying technical content in a curriculum using problem based learning.
Proceedings of the ACM SIGCSE 3rd Australasian Conference on Computer Science Education, 1998

1997
Automated University Timetabling: The State of the Art.
Comput. J., 1997

A Standard Data Format for Timetabling Instances.
Proceedings of the Practice and Theory of Automated Timetabling II, 1997

Results of a PBL trial in first-year computer science.
Proceedings of the ACM SIGCSE 2nd Australasian Conference on Computer Science Education, 1997

1996
Problem-based learning of first year computer science.
Proceedings of the ACM SIGCSE 1st Australasian Conference on Computer Science Education, 1996

1995
The Complexity of Timetable Construction Problems.
Proceedings of the Practice and Theory of Automated Timetabling, First International Conference, Edinburgh, UK, August 29, 1995

1994
Are Fibonacci Heaps Optimal?
Proceedings of the Algorithms and Computation, 5th International Symposium, 1994

1993
The Disign and Implementation of the Lout Document Formatting Language.
Softw. Pract. Exp., 1993

The Solution of Real Instances of the Timetabling Problem.
Comput. J., 1993

1990
Algorithms and data structures - design, correctness, analysis.
International computer science series, Addison-Wesley, ISBN: 978-0-201-41705-0, 1990

1988
A New Proof of the Garsia-Wachs Algorithm.
J. Algorithms, 1988

1986
Analysis of Henriksen's Algorithm for the Simulation Event Set.
SIAM J. Comput., 1986

The Amortized Complexity of Henriksen's Algorithm.
BIT, 1986

1985
Analysis of Tree Algorithms for the Simulation Event List.
Acta Informatica, 1985


  Loading...