
| 2006 | ||
|---|---|---|
| 13 | EE | David Scot Taylor: Online Distributed Object Migration. WAOA 2006: 330-344 |
| 2004 | ||
| 12 | EE | Elias Koutsoupias, David Scot Taylor: The CNN problem and other k-server variants. Theor. Comput. Sci. 324(2-3): 347-359 (2004) |
| 2003 | ||
| 11 | Luzi Anderegg, Stephan Eidenbenz, Martin Gantenbein, Christoph Stamm, David Scot Taylor, Birgitta Weber, Peter Widmayer: Train Routing Algorithms: Concepts, Design Choises, and Practical Considerations. ALENEX 2003: 106-118 | |
| 10 | EE | Evangelos Kranakis, Paolo Penna, Konrad Schlude, David Scot Taylor, Peter Widmayer: Improving Customer Proximity to Railway Stations. CIAC 2003: 264-276 |
| 9 | EE | Jens-Peter Dittrich, Bernhard Seeger, David Scot Taylor, Peter Widmayer: On producing join results early. PODS 2003: 134-142 |
| 2002 | ||
| 8 | Aris Pagourtzis, Paolo Penna, Konrad Schlude, Kathleen Steinhöfel, David Scot Taylor, Peter Widmayer: Server Placements, Roman Domination and other Dominating Set Variants. IFIP TCS 2002: 280-291 | |
| 7 | EE | Jens-Peter Dittrich, Bernhard Seeger, David Scot Taylor, Peter Widmayer: Progressive Merge Join: A Generic and Non-blocking Sort-based Join Algorithm. VLDB 2002: 299-310 |
| 2001 | ||
| 6 | EE | Thomas Erlebach, Martin Gantenbein, Daniel Hürlimann, Gabriele Neyer, Aris Pagourtzis, Paolo Penna, Konrad Schlude, Kathleen Steinhöfel, David Scot Taylor, Peter Widmayer: On the Complexity of Train Assignment Problems. ISAAC 2001: 390-402 |
| 2000 | ||
| 5 | EE | Elias Koutsoupias, David Scot Taylor: The CNN Problem and Other k-Server Variants. STACS 2000: 581-592 |
| 4 | EE | Srinivas Doddi, Madhav V. Marathe, S. S. Ravi, David Scot Taylor, Peter Widmayer: Approximation Algorithms for Clustering to Minimize the Sum of Diameters. SWAT 2000: 237-250 |
| 3 | Srinivas Doddi, Madhav V. Marathe, S. S. Ravi, David Scot Taylor, Peter Widmayer: Approximation Algorithms for Clustering to Minimize the Sum of Diameters. Nord. J. Comput. 7(3): 185-203 (2000) | |
| 1999 | ||
| 2 | EE | Elias Koutsoupias, David Scot Taylor: Indexing Schemes for Random Points. SODA 1999: 596-602 |
| 1998 | ||
| 1 | EE | Elias Koutsoupias, David Scot Taylor: Tight Bounds for 2-Dimensional Indexing Schemes. PODS 1998: 52-58 |
| 1 | Luzi Anderegg | [11] |
| 2 | Jens-Peter Dittrich | [7] [9] |
| 3 | Srinivas Doddi | [3] [4] |
| 4 | Stephan Eidenbenz | [11] |
| 5 | Thomas Erlebach | [6] |
| 6 | Martin Gantenbein | [6] [11] |
| 7 | Daniel Hürlimann | [6] |
| 8 | Elias Koutsoupias | [1] [2] [5] [12] |
| 9 | Evangelos Kranakis | [10] |
| 10 | Madhav V. Marathe | [3] [4] |
| 11 | Gabriele Neyer | [6] |
| 12 | Aris Pagourtzis | [6] [8] |
| 13 | Paolo Penna | [6] [8] [10] |
| 14 | S. S. Ravi | [3] [4] |
| 15 | Konrad Schlude | [6] [8] [10] |
| 16 | Bernhard Seeger | [7] [9] |
| 17 | Christoph Stamm | [11] |
| 18 | Kathleen Steinhöfel | [6] [8] |
| 19 | Birgitta Weber | [11] |
| 20 | Peter Widmayer | [3] [4] [6] [7] [8] [9] [10] [11] |
Colors in the list of coauthors