Christoph Ambühl

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

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

On csauthors.net:

Bibliography

2017
SIGACT News Online Algorithms Column 31.
SIGACT News, 2017

2016
Minimum Energy Broadcasting in Wireless Geometric Networks.
Encyclopedia of Algorithms, 2016

2013
Optimal lower bounds for projective list update algorithms.
ACM Trans. Algorithms, 2013

2011
Tree exploration with logarithmic memory.
ACM Trans. Algorithms, 2011

Inapproximability Results for Maximum Edge Biclique, Minimum Linear Arrangement, and Sparsest Cut.
SIAM J. Comput., 2011

On the Approximability of Single-Machine Scheduling with Precedence Constraints.
Math. Oper. Res., 2011

2009
Single Machine Precedence Constrained Scheduling Is a Vertex Cover Problem.
Algorithmica, 2009

2008
Minimum Energy Broadcasting in Wireless Geometric Networks.
Proceedings of the Encyclopedia of Algorithms - 2008 Edition, 2008

Precedence Constraint Scheduling and Connections to Dimension Theory of Partial Orders.
Bulletin of the EATCS, 2008

2007
Call Control in Rings.
Algorithmica, 2007

Light-Weight Control of Non-responsive Traffic with Low Buffer Requirements.
Proceedings of the NETWORKING 2007. Ad Hoc and Sensor Networks, 2007

Scheduling with Precedence Constraints of Low Fractional Dimension.
Proceedings of the Integer Programming and Combinatorial Optimization, 2007

Inapproximability Results for Sparsest Cut, Optimal Linear Arrangement, and Precedence Constrained Scheduling.
Proceedings of the 48th Annual IEEE Symposium on Foundations of Computer Science (FOCS 2007), 2007

2006
Approximating Precedence-Constrained Single Machine Scheduling by Coloring.
Proceedings of the Approximation, 2006

Constant-Factor Approximation for Minimum-Weight (Connected) Dominating Sets in Unit Disk Graphs.
Proceedings of the Approximation, 2006

2005
On the approximability of the range assignment problem on radio networks in presence of selfish agents.
Theor. Comput. Sci., 2005

On-line scheduling to minimize max flow time: an optimal preemptive algorithm.
Oper. Res. Lett., 2005

The Clique Problem in Intersection Graphs of Ellipses and Triangles.
Theory Comput. Syst., 2005

An Optimal Bound for the MST Algorithm to Compute Energy Efficient Broadcast Trees in Wireless Networks.
Proceedings of the Automata, Languages and Programming, 32nd International Colloquium, 2005

2004
Parallel Prefetching and Caching Is Hard.
Proceedings of the STACS 2004, 2004

Efficient Algorithms for Low-Energy Bounded-Hop Broadcast in Ad-Hoc Wireless Networks.
Proceedings of the STACS 2004, 2004

The Range Assignment Problem in Non-Homogeneous Static Ad-Hoc Networks.
Proceedings of the 18th International Parallel and Distributed Processing Symposium (IPDPS 2004), 2004

2003
Energy Consumption in Radio Networks: Selfish Agents and Rewarding Mechanisms.
Proceedings of the Approximation and Online Algorithms, First International Workshop, 2003

2002
On the Clique Problem in Intersection Graphs of Ellipses.
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.
Theor. Comput. Sci., 2001

2000
Optimal Projective Algorithms for the List Update Problem.
Proceedings of the Automata, Languages and Programming, 27th International Colloquium, 2000

Computing Largest Common Point Sets under Approximate Congruence.
Proceedings of the Algorithms, 2000

Offline List Update is NP-Hard.
Proceedings of the Algorithms, 2000


  Loading...