default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDJeffrey H. Kingston
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2021
[j17]Jeffrey H. Kingston
:
Modelling history in nurse rostering. Ann. Oper. Res. 302(2): 391-404 (2021)
2010 – 2019
- 2016
- [j16]Gerhard Post, Luca Di Gaspero, Jeffrey H. Kingston, Barry McCollum, Andrea Schaerf:
The Third International Timetabling Competition. Ann. Oper. Res. 239(1): 69-75 (2016) - [j15]Jeffrey H. Kingston:
Repairing high school timetables with polymorphic ejection chains. Ann. Oper. Res. 239(1): 119-134 (2016) - 2014
- [j14]Jeffrey H. Kingston:
Timetable construction: the algorithms and complexity perspective. Ann. Oper. Res. 218(1): 249-259 (2014) - [j13]Gerhard Post, Jeffrey H. Kingston, Samad Ahmadi, Sophia Daskalaki, Christos Gogos, Jari Kyngäs, Cimmo Nurmi, Nysret Musliu, Nelishia Pillay, Haroldo G. Santos, Andrea Schaerf:
XHSTT: an XML archive for high school timetabling problems in different countries. Ann. Oper. Res. 218(1): 295-301 (2014) - 2013
- [p2]Jeffrey H. Kingston:
Educational Timetabling. Automated Scheduling and Planning 2013: 91-108 - 2012
- [j12]Jeffrey H. Kingston:
Resource assignment in high school timetabling. Ann. Oper. Res. 194(1): 241-254 (2012) - [j11]Gerhard Post, Samad Ahmadi, Sophia Daskalaki, Jeffrey H. Kingston, Jari Kyngäs, Cimmo Nurmi, David Ranson:
An XML format for benchmarks in High School Timetabling. Ann. Oper. Res. 194(1): 385-397 (2012)
2000 – 2009
- 2006
- [c13]Jeffrey H. Kingston:
Hierarchical Timetable Construction. PATAT 2006: 294-307 - [c12]Jeffrey H. Kingston:
The KTS High School Timetabling System. PATAT 2006: 308-323 - 2004
- [c11]Jeffrey H. Kingston:
A Tiling Algorithm for High School Timetabling. PATAT 2004: 208-225 - 2003
- [j10]Jeffrey H. Kingston, Nicholas Paul Sheppard:
On reductions for the Steiner Problem in Graphs. J. Discrete Algorithms 1(1): 77-88 (2003) - [p1]Zsolt Tuza, Gregory Z. Gutin, Michael Plurnmer, Alan Tucker, Edmund Kieran Burke, Dominique de Werra, Jeffrey H. Kingston:
Colorings and Related Topics. Handbook of Graph Theory 2003: 340-483 - 2002
- [c10]David J. Abraham, Jeffrey H. Kingston:
Generalizing Bipartite Edge Colouring to Solve Real Instances of the Timetabling Problem. PATAT 2002: 288-298 - 2001
- [j9]Jeffrey H. Kingston, Nicholas Paul Sheppard:
On the hardness of computing maximum self-reduction sequences. Discret. Math. 226(1-3): 243-253 (2001) - 2000
- [j8]Judy Kay, Michael Barg, Alan D. Fekete, Tony Greening, Owen Hollands, Jeffrey H. Kingston, Kate Crawford:
Problem-Based Learning for Foundation Computer Science Courses. Comput. Sci. Educ. 10(2): 109-128 (2000) - [c9]Jeffrey H. Kingston:
Modelling Timetabling Problems with STTL. PATAT 2000: 309-321 - [c8]Jeffrey H. Kingston, Benjamin Yin-Sun Lynn:
A Software Architecture for Timetable Construction. PATAT 2000: 342-352 - [c7]Alan D. Fekete, Judy Kay, Jeffrey H. Kingston, Kapila Wimalaratne:
Supporting reflection in introductory computer science. SIGCSE 2000: 144-148
1990 – 1999
- 1998
- [c6]Alan D. Fekete, Tony Greening, Jeffrey H. Kingston:
Conveying technical content in a curriculum using problem based learning. ACSE 1998: 198-202 - 1997
- [j7]Edmund K. Burke, Kirk Jackson, Jeffrey H. Kingston, Rupert F. Weare:
Automated University Timetabling: The State of the Art. Comput. J. 40(9): 565-571 (1997) - [c5]Tony Greening, Judy Kay, Jeffrey H. Kingston, Kathryn Crawford:
Results of a PBL trial in first-year computer science. ACSE 1997: 201-206 - [c4]Edmund K. Burke, Jeffrey H. Kingston, Paul A. Pepper:
A Standard Data Format for Timetabling Instances. PATAT 1997: 213-222 - 1996
- [c3]Tony Greening, Judy Kay, Jeffrey H. Kingston, Kathryn Crawford:
Problem-based learning of first year computer science. ACSE 1996: 13-18 - 1995
- [c2]Tim B. Cooper, Jeffrey H. Kingston:
The Complexity of Timetable Construction Problems. PATAT 1995: 283-295 - 1994
- [c1]Diab Abuaiadh, Jeffrey H. Kingston:
Are Fibonacci Heaps Optimal? ISAAC 1994: 442-450 - 1993
- [j6]Tim B. Cooper, Jeffrey H. Kingston:
The Solution of Real Instances of the Timetabling Problem. Comput. J. 36(7): 645-653 (1993) - [j5]Jeffrey H. Kingston:
The Disign and Implementation of the Lout Document Formatting Language. Softw. Pract. Exp. 23(9): 1001-1041 (1993) - 1990
- [b1]Jeffrey H. Kingston:
Algorithms and data structures - design, correctness, analysis. International computer science series, Addison-Wesley 1990, ISBN 978-0-201-41705-0, pp. I-IX, 1-315
1980 – 1989
- 1988
- [j4]Jeffrey H. Kingston:
A New Proof of the Garsia-Wachs Algorithm. J. Algorithms 9(1): 129-136 (1988) - 1986
- [j3]Jeffrey H. Kingston:
The Amortized Complexity of Henriksen's Algorithm. BIT 26(2): 156-163 (1986) - [j2]Jeffrey H. Kingston:
Analysis of Henriksen's Algorithm for the Simulation Event Set. SIAM J. Comput. 15(3): 887-902 (1986) - 1985
- [j1]Jeffrey H. Kingston:
Analysis of Tree Algorithms for the Simulation Event List. Acta Informatica 22(1): 15-33 (1985)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-24 22:46 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
