The following pages link to Peter Widmayer (Q539451):
Displaying 50 items.
- (Q208914) (redirect page) (← links)
- Approximately counting approximately-shortest paths in directed acyclic graphs (Q260255) (← links)
- Finding the detour-critical edge of a shortest path between two nodes (Q293313) (← links)
- Computing all the best swap edges distributively (Q436830) (← links)
- Reconstructing visibility graphs with simple robots (Q442263) (← links)
- On robust online scheduling algorithms (Q539452) (← links)
- Gathering of asynchronous robots with limited visibility (Q557818) (← links)
- A polygon is determined by its angles (Q634250) (← links)
- How to guard a graph? (Q652526) (← links)
- Single machine batch scheduling with release times (Q732326) (← links)
- Mapping a polygon with holes using a compass (Q742420) (← links)
- An algorithmic view on OVSF code assignment (Q878438) (← links)
- On the power of safe locking (Q909495) (← links)
- Arbitrary pattern formation by asynchronous, anonymous, oblivious robots (Q955018) (← links)
- Discovery of network properties with all-shortest-paths queries (Q962167) (← links)
- Approximate shortest paths guided by a small index (Q973004) (← links)
- Strongly polynomial-time truthful mechanisms in one shot (Q1014632) (← links)
- Time-and space-optimal contour computation for a set of rectangles (Q1108000) (← links)
- An inherent bottleneck in distributed counting (Q1130325) (← links)
- On graphs preserving rectilinear shortest paths in the presence of obstacles (Q1179762) (← links)
- Class Steiner trees and VLSI-design (Q1276969) (← links)
- \(k\)-violation linear programming (Q1336744) (← links)
- Space-filling curves and their use in the design of geometric data structures (Q1391294) (← links)
- Finding the most vital node of a shortest path. (Q1401266) (← links)
- Swapping a failing edge of a single source shortest paths tree is good and fast (Q1566374) (← links)
- A faster computation of the most vital edge of a shortest path (Q1603442) (← links)
- A better scoring model for de novo peptide sequencing: the symmetric difference between explained and measured masses (Q1708430) (← links)
- Robust optimization in the presence of uncertainty: a generic approach (Q1745727) (← links)
- Distributed search trees: fault tolerance in an asynchronous environment (Q1762993) (← links)
- Polygon-constrained motion planning problems (Q1796426) (← links)
- Data delivery by energy-constrained mobile agents (Q1796430) (← links)
- The counting pyramid: an adaptive distributed counting scheme (Q1881286) (← links)
- Nearly linear time minimum spanning tree maintenance for transient node failures (Q1882530) (← links)
- Mapping simple polygons: how robots benefit from looking back (Q1939675) (← links)
- Corner cuts are close to optimal: from solid grids to polygons and back (Q1949103) (← links)
- An \(O(n^4)\) time algorithm to compute the bisection width of solid grid graphs (Q2258080) (← links)
- Agreement in synchronous networks with ubiquitous faults (Q2382676) (← links)
- Simple agents learn to find their way: an introduction on mapping polygons (Q2446308) (← links)
- (Q2708233) (← links)
- (Q2721983) (← links)
- (Q2729100) (← links)
- (Q2753951) (← links)
- Finding All the Best Swaps of a Minimum Diameter Spanning Tree Under Transient Edge Failures (Q2755058) (← links)
- (Q2762510) (← links)
- (Q2782238) (← links)
- Bribeproof Mechanisms for Two-Values Domains (Q2819466) (← links)
- Interval Selection with Machine-Dependent Intervals (Q2842155) (← links)
- Vertex Disjoint Paths for Dispatching in Railways. (Q2917287) (← links)
- Recurring Comparison Faults: Sorting and Finding the Minimum (Q2947883) (← links)
- Deterministic Symmetric Rendezvous in Arbitrary Graphs: Overcoming Anonymity, Failures and Uncertainty (Q2961404) (← links)
