The SCEAS System
| |||||||

## Search the dblp DataBase
Christoph Ambühl:
[Publications]
[Author Rank by year]
[Co-authors]
[Prefers]
[Cites]
[Cited by]
## Publications of Author- Christoph Ambühl, Thomas Erlebach, Matús Mihalák, Marc Nunkesser
**Constant-Factor Approximation for Minimum-Weight (Connected) Dominating Sets in Unit Disk Graphs.**[Citation Graph (0, 0)][DBLP] APPROX-RANDOM, 2006, pp:3-14 [Conf] - Christoph Ambühl, Monaldo Mastrolilli, Ola Svensson
**Approximating Precedence-Constrained Single Machine Scheduling by Coloring.**[Citation Graph (0, 0)][DBLP] APPROX-RANDOM, 2006, pp:15-26 [Conf] - Christoph Ambühl
**Offline List Update is NP-Hard.**[Citation Graph (0, 0)][DBLP] ESA, 2000, pp:42-51 [Conf] - Christoph Ambühl, Samarjit Chakraborty, Bernd Gärtner
**Computing Largest Common Point Sets under Approximate Congruence.**[Citation Graph (0, 0)][DBLP] ESA, 2000, pp:52-63 [Conf] - Christoph Ambühl, Monaldo Mastrolilli
**Single Machine Precedence Constrained Scheduling Is a Vertex Cover Problem.**[Citation Graph (0, 0)][DBLP] ESA, 2006, pp:28-39 [Conf] - Udo Adamy, Christoph Ambühl, R. Sai Anand, Thomas Erlebach
**Call Control in Rings.**[Citation Graph (0, 0)][DBLP] ICALP, 2002, pp:788-799 [Conf] - Christoph Ambühl
**An Optimal Bound for the MST Algorithm to Compute Energy Efficient Broadcast Trees in Wireless Networks.**[Citation Graph (0, 0)][DBLP] ICALP, 2005, pp:1139-1150 [Conf] - Christoph Ambühl, Bernd Gärtner, Bernhard von Stengel
**Optimal Projective Algorithms for the List Update Problem.**[Citation Graph (0, 0)][DBLP] ICALP, 2000, pp:305-316 [Conf] - 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.**[Citation Graph (0, 0)][DBLP] IPDPS, 2004, pp:- [Conf] - Christoph Ambühl, Uli Wagner
**On the Clique Problem in Intersection Graphs of Ellipses.**[Citation Graph (0, 0)][DBLP] ISAAC, 2002, pp:489-500 [Conf] - Christoph Ambühl, Andrea E. F. Clementi, Paolo Penna, Gianluca Rossi, Riccardo Silvestri
**Energy Consumption in Radio Networks: Selfish Agents and Rewarding Mechanisms.**[Citation Graph (0, 0)][DBLP] SIROCCO, 2003, pp:1-16 [Conf] - 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.**[Citation Graph (0, 0)][DBLP] STACS, 2004, pp:418-427 [Conf] - Christoph Ambühl, Birgitta Weber
**Parallel Prefetching and Caching Is Hard.**[Citation Graph (0, 0)][DBLP] STACS, 2004, pp:211-221 [Conf] - Christoph Ambühl, Andrea E. F. Clementi, Paolo Penna, Gianluca Rossi, Riccardo Silvestri
**Energy Consumption in Radio Networks: Selfish Agents and Rewarding Mechanisms.**[Citation Graph (0, 0)][DBLP] WAOA, 2003, pp:248-251 [Conf] - Christoph Ambühl, Uli Wagner
**The Clique Problem in Intersection Graphs of Ellipses and Triangles.**[Citation Graph (0, 0)][DBLP] Theory Comput. Syst., 2005, v:38, n:3, pp:279-292 [Journal] - Christoph Ambühl, Monaldo Mastrolilli
**On-line scheduling to minimize max flow time: an optimal preemptive algorithm.**[Citation Graph (0, 0)][DBLP] Oper. Res. Lett., 2005, v:33, n:6, pp:597-602 [Journal] - 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.**[Citation Graph (0, 0)][DBLP] Theor. Comput. Sci., 2005, v:343, n:1-2, pp:27-41 [Journal] - Christoph Ambühl, Bernd Gärtner, Bernhard von Stengel
**A new lower bound for the list update problem in the partial cost model.**[Citation Graph (0, 0)][DBLP] Theor. Comput. Sci., 2001, v:268, n:1, pp:3-16 [Journal] - Christoph Ambühl, Monaldo Mastrolilli, Nikolaus Mutsanas, Ola Svensson
**Scheduling with Precedence Constraints of Low Fractional Dimension.**[Citation Graph (0, 0)][DBLP] IPCO, 2007, pp:130-144 [Conf] - Udo Adamy, Christoph Ambühl, R. Sai Anand, Thomas Erlebach
**Call Control in Rings.**[Citation Graph (0, 0)][DBLP] Algorithmica, 2007, v:47, n:3, pp:217-238 [Journal] **Inapproximability Results for Sparsest Cut, Optimal Linear Arrangement, and Precedence Constrained Scheduling.**[Citation Graph (, )][DBLP]**Light-Weight Control of Non-responsive Traffic with Low Buffer Requirements.**[Citation Graph (, )][DBLP]**Single Machine Precedence Constrained Scheduling Is a Vertex Cover Problem.**[Citation Graph (, )][DBLP]**Optimal Projective Algorithms for the List Update Problem**[Citation Graph (, )][DBLP]
Search in 0.003secs, Finished in 0.004secs | |||||||

| |||||||

| |||||||

System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002 for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002 |