2013
203Mapping Simple Polygons: How Robots Benefit from Looking Back. Jérémie Chalopin, Shantanu Das, Yann Disser, Matús Mihalák, Peter Widmayer. Algorithmica (65): 43-59 (2013). Web SearchBibTeXDownload
202Simple agents learn to find their way: An introduction on mapping polygons. Jérémie Chalopin, Shantanu Das, Yann Disser, Matús Mihalák, Peter Widmayer. Discrete Applied Mathematics (161): 1287-1307 (2013). Web SearchBibTeXDownload
201Corner cuts are close to optimal: From solid grids to polygons and back. Andreas Emil Feldmann, Shantanu Das, Peter Widmayer. Discrete Applied Mathematics (161): 970-998 (2013). Web SearchBibTeXDownload
200Robust optimization in the presence of uncertainty. Joachim M. Buhmann, Matús Mihalák, Rastislav Srámek, Peter Widmayer. ITCS 2013, 505-514. Web SearchBibTeXDownload
2012
199Mapping a Polygon with Holes Using a Compass. Yann Disser, Subir Kumar Ghosh, Matús Mihalák, Peter Widmayer. ALGOSENSORS 2012, 78-89. Web SearchBibTeXDownload
198Sort-based query-adaptive loading of R-trees. Daniar Achakeev, Bernhard Seeger, Peter Widmayer. CIKM 2012, 2080-2084. Web SearchBibTeXDownload
197Simple Agents Learn to Find Their Way: An Introduction on Mapping Polygons. Jérémie Chalopin, Shantanu Das, Yann Disser, Matús Mihalák, Peter Widmayer. CoRR (abs/1204.3850) (2012). Web SearchBibTeXDownload
196Reconstructing visibility graphs with simple robots. Davide Bilň, Yann Disser, Matús Mihalák, Subhash Suri, Elias Vicari, Peter Widmayer. Theor. Comput. Sci. (444): 52-59 (2012). Web SearchBibTeXDownload
195Combinatorial Optimization with Noisy Inputs: How Can We Separate the Wheat from the Chaff?. Peter Widmayer. WALCOM 2012, 1. Web SearchBibTeXDownload
2011
194How to Guard a Graph?. Fedor V. Fomin, Petr A. Golovach, Alexander Hall, Matús Mihalák, Elias Vicari, Peter Widmayer. Algorithmica (61): 839-856 (2011). Web SearchBibTeXDownload
193A polygon is determined by its angles. Yann Disser, Matús Mihalák, Peter Widmayer. Comput. Geom. (44): 418-426 (2011). Web SearchBibTeXDownload
192DISC 2011 Invited Lecture: Polygon Reconstruction with Little Information: An Example for the Power of Simple Micro-robots. Peter Widmayer. DISC 2011, 332. Web SearchBibTeXDownload
191An $\\mathcal{O}(n^4)$ Time Algorithm to Compute the Bisection Width of Solid Grid Graphs. Andreas Emil Feldmann, Peter Widmayer. ESA 2011, 143-154. Web SearchBibTeXDownload
190A Distributed Algorithm for Finding All Best Swap Edges of a Minimum-Diameter Spanning Tree. Beat Gfeller, Nicola Santoro, Peter Widmayer. IEEE Trans. Dependable Sec. Comput. (8): 1-12 (2011). Web SearchBibTeXDownload
189On robust online scheduling algorithms. Michael Gatto, Peter Widmayer. J. Scheduling (14): 141-156 (2011). Web SearchBibTeXDownload
188On the Complexity of the Metric TSP under Stability Considerations. Matús Mihalák, Marcel Schöngens, Rastislav Srámek, Peter Widmayer. SOFSEM 2011, 382-393. Web SearchBibTeXDownload
187Telling convex from reflex allows to map a polygon. Jérémie Chalopin, Shantanu Das, Yann Disser, Matús Mihalák, Peter Widmayer. STACS 2011, 153-164. Web SearchBibTeXDownload
186Restricted Cuts for Bisections in Solid Grids: A Proof via Polygons. Andreas Emil Feldmann, Shantanu Das, Peter Widmayer. WG 2011, 143-154. Web SearchBibTeXDownload
185Maximum Independent Set in 2-Direction Outersegment Graphs. Holger Flier, Matús Mihalák, Peter Widmayer, Anna Zych. WG 2011, 155-166. Web SearchBibTeXDownload
2010
184Approximate Shortest Paths Guided by a Small Index. Jörg Derungs, Riko Jacob, Peter Widmayer. Algorithmica (57): 668-688 (2010). Web SearchBibTeXDownload
183Vertex Disjoint Paths for Dispatching in Railways. Holger Flier, Matús Mihalák, Anita Schöbel, Peter Widmayer, Anna Zych. ATMOS 2010, 61-73. Web SearchBibTeXDownload
182How Simple Robots Benefit from Looking Back. Jérémie Chalopin, Shantanu Das, Yann Disser, Matús Mihalák, Peter Widmayer. CIAC 2010, 229-239. Web SearchBibTeXDownload
181Simple Cuts Are Fast and Good: Optimum Right-Angled Cuts in Solid Grids. Andreas Emil Feldmann, Shantanu Das, Peter Widmayer. COCOA (1) 2010, 11-20. Web SearchBibTeXDownload
180Rendezvous of Mobile Agents in Directed Graphs. Jérémie Chalopin, Shantanu Das, Peter Widmayer. DISC 2010, 282-296. Web SearchBibTeXDownload
179Computing All Best Swaps for Minimum-Stretch Tree Spanners. Shantanu Das, Beat Gfeller, Peter Widmayer. J. Graph Algorithms Appl. (14): 287-306 (2010). Web SearchBibTeXDownload
178Reconstructing a Simple Polygon from Its Angles. Yann Disser, Matús Mihalák, Peter Widmayer. SWAT 2010, 13-24. Web SearchBibTeXDownload
177Discovery of network properties with all-shortest-paths queries. Davide Bilň, Thomas Erlebach, Matús Mihalák, Peter Widmayer. Theor. Comput. Sci. (411): 1626-1637 (2010). Web SearchBibTeXDownload
2009
176Optimal Transitions for Targeted Protein Quantification: Best Conditioned Submatrix Selection. Rastislav Srámek, Bernd Fischer, Elias Vicari, Peter Widmayer. COCOON 2009, 287-296. Web SearchBibTeXDownload
175Single machine batch scheduling with release times. Beat Gfeller, Leon Peeters, Birgitta Weber, Peter Widmayer. J. Comb. Optim. (17): 323-338 (2009). Web SearchBibTeXDownload
174How to Sort a Train. Peter Widmayer. MFCS 2009, 77. Web SearchBibTeXDownload
173Shunting for Dummies: An Introductory Algorithmic Survey. Michael Gatto, Jens Maue, Matús Mihalák, Peter Widmayer. Robust and Online Large-Scale Optimization 2009, 310-337. Web SearchBibTeXDownload
172Online Train Disposition: To Wait or Not to Wait?. Luzi Anderegg, Paolo Penna, Peter Widmayer. Robust and Online Large-Scale Optimization 2009, 387-398. Web SearchBibTeXDownload
171Reconstructing Visibility Graphs with Simple Robots. Davide Bilň, Yann Disser, Matús Mihalák, Subhash Suri, Elias Vicari, Peter Widmayer. SIROCCO 2009, 87-99. Web SearchBibTeXDownload
170Stability of Networks in Stretchable Graphs. Davide Bilň, Michael Gatto, Luciano Gualŕ, Guido Proietti, Peter Widmayer. SIROCCO 2009, 100-112. Web SearchBibTeXDownload
169Strongly polynomial-time truthful mechanisms in one shot. Paolo Penna, Guido Proietti, Peter Widmayer. Theor. Comput. Sci. (410): 1607-1615 (2009). Web SearchBibTeXDownload
168Pseudonyms in Cost-Sharing Games. Paolo Penna, Florian Schoppmann, Riccardo Silvestri, Peter Widmayer. WINE 2009, 256-267. Web SearchBibTeXDownload
2008
167Genevestigator V3: A Reference Expression Database for the Meta-Analysis of Transcriptomes. Tomas Hruz, Oliver Laule, Gábor Szabó, Frans Wessendorp, Stefan Bleuler, Lukas Oertle, Peter Widmayer, Wilhelm Gruissem, Philip Zimmermann. Adv. Bioinformatics (2008) (2008). Web SearchBibTeXDownload
166Simple Robots in Polygonal Environments: A Hierarchy. Jan Brunner, Matús Mihalák, Subhash Suri, Elias Vicari, Peter Widmayer. ALGOSENSORS 2008, 111-124. Web SearchBibTeXDownload
165ATMOS 2008 Abstracts Collection - 8th Workshop on Algorithmic Approaches for Transportation Modeling, Optimization, and Systems. Matteo Fischetti, Peter Widmayer. ATMOS 2008. Web SearchBibTeXDownload
164ATMOS 2008 Preface -- 8th Workshop on Algorithmic Approaches for Transportation Modeling, Optimization, and Systems. Matteo Fischetti, Peter Widmayer. ATMOS 2008. Web SearchBibTeXDownload
163Simple Robots with Minimal Sensing: From Local Visibility to Global Geometry. Subhash Suri, Elias Vicari, Peter Widmayer. I. J. Robotic Res. (27): 1055-1067 (2008). Web SearchBibTeXDownload
162How to Guard a Graph?. Fedor V. Fomin, Petr A. Golovach, Alexander Hall, Matús Mihalák, Elias Vicari, Peter Widmayer. ISAAC 2008, 318-329. Web SearchBibTeXDownload
161Computing Best Swaps in Optimal Tree Spanners. Shantanu Das, Beat Gfeller, Peter Widmayer. ISAAC 2008, 716-727. Web SearchBibTeXDownload
160Computing all the best swap edges distributively. Paola Flocchini, Linda Pagli, Giuseppe Prencipe, Nicola Santoro, Peter Widmayer. J. Parallel Distrib. Comput. (68): 976-983 (2008). Web SearchBibTeXDownload
159Rendezvous of Mobile Agents When Tokens Fail Anytime. Shantanu Das, Matús Mihalák, Rastislav Srámek, Elias Vicari, Peter Widmayer. OPODIS 2008, 463-480. Web SearchBibTeXDownload
158Discovery of Network Properties with All-Shortest-Paths Queries. Davide Bilň, Thomas Erlebach, Matús Mihalák, Peter Widmayer. SIROCCO 2008, 89-103. Web SearchBibTeXDownload
157On the Hardness of Reoptimization. Hans-Joachim Böckenhauer, Juraj Hromkovic, Tobias Mömke, Peter Widmayer. SOFSEM 2008, 50-65. Web SearchBibTeXDownload
156Angle Optimization in Target Tracking. Beat Gfeller, Matús Mihalák, Subhash Suri, Elias Vicari, Peter Widmayer. SWAT 2008, 65-76. Web SearchBibTeXDownload
155Reoptimization of Steiner Trees. Davide Bilň, Hans-Joachim Böckenhauer, Juraj Hromkovic, Richard Královic, Tobias Mömke, Peter Widmayer, Anna Zych. SWAT 2008, 258-269. Web SearchBibTeXDownload
154Arbitrary pattern formation by asynchronous, anonymous, oblivious robots. Paola Flocchini, Giuseppe Prencipe, Nicola Santoro, Peter Widmayer. Theor. Comput. Sci. (407): 412-447 (2008). Web SearchBibTeXDownload
153Reoptimization of Weighted Graph and Covering Problems. Davide Bilň, Peter Widmayer, Anna Zych. WAOA 2008, 201-213. Web SearchBibTeXDownload
152Computational Aspects of a 2-Player Stackelberg Shortest Paths Tree Game. Davide Bilň, Luciano Gualŕ, Guido Proietti, Peter Widmayer. WINE 2008, 251-262. Web SearchBibTeXDownload
2007
151Simple Robots with Minimal Sensing: From Local Visibility to Global Geometry. Subhash Suri, Elias Vicari, Peter Widmayer. AAAI 2007, 1114-1120. Web SearchBibTeXDownload
150An Algorithmic View on OVSF Code Assignment. Thomas Erlebach, Riko Jacob, Matús Mihalák, Marc Nunkesser, Gábor Szabó, Peter Widmayer. Algorithmica (47): 269-298 (2007). Web SearchBibTeXDownload
149On the Approximability of TSP on Local Modifications of Optimally Solved Instances. Hans-Joachim Böckenhauer, Luca Forlizzi, Juraj Hromkovic, Joachim Kneis, Joachim Kupke, Guido Proietti, Peter Widmayer. Algorithmic Operations Research (2): 83-93 (2007). Web SearchBibTeXDownload
148Job Shop Scheduling with Unit Length Tasks: Bounds and Algorithms. Juraj Hromkovic, Tobias Mömke, Peter Widmayer, Peter Widmayer. Algorithmic Operations Research (2) (2007). Web SearchBibTeXDownload
147Counting Targets with Mobile Sensors in an Unknown Environment. Beat Gfeller, Matús Mihalák, Subhash Suri, Elias Vicari, Peter Widmayer. ALGOSENSORS 2007, 32-45. Web SearchBibTeXDownload
146Optimal Placement of Ad-Hoc Devices Under a VCG-Style Routing Protocol. Luzi Anderegg, Stephan Eidenbenz, Leon Peeters, Peter Widmayer. ALGOSENSORS 2007, 58-70. Web SearchBibTeXDownload
145PepSplice: cache-efficient search algorithms for comprehensive identification of tandem mass spectra. Franz F. Roos, Riko Jacob, Jonas Grossmann, Bernd Fischer, Joachim M. Buhmann, Wilhelm Gruissem, Sacha Baginsky, Peter Widmayer. Bioinformatics (23): 3016-3023 (2007). Web SearchBibTeXDownload
144A Distributed Algorithm for Finding All Best Swap Edges of a Minimum Diameter Spanning Tree. Beat Gfeller, Nicola Santoro, Peter Widmayer. DISC 2007, 268-282. Web SearchBibTeXDownload
14307151 Abstracts Collection -- Geometry in Sensor Networks. Subhash Suri, Roger Wattenhofer, Peter Widmayer. Geometry in Sensor Networks 2007. Web SearchBibTeXDownload
142Locating Facilities on a Network to Minimize Their Average Service Radius. Davide Bilň, Jörg Derungs, Luciano Gualŕ, Guido Proietti, Peter Widmayer. ISAAC 2007, 587-598. Web SearchBibTeXDownload
141A Combinatorial Approach to Multi-Domain Sketch Recognition. Alexander Hall, C. Pomm, Peter Widmayer. SBM 2007, 7-14. Web SearchBibTeXDownload
140Agreement in synchronous networks with ubiquitous faults. Nicola Santoro, Peter Widmayer. Theor. Comput. Sci. (384): 232-249 (2007). Web SearchBibTeXDownload
139On the Robustness of Graham's Algorithm for Online Scheduling. Michael Gatto, Peter Widmayer. WADS 2007, 349-361. Web SearchBibTeXDownload
138Approximate Shortest Paths Guided by a Small Index. Jörg Derungs, Riko Jacob, Peter Widmayer. WADS 2007, 553-564. Web SearchBibTeXDownload
2006
137Reusing Optimal TSP Solutions for Locally Modified Input Instances. Hans-Joachim Böckenhauer, Luca Forlizzi, Juraj Hromkovic, Joachim Kneis, Joachim Kupke, Guido Proietti, Peter Widmayer. IFIP TCS 2006, 251-270. Web SearchBibTeXDownload
136Partitioning the Nodes of a Graph to Minimize the Sum of Subgraph Radii. Guido Proietti, Peter Widmayer. ISAAC 2006, 578-587. Web SearchBibTeXDownload
135Online Single Machine Batch Scheduling. Beat Gfeller, Leon Peeters, Birgitta Weber, Peter Widmayer. MFCS 2006, 424-435. Web SearchBibTeXDownload
134Strongly Polynomial-Time Truthful Mechanisms in One Shot. Paolo Penna, Guido Proietti, Peter Widmayer. WINE 2006, 377-388. Web SearchBibTeXDownload
2005
133Majority and Unanimity in Synchronous Networks with Ubiquitous Dynamic Faults. Nicola Santoro, Peter Widmayer. SIROCCO 2005, 262-276. Web SearchBibTeXDownload
132Geometric Routing Without Geometry. Mirjam Wattenhofer, Roger Wattenhofer, Peter Widmayer. SIROCCO 2005, 307-322. Web SearchBibTeXDownload
131A truthful mechanism for the non-utilitarian minimum radius spanning tree problem. Guido Proietti, Peter Widmayer. SPAA 2005, 195-202. Web SearchBibTeXDownload
130Gathering of asynchronous robots with limited visibility. Paola Flocchini, Giuseppe Prencipe, Nicola Santoro, Peter Widmayer. Theor. Comput. Sci. (337): 147-168 (2005). Web SearchBibTeXDownload
2004
129Nearly Linear Time Minimum Spanning Tree Maintenance for Transient Node Failures. Enrico Nardelli, Guido Proietti, Peter Widmayer. Algorithmica (40): 119-132 (2004). Web SearchBibTeXDownload
128Online Delay Management on a Single Train Line. Michael Gatto, Riko Jacob, Leon Peeters, Peter Widmayer. ATMOS 2004, 306-320. Web SearchBibTeXDownload
127Theory on the Tracks: A Selection of Railway Optimization Problems (Column: Algorithmics). Michael Gatto, Riko Jacob, Leon Peeters, Birgitta Weber, Peter Widmayer. Bulletin of the EATCS (84): 41-70 (2004). Web SearchBibTeX
126Truthful Mechanisms for Generalized Utilitarian Problems. Giovanna Melideo, Paolo Penna, Guido Proietti, Roger Wattenhofer, Peter Widmayer. IFIP TCS 2004, 167-180. Web SearchBibTeX
125Scheduling with Release Times and Deadlines on a Minimum Number of Machines. Mark Cieliebak, Thomas Erlebach, Fabian Hennecke, Birgitta Weber, Peter Widmayer. IFIP TCS 2004, 209-222. Web SearchBibTeX
124The counting pyramid: an adaptive distributed counting scheme. Roger Wattenhofer, Peter Widmayer. J. Parallel Distrib. Comput. (64): 449-460 (2004). Web SearchBibTeXDownload
123A Hidden Markov Model for de Novo Peptide Sequencing. Bernd Fischer, Volker Roth, Joachim M. Buhmann, Jonas Grossmann, Sacha Baginsky, Wilhelm Gruissem, Franz F. Roos, Peter Widmayer. NIPS 2004. Web SearchBibTeXDownload
122Computing All the Best Swap Edges Distributively. Paola Flocchini, Linda Pagli, Giuseppe Prencipe, Nicola Santoro, Peter Widmayer, Tranos Zuva. OPODIS 2004, 154-168. Web SearchBibTeXDownload
121An Algorithmic View on OVSF Code Assignment. Thomas Erlebach, Riko Jacob, Matús Mihalák, Marc Nunkesser, Gábor Szabó, Peter Widmayer. STACS 2004, 270-281. Web SearchBibTeXDownload
120Railway Delay Management: Exploring Its Algorithmic Complexity. Michael Gatto, Björn Glaus, Riko Jacob, Leon Peeters, Peter Widmayer. SWAT 2004, 199-211. Web SearchBibTeXDownload
119Joint Base Station Scheduling. Thomas Erlebach, Riko Jacob, Matús Mihalák, Marc Nunkesser, Gábor Szabó, Peter Widmayer. WAOA 2004, 225-238. Web SearchBibTeXDownload
2003
118Probabilistic Protocols for Node Discovery in Ad Hoc Multi-channel Broadcast Networks. Gustavo Alonso, Evangelos Kranakis, Cindy Sawchuk, Roger Wattenhofer, Peter Widmayer. ADHOC-NOW 2003, 104-115. Cited by 7Web SearchBibTeXDownload
117Train Routing Algorithms: Concepts, Design Choises, and Practical Considerations. Luzi Anderegg, Stephan Eidenbenz, Martin Gantenbein, Christoph Stamm, David Scot Taylor, Birgitta Weber, Peter Widmayer. ALENEX 2003, 106-118. Web SearchBibTeX
116Swapping a Failing Edge of a Single Source Shortest Paths Tree Is Good and Fast. Enrico Nardelli, Guido Proietti, Peter Widmayer. Algorithmica (35): 56-74 (2003). Web SearchBibTeXDownload
115Improving Customer Proximity to Railway Stations. Evangelos Kranakis, Paolo Penna, Konrad Schlude, David Scot Taylor, Peter Widmayer. CIAC 2003, 264-276. Web SearchBibTeXDownload
114Single and Bulk Updates in Stratified Trees: An Amortized and Worst-Case Analysis. Eljas Soisalon-Soininen, Peter Widmayer. Computer Science in Perspective 2003, 278-292. Web SearchBibTeXDownload
113Evolutionary multiobjective optimization for base station transmitter placement with frequency assignment. Nicole Weicker, Gábor Szabó, Karsten Weicker, Peter Widmayer. IEEE Trans. Evolutionary Computation (7): 189-203 (2003). Web SearchBibTeXDownload
112Probabilistic Protocols for Node Discovery in Ad-Hoc, Single Broadcast Channel Networks. Gustavo Alonso, Evangelos Kranakis, Roger Wattenhofer, Peter Widmayer. IPDPS 2003, 218. Cited by 16Web SearchBibTeXDownload
111Flexible Train Rostering. Stephan Eidenbenz, Aris Pagourtzis, Peter Widmayer. ISAAC 2003, 615-624. Web SearchBibTeXDownload
110On producing join results early. Jens-Peter Dittrich, Bernhard Seeger, David Scot Taylor, Peter Widmayer. PODS 2003, 134-142. Cited by 12Web SearchBibTeXDownload
109An Approximation Algorithm for Minimum Convex Cover with Logarithmic Performance Guarantee. Stephan Eidenbenz, Peter Widmayer. SIAM J. Comput. (32): 654-670 (2003). Web SearchBibTeXDownload
108Finding the most vital node of a shortest path. Enrico Nardelli, Guido Proietti, Peter Widmayer. Theor. Comput. Sci. (296): 167-177 (2003). Web SearchBibTeXDownload
107Distributed Search Trees: Fault Tolerance in an Asynchronous Environment. Konrad Schlude, Eljas Soisalon-Soininen, Peter Widmayer. Theory Comput. Syst. (36): 611-629 (2003). Web SearchBibTeXDownload
2002
106Online train disposition: to wait or not to wait?. Luzi Anderegg, Paolo Penna, Peter Widmayer. Electr. Notes Theor. Comput. Sci. (66): 32-41 (2002). Web SearchBibTeXDownload
105Server Placements, Roman Domination and other Dominating Set Variants. Aris Pagourtzis, Paolo Penna, Konrad Schlude, Kathleen Steinhöfel, David Scot Taylor, Peter Widmayer. IFIP TCS 2002, 280-291. Web SearchBibTeX
104Distributed Highly Available Search Trees. Konrad Schlude, Eljas Soisalon-Soininen, Peter Widmayer. SIROCCO 2002, 259-274. Web SearchBibTeX
103Amortized Complexity of Bulk Updates in AVL-Trees. Eljas Soisalon-Soininen, Peter Widmayer. SWAT 2002, 439-448. Web SearchBibTeXDownload
102Progressive Merge Join: A Generic and Non-blocking Sort-based Join Algorithm. Jens-Peter Dittrich, Bernhard Seeger, David Scot Taylor, Peter Widmayer. VLDB 2002, 299-310. Cited by 51Web SearchBibTeXDownload
2001
101Relaxed Balance Using Standard Rotations. Kim S. Larsen, Eljas Soisalon-Soininen, Peter Widmayer. Algorithmica (31): 501-512 (2001). Web SearchBibTeXDownload
100Inapproximability Results for Guarding Polygons and Terrains. Stephan Eidenbenz, Christoph Stamm, Peter Widmayer. Algorithmica (31): 79-113 (2001). Web SearchBibTeXDownload
99Finding the Most Vital Node of a Shortest Path. Enrico Nardelli, Guido Proietti, Peter Widmayer. COCOON 2001, 278-287. Web SearchBibTeXDownload
98An Approximation Algorithm for MINIMUM CONVEX COVER with Logarithmic Performance Guarantee. Stephan Eidenbenz, Peter Widmayer. ESA 2001, 333-344. Web SearchBibTeXDownload
97Job Shop Scheduling with Unit Length Tasks: Bounds and Algorithms. Juraj Hromkovic, Tobias Mömke, Peter Widmayer, Peter Widmayer. ICTCS 2001, 90-106. Web SearchBibTeXDownload
96A faster computation of the most vital edge of a shortest path. Enrico Nardelli, Guido Proietti, Peter Widmayer. Inf. Process. Lett. (79): 81-85 (2001). Web SearchBibTeXDownload
95Virtual Geoexploration: Concepts and Design Choices. Renato Pajarola, Peter Widmayer. Int. J. Comput. Geometry Appl. (11): 1-14 (2001). Web SearchBibTeXDownload
94On the Complexity of Train Assignment Problems. Thomas Erlebach, Martin Gantenbein, Daniel Hürlimann, Gabriele Neyer, Aris Pagourtzis, Paolo Penna, Konrad Schlude, Kathleen Steinhöfel, David Scot Taylor, Peter Widmayer. ISAAC 2001, 390-402. Web SearchBibTeXDownload
93Finding All the Best Swaps of a Minimum Diameter Spanning Tree Under Transient Edge Failures. Enrico Nardelli, Guido Proietti, Peter Widmayer. J. Graph Algorithms Appl. (5): 39-57 (2001). Web SearchBibTeXDownload
92Pattern Formation by Anonymous Robots Without Chirality. Paola Flocchini, Giuseppe Prencipe, Nicola Santoro, Peter Widmayer. SIROCCO 2001, 147-162. Web SearchBibTeX
91Gathering of Asynchronous Oblivious Robots with Limited Visibility. Paola Flocchini, Giuseppe Prencipe, Nicola Santoro, Peter Widmayer. STACS 2001, 247-258. Web SearchBibTeXDownload
2000
90Maintaining a Minimum Spanning Tree Under Transient Node Failures. Enrico Nardelli, Guido Proietti, Peter Widmayer. ESA 2000, 346-355. Web SearchBibTeXDownload
89An image compression method for spatial search. Renato Pajarola, Peter Widmayer. IEEE Transactions on Image Processing (9): 357-365 (2000). Web SearchBibTeXDownload
88Virtual reality and dynamic statistical graphics: A bidirectional link in a heterogeneous, distributed computing environment. Martin Schneider, Christoph Stamm, Jürgen Symanzik, Peter Widmayer. PDPTA 2000. Web SearchBibTeX
87Approximation Algorithms for Clustering to Minimize the Sum of Diameters. Srinivas Doddi, Madhav V. Marathe, S. S. Ravi, David Scot Taylor, Peter Widmayer. SWAT (7): 185-203 (2000). Web SearchBibTeXDownload
1999
86How to Swap a Failing Edge of a Single Source Shortest Paths Tree. Enrico Nardelli, Guido Proietti, Peter Widmayer. COCOON 1999, 144-153. Web SearchBibTeXDownload
85Class Steiner Trees and VLSI-design. Edmund Ihler, Gabriele Reich, Peter Widmayer. Discrete Applied Mathematics (90): 173-194 (1999). Web SearchBibTeXDownload
84The Bulk Index Join: A Generic Approach to Processing Non-Equijoins. Jochen Van den Bercken, Bernhard Seeger, Peter Widmayer. ICDE 1999, 257. Cited by 9Web SearchBibTeXDownload
83Hard Tasks for Weak Robots: The Role of Common Knowledge in Pattern Formation by Autonomous Mobile Robots. Paola Flocchini, Giuseppe Prencipe, Nicola Santoro, Peter Widmayer. ISAAC 1999, 93-102. Web SearchBibTeXDownload
82Chorochronos: A Research Network for Spatiotemporal Database Systems. 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. SIGMOD Record (28): 12-21 (1999). Cited by 2Web SearchBibTeXDownload
81Concurrency and Recovery in Full-Text Indexing. Eljas Soisalon-Soininen, Peter Widmayer. SPIRE/CRIWG 1999, 192-198. Web SearchBibTeXDownload
80Introduction: Distributed Data & Structures 2. Yuri Breitbart, Sajal K. Das, Nicola Santoro, Peter Widmayer. WDAS 1999. Web SearchBibTeX
1998
79Inapproximability of some art gallery problems. Stephan Eidenbenz, Christoph Stamm, Peter Widmayer. CCCG 1998. Web SearchBibTeXDownload
78A Prototype System for Light Propagation in Terrains. Christoph Stamm, Stephan Eidenbenz, Michael Beck, Peter Stucki, Peter Widmayer. Computer Graphics International 1998, 103. Web SearchBibTeXDownload
77Finding All the Best Swaps of a Minimum Diameter Spanning Tree under Transient Edge Failures. Enrico Nardelli, Guido Proietti, Peter Widmayer. ESA 1998, 55-66. Web SearchBibTeXDownload
76Positioning Guards at Fixed Height Above a Terrain - An Optimum Inapproximability Result. Stephan Eidenbenz, Christoph Stamm, Peter Widmayer. ESA 1998, 187-198. Web SearchBibTeXDownload
75The Alps at Your Fingertips: Virtual Reality and Geoinformation Systems. Renato Pajarola, Thomas Ohler, Peter Stucki, Kornel Szabo, Peter Widmayer. ICDE 1998, 550-557. Web SearchBibTeXDownload
74Finding the Detour-Critical Edge of a Shortest Path Between Two Nodes. Enrico Nardelli, Guido Proietti, Peter Widmayer. Inf. Process. Lett. (67): 51-54 (1998). Web SearchBibTeXDownload
73An Inherent Bottleneck in Distributed Counting. Roger Wattenhofer, Peter Widmayer. J. Parallel Distrib. Comput. (49): 135-145 (1998). Web SearchBibTeXDownload
72The counting pyramid: an adaptive distributed counting scheme. Roger Wattenhofer, Peter Widmayer. SIROCCO 1998, 145-157. Web SearchBibTeX
71A Unified Analysis of Distributed Counting with Queueing Theory. Roger Wattenhofer, Peter Widmayer. WDAS 1998, 84-97. Web SearchBibTeX
70Introduction: Distributed Data and Structures 1. Nicola Santoro, Peter Widmayer. WDAS 1998. Web SearchBibTeX
1997
69Relaxed Balancing in Search Trees. Eljas Soisalon-Soininen, Peter Widmayer. Advances in Algorithms, Languages, and Complexity 1997, 267-283. Web SearchBibTeX
68Singularities Make Spatial Join Scheduling Hard. Gabriele Neyer, Peter Widmayer. ISAAC 1997, 293-302. Web SearchBibTeXDownload
67An Inherent Bottleneck in Distributed Counting. Roger Wattenhofer, Peter Widmayer. PODC 1997, 159-167. Web SearchBibTeXDownload
66Space-Filling Curves and Their Use in the Design of Geometric Data Structures. Tetsuo Asano, Desh Ranjan, Thomas Roos, Emo Welzl, Peter Widmayer. Theor. Comput. Sci. (181): 3-15 (1997). Web SearchBibTeXDownload
65A Generic Approach to Bulk Loading Multidimensional Index Structures. Jochen Van den Bercken, Bernhard Seeger, Peter Widmayer. VLDB 1997, 406-415. Cited by 130Web SearchBibTeXDownload
64Relaxed Balance through Standard Rotations. Kim S. Larsen, Eljas Soisalon-Soininen, Peter Widmayer. WADS 1997, 450-461. Web SearchBibTeXDownload
1996
63Space Filling Curves versus Random Walks. Edouard Bugnion, Thomas Roos, Roger Wattenhofer, Peter Widmayer. Algorithmic Foundations of Geographic Information Systems 1996, 199-211. Web SearchBibTeXDownload
62Spatial Data Structures: Concepts and Design Choices. Jürg Nievergelt, Peter Widmayer. Algorithmic Foundations of Geographic Information Systems 1996, 153-197. Web SearchBibTeXDownload
61Spatial Indexing into Compressed Raster Images: How to Answer Range Queries Without Decompression. Renato Pajarola, Peter Widmayer. IW-MMDBMS 1996, 94-100. Web SearchBibTeX
60Enclosing a Set of Objects by Two Minimum Area Rectangles. Bruno Becker, Paolo Giulio Franciosa, Stephan Gschwind, Stefano Leonardi, Thomas Ohler, Peter Widmayer. J. Algorithms (21): 520-541 (1996). Web SearchBibTeXDownload
59An Asymptotically Optimal Multiversion B-Tree. Bruno Becker, Stephan Gschwind, Thomas Ohler, Bernhard Seeger, Peter Widmayer. VLDB J. (5): 264-275 (1996). Cited by 228Web SearchBibTeXDownload
1995
58Binary Space Partitions for Sets of Hyperrectangles. Viet Hai Nguyen, Peter Widmayer. ASIAN 1995, 59-72. Web SearchBibTeXDownload
57On Optimal Cuts of Hyperrectangles. Fabrizio d'Amore, Viet Hai Nguyen, Thomas Roos, Peter Widmayer. Computing (55): 191-206 (1995). Web SearchBibTeXDownload
56Space Filling Curves and Their Use in the Design of Geometric Data Structures. Tetsuo Asano, Desh Ranjan, Thomas Roos, Emo Welzl, Peter Widmayer. LATIN 1995, 36-48. Web SearchBibTeXDownload
55Book reviews. Christopher A. Badurek, J. C. Sager, Rasiah Loganantharaj, Angela Ralli, Jason S. Priebe, Robert E. Frederking, Danny Jones, John S. White, Gordon D. A. Brown, Graham Russell. Math. Meth. of OR (41): 121-124 (1995). Web SearchBibTeXDownload
54Balanced Distributed Search Trees Do Not Exist. Brigitte Kröll, Peter Widmayer. WADS 1995, 50-61. Web SearchBibTeXDownload
1994
53A Data Structure for Approximate String Searching. Thomas Roos, Fei Shi, Peter Widmayer. HICSS (5) 1994, 45-46. Web SearchBibTeX
52VisTool: A Visualization Tool for Spatial Access Structures. Viet Hai Nguyen, Thomas Ohler, Peter Widmayer. IGIS 1994, 274-287. Web SearchBibTeXDownload
51k-Violation Linear Programming. Thomas Roos, Peter Widmayer. Inf. Process. Lett. (52): 109-114 (1994). Web SearchBibTeXDownload
50Distributing a Search Tree Among a Growing Number of Processors. Brigitte Kröll, Peter Widmayer. SIGMOD Conference 1994, 265-276. Web SearchBibTeXDownload
1993
49Balanced Cuts of a Set of Hyperrectangles. Viet Hai Nguyen, Thomas Roos, Peter Widmayer. CCCG 1993, 121-126. Web SearchBibTeX
48Geographic Information Systems: An Example. Thomas Ohler, Peter Widmayer. CISM - Advances in Database Systems 1993, 365-377. Web SearchBibTeX
47Data Structures and Algorithms for Geographic Information Systems: Selected Topics. Thomas Ohler, Peter Widmayer. CISM - Advances in Database Systems 1993, 353-364. Web SearchBibTeX
46A Brief Tutorial Introduction to Data Structures for Geometric Databases. Thomas Ohler, Peter Widmayer. CISM - Advances in Database Systems 1993, 329-351. Web SearchBibTeX
45Guard Files: Stabbing and Intersection Queries on Fat Spatial Objects. Jürg Nievergelt, Peter Widmayer. Comput. J. (36): 107-116 (1993). Web SearchBibTeXDownload
44An Optimal Algorithm for Computing a Best Cut of a Set of Hyperrectangles. Fabrizio d'Amore, Thomas Roos, Peter Widmayer. ICCG 1993, 215-224. Web SearchBibTeX
43Towards an Analysis of Range Query Performance in Spatial Data Structures. Bernd-Uwe Pagel, Hans-Werner Six, Heinrich Toben, Peter Widmayer. PODS 1993, 214-221. Web SearchBibTeXDownload
42On Optimal Multiversion Access Structures. Bruno Becker, Stephan Gschwind, Thomas Ohler, Bernhard Seeger, Peter Widmayer. SSD 1993, 123-141. Cited by 62Web SearchBibTeXDownload
1992
41Spatial Access Structures for Geometric Databases. Hans-Werner Six, Peter Widmayer. Data Structures and Efficient Algorithms 1992, 214-232. Web SearchBibTeXDownload
40Enclosing Many Boxes by an Optimal Pair of Boxes. Bruno Becker, Paolo Giulio Franciosa, Stephan Gschwind, Thomas Ohler, Gerald Thiemt, Peter Widmayer. STACS 1992, 475-486. Web SearchBibTeXDownload
1991
39Anbindung einer rämlich clusternden Zugriffstruktur für geometrische Attribute an ein Standard-Datenbanksystem am Beispiel von Oracle. Andreas Henrich, Andreas Hilbert, Hans-Werner Six, Peter Widmayer. BTW 1991, 161-177. Web SearchBibTeX
38Datenstrukturen für Geodatenbanken. Peter Widmayer. Entwicklungstendenzen bei Datenbanksystemen 1991, 317-361. Web SearchBibTeX
37Spatial Priority Search: An Access Technique for Scaleless Maps. Bruno Becker, Hans-Werner Six, Peter Widmayer. SIGMOD Conference 1991, 128-137. Web SearchBibTeXDownload
36An Optimal Algorithm for Approximating a Set of Rectangles by Two Minimum Area Rectangles. Bruno Becker, Paolo Giulio Franciosa, Stephan Gschwind, Thomas Ohler, Gerald Thiemt, Peter Widmayer. Workshop on Computational Geometry 1991, 13-25. Web SearchBibTeXDownload
35On Shortest Networks for Classes of Points in the Plane. Edmund Ihler, Gabriele Reich, Peter Widmayer. Workshop on Computational Geometry 1991, 103-111. Web SearchBibTeXDownload
1990
34Maßstabsunabhängige Verwaltung von Landschaftsdaten. Bruno Becker, Hans-Werner Six, Peter Widmayer. GI Jahrestagung (2) 1990, 487-496. Web SearchBibTeX
33Ein Vorschlag zur maßstabsunabhängigen Verwaltung von Landschaftsdaten. Peter Widmayer, Bruno Becker. Grundlagen von Datenbanken 1990, 95-96. Web SearchBibTeX
32The R-File: An Efficient Access Structure for Proximity Queries. Andreas Hutflesz, Hans-Werner Six, Peter Widmayer. ICDE 1990, 372-379. Web SearchBibTeXDownload
31On the Power of Safe Locking. Georg Lausen, Eljas Soisalon-Soininen, Peter Widmayer. J. Comput. Syst. Sci. (40): 269-288 (1990). Web SearchBibTeXDownload
30Distributed Function Evaluation in the Presence of Transmission Faults. Nicola Santoro, Peter Widmayer. SIGAL International Symposium on Algorithms 1990, 358-367. Web SearchBibTeXDownload
1989
29Räumliche Suche in geometrischen Datenbanken. Peter Widmayer. Grundlagen von Datenbanken 1989. Web SearchBibTeX
28Time is Not a Healer. Nicola Santoro, Peter Widmayer. STACS 1989, 304-313. Web SearchBibTeXDownload
27The LSD tree: Spatial Access to Multidimensional Point and Nonpoint Objects. Andreas Henrich, Hans-Werner Six, Peter Widmayer. VLDB 1989, 45-53. Web SearchBibTeXDownload
26Beyond Steiner's Problem: A VLSI Oriented Generalization. Gabriele Reich, Peter Widmayer. WG 1989, 196-210. Web SearchBibTeXDownload
25Paging Binary Trees with External Balancing. Andreas Henrich, Hans-Werner Six, Peter Widmayer. WG 1989, 260-276. Web SearchBibTeXDownload
1988
24The Twin Grid File: A Nearly Space Optimal Index Structure. Andreas Hutflesz, Hans-Werner Six, Peter Widmayer. EDBT 1988, 352-363. Web SearchBibTeXDownload
23Spatial Searching in Geometric Databases. Hans-Werner Six, Peter Widmayer. ICDE 1988, 496-503. Web SearchBibTeXDownload
22Globally Order Preserving Multidimensional Linear Hashing. Andreas Hutflesz, Hans-Werner Six, Peter Widmayer. ICDE 1988, 572-579. Web SearchBibTeXDownload
21Hole Problems for Rectangles in the Plane. Gregory J. E. Rawlins, Peter Widmayer, Derick Wood. SIAM J. Discrete Math. (1): 86-97 (1988). Web SearchBibTeXDownload
20Twin Grid Files: Space Optimizing Access Schemes. Andreas Hutflesz, Hans-Werner Six, Peter Widmayer. SIGMOD Conference 1988, 183-190. Web SearchBibTeXDownload
19Twin Grid Files: A Performance Evaluation. Andreas Hutflesz, Peter Widmayer, Hans-Werner Six. Workshop on Computational Geometry 1988, 15-24. Web SearchBibTeXDownload
1987
18Rectilinear Shortest Paths and Minimum Spanning Trees in the Presence of Rectilinear Obstacles. Ying-Fung Wu, Peter Widmayer, Martine D. F. Schlag, C. K. Wong. IEEE Trans. Computers (36): 321-331 (1987). Web SearchBibTeXDownload
17Time- and Space-Optimal Contour Computation for a Set of Rectangles. Peter Widmayer, Derick Wood. Inf. Process. Lett. (24): 335-338 (1987). Web SearchBibTeXDownload
16On Some Distance Problems in Fixed Orientations. Peter Widmayer, Ying-Fung Wu, C. K. Wong. SIAM J. Comput. (16): 728-746 (1987). Web SearchBibTeXDownload
15On the Analysis of Grid Structures for Spatial Objects of Non-Zero Size. Thomas Rottke, Hans-Werner Six, Peter Widmayer. WG 1987, 94-105. Web SearchBibTeXDownload
1986
14A Faster Approximation Algorithm for the Steiner Problem in Graphs. Kurt Mehlhorn, Peter Widmayer, C. K. Wong. Acta Inf. (23): 223-229 (1986). Web SearchBibTeXDownload
13Hintergrundspeicherstrukturen für ausgedehnte Objekte. Hans-Werner Six, Peter Widmayer. GI Jahrestagung (1) 1986, 538-552. Web SearchBibTeX
12Towards Online Schedulers Based on Pre-Analysis Locking. Georg Lausen, Eljas Soisalon-Soininen, Peter Widmayer. ICDT 1986, 242-259. Web SearchBibTeXDownload
11Pre-analysis Locking. Georg Lausen, Eljas Soisalon-Soininen, Peter Widmayer. Information and Control (70): 193-215 (1986). Web SearchBibTeXDownload
10Modellversuch computergestützter Informatikunterricht: Algorithmen und Datenstrukturen. Thomas Ottmann, Peter Widmayer. INFOS 1986, 420-431. Web SearchBibTeX
9An Approximation Algorithms for Steiner's Problem in Graphs. Peter Widmayer. WG 1986, 17-28. Web SearchBibTeXDownload
1985
8A fast algorithm for the Boolean masking problem. Thomas Ottmann, Peter Widmayer, Derick Wood. Computer Vision, Graphics, and Image Processing (30): 249-268 (1985). Web SearchBibTeXDownload
7An Optimal Algorithm for the Maximum Alignment of Terminals. Peter Widmayer, C. K. Wong. Inf. Process. Lett. (20): 75-82 (1985). Web SearchBibTeXDownload
6Distance problems in computational geometry with fixed orientations. Peter Widmayer, Ying-Fung Wu, C. K. Wong. Symposium on Computational Geometry 1985, 186-195. Web SearchBibTeXDownload
5Pre-Analysis Locking: A Safe and Deadlock Free Locking Policy. Georg Lausen, Eljas Soisalon-Soininen, Peter Widmayer. VLDB 1985, 270-281. Web SearchBibTeXDownload
1984
4On the Complexity of Concurrency Control by Locking in Distributed Database Systems. Eljas Soisalon-Soininen, Peter Widmayer. Information and Control (60): 103-108 (1984). Web SearchBibTeXDownload
3Solving Visibility Problems by Using Skeleton Structures. Thomas Ottmann, Peter Widmayer. MFCS 1984, 459-470. Web SearchBibTeXDownload
2Maximal Concurrency by Locking. Georg Lausen, Eljas Soisalon-Soininen, Peter Widmayer. PODS 1984, 38-44. Web SearchBibTeXDownload
1983
1On translating a set of line segments. Thomas Ottmann, Peter Widmayer. Computer Vision, Graphics, and Image Processing (24): 382-389 (1983). Web SearchBibTeXDownload
from DBLP and Google Scholar
References
1. ^ SIGMOD/PODS 2003 Conference - Retrieved 2011-03-19 - details
Developed by the Database Group at the University of Wisconsin and Yahoo! Research