Christoph Ambühl

ETH Zurich — Switzerland

Computer Science · Physical Sciences

15h-index976citations33works0.02yr avg
OpenAlex↗Google Scholar↗Lab page↗

Accepting Students?

No reports yet. Know if this professor is taking students?

Research Topics

Optimization and Search Problems(20), Complexity and Algorithms in Graphs(9), Scheduling and Optimization Algorithms(8), Mobile Ad Hoc Networks(6), Advanced Graph Theory Research(6)

Publications33 total

SIGACT News Online Algorithms Column 31
ACM SIGACT News·2017· 1 cited
Minimum Energy Broadcasting in Wireless Geometric Networks
Encyclopedia of Algorithms·2016· 1 cited
Optimal lower bounds for projective list update algorithms
ACM Transactions on Algorithms·2013· 7 citedOpen Access
On the Approximability of Single-Machine Scheduling with Precedence Constraints
Mathematics of Operations Research·2011· 27 citedOpen Access
Tree exploration with logarithmic memory
ACM Transactions on Algorithms·2011· 57 cited
Inapproximability Results for Maximum Edge Biclique, Minimum Linear Arrangement, and Sparsest Cut
SIAM Journal on Computing·2011· 68 citedOpen Access
Single Machine Precedence Constrained Scheduling Is a Vertex Cover Problem
Algorithmica·2008· 39 cited
Minimum Energy Broadcasting in Wireless Geometric Networks
Encyclopedia of Algorithms·2008
Precedence Constraint Scheduling and Connections to Dimension Theory of Partial Orders
2008· 10 citedOpen Access
Inapproximability Results for Sparsest Cut, Optimal Linear Arrangement, and Precedence Constrained Scheduling
Annual Symposium on Foundations of Computer Science·2007· 12 cited
Inapproximability Results for Sparsest Cut, Optimal Linear Arrangement, and Precedence Constrained Scheduling
2007· 214 citedOpen Access
Scheduling with Precedence Constraints of Low Fractional Dimension
Lecture notes in computer science·2007· 19 citedOpen Access
Call Control in Rings
Algorithmica·2007· 9 citedOpen Access
Light-Weight Control of Non-responsive Traffic with Low Buffer Requirements
Lecture notes in computer science·2007· 4 citedOpen Access
Approximating Precedence-Constrained Single Machine Scheduling by Coloring
Lecture notes in computer science·2006· 17 citedOpen Access
Single Machine Precedence Constrained Scheduling Is a Vertex Cover Problem
Lecture notes in computer science·2006· 13 cited
Constant-Factor Approximation for Minimum-Weight (Connected) Dominating Sets in Unit Disk Graphs
Lecture notes in computer science·2006· 165 cited
On the approximability of the range assignment problem on radio networks in presence of selfish agents
Theoretical Computer Science·2005· 12 cited
The Clique Problem in Intersection Graphs of Ellipses and Triangles
Theory of Computing Systems·2005· 19 citedOpen Access
An Optimal Bound for the MST Algorithm to Compute Energy Efficient Broadcast Trees in Wireless Networks
Lecture notes in computer science·2005· 96 cited
page 1 of 2Next →

Frequent Co-authors

Monaldo Mastrolilli(9), Ola Svensson(7), Bernd Gärtner(4), Andrea Clementi(4), Gianluca Del Rossi(4), Riccardo Silvestri(4), Nikolaus Mutsanas(3), Bernhard von Stengel(3), Birgitta Weber(3), Thomas Erlebach(2), Miriam Di Ianni(2), Angelo Monti(2), Uli Wagner(2), Paolo Penna(2), Monaldo Mas(1), Matúš Mihaľák(1), Marc Nunkesser(1), Leszek Gąsieniec(1), Andrzej Pelc(1), Tomasz Radzik(1)