Christoph Ambühl

33 papers A* 4A 6B 5Journal 13Unranked 2
YearRankTypeTitle / Venue / Authors
2017 J jnl
SIGACT News Online Algorithms Column 31.
SIGACT News
Christoph Ambühl
2016 — ch.
Minimum Energy Broadcasting in Wireless Geometric Networks.
Encyclopedia of Algorithms
Christoph Ambühl
2013 J jnl
Optimal lower bounds for projective list update algorithms.
ACM Trans. Algorithms
Christoph Ambühl, Bernd Gärtner, Bernhard von Stengel
2011 J jnl
Inapproximability Results for Maximum Edge Biclique, Minimum Linear Arrangement, and Sparsest Cut.
SIAM J. Comput.
Christoph Ambühl, Monaldo Mastrolilli, Ola Svensson
2011 J jnl
On the Approximability of Single-Machine Scheduling with Precedence Constraints.
Math. Oper. Res.
Christoph Ambühl, Monaldo Mastrolilli, Nikolaus Mutsanas, Ola Svensson
2011 J jnl
Tree exploration with logarithmic memory.
ACM Trans. Algorithms
Christoph Ambühl, Leszek Gasieniec, Andrzej Pelc, Tomasz Radzik, Xiaohui Zhang
2010 J jnl
Optimal Projective Algorithms for the List Update Problem
CoRR
Christoph Ambühl, Bernd Gärtner, Bernhard von Stengel
2009 J jnl
Single Machine Precedence Constrained Scheduling Is a Vertex Cover Problem.
Algorithmica
Christoph Ambühl, Monaldo Mastrolilli
2008 — ch.
Minimum Energy Broadcasting in Wireless Geometric Networks.
Encyclopedia of Algorithms
Christoph Ambühl
2008 J jnl
Precedence Constraint Scheduling and Connections to Dimension Theory of Partial Orders.
Bull. EATCS
Christoph Ambühl, Monaldo Mastrolilli, Nikolaus Mutsanas, Ola Svensson
2007 J jnl
Call Control in Rings.
Algorithmica
Udo Adamy, Christoph Ambühl, R. Sai Anand, Thomas Erlebach
2007 A* conf
Inapproximability Results for Sparsest Cut, Optimal Linear Arrangement, and Precedence Constrained Scheduling.
FOCS
Christoph Ambühl, Monaldo Mastrolilli, Ola Svensson
2007 B conf
Light-Weight Control of Non-responsive Traffic with Low Buffer Requirements.
Networking
Venkatesh Ramaswamy, Leticia Cuellar, Stephan J. Eidenbenz, Nicolas W. Hengartner, Christoph Ambühl, Birgitta Weber
2007 B conf
Scheduling with Precedence Constraints of Low Fractional Dimension.
IPCO
Christoph Ambühl, Monaldo Mastrolilli, Nikolaus Mutsanas, Ola Svensson
2006 — conf
Approximating Precedence-Constrained Single Machine Scheduling by Coloring.
APPROX-RANDOM
Christoph Ambühl, Monaldo Mastrolilli, Ola Svensson
2006 — conf
Constant-Factor Approximation for Minimum-Weight (Connected) Dominating Sets in Unit Disk Graphs.
APPROX-RANDOM
Christoph Ambühl, Thomas Erlebach, Matús Mihalák, Marc Nunkesser
2006 A conf
Single Machine Precedence Constrained Scheduling Is a Vertex Cover Problem.
ESA
Christoph Ambühl, Monaldo Mastrolilli
2005 A* conf
An Optimal Bound for the MST Algorithm to Compute Energy Efficient Broadcast Trees in Wireless Networks.
ICALP
Christoph Ambühl
2005 J jnl
On the approximability of the range assignment problem on radio networks in presence of selfish agents.
Theor. Comput. Sci.
Christoph Ambühl, Andrea E. F. Clementi, Paolo Penna, Gianluca Rossi, Riccardo Silvestri
2005 J jnl
On-line scheduling to minimize max flow time: an optimal preemptive algorithm.
Oper. Res. Lett.
Christoph Ambühl, Monaldo Mastrolilli
2005 J jnl
The Clique Problem in Intersection Graphs of Ellipses and Triangles.
Theory Comput. Syst.
Christoph Ambühl, Uli Wagner
2004 A conf
Efficient Algorithms for Low-Energy Bounded-Hop Broadcast in Ad-Hoc Wireless Networks.
STACS
Christoph Ambühl, Andrea E. F. Clementi, Miriam Di Ianni, Nissan Lev-Tov, Angelo Monti, David Peleg, Gianluca Rossi, Riccardo Silvestri
2004 A conf
Parallel Prefetching and Caching Is Hard.
STACS
Christoph Ambühl, Birgitta Weber
2004 A conf
The Range Assignment Problem in Non-Homogeneous Static Ad-Hoc Networks.
IPDPS
Christoph Ambühl, Andrea E. F. Clementi, Miriam Di Ianni, Gianluca Rossi, Angelo Monti, Riccardo Silvestri
2003 B conf
Energy Consumption in Radio Networks: Selfish Agents and Rewarding Mechanisms.
SIROCCO
Christoph Ambühl, Andrea E. F. Clementi, Paolo Penna, Gianluca Rossi, Riccardo Silvestri
2003 B conf
Energy Consumption in Radio Networks: Selfish Agents and Rewarding Mechanisms.
WAOA
Christoph Ambühl, Andrea E. F. Clementi, Paolo Penna, Gianluca Rossi, Riccardo Silvestri
2002 A* conf
Call Control in Rings.
ICALP
Udo Adamy, Christoph Ambühl, R. Sai Anand, Thomas Erlebach
2002 B conf
On the Clique Problem in Intersection Graphs of Ellipses.
ISAAC
Christoph Ambühl, Uli Wagner
2002 — —
On the list update problem.
Christoph Ambühl
2001 J jnl
A new lower bound for the list update problem in the partial cost model.
Theor. Comput. Sci.
Christoph Ambühl, Bernd Gärtner, Bernhard von Stengel
2000 A conf
Computing Largest Common Point Sets under Approximate Congruence.
ESA
Christoph Ambühl, Samarjit Chakraborty, Bernd Gärtner
2000 A conf
Offline List Update is NP-Hard.
ESA
Christoph Ambühl
2000 A* conf
Optimal Projective Algorithms for the List Update Problem.
ICALP
Christoph Ambühl, Bernd Gärtner, Bernhard von Stengel