| 2008 |
|---|
| 23 | EE | Christoph Ambühl:
Minimum Energy Broadcasting in Wireless Geometric Networks.
Encyclopedia of Algorithms 2008 |
| 2007 |
|---|
| 22 | EE | Christoph Ambühl,
Monaldo Mastrolilli,
Ola Svensson:
Inapproximability Results for Sparsest Cut, Optimal Linear Arrangement, and Precedence Constrained Scheduling.
FOCS 2007: 329-337 |
| 21 | EE | Christoph Ambühl,
Monaldo Mastrolilli,
Nikolaus Mutsanas,
Ola Svensson:
Scheduling with Precedence Constraints of Low Fractional Dimension.
IPCO 2007: 130-144 |
| 20 | EE | Venkatesh Ramaswamy,
Leticia Cuellar,
Stephan Eidenbenz,
Nicolas W. Hengartner,
Christoph Ambühl,
Birgitta Weber:
Light-Weight Control of Non-responsive Traffic with Low Buffer Requirements.
Networking 2007: 855-866 |
| 19 | EE | Udo Adamy,
Christoph Ambühl,
R. Sai Anand,
Thomas Erlebach:
Call Control in Rings.
Algorithmica 47(3): 217-238 (2007) |
| 2006 |
|---|
| 18 | EE | Christoph Ambühl,
Monaldo Mastrolilli,
Ola Svensson:
Approximating Precedence-Constrained Single Machine Scheduling by Coloring.
APPROX-RANDOM 2006: 15-26 |
| 17 | EE | Christoph Ambühl,
Thomas Erlebach,
Matús Mihalák,
Marc Nunkesser:
Constant-Factor Approximation for Minimum-Weight (Connected) Dominating Sets in Unit Disk Graphs.
APPROX-RANDOM 2006: 3-14 |
| 16 | EE | Christoph Ambühl,
Monaldo Mastrolilli:
Single Machine Precedence Constrained Scheduling Is a Vertex Cover Problem.
ESA 2006: 28-39 |
| 2005 |
|---|
| 15 | EE | Christoph Ambühl:
An Optimal Bound for the MST Algorithm to Compute Energy Efficient Broadcast Trees in Wireless Networks.
ICALP 2005: 1139-1150 |
| 14 | EE | Christoph Ambühl,
Monaldo Mastrolilli:
On-line scheduling to minimize max flow time: an optimal preemptive algorithm.
Oper. Res. Lett. 33(6): 597-602 (2005) |
| 13 | EE | Christoph Ambühl,
Andrea E. F. Clementi,
Paolo Penna,
Gianluca Rossi,
Riccardo Silvestri:
On the approximability of the range assignment problem on radio networks in presence of selfish agents.
Theor. Comput. Sci. 343(1-2): 27-41 (2005) |
| 12 | EE | Christoph Ambühl,
Uli Wagner:
The Clique Problem in Intersection Graphs of Ellipses and Triangles.
Theory Comput. Syst. 38(3): 279-292 (2005) |
| 2004 |
|---|
| 11 | EE | Christoph Ambühl,
Andrea E. F. Clementi,
Miriam Di Ianni,
Gianluca Rossi,
Angelo Monti,
Riccardo Silvestri:
The Range Assignment Problem in Non-Homogeneous Static Ad-Hoc Networks.
IPDPS 2004 |
| 10 | EE | Christoph Ambühl,
Birgitta Weber:
Parallel Prefetching and Caching Is Hard.
STACS 2004: 211-221 |
| 9 | EE | Christoph Ambühl,
Andrea E. F. Clementi,
Miriam Di Ianni,
Nissan Lev-Tov,
Angelo Monti,
David Peleg,
Gianluca Rossi,
Riccardo Silvestri:
Efficient Algorithms for Low-Energy Bounded-Hop Broadcast in Ad-Hoc Wireless Networks.
STACS 2004: 418-427 |
| 2003 |
|---|
| 8 | | Christoph Ambühl,
Andrea E. F. Clementi,
Paolo Penna,
Gianluca Rossi,
Riccardo Silvestri:
Energy Consumption in Radio Networks: Selfish Agents and Rewarding Mechanisms.
SIROCCO 2003: 1-16 |
| 7 | EE | Christoph Ambühl,
Andrea E. F. Clementi,
Paolo Penna,
Gianluca Rossi,
Riccardo Silvestri:
Energy Consumption in Radio Networks: Selfish Agents and Rewarding Mechanisms.
WAOA 2003: 248-251 |
| 2002 |
|---|
| 6 | EE | Udo Adamy,
Christoph Ambühl,
R. Sai Anand,
Thomas Erlebach:
Call Control in Rings.
ICALP 2002: 788-799 |
| 5 | EE | Christoph Ambühl,
Uli Wagner:
On the Clique Problem in Intersection Graphs of Ellipses.
ISAAC 2002: 489-500 |
| 2001 |
|---|
| 4 | EE | Christoph Ambühl,
Bernd Gärtner,
Bernhard von Stengel:
A new lower bound for the list update problem in the partial cost model.
Theor. Comput. Sci. 268(1): 3-16 (2001) |
| 2000 |
|---|
| 3 | | Christoph Ambühl:
Offline List Update is NP-Hard.
ESA 2000: 42-51 |
| 2 | | Christoph Ambühl,
Samarjit Chakraborty,
Bernd Gärtner:
Computing Largest Common Point Sets under Approximate Congruence.
ESA 2000: 52-63 |
| 1 | EE | Christoph Ambühl,
Bernd Gärtner,
Bernhard von Stengel:
Optimal Projective Algorithms for the List Update Problem.
ICALP 2000: 305-316 |
