Peter Widmayer

Publication Activity (10 Years)

Years Active: 1983-2018
Publications (10 Years): 14

Top Venues

Theor. Comput. Sci.

ALGOSENSORS

ATMOS

Algorithmica

Karlsruhe Institute of Technology, Germany (PHD)

Education History

Karlsruhe Institute of Technology, Germany

PHD

Publications

Katerina Böhmová, Jérémie Chalopin, Matús Mihalák, Guido Proietti, Peter Widmayer
Sequence Hypergraphs: Paths, Flows, and Cuts. Adventures Between Lower Bounds and Higher Altitudes (2018)
Joachim M. Buhmann, Alexey Gronskiy, Matús Mihalák, Tobias Pröger, Rastislav Srámek, Peter Widmayer
Robust optimization in the presence of uncertainty: A generic approach. J. Comput. Syst. Sci. 94 (2018)
Thomas Tschager, Simon Rösch, Ludovic Gillet, Peter Widmayer
A better scoring model for de novo peptide sequencing: the symmetric difference between explained and measured masses. Algorithms Mol. Biol. 12 (1) (2017)
Ludovic Gillet, Simon Rösch, Thomas Tschager, Peter Widmayer
A Better Scoring Model for De Novo Peptide Sequencing: The Symmetric Difference Between Explained and Measured Masses. WABI (2016)
Matús Mihalák, Rastislav Srámek, Peter Widmayer
Approximately Counting Approximately-Shortest Paths in Directed Acyclic Graphs. Theory Comput. Syst. 58 (1) (2016)
Katerina Böhmová, Jérémie Chalopin, Matús Mihalák, Guido Proietti, Peter Widmayer
Sequence Hypergraphs. WG (2016)
Matús Mihalák, Paolo Penna, Peter Widmayer
Bribeproof Mechanisms for Two-Values Domains. SAGT (2016)
Matús Mihalák, Paolo Penna, Peter Widmayer
Bribeproof mechanisms for two-values domains. CoRR (2015)
Holger Flier, Matús Mihalák, Peter Widmayer, Anna Zych, Yusuke Kobayashi, Anita Schöbel
Selecting vertex disjoint paths in plane graphs. Networks 66 (2) (2015)
Andreas Emil Feldmann, Peter Widmayer
) Time Algorithm to Compute the Bisection Width of Solid Grid Graphs. Algorithmica 71 (1) (2015)
Jérémie Chalopin, Shantanu Das, Yann Disser, Matús Mihalák, Peter Widmayer
Mapping Simple Polygons: The Power of Telling Convex from Reflex. ACM Trans. Algorithms 11 (4) (2015)
Katerina Böhmová, Matús Mihalák, Peggy Neubert, Tobias Pröger, Peter Widmayer
Robust Routing in Urban Public Transportation: Evaluating Strategies that Learn From the Past. ATMOS (2015)
Peter Widmayer
FUN with algorithms. Theor. Comput. Sci. 586 (2015)
Barbara Geissmann, Matús Mihalák, Peter Widmayer
Recurring Comparison Faults: Sorting and Finding the Minimum. FCT (2015)
Andreas Bärtschi, Subir Kumar Ghosh, Matús Mihalák, Thomas Tschager, Peter Widmayer
Improved bounds for the conflict-free chromatic art gallery problem. SoCG (2014)
Peter Widmayer, Yin-Feng Xu, Binhai Zhu
Combinatorial Optimization and Applications. Theor. Comput. Sci. 556 (2014)
Yann Disser, Subir Kumar Ghosh, Matús Mihalák, Peter Widmayer
Mapping a polygon with holes using a compass. Theor. Comput. Sci. 553 (2014)
Peer Kröger, John Krumm, Peter Widmayer
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 6 (1) (2014)
Jérémie Chalopin, Riko Jacob, Matús Mihalák, Peter Widmayer
Data Delivery by Energy-Constrained Mobile Agents on a Line. ICALP (2) (2014)
Peter Widmayer
The Presburger Award 2015 - Call for Nominations. Bull. EATCS 114 (2014)
Yann Disser, Matús Mihalák, Sandro Montanari, Peter Widmayer
Rectilinear Shortest Path and Rectilinear Minimum Spanning Tree with Neighborhoods. ISCO (2014)
Katerina Böhmová, Yann Disser, Matús Mihalák, Peter Widmayer
Interval Selection with Machine-Dependent Intervals. WADS (2013)
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) (2013)
Joachim M. Buhmann, Matús Mihalák, Rastislav Srámek, Peter Widmayer
Robust optimization in the presence of uncertainty. ITCS (2013)
Andreas Emil Feldmann, Shantanu Das, Peter Widmayer
Corner cuts are close to optimal: From solid grids to polygons and back. Discret. Appl. Math. 161 (7-8) (2013)
Davide Bilò, Yann Disser, Luciano Gualà, Matús Mihalák, Guido Proietti, Peter Widmayer
Polygon-Constrained Motion Planning Problems. ALGOSENSORS (2013)
Matús Mihalák, Rastislav Srámek, Peter Widmayer
Counting Approximately-Shortest Paths in Directed Acyclic Graphs. WAOA (2013)
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)
Jérémie Chalopin, Shantanu Das, Matús Mihalák, Paolo Penna, Peter Widmayer
Data Delivery by Energy-Constrained Mobile Agents. ALGOSENSORS (2013)
Peter Widmayer
To Be Uncertain Is Uncomfortable, But to Be Certain Is Ridiculous. ICALP (2) (2013)
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. Discret. Appl. Math. 161 (10-11) (2013)
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). ACM SIGSPATIAL Special 5 (1) (2013)
Daniar Achakeev, Bernhard Seeger, Peter Widmayer
Sort-based query-adaptive loading of R-trees. CIKM (2012)
Yann Disser, Subir Kumar Ghosh, Matús Mihalák, Peter Widmayer
Mapping a Polygon with Holes Using a Compass. ALGOSENSORS (2012)
Davide Bilò, Yann Disser, Matús Mihalák, Subhash Suri, Elias Vicari, Peter Widmayer
Reconstructing visibility graphs with simple robots. Theor. Comput. Sci. 444 (2012)
Yann Disser, Matús Mihalák, Peter Widmayer
Mapping Polygons with Agents That Measure Angles. WAFR (2012)
Peter Widmayer
Combinatorial Optimization with Noisy Inputs: How Can We Separate the Wheat from the Chaff? WALCOM (2012)
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 (2012)
Yann Disser, Matús Mihalák, Peter Widmayer
A polygon is determined by its angles. Comput. Geom. 44 (8) (2011)
Matús Mihalák, Marcel Schöngens, Rastislav Srámek, Peter Widmayer
On the Complexity of the Metric TSP under Stability Considerations. SOFSEM (2011)
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)
Andreas Emil Feldmann, Shantanu Das, Peter Widmayer
Restricted Cuts for Bisections in Solid Grids: A Proof via Polygons. WG (2011)
Michael Gatto, Peter Widmayer
On robust online scheduling algorithms. J. Sched. 14 (2) (2011)
Peter Widmayer
DISC 2011 Invited Lecture: Polygon Reconstruction with Little Information: An Example for the Power of Simple Micro-robots. DISC (2011)
Fedor V. Fomin, Petr A. Golovach, Alexander Hall, Matús Mihalák, Elias Vicari, Peter Widmayer
How to Guard a Graph? Algorithmica 61 (4) (2011)
Beat Gfeller, Nicola Santoro, Peter Widmayer
A Distributed Algorithm for Finding All Best Swap Edges of a Minimum-Diameter Spanning Tree. IEEE Trans. Dependable Secur. Comput. 8 (1) (2011)
Holger Flier, Matús Mihalák, Peter Widmayer, Anna Zych
Maximum Independent Set in 2-Direction Outersegment Graphs. WG (2011)
Andreas Emil Feldmann, Peter Widmayer
An $\mathcal{O}(n^4)$ Time Algorithm to Compute the Bisection Width of Solid Grid Graphs. ESA (2011)
Andreas Emil Feldmann, Shantanu Das, Peter Widmayer
Simple Cuts Are Fast and Good: Optimum Right-Angled Cuts in Solid Grids. COCOA (1) (2010)
Shantanu Das, Beat Gfeller, Peter Widmayer
Computing All Best Swaps for Minimum-Stretch Tree Spanners. J. Graph Algorithms Appl. 14 (2) (2010)
Jérémie Chalopin, Shantanu Das, Yann Disser, Matús Mihalák, Peter Widmayer
How Simple Robots Benefit from Looking Back. CIAC (2010)
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) (2010)
Holger Flier, Matús Mihalák, Anita Schöbel, Peter Widmayer, Anna Zych
Vertex Disjoint Paths for Dispatching in Railways. ATMOS (2010)
Jörg Derungs, Riko Jacob, Peter Widmayer
Approximate Shortest Paths Guided by a Small Index. Algorithmica 57 (4) (2010)
Jérémie Chalopin, Shantanu Das, Peter Widmayer
Rendezvous of Mobile Agents in Directed Graphs. DISC (2010)
Yann Disser, Matús Mihalák, Peter Widmayer
Reconstructing a Simple Polygon from Its Angles. SWAT (2010)
Paolo Penna, Guido Proietti, Peter Widmayer
Strongly polynomial-time truthful mechanisms in one shot. Theor. Comput. Sci. 410 (17) (2009)
Peter Widmayer
How to Sort a Train. MFCS (2009)
Paolo Penna, Florian Schoppmann, Riccardo Silvestri, Peter Widmayer
Pseudonyms in Cost-Sharing Games. WINE (2009)
Davide Bilò, Yann Disser, Matús Mihalák, Subhash Suri, Elias Vicari, Peter Widmayer
Reconstructing Visibility Graphs with Simple Robots. SIROCCO (2009)
Davide Bilò, Michael Gatto, Luciano Gualà, Guido Proietti, Peter Widmayer
Stability of Networks in Stretchable Graphs. SIROCCO (2009)
Beat Gfeller, Leon Peeters, Birgitta Weber, Peter Widmayer
Single machine batch scheduling with release times. J. Comb. Optim. 17 (3) (2009)
Rastislav Srámek, Bernd Fischer, Elias Vicari, Peter Widmayer
Optimal Transitions for Targeted Protein Quantification: Best Conditioned Submatrix Selection. COCOON (2009)
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)
Hans-Joachim Böckenhauer, Juraj Hromkovic, Tobias Mömke, Peter Widmayer
On the Hardness of Reoptimization. SOFSEM (2008)
Shantanu Das, Beat Gfeller, Peter Widmayer
Computing Best Swaps in Optimal Tree Spanners. ISAAC (2008)
Subhash Suri, Elias Vicari, Peter Widmayer
Simple Robots with Minimal Sensing: From Local Visibility to Global Geometry. Int. J. Robotics Res. 27 (9) (2008)
Matteo Fischetti, Peter Widmayer
ATMOS 2008 Abstracts Collection - 8th Workshop on Algorithmic Approaches for Transportation Modeling, Optimization, and Systems. ATMOS (2008)
Davide Bilò, Thomas Erlebach, Matús Mihalák, Peter Widmayer
Discovery of Network Properties with All-Shortest-Paths Queries. SIROCCO (2008)
Davide Bilò, Luciano Gualà, Guido Proietti, Peter Widmayer
Computational Aspects of a 2-Player Stackelberg Shortest Paths Tree Game. WINE (2008)
Matteo Fischetti, Peter Widmayer
ATMOS 2008 Preface -- 8th Workshop on Algorithmic Approaches for Transportation Modeling, Optimization, and Systems. ATMOS (2008)
Davide Bilò, Hans-Joachim Böckenhauer, Juraj Hromkovic, Richard Královic, Tobias Mömke, Peter Widmayer, Anna Zych
Reoptimization of Steiner Trees. SWAT (2008)
Paola Flocchini, Giuseppe Prencipe, Nicola Santoro, Peter Widmayer
Arbitrary pattern formation by asynchronous, anonymous, oblivious robots. Theor. Comput. Sci. 407 (1-3) (2008)
Shantanu Das, Matús Mihalák, Rastislav Srámek, Elias Vicari, Peter Widmayer
Rendezvous of Mobile Agents When Tokens Fail Anytime. OPODIS (2008)
Jan Brunner, Matús Mihalák, Subhash Suri, Elias Vicari, Peter Widmayer
Simple Robots in Polygonal Environments: A Hierarchy. ALGOSENSORS (2008)
Davide Bilò, Peter Widmayer, Anna Zych
Reoptimization of Weighted Graph and Covering Problems. WAOA (2008)
Fedor V. Fomin, Petr A. Golovach, Alexander Hall, Matús Mihalák, Elias Vicari, Peter Widmayer
How to Guard a Graph?. ISAAC (2008)
Beat Gfeller, Matús Mihalák, Subhash Suri, Elias Vicari, Peter Widmayer
Angle Optimization in Target Tracking. SWAT (2008)
Paola Flocchini, Linda Pagli, Giuseppe Prencipe, Nicola Santoro, Peter Widmayer
Computing all the best swap edges distributively. J. Parallel Distributed Comput. 68 (7) (2008)
Luzi Anderegg, Stephan J. Eidenbenz, Leon Peeters, Peter Widmayer
Optimal Placement of Ad-Hoc Devices Under a VCG-Style Routing Protocol. ALGOSENSORS (2007)
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) (2007)
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 Oper. Res. 2 (2) (2007)
Beat Gfeller, Nicola Santoro, Peter Widmayer
A Distributed Algorithm for Finding All Best Swap Edges of a Minimum Diameter Spanning Tree. DISC (2007)
Juraj Hromkovic, Tobias Mömke, Kathleen Steinhöfel, Peter Widmayer
Job Shop Scheduling with Unit Length Tasks: Bounds and Algorithms. Algorithmic Oper. Res. 2 (1) (2007)
Beat Gfeller, Matús Mihalák, Subhash Suri, Elias Vicari, Peter Widmayer
Counting Targets with Mobile Sensors in an Unknown Environment. ALGOSENSORS (2007)
Nicola Santoro, Peter Widmayer
Agreement in synchronous networks with ubiquitous faults. Theor. Comput. Sci. 384 (2-3) (2007)
Alexander Hall, C. Pomm, Peter Widmayer
A Combinatorial Approach to Multi-Domain Sketch Recognition. SBIM (2007)
Subhash Suri, Roger Wattenhofer, Peter Widmayer
07151 Abstracts Collection -- Geometry in Sensor Networks. Geometry in Sensor Networks (2007)
Davide Bilò, Jörg Derungs, Luciano Gualà, Guido Proietti, Peter Widmayer
Locating Facilities on a Network to Minimize Their Average Service Radius. ISAAC (2007)
Subhash Suri, Elias Vicari, Peter Widmayer
Simple Robots with Minimal Sensing: From Local Visibility to Global Geometry. AAAI (2007)
Jörg Derungs, Riko Jacob, Peter Widmayer
Approximate Shortest Paths Guided by a Small Index. WADS (2007)
Michael Gatto, Peter Widmayer
On the Robustness of Graham's Algorithm for Online Scheduling. WADS (2007)
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. Bioinform. 23 (22) (2007)
Beat Gfeller, Leon Peeters, Birgitta Weber, Peter Widmayer
Online Single Machine Batch Scheduling. MFCS (2006)
Paolo Penna, Guido Proietti, Peter Widmayer
Strongly Polynomial-Time Truthful Mechanisms in One Shot. WINE (2006)
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)
Guido Proietti, Peter Widmayer
Partitioning the Nodes of a Graph to Minimize the Sum of Subgraph Radii. ISAAC (2006)
Mirjam Wattenhofer, Roger Wattenhofer, Peter Widmayer
Geometric Routing Without Geometry. SIROCCO (2005)
Nicola Santoro, Peter Widmayer
Majority and Unanimity in Synchronous Networks with Ubiquitous Dynamic Faults. SIROCCO (2005)
Guido Proietti, Peter Widmayer
A truthful mechanism for the non-utilitarian minimum radius spanning tree problem. SPAA (2005)

Peter Widmayer.css-eqlu8i{font-size:small;padding-left:4px;}

Publication Activity (10 Years)

Top Topics

Top Venues

Peter Widmayer