The following pages link to Yann Disser (Q247925):
Displaying 50 items.
- (Q442260) (redirect page) (← links)
- Reconstructing visibility graphs with simple robots (Q442263) (← links)
- Improving the \(H_k\)-bound on the price of stability in undirected Shapley network design games (Q476904) (← links)
- A polygon is determined by its angles (Q634250) (← links)
- The minimum feasible tileset problem (Q666670) (← links)
- Mapping a polygon with holes using a compass (Q742420) (← links)
- An improved lower bound for competitive graph exploration (Q831137) (← links)
- Scheduling maintenance jobs in networks (Q1628599) (← links)
- Polygon-constrained motion planning problems (Q1796426) (← links)
- Mapping simple polygons: how robots benefit from looking back (Q1939675) (← links)
- Fractionally subadditive maximization under an incremental knapsack constraint (Q2085751) (← links)
- General bounds for incremental maximization (Q2118105) (← links)
- Collaborative delivery with energy-constrained mobile robots (Q2292912) (← links)
- On Friedmann's subexponential lower bound for Zadeh's pivot rule (Q2293086) (← links)
- The complexity of computing a robust flow (Q2294522) (← links)
- Evacuating two robots from a disk: a second cut (Q2303289) (← links)
- Fast collaborative graph exploration (Q2347797) (← links)
- Simple agents learn to find their way: an introduction on mapping polygons (Q2446308) (← links)
- Improved bounds for open online dial-a-ride on the line (Q2701389) (← links)
- Scheduling Transfers of Resources over Time: Towards Car-Sharing with Flexible Drop-Offs (Q2802942) (← links)
- Interval Selection with Machine-Dependent Intervals (Q2842155) (← links)
- Packing a Knapsack of Unknown Capacity (Q2965490) (← links)
- (Q3113680) (← links)
- Rectilinear Shortest Path and Rectilinear Minimum Spanning Tree with Neighborhoods (Q3195329) (← links)
- Tight Analysis of the Smartstart Algorithm for Online Dial-a-Ride on the Line (Q3300763) (← links)
- Reconstructing Visibility Graphs with Simple Robots (Q3408162) (← links)
- Scheduling Bidirectional Traffic on a Path (Q3448803) (← links)
- How Simple Robots Benefit from Looking Back (Q3563005) (← links)
- Reconstructing a Simple Polygon from Its Angles (Q3569875) (← links)
- Undirected Graph Exploration with ⊝(log log <i>n</i>) Pebbles (Q4575577) (← links)
- Tight Bounds for Online TSP on the Line (Q4575803) (← links)
- The Simplex Algorithm Is NP-Mighty (Q4629975) (← links)
- (Q4636607) (← links)
- Robust and Adaptive Search (Q4636624) (← links)
- Degree-Constrained Orientations of Embedded Graphs (Q4909567) (← links)
- Improving the H k -Bound on the Price of Stability in Undirected Shapley Network Design Games (Q4924646) (← links)
- Mapping Simple Polygons (Q4962194) (← links)
- Distance-Preserving Graph Contractions (Q4993321) (← links)
- Tight Bounds for Online TSP on the Line (Q5028340) (← links)
- (Q5090461) (← links)
- Hiring Secretaries over Time: The Benefit of Concurrent Employment (Q5108268) (← links)
- General Bounds for Incremental Maximization (Q5111374) (← links)
- Tight Bounds for Undirected Graph Exploration with Pebbles and Multiple Agents (Q5215469) (← links)
- Distance-Preserving Graph Contractions (Q5233754) (← links)
- Approximate lumpability for Markovian agent-based models using local symmetries (Q5235047) (← links)
- Packing a Knapsack of Unknown Capacity (Q5275439) (← links)
- Fast Collaborative Graph Exploration (Q5327462) (← links)
- Mapping a Polygon with Holes Using a Compass (Q5507395) (← links)
- (Q5875473) (← links)
- Collaborative delivery on a fixed path with homogeneous energy-constrained agents (Q5896883) (← links)
