Please note: This is a beta version of the new dblp website.
You can find the classic dblp view of this page here.
You can find the classic dblp view of this page here.
Peter Widmayer
2010 – today
- 2013
[j64]Jérémie Chalopin, Shantanu Das, Yann Disser, Matús Mihalák, Peter Widmayer: Mapping Simple Polygons: How Robots Benefit from Looking Back. Algorithmica 65(1): 43-59 (2013)- [j63]Andreas Emil Feldmann, Shantanu Das, Peter Widmayer: Corner cuts are close to optimal: From solid grids to polygons and back. Discrete Applied Mathematics 161(7-8): 970-998 (2013)
- [j62]Jérémie Chalopin, Shantanu Das, Yann Disser, Matús Mihalák, Peter Widmayer: Simple agents learn to find their way: An introduction on mapping polygons. Discrete Applied Mathematics 161(10-11): 1287-1307 (2013)
- [j61]Peer Kröger, Egemen Tanin, Peter Widmayer: Highlights from ACM SIGSPATIAL GIS 2012 the 20th ACM SIGSPATIAL International Conference on Advances in Geographic Information Systems (Redondo Beach, California, November 6-9, 2012). SIGSPATIAL Special 5(1): 2-4 (2013)
- [c143]Katerina Böhmová, Matús Mihalák, Tobias Pröger, Rastislav Srámek, Peter Widmayer: Robust Routing in Urban Public Transportation: How to Find Reliable Journeys Based on Past Observations. ATMOS 2013: 27-41
- [c142]Peter Widmayer: To Be Uncertain Is Uncomfortable, But to Be Certain Is Ridiculous. ICALP (2) 2013: 36
- [c141]Joachim M. Buhmann, Matús Mihalák, Rastislav Srámek, Peter Widmayer: Robust optimization in the presence of uncertainty. ITCS 2013: 505-514
- [c140]Katerina Böhmová, Yann Disser, Matús Mihalák, Peter Widmayer: Interval Selection with Machine-Dependent Intervals. WADS 2013: 170-181
- 2012
- [b4]Thomas Ottmann, Peter Widmayer: Algorithmen und Datenstrukturen, 5. Auflage. Spektrum Akademischer Verlag 2012, ISBN 978-3-8274-2803-5, pp. I-XXII, 1-774
- [j60]Davide Bilò, Yann Disser, Matús Mihalák, Subhash Suri, Elias Vicari, Peter Widmayer: Reconstructing visibility graphs with simple robots. Theor. Comput. Sci. 444: 52-59 (2012)
- [c139]Yann Disser, Subir Kumar Ghosh, Matús Mihalák, Peter Widmayer: Mapping a Polygon with Holes Using a Compass. ALGOSENSORS 2012: 78-89
- [c138]Daniar Achakeev, Bernhard Seeger, Peter Widmayer: Sort-based query-adaptive loading of R-trees. CIKM 2012: 2080-2084
- [c137]Yann Disser, Matús Mihalák, Peter Widmayer: Mapping Polygons with Agents That Measure Angles. WAFR 2012: 415-425
- [c136]Peter Widmayer: Combinatorial Optimization with Noisy Inputs: How Can We Separate the Wheat from the Chaff? WALCOM 2012: 1
- [e12]Isabel F. Cruz, Craig A. Knoblock, Peer Kröger, Egemen Tanin, Peter Widmayer (Eds.): SIGSPATIAL 2012 International Conference on Advances in Geographic Information Systems (formerly known as GIS), SIGSPATIAL'12, Redondo Beach, CA, USA, November 7-9, 2012. ACM 2012, ISBN 978-1-4503-1691-0
- [e11]Branislav Rovan, Vladimiro Sassone, Peter Widmayer (Eds.): Mathematical Foundations of Computer Science 2012 - 37th International Symposium, MFCS 2012, Bratislava, Slovakia, August 27-31, 2012. Proceedings. Lecture Notes in Computer Science 7464, Springer 2012, ISBN 978-3-642-32588-5
- [i1]Jérémie Chalopin, Shantanu Das, Yann Disser, Matús Mihalák, Peter Widmayer: Simple Agents Learn to Find Their Way: An Introduction on Mapping Polygons. CoRR abs/1204.3850 (2012)
- 2011
- [j59]Fedor V. Fomin, Petr A. Golovach, Alexander Hall, Matús Mihalák, Elias Vicari, Peter Widmayer: How to Guard a Graph? Algorithmica 61(4): 839-856 (2011)
- [j58]Yann Disser, Matús Mihalák, Peter Widmayer: A polygon is determined by its angles. Comput. Geom. 44(8): 418-426 (2011)
- [j57]Michael Gatto, Peter Widmayer: On robust online scheduling algorithms. J. Scheduling 14(2): 141-156 (2011)
- [j56]Beat Gfeller, Nicola Santoro, Peter Widmayer: A Distributed Algorithm for Finding All Best Swap Edges of a Minimum-Diameter Spanning Tree. IEEE Trans. Dependable Sec. Comput. 8(1): 1-12 (2011)
- [c135]Andreas Emil Feldmann, Peter Widmayer: An $\mathcal{O}(n^4)$ Time Algorithm to Compute the Bisection Width of Solid Grid Graphs. ESA 2011: 143-154
- [c134]Matús Mihalák, Marcel Schöngens, Rastislav Srámek, Peter Widmayer: On the Complexity of the Metric TSP under Stability Considerations. SOFSEM 2011: 382-393
- [c133]Jérémie Chalopin, Shantanu Das, Yann Disser, Matús Mihalák, Peter Widmayer: Telling convex from reflex allows to map a polygon. STACS 2011: 153-164
- [c132]Peter Widmayer: DISC 2011 Invited Lecture: Polygon Reconstruction with Little Information: An Example for the Power of Simple Micro-robots. DISC 2011: 332
- [c131]Andreas Emil Feldmann, Shantanu Das, Peter Widmayer: Restricted Cuts for Bisections in Solid Grids: A Proof via Polygons. WG 2011: 143-154
- [c130]Holger Flier, Matús Mihalák, Peter Widmayer, Anna Zych: Maximum Independent Set in 2-Direction Outersegment Graphs. WG 2011: 155-166
- 2010
- [j55]Jörg Derungs, Riko Jacob, Peter Widmayer: Approximate Shortest Paths Guided by a Small Index. Algorithmica 57(4): 668-688 (2010)
- [j54]Shantanu Das, Beat Gfeller, Peter Widmayer: Computing All Best Swaps for Minimum-Stretch Tree Spanners. J. Graph Algorithms Appl. 14(2): 287-306 (2010)
- [j53]Davide Bilò, Thomas Erlebach, Matús Mihalák, Peter Widmayer: Discovery of network properties with all-shortest-paths queries. Theor. Comput. Sci. 411(14-15): 1626-1637 (2010)
- [c129]Holger Flier, Matús Mihalák, Anita Schöbel, Peter Widmayer, Anna Zych: Vertex Disjoint Paths for Dispatching in Railways. ATMOS 2010: 61-73
- [c128]Jérémie Chalopin, Shantanu Das, Yann Disser, Matús Mihalák, Peter Widmayer: How Simple Robots Benefit from Looking Back. CIAC 2010: 229-239
- [c127]Andreas Emil Feldmann, Shantanu Das, Peter Widmayer: Simple Cuts Are Fast and Good: Optimum Right-Angled Cuts in Solid Grids. COCOA (1) 2010: 11-20
- [c126]Yann Disser, Matús Mihalák, Peter Widmayer: Reconstructing a Simple Polygon from Its Angles. SWAT 2010: 13-24
- [c125]Jérémie Chalopin, Shantanu Das, Peter Widmayer: Rendezvous of Mobile Agents in Directed Graphs. DISC 2010: 282-296
2000 – 2009
- 2009
- [j52]Beat Gfeller, Leon Peeters, Birgitta Weber, Peter Widmayer: Single machine batch scheduling with release times. J. Comb. Optim. 17(3): 323-338 (2009)
- [j51]Paolo Penna, Guido Proietti, Peter Widmayer: Strongly polynomial-time truthful mechanisms in one shot. Theor. Comput. Sci. 410(17): 1607-1615 (2009)
- [c124]Rastislav Srámek, Bernd Fischer, Elias Vicari, Peter Widmayer: Optimal Transitions for Targeted Protein Quantification: Best Conditioned Submatrix Selection. COCOON 2009: 287-296
- [c123]
- [c122]Davide Bilò, Yann Disser, Matús Mihalák, Subhash Suri, Elias Vicari, Peter Widmayer: Reconstructing Visibility Graphs with Simple Robots. SIROCCO 2009: 87-99
- [c121]Davide Bilò, Michael Gatto, Luciano Gualà, Guido Proietti, Peter Widmayer: Stability of Networks in Stretchable Graphs. SIROCCO 2009: 100-112
- [c120]Paolo Penna, Florian Schoppmann, Riccardo Silvestri, Peter Widmayer: Pseudonyms in Cost-Sharing Games. WINE 2009: 256-267
- [p3]Michael Gatto, Jens Maue, Matús Mihalák, Peter Widmayer: Shunting for Dummies: An Introductory Algorithmic Survey. Robust and Online Large-Scale Optimization 2009: 310-337
- [p2]Luzi Anderegg, Paolo Penna, Peter Widmayer: Online Train Disposition: To Wait or Not to Wait? Robust and Online Large-Scale Optimization 2009: 387-398
- 2008
- [j50]Tomas Hruz, Oliver Laule, Gábor Szabó, Frans Wessendorp, Stefan Bleuler, Lukas Oertle, Peter Widmayer, Wilhelm Gruissem, Philip Zimmermann: Genevestigator V3: A Reference Expression Database for the Meta-Analysis of Transcriptomes. Adv. Bioinformatics 2008 (2008)
- [j49]Subhash Suri, Elias Vicari, Peter Widmayer: Simple Robots with Minimal Sensing: From Local Visibility to Global Geometry. I. J. Robotic Res. 27(9): 1055-1067 (2008)
- [j48]Paola Flocchini, Linda Pagli, Giuseppe Prencipe, Nicola Santoro, Peter Widmayer: Computing all the best swap edges distributively. J. Parallel Distrib. Comput. 68(7): 976-983 (2008)
- [j47]Paola Flocchini, Giuseppe Prencipe, Nicola Santoro, Peter Widmayer: Arbitrary pattern formation by asynchronous, anonymous, oblivious robots. Theor. Comput. Sci. 407(1-3): 412-447 (2008)
- [c119]Jan Brunner, Matús Mihalák, Subhash Suri, Elias Vicari, Peter Widmayer: Simple Robots in Polygonal Environments: A Hierarchy. ALGOSENSORS 2008: 111-124
- [c118]Matteo Fischetti, Peter Widmayer: ATMOS 2008 Preface -- 8th Workshop on Algorithmic Approaches for Transportation Modeling, Optimization, and Systems. ATMOS 2008
- [c117]Matteo Fischetti, Peter Widmayer: ATMOS 2008 Abstracts Collection - 8th Workshop on Algorithmic Approaches for Transportation Modeling, Optimization, and Systems. ATMOS 2008
- [c116]Fedor V. Fomin, Petr A. Golovach, Alexander Hall, Matús Mihalák, Elias Vicari, Peter Widmayer: How to Guard a Graph?. ISAAC 2008: 318-329
- [c115]Shantanu Das, Beat Gfeller, Peter Widmayer: Computing Best Swaps in Optimal Tree Spanners. ISAAC 2008: 716-727
- [c114]Shantanu Das, Matús Mihalák, Rastislav Srámek, Elias Vicari, Peter Widmayer: Rendezvous of Mobile Agents When Tokens Fail Anytime. OPODIS 2008: 463-480
- [c113]Davide Bilò, Thomas Erlebach, Matús Mihalák, Peter Widmayer: Discovery of Network Properties with All-Shortest-Paths Queries. SIROCCO 2008: 89-103
- [c112]Hans-Joachim Böckenhauer, Juraj Hromkovic, Tobias Mömke, Peter Widmayer: On the Hardness of Reoptimization. SOFSEM 2008: 50-65
- [c111]Beat Gfeller, Matús Mihalák, Subhash Suri, Elias Vicari, Peter Widmayer: Angle Optimization in Target Tracking. SWAT 2008: 65-76
- [c110]Davide Bilò, Hans-Joachim Böckenhauer, Juraj Hromkovic, Richard Královic, Tobias Mömke, Peter Widmayer, Anna Zych: Reoptimization of Steiner Trees. SWAT 2008: 258-269
- [c109]Davide Bilò, Peter Widmayer, Anna Zych: Reoptimization of Weighted Graph and Covering Problems. WAOA 2008: 201-213
- [c108]Davide Bilò, Luciano Gualà, Guido Proietti, Peter Widmayer: Computational Aspects of a 2-Player Stackelberg Shortest Paths Tree Game. WINE 2008: 251-262
- [e10]Matteo Fischetti, Peter Widmayer (Eds.): ATMOS 2008 - 8th Workshop on Algorithmic Approaches for Transportation Modeling, Optimization, and Systems, Karlsruhe, Germany, September 18, 2008. OASICS 9, Internationales Begegnungs- und Forschungszentrum fuer Informatik (IBFI), Schloss Dagstuhl, Germany 2008
- 2007
- [j46]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)
- [j45]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)
- [j44]Hans-Joachim Böckenhauer, Luca Forlizzi, Juraj Hromkovic, Joachim Kneis, Joachim Kupke, Guido Proietti, Peter Widmayer: On the Approximability of TSP on Local Modifications of Optimally Solved Instances. Algorithmic Operations Research 2(2): 83-93 (2007)
- [j43]Franz F. Roos, Riko Jacob, Jonas Grossmann, Bernd Fischer, Joachim M. Buhmann, Wilhelm Gruissem, Sacha Baginsky, Peter Widmayer: PepSplice: cache-efficient search algorithms for comprehensive identification of tandem mass spectra. Bioinformatics 23(22): 3016-3023 (2007)
- [j42]Nicola Santoro, Peter Widmayer: Agreement in synchronous networks with ubiquitous faults. Theor. Comput. Sci. 384(2-3): 232-249 (2007)
- [c107]Subhash Suri, Elias Vicari, Peter Widmayer: Simple Robots with Minimal Sensing: From Local Visibility to Global Geometry. AAAI 2007: 1114-1120
- [c106]Beat Gfeller, Matús Mihalák, Subhash Suri, Elias Vicari, Peter Widmayer: Counting Targets with Mobile Sensors in an Unknown Environment. ALGOSENSORS 2007: 32-45
- [c105]Luzi Anderegg, Stephan Eidenbenz, Leon Peeters, Peter Widmayer: Optimal Placement of Ad-Hoc Devices Under a VCG-Style Routing Protocol. ALGOSENSORS 2007: 58-70
- [c104]Subhash Suri, Roger Wattenhofer, Peter Widmayer: 07151 Abstracts Collection -- Geometry in Sensor Networks. Geometry in Sensor Networks 2007
- [c103]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
- [c102]Alexander Hall, C. Pomm, Peter Widmayer: A Combinatorial Approach to Multi-Domain Sketch Recognition. SBM 2007: 7-14
- [c101]Michael Gatto, Peter Widmayer: On the Robustness of Graham's Algorithm for Online Scheduling. WADS 2007: 349-361
- [c100]Jörg Derungs, Riko Jacob, Peter Widmayer: Approximate Shortest Paths Guided by a Small Index. WADS 2007: 553-564
- [c99]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
- [e9]Subhash Suri, Roger Wattenhofer, Peter Widmayer (Eds.): Geometry in Sensor Networks, 09.04. - 13.04.2007. Dagstuhl Seminar Proceedings 07151, Internationales Begegnungs- und Forschungszentrum fuer Informatik (IBFI), Schloss Dagstuhl, Germany 2007
- [e8]Juraj Hromkovic, Richard Královic, Marc Nunkesser, Peter Widmayer (Eds.): Stochastic Algorithms: Foundations and Applications, 4th International Symposium, SAGA 2007, Zurich, Switzerland, September 13-14, 2007, Proceedings. Lecture Notes in Computer Science 4665, Springer 2007, ISBN 978-3-540-74870-0
- 2006
- [c98]Hans-Joachim Böckenhauer, Luca Forlizzi, Juraj Hromkovic, Joachim Kneis, Joachim Kupke, Guido Proietti, Peter Widmayer: Reusing Optimal TSP Solutions for Locally Modified Input Instances. IFIP TCS 2006: 251-270
- [c97]Guido Proietti, Peter Widmayer: Partitioning the Nodes of a Graph to Minimize the Sum of Subgraph Radii. ISAAC 2006: 578-587
- [c96]Beat Gfeller, Leon Peeters, Birgitta Weber, Peter Widmayer: Online Single Machine Batch Scheduling. MFCS 2006: 424-435
- [c95]Paolo Penna, Guido Proietti, Peter Widmayer: Strongly Polynomial-Time Truthful Mechanisms in One Shot. WINE 2006: 377-388
- 2005
- [j41]Paola Flocchini, Giuseppe Prencipe, Nicola Santoro, Peter Widmayer: Gathering of asynchronous robots with limited visibility. Theor. Comput. Sci. 337(1-3): 147-168 (2005)
- [c94]Nicola Santoro, Peter Widmayer: Majority and Unanimity in Synchronous Networks with Ubiquitous Dynamic Faults. SIROCCO 2005: 262-276
- [c93]Mirjam Wattenhofer, Roger Wattenhofer, Peter Widmayer: Geometric Routing Without Geometry. SIROCCO 2005: 307-322
- [c92]Guido Proietti, Peter Widmayer: A truthful mechanism for the non-utilitarian minimum radius spanning tree problem. SPAA 2005: 195-202
- 2004
- [j40]Enrico Nardelli, Guido Proietti, Peter Widmayer: Nearly Linear Time Minimum Spanning Tree Maintenance for Transient Node Failures. Algorithmica 40(2): 119-132 (2004)
- [j39]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)
- [j38]Roger Wattenhofer, Peter Widmayer: The counting pyramid: an adaptive distributed counting scheme. J. Parallel Distrib. Comput. 64(4): 449-460 (2004)
- [j37]Stephan Eidenbenz, Matthew Hennessy, Rafael Morales Bueno, Francisco Triguero Ruiz, Peter Widmayer, Ricardo Conejo: Preface. Theor. Comput. Sci. 312(1): 1-2 (2004)
- [c91]Michael Gatto, Riko Jacob, Leon Peeters, Peter Widmayer: Online Delay Management on a Single Train Line. ATMOS 2004: 306-320
- [c90]Giovanna Melideo, Paolo Penna, Guido Proietti, Roger Wattenhofer, Peter Widmayer: Truthful Mechanisms for Generalized Utilitarian Problems. IFIP TCS 2004: 167-180
- [c89]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
- [c88]Bernd Fischer, Volker Roth, Joachim M. Buhmann, Jonas Grossmann, Sacha Baginsky, Wilhelm Gruissem, Franz F. Roos, Peter Widmayer: A Hidden Markov Model for de Novo Peptide Sequencing. NIPS 2004
- [c87]Paola Flocchini, Linda Pagli, Giuseppe Prencipe, Nicola Santoro, Peter Widmayer, Tranos Zuva: Computing All the Best Swap Edges Distributively. OPODIS 2004: 154-168
- [c86]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
- [c85]Michael Gatto, Björn Glaus, Riko Jacob, Leon Peeters, Peter Widmayer: Railway Delay Management: Exploring Its Algorithmic Complexity. SWAT 2004: 199-211
- [c84]Thomas Erlebach, Riko Jacob, Matús Mihalák, Marc Nunkesser, Gábor Szabó, Peter Widmayer: Joint Base Station Scheduling. WAOA 2004: 225-238
- 2003
- [j36]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)
- [j35]Konrad Schlude, Eljas Soisalon-Soininen, Peter Widmayer: Distributed Search Trees: Fault Tolerance in an Asynchronous Environment. Theory Comput. Syst. 36(6): 611-629 (2003)
- [j34]Stephan Eidenbenz, Peter Widmayer: An Approximation Algorithm for Minimum Convex Cover with Logarithmic Performance Guarantee. SIAM J. Comput. 32(3): 654-670 (2003)
- [j33]Enrico Nardelli, Guido Proietti, Peter Widmayer: Finding the most vital node of a shortest path. Theor. Comput. Sci. 296(1): 167-177 (2003)
- [j32]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)
- [c83]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
- [c82]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
- [c81]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
- [c80]Evangelos Kranakis, Paolo Penna, Konrad Schlude, David Scot Taylor, Peter Widmayer: Improving Customer Proximity to Railway Stations. CIAC 2003: 264-276
- [c79]Gustavo Alonso, Evangelos Kranakis, Roger Wattenhofer, Peter Widmayer: Probabilistic Protocols for Node Discovery in Ad-Hoc, Single Broadcast Channel Networks. IPDPS 2003: 218
- [c78]
- [c77]Jens-Peter Dittrich, Bernhard Seeger, David Scot Taylor, Peter Widmayer: On producing join results early. PODS 2003: 134-142
- 2002
- [j31]Luzi Anderegg, Paolo Penna, Peter Widmayer: Online train disposition: to wait or not to wait? Electr. Notes Theor. Comput. Sci. 66(6): 32-41 (2002)
- [c76]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
- [c75]Konrad Schlude, Eljas Soisalon-Soininen, Peter Widmayer: Distributed Highly Available Search Trees. SIROCCO 2002: 259-274
- [c74]Eljas Soisalon-Soininen, Peter Widmayer: Amortized Complexity of Bulk Updates in AVL-Trees. SWAT 2002: 439-448
- [c73]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
- [e7]Peter Widmayer, Francisco Triguero Ruiz, Rafael Morales Bueno, Matthew Hennessy, Stephan Eidenbenz, Ricardo Conejo (Eds.): Automata, Languages and Programming, 29th International Colloquium, ICALP 2002, Malaga, Spain, July 8-13, 2002, Proceedings. Lecture Notes in Computer Science 2380, Springer 2002, ISBN 3-540-43864-5
- 2001
- [j30]Stephan Eidenbenz, Christoph Stamm, Peter Widmayer: Inapproximability Results for Guarding Polygons and Terrains. Algorithmica 31(1): 79-113 (2001)
- [j29]Kim S. Larsen, Eljas Soisalon-Soininen, Peter Widmayer: Relaxed Balance Using Standard Rotations. Algorithmica 31(4): 501-512 (2001)
- [j28]Renato Pajarola, Peter Widmayer: Virtual Geoexploration: Concepts and Design Choices. Int. J. Comput. Geometry Appl. 11(1): 1-14 (2001)
- [j27]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)
- [j26]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)
- [c72]Enrico Nardelli, Guido Proietti, Peter Widmayer: Finding the Most Vital Node of a Shortest Path. COCOON 2001: 278-287
- [c71]Stephan Eidenbenz, Peter Widmayer: An Approximation Algorithm for MINIMUM CONVEX COVER with Logarithmic Performance Guarantee. ESA 2001: 333-344
- [c70]Juraj Hromkovic, Kathleen Steinhöfel, Peter Widmayer: Job Shop Scheduling with Unit Length Tasks: Bounds and Algorithms. ICTCS 2001: 90-106
- [c69]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
- [c68]Paola Flocchini, Giuseppe Prencipe, Nicola Santoro, Peter Widmayer: Pattern Formation by Anonymous Robots Without Chirality. SIROCCO 2001: 147-162
- [c67]Paola Flocchini, Giuseppe Prencipe, Nicola Santoro, Peter Widmayer: Gathering of Asynchronous Oblivious Robots with Limited Visibility. STACS 2001: 247-258
- 2000
- [j25]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)
- [j24]Renato Pajarola, Peter Widmayer: An image compression method for spatial search. IEEE Transactions on Image Processing 9(3): 357-365 (2000)
- [c66]Enrico Nardelli, Guido Proietti, Peter Widmayer: Maintaining a Minimum Spanning Tree Under Transient Node Failures. ESA 2000: 346-355
- [c65]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
- [c64]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
1990 – 1999
- 1999
- [j23]Edmund Ihler, Gabriele Reich, Peter Widmayer: Class Steiner Trees and VLSI-design. Discrete Applied Mathematics 90(1-3): 173-194 (1999)
- [j22]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)
- [c63]Enrico Nardelli, Guido Proietti, Peter Widmayer: How to Swap a Failing Edge of a Single Source Shortest Paths Tree. COCOON 1999: 144-153
- [c62]Jochen Van den Bercken, Bernhard Seeger, Peter Widmayer: The Bulk Index Join: A Generic Approach to Processing Non-Equijoins. ICDE 1999: 257
- [c61]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
- [c60]Eljas Soisalon-Soininen, Peter Widmayer: Concurrency and Recovery in Full-Text Indexing. SPIRE/CRIWG 1999: 192-198
- [c59]Yuri Breitbart, Sajal K. Das, Nicola Santoro, Peter Widmayer: Introduction: Distributed Data & Structures 2. WDAS 1999
- [e6]Nicola Santoro, Peter Widmayer (Eds.): Distributed Data & Structures, Records of the 1st International Meeting (WDAS 1998), Orlando, Florida, USA. Proceedings in Informatics 2, Carleton Scientific 1999, ISBN 1-894145-02-X
- [e5]Yuri Breitbart, Sajal K. Das, Nicola Santoro, Peter Widmayer (Eds.): Distributed Data & Structures 2, Records of the 2nd International Meeting (WDAS 1999), Princeton, USA, May 10-11, 1999. Proceedings in Informatics 6, Carleton Scientific 1999, ISBN 1-894145-05-4
- [e4]Peter Widmayer, Gabriele Neyer, Stephan Eidenbenz (Eds.): Graph-Theoretic Concepts in Computer Science, 25th International Workshop, WG '99, Ascona, Switzerland, June 17-19, 1999, Proceedings. Lecture Notes in Computer Science 1665, Springer 1999, ISBN 3-540-66731-8
- 1998
- [j21]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)
- [j20]Roger Wattenhofer, Peter Widmayer: An Inherent Bottleneck in Distributed Counting. J. Parallel Distrib. Comput. 49(1): 135-145 (1998)
- [c58]Stephan Eidenbenz, Christoph Stamm, Peter Widmayer: Inapproximability of some art gallery problems. CCCG 1998
- [c57]Christoph Stamm, Stephan Eidenbenz, Michael Beck, Peter Stucki, Peter Widmayer: A Prototype System for Light Propagation in Terrains. Computer Graphics International 1998: 103-
- [c56]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
- [c55]Stephan Eidenbenz, Christoph Stamm, Peter Widmayer: Positioning Guards at Fixed Height Above a Terrain - An Optimum Inapproximability Result. ESA 1998: 187-198
- [c54]Renato Pajarola, Thomas Ohler, Peter Stucki, Kornel Szabo, Peter Widmayer: The Alps at Your Fingertips: Virtual Reality and Geoinformation Systems. ICDE 1998: 550-557
- [c53]Roger Wattenhofer, Peter Widmayer: The counting pyramid: an adaptive distributed counting scheme. SIROCCO 1998: 145-157
- [c52]
- [c51]Roger Wattenhofer, Peter Widmayer: A Unified Analysis of Distributed Counting with Queueing Theory. WDAS 1998: 84-97
- 1997
- [j19]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)
- [c50]Eljas Soisalon-Soininen, Peter Widmayer: Relaxed Balancing in Search Trees. Advances in Algorithms, Languages, and Complexity 1997: 267-283
- [c49]Gabriele Neyer, Peter Widmayer: Singularities Make Spatial Join Scheduling Hard. ISAAC 1997: 293-302
- [c48]Roger Wattenhofer, Peter Widmayer: An Inherent Bottleneck in Distributed Counting. PODC 1997: 159-167
- [c47]Jochen Van den Bercken, Bernhard Seeger, Peter Widmayer: A Generic Approach to Bulk Loading Multidimensional Index Structures. VLDB 1997: 406-415
- [c46]Kim S. Larsen, Eljas Soisalon-Soininen, Peter Widmayer: Relaxed Balance through Standard Rotations. WADS 1997: 450-461
- [e3]Marc J. van Kreveld, Jürg Nievergelt, Thomas Roos, Peter Widmayer (Eds.): 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. Lecture Notes in Computer Science 1340, Springer 1997, ISBN 3-540-63818-0
- [e2]Danny Krizanc, Peter Widmayer (Eds.): SIROCCO'97, 4th International Colloquium on Structural Information & Communication Complexity, Monte Verita, Ascona, Switzerland, July 24-26, 1997. Carleton Scientific 1997
- 1996
- [b3]Thomas Ottmann, Peter Widmayer: Algorithmen und Datenstrukturen, 3. Auflage. Spektrum Lehrbuch, Spektrum 1996, ISBN 978-3-8274-0110-6, pp. I-XVII, 1-696
- [j18]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)
- [j17]Bruno Becker, Stephan Gschwind, Thomas Ohler, Bernhard Seeger, Peter Widmayer: An Asymptotically Optimal Multiversion B-Tree. VLDB J. 5(4): 264-275 (1996)
- [c45]Jürg Nievergelt, Peter Widmayer: Spatial Data Structures: Concepts and Design Choices. Algorithmic Foundations of Geographic Information Systems 1996: 153-197
- [c44]Edouard Bugnion, Thomas Roos, Roger Wattenhofer, Peter Widmayer: Space Filling Curves versus Random Walks. Algorithmic Foundations of Geographic Information Systems 1996: 199-211
- [c43]Renato Pajarola, Peter Widmayer: Spatial Indexing into Compressed Raster Images: How to Answer Range Queries Without Decompression. IW-MMDBMS 1996: 94-100
- 1995
- [j16]Fabrizio d'Amore, Viet Hai Nguyen, Thomas Roos, Peter Widmayer: On Optimal Cuts of Hyperrectangles. Computing 55(3): 191-206 (1995)
- [j15]
- [c42]Viet Hai Nguyen, Peter Widmayer: Binary Space Partitions for Sets of Hyperrectangles. ASIAN 1995: 59-72
- [c41]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
- [c40]
- 1994
- [j14]Thomas Roos, Peter Widmayer: k-Violation Linear Programming. Inf. Process. Lett. 52(2): 109-114 (1994)
- [c39]Thomas Roos, Fei Shi, Peter Widmayer: A Data Structure for Approximate String Searching. HICSS (5) 1994: 45-46
- [c38]Viet Hai Nguyen, Thomas Ohler, Peter Widmayer: VisTool: A Visualization Tool for Spatial Access Structures. IGIS 1994: 274-287
- [c37]Brigitte Kröll, Peter Widmayer: Distributing a Search Tree Among a Growing Number of Processors. SIGMOD Conference 1994: 265-276
- [e1]Jürg Nievergelt, Thomas Roos, Hans-Jörg Schek, Peter Widmayer (Eds.): IGIS '94: Geographic Information Systems, International Workshop on Advanced Information Systems, Monte Verita, Ascona, Switzerland, February 28 - March 4, 1994, Proceedings. Lecture Notes in Computer Science 884, Springer 1994, ISBN 3-540-58795-0
- 1993
- [b2]Thomas Ottmann, Peter Widmayer: Algorithmen und Datenstrukturen, 2. Auflage. Reihe Informatik 70, Bibliographisches Institut 1993, ISBN 3-411-16602-9
- [j13]Jürg Nievergelt, Peter Widmayer: Guard Files: Stabbing and Intersection Queries on Fat Spatial Objects. Comput. J. 36(2): 107-116 (1993)
- [c36]Viet Hai Nguyen, Thomas Roos, Peter Widmayer: Balanced Cuts of a Set of Hyperrectangles. CCCG 1993: 121-126
- [c35]Thomas Ohler, Peter Widmayer: A Brief Tutorial Introduction to Data Structures for Geometric Databases. CISM - Advances in Database Systems 1993: 329-351
- [c34]Thomas Ohler, Peter Widmayer: Data Structures and Algorithms for Geographic Information Systems: Selected Topics. CISM - Advances in Database Systems 1993: 353-364
- [c33]Thomas Ohler, Peter Widmayer: Geographic Information Systems: An Example. CISM - Advances in Database Systems 1993: 365-377
- [c32]Fabrizio d'Amore, Thomas Roos, Peter Widmayer: An Optimal Algorithm for Computing a Best Cut of a Set of Hyperrectangles. ICCG 1993: 215-224
- [c31]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
- [c30]Bruno Becker, Stephan Gschwind, Thomas Ohler, Bernhard Seeger, Peter Widmayer: On Optimal Multiversion Access Structures. SSD 1993: 123-141
- 1992
- [c29]Hans-Werner Six, Peter Widmayer: Spatial Access Structures for Geometric Databases. Data Structures and Efficient Algorithms 1992: 214-232
- [c28]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
- [c27]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
- [c26]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
- [c25]Edmund Ihler, Gabriele Reich, Peter Widmayer: On Shortest Networks for Classes of Points in the Plane. Workshop on Computational Geometry 1991: 103-111
- [c24]Bruno Becker, Hans-Werner Six, Peter Widmayer: Spatial Priority Search: An Access Technique for Scaleless Maps. SIGMOD Conference 1991: 128-137
- [p1]Peter Widmayer: Datenstrukturen für Geodatenbanken. Entwicklungstendenzen bei Datenbanksystemen 1991: 317-361
- 1990
- [b1]Thomas Ottmann, Peter Widmayer: Algorithmen und Datenstrukturen. Reihe Informatik 70, Bibliographisches Institut 1990, ISBN 3-411-03161-1
- [j12]Georg Lausen, Eljas Soisalon-Soininen, Peter Widmayer: On the Power of Safe Locking. J. Comput. Syst. Sci. 40(2): 269-288 (1990)
- [c23]Bruno Becker, Hans-Werner Six, Peter Widmayer: Maßstabsunabhängige Verwaltung von Landschaftsdaten. GI Jahrestagung (2) 1990: 487-496
- [c22]Peter Widmayer, Bruno Becker: Ein Vorschlag zur maßstabsunabhängigen Verwaltung von Landschaftsdaten. Grundlagen von Datenbanken 1990: 95-96
- [c21]Andreas Hutflesz, Hans-Werner Six, Peter Widmayer: The R-File: An Efficient Access Structure for Proximity Queries. ICDE 1990: 372-379
- [c20]Nicola Santoro, Peter Widmayer: Distributed Function Evaluation in the Presence of Transmission Faults. SIGAL International Symposium on Algorithms 1990: 358-367
1980 – 1989
- 1989
- [c19]
- [c18]
- [c17]Andreas Henrich, Hans-Werner Six, Peter Widmayer: The LSD tree: Spatial Access to Multidimensional Point and Nonpoint Objects. VLDB 1989: 45-53
- [c16]Gabriele Reich, Peter Widmayer: Beyond Steiner's Problem: A VLSI Oriented Generalization. WG 1989: 196-210
- [c15]Andreas Henrich, Hans-Werner Six, Peter Widmayer: Paging Binary Trees with External Balancing. WG 1989: 260-276
- 1988
- [j11]Peter Widmayer, Lin S. Woo, C. K. Wong: Maximizing pin alignment in semi-custom chip circuit layout. Integration 6(1): 3-33 (1988)
- [j10]Gregory J. E. Rawlins, Peter Widmayer, Derick Wood: Hole Problems for Rectangles in the Plane. SIAM J. Discrete Math. 1(1): 86-97 (1988)
- [c14]Andreas Hutflesz, Peter Widmayer, Hans-Werner Six: Twin Grid Files: A Performance Evaluation. Workshop on Computational Geometry 1988: 15-24
- [c13]Andreas Hutflesz, Hans-Werner Six, Peter Widmayer: The Twin Grid File: A Nearly Space Optimal Index Structure. EDBT 1988: 352-363
- [c12]
- [c11]Andreas Hutflesz, Hans-Werner Six, Peter Widmayer: Globally Order Preserving Multidimensional Linear Hashing. ICDE 1988: 572-579
- [c10]Andreas Hutflesz, Hans-Werner Six, Peter Widmayer: Twin Grid Files: Space Optimizing Access Schemes. SIGMOD Conference 1988: 183-190
- 1987
- [j9]Peter Widmayer, Derick Wood: Time- and Space-Optimal Contour Computation for a Set of Rectangles. Inf. Process. Lett. 24(5): 335-338 (1987)
- [j8]Peter Widmayer, Ying-Fung Wu, C. K. Wong: On Some Distance Problems in Fixed Orientations. SIAM J. Comput. 16(4): 728-746 (1987)
- [j7]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)
- [c9]Thomas Rottke, Hans-Werner Six, Peter Widmayer: On the Analysis of Grid Structures for Spatial Objects of Non-Zero Size. WG 1987: 94-105
- 1986
- [j6]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)
- [j5]Georg Lausen, Eljas Soisalon-Soininen, Peter Widmayer: Pre-analysis Locking. Information and Control 70(2/3): 193-215 (1986)
- [c8]Hans-Werner Six, Peter Widmayer: Hintergrundspeicherstrukturen für ausgedehnte Objekte. GI Jahrestagung (1) 1986: 538-552
- [c7]Georg Lausen, Eljas Soisalon-Soininen, Peter Widmayer: Towards Online Schedulers Based on Pre-Analysis Locking. ICDT 1986: 242-259
- [c6]Thomas Ottmann, Peter Widmayer: Modellversuch computergestützter Informatikunterricht: Algorithmen und Datenstrukturen. INFOS 1986: 420-431
- [c5]
- 1985
- [j4]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)
- [j3]Peter Widmayer, C. K. Wong: An Optimal Algorithm for the Maximum Alignment of Terminals. Inf. Process. Lett. 20(2): 75-82 (1985)
- [c4]Peter Widmayer, Ying-Fung Wu, C. K. Wong: Distance problems in computational geometry with fixed orientations. Symposium on Computational Geometry 1985: 186-195
- [c3]Georg Lausen, Eljas Soisalon-Soininen, Peter Widmayer: Pre-Analysis Locking: A Safe and Deadlock Free Locking Policy. VLDB 1985: 270-281
- 1984
- [j2]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)
- [c2]Thomas Ottmann, Peter Widmayer: Solving Visibility Problems by Using Skeleton Structures. MFCS 1984: 459-470
- [c1]Georg Lausen, Eljas Soisalon-Soininen, Peter Widmayer: Maximal Concurrency by Locking. PODS 1984: 38-44
- 1983
- [j1]Thomas Ottmann, Peter Widmayer: On translating a set of line segments. Computer Vision, Graphics, and Image Processing 24(3): 382-389 (1983)
Coauthor Index
data released under the ODC-BY 1.0 license. See also our legal information page
last updated on 2013-10-02 11:00 CEST by the dblp team