The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Peter Widmayer: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

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

  142. Optimal Placement of Ad-Hoc Devices Under a VCG-Style Routing Protocol. [Citation Graph (, )][DBLP]


  143. Counting Targets with Mobile Sensors in an Unknown Environment. [Citation Graph (, )][DBLP]


  144. Simple Robots in Polygonal Environments: A Hierarchy. [Citation Graph (, )][DBLP]


  145. How Simple Robots Benefit from Looking Back. [Citation Graph (, )][DBLP]


  146. Optimal Transitions for Targeted Protein Quantification: Best Conditioned Submatrix Selection. [Citation Graph (, )][DBLP]


  147. Distance problems in computational geometry with fixed orientations. [Citation Graph (, )][DBLP]


  148. 07151 Abstracts Collection -- Geometry in Sensor Networks. [Citation Graph (, )][DBLP]


  149. Reusing Optimal TSP Solutions for Locally Modified Input Instances. [Citation Graph (, )][DBLP]


  150. Computing Best Swaps in Optimal Tree Spanners. [Citation Graph (, )][DBLP]


  151. Locating Facilities on a Network to Minimize Their Average Service Radius. [Citation Graph (, )][DBLP]


  152. How to Guard a Graph?. [Citation Graph (, )][DBLP]


  153. How to Sort a Train. [Citation Graph (, )][DBLP]


  154. Rendezvous of Mobile Agents When Tokens Fail Anytime. [Citation Graph (, )][DBLP]


  155. Discovery of Network Properties with All-Shortest-Paths Queries. [Citation Graph (, )][DBLP]


  156. Stability of Networks in Stretchable Graphs. [Citation Graph (, )][DBLP]


  157. Reconstructing Visibility Graphs with Simple Robots. [Citation Graph (, )][DBLP]


  158. On the Hardness of Reoptimization. [Citation Graph (, )][DBLP]


  159. Reoptimization of Steiner Trees. [Citation Graph (, )][DBLP]


  160. Angle Optimization in Target Tracking. [Citation Graph (, )][DBLP]


  161. Reconstructing a Simple Polygon from Its Angles. [Citation Graph (, )][DBLP]


  162. Reoptimization of Weighted Graph and Covering Problems. [Citation Graph (, )][DBLP]


  163. Rendezvous of Mobile Agents in Directed Graphs. [Citation Graph (, )][DBLP]


  164. Computational Aspects of a 2-Player Stackelberg Shortest Paths Tree Game. [Citation Graph (, )][DBLP]


  165. Pseudonyms in Cost-Sharing Games. [Citation Graph (, )][DBLP]


  166. ATMOS 2008 Abstracts Collection - 8th Workshop on Algorithmic Approaches for Transportation Modeling, Optimization, and Systems. [Citation Graph (, )][DBLP]


  167. ATMOS 2008 Preface -- 8th Workshop on Algorithmic Approaches for Transportation Modeling, Optimization, and Systems. [Citation Graph (, )][DBLP]


  168. Online Delay Management on a Single Train Line. [Citation Graph (, )][DBLP]


  169. PepSplice: cache-efficient search algorithms for comprehensive identification of tandem mass spectra. [Citation Graph (, )][DBLP]


Search in 0.015secs, Finished in 0.024secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002