
| 2007 | ||
|---|---|---|
| 153 | Juraj Hromkovic, Richard Královic, Marc Nunkesser, Peter Widmayer: Stochastic Algorithms: Foundations and Applications, 4th International Symposium, SAGA 2007, Zurich, Switzerland, September 13-14, 2007, Proceedings Springer 2007 | |
| 152 | Subhash Suri, Elias Vicari, Peter Widmayer: Simple Robots with Minimal Sensing: From Local Visibility to Global Geometry. AAAI 2007: 1114-1120 | |
| 151 | EE | Beat Gfeller, Nicola Santoro, Peter Widmayer: A Distributed Algorithm for Finding All Best Swap Edges of a Minimum Diameter Spanning Tree. DISC 2007: 268-282 |
| 150 | EE | Davide Bilò, Jörg Derungs, Luciano Gualà, Guido Proietti, Peter Widmayer: Locating Facilities on a Network to Minimize Their Average Service Radius. ISAAC 2007: 587-598 |
| 149 | EE | Michael Gatto, Peter Widmayer: On the Robustness of Graham's Algorithm for Online Scheduling. WADS 2007: 349-361 |
| 148 | EE | Jörg Derungs, Riko Jacob, Peter Widmayer: Approximate Shortest Paths Guided by a Small Index. WADS 2007: 553-564 |
| 147 | EE | Juraj Hromkovic, Tobias Mömke, Kathleen Steinhöfel, Peter Widmayer: Job Shop Scheduling with Unit Length Tasks: Bounds and Algorithms. Algorithmic Operations Research 2(1): (2007) |
| 146 | EE | Thomas Erlebach, Riko Jacob, Matús Mihalák, Marc Nunkesser, Gábor Szabó, Peter Widmayer: An Algorithmic View on OVSF Code Assignment. Algorithmica 47(3): 269-298 (2007) |
| 145 | EE | Nicola Santoro, Peter Widmayer: Agreement in synchronous networks with ubiquitous faults. Theor. Comput. Sci. 384(2-3): 232-249 (2007) |
| 2006 | ||
| 144 | EE | Guido Proietti, Peter Widmayer: Partitioning the Nodes of a Graph to Minimize the Sum of Subgraph Radii. ISAAC 2006: 578-587 |
| 143 | EE | Beat Gfeller, Leon Peeters, Birgitta Weber, Peter Widmayer: Online Single Machine Batch Scheduling. MFCS 2006: 424-435 |
| 142 | EE | Paolo Penna, Guido Proietti, Peter Widmayer: Strongly Polynomial-Time Truthful Mechanisms in One Shot. WINE 2006: 377-388 |
| 2005 | ||
| 141 | EE | Nicola Santoro, Peter Widmayer: Majority and Unanimity in Synchronous Networks with Ubiquitous Dynamic Faults. SIROCCO 2005: 262-276 |
| 140 | EE | Mirjam Wattenhofer, Roger Wattenhofer, Peter Widmayer: Geometric Routing Without Geometry. SIROCCO 2005: 307-322 |
| 139 | EE | Guido Proietti, Peter Widmayer: A truthful mechanism for the non-utilitarian minimum radius spanning tree problem. SPAA 2005: 195-202 |
| 138 | EE | Paola Flocchini, Giuseppe Prencipe, Nicola Santoro, Peter Widmayer: Gathering of asynchronous robots with limited visibility. Theor. Comput. Sci. 337(1-3): 147-168 (2005) |
| 2004 | ||
| 137 | Giovanna Melideo, Paolo Penna, Guido Proietti, Roger Wattenhofer, Peter Widmayer: Truthful Mechanisms for Generalized Utilitarian Problems. IFIP TCS 2004: 167-180 | |
| 136 | Mark Cieliebak, Thomas Erlebach, Fabian Hennecke, Birgitta Weber, Peter Widmayer: Scheduling with Release Times and Deadlines on a Minimum Number of Machines. IFIP TCS 2004: 209-222 | |
| 135 | EE | Bernd Fischer, Volker Roth, Joachim M. Buhmann, Jonas Grossmann, Sacha Baginsky, Wilhelm Gruissem, Franz Roos, Peter Widmayer: A Hidden Markov Model for de Novo Peptide Sequencing. NIPS 2004 |
| 134 | EE | Paola Flocchini, Linda Pagli, Giuseppe Prencipe, Nicola Santoro, Peter Widmayer, Tranos Zuva: Computing All the Best Swap Edges Distributively. OPODIS 2004: 154-168 |
| 133 | EE | Thomas Erlebach, Riko Jacob, Matús Mihalák, Marc Nunkesser, Gábor Szabó, Peter Widmayer: An Algorithmic View on OVSF Code Assignment. STACS 2004: 270-281 |
| 132 | EE | Michael Gatto, Björn Glaus, Riko Jacob, Leon Peeters, Peter Widmayer: Railway Delay Management: Exploring Its Algorithmic Complexity. SWAT 2004: 199-211 |
| 131 | EE | Thomas Erlebach, Riko Jacob, Matús Mihalák, Marc Nunkesser, Gábor Szabó, Peter Widmayer: Joint Base Station Scheduling. WAOA 2004: 225-238 |
| 130 | EE | Enrico Nardelli, Guido Proietti, Peter Widmayer: Nearly Linear Time Minimum Spanning Tree Maintenance for Transient Node Failures. Algorithmica 40(2): 119-132 (2004) |
| 129 | Michael Gatto, Riko Jacob, Leon Peeters, Birgitta Weber, Peter Widmayer: Theory on the Tracks: A Selection of Railway Optimization Problems (Column: Algorithmics). Bulletin of the EATCS 84: 41-70 (2004) | |
| 128 | EE | Roger Wattenhofer, Peter Widmayer: The counting pyramid: an adaptive distributed counting scheme. J. Parallel Distrib. Comput. 64(4): 449-460 (2004) |
| 127 | EE | Stephan Eidenbenz, Matthew Hennessy, Rafael Morales Bueno, Francisco Triguero Ruiz, Peter Widmayer, Ricardo Conejo: Preface. Theor. Comput. Sci. 312(1): 1-2 (2004) |
| 2003 | ||
| 126 | EE | Gustavo Alonso, Evangelos Kranakis, Cindy Sawchuk, Roger Wattenhofer, Peter Widmayer: Probabilistic Protocols for Node Discovery in Ad Hoc Multi-channel Broadcast Networks. ADHOC-NOW 2003: 104-115 |
| 125 | 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 | |
| 124 | EE | Evangelos Kranakis, Paolo Penna, Konrad Schlude, David Scot Taylor, Peter Widmayer: Improving Customer Proximity to Railway Stations. CIAC 2003: 264-276 |
| 123 | EE | Eljas Soisalon-Soininen, Peter Widmayer: Single and Bulk Updates in Stratified Trees: An Amortized and Worst-Case Analysis. Computer Science in Perspective 2003: 278-292 |
| 122 | EE | Gustavo Alonso, Evangelos Kranakis, Roger Wattenhofer, Peter Widmayer: Probabilistic Protocols for Node Discovery in Ad-Hoc, Single Broadcast Channel Networks. IPDPS 2003: 218 |
| 121 | EE | Stephan Eidenbenz, Aris Pagourtzis, Peter Widmayer: Flexible Train Rostering. ISAAC 2003: 615-624 |
| 120 | EE | Jens-Peter Dittrich, Bernhard Seeger, David Scot Taylor, Peter Widmayer: On producing join results early. PODS 2003: 134-142 |
| 119 | EE | Enrico Nardelli, Guido Proietti, Peter Widmayer: Swapping a Failing Edge of a Single Source Shortest Paths Tree Is Good and Fast. Algorithmica 35(1): 56-74 (2003) |
| 118 | Nicole Weicker, Gábor Szabó, Karsten Weicker, Peter Widmayer: Evolutionary multiobjective optimization for base station transmitter placement with frequency assignment. IEEE Trans. Evolutionary Computation 7(2): 189-203 (2003) | |
| 117 | EE | Stephan Eidenbenz, Peter Widmayer: An Approximation Algorithm for Minimum Convex Cover with Logarithmic Performance Guarantee. SIAM J. Comput. 32(3): 654-670 (2003) |
| 116 | EE | Enrico Nardelli, Guido Proietti, Peter Widmayer: Finding the most vital node of a shortest path. Theor. Comput. Sci. 296(1): 167-177 (2003) |
| 115 | EE | Konrad Schlude, Eljas Soisalon-Soininen, Peter Widmayer: Distributed Search Trees: Fault Tolerance in an Asynchronous Environment. Theory Comput. Syst. 36(6): 611-629 (2003) |
| 2002 | ||
| 114 | Peter Widmayer, Francisco Triguero Ruiz, Rafael Morales Bueno, Matthew Hennessy, Stephan Eidenbenz, Ricardo Conejo: Automata, Languages and Programming, 29th International Colloquium, ICALP 2002, Malaga, Spain, July 8-13, 2002, Proceedings Springer 2002 | |
| 113 | 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 | |
| 112 | Konrad Schlude, Eljas Soisalon-Soininen, Peter Widmayer: Distributed Highly Available Search Trees. SIROCCO 2002: 259-274 | |
| 111 | EE | Eljas Soisalon-Soininen, Peter Widmayer: Amortized Complexity of Bulk Updates in AVL-Trees. SWAT 2002: 439-448 |
| 110 | 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 |
| 109 | EE | Luzi Anderegg, Paolo Penna, Peter Widmayer: Online train disposition: to wait or not to wait? Electr. Notes Theor. Comput. Sci. 66(6): (2002) |
| 2001 | ||
| 108 | EE | Enrico Nardelli, Guido Proietti, Peter Widmayer: Finding the Most Vital Node of a Shortest Path. COCOON 2001: 278-287 |
| 107 | EE | Stephan Eidenbenz, Peter Widmayer: An Approximation Algorithm for MINIMUM CONVEX COVER with Logarithmic Performance Guarantee. ESA 2001: 333-344 |
| 106 | EE | Juraj Hromkovic, Kathleen Steinhöfel, Peter Widmayer: Job Shop Scheduling with Unit Length Tasks: Bounds and Algorithms. ICTCS 2001: 90-106 |
| 105 | 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 |
| 104 | Paola Flocchini, Giuseppe Prencipe, Nicola Santoro, Peter Widmayer: Pattern Formation by Anonymous Robots Without Chirality. SIROCCO 2001: 147-162 | |
| 103 | EE | Paola Flocchini, Giuseppe Prencipe, Nicola Santoro, Peter Widmayer: Gathering of Asynchronous Oblivious Robots with Limited Visibility. STACS 2001: 247-258 |
| 102 | EE | Stephan Eidenbenz, Christoph Stamm, Peter Widmayer: Inapproximability Results for Guarding Polygons and Terrains. Algorithmica 31(1): 79-113 (2001) |
| 101 | EE | Kim S. Larsen, Eljas Soisalon-Soininen, Peter Widmayer: Relaxed Balance Using Standard Rotations. Algorithmica 31(4): 501-512 (2001) |
| 100 | EE | Enrico Nardelli, Guido Proietti, Peter Widmayer: A faster computation of the most vital edge of a shortest path. Inf. Process. Lett. 79(2): 81-85 (2001) |
| 99 | Renato Pajarola, Peter Widmayer: Virtual Geoexploration: Concepts and Design Choices. Int. J. Comput. Geometry Appl. 11(1): 1-14 (2001) | |
| 98 | EE | Enrico Nardelli, Guido Proietti, Peter Widmayer: Finding All the Best Swaps of a Minimum Diameter Spanning Tree Under Transient Edge Failures. J. Graph Algorithms Appl. 5(5): 39-57 (2001) |
| 2000 | ||
| 97 | Enrico Nardelli, Guido Proietti, Peter Widmayer: Maintaining a Minimum Spanning Tree Under Transient Node Failures. ESA 2000: 346-355 | |
| 96 | Martin Schneider, Christoph Stamm, Jürgen Symanzik, Peter Widmayer: Virtual reality and dynamic statistical graphics: A bidirectional link in a heterogeneous, distributed computing environment. PDPTA 2000 | |
| 95 | 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 |
| 94 | EE | Renato Pajarola, Peter Widmayer: An image compression method for spatial search. IEEE Transactions on Image Processing 9(3): 357-365 (2000) |
| 93 | 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 | ||
| 92 | Nicola Santoro, Peter Widmayer: Distributed Data & Structures, Records of the 1st International Meeting (WDAS 1998), Orlando, Florida, USA Carleton Scientific 1999 | |
| 91 | Yuri Breitbart, Sajal K. Das, Nicola Santoro, Peter Widmayer: Distributed Data & Structures 2, Records of the 2nd International Meeting (WDAS 1999), Princeton, USA, May 10-11, 1999 Carleton Scientific 1999 | |
| 90 | Peter Widmayer, Gabriele Neyer, Stephan Eidenbenz: Graph-Theoretic Concepts in Computer Science, 25th International Workshop, WG '99, Ascona, Switzerland, June 17-19, 1999, Proceedings Springer 1999 | |
| 89 | EE | Enrico Nardelli, Guido Proietti, Peter Widmayer: How to Swap a Failing Edge of a Single Source Shortest Paths Tree. COCOON 1999: 144-153 |
| 88 | EE | Jochen Van den Bercken, Bernhard Seeger, Peter Widmayer: The Bulk Index Join: A Generic Approach to Processing Non-Equijoins. ICDE 1999: 257 |
| 87 | EE | Paola Flocchini, Giuseppe Prencipe, Nicola Santoro, Peter Widmayer: Hard Tasks for Weak Robots: The Role of Common Knowledge in Pattern Formation by Autonomous Mobile Robots. ISAAC 1999: 93-102 |
| 86 | EE | Eljas Soisalon-Soininen, Peter Widmayer: Concurrency and Recovery in Full-Text Indexing. SPIRE/CRIWG 1999: 192-198 |
| 85 | Yuri Breitbart, Sajal K. Das, Nicola Santoro, Peter Widmayer: Introduction: Distributed Data & Structures 2. WDAS 1999 | |
| 84 | EE | Edmund Ihler, Gabriele Reich, Peter Widmayer: Class Steiner Trees and VLSI-design. Discrete Applied Mathematics 90(1-3): 173-194 (1999) |
| 83 | EE | Andrew U. Frank, Stéphane Grumbach, Ralf Hartmut Güting, Christian S. Jensen, Manolis Koubarakis, Nikos A. Lorentzos, Yannis Manolopoulos, Enrico Nardelli, Barbara Pernici, Hans-Jörg Schek, Michel Scholl, Timos K. Sellis, Babis Theodoulidis, Peter Widmayer: Chorochronos: A Research Network for Spatiotemporal Database Systems. SIGMOD Record 28(3): 12-21 (1999) |
| 1998 | ||
| 82 | EE | Stephan Eidenbenz, Christoph Stamm, Peter Widmayer: Inapproximability of some art gallery problems. CCCG 1998 |
| 81 | EE | Christoph Stamm, Stephan Eidenbenz, Michael Beck, Peter Stucki, Peter Widmayer: A Prototype System for Light Propagation in Terrains. Computer Graphics International 1998: 103- |
| 80 | EE | Stephan Eidenbenz, Christoph Stamm, Peter Widmayer: Positioning Guards at Fixed Height Above a Terrain - An Optimum Inapproximability Result. ESA 1998: 187-198 |
| 79 | EE | Enrico Nardelli, Guido Proietti, Peter Widmayer: Finding All the Best Swaps of a Minimum Diameter Spanning Tree under Transient Edge Failures. ESA 1998: 55-66 |
| 78 | EE | Renato Pajarola, Thomas Ohler, Peter Stucki, Kornel Szabo, Peter Widmayer: The Alps at Your Fingertips: Virtual Reality and Geoinformation Systems. ICDE 1998: 550-557 |
| 77 | Roger Wattenhofer, Peter Widmayer: The counting pyramid: an adaptive distributed counting scheme. SIROCCO 1998: 145-157 | |
| 76 | Roger Wattenhofer, Peter Widmayer: A Unified Analysis of Distributed Counting with Queueing Theory. WDAS 1998: 84-97 | |
| 75 | Nicola Santoro, Peter Widmayer: Introduction: Distributed Data and Structures 1. WDAS 1998 | |
| 74 | EE | Enrico Nardelli, Guido Proietti, Peter Widmayer: Finding the Detour-Critical Edge of a Shortest Path Between Two Nodes. Inf. Process. Lett. 67(1): 51-54 (1998) |
| 73 | Roger Wattenhofer, Peter Widmayer: An Inherent Bottleneck in Distributed Counting. J. Parallel Distrib. Comput. 49(1): 135-145 (1998) | |
| 1997 | ||
| 72 | Danny Krizanc, Peter Widmayer: SIROCCO'97, 4th International Colloquium on Structural Information & Communication Complexity, Monte Verita, Ascona, Switzerland, July 24-26, 1997 Carleton Scientific 1997 | |
| 71 | Marc J. van Kreveld, Jürg Nievergelt, Thomas Roos, Peter Widmayer: Algorithmic Foundations of Geographic Information Systems, this book originated from the CISM Advanced School on the Algorithmic Foundations of Geographic Information Systems, Udine, Italy, September 16-20, 1996 Springer 1997 | |
| 70 | Eljas Soisalon-Soininen, Peter Widmayer: Relaxed Balancing in Search Trees. Advances in Algorithms, Languages, and Complexity 1997: 267-283 | |
| 69 | Gabriele Neyer, Peter Widmayer: Singularities Make Spatial Join Scheduling Hard. ISAAC 1997: 293-302 | |
| 68 | Roger Wattenhofer, Peter Widmayer: An Inherent Bottleneck in Distributed Counting. PODC 1997: 159-167 | |
| 67 | EE | Jochen Van den Bercken, Bernhard Seeger, Peter Widmayer: A Generic Approach to Bulk Loading Multidimensional Index Structures. VLDB 1997: 406-415 |
| 66 | Kim S. Larsen, Eljas Soisalon-Soininen, Peter Widmayer: Relaxed Balance through Standard Rotations. WADS 1997: 450-461 | |
| 65 | EE | Tetsuo Asano, Desh Ranjan, Thomas Roos, Emo Welzl, Peter Widmayer: Space-Filling Curves and Their Use in the Design of Geometric Data Structures. Theor. Comput. Sci. 181(1): 3-15 (1997) |
| 1996 | ||
| 64 | Jürg Nievergelt, Peter Widmayer: Spatial Data Structures: Concepts and Design Choices. Algorithmic Foundations of Geographic Information Systems 1996: 153-197 | |
| 63 | Edouard Bugnion, Thomas Roos, Roger Wattenhofer, Peter Widmayer: Space Filling Curves versus Random Walks. Algorithmic Foundations of Geographic Information Systems 1996: 199-211 | |
| 62 | Renato Pajarola, Peter Widmayer: Spatial Indexing into Compressed Raster Images: How to Answer Range Queries Without Decompression. IW-MMDBMS 1996: 94-100 | |
| 61 | Bruno Becker, Paolo Giulio Franciosa, Stephan Gschwind, Stefano Leonardi, Thomas Ohler, Peter Widmayer: Enclosing a Set of Objects by Two Minimum Area Rectangles. J. Algorithms 21(3): 520-541 (1996) | |
| 60 | EE | Bruno Becker, Stephan Gschwind, Thomas Ohler, Bernhard Seeger, Peter Widmayer: An Asymptotically Optimal Multiversion B-Tree. VLDB J. 5(4): 264-275 (1996) |
| 1995 | ||
| 59 | Viet Hai Nguyen, Peter Widmayer: Binary Space Partitions for Sets of Hyperrectangles. ASIAN 1995: 59-72 | |
| 58 | Tetsuo Asano, Desh Ranjan, Thomas Roos, Emo Welzl, Peter Widmayer: Space Filling Curves and Their Use in the Design of Geometric Data Structures. LATIN 1995: 36-48 | |
| 57 | Brigitte Kröll, Peter Widmayer: Balanced Distributed Search Trees Do Not Exist. WADS 1995: 50-61 | |
| 56 | EE | Fabrizio d'Amore, Viet Hai Nguyen, Thomas Roos, Peter Widmayer: On Optimal Cuts of Hyperrectangles. Computing 55(3): 191-206 (1995) |
| 1994 | ||
| 55 | Jürg Nievergelt, Thomas Roos, Hans-Jörg Schek, Peter Widmayer: IGIS '94: Geographic Information Systems, International Workshop on Advanced Information Systems, Monte Verita, Ascona, Switzerland, February 28 - March 4, 1994, Proceedings Springer 1994 | |
| 54 | Thomas Roos, Fei Shi, Peter Widmayer: A Data Structure for Approximate String Searching. HICSS (5) 1994: 45-46 | |
| 53 | Viet Hai Nguyen, Thomas Ohler, Peter Widmayer: VisTool: A Visualization Tool for Spatial Access Structures. IGIS 1994: 274-287 | |
| 52 | EE | Brigitte Kröll, Peter Widmayer: Distributing a Search Tree Among a Growing Number of Processors. SIGMOD Conference 1994: 265-276 |
| 51 | Thomas Roos, Peter Widmayer: k-Violation Linear Programming. Inf. Process. Lett. 52(2): 109-114 (1994) | |
| 1993 | ||
| 50 | Thomas Ottmann, Peter Widmayer: Algorithmen und Datenstrukturen, 2. Auflage Bibliographisches Institut 1993 | |
| 49 | Viet Hai Nguyen, Thomas Roos, Peter Widmayer: Balanced Cuts of a Set of Hyperrectangles. CCCG 1993: 121-126 | |
| 48 | Thomas Ohler, Peter Widmayer: A Brief Tutorial Introduction to Data Structures for Geometric Databases. CISM - Advances in Database Systems 1993: 329-351 | |
| 47 | Thomas Ohler, Peter Widmayer: Data Structures and Algorithms for Geographic Information Systems: Selected Topics. CISM - Advances in Database Systems 1993: 353-364 | |
| 46 | Thomas Ohler, Peter Widmayer: Geographic Information Systems: An Example. CISM - Advances in Database Systems 1993: 365-377 | |
| 45 | Fabrizio d'Amore, Thomas Roos, Peter Widmayer: An Optimal Algorithm for Computing a Best Cut of a Set of Hyperrectangles. ICCG 1993: 215-224 | |
| 44 | EE | Bernd-Uwe Pagel, Hans-Werner Six, Heinrich Toben, Peter Widmayer: Towards an Analysis of Range Query Performance in Spatial Data Structures. PODS 1993: 214-221 |
| 43 | EE | Bruno Becker, Stephan Gschwind, Thomas Ohler, Bernhard Seeger, Peter Widmayer: On Optimal Multiversion Access Structures. SSD 1993: 123-141 |
| 42 | Jürg Nievergelt, Peter Widmayer: Guard Files: Stabbing and Intersection Queries on Fat Spatial Objects. Comput. J. 36(2): 107-116 (1993) | |
| 1992 | ||
| 41 | Hans-Werner Six, Peter Widmayer: Spatial Access Structures for Geometric Databases. Data Structures and Efficient Algorithms 1992: 214-232 | |
| 40 | Bruno Becker, Paolo Giulio Franciosa, Stephan Gschwind, Thomas Ohler, Gerald Thiemt, Peter Widmayer: Enclosing Many Boxes by an Optimal Pair of Boxes. STACS 1992: 475-486 | |
| 1991 | ||
| 39 | Andreas Henrich, Andreas Hilbert, Hans-Werner Six, Peter Widmayer: Anbindung einer rämlich clusternden Zugriffstruktur für geometrische Attribute an ein Standard-Datenbanksystem am Beispiel von Oracle. BTW 1991: 161-177 | |
| 38 | EE | Bruno Becker, Hans-Werner Six, Peter Widmayer: Spatial Priority Search: An Access Technique for Scaleless Maps. SIGMOD Conference 1991: 128-137 |
| 37 | Edmund Ihler, Gabriele Reich, Peter Widmayer: On Shortest Networks for Classes of Points in the Plane. Workshop on Computational Geometry 1991: 103-111 | |
| 36 | Bruno Becker, Paolo Giulio Franciosa, Stephan Gschwind, Thomas Ohler, Gerald Thiemt, Peter Widmayer: An Optimal Algorithm for Approximating a Set of Rectangles by Two Minimum Area Rectangles. Workshop on Computational Geometry 1991: 13-25 | |
| 35 | Peter Widmayer: Datenstrukturen für Geodatenbanken. Entwicklungstendenzen bei Datenbanksystemen 1991: 317-361 | |
| 1990 | ||
| 34 | Thomas Ottmann, Peter Widmayer: Algorithmen und Datenstrukturen Bibliographisches Institut 1990 | |
| 33 | Bruno Becker, Hans-Werner Six, Peter Widmayer: Maßstabsunabhängige Verwaltung von Landschaftsdaten. GI Jahrestagung (2) 1990: 487-496 | |
| 32 | Peter Widmayer, Bruno Becker: Ein Vorschlag zur maßstabsunabhängigen Verwaltung von Landschaftsdaten. Grundlagen von Datenbanken 1990: 95-96 | |
| 31 | EE | Andreas Hutflesz, Hans-Werner Six, Peter Widmayer: The R-File: An Efficient Access Structure for Proximity Queries. ICDE 1990: 372-379 |
| 30 | Nicola Santoro, Peter Widmayer: Distributed Function Evaluation in the Presence of Transmission Faults. SIGAL International Symposium on Algorithms 1990: 358-367 | |
| 29 | Georg Lausen, Eljas Soisalon-Soininen, Peter Widmayer: On the Power of Safe Locking. J. Comput. Syst. Sci. 40(2): 269-288 (1990) | |
| 1989 | ||
| 28 | Peter Widmayer: Räumliche Suche in geometrischen Datenbanken. Grundlagen von Datenbanken 1989 | |
| 27 | Nicola Santoro, Peter Widmayer: Time is Not a Healer. STACS 1989: 304-313 | |
| 26 | EE | Andreas Henrich, Hans-Werner Six, Peter Widmayer: The LSD tree: Spatial Access to Multidimensional Point and Nonpoint Objects. VLDB 1989: 45-53 |
| 25 | Gabriele Reich, Peter Widmayer: Beyond Steiner's Problem: A VLSI Oriented Generalization. WG 1989: 196-210 | |
| 24 | Andreas Henrich, Hans-Werner Six, Peter Widmayer: Paging Binary Trees with External Balancing. WG 1989: 260-276 | |
| 1988 | ||
| 23 | EE | Andreas Hutflesz, Hans-Werner Six, Peter Widmayer: The Twin Grid File: A Nearly Space Optimal Index Structure. EDBT 1988: 352-363 |
| 22 | EE | Hans-Werner Six, Peter Widmayer: Spatial Searching in Geometric Databases. ICDE 1988: 496-503 |
| 21 | EE | Andreas Hutflesz, Hans-Werner Six, Peter Widmayer: Globally Order Preserving Multidimensional Linear Hashing. ICDE 1988: 572-579 |
| 20 | EE | Andreas Hutflesz, Hans-Werner Six, Peter Widmayer: Twin Grid Files: Space Optimizing Access Schemes. SIGMOD Conference 1988: 183-190 |
| 19 | Andreas Hutflesz, Peter Widmayer, Hans-Werner Six: Twin Grid Files: A Performance Evaluation. Workshop on Computational Geometry 1988: 15-24 | |
| 18 | Gregory J. E. Rawlins, Peter Widmayer, Derick Wood: Hole Problems for Rectangles in the Plane. SIAM J. Discrete Math. 1(1): 86-97 (1988) | |
| 1987 | ||
| 17 | Thomas Rottke, Hans-Werner Six, Peter Widmayer: On the Analysis of Grid Structures for Spatial Objects of Non-Zero Size. WG 1987: 94-105 | |
| 16 | Ying-Fung Wu, Peter Widmayer, Martine D. F. Schlag, C. K. Wong: Rectilinear Shortest Paths and Minimum Spanning Trees in the Presence of Rectilinear Obstacles. IEEE Trans. Computers 36(3): 321-331 (1987) | |
| 15 | Peter Widmayer, Derick Wood: Time- and Space-Optimal Contour Computation for a Set of Rectangles. Inf. Process. Lett. 24(5): 335-338 (1987) | |
| 14 | Peter Widmayer, Ying-Fung Wu, C. K. Wong: On Some Distance Problems in Fixed Orientations. SIAM J. Comput. 16(4): 728-746 (1987) | |
| 1986 | ||
| 13 | Hans-Werner Six, Peter Widmayer: Hintergrundspeicherstrukturen für ausgedehnte Objekte. GI Jahrestagung (1) 1986: 538-552 | |
| 12 | EE | Georg Lausen, Eljas Soisalon-Soininen, Peter Widmayer: Towards Online Schedulers Based on Pre-Analysis Locking. ICDT 1986: 242-259 |
| 11 | Thomas Ottmann, Peter Widmayer: Modellversuch computergestützter Informatikunterricht: Algorithmen und Datenstrukturen. INFOS 1986: 420-431 | |
| 10 | Peter Widmayer: An Approximation Algorithms for Steiner's Problem in Graphs. WG 1986: 17-28 | |
| 9 | Ying-Fung Wu, Peter Widmayer, C. K. Wong: A Faster Approximation Algorithm for the Steiner Problem in Graphs. Acta Inf. 23(2): 223-229 (1986) | |
| 8 | Georg Lausen, Eljas Soisalon-Soininen, Peter Widmayer: Pre-analysis Locking Information and Control 70(2/3): 193-215 (1986) | |
| 1985 | ||
| 7 | EE | Georg Lausen, Eljas Soisalon-Soininen, Peter Widmayer: Pre-Analysis Locking: A Safe and Deadlock Free Locking Policy. VLDB 1985: 270-281 |
| 6 | EE | Thomas Ottmann, Peter Widmayer, Derick Wood: A fast algorithm for the Boolean masking problem. Computer Vision, Graphics, and Image Processing 30(3): 249-268 (1985) |
| 5 | Peter Widmayer, C. K. Wong: An Optimal Algorithm for the Maximum Alignment of Terminals. Inf. Process. Lett. 20(2): 75-82 (1985) | |
| 1984 | ||
| 4 | Thomas Ottmann, Peter Widmayer: Solving Visibility Problems by Using Skeleton Structures. MFCS 1984: 459-470 | |
| 3 | EE | Georg Lausen, Eljas Soisalon-Soininen, Peter Widmayer: Maximal Concurrency by Locking. PODS 1984: 38-44 |
| 2 | Eljas Soisalon-Soininen, Peter Widmayer: On the Complexity of Concurrency Control by Locking in Distributed Database Systems Information and Control 60(1-3): 103-108 (1984) | |
| 1983 | ||
| 1 | EE | Thomas Ottmann, Peter Widmayer: On translating a set of line segments. Computer Vision, Graphics, and Image Processing 24(3): 382-389 (1983) |
Colors in the list of coauthors