Christoph Ambühl

According to our database, Christoph Ambühl authored at least 29 papers between 2000 and 2017.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2017

SIGACT News Online Algorithms Column 31.

Christoph Ambühl

SIGACT News, 2017

2016

Minimum Energy Broadcasting in Wireless Geometric Networks.

Christoph Ambühl

Encyclopedia of Algorithms, 2016

2013

Optimal lower bounds for projective list update algorithms.

Christoph Ambühl, Bernd Gärtner, Bernhard von Stengel

ACM Trans. Algorithms, 2013

2011

Tree exploration with logarithmic memory.

Christoph Ambühl, Leszek Gasieniec, Andrzej Pelc, Tomasz Radzik, Xiaohui Zhang

ACM Trans. Algorithms, 2011

Inapproximability Results for Maximum Edge Biclique, Minimum Linear Arrangement, and Sparsest Cut.

Christoph Ambühl, Monaldo Mastrolilli, Ola Svensson

SIAM J. Comput., 2011

On the Approximability of Single-Machine Scheduling with Precedence Constraints.

Christoph Ambühl, Monaldo Mastrolilli, Nikolaus Mutsanas, Ola Svensson

Math. Oper. Res., 2011

2009

Single Machine Precedence Constrained Scheduling Is a Vertex Cover Problem.

Christoph Ambühl, Monaldo Mastrolilli

Algorithmica, 2009

2008

Minimum Energy Broadcasting in Wireless Geometric Networks.

Christoph Ambühl

Proceedings of the Encyclopedia of Algorithms - 2008 Edition, 2008

Precedence Constraint Scheduling and Connections to Dimension Theory of Partial Orders.

Christoph Ambühl, Monaldo Mastrolilli, Nikolaus Mutsanas, Ola Svensson

Bull. EATCS, 2008

2007

Call Control in Rings.

Udo Adamy, Christoph Ambühl, R. Sai Anand, Thomas Erlebach

Algorithmica, 2007

Light-Weight Control of Non-responsive Traffic with Low Buffer Requirements.

Venkatesh Ramaswamy, Leticia Cuellar, Stephan J. Eidenbenz, Nicolas W. Hengartner, Christoph Ambühl, Birgitta Weber

Proceedings of the NETWORKING 2007. Ad Hoc and Sensor Networks, 2007

Scheduling with Precedence Constraints of Low Fractional Dimension.

Christoph Ambühl, Monaldo Mastrolilli, Nikolaus Mutsanas, Ola Svensson

Proceedings of the Integer Programming and Combinatorial Optimization, 2007

Inapproximability Results for Sparsest Cut, Optimal Linear Arrangement, and Precedence Constrained Scheduling.

Christoph Ambühl, Monaldo Mastrolilli, Ola Svensson

Proceedings of the 48th Annual IEEE Symposium on Foundations of Computer Science (FOCS 2007), 2007

2006

Approximating Precedence-Constrained Single Machine Scheduling by Coloring.

Christoph Ambühl, Monaldo Mastrolilli, Ola Svensson

Proceedings of the Approximation, 2006

Constant-Factor Approximation for Minimum-Weight (Connected) Dominating Sets in Unit Disk Graphs.

Christoph Ambühl, Thomas Erlebach, Matús Mihalák, Marc Nunkesser

Proceedings of the Approximation, 2006

2005

On the approximability of the range assignment problem on radio networks in presence of selfish agents.

Christoph Ambühl, Andrea E. F. Clementi, Paolo Penna, Gianluca Rossi, Riccardo Silvestri

Theor. Comput. Sci., 2005

On-line scheduling to minimize max flow time: an optimal preemptive algorithm.

Christoph Ambühl, Monaldo Mastrolilli

Oper. Res. Lett., 2005

The Clique Problem in Intersection Graphs of Ellipses and Triangles.

Christoph Ambühl, Uli Wagner

Theory Comput. Syst., 2005

An Optimal Bound for the MST Algorithm to Compute Energy Efficient Broadcast Trees in Wireless Networks.

Christoph Ambühl

Proceedings of the Automata, Languages and Programming, 32nd International Colloquium, 2005

2004

Parallel Prefetching and Caching Is Hard.

Christoph Ambühl, Birgitta Weber

Proceedings of the STACS 2004, 2004

Efficient Algorithms for Low-Energy Bounded-Hop Broadcast in Ad-Hoc Wireless Networks.

Christoph Ambühl, Andrea E. F. Clementi, Miriam Di Ianni, Nissan Lev-Tov, Angelo Monti, David Peleg, Gianluca Rossi, Riccardo Silvestri

Proceedings of the STACS 2004, 2004

The Range Assignment Problem in Non-Homogeneous Static Ad-Hoc Networks.

Christoph Ambühl, Andrea E. F. Clementi, Miriam Di Ianni, Gianluca Rossi, Angelo Monti, Riccardo Silvestri

Proceedings of the 18th International Parallel and Distributed Processing Symposium (IPDPS 2004), 2004

2003

Energy Consumption in Radio Networks: Selfish Agents and Rewarding Mechanisms.

Christoph Ambühl, Andrea E. F. Clementi, Paolo Penna, Gianluca Rossi, Riccardo Silvestri

Proceedings of the Approximation and Online Algorithms, First International Workshop, 2003

2002

On the list update problem.

Christoph Ambühl

PhD thesis, 2002

On the Clique Problem in Intersection Graphs of Ellipses.

Christoph Ambühl, Uli Wagner

Proceedings of the Algorithms and Computation, 13th International Symposium, 2002

2001

A new lower bound for the list update problem in the partial cost model.

Christoph Ambühl, Bernd Gärtner, Bernhard von Stengel

Theor. Comput. Sci., 2001

2000

Optimal Projective Algorithms for the List Update Problem.

Christoph Ambühl, Bernd Gärtner, Bernhard von Stengel

Proceedings of the Automata, Languages and Programming, 27th International Colloquium, 2000

Computing Largest Common Point Sets under Approximate Congruence.

Christoph Ambühl, Samarjit Chakraborty, Bernd Gärtner

Proceedings of the Algorithms, 2000

Offline List Update is NP-Hard.

Christoph Ambühl

Proceedings of the Algorithms, 2000