The following pages link to Beat Gfeller (Q541661):
Displaying 12 items.
- Towards optimal range medians (Q541663) (← links)
- Single machine batch scheduling with release times (Q732326) (← links)
- Faster swap edge computation in minimum diameter spanning trees (Q2428664) (← links)
- Computing All Best Swaps for Minimum-Stretch Tree Spanners (Q3075610) (← links)
- Angle Optimization in Target Tracking (Q3512448) (← links)
- A Distributed Algorithm for Finding All Best Swap Edges of a Minimum Diameter Spanning Tree (Q3523213) (← links)
- Faster Swap Edge Computation in Minimum Diameter Spanning Trees (Q3541107) (← links)
- Computing Best Swaps in Optimal Tree Spanners (Q3596764) (← links)
- Towards Optimal Range Medians (Q3638057) (← links)
- Finding Longest Approximate Periodic Patterns (Q5199265) (← links)
- A randomized distributed algorithm for the maximal independent set problem in growth-bounded graphs (Q5401393) (← links)
- Online Single Machine Batch Scheduling (Q5756705) (← links)
