Peter Widmayer

264 papers A* 19A 18B 47C 22Misc 6Journal 78Unranked 51

Year	Rank	Type	Title / Venue / Authors
2018	J	`jnl`	Robust optimization in the presence of uncertainty: A generic approach. J. Comput. Syst. Sci. Joachim M. Buhmann, Alexey Gronskiy, Matús Mihalák, Tobias Pröger, Rastislav Srámek, Peter Widmayer
2018	—	`conf`	Sequence Hypergraphs: Paths, Flows, and Cuts. Adventures Between Lower Bounds and Higher Altitudes Katerina Böhmová, Jérémie Chalopin, Matús Mihalák, Guido Proietti, Peter Widmayer
2017	J	`jnl`	A better scoring model for de novo peptide sequencing: the symmetric difference between explained and measured masses. Algorithms Mol. Biol. Thomas Tschager, Simon Rösch, Ludovic Gillet, Peter Widmayer
2016	C	`conf`	A Better Scoring Model for De Novo Peptide Sequencing: The Symmetric Difference Between Explained and Measured Masses. WABI Ludovic Gillet, Simon Rösch, Thomas Tschager, Peter Widmayer
2016	J	`jnl`	Approximately Counting Approximately-Shortest Paths in Directed Acyclic Graphs. Theory Comput. Syst. Matús Mihalák, Rastislav Srámek, Peter Widmayer
2016	B	`conf`	Bribeproof Mechanisms for Two-Values Domains. SAGT Matús Mihalák, Paolo Penna, Peter Widmayer
2016	B	`conf`	Sequence Hypergraphs. WG Katerina Böhmová, Jérémie Chalopin, Matús Mihalák, Guido Proietti, Peter Widmayer
2015	C	`ed.`	Algorithms and Complexity - 9th International Conference, CIAC 2015, Paris, France, May 20-22, 2015. Proceedings CIAC Vangelis Th. Paschos, Peter Widmayer
2015	J	`jnl`	An O(n Algorithmica Andreas Emil Feldmann, Peter Widmayer
2015	J	`jnl`	Bribeproof mechanisms for two-values domains. CoRR Matús Mihalák, Paolo Penna, Peter Widmayer
2015	J	`jnl`	FUN with algorithms. Theor. Comput. Sci. Peter Widmayer
2015	J	`jnl`	Mapping Simple Polygons: The Power of Telling Convex from Reflex. ACM Trans. Algorithms Jérémie Chalopin, Shantanu Das, Yann Disser, Matús Mihalák, Peter Widmayer
2015	B	`conf`	Recurring Comparison Faults: Sorting and Finding the Minimum. FCT Barbara Geissmann, Matús Mihalák, Peter Widmayer
2015	C	`conf`	Robust Routing in Urban Public Transportation: Evaluating Strategies that Learn From the Past. ATMOS Katerina Böhmová, Matús Mihalák, Peggy Neubert, Tobias Pröger, Peter Widmayer
2015	J	`jnl`	Selecting vertex disjoint paths in plane graphs. Networks Holger Flier, Matús Mihalák, Peter Widmayer, Anna Zych, Yusuke Kobayashi, Anita Schöbel
2014	J	`jnl`	Combinatorial Optimization and Applications. Theor. Comput. Sci. Peter Widmayer, Yin-Feng Xu, Binhai Zhu
2014	—	`conf`	Data Delivery by Energy-Constrained Mobile Agents on a Line. ICALP (2) Jérémie Chalopin, Riko Jacob, Matús Mihalák, Peter Widmayer
2014	Misc	`ed.`	Fun with Algorithms - 7th International Conference, FUN 2014, Lipari Island, Sicily, Italy, July 1-3, 2014. Proceedings FUN Alfredo Ferro, Fabrizio Luccio, Peter Widmayer
2014	J	`jnl`	Highlights from ACM SIGSPATIAL GIS 2013: the 21st ACM SIGSPATIAL International Conference on Advances in Geographic Information Systems: (Orlando, Florida, November 5-8, 2013). ACM SIGSPATIAL Special Peer Kröger, John Krumm, Peter Widmayer
2014	A*	`conf`	Improved bounds for the conflict-free chromatic art gallery problem. SoCG Andreas Bärtschi, Subir Kumar Ghosh, Matús Mihalák, Thomas Tschager, Peter Widmayer
2014	J	`jnl`	Mapping a polygon with holes using a compass. Theor. Comput. Sci. Yann Disser, Subir Kumar Ghosh, Matús Mihalák, Peter Widmayer
2014	C	`conf`	Rectilinear Shortest Path and Rectilinear Minimum Spanning Tree with Neighborhoods. ISCO Yann Disser, Matús Mihalák, Sandro Montanari, Peter Widmayer
2014	J	`jnl`	The Presburger Award 2015 - Call for Nominations. Bull. EATCS Peter Widmayer
2013	—	`ed.`	21st SIGSPATIAL International Conference on Advances in Geographic Information Systems, SIGSPATIAL 2013, Orlando, FL, USA, November 5-8, 2013 SIGSPATIAL/GIS Craig A. Knoblock, Markus Schneider, Peer Kröger, John Krumm, Peter Widmayer
2013	C	`ed.`	Combinatorial Optimization and Applications - 7th International Conference, COCOA 2013, Chengdu, China, December 12-14, 2013, Proceedings COCOA Peter Widmayer, Yinfeng Xu, Binhai Zhu
2013	J	`jnl`	Corner cuts are close to optimal: From solid grids to polygons and back. Discret. Appl. Math. Andreas Emil Feldmann, Shantanu Das, Peter Widmayer
2013	B	`conf`	Counting Approximately-Shortest Paths in Directed Acyclic Graphs. WAOA Matús Mihalák, Rastislav Srámek, Peter Widmayer
2013	C	`conf`	Data Delivery by Energy-Constrained Mobile Agents. ALGOSENSORS Jérémie Chalopin, Shantanu Das, Matús Mihalák, Paolo Penna, Peter Widmayer
2013	J	`jnl`	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). ACM SIGSPATIAL Special Peer Kröger, Egemen Tanin, Peter Widmayer
2013	B	`conf`	Interval Selection with Machine-Dependent Intervals. WADS Katerina Böhmová, Yann Disser, Matús Mihalák, Peter Widmayer
2013	J	`jnl`	Mapping Simple Polygons: How Robots Benefit from Looking Back. Algorithmica Jérémie Chalopin, Shantanu Das, Yann Disser, Matús Mihalák, Peter Widmayer
2013	C	`conf`	Polygon-Constrained Motion Planning Problems. ALGOSENSORS Davide Bilò, Yann Disser, Luciano Gualà, Matús Mihalák, Guido Proietti, Peter Widmayer
2013	C	`conf`	Robust Routing in Urban Public Transportation: How to Find Reliable Journeys Based on Past Observations. ATMOS Katerina Böhmová, Matús Mihalák, Tobias Pröger, Rastislav Srámek, Peter Widmayer
2013	A	`conf`	Robust optimization in the presence of uncertainty. ITCS Joachim M. Buhmann, Matús Mihalák, Rastislav Srámek, Peter Widmayer
2013	J	`jnl`	Simple agents learn to find their way: An introduction on mapping polygons. Discret. Appl. Math. Jérémie Chalopin, Shantanu Das, Yann Disser, Matús Mihalák, Peter Widmayer
2013	—	`conf`	To Be Uncertain Is Uncomfortable, But to Be Certain Is Ridiculous. ICALP (2) Peter Widmayer
2012	—	`book`	Algorithmen und Datenstrukturen, 5. Auflage. Thomas Ottmann, Peter Widmayer
2012	B	`conf`	Combinatorial Optimization with Noisy Inputs: How Can We Separate the Wheat from the Chaff? WALCOM Peter Widmayer
2012	C	`conf`	Mapping Polygons with Agents That Measure Angles. WAFR Yann Disser, Matús Mihalák, Peter Widmayer
2012	C	`conf`	Mapping a Polygon with Holes Using a Compass. ALGOSENSORS Yann Disser, Subir Kumar Ghosh, Matús Mihalák, Peter Widmayer
2012	B	`ed.`	Mathematical Foundations of Computer Science 2012 - 37th International Symposium, MFCS 2012, Bratislava, Slovakia, August 27-31, 2012. Proceedings MFCS Branislav Rovan, Vladimiro Sassone, Peter Widmayer
2012	J	`jnl`	Reconstructing visibility graphs with simple robots. Theor. Comput. Sci. Davide Bilò, Yann Disser, Matús Mihalák, Subhash Suri, Elias Vicari, Peter Widmayer
2012	—	`ed.`	SIGSPATIAL 2012 International Conference on Advances in Geographic Information Systems (formerly known as GIS), SIGSPATIAL'12, Redondo Beach, CA, USA, November 7-9, 2012 SIGSPATIAL/GIS Isabel F. Cruz, Craig A. Knoblock, Peer Kröger, Egemen Tanin, Peter Widmayer
2012	J	`jnl`	Simple Agents Learn to Find Their Way: An Introduction on Mapping Polygons CoRR Jérémie Chalopin, Shantanu Das, Yann Disser, Matús Mihalák, Peter Widmayer
2012	A	`conf`	Sort-based query-adaptive loading of R-trees. CIKM Daniar Achakeev, Bernhard Seeger, Peter Widmayer
2011	J	`jnl`	A Distributed Algorithm for Finding All Best Swap Edges of a Minimum-Diameter Spanning Tree. IEEE Trans. Dependable Secur. Comput. Beat Gfeller, Nicola Santoro, Peter Widmayer
2011	J	`jnl`	A polygon is determined by its angles. Comput. Geom. Yann Disser, Matús Mihalák, Peter Widmayer
2011	A	`conf`	An $\mathcal{O}(n^4)$ Time Algorithm to Compute the Bisection Width of Solid Grid Graphs. ESA Andreas Emil Feldmann, Peter Widmayer
2011	A	`conf`	DISC 2011 Invited Lecture: Polygon Reconstruction with Little Information: An Example for the Power of Simple Micro-robots. DISC Peter Widmayer
2011	J	`jnl`	How to Guard a Graph? Algorithmica Fedor V. Fomin, Petr A. Golovach, Alexander Hall, Matús Mihalák, Elias Vicari, Peter Widmayer
2011	B	`conf`	Maximum Independent Set in 2-Direction Outersegment Graphs. WG Holger Flier, Matús Mihalák, Peter Widmayer, Anna Zych
2011	J	`jnl`	On robust online scheduling algorithms. J. Sched. Michael Gatto, Peter Widmayer
2011	B	`conf`	On the Complexity of the Metric TSP under Stability Considerations. SOFSEM Matús Mihalák, Marcel Schöngens, Rastislav Srámek, Peter Widmayer
2011	—	`ch.`	Optimal Placement of Ad Hoc Devices Under a VCG-Style Routing Protocol. Theoretical Aspects of Distributed Computing in Sensor Networks Peter Widmayer, Luzi Anderegg, Stephan J. Eidenbenz, Leon Peeters
2011	B	`conf`	Restricted Cuts for Bisections in Solid Grids: A Proof via Polygons. WG Andreas Emil Feldmann, Shantanu Das, Peter Widmayer
2011	A	`conf`	Telling convex from reflex allows to map a polygon. STACS Jérémie Chalopin, Shantanu Das, Yann Disser, Matús Mihalák, Peter Widmayer
2010	J	`jnl`	Approximate Shortest Paths Guided by a Small Index. Algorithmica Jörg Derungs, Riko Jacob, Peter Widmayer
2010	J	`jnl`	Computing All Best Swaps for Minimum-Stretch Tree Spanners. J. Graph Algorithms Appl. Shantanu Das, Beat Gfeller, Peter Widmayer
2010	J	`jnl`	Discovery of network properties with all-shortest-paths queries. Theor. Comput. Sci. Davide Bilò, Thomas Erlebach, Matús Mihalák, Peter Widmayer
2010	C	`conf`	How Simple Robots Benefit from Looking Back. CIAC Jérémie Chalopin, Shantanu Das, Yann Disser, Matús Mihalák, Peter Widmayer
2010	—	`conf`	Reconstructing a Simple Polygon from Its Angles. SWAT Yann Disser, Matús Mihalák, Peter Widmayer
2010	A	`conf`	Rendezvous of Mobile Agents in Directed Graphs. DISC Jérémie Chalopin, Shantanu Das, Peter Widmayer
2010	—	`conf`	Simple Cuts Are Fast and Good: Optimum Right-Angled Cuts in Solid Grids. COCOA (1) Andreas Emil Feldmann, Shantanu Das, Peter Widmayer
2010	C	`conf`	Vertex Disjoint Paths for Dispatching in Railways. ATMOS Holger Flier, Matús Mihalák, Anita Schöbel, Peter Widmayer, Anna Zych
2009	B	`conf`	How to Sort a Train. MFCS Peter Widmayer
2009	—	`ch.`	Online Train Disposition: To Wait or Not to Wait? Robust and Online Large-Scale Optimization Luzi Anderegg, Paolo Penna, Peter Widmayer
2009	Misc	`conf`	Optimal Transitions for Targeted Protein Quantification: Best Conditioned Submatrix Selection. COCOON Rastislav Srámek, Bernd Fischer, Elias Vicari, Peter Widmayer
2009	—	`conf`	Pseudonyms in Cost-Sharing Games. WINE Paolo Penna, Florian Schoppmann, Riccardo Silvestri, Peter Widmayer
2009	B	`conf`	Reconstructing Visibility Graphs with Simple Robots. SIROCCO Davide Bilò, Yann Disser, Matús Mihalák, Subhash Suri, Elias Vicari, Peter Widmayer
2009	—	`ch.`	Shunting for Dummies: An Introductory Algorithmic Survey. Robust and Online Large-Scale Optimization Michael Gatto, Jens Maue, Matús Mihalák, Peter Widmayer
2009	J	`jnl`	Single machine batch scheduling with release times. J. Comb. Optim. Beat Gfeller, Leon Peeters, Birgitta Weber, Peter Widmayer
2009	B	`conf`	Stability of Networks in Stretchable Graphs. SIROCCO Davide Bilò, Michael Gatto, Luciano Gualà, Guido Proietti, Peter Widmayer
2009	J	`jnl`	Strongly polynomial-time truthful mechanisms in one shot. Theor. Comput. Sci. Paolo Penna, Guido Proietti, Peter Widmayer
2008	C	`ed.`	8th Workshop on Algorithmic Approaches for Transportation Modeling, Optimization, and Systems, ATMOS 2008, Karlsruhe, Germany, September 18, 2008 ATMOS Matteo Fischetti, Peter Widmayer
2008	C	`conf`	ATMOS 2008 Abstracts Collection - 8th Workshop on Algorithmic Approaches for Transportation Modeling, Optimization, and Systems. ATMOS Matteo Fischetti, Peter Widmayer
2008	C	`conf`	ATMOS 2008 Preface -- 8th Workshop on Algorithmic Approaches for Transportation Modeling, Optimization, and Systems. ATMOS Matteo Fischetti, Peter Widmayer
2008	—	`conf`	Angle Optimization in Target Tracking. SWAT Beat Gfeller, Matús Mihalák, Subhash Suri, Elias Vicari, Peter Widmayer
2008	J	`jnl`	Arbitrary pattern formation by asynchronous, anonymous, oblivious robots. Theor. Comput. Sci. Paola Flocchini, Giuseppe Prencipe, Nicola Santoro, Peter Widmayer
2008	—	`conf`	Computational Aspects of a 2-Player Stackelberg Shortest Paths Tree Game. WINE Davide Bilò, Luciano Gualà, Guido Proietti, Peter Widmayer
2008	B	`conf`	Computing Best Swaps in Optimal Tree Spanners. ISAAC Shantanu Das, Beat Gfeller, Peter Widmayer
2008	J	`jnl`	Computing all the best swap edges distributively. J. Parallel Distributed Comput. Paola Flocchini, Linda Pagli, Giuseppe Prencipe, Nicola Santoro, Peter Widmayer
2008	B	`conf`	Discovery of Network Properties with All-Shortest-Paths Queries. SIROCCO Davide Bilò, Thomas Erlebach, Matús Mihalák, Peter Widmayer
2008	J	`jnl`	Genevestigator V3: A Reference Expression Database for the Meta-Analysis of Transcriptomes. Adv. Bioinformatics Tomas Hruz, Oliver Laule, Gábor Szabó, Frans Wessendorp, Stefan Bleuler, Lukas Oertle, Peter Widmayer, Wilhelm Gruissem, Philip Zimmermann
2008	B	`conf`	How to Guard a Graph?. ISAAC Fedor V. Fomin, Petr A. Golovach, Alexander Hall, Matús Mihalák, Elias Vicari, Peter Widmayer
2008	B	`conf`	On the Hardness of Reoptimization. SOFSEM Hans-Joachim Böckenhauer, Juraj Hromkovic, Tobias Mömke, Peter Widmayer
2008	B	`conf`	Rendezvous of Mobile Agents When Tokens Fail Anytime. OPODIS Shantanu Das, Matús Mihalák, Rastislav Srámek, Elias Vicari, Peter Widmayer
2008	—	`conf`	Reoptimization of Steiner Trees. SWAT Davide Bilò, Hans-Joachim Böckenhauer, Juraj Hromkovic, Richard Královic, Tobias Mömke, Peter Widmayer, Anna Zych
2008	B	`conf`	Reoptimization of Weighted Graph and Covering Problems. WAOA Davide Bilò, Peter Widmayer, Anna Zych
2008	C	`conf`	Simple Robots in Polygonal Environments: A Hierarchy. ALGOSENSORS Jan Brunner, Matús Mihalák, Subhash Suri, Elias Vicari, Peter Widmayer
2008	J	`jnl`	Simple Robots with Minimal Sensing: From Local Visibility to Global Geometry. Int. J. Robotics Res. Subhash Suri, Elias Vicari, Peter Widmayer
2007	—	`conf`	07151 Abstracts Collection -- Geometry in Sensor Networks. Geometry in Sensor Networks Subhash Suri, Roger Wattenhofer, Peter Widmayer
2007	—	`conf`	A Combinatorial Approach to Multi-Domain Sketch Recognition. SBIM Alexander Hall, C. Pomm, Peter Widmayer
2007	A	`conf`	A Distributed Algorithm for Finding All Best Swap Edges of a Minimum Diameter Spanning Tree. DISC Beat Gfeller, Nicola Santoro, Peter Widmayer
2007	J	`jnl`	Agreement in synchronous networks with ubiquitous faults. Theor. Comput. Sci. Nicola Santoro, Peter Widmayer
2007	J	`jnl`	An Algorithmic View on OVSF Code Assignment. Algorithmica Thomas Erlebach, Riko Jacob, Matús Mihalák, Marc Nunkesser, Gábor Szabó, Peter Widmayer
2007	B	`conf`	Approximate Shortest Paths Guided by a Small Index. WADS Jörg Derungs, Riko Jacob, Peter Widmayer
2007	C	`conf`	Counting Targets with Mobile Sensors in an Unknown Environment. ALGOSENSORS Beat Gfeller, Matús Mihalák, Subhash Suri, Elias Vicari, Peter Widmayer
2007	—	`ch.`	Distributed Computing in the Presence of Mobile Faults. Handbook of Parallel Computing Nicola Santoro, Peter Widmayer
2007	—	`ed.`	Geometry in Sensor Networks, 09.04. - 13.04.2007 Geometry in Sensor Networks Subhash Suri, Roger Wattenhofer, Peter Widmayer
2007	J	`jnl`	Job Shop Scheduling with Unit Length Tasks: Bounds and Algorithms. Algorithmic Oper. Res. Juraj Hromkovic, Tobias Mömke, Kathleen Steinhöfel, Peter Widmayer
2007	B	`conf`	Locating Facilities on a Network to Minimize Their Average Service Radius. ISAAC Davide Bilò, Jörg Derungs, Luciano Gualà, Guido Proietti, Peter Widmayer
2007	J	`jnl`	On the Approximability of TSP on Local Modifications of Optimally Solved Instances. Algorithmic Oper. Res. Hans-Joachim Böckenhauer, Luca Forlizzi, Juraj Hromkovic, Joachim Kneis, Joachim Kupke, Guido Proietti, Peter Widmayer
2007	B	`conf`	On the Robustness of Graham's Algorithm for Online Scheduling. WADS Michael Gatto, Peter Widmayer
2007	C	`conf`	Optimal Placement of Ad-Hoc Devices Under a VCG-Style Routing Protocol. ALGOSENSORS Luzi Anderegg, Stephan J. Eidenbenz, Leon Peeters, Peter Widmayer
2007	J	`jnl`	PepSplice: cache-efficient search algorithms for comprehensive identification of tandem mass spectra. Bioinform. Franz F. Roos, Riko Jacob, Jonas Grossmann, Bernd Fischer, Joachim M. Buhmann, Wilhelm Gruissem, Sacha Baginsky, Peter Widmayer
2007	A*	`conf`	Simple Robots with Minimal Sensing: From Local Visibility to Global Geometry. AAAI Subhash Suri, Elias Vicari, Peter Widmayer
2007	—	`ed.`	Stochastic Algorithms: Foundations and Applications, 4th International Symposium, SAGA 2007, Zurich, Switzerland, September 13-14, 2007, Proceedings SAGA Juraj Hromkovic, Richard Královic, Marc Nunkesser, Peter Widmayer
2006	B	`conf`	Online Single Machine Batch Scheduling. MFCS Beat Gfeller, Leon Peeters, Birgitta Weber, Peter Widmayer
2006	B	`conf`	Partitioning the Nodes of a Graph to Minimize the Sum of Subgraph Radii. ISAAC Guido Proietti, Peter Widmayer
2006	—	`conf`	Reusing Optimal TSP Solutions for Locally Modified Input Instances. IFIP TCS Hans-Joachim Böckenhauer, Luca Forlizzi, Juraj Hromkovic, Joachim Kneis, Joachim Kupke, Guido Proietti, Peter Widmayer
2006	—	`conf`	Strongly Polynomial-Time Truthful Mechanisms in One Shot. WINE Paolo Penna, Guido Proietti, Peter Widmayer
2005	B	`conf`	A truthful mechanism for the non-utilitarian minimum radius spanning tree problem. SPAA Guido Proietti, Peter Widmayer
2005	J	`jnl`	Gathering of asynchronous robots with limited visibility. Theor. Comput. Sci. Paola Flocchini, Giuseppe Prencipe, Nicola Santoro, Peter Widmayer
2005	B	`conf`	Geometric Routing Without Geometry. SIROCCO Mirjam Wattenhofer, Roger Wattenhofer, Peter Widmayer
2005	B	`conf`	Majority and Unanimity in Synchronous Networks with Ubiquitous Dynamic Faults. SIROCCO Nicola Santoro, Peter Widmayer
2004	—	`conf`	A Hidden Markov Model for de Novo Peptide Sequencing. NIPS Bernd Fischer, Volker Roth, Joachim M. Buhmann, Jonas Grossmann, Sacha Baginsky, Wilhelm Gruissem, Franz F. Roos, Peter Widmayer
2004	A	`conf`	An Algorithmic View on OVSF Code Assignment. STACS Thomas Erlebach, Riko Jacob, Matús Mihalák, Marc Nunkesser, Gábor Szabó, Peter Widmayer
2004	B	`conf`	Computing All the Best Swap Edges Distributively. OPODIS Paola Flocchini, Linda Pagli, Giuseppe Prencipe, Nicola Santoro, Peter Widmayer, Tranos Zuva
2004	—	`ch.`	Geographic Information Systems. Handbook of Data Structures and Applications Bernhard Seeger, Peter Widmayer
2004	B	`conf`	Joint Base Station Scheduling. WAOA Thomas Erlebach, Riko Jacob, Matús Mihalák, Marc Nunkesser, Gábor Szabó, Peter Widmayer
2004	J	`jnl`	Nearly Linear Time Minimum Spanning Tree Maintenance for Transient Node Failures. Algorithmica Enrico Nardelli, Guido Proietti, Peter Widmayer
2004	C	`conf`	Online Delay Management on a Single Train Line. ATMOS Michael Gatto, Riko Jacob, Leon Peeters, Peter Widmayer
2004	J	`jnl`	Preface. Theor. Comput. Sci. Stephan J. Eidenbenz, Matthew Hennessy, Rafael Morales Bueno, Francisco Triguero Ruiz, Peter Widmayer, Ricardo Conejo
2004	—	`conf`	Railway Delay Management: Exploring Its Algorithmic Complexity. SWAT Michael Gatto, Björn Glaus, Riko Jacob, Leon Peeters, Peter Widmayer
2004	—	`conf`	Scheduling with Release Times and Deadlines on a Minimum Number of Machines. IFIP TCS Mark Cieliebak, Thomas Erlebach, Fabian Hennecke, Birgitta Weber, Peter Widmayer
2004	J	`jnl`	The counting pyramid: an adaptive distributed counting scheme. J. Parallel Distributed Comput. Roger Wattenhofer, Peter Widmayer
2004	J	`jnl`	Theory on the Tracks: A Selection of Railway Optimization Problems (Column: Algorithmics). Bull. EATCS Michael Gatto, Riko Jacob, Leon Peeters, Birgitta Weber, Peter Widmayer
2004	—	`conf`	Truthful Mechanisms for Generalized Utilitarian Problems. IFIP TCS Giovanna Melideo, Paolo Penna, Guido Proietti, Roger Wattenhofer, Peter Widmayer
2003	J	`jnl`	An Approximation Algorithm for Minimum Convex Cover with Logarithmic Performance Guarantee. SIAM J. Comput. Stephan J. Eidenbenz, Peter Widmayer
2003	J	`jnl`	Distributed Search Trees: Fault Tolerance in an Asynchronous Environment. Theory Comput. Syst. Konrad Schlude, Eljas Soisalon-Soininen, Peter Widmayer
2003	J	`jnl`	Evolutionary multiobjective optimization for base station transmitter placement with frequency assignment. IEEE Trans. Evol. Comput. Nicole Weicker, Gábor Szabó, Karsten Weicker, Peter Widmayer
2003	J	`jnl`	Finding the most vital node of a shortest path. Theor. Comput. Sci. Enrico Nardelli, Guido Proietti, Peter Widmayer
2003	B	`conf`	Flexible Train Rostering. ISAAC Stephan J. Eidenbenz, Aris Pagourtzis, Peter Widmayer
2003	C	`conf`	Improving Customer Proximity to Railway Stations. CIAC Evangelos Kranakis, Paolo Penna, Konrad Schlude, David Scot Taylor, Peter Widmayer
2003	A*	`conf`	On producing join results early. PODS Jens-Peter Dittrich, Bernhard Seeger, David Scot Taylor, Peter Widmayer
2003	—	`conf`	Probabilistic Protocols for Node Discovery in Ad Hoc Multi-channel Broadcast Networks. ADHOC-NOW Gustavo Alonso, Evangelos Kranakis, Cindy Sawchuk, Roger Wattenhofer, Peter Widmayer
2003	A	`conf`	Probabilistic Protocols for Node Discovery in Ad-Hoc, Single Broadcast Channel Networks. IPDPS Gustavo Alonso, Evangelos Kranakis, Roger Wattenhofer, Peter Widmayer
2003	—	`conf`	Single and Bulk Updates in Stratified Trees: An Amortized and Worst-Case Analysis. Computer Science in Perspective Eljas Soisalon-Soininen, Peter Widmayer
2003	J	`jnl`	Swapping a Failing Edge of a Single Source Shortest Paths Tree Is Good and Fast. Algorithmica Enrico Nardelli, Guido Proietti, Peter Widmayer
2003	A	`conf`	Train Routing Algorithms: Concepts, Design Choises, and Practical Considerations. ALENEX Luzi Anderegg, Stephan J. Eidenbenz, Martin Gantenbein, Christoph Stamm, David Scot Taylor, Birgitta Weber, Peter Widmayer
2002	—	`conf`	Amortized Complexity of Bulk Updates in AVL-Trees. SWAT Eljas Soisalon-Soininen, Peter Widmayer
2002	A*	`ed.`	Automata, Languages and Programming, 29th International Colloquium, ICALP 2002, Malaga, Spain, July 8-13, 2002, Proceedings ICALP Peter Widmayer, Francisco Triguero Ruiz, Rafael Morales Bueno, Matthew Hennessy, Stephan J. Eidenbenz, Ricardo Conejo
2002	B	`conf`	Distributed Highly Available Search Trees. SIROCCO Konrad Schlude, Eljas Soisalon-Soininen, Peter Widmayer
2002	C	`conf`	Online train disposition: to wait or not to wait? ATMOS Luzi Anderegg, Paolo Penna, Peter Widmayer
2002	A*	`conf`	Progressive Merge Join: A Generic and Non-blocking Sort-based Join Algorithm. VLDB Jens-Peter Dittrich, Bernhard Seeger, David Scot Taylor, Peter Widmayer
2002	—	`conf`	Server Placements, Roman Domination and other Dominating Set Variants. IFIP TCS Aris Pagourtzis, Paolo Penna, Konrad Schlude, Kathleen Steinhöfel, David Scot Taylor, Peter Widmayer
2001	J	`jnl`	A faster computation of the most vital edge of a shortest path. Inf. Process. Lett. Enrico Nardelli, Guido Proietti, Peter Widmayer
2001	A	`conf`	An Approximation Algorithm for MINIMUM CONVEX COVER with Logarithmic Performance Guarantee. ESA Stephan J. Eidenbenz, Peter Widmayer
2001	J	`jnl`	Finding All the Best Swaps of a Minimum Diameter Spanning Tree Under Transient Edge Failures. J. Graph Algorithms Appl. Enrico Nardelli, Guido Proietti, Peter Widmayer
2001	Misc	`conf`	Finding the Most Vital Node of a Shortest Path. COCOON Enrico Nardelli, Guido Proietti, Peter Widmayer
2001	A	`conf`	Gathering of Asynchronous Oblivious Robots with Limited Visibility. STACS Paola Flocchini, Giuseppe Prencipe, Nicola Santoro, Peter Widmayer
2001	J	`jnl`	Inapproximability Results for Guarding Polygons and Terrains. Algorithmica Stephan J. Eidenbenz, Christoph Stamm, Peter Widmayer
2001	—	`conf`	Job Shop Scheduling with Unit Length Tasks: Bounds and Algorithms. ICTCS Juraj Hromkovic, Kathleen Steinhöfel, Peter Widmayer
2001	B	`conf`	On the Complexity of Train Assignment Problems. ISAAC Thomas Erlebach, Martin Gantenbein, Daniel Hürlimann, Gabriele Neyer, Aris Pagourtzis, Paolo Penna, Konrad Schlude, Kathleen Steinhöfel, David Scot Taylor, Peter Widmayer
2001	B	`conf`	Pattern Formation by Anonymous Robots Without Chirality. SIROCCO Paola Flocchini, Giuseppe Prencipe, Nicola Santoro, Peter Widmayer
2001	J	`jnl`	Relaxed Balance Using Standard Rotations. Algorithmica Kim S. Larsen, Eljas Soisalon-Soininen, Peter Widmayer
2001	J	`jnl`	Virtual Geoexploration: Concepts and Design Choices. Int. J. Comput. Geom. Appl. Renato Pajarola, Peter Widmayer
2000	J	`jnl`	An image compression method for spatial search. IEEE Trans. Image Process. Renato Pajarola, Peter Widmayer
2000	—	`conf`	Approximation Algorithms for Clustering to Minimize the Sum of Diameters. SWAT Srinivas Doddi, Madhav V. Marathe, S. S. Ravi, David Scot Taylor, Peter Widmayer
2000	J	`jnl`	Approximation Algorithms for Clustering to Minimize the Sum of Diameters. Nord. J. Comput. Srinivas Doddi, Madhav V. Marathe, S. S. Ravi, David Scot Taylor, Peter Widmayer
2000	A	`conf`	Maintaining a Minimum Spanning Tree Under Transient Node Failures. ESA Enrico Nardelli, Guido Proietti, Peter Widmayer
2000	—	`ch.`	Spatial Data Structures: Concepts and Design Choices. Handbook of Computational Geometry Jürg Nievergelt, Peter Widmayer
2000	Misc	`conf`	Virtual reality and dynamic statistical graphics: A bidirectional link in a heterogeneous, distributed computing environment. PDPTA Martin Schneider, Christoph Stamm, Jürgen Symanzik, Peter Widmayer
1999	J	`jnl`	Chorochronos: A Research Network for Spatiotemporal Database Systems. SIGMOD Rec. 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
1999	J	`jnl`	Class Steiner Trees and VLSI-design. Discret. Appl. Math. Edmund Ihler, Gabriele Reich, Peter Widmayer
1999	—	`conf`	Concurrency and Recovery in Full-Text Indexing. SPIRE/CRIWG Eljas Soisalon-Soininen, Peter Widmayer
1999	—	`ed.`	Distributed Data & Structures 2, Records of the 2nd International Meeting (WDAS 1999), Princeton, USA, May 10-11, 1999 WDAS Yuri Breitbart, Sajal K. Das, Nicola Santoro, Peter Widmayer
1999	—	`ed.`	Distributed Data & Structures, Records of the 1st International Meeting (WDAS 1998), Orlando, Florida, USA WDAS Nicola Santoro, Peter Widmayer
1999	B	`ed.`	Graph-Theoretic Concepts in Computer Science, 25th International Workshop, WG '99, Ascona, Switzerland, June 17-19, 1999, Proceedings WG Peter Widmayer, Gabriele Neyer, Stephan J. Eidenbenz
1999	B	`conf`	Hard Tasks for Weak Robots: The Role of Common Knowledge in Pattern Formation by Autonomous Mobile Robots. ISAAC Paola Flocchini, Giuseppe Prencipe, Nicola Santoro, Peter Widmayer
1999	Misc	`conf`	How to Swap a Failing Edge of a Single Source Shortest Paths Tree. COCOON Enrico Nardelli, Guido Proietti, Peter Widmayer
1999	—	`conf`	Introduction: Distributed Data & Structures 2. WDAS Yuri Breitbart, Sajal K. Das, Nicola Santoro, Peter Widmayer
1999	A*	`conf`	The Bulk Index Join: A Generic Approach to Processing Non-Equijoins. ICDE Jochen Van den Bercken, Bernhard Seeger, Peter Widmayer
1998	C	`conf`	A Prototype System for Light Propagation in Terrains. Computer Graphics International Christoph Stamm, Stephan J. Eidenbenz, Michael Beck, Peter Stucki, Peter Widmayer
1998	—	`conf`	A Unified Analysis of Distributed Counting with Queueing Theory. WDAS Roger Wattenhofer, Peter Widmayer
1998	J	`jnl`	An Inherent Bottleneck in Distributed Counting. J. Parallel Distributed Comput. Roger Wattenhofer, Peter Widmayer
1998	A	`conf`	Finding All the Best Swaps of a Minimum Diameter Spanning Tree under Transient Edge Failures. ESA Enrico Nardelli, Guido Proietti, Peter Widmayer
1998	J	`jnl`	Finding the Detour-Critical Edge of a Shortest Path Between Two Nodes. Inf. Process. Lett. Enrico Nardelli, Guido Proietti, Peter Widmayer
1998	—	`conf`	Inapproximability of some art gallery problems. CCCG Stephan J. Eidenbenz, Christoph Stamm, Peter Widmayer
1998	—	`conf`	Introduction: Distributed Data and Structures 1. WDAS Nicola Santoro, Peter Widmayer
1998	A	`conf`	Positioning Guards at Fixed Height Above a Terrain - An Optimum Inapproximability Result. ESA Stephan J. Eidenbenz, Christoph Stamm, Peter Widmayer
1998	A*	`conf`	The Alps at Your Fingertips: Virtual Reality and Geoinformation Systems. ICDE Renato Pajarola, Thomas Ohler, Peter Stucki, Kornél Szabó, Peter Widmayer
1998	B	`conf`	The counting pyramid: an adaptive distributed counting scheme. SIROCCO Roger Wattenhofer, Peter Widmayer
1997	A*	`conf`	A Generic Approach to Bulk Loading Multidimensional Index Structures. VLDB Jochen Van den Bercken, Bernhard Seeger, Peter Widmayer
1997	—	`book`	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 Marc J. van Kreveld, Jürg Nievergelt, Thomas Roos, Peter Widmayer
1997	A*	`conf`	An Inherent Bottleneck in Distributed Counting. PODC Roger Wattenhofer, Peter Widmayer
1997	B	`conf`	Relaxed Balance through Standard Rotations. WADS Kim S. Larsen, Eljas Soisalon-Soininen, Peter Widmayer
1997	—	`conf`	Relaxed Balancing in Search Trees. Advances in Algorithms, Languages, and Complexity Eljas Soisalon-Soininen, Peter Widmayer
1997	B	`ed.`	SIROCCO'97, 4th International Colloquium on Structural Information & Communication Complexity, Monte Verita, Ascona, Switzerland, July 24-26, 1997 SIROCCO Danny Krizanc, Peter Widmayer
1997	B	`conf`	Singularities Make Spatial Join Scheduling Hard. ISAAC Gabriele Neyer, Peter Widmayer
1997	J	`jnl`	Space-Filling Curves and Their Use in the Design of Geometric Data Structures. Theor. Comput. Sci. Tetsuo Asano, Desh Ranjan, Thomas Roos, Emo Welzl, Peter Widmayer
1996	—	`book`	Algorithmen und Datenstrukturen, 3. Auflage. Thomas Ottmann, Peter Widmayer
1996	J	`jnl`	An Asymptotically Optimal Multiversion B-Tree. VLDB J. Bruno Becker, Stephan Gschwind, Thomas Ohler, Bernhard Seeger, Peter Widmayer
1996	J	`jnl`	Enclosing a Set of Objects by Two Minimum Area Rectangles. J. Algorithms Bruno Becker, Paolo Giulio Franciosa, Stephan Gschwind, Stefano Leonardi, Thomas Ohler, Peter Widmayer
1996	—	`ch.`	Space Filling Curves versus Random Walks. Algorithmic Foundations of Geographic Information Systems Edouard Bugnion, Thomas Roos, Roger Wattenhofer, Peter Widmayer
1996	—	`ch.`	Spatial Data Structures: Concepts and Design Choices. Algorithmic Foundations of Geographic Information Systems Jürg Nievergelt, Peter Widmayer
1996	—	`conf`	Spatial Indexing into Compressed Raster Images: How to Answer Range Queries Without Decompression. IW-MMDBMS Renato Pajarola, Peter Widmayer
1995	B	`conf`	Balanced Distributed Search Trees Do Not Exist. WADS Brigitte Kröll, Peter Widmayer
1995	—	`conf`	Binary Space Partitions for Sets of Hyperrectangles. ASIAN Viet Hai Nguyen, Peter Widmayer
1995	J	`jnl`	Book reviews. Math. Methods Oper. Res. Achi Brandt, Peter Widmayer
1995	—	`ed.`	GISI 95, Herausforderungen eines globalen Informationsverbundes für die Informatik, 25. GI-Jahrestagung und 13. Schweizer Informatikertag, Zürich, Schweiz, 18.-20. September 1995 GISI Friedbert Huber-Wäschle, Helmut Schauer, Peter Widmayer
1995	J	`jnl`	On Optimal Cuts of Hyperrectangles. Computing Fabrizio d'Amore, Viet Hai Nguyen, Thomas Roos, Peter Widmayer
1995	B	`conf`	Space Filling Curves and Their Use in the Design of Geometric Data Structures. LATIN Tetsuo Asano, Desh Ranjan, Thomas Roos, Emo Welzl, Peter Widmayer
1994	—	`conf`	A Data Structure for Approximate String Searching. HICSS (5) Thomas Roos, Fei Shi, Peter Widmayer
1994	—	`conf`	Distributing a Search Tree Among a Growing Number of Processors. SIGMOD Conference Brigitte Kröll, Peter Widmayer
1994	—	`ed.`	IGIS '94: Geographic Information Systems, International Workshop on Advanced Information Systems, Monte Verita, Ascona, Switzerland, February 28 - March 4, 1994, Proceedings IGIS Jürg Nievergelt, Thomas Roos, Hans-Jörg Schek, Peter Widmayer
1994	—	`conf`	VisTool: A Visualization Tool for Spatial Access Structures. IGIS Viet Hai Nguyen, Thomas Ohler, Peter Widmayer
1994	J	`jnl`	k-Violation Linear Programming. Inf. Process. Lett. Thomas Roos, Peter Widmayer
1993	—	`conf`	A Brief Tutorial Introduction to Data Structures for Geometric Databases. CISM - Advances in Database Systems Thomas Ohler, Peter Widmayer
1993	—	`book`	Algorithmen und Datenstrukturen, 2. Auflage Thomas Ottmann, Peter Widmayer
1993	—	`conf`	An Optimal Algorithm for Computing a Best Cut of a Set of Hyperrectangles. ICCG Fabrizio d'Amore, Thomas Roos, Peter Widmayer
1993	—	`conf`	Balanced Cuts of a Set of Hyperrectangles. CCCG Viet Hai Nguyen, Thomas Roos, Peter Widmayer
1993	—	`conf`	Data Structures and Algorithms for Geographic Information Systems: Selected Topics. CISM - Advances in Database Systems Thomas Ohler, Peter Widmayer
1993	—	`conf`	Geographic Information Systems: An Example. CISM - Advances in Database Systems Thomas Ohler, Peter Widmayer
1993	J	`jnl`	Guard Files: Stabbing and Intersection Queries on Fat Spatial Objects. Comput. J. Jürg Nievergelt, Peter Widmayer
1993	—	`conf`	On Optimal Multiversion Access Structures. SSD Bruno Becker, Stephan Gschwind, Thomas Ohler, Bernhard Seeger, Peter Widmayer
1993	A*	`conf`	Towards an Analysis of Range Query Performance in Spatial Data Structures. PODS Bernd-Uwe Pagel, Hans-Werner Six, Heinrich Toben, Peter Widmayer
1993	—	`conf`	k-violation linear programming. System Modelling and Optimization Thomas Roos, Peter Widmayer
1992	A	`conf`	Enclosing Many Boxes by an Optimal Pair of Boxes. STACS Bruno Becker, Paolo Giulio Franciosa, Stephan Gschwind, Thomas Ohler, Gerald Thiemt, Peter Widmayer
1992	—	`conf`	Spatial Access Structures for Geometric Databases. Data Structures and Efficient Algorithms Hans-Werner Six, Peter Widmayer
1991	A*	`conf`	An Optimal Algorithm for Approximating a Set of Rectangles by Two Minimum Area Rectangles. Workshop on Computational Geometry Bruno Becker, Paolo Giulio Franciosa, Stephan Gschwind, Thomas Ohler, Gerald Thiemt, Peter Widmayer
1991	Misc	`conf`	Anbindung einer rämlich clusternden Zugriffstruktur für geometrische Attribute an ein Standard-Datenbanksystem am Beispiel von Oracle. BTW Andreas Henrich, Andreas Hilbert, Hans-Werner Six, Peter Widmayer
1991	—	`ch.`	Datenstrukturen für Geodatenbanken. Entwicklungstendenzen bei Datenbanksystemen Peter Widmayer
1991	A*	`conf`	On Shortest Networks for Classes of Points in the Plane. Workshop on Computational Geometry Edmund Ihler, Gabriele Reich, Peter Widmayer
1991	J	`jnl`	On graphs preserving rectilinear shortest paths in the presence of obstacles. Ann. Oper. Res. Peter Widmayer
1991	—	`conf`	Spatial Priority Search: An Access Technique for Scaleless Maps. SIGMOD Conference Bruno Becker, Hans-Werner Six, Peter Widmayer
1990	—	`book`	Algorithmen und Datenstrukturen Thomas Ottmann, Peter Widmayer
1990	—	`conf`	Distributed Function Evaluation in the Presence of Transmission Faults. SIGAL International Symposium on Algorithms Nicola Santoro, Peter Widmayer
1990	—	`conf`	Ein Vorschlag zur maßstabsunabhängigen Verwaltung von Landschaftsdaten. Grundlagen von Datenbanken Peter Widmayer, Bruno Becker
1990	—	`conf`	Maßstabsunabhängige Verwaltung von Landschaftsdaten. GI Jahrestagung (2) Bruno Becker, Hans-Werner Six, Peter Widmayer
1990	J	`jnl`	On the Power of Safe Locking. J. Comput. Syst. Sci. Georg Lausen, Eljas Soisalon-Soininen, Peter Widmayer
1990	A*	`conf`	The R-File: An Efficient Access Structure for Proximity Queries. ICDE Andreas Hutflesz, Hans-Werner Six, Peter Widmayer
1989	B	`conf`	Beyond Steiner's Problem: A VLSI Oriented Generalization. WG Gabriele Reich, Peter Widmayer
1989	B	`conf`	Paging Binary Trees with External Balancing. WG Andreas Henrich, Hans-Werner Six, Peter Widmayer
1989	—	`conf`	Räumliche Suche in geometrischen Datenbanken. Grundlagen von Datenbanken Peter Widmayer
1989	A*	`conf`	The LSD tree: Spatial Access to Multidimensional Point and Nonpoint Objects. VLDB Andreas Henrich, Hans-Werner Six, Peter Widmayer
1989	A	`conf`	Time is Not a Healer. STACS Nicola Santoro, Peter Widmayer
1988	A*	`conf`	Globally Order Preserving Multidimensional Linear Hashing. ICDE Andreas Hutflesz, Hans-Werner Six, Peter Widmayer
1988	J	`jnl`	Hole Problems for Rectangles in the Plane. SIAM J. Discret. Math. Gregory J. E. Rawlins, Peter Widmayer, Derick Wood
1988	J	`jnl`	Maximizing pin alignment in semi-custom chip circuit layout. Integr. Peter Widmayer, Lin S. Woo, C. K. Wong
1988	A*	`conf`	Spatial Searching in Geometric Databases. ICDE Hans-Werner Six, Peter Widmayer
1988	B	`conf`	The Twin Grid File: A Nearly Space Optimal Index Structure. EDBT Andreas Hutflesz, Hans-Werner Six, Peter Widmayer
1988	A*	`conf`	Twin Grid Files: A Performance Evaluation. Workshop on Computational Geometry Andreas Hutflesz, Peter Widmayer, Hans-Werner Six
1988	—	`conf`	Twin Grid Files: Space Optimizing Access Schemes. SIGMOD Conference Andreas Hutflesz, Hans-Werner Six, Peter Widmayer
1987	J	`jnl`	On Some Distance Problems in Fixed Orientations. SIAM J. Comput. Peter Widmayer, Ying-Fung Wu, C. K. Wong
1987	B	`conf`	On the Analysis of Grid Structures for Spatial Objects of Non-Zero Size. WG Thomas Rottke, Hans-Werner Six, Peter Widmayer
1987	J	`jnl`	Rectilinear Shortest Paths and Minimum Spanning Trees in the Presence of Rectilinear Obstacles. IEEE Trans. Computers Ying-Fung Wu, Peter Widmayer, Martine D. F. Schlag, C. K. Wong
1987	J	`jnl`	Time- and Space-Optimal Contour Computation for a Set of Rectangles. Inf. Process. Lett. Peter Widmayer, Derick Wood
1986	J	`jnl`	A Faster Approximation Algorithm for the Steiner Problem in Graphs. Acta Informatica Ying-Fung Wu, Peter Widmayer, C. K. Wong
1986	B	`conf`	An Approximation Algorithms for Steiner's Problem in Graphs. WG Peter Widmayer
1986	—	`conf`	Hintergrundspeicherstrukturen für ausgedehnte Objekte. GI Jahrestagung (1) Hans-Werner Six, Peter Widmayer
1986	—	`conf`	Modellversuch computergestützter Informatikunterricht: Algorithmen und Datenstrukturen. INFOS Thomas Ottmann, Peter Widmayer
1986	J	`jnl`	On some union and intersection problems for polygons with fixed orientations. Computing Peter Widmayer, Ying-Fung Wu, Martine D. F. Schlag, Chak-Kuen Wong
1986	J	`jnl`	Pre-analysis Locking Inf. Control. Georg Lausen, Eljas Soisalon-Soininen, Peter Widmayer
1986	A	`conf`	Towards Online Schedulers Based on Pre-Analysis Locking. ICDT Georg Lausen, Eljas Soisalon-Soininen, Peter Widmayer
1985	J	`jnl`	A fast algorithm for the Boolean masking problem. Comput. Vis. Graph. Image Process. Thomas Ottmann, Peter Widmayer, Derick Wood
1985	J	`jnl`	An Optimal Algorithm for the Maximum Alignment of Terminals. Inf. Process. Lett. Peter Widmayer, C. K. Wong
1985	—	`conf`	Distance problems in computational geometry with fixed orientations. SCG Peter Widmayer, Ying-Fung Wu, C. K. Wong
1985	A*	`conf`	Pre-Analysis Locking: A Safe and Deadlock Free Locking Policy. VLDB Georg Lausen, Eljas Soisalon-Soininen, Peter Widmayer
1984	A*	`conf`	Maximal Concurrency by Locking. PODS Georg Lausen, Eljas Soisalon-Soininen, Peter Widmayer
1984	J	`jnl`	On the Complexity of Concurrency Control by Locking in Distributed Database Systems Inf. Control. Eljas Soisalon-Soininen, Peter Widmayer
1984	B	`conf`	Solving Visibility Problems by Using Skeleton Structures. MFCS Thomas Ottmann, Peter Widmayer
1983	—	`—`	Computational complexity in computer graphics and VLSI design. Peter Widmayer
1983	J	`jnl`	On translating a set of line segments. Comput. Vis. Graph. Image Process. Thomas Ottmann, Peter Widmayer