Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDPeter Widmayer
Person information
- affiliation: ETH Zurich, Switzerland
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2010 – 2019
- 2018
[j76]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: 135-166 (2018)- [c154]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: 191-215 - 2017
- [j75]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): 12:1-12:13 (2017) - 2016
- [j74]Matús Mihalák, Rastislav Srámek, Peter Widmayer:
Approximately Counting Approximately-Shortest Paths in Directed Acyclic Graphs. Theory Comput. Syst. 58(1): 45-59 (2016) - [c153]Matús Mihalák, Paolo Penna, Peter Widmayer:
Bribeproof Mechanisms for Two-Values Domains. SAGT 2016: 289-301 - [c152]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: 185-196 - [c151]Katerina Böhmová, Jérémie Chalopin, Matús Mihalák, Guido Proietti, Peter Widmayer:
Sequence Hypergraphs. WG 2016: 282-294 - 2015
- [j73]Andreas Emil Feldmann, Peter Widmayer:
An O(n4) Time Algorithm to Compute the Bisection Width of Solid Grid Graphs. Algorithmica 71(1): 181-200 (2015) - [j72]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): 136-144 (2015) - [j71]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): 33:1-33:16 (2015) - [j70]Peter Widmayer:
FUN with algorithms. Theor. Comput. Sci. 586: 1 (2015) - [c150]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: 68-81 - [c149]Barbara Geissmann, Matús Mihalák, Peter Widmayer:
Recurring Comparison Faults: Sorting and Finding the Minimum. FCT 2015: 227-239 - [e17]Vangelis Th. Paschos, Peter Widmayer:
Algorithms and Complexity - 9th International Conference, CIAC 2015, Paris, France, May 20-22, 2015. Proceedings. Lecture Notes in Computer Science 9079, Springer 2015, ISBN 978-3-319-18172-1 [contents] - [i3]Matús Mihalák, Paolo Penna, Peter Widmayer:
Bribeproof mechanisms for two-values domains. CoRR abs/1512.04277 (2015) - 2014
- [j69]Peter Widmayer:
The Presburger Award 2015 - Call for Nominations. Bull. EATCS 114 (2014) - [j68]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): 2-4 (2014) - [j67]Yann Disser, Subir Kumar Ghosh, Matús Mihalák, Peter Widmayer:
Mapping a polygon with holes using a compass. Theor. Comput. Sci. 553: 106-113 (2014) - [j66]Peter Widmayer, Yin-Feng Xu, Binhai Zhu:
Combinatorial Optimization and Applications. Theor. Comput. Sci. 556: 1 (2014) - [c148]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: 144 - [c147]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: 423-434 - [c146]Yann Disser, Matús Mihalák, Sandro Montanari, Peter Widmayer:
Rectilinear Shortest Path and Rectilinear Minimum Spanning Tree with Neighborhoods. ISCO 2014: 208-220 - [e16]Alfredo Ferro, Fabrizio Luccio, Peter Widmayer:
Fun with Algorithms - 7th International Conference, FUN 2014, Lipari Island, Sicily, Italy, July 1-3, 2014. Proceedings. Lecture Notes in Computer Science 8496, Springer 2014, ISBN 978-3-319-07889-2 [contents] - 2013
- [j65]Jérémie Chalopin, Shantanu Das, Yann Disser, Matús Mihalák, Peter Widmayer:
Mapping Simple Polygons: How Robots Benefit from Looking Back. Algorithmica 65(1): 43-59 (2013) - [j64]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): 970-998 (2013) - [j63]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): 1287-1307 (2013) - [j62]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): 2-4 (2013) - [c145]Davide Bilò, Yann Disser, Luciano Gualà, Matús Mihalák, Guido Proietti, Peter Widmayer:
Polygon-Constrained Motion Planning Problems. ALGOSENSORS 2013: 67-82 - [c144]Jérémie Chalopin, Shantanu Das, Matús Mihalák, Paolo Penna, Peter Widmayer:
Data Delivery by Energy-Constrained Mobile Agents. ALGOSENSORS 2013: 111-122 - [c143]Katerina Böhmová, Matús Mihalák, Tobias Pröger, Rastislav Srámek, Peter Widmayer:
Robust Routing in Urban Public Transportation: How to Find Reliable Journeys Based on Past Observations. ATMOS 2013: 27-41 - [c142]Peter Widmayer:
To Be Uncertain Is Uncomfortable, But to Be Certain Is Ridiculous. ICALP (2) 2013: 36 - [c141]Joachim M. Buhmann, Matús Mihalák, Rastislav Srámek, Peter Widmayer:
Robust optimization in the presence of uncertainty. ITCS 2013: 505-514 - [c140]Katerina Böhmová, Yann Disser, Matús Mihalák, Peter Widmayer:
Interval Selection with Machine-Dependent Intervals. WADS 2013: 170-181 - [c139]Matús Mihalák, Rastislav Srámek, Peter Widmayer:
Counting Approximately-Shortest Paths in Directed Acyclic Graphs. WAOA 2013: 156-167 - [e15]Peter Widmayer, Yinfeng Xu, Binhai Zhu:
Combinatorial Optimization and Applications - 7th International Conference, COCOA 2013, Chengdu, China, December 12-14, 2013, Proceedings. Lecture Notes in Computer Science 8287, Springer 2013, ISBN 978-3-319-03779-0 [contents] - [e14]Craig A. Knoblock, Markus Schneider, Peer Kröger, John Krumm, Peter Widmayer:
21st SIGSPATIAL International Conference on Advances in Geographic Information Systems, SIGSPATIAL 2013, Orlando, FL, USA, November 5-8, 2013. ACM 2013, ISBN 978-1-4503-2521-9 [contents] - 2012
- [b5]Thomas Ottmann, Peter Widmayer:
Algorithmen und Datenstrukturen, 5. Auflage. Spektrum Akademischer Verlag 2012, ISBN 978-3-8274-2803-5, pp. I-XXII, 1-774 - [j61]Davide Bilò, Yann Disser, Matús Mihalák, Subhash Suri, Elias Vicari, Peter Widmayer:
Reconstructing visibility graphs with simple robots. Theor. Comput. Sci. 444: 52-59 (2012) - [c138]Yann Disser, Subir Kumar Ghosh, Matús Mihalák, Peter Widmayer:
Mapping a Polygon with Holes Using a Compass. ALGOSENSORS 2012: 78-89 - [c137]Daniar Achakeev, Bernhard Seeger, Peter Widmayer:
Sort-based query-adaptive loading of R-trees. CIKM 2012: 2080-2084 - [c136]Yann Disser, Matús Mihalák, Peter Widmayer:
Mapping Polygons with Agents That Measure Angles. WAFR 2012: 415-425 - [c135]Peter Widmayer:
Combinatorial Optimization with Noisy Inputs: How Can We Separate the Wheat from the Chaff? WALCOM 2012: 1 - [e13]Isabel F. Cruz, Craig A. Knoblock, Peer Kröger, Egemen Tanin, Peter Widmayer:
SIGSPATIAL 2012 International Conference on Advances in Geographic Information Systems (formerly known as GIS), SIGSPATIAL'12, Redondo Beach, CA, USA, November 7-9, 2012. ACM 2012, ISBN 978-1-4503-1691-0 [contents] - [e12]Branislav Rovan, Vladimiro Sassone, Peter Widmayer:
Mathematical Foundations of Computer Science 2012 - 37th International Symposium, MFCS 2012, Bratislava, Slovakia, August 27-31, 2012. Proceedings. Lecture Notes in Computer Science 7464, Springer 2012, ISBN 978-3-642-32588-5 [contents] - [i2]Jérémie Chalopin, Shantanu Das, Yann Disser, Matús Mihalák, Peter Widmayer:
Simple Agents Learn to Find Their Way: An Introduction on Mapping Polygons. CoRR abs/1204.3850 (2012) - 2011
- [j60]Fedor V. Fomin, Petr A. Golovach, Alexander Hall, Matús Mihalák, Elias Vicari, Peter Widmayer:
How to Guard a Graph? Algorithmica 61(4): 839-856 (2011) - [j59]Yann Disser, Matús Mihalák, Peter Widmayer:
A polygon is determined by its angles. Comput. Geom. 44(8): 418-426 (2011) - [j58]Michael Gatto, Peter Widmayer:
On robust online scheduling algorithms. J. Sched. 14(2): 141-156 (2011) - [j57]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): 1-12 (2011) - [c134]Andreas Emil Feldmann, Peter Widmayer:
An $\mathcal{O}(n^4)$ Time Algorithm to Compute the Bisection Width of Solid Grid Graphs. ESA 2011: 143-154 - [c133]Matús Mihalák, Marcel Schöngens, Rastislav Srámek, Peter Widmayer:
On the Complexity of the Metric TSP under Stability Considerations. SOFSEM 2011: 382-393 - [c132]Jérémie Chalopin, Shantanu Das, Yann Disser, Matús Mihalák, Peter Widmayer:
Telling convex from reflex allows to map a polygon. STACS 2011: 153-164 - [c131]Peter Widmayer:
DISC 2011 Invited Lecture: Polygon Reconstruction with Little Information: An Example for the Power of Simple Micro-robots. DISC 2011: 332 - [c130]Andreas Emil Feldmann, Shantanu Das, Peter Widmayer:
Restricted Cuts for Bisections in Solid Grids: A Proof via Polygons. WG 2011: 143-154 - [c129]Holger Flier, Matús Mihalák, Peter Widmayer, Anna Zych:
Maximum Independent Set in 2-Direction Outersegment Graphs. WG 2011: 155-166 - [p7]Peter Widmayer, Luzi Anderegg, Stephan J. Eidenbenz, Leon Peeters:
Optimal Placement of Ad Hoc Devices Under a VCG-Style Routing Protocol. Theoretical Aspects of Distributed Computing in Sensor Networks 2011: 85-107 - 2010
- [j56]Jörg Derungs, Riko Jacob, Peter Widmayer:
Approximate Shortest Paths Guided by a Small Index. Algorithmica 57(4): 668-688 (2010) - [j55]Shantanu Das, Beat Gfeller, Peter Widmayer:
Computing All Best Swaps for Minimum-Stretch Tree Spanners. J. Graph Algorithms Appl. 14(2): 287-306 (2010) - [j54]Davide Bilò, Thomas Erlebach, Matús Mihalák, Peter Widmayer:
Discovery of network properties with all-shortest-paths queries. Theor. Comput. Sci. 411(14-15): 1626-1637 (2010) - [c128]Holger Flier, Matús Mihalák, Anita Schöbel, Peter Widmayer, Anna Zych:
Vertex Disjoint Paths for Dispatching in Railways. ATMOS 2010: 61-73 - [c127]Jérémie Chalopin, Shantanu Das, Yann Disser, Matús Mihalák, Peter Widmayer:
How Simple Robots Benefit from Looking Back. CIAC 2010: 229-239 - [c126]Andreas Emil Feldmann, Shantanu Das, Peter Widmayer:
Simple Cuts Are Fast and Good: Optimum Right-Angled Cuts in Solid Grids. COCOA (1) 2010: 11-20 - [c125]Yann Disser, Matús Mihalák, Peter Widmayer:
Reconstructing a Simple Polygon from Its Angles. SWAT 2010: 13-24 - [c124]Jérémie Chalopin, Shantanu Das, Peter Widmayer:
Rendezvous of Mobile Agents in Directed Graphs. DISC 2010: 282-296
2000 – 2009
- 2009
- [j53]Beat Gfeller, Leon Peeters, Birgitta Weber, Peter Widmayer:
Single machine batch scheduling with release times. J. Comb. Optim. 17(3): 323-338 (2009) - [j52]Paolo Penna, Guido Proietti, Peter Widmayer:
Strongly polynomial-time truthful mechanisms in one shot. Theor. Comput. Sci. 410(17): 1607-1615 (2009) - [c123]Rastislav Srámek, Bernd Fischer, Elias Vicari, Peter Widmayer:
Optimal Transitions for Targeted Protein Quantification: Best Conditioned Submatrix Selection. COCOON 2009: 287-296 - [c122]Peter Widmayer:
How to Sort a Train. MFCS 2009: 77 - [c121]Davide Bilò, Yann Disser, Matús Mihalák, Subhash Suri, Elias Vicari, Peter Widmayer:
Reconstructing Visibility Graphs with Simple Robots. SIROCCO 2009: 87-99 - [c120]Davide Bilò, Michael Gatto, Luciano Gualà, Guido Proietti, Peter Widmayer:
Stability of Networks in Stretchable Graphs. SIROCCO 2009: 100-112 - [c119]Paolo Penna, Florian Schoppmann, Riccardo Silvestri, Peter Widmayer:
Pseudonyms in Cost-Sharing Games. WINE 2009: 256-267 - [p6]Michael Gatto, Jens Maue, Matús Mihalák, Peter Widmayer:
Shunting for Dummies: An Introductory Algorithmic Survey. Robust and Online Large-Scale Optimization 2009: 310-337 - [p5]Luzi Anderegg, Paolo Penna, Peter Widmayer:
Online Train Disposition: To Wait or Not to Wait? Robust and Online Large-Scale Optimization 2009: 387-398 - 2008
- [j51]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: 420747:1-420747:5 (2008) - [j50]Subhash Suri, Elias Vicari, Peter Widmayer:
Simple Robots with Minimal Sensing: From Local Visibility to Global Geometry. Int. J. Robotics Res. 27(9): 1055-1067 (2008) - [j49]Paola Flocchini, Linda Pagli, Giuseppe Prencipe, Nicola Santoro, Peter Widmayer:
Computing all the best swap edges distributively. J. Parallel Distributed Comput. 68(7): 976-983 (2008) - [j48]Paola Flocchini, Giuseppe Prencipe, Nicola Santoro, Peter Widmayer:
Arbitrary pattern formation by asynchronous, anonymous, oblivious robots. Theor. Comput. Sci. 407(1-3): 412-447 (2008) - [c118]Jan Brunner, Matús Mihalák, Subhash Suri, Elias Vicari, Peter Widmayer:
Simple Robots in Polygonal Environments: A Hierarchy. ALGOSENSORS 2008: 111-124 - [c117]Matteo Fischetti, Peter Widmayer:
ATMOS 2008 Preface -- 8th Workshop on Algorithmic Approaches for Transportation Modeling, Optimization, and Systems. ATMOS 2008 - [c116]Matteo Fischetti, Peter Widmayer:
ATMOS 2008 Abstracts Collection - 8th Workshop on Algorithmic Approaches for Transportation Modeling, Optimization, and Systems. ATMOS 2008 - [c115]Fedor V. Fomin, Petr A. Golovach, Alexander Hall, Matús Mihalák, Elias Vicari, Peter Widmayer:
How to Guard a Graph?. ISAAC 2008: 318-329 - [c114]Shantanu Das, Beat Gfeller, Peter Widmayer:
Computing Best Swaps in Optimal Tree Spanners. ISAAC 2008: 716-727 - [c113]Shantanu Das, Matús Mihalák, Rastislav Srámek, Elias Vicari, Peter Widmayer:
Rendezvous of Mobile Agents When Tokens Fail Anytime. OPODIS 2008: 463-480 - [c112]Davide Bilò, Thomas Erlebach, Matús Mihalák, Peter Widmayer:
Discovery of Network Properties with All-Shortest-Paths Queries. SIROCCO 2008: 89-103 - [c111]Hans-Joachim Böckenhauer, Juraj Hromkovic, Tobias Mömke, Peter Widmayer:
On the Hardness of Reoptimization. SOFSEM 2008: 50-65 - [c110]Beat Gfeller, Matús Mihalák, Subhash Suri, Elias Vicari, Peter Widmayer:
Angle Optimization in Target Tracking. SWAT 2008: 65-76 - [c109]Davide Bilò, Hans-Joachim Böckenhauer, Juraj Hromkovic, Richard Královic, Tobias Mömke, Peter Widmayer, Anna Zych:
Reoptimization of Steiner Trees. SWAT 2008: 258-269 - [c108]Davide Bilò, Peter Widmayer, Anna Zych:
Reoptimization of Weighted Graph and Covering Problems. WAOA 2008: 201-213 - [c107]Davide Bilò, Luciano Gualà, Guido Proietti, Peter Widmayer:
Computational Aspects of a 2-Player Stackelberg Shortest Paths Tree Game. WINE 2008: 251-262 - [e11]Matteo Fischetti, Peter Widmayer:
ATMOS 2008 - 8th Workshop on Algorithmic Approaches for Transportation Modeling, Optimization, and Systems, Karlsruhe, Germany, September 18, 2008. OASIcs 9, Internationales Begegnungs- und Forschungszentrum fuer Informatik (IBFI), Schloss Dagstuhl, Germany 2008 [contents] - 2007
- [j47]Thomas Erlebach, Riko Jacob, Matús Mihalák, Marc Nunkesser, Gábor Szabó, Peter Widmayer:
An Algorithmic View on OVSF Code Assignment. Algorithmica 47(3): 269-298 (2007) - [j46]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) - [j45]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): 83-93 (2007) - [j44]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): 3016-3023 (2007) - [j43]Nicola Santoro, Peter Widmayer:
Agreement in synchronous networks with ubiquitous faults. Theor. Comput. Sci. 384(2-3): 232-249 (2007) - [c106]Subhash Suri, Elias Vicari, Peter Widmayer:
Simple Robots with Minimal Sensing: From Local Visibility to Global Geometry. AAAI 2007: 1114-1120 - [c105]Beat Gfeller, Matús Mihalák, Subhash Suri, Elias Vicari, Peter Widmayer:
Counting Targets with Mobile Sensors in an Unknown Environment. ALGOSENSORS 2007: 32-45 - [c104]Luzi Anderegg, Stephan J. Eidenbenz, Leon Peeters, Peter Widmayer:
Optimal Placement of Ad-Hoc Devices Under a VCG-Style Routing Protocol. ALGOSENSORS 2007: 58-70 - [c103]Davide Bilò, Jörg Derungs, Luciano Gualà, Guido Proietti, Peter Widmayer:
Locating Facilities on a Network to Minimize Their Average Service Radius. ISAAC 2007: 587-598 - [c102]Alexander Hall, C. Pomm, Peter Widmayer:
A Combinatorial Approach to Multi-Domain Sketch Recognition. SBIM 2007: 7-14 - [c101]Michael Gatto, Peter Widmayer:
On the Robustness of Graham's Algorithm for Online Scheduling. WADS 2007: 349-361 - [c100]Jörg Derungs, Riko Jacob, Peter Widmayer:
Approximate Shortest Paths Guided by a Small Index. WADS 2007: 553-564 - [c99]Beat Gfeller, Nicola Santoro, Peter Widmayer:
A Distributed Algorithm for Finding All Best Swap Edges of a Minimum Diameter Spanning Tree. DISC 2007: 268-282 - [e10]Subhash Suri, Roger Wattenhofer, Peter Widmayer:
Geometry in Sensor Networks, 09.04. - 13.04.2007. Dagstuhl Seminar Proceedings 07151, Internationales Begegnungs- und Forschungszentrum fuer Informatik (IBFI), Schloss Dagstuhl, Germany 2007 [contents] - [e9]Juraj Hromkovic, Richard Královic, Marc Nunkesser, Peter Widmayer:
Stochastic Algorithms: Foundations and Applications, 4th International Symposium, SAGA 2007, Zurich, Switzerland, September 13-14, 2007, Proceedings. Lecture Notes in Computer Science 4665, Springer 2007, ISBN 978-3-540-74870-0 [contents] - [r2]Nicola Santoro, Peter Widmayer:
Distributed Computing in the Presence of Mobile Faults. Handbook of Parallel Computing 2007 - [i1]Subhash Suri, Roger Wattenhofer, Peter Widmayer:
07151 Abstracts Collection -- Geometry in Sensor Networks. Geometry in Sensor Networks 2007 - 2006
- [c98]Hans-Joachim Böckenhauer, Luca Forlizzi, Juraj Hromkovic, Joachim Kneis, Joachim Kupke, Guido Proietti, Peter Widmayer:
Reusing Optimal TSP Solutions for Locally Modified Input Instances. IFIP TCS 2006: 251-270 - [c97]Guido Proietti, Peter Widmayer:
Partitioning the Nodes of a Graph to Minimize the Sum of Subgraph Radii. ISAAC 2006: 578-587 - [c96]Beat Gfeller, Leon Peeters, Birgitta Weber, Peter Widmayer:
Online Single Machine Batch Scheduling. MFCS 2006: 424-435 - [c95]Paolo Penna, Guido Proietti, Peter Widmayer:
Strongly Polynomial-Time Truthful Mechanisms in One Shot. WINE 2006: 377-388 - 2005
- [j42]Paola Flocchini, Giuseppe Prencipe, Nicola Santoro, Peter Widmayer:
Gathering of asynchronous robots with limited visibility. Theor. Comput. Sci. 337(1-3): 147-168 (2005) - [c94]Nicola Santoro, Peter Widmayer:
Majority and Unanimity in Synchronous Networks with Ubiquitous Dynamic Faults. SIROCCO 2005: 262-276 - [c93]Mirjam Wattenhofer, Roger Wattenhofer, Peter Widmayer:
Geometric Routing Without Geometry. SIROCCO 2005: 307-322 - [c92]Guido Proietti, Peter Widmayer:
A truthful mechanism for the non-utilitarian minimum radius spanning tree problem. SPAA 2005: 195-202 - 2004
- [j41]Enrico Nardelli, Guido Proietti, Peter Widmayer:
Nearly Linear Time Minimum Spanning Tree Maintenance for Transient Node Failures. Algorithmica 40(2): 119-132 (2004) - [j40]Michael Gatto, Riko Jacob, Leon Peeters, Birgitta Weber, Peter Widmayer:
Theory on the Tracks: A Selection of Railway Optimization Problems (Column: Algorithmics). Bull. EATCS 84: 41-70 (2004) - [j39]