Christoph Ambühl - Concepedia

Author

Christoph Ambühl

Dalle Molle Institute for Artificial Intelligence Research

Also Known As

Ambühl, Christoph, C. Ambuhl, Christoph Ambuhl, Christoph Ambühl

Publications

975

Citations

H-Index

Concepts

All Affiliations

Dalle Molle Institute for Artificial Intelligence Research University of Liverpool Sapienza University of Rome University of Rome Tor Vergata ETH Zurich

About

Christoph Ambühl is an author at Dalle Molle Institute for Artificial Intelligence Research specializing in combinatorial optimization, engineering, and computer science.

Top Concepts

#	Concept	H-Index	Publications	Citations
1	Engineering	11	11	508
2	Business	1	1	12
3	Education	1	1	19
4	Natural Sciences	1	1	68
5	Computer Engineering	1	1	57

Christoph Ambühl

Publications

518

Citations

H-Index

Page 1

	Year	Citations
Inapproximability Results for Sparsest Cut, Optimal Linear Arrangement, and Precedence Constrained Scheduling Christoph Ambühl, Monaldo Mas, Ola Svensson Mathematical ProgrammingEngineeringSparsest CutComputational ComplexityDiscrete Optimization	2007	214
Inapproximability Results for Maximum Edge Biclique, Minimum Linear Arrangement, and Sparsest Cut Christoph Ambühl, Monaldo Mastrolilli, Ola Svensson SIAM Journal on Computing Mathematical ProgrammingRandomized Subexponential TimeSparsest Cut ProblemEngineeringPlanar Graph	2011	68
Tree exploration with logarithmic memory Christoph Ambühl, Leszek Gąsieniec, Andrzej Pelc, ACM Transactions on Algorithms EngineeringMachine LearningComputational ComplexityRange SearchingTree Automaton	2011	57
Single Machine Precedence Constrained Scheduling Is a Vertex Cover Problem Christoph Ambühl, Monaldo Mastrolilli Algorithmica Mathematical ProgrammingEngineeringGraph TheoryScheduling AnalysisVertex Cover Problem	2008	39
On the Approximability of Single-Machine Scheduling with Precedence Constraints Christoph Ambühl, Monaldo Mastrolilli, Nikolaus Mutsanas, Mathematics of Operations Research Mathematical ProgrammingVertex Cover GraphGraph TheoryEngineeringScheduling Analysis	2011	27
On-line scheduling to minimize max flow time: an optimal preemptive algorithm Christoph Ambühl, Monaldo Mastrolilli Operations Research Letters EngineeringScheduling AnalysisScheduling ProblemProduction SchedulingOptimal Preemptive Algorithm	2004	23
The range assignment problem in non-homogeneous static ad-hoc networks Christoph Ambühl, Andrea Clementi, Miriam Di Ianni, Range Assignment ProblemEngineeringWireless RoutingScheduling ProblemOptimization Problem	2004	22
The Clique Problem in Intersection Graphs of Ellipses and Triangles Christoph Ambühl, Uli Wagner Theory of Computing Systems Geometric Graph TheoryEngineeringGraph TheoryGeometryExtremal Graph Theory	2005	19
A new lower bound for the list update problem in the partial cost model Christoph Ambühl, Bernd Gärtner, Bernhard von Stengel Theoretical Computer Science Mathematical ProgrammingComputational Complexity TheoryEngineeringList Update ProblemPartial Cost Model	2001	15
On the approximability of the range assignment problem on radio networks in presence of selfish agents Christoph Ambühl, Andrea Clementi, Paolo Penna, Theoretical Computer Science Mathematical ProgrammingRange Assignment ProblemSelfish AgentsCognitive Radio Resource ManagementEngineering	2005	12

Page 1