Publications :: Search

Show author

On this page you see the details of the selected author.

Author information
First name:	Christoph
Last name:	Ambühl
DBLP:	31/1787
Rating:	(not rated yet)
Bookmark:

Below you find the publications which have been written by this author.

Show item 1 to 25 of 29  

Select a publication
Show	Title	Venue	Rating	Date
	Conference paper Christoph Ambühl, Bernd Gärtner, Bernhard von Stengel. A new lower bound for the list update problem in the partial cost model.	Theor. Comput. Sci. 2001, Volume 268	(0)	2001
	Conference paper Christoph Ambühl. An Optimal Bound for the MST Algorithm to Compute Energy Efficient Broadcast Trees in Wireless Networks.	Automata, Languages and Programming, 32nd International Colloquium, ICALP 2005, Lisbon, Portugal, July 11-15, 2005, Proceedings 2005	(0)	2005
	Conference paper Christoph Ambühl, Monaldo Mastrolilli, Ola Svensson. Approximating Precedence-Constrained Single Machine Scheduling by Coloring.	Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, 9th International Workshop on Approximation Algorithms for Combinatorial Optimization Problems, APPROX 2006 and 10th International Workshop on Randomization and Compu 2006	(0)	2006
	Conference paper Udo Adamy, Christoph Ambühl, R. Sai Anand, Thomas Erlebach. Call Control in Rings.	Algorithmica 2007, Volume 47	(0)	2007
	Conference paper Udo Adamy, Christoph Ambühl, R. Sai Anand, Thomas Erlebach. Call Control in Rings.	Automata, Languages and Programming, 29th International Colloquium, ICALP 2002, Malaga, Spain, July 8-13, 2002, Proceedings 2002	(0)	2002
	Conference paper Christoph Ambühl, Samarjit Chakraborty, Bernd Gärtner. Computing Largest Common Point Sets under Approximate Congruence.	Algorithms - ESA 2000, 8th Annual European Symposium, Saarbrücken, Germany, September 5-8, 2000, Proceedings 2000	(0)	2000
	Conference paper Christoph Ambühl, Thomas Erlebach, Matús Mihalák, Marc Nunkesser. Constant-Factor Approximation for Minimum-Weight (Connected) Dominating Sets in Unit Disk Graphs.	Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, 9th International Workshop on Approximation Algorithms for Combinatorial Optimization Problems, APPROX 2006 and 10th International Workshop on Randomization and Compu 2006	(0)	2006
	Conference paper Christoph Ambühl, Andrea E. F. Clementi, Miriam Di Ianni, Nissan Lev-Tov, Angelo Monti, David Peleg, Gianluca Rossi, Riccardo Silvestri. Efficient Algorithms for Low-Energy Bounded-Hop Broadcast in Ad-Hoc Wireless Networks.	STACS 2004, 21st Annual Symposium on Theoretical Aspects of Computer Science, Montpellier, France, March 25-27, 2004, Proceedings 2004	(0)	2004
	Conference paper Christoph Ambühl, Andrea E. F. Clementi, Paolo Penna, Gianluca Rossi, Riccardo Silvestri. Energy Consumption in Radio Networks: Selfish Agents and Rewarding Mechanisms.	SIROCCO 10: Proceedings of the 10th Internaltional Colloquium on Structural Information Complexity, June 18-20, 2003, Umeå Sweden 2003	(0)	2003
	Conference paper Christoph Ambühl, Andrea E. F. Clementi, Paolo Penna, Gianluca Rossi, Riccardo Silvestri. Energy Consumption in Radio Networks: Selfish Agents and Rewarding Mechanisms.	Approximation and Online Algorithms, First International Workshop, WAOA 2003, Budapest, Hungary, September 16-18, 2003, Revised Papers 2004	(0)	2003
	Conference paper Christoph Ambühl, Monaldo Mastrolilli, Ola Svensson. Inapproximability Results for Maximum Edge Biclique, Minimum Linear Arrangement, and Sparsest Cut.	SIAM J. Comput. 2011, Volume 40	(0)	2011
	Conference paper Christoph Ambühl, Monaldo Mastrolilli, Ola Svensson. Inapproximability Results for Sparsest Cut, Optimal Linear Arrangement, and Precedence Constrained Scheduling.	48th Annual IEEE Symposium on Foundations of Computer Science (FOCS 2007), October 20-23, 2007, Providence, RI, USA, Proceedings 2007	(0)	2007
	Conference paper Venkatesh Ramaswamy, Leticia Cuellar, Stephan Eidenbenz, Nicolas W. Hengartner, Christoph Ambühl, Birgitta Weber. Light-Weight Control of Non-responsive Traffic with Low Buffer Requirements.	NETWORKING 2007. Ad Hoc and Sensor Networks, Wireless Networks, Next Generation Internet, 6th International IFIP-TC6 Networking Conference, Atlanta, GA, USA, May 14-18, 2007, Proceedings 2007	(0)	2007
	Book chapter Christoph Ambühl. Minimum Energy Broadcasting in Wireless Geometric Networks.	Encyclopedia of Algorithms 2008	(0)	2008
	Conference paper Christoph Ambühl. Offline List Update is NP-Hard.	Algorithms - ESA 2000, 8th Annual European Symposium, Saarbrücken, Germany, September 5-8, 2000, Proceedings 2000	(0)	2000
	Conference paper Christoph Ambühl, Monaldo Mastrolilli, Nikolaus Mutsanas, Ola Svensson. On the Approximability of Single-Machine Scheduling with Precedence Constraints.	Math. Oper. Res. 2011, Volume 36	(0)	2011
	Conference paper Christoph Ambühl, Andrea E. F. Clementi, Paolo Penna, Gianluca Rossi, Riccardo Silvestri. On the approximability of the range assignment problem on radio networks in presence of selfish agents.	Theor. Comput. Sci. 2005, Volume 343	(0)	2005
	Conference paper Christoph Ambühl, Uli Wagner. On the Clique Problem in Intersection Graphs of Ellipses.	Algorithms and Computation, 13th International Symposium, ISAAC 2002 Vancouver, BC, Canada, November 21-23, 2002, Proceedings 2002	(0)	2002
	Conference paper Christoph Ambühl, Monaldo Mastrolilli. On-line scheduling to minimize max flow time: an optimal preemptive algorithm.	Oper. Res. Lett. 2005, Volume 33	(0)	2005
	Journal article Christoph Ambühl, Bernd Gärtner, Bernhard von Stengel. Optimal Projective Algorithms for the List Update Problem	CoRR 2010, Volume 0	(0)	2010
	Conference paper Christoph Ambühl, Bernd Gärtner, Bernhard von Stengel. Optimal Projective Algorithms for the List Update Problem.	Automata, Languages and Programming, 27th International Colloquium, ICALP 2000, Geneva, Switzerland, July 9-15, 2000, Proceedings 2000	(0)	2000
	Conference paper Christoph Ambühl, Birgitta Weber. Parallel Prefetching and Caching Is Hard.	STACS 2004, 21st Annual Symposium on Theoretical Aspects of Computer Science, Montpellier, France, March 25-27, 2004, Proceedings 2004	(0)	2004
	Journal article Christoph Ambühl, Monaldo Mastrolilli, Nikolaus Mutsanas, Ola Svensson. Precedence Constraint Scheduling and Connections to Dimension Theory of Partial Orders.	Bulletin of the EATCS 2008, Volume 95	(0)	2008
	Conference paper Christoph Ambühl, Monaldo Mastrolilli, Nikolaus Mutsanas, Ola Svensson. Scheduling with Precedence Constraints of Low Fractional Dimension.	Integer Programming and Combinatorial Optimization, 12th International IPCO Conference, Ithaca, NY, USA, June 25-27, 2007, Proceedings 2007	(0)	2007
	Conference paper Christoph Ambühl, Monaldo Mastrolilli. Single Machine Precedence Constrained Scheduling Is a Vertex Cover Problem.	Algorithmica 2009, Volume 53	(0)	2009

Show item 1 to 25 of 29  

Your query returned 29 matches in the database.