Christoph Ambühl

Available identifiers

zbMath Open ambuhl.christophMaRDI QIDQ813964

List of research outcomes

Publication	Date of Publication	Type
Optimal lower bounds for projective list update algorithms	2014-12-05	Paper
Tree exploration with logarithmic memory	2014-09-09	Paper
On the Approximability of Single-Machine Scheduling with Precedence Constraints	2012-05-24	Paper
Inapproximability Results for Maximum Edge Biclique, Minimum Linear Arrangement, and Sparsest Cut	2011-07-29	Paper
https://portal.mardi4nfdi.de/entity/Q3396634	2009-09-19	Paper
Approximation and Online Algorithms	2009-08-11	Paper
Single machine precedence constrained scheduling is a Vertex cover problem	2009-05-06	Paper
Single Machine Precedence Constrained Scheduling Is a Vertex Cover Problem	2008-03-11	Paper
Scheduling with Precedence Constraints of Low Fractional Dimension	2007-11-29	Paper
STACS 2004	2007-10-01	Paper
STACS 2004	2007-10-01	Paper
Approximating Precedence-Constrained Single Machine Scheduling by Coloring	2007-08-28	Paper
Constant-Factor Approximation for Minimum-Weight (Connected) Dominating Sets in Unit Disk Graphs	2007-08-28	Paper
Call control in rings	2007-04-26	Paper
On-line scheduling to minimize Max flow time: an optimal preemptive algorithm	2006-02-02	Paper
Automata, Languages and Programming	2006-01-10	Paper
On the approximability of the range assignment problem on radio networks in presence of selfish agents	2005-10-26	Paper
The clique problem in intersection graphs of ellipses and triangles	2005-06-14	Paper
https://portal.mardi4nfdi.de/entity/Q4737208	2004-08-11	Paper
https://portal.mardi4nfdi.de/entity/Q4427870	2003-09-14	Paper
A new lower bound for the list update problem in the partial cost model	2002-03-03	Paper
https://portal.mardi4nfdi.de/entity/Q2753921	2001-12-18	Paper
https://portal.mardi4nfdi.de/entity/Q2754153	2001-12-09	Paper
https://portal.mardi4nfdi.de/entity/Q2753922	2001-11-11	Paper

Research outcomes over time

This page was built for person: Christoph Ambühl