| Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
| 1 | 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 |
DBLP BibTeX RDF |
|
| 1 | Thomas Ottmann, Peter Widmayer |
Algorithmen und Datenstrukturen, 5. Auflage. |
|
2012 |
DOI RDF |
|
| 1 | Peter Widmayer |
Combinatorial Optimization with Noisy Inputs: How Can We Separate the Wheat from the Chaff? |
WALCOM |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Beat Gfeller, Nicola Santoro, Peter Widmayer |
A Distributed Algorithm for Finding All Best Swap Edges of a Minimum-Diameter Spanning Tree. |
IEEE Trans. Dependable Sec. Comput. |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Fedor V. Fomin, Petr A. Golovach, Alexander Hall, Matús Mihalák, Elias Vicari, Peter Widmayer |
How to Guard a Graph? |
Algorithmica |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Michael Gatto, Peter Widmayer |
On robust online scheduling algorithms. |
J. Scheduling |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Yann Disser, Matús Mihalák, Peter Widmayer |
A polygon is determined by its angles. |
Comput. Geom. |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Andreas Emil Feldmann, Shantanu Das, Peter Widmayer |
Restricted Cuts for Bisections in Solid Grids: A Proof via Polygons. |
WG |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Holger Flier, Matús Mihalák, Peter Widmayer, Anna Zych |
Maximum Independent Set in 2-Direction Outersegment Graphs. |
WG |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Andreas Emil Feldmann, Peter Widmayer |
An $\mathcal{O}(n^4)$ Time Algorithm to Compute the Bisection Width of Solid Grid Graphs. |
ESA |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | 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 |
DBLP DOI BibTeX RDF |
|
| 1 | Peter Widmayer |
DISC 2011 Invited Lecture: Polygon Reconstruction with Little Information: An Example for the Power of Simple Micro-robots. |
DISC |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Matús Mihalák, Marcel Schöngens, Rastislav Srámek, Peter Widmayer |
On the Complexity of the Metric TSP under Stability Considerations. |
SOFSEM |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Davide Bilò, Thomas Erlebach, Matús Mihalák, Peter Widmayer |
Discovery of network properties with all-shortest-paths queries. |
Theor. Comput. Sci. |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Jörg Derungs, Riko Jacob, Peter Widmayer |
Approximate Shortest Paths Guided by a Small Index. |
Algorithmica |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Shantanu Das, Beat Gfeller, Peter Widmayer |
Computing All Best Swaps for Minimum-Stretch Tree Spanners. |
J. Graph Algorithms Appl. |
2010 |
DBLP BibTeX RDF |
|
| 1 | Holger Flier, Matús Mihalák, Anita Schöbel, Peter Widmayer, Anna Zych |
Vertex Disjoint Paths for Dispatching in Railways. |
ATMOS |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Yann Disser, Matús Mihalák, Peter Widmayer |
Reconstructing a Simple Polygon from Its Angles. |
SWAT |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Jérémie Chalopin, Shantanu Das, Peter Widmayer |
Rendezvous of Mobile Agents in Directed Graphs. |
DISC |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Andreas Emil Feldmann, Shantanu Das, Peter Widmayer |
Simple Cuts Are Fast and Good: Optimum Right-Angled Cuts in Solid Grids. |
COCOA |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Jérémie Chalopin, Shantanu Das, Yann Disser, Matús Mihalák, Peter Widmayer |
How Simple Robots Benefit from Looking Back. |
CIAC |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Beat Gfeller, Leon Peeters, Birgitta Weber, Peter Widmayer |
Single machine batch scheduling with release times. |
J. Comb. Optim. |
2009 |
DBLP DOI BibTeX RDF |
Online algorithms, Competitive analysis, Batch scheduling |
| 1 | Paolo Penna, Guido Proietti, Peter Widmayer |
Strongly polynomial-time truthful mechanisms in one shot. |
Theor. Comput. Sci. |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Michael Gatto, Jens Maue, Matús Mihalák, Peter Widmayer |
Shunting for Dummies: An Introductory Algorithmic Survey. |
Robust and Online Large-Scale Optimization |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Luzi Anderegg, Paolo Penna, Peter Widmayer |
Online Train Disposition: To Wait or Not to Wait? |
Robust and Online Large-Scale Optimization |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Paolo Penna, Florian Schoppmann, Riccardo Silvestri, Peter Widmayer |
Pseudonyms in Cost-Sharing Games. |
WINE |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Peter Widmayer |
How to Sort a Train. |
MFCS |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Davide Bilò, Yann Disser, Matús Mihalák, Subhash Suri, Elias Vicari, Peter Widmayer |
Reconstructing Visibility Graphs with Simple Robots. |
SIROCCO |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Davide Bilò, Michael Gatto, Luciano Gualà, Guido Proietti, Peter Widmayer |
Stability of Networks in Stretchable Graphs. |
SIROCCO |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Rastislav Srámek, Bernd Fischer, Elias Vicari, Peter Widmayer |
Optimal Transitions for Targeted Protein Quantification: Best Conditioned Submatrix Selection. |
COCOON |
2009 |
DBLP DOI BibTeX RDF |
submatrix selection problem, minimal condition number, bioinformatics |
| 1 | Subhash Suri, Elias Vicari, Peter Widmayer |
Simple Robots with Minimal Sensing: From Local Visibility to Global Geometry. |
I. J. Robotic Res. |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Paola Flocchini, Giuseppe Prencipe, Nicola Santoro, Peter Widmayer |
Arbitrary pattern formation by asynchronous, anonymous, oblivious robots. |
Theor. Comput. Sci. |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Paola Flocchini, Linda Pagli, Giuseppe Prencipe, Nicola Santoro, Peter Widmayer |
Computing all the best swap edges distributively. |
J. Parallel Distrib. Comput. |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | 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 |
DBLP DOI BibTeX RDF |
|
| 1 | Matteo Fischetti, Peter Widmayer |
ATMOS 2008 Abstracts Collection - 8th Workshop on Algorithmic Approaches for Transportation Modeling, Optimization, and Systems. |
ATMOS |
2008 |
DBLP BibTeX RDF |
|
| 1 | Matteo Fischetti, Peter Widmayer (eds.) |
ATMOS 2008 - 8th Workshop on Algorithmic Approaches for Transportation Modeling, Optimization, and Systems, Karlsruhe, Germany, September 18, 2008 |
ATMOS |
2008 |
DBLP BibTeX RDF |
|
| 1 | Matteo Fischetti, Peter Widmayer |
ATMOS 2008 Preface -- 8th Workshop on Algorithmic Approaches for Transportation Modeling, Optimization, and Systems. |
ATMOS |
2008 |
DBLP BibTeX RDF |
|
| 1 | Davide Bilò, Luciano Gualà, Guido Proietti, Peter Widmayer |
Computational Aspects of a 2-Player Stackelberg Shortest Paths Tree Game. |
WINE |
2008 |
DBLP DOI BibTeX RDF |
Network Pricing Games, Communication Networks, Stackelberg Games, Shortest Paths Tree |
| 1 | Shantanu Das, Matús Mihalák, Rastislav Srámek, Elias Vicari, Peter Widmayer |
Rendezvous of Mobile Agents When Tokens Fail Anytime. |
OPODIS |
2008 |
DBLP DOI BibTeX RDF |
Faulty Token, Fault Tolerance, Mobile Agents, Asynchronous, Rendezvous, Symmetry-breaking, Anonymous Networks |
| 1 | Beat Gfeller, Matús Mihalák, Subhash Suri, Elias Vicari, Peter Widmayer |
Angle Optimization in Target Tracking. |
SWAT |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Davide Bilò, Hans-Joachim Böckenhauer, Juraj Hromkovic, Richard Královic, Tobias Mömke, Peter Widmayer, Anna Zych |
Reoptimization of Steiner Trees. |
SWAT |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Davide Bilò, Thomas Erlebach, Matús Mihalák, Peter Widmayer |
Discovery of Network Properties with All-Shortest-Paths Queries. |
SIROCCO |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Jan Brunner, Matús Mihalák, Subhash Suri, Elias Vicari, Peter Widmayer |
Simple Robots in Polygonal Environments: A Hierarchy. |
ALGOSENSORS |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Davide Bilò, Peter Widmayer, Anna Zych |
Reoptimization of Weighted Graph and Covering Problems. |
WAOA |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Hans-Joachim Böckenhauer, Juraj Hromkovic, Tobias Mömke, Peter Widmayer |
On the Hardness of Reoptimization. |
SOFSEM |
2008 |
DBLP DOI BibTeX RDF |
reoptimization, approximation algorithms, inapproximability |
| 1 | Shantanu Das, Beat Gfeller, Peter Widmayer |
Computing Best Swaps in Optimal Tree Spanners. |
ISAAC |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Fedor V. Fomin, Petr A. Golovach, Alexander Hall, Matús Mihalák, Elias Vicari, Peter Widmayer |
How to Guard a Graph?. |
ISAAC |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Nicola Santoro, Peter Widmayer |
Agreement in synchronous networks with ubiquitous faults. |
Theor. Comput. Sci. |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Thomas Erlebach, Riko Jacob, Matús Mihalák, Marc Nunkesser, Gábor Szabó, Peter Widmayer |
An Algorithmic View on OVSF Code Assignment. |
Algorithmica |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | 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. |
Bioinformatics |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Juraj Hromkovic, Tobias Mömke, Kathleen Steinhöfel, Peter Widmayer |
Job Shop Scheduling with Unit Length Tasks: Bounds and Algorithms. |
Algorithmic Operations Research |
2007 |
DBLP BibTeX RDF |
|
| 1 | 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 Operations Research |
2007 |
DBLP BibTeX RDF |
|
| 1 | Alexander Hall, C. Pomm, Peter Widmayer |
A Combinatorial Approach to Multi-Domain Sketch Recognition. |
SBM |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Subhash Suri, Roger Wattenhofer, Peter Widmayer (eds.) |
Geometry in Sensor Networks, 09.04. - 13.04.2007 |
Geometry in Sensor Networks |
2007 |
DBLP BibTeX RDF |
|
| 1 | Subhash Suri, Roger Wattenhofer, Peter Widmayer |
07151 Abstracts Collection -- Geometry in Sensor Networks. |
Geometry in Sensor Networks |
2007 |
DBLP BibTeX RDF |
|
| 1 | Jörg Derungs, Riko Jacob, Peter Widmayer |
Approximate Shortest Paths Guided by a Small Index. |
WADS |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Michael Gatto, Peter Widmayer |
On the Robustness of Graham's Algorithm for Online Scheduling. |
WADS |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Beat Gfeller, Nicola Santoro, Peter Widmayer |
A Distributed Algorithm for Finding All Best Swap Edges of a Minimum Diameter Spanning Tree. |
DISC |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Beat Gfeller, Matús Mihalák, Subhash Suri, Elias Vicari, Peter Widmayer |
Counting Targets with Mobile Sensors in an Unknown Environment. |
ALGOSENSORS |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Luzi Anderegg, Stephan Eidenbenz, Leon Peeters, Peter Widmayer |
Optimal Placement of Ad-Hoc Devices Under a VCG-Style Routing Protocol. |
ALGOSENSORS |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Juraj Hromkovic, Richard Královic, Marc Nunkesser, Peter Widmayer (eds.) |
Stochastic Algorithms: Foundations and Applications, 4th International Symposium, SAGA 2007, Zurich, Switzerland, September 13-14, 2007, Proceedings |
SAGA |
2007 |
DBLP BibTeX RDF |
|
| 1 | Davide Bilò, Jörg Derungs, Luciano Gualà, Guido Proietti, Peter Widmayer |
Locating Facilities on a Network to Minimize Their Average Service Radius. |
ISAAC |
2007 |
DBLP DOI BibTeX RDF |
Graph radius, Graph treewidth, NP-hardness, Graph partition, Facility location problems |
| 1 | Subhash Suri, Elias Vicari, Peter Widmayer |
Simple Robots with Minimal Sensing: From Local Visibility to Global Geometry. |
AAAI |
2007 |
DBLP BibTeX RDF |
|
| 1 | Paolo Penna, Guido Proietti, Peter Widmayer |
Strongly Polynomial-Time Truthful Mechanisms in One Shot. |
WINE |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Beat Gfeller, Leon Peeters, Birgitta Weber, Peter Widmayer |
Online Single Machine Batch Scheduling. |
MFCS |
2006 |
DBLP DOI BibTeX RDF |
Scheduling, competitive ratio, batching, online analysis |
| 1 | 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 |
DBLP DOI BibTeX RDF |
|
| 1 | Guido Proietti, Peter Widmayer |
Partitioning the Nodes of a Graph to Minimize the Sum of Subgraph Radii. |
ISAAC |
2006 |
DBLP DOI BibTeX RDF |
Clustering problems, Graph radius, NP-hardness, Graph partition, Facility location problems |
| 1 | Paola Flocchini, Giuseppe Prencipe, Nicola Santoro, Peter Widmayer |
Gathering of asynchronous robots with limited visibility. |
Theor. Comput. Sci. |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Mirjam Wattenhofer, Roger Wattenhofer, Peter Widmayer |
Geometric Routing Without Geometry. |
SIROCCO |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Nicola Santoro, Peter Widmayer |
Majority and Unanimity in Synchronous Networks with Ubiquitous Dynamic Faults. |
SIROCCO |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Guido Proietti, Peter Widmayer |
A truthful mechanism for the non-utilitarian minimum radius spanning tree problem. |
SPAA |
2005 |
DBLP DOI BibTeX RDF |
pricing and equilibria in networks, algorithmic mechanism design, selfish agents, truthful mechanisms |
| 1 | Stephan Eidenbenz, Matthew Hennessy, Rafael Morales Bueno, Francisco Triguero Ruiz, Peter Widmayer, Ricardo Conejo |
Preface. |
Theor. Comput. Sci. |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | Enrico Nardelli, Guido Proietti, Peter Widmayer |
Nearly Linear Time Minimum Spanning Tree Maintenance for Transient Node Failures. |
Algorithmica |
2004 |
DBLP DOI BibTeX RDF |
Transient node failures, Fault tolerance, Graph algorithms, Minimum spanning tree, Algorithmic mechanism design |
| 1 | Roger Wattenhofer, Peter Widmayer |
The counting pyramid: an adaptive distributed counting scheme. |
J. Parallel Distrib. Comput. |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | Michael Gatto, Riko Jacob, Leon Peeters, Birgitta Weber, Peter Widmayer |
Theory on the Tracks: A Selection of Railway Optimization Problems (Column: Algorithmics). |
Bulletin of the EATCS |
2004 |
DBLP BibTeX RDF |
|
| 1 | Michael Gatto, Riko Jacob, Leon Peeters, Peter Widmayer |
Online Delay Management on a Single Train Line. |
ATMOS |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | Thomas Erlebach, Riko Jacob, Matús Mihalák, Marc Nunkesser, Gábor Szabó, Peter Widmayer |
An Algorithmic View on OVSF Code Assignment. |
STACS |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | Paola Flocchini, Linda Pagli, Giuseppe Prencipe, Nicola Santoro, Peter Widmayer, Tranos Zuva |
Computing All the Best Swap Edges Distributively. |
OPODIS |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | Michael Gatto, Björn Glaus, Riko Jacob, Leon Peeters, Peter Widmayer |
Railway Delay Management: Exploring Its Algorithmic Complexity. |
SWAT |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | Giovanna Melideo, Paolo Penna, Guido Proietti, Roger Wattenhofer, Peter Widmayer |
Truthful Mechanisms for Generalized Utilitarian Problems. |
IFIP TCS |
2004 |
DBLP BibTeX RDF |
|
| 1 | Mark Cieliebak, Thomas Erlebach, Fabian Hennecke, Birgitta Weber, Peter Widmayer |
Scheduling with Release Times and Deadlines on a Minimum Number of Machines. |
IFIP TCS |
2004 |
DBLP BibTeX RDF |
|
| 1 | Thomas Erlebach, Riko Jacob, Matús Mihalák, Marc Nunkesser, Gábor Szabó, Peter Widmayer |
Joint Base Station Scheduling. |
WAOA |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | Bernd Fischer, Volker Roth, Joachim M. Buhmann, Jonas Grossmann, Sacha Baginsky, Wilhelm Gruissem, Franz F. Roos, Peter Widmayer |
A Hidden Markov Model for de Novo Peptide Sequencing. |
NIPS |
2004 |
DBLP BibTeX RDF |
|
| 1 | Enrico Nardelli, Guido Proietti, Peter Widmayer |
Finding the most vital node of a shortest path. |
Theor. Comput. Sci. |
2003 |
DBLP DOI BibTeX RDF |
|
| 1 | Enrico Nardelli, Guido Proietti, Peter Widmayer |
Swapping a Failing Edge of a Single Source Shortest Paths Tree Is Good and Fast. |
Algorithmica |
2003 |
DBLP DOI BibTeX RDF |
|
| 1 | Nicole Weicker, Gábor Szabó, Karsten Weicker, Peter Widmayer |
Evolutionary multiobjective optimization for base station transmitter placement with frequency assignment. |
IEEE Trans. Evolutionary Computation |
2003 |
DBLP DOI BibTeX RDF |
|
| 1 | Konrad Schlude, Eljas Soisalon-Soininen, Peter Widmayer |
Distributed Search Trees: Fault Tolerance in an Asynchronous Environment. |
Theory Comput. Syst. |
2003 |
DBLP DOI BibTeX RDF |
|
| 1 | Stephan Eidenbenz, Peter Widmayer |
An Approximation Algorithm for Minimum Convex Cover with Logarithmic Performance Guarantee. |
SIAM J. Comput. |
2003 |
DBLP DOI BibTeX RDF |
|
| 1 | Gustavo Alonso, Evangelos Kranakis, Roger Wattenhofer, Peter Widmayer |
Probabilistic Protocols for Node Discovery in Ad-Hoc, Single Broadcast Channel Networks. |
IPDPS |
2003 |
DBLP DOI BibTeX RDF |
|
| 1 | Luzi Anderegg, Stephan Eidenbenz, Martin Gantenbein, Christoph Stamm, David Scot Taylor, Birgitta Weber, Peter Widmayer |
Train Routing Algorithms: Concepts, Design Choises, and Practical Considerations. |
ALENEX |
2003 |
DBLP BibTeX RDF |
|
| 1 | Gustavo Alonso, Evangelos Kranakis, Cindy Sawchuk, Roger Wattenhofer, Peter Widmayer |
Probabilistic Protocols for Node Discovery in Ad Hoc Multi-channel Broadcast Networks. |
ADHOC-NOW |
2003 |
DBLP DOI BibTeX RDF |
|
| 1 | Eljas Soisalon-Soininen, Peter Widmayer |
Single and Bulk Updates in Stratified Trees: An Amortized and Worst-Case Analysis. |
Computer Science in Perspective |
2003 |
DBLP DOI BibTeX RDF |
|
| 1 | Stephan Eidenbenz, Aris Pagourtzis, Peter Widmayer |
Flexible Train Rostering. |
ISAAC |
2003 |
DBLP DOI BibTeX RDF |
|
| 1 | Jens-Peter Dittrich, Bernhard Seeger, David Scot Taylor, Peter Widmayer |
On producing join results early. |
PODS |
2003 |
DBLP DOI BibTeX RDF |
data mining, query processing, spatial data, non-blocking, join processing |
| 1 | Evangelos Kranakis, Paolo Penna, Konrad Schlude, David Scot Taylor, Peter Widmayer |
Improving Customer Proximity to Railway Stations. |
CIAC |
2003 |
DBLP DOI BibTeX RDF |
|
| 1 | Luzi Anderegg, Paolo Penna, Peter Widmayer |
Online train disposition: to wait or not to wait? |
Electr. Notes Theor. Comput. Sci. |
2002 |
DBLP DOI BibTeX RDF |
|
| 1 | Peter Widmayer, Francisco Triguero Ruiz, Rafael Morales Bueno, Matthew Hennessy, Stephan Eidenbenz, Ricardo Conejo (eds.) |
Automata, Languages and Programming, 29th International Colloquium, ICALP 2002, Malaga, Spain, July 8-13, 2002, Proceedings |
ICALP |
2002 |
DBLP BibTeX RDF |
|
| 1 | Eljas Soisalon-Soininen, Peter Widmayer |
Amortized Complexity of Bulk Updates in AVL-Trees. |
SWAT |
2002 |
DBLP DOI BibTeX RDF |
|
| 1 | Aris Pagourtzis, Paolo Penna, Konrad Schlude, Kathleen Steinhöfel, David Scot Taylor, Peter Widmayer |
Server Placements, Roman Domination and other Dominating Set Variants. |
IFIP TCS |
2002 |
DBLP BibTeX RDF |
|
| 1 | Konrad Schlude, Eljas Soisalon-Soininen, Peter Widmayer |
Distributed Highly Available Search Trees. |
SIROCCO |
2002 |
DBLP BibTeX RDF |
|
![[Valid RSS]](Pics/valid-rss.png "Validate my RSS feed")