Tight Bounds for 2-Dimensional Indexing Schemes. - Elias Koutsoupias; David Scot Taylor (PODS, 1998)

Indexing Schemes for Random Points. - Elias Koutsoupias; David Scot Taylor (SODA, 1999)

Approximation Algorithms for Clustering to Minimize the Sum of Diameters. - Srinivas Doddi; Madhav V. Marathe; S. S. Ravi; David Scot Taylor; Peter Widmayer (Nord. J. Comput., 2000)

On the Complexity of Train Assignment Problems. - Thomas Erlebach; Martin Gantenbein; Daniel Hürlimann; Gabriele Neyer; Aris Pagourtzis; Paolo Penna; Konrad Schlude; Kathleen Steinhöfel; David Scot Taylor; Peter Widmayer (ISAAC, 2001)

Server Placements, Roman Domination and other Dominating Set Variants. - Aris Pagourtzis; Paolo Penna; Konrad Schlude; Kathleen Steinhöfel; David Scot Taylor; Peter Widmayer (IFIP TCS, 2002)

Progressive Merge Join: A Generic and Non-blocking Sort-based Join Algorithm. - Jens-Peter Dittrich; Bernhard Seeger; David Scot Taylor; Peter Widmayer (VLDB, 2002)

Train Routing Algorithms: Concepts, Design Choises, and Practical Considerations. - Luzi Anderegg; Stephan J. Eidenbenz; Martin Gantenbein; Christoph Stamm; David Scot Taylor; Birgitta Weber; Peter Widmayer (ALENEX, 2003)

Improving Customer Proximity to Railway Stations. - Evangelos Kranakis; Paolo Penna; Konrad Schlude; David Scot Taylor; Peter Widmayer (CIAC, 2003)

On producing join results early. - Jens-Peter Dittrich; Bernhard Seeger; David Scot Taylor; Peter Widmayer (PODS, 2003)

The CNN problem and other k-server variants. - Elias Koutsoupias; David Scot Taylor (Theor. Comput. Sci., 2004)

Online Distributed Object Migration. - David Scot Taylor (WAOA, 2006)

Predictive vs. passive animation learning tools. - David Scot Taylor; Andrei F. Lurie; Cay S. Horstmann; Menko B. Johnson; Sean K. Sharma; Edward C. Yin (SIGCSE, 2009)