The following pages link to Christoph Ambühl (Q813964):
Displaying 25 items.
- (Q236643) (redirect page) (← links)
- On-line scheduling to minimize Max flow time: an optimal preemptive algorithm (Q813965) (← links)
- Call control in rings (Q878435) (← links)
- Single machine precedence constrained scheduling is a Vertex cover problem (Q1016523) (← links)
- The clique problem in intersection graphs of ellipses and triangles (Q1780844) (← links)
- On the approximability of the range assignment problem on radio networks in presence of selfish agents (Q2570125) (← links)
- (Q2753921) (← links)
- (Q2753922) (← links)
- (Q2754153) (← links)
- On the Approximability of Single-Machine Scheduling with Precedence Constraints (Q2884295) (← links)
- Optimal lower bounds for projective list update algorithms (Q2933662) (← links)
- Inapproximability Results for Maximum Edge Biclique, Minimum Linear Arrangement, and Sparsest Cut (Q3020016) (← links)
- Tree exploration with logarithmic memory (Q3188999) (← links)
- (Q3396634) (← links)
- Approximating Precedence-Constrained Single Machine Scheduling by Coloring (Q3595374) (← links)
- Constant-Factor Approximation for Minimum-Weight (Connected) Dominating Sets in Unit Disk Graphs (Q3595415) (← links)
- (Q4427870) (← links)
- (Q4737208) (← links)
- STACS 2004 (Q5309701) (← links)
- STACS 2004 (Q5309719) (← links)
- Scheduling with Precedence Constraints of Low Fractional Dimension (Q5429263) (← links)
- Single Machine Precedence Constrained Scheduling Is a Vertex Cover Problem (Q5449514) (← links)
- Automata, Languages and Programming (Q5716860) (← links)
- Approximation and Online Algorithms (Q5896937) (← links)
- A new lower bound for the list update problem in the partial cost model (Q5958711) (← links)
