| 2016 | SAGT | Bribeproof Mechanisms for Two-Values Domains. | Mats Mihalk, Paolo Penna, Peter Widmayer |
| 2016 | WABI | A Better Scoring Model for De Novo Peptide Sequencing: The Symmetric Difference Between Explained and Measured Masses. | Ludovic Gillet, Simon Rsch, Thomas Tschager, Peter Widmayer |
| 2016 | WG | Sequence Hypergraphs. | Katerina Bhmov, Jrmie Chalopin, Mats Mihalk, Guido Proietti, Peter Widmayer |
| 2015 | ATMOS | Robust Routing in Urban Public Transportation: Evaluating Strategies that Learn From the Past. | Katerina Bhmov, Mats Mihalk, Peggy Neubert, Tobias Prger, Peter Widmayer |
| 2015 | FCT | Recurring Comparison Faults: Sorting and Finding the Minimum. | Barbara Geissmann, Mats Mihalk, Peter Widmayer |
| 2014 | ICALP | Data Delivery by Energy-Constrained Mobile Agents on a Line. | Jrmie Chalopin, Riko Jacob, Mats Mihalk, Peter Widmayer |
| 2013 | Algosensors | Polygon-Constrained Motion Planning Problems. | Davide Bil, Yann Disser, Luciano Gual, Mats Mihalk, Guido Proietti, Peter Widmayer |
| 2013 | Algosensors | Data Delivery by Energy-Constrained Mobile Agents. | Jrmie Chalopin, Shantanu Das, Mats Mihalk, Paolo Penna, Peter Widmayer |
| 2013 | ATMOS | Robust Routing in Urban Public Transportation: How to Find Reliable Journeys Based on Past Observations. | Katerina Bhmov, Mats Mihalk, Tobias Prger, Rastislav Srmek, Peter Widmayer |
| 2013 | ICALP | To Be Uncertain Is Uncomfortable, But to Be Certain Is Ridiculous. | Peter Widmayer |
| 2013 | WADS | Interval Selection with Machine-Dependent Intervals. | Katerina Bhmov, Yann Disser, Mats Mihalk, Peter Widmayer |
| 2013 | WAOA | Counting Approximately-Shortest Paths in Directed Acyclic Graphs. | Mats Mihalk, Rastislav Srmek, Peter Widmayer |
| 2012 | Algosensors | Mapping a Polygon with Holes Using a Compass. | Yann Disser, Subir Kumar Ghosh, Mats Mihalk, Peter Widmayer |
| 2012 | CIKM | Sort-based query-adaptive loading of R-trees. | Daniar Achakeev, Bernhard Seeger, Peter Widmayer |
| 2012 | WAFR | Mapping Polygons with Agents That Measure Angles. | Yann Disser, Mats Mihalk, Peter Widmayer |
| 2012 | WALCOM | Combinatorial Optimization with Noisy Inputs: How Can We Separate the Wheat from the Chaff? | Peter Widmayer |
| 2011 | ESA | An $\mathcal{O}(n^4)$ Time Algorithm to Compute the Bisection Width of Solid Grid Graphs. | Andreas Emil Feldmann, Peter Widmayer |
| 2011 | STACS | Telling convex from reflex allows to map a polygon. | Jrmie Chalopin, Shantanu Das, Yann Disser, Mats Mihalk, Peter Widmayer |
| 2011 | SOFSEM | On the Complexity of the Metric TSP under Stability Considerations. | Mats Mihalk, Marcel Schngens, Rastislav Srmek, Peter Widmayer |
| 2011 | WG | Restricted Cuts for Bisections in Solid Grids: A Proof via Polygons. | Andreas Emil Feldmann, Shantanu Das, Peter Widmayer |
| 2011 | WG | Maximum Independent Set in 2-Direction Outersegment Graphs. | Holger Flier, Mats Mihalk, Peter Widmayer, Anna Zych |
| 2010 | ATMOS | Vertex Disjoint Paths for Dispatching in Railways. | Holger Flier, Mats Mihalk, Anita Schbel, Peter Widmayer, Anna Zych |
| 2010 | CIAC | How Simple Robots Benefit from Looking Back. | Jrmie Chalopin, Shantanu Das, Yann Disser, Mats Mihalk, Peter Widmayer |
| 2010 | COCOA | Simple Cuts Are Fast and Good: Optimum Right-Angled Cuts in Solid Grids. | Andreas Emil Feldmann, Shantanu Das, Peter Widmayer |
| 2009 | COCOON | Optimal Transitions for Targeted Protein Quantification: Best Conditioned Submatrix Selection. | Rastislav Srmek, Bernd Fischer, Elias Vicari, Peter Widmayer |
| 2009 | MFCS | How to Sort a Train. | Peter Widmayer |
| 2009 | SIROCCO | Reconstructing Visibility Graphs with Simple Robots. | Davide Bil, Yann Disser, Mats Mihalk, Subhash Suri, Elias Vicari, Peter Widmayer |
| 2009 | SIROCCO | Stability of Networks in Stretchable Graphs. | Davide Bil, Michael Gatto, Luciano Gual, Guido Proietti, Peter Widmayer |
| 2008 | Algosensors | Simple Robots in Polygonal Environments: A Hierarchy. | Jan Brunner, Mats Mihalk, Subhash Suri, Elias Vicari, Peter Widmayer |
| 2008 | ATMOS | ATMOS 2008 Preface -- 8th Workshop on Algorithmic Approaches for Transportation Modeling, Optimization, and Systems. | Matteo Fischetti, Peter Widmayer |
| 2008 | ATMOS | ATMOS 2008 Abstracts Collection - 8th Workshop on Algorithmic Approaches for Transportation Modeling, Optimization, and Systems. | Matteo Fischetti, Peter Widmayer |
| 2008 | ISAAC | Computing Best Swaps in Optimal Tree Spanners. | Shantanu Das, Beat Gfeller, Peter Widmayer |
| 2008 | ISAAC | How to Guard a Graph?. | Fedor V. Fomin, Petr A. Golovach, Alexander Hall, Mats Mihalk, Elias Vicari, Peter Widmayer |
| 2008 | OPODIS | Rendezvous of Mobile Agents When Tokens Fail Anytime. | Shantanu Das, Mats Mihalk, Rastislav Srmek, Elias Vicari, Peter Widmayer |
| 2008 | SIROCCO | Discovery of Network Properties with All-Shortest-Paths Queries. | Davide Bil, Thomas Erlebach, Mats Mihalk, Peter Widmayer |
| 2008 | SOFSEM | On the Hardness of Reoptimization. | Hans-Joachim Bckenhauer, Juraj Hromkovic, Tobias Mmke, Peter Widmayer |
| 2008 | WAOA | Reoptimization of Weighted Graph and Covering Problems. | Davide Bil, Peter Widmayer, Anna Zych |
| 2007 | AAAI | Simple Robots with Minimal Sensing: From Local Visibility to Global Geometry. | Subhash Suri, Elias Vicari, Peter Widmayer |
| 2007 | Algosensors | Optimal Placement of Ad-Hoc Devices Under a VCG-Style Routing Protocol. | Luzi Anderegg, Stephan J. Eidenbenz, Leon Peeters, Peter Widmayer |
| 2007 | Algosensors | Counting Targets with Mobile Sensors in an Unknown Environment. | Beat Gfeller, Mats Mihalk, Subhash Suri, Elias Vicari, Peter Widmayer |
| 2007 | ISAAC | Locating Facilities on a Network to Minimize Their Average Service Radius. | Davide Bil, Jrg Derungs, Luciano Gual, Guido Proietti, Peter Widmayer |
| 2007 | WADS | Approximate Shortest Paths Guided by a Small Index. | Jrg Derungs, Riko Jacob, Peter Widmayer |
| 2007 | WADS | On the Robustness of Graham's Algorithm for Online Scheduling. | Michael Gatto, Peter Widmayer |
| 2006 | ISAAC | Partitioning the Nodes of a Graph to Minimize the Sum of Subgraph Radii. | Guido Proietti, Peter Widmayer |
| 2006 | MFCS | Online Single Machine Batch Scheduling. | Beat Gfeller, Leon Peeters, Birgitta Weber, Peter Widmayer |
| 2005 | SPAA | A truthful mechanism for the non-utilitarian minimum radius spanning tree problem. | Guido Proietti, Peter Widmayer |
| 2005 | SIROCCO | Majority and Unanimity in Synchronous Networks with Ubiquitous Dynamic Faults. | Nicola Santoro, Peter Widmayer |
| 2005 | SIROCCO | Geometric Routing Without Geometry. | Mirjam Wattenhofer, Roger Wattenhofer, Peter Widmayer |
| 2004 | ATMOS | Online Delay Management on a Single Train Line. | Michael Gatto, Riko Jacob, Leon Peeters, Peter Widmayer |
| 2004 | OPODIS | Computing All the Best Swap Edges Distributively. | Paola Flocchini, Linda Pagli, Giuseppe Prencipe, Nicola Santoro, Peter Widmayer, Tranos Zuva |
| 2004 | STACS | An Algorithmic View on OVSF Code Assignment. | Thomas Erlebach, Riko Jacob, Mats Mihalk, Marc Nunkesser, Gbor Szab, Peter Widmayer |
| 2004 | WAOA | Joint Base Station Scheduling. | Thomas Erlebach, Riko Jacob, Mats Mihalk, Marc Nunkesser, Gbor Szab, Peter Widmayer |
| 2003 | ALENEX | Train Routing Algorithms: Concepts, Design Choises, and Practical Considerations. | Luzi Anderegg, Stephan J. Eidenbenz, Martin Gantenbein, Christoph Stamm, David Scot Taylor, Birgitta Weber, Peter Widmayer |
| 2003 | CIAC | Improving Customer Proximity to Railway Stations. | Evangelos Kranakis, Paolo Penna, Konrad Schlude, David Scot Taylor, Peter Widmayer |
| 2003 | ISAAC | Flexible Train Rostering. | Stephan J. Eidenbenz, Aris Pagourtzis, Peter Widmayer |
| 2003 | PODS | On producing join results early. | Jens-Peter Dittrich, Bernhard Seeger, David Scot Taylor, Peter Widmayer |
| 2002 | VLDB | Progressive Merge Join: A Generic and Non-blocking Sort-based Join Algorithm. | Jens-Peter Dittrich, Bernhard Seeger, David Scot Taylor, Peter Widmayer |
| 2002 | SIROCCO | Distributed Highly Available Search Trees. | Konrad Schlude, Eljas Soisalon-Soininen, Peter Widmayer |
| 2001 | COCOON | Finding the Most Vital Node of a Shortest Path. | Enrico Nardelli, Guido Proietti, Peter Widmayer |
| 2001 | ESA | An Approximation Algorithm for MINIMUM CONVEX COVER with Logarithmic Performance Guarantee. | Stephan J. Eidenbenz, Peter Widmayer |
| 2001 | ISAAC | On the Complexity of Train Assignment Problems. | Thomas Erlebach, Martin Gantenbein, Daniel Hrlimann, Gabriele Neyer, Aris Pagourtzis, Paolo Penna, Konrad Schlude, Kathleen Steinhfel, David Scot Taylor, Peter Widmayer |
| 2001 | STACS | Gathering of Asynchronous Oblivious Robots with Limited Visibility. | Paola Flocchini, Giuseppe Prencipe, Nicola Santoro, Peter Widmayer |
| 2001 | SIROCCO | Pattern Formation by Anonymous Robots Without Chirality. | Paola Flocchini, Giuseppe Prencipe, Nicola Santoro, Peter Widmayer |
| 2000 | ESA | Maintaining a Minimum Spanning Tree Under Transient Node Failures. | Enrico Nardelli, Guido Proietti, Peter Widmayer |
| 2000 | PDPTA | Virtual reality and dynamic statistical graphics: A bidirectional link in a heterogeneous, distributed computing environment. | Martin Schneider, Christoph Stamm, Jrgen Symanzik, Peter Widmayer |
| 1999 | COCOON | How to Swap a Failing Edge of a Single Source Shortest Paths Tree. | Enrico Nardelli, Guido Proietti, Peter Widmayer |
| 1999 | ICDE | The Bulk Index Join: A Generic Approach to Processing Non-Equijoins. | Jochen Van den Bercken, Bernhard Seeger, Peter Widmayer |
| 1999 | ISAAC | Hard Tasks for Weak Robots: The Role of Common Knowledge in Pattern Formation by Autonomous Mobile Robots. | Paola Flocchini, Giuseppe Prencipe, Nicola Santoro, Peter Widmayer |
| 1999 | SPIRE | Concurrency and Recovery in Full-Text Indexing. | Eljas Soisalon-Soininen, Peter Widmayer |
| 1998 | CGI | A Prototype System for Light Propagation in Terrains. | Christoph Stamm, Stephan J. Eidenbenz, Michael Beck, Peter Stucki, Peter Widmayer |
| 1998 | ESA | Positioning Guards at Fixed Height Above a Terrain - An Optimum Inapproximability Result. | Stephan J. Eidenbenz, Christoph Stamm, Peter Widmayer |
| 1998 | ESA | Finding All the Best Swaps of a Minimum Diameter Spanning Tree under Transient Edge Failures. | Enrico Nardelli, Guido Proietti, Peter Widmayer |
| 1998 | ICDE | The Alps at Your Fingertips: Virtual Reality and Geoinformation Systems. | Renato Pajarola, Thomas Ohler, Peter Stucki, Kornl Szab, Peter Widmayer |
| 1998 | SIROCCO | The counting pyramid: an adaptive distributed counting scheme. | Roger Wattenhofer, Peter Widmayer |
| 1997 | ISAAC | Singularities Make Spatial Join Scheduling Hard. | Gabriele Neyer, Peter Widmayer |
| 1997 | PODC | An Inherent Bottleneck in Distributed Counting. | Roger Wattenhofer, Peter Widmayer |
| 1997 | VLDB | A Generic Approach to Bulk Loading Multidimensional Index Structures. | Jochen Van den Bercken, Bernhard Seeger, Peter Widmayer |
| 1997 | WADS | Relaxed Balance through Standard Rotations. | Kim S. Larsen, Eljas Soisalon-Soininen, Peter Widmayer |
| 1995 | LATIN | Space Filling Curves and Their Use in the Design of Geometric Data Structures. | Tetsuo Asano, Desh Ranjan, Thomas Roos, Emo Welzl, Peter Widmayer |
| 1995 | WADS | Balanced Distributed Search Trees Do Not Exist. | Brigitte Krll, Peter Widmayer |
| 1994 | SIGMOD | Distributing a Search Tree Among a Growing Number of Processors. | Brigitte Krll, Peter Widmayer |
| 1993 | PODS | Towards an Analysis of Range Query Performance in Spatial Data Structures. | Bernd-Uwe Pagel, Hans-Werner Six, Heinrich Toben, Peter Widmayer |
| 1992 | STACS | Enclosing Many Boxes by an Optimal Pair of Boxes. | Bruno Becker, Paolo Giulio Franciosa, Stephan Gschwind, Thomas Ohler, Gerald Thiemt, Peter Widmayer |
| 1991 | BTW | Anbindung einer rmlich clusternden Zugriffstruktur fr geometrische Attribute an ein Standard-Datenbanksystem am Beispiel von Oracle. | Andreas Henrich, Andreas Hilbert, Hans-Werner Six, Peter Widmayer |
| 1991 | SIGMOD | Spatial Priority Search: An Access Technique for Scaleless Maps. | Bruno Becker, Hans-Werner Six, Peter Widmayer |
| 1990 | GI | Mastabsunabhngige Verwaltung von Landschaftsdaten. | Bruno Becker, Hans-Werner Six, Peter Widmayer |
| 1990 | ICDE | The R-File: An Efficient Access Structure for Proximity Queries. | Andreas Hutflesz, Hans-Werner Six, Peter Widmayer |
| 1989 | VLDB | The LSD tree: Spatial Access to Multidimensional Point and Nonpoint Objects. | Andreas Henrich, Hans-Werner Six, Peter Widmayer |
| 1989 | STACS | Time is Not a Healer. | Nicola Santoro, Peter Widmayer |
| 1989 | WG | Paging Binary Trees with External Balancing. | Andreas Henrich, Hans-Werner Six, Peter Widmayer |
| 1989 | WG | Beyond Steiner's Problem: A VLSI Oriented Generalization. | Gabriele Reich, Peter Widmayer |
| 1988 | EDBT | The Twin Grid File: A Nearly Space Optimal Index Structure. | Andreas Hutflesz, Hans-Werner Six, Peter Widmayer |
| 1988 | ICDE | Globally Order Preserving Multidimensional Linear Hashing. | Andreas Hutflesz, Hans-Werner Six, Peter Widmayer |
| 1988 | ICDE | Spatial Searching in Geometric Databases. | Hans-Werner Six, Peter Widmayer |
| 1988 | SIGMOD | Twin Grid Files: Space Optimizing Access Schemes. | Andreas Hutflesz, Hans-Werner Six, Peter Widmayer |
| 1987 | WG | On the Analysis of Grid Structures for Spatial Objects of Non-Zero Size. | Thomas Rottke, Hans-Werner Six, Peter Widmayer |
| 1986 | GI | Hintergrundspeicherstrukturen fr ausgedehnte Objekte. | Hans-Werner Six, Peter Widmayer |
| 1986 | ICDT | Towards Online Schedulers Based on Pre-Analysis Locking. | Georg Lausen, Eljas Soisalon-Soininen, Peter Widmayer |
| 1986 | WG | An Approximation Algorithms for Steiner's Problem in Graphs. | Peter Widmayer |
| 1985 | VLDB | Pre-Analysis Locking: A Safe and Deadlock Free Locking Policy. | Georg Lausen, Eljas Soisalon-Soininen, Peter Widmayer |
| 1984 | MFCS | Solving Visibility Problems by Using Skeleton Structures. | Thomas Ottmann, Peter Widmayer |
| 1984 | PODS | Maximal Concurrency by Locking. | Georg Lausen, Eljas Soisalon-Soininen, Peter Widmayer |