default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDChristoph Ambühl
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2017
[j12]Christoph Ambühl:
SIGACT News Online Algorithms Column 31. SIGACT News 48(3): 68-82 (2017)- 2016
- [r2]Christoph Ambühl:
Minimum Energy Broadcasting in Wireless Geometric Networks. Encyclopedia of Algorithms 2016: 1305-1308 - 2013
- [j11]Christoph Ambühl, Bernd Gärtner, Bernhard von Stengel:
Optimal lower bounds for projective list update algorithms. ACM Trans. Algorithms 9(4): 31:1-31:18 (2013) - 2011
- [j10]Christoph Ambühl, Monaldo Mastrolilli
, Nikolaus Mutsanas, Ola Svensson:
On the Approximability of Single-Machine Scheduling with Precedence Constraints. Math. Oper. Res. 36(4): 653-669 (2011) - [j9]Christoph Ambühl, Monaldo Mastrolilli, Ola Svensson:
Inapproximability Results for Maximum Edge Biclique, Minimum Linear Arrangement, and Sparsest Cut. SIAM J. Comput. 40(2): 567-596 (2011) - [j8]Christoph Ambühl, Leszek Gasieniec, Andrzej Pelc, Tomasz Radzik, Xiaohui Zhang:
Tree exploration with logarithmic memory. ACM Trans. Algorithms 7(2): 17:1-17:21 (2011) - 2010
- [i1]Christoph Ambühl, Bernd Gärtner, Bernhard von Stengel:
Optimal Projective Algorithms for the List Update Problem. CoRR abs/1002.2440 (2010)
2000 – 2009
- 2009
- [j7]Christoph Ambühl, Monaldo Mastrolilli:
Single Machine Precedence Constrained Scheduling Is a Vertex Cover Problem. Algorithmica 53(4): 488-503 (2009) - 2008
- [j6]Christoph Ambühl, Monaldo Mastrolilli, Nikolaus Mutsanas, Ola Svensson:
Precedence Constraint Scheduling and Connections to Dimension Theory of Partial Orders. Bull. EATCS 95: 37-58 (2008) - [r1]Christoph Ambühl:
Minimum Energy Broadcasting in Wireless Geometric Networks. Encyclopedia of Algorithms 2008 - 2007
- [j5]Udo Adamy, Christoph Ambühl, R. Sai Anand, Thomas Erlebach:
Call Control in Rings. Algorithmica 47(3): 217-238 (2007) - [c17]Christoph Ambühl, Monaldo Mastrolilli, Ola Svensson:
Inapproximability Results for Sparsest Cut, Optimal Linear Arrangement, and Precedence Constrained Scheduling. FOCS 2007: 329-337 - [c16]Christoph Ambühl, Monaldo Mastrolilli, Nikolaus Mutsanas, Ola Svensson:
Scheduling with Precedence Constraints of Low Fractional Dimension. IPCO 2007: 130-144 - [c15]Venkatesh Ramaswamy, Leticia Cuellar, Stephan J. Eidenbenz, Nicolas W. Hengartner, Christoph Ambühl, Birgitta Weber:
Light-Weight Control of Non-responsive Traffic with Low Buffer Requirements. Networking 2007: 855-866 - 2006
- [c14]Christoph Ambühl, Thomas Erlebach, Matús Mihalák, Marc Nunkesser:
Constant-Factor Approximation for Minimum-Weight (Connected) Dominating Sets in Unit Disk Graphs. APPROX-RANDOM 2006: 3-14 - [c13]Christoph Ambühl, Monaldo Mastrolilli, Ola Svensson:
Approximating Precedence-Constrained Single Machine Scheduling by Coloring. APPROX-RANDOM 2006: 15-26 - [c12]Christoph Ambühl, Monaldo Mastrolilli:
Single Machine Precedence Constrained Scheduling Is a Vertex Cover Problem. ESA 2006: 28-39 - 2005
- [j4]Christoph Ambühl, Uli Wagner:
The Clique Problem in Intersection Graphs of Ellipses and Triangles. Theory Comput. Syst. 38(3): 279-292 (2005) - [j3]Christoph Ambühl, Monaldo Mastrolilli:
On-line scheduling to minimize max flow time: an optimal preemptive algorithm. Oper. Res. Lett. 33(6): 597-602 (2005) - [j2]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. 343(1-2): 27-41 (2005) - [c11]Christoph Ambühl:
An Optimal Bound for the MST Algorithm to Compute Energy Efficient Broadcast Trees in Wireless Networks. ICALP 2005: 1139-1150 - 2004
- [c10]Christoph Ambühl, Andrea E. F. Clementi, Miriam Di Ianni, Gianluca Rossi, Angelo Monti, Riccardo Silvestri:
The Range Assignment Problem in Non-Homogeneous Static Ad-Hoc Networks. IPDPS 2004 - [c9]Christoph Ambühl, Birgitta Weber:
Parallel Prefetching and Caching Is Hard. STACS 2004: 211-221 - [c8]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: 418-427 - 2003
- [c7]Christoph Ambühl, Andrea E. F. Clementi, Paolo Penna, Gianluca Rossi, Riccardo Silvestri:
Energy Consumption in Radio Networks: Selfish Agents and Rewarding Mechanisms. SIROCCO 2003: 1-16 - [c6]Christoph Ambühl, Andrea E. F. Clementi, Paolo Penna, Gianluca Rossi, Riccardo Silvestri:
Energy Consumption in Radio Networks: Selfish Agents and Rewarding Mechanisms. WAOA 2003: 248-251 - 2002
- [b1]Christoph Ambühl:
On the list update problem. ETH Zurich, Zürich, Switzerland, 2002 - [c5]Udo Adamy, Christoph Ambühl, R. Sai Anand, Thomas Erlebach:
Call Control in Rings. ICALP 2002: 788-799 - [c4]Christoph Ambühl, Uli Wagner:
On the Clique Problem in Intersection Graphs of Ellipses. ISAAC 2002: 489-500 - 2001
- [j1]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. 268(1): 3-16 (2001) - 2000
- [c3]Christoph Ambühl:
Offline List Update is NP-Hard. ESA 2000: 42-51 - [c2]Christoph Ambühl, Samarjit Chakraborty, Bernd Gärtner:
Computing Largest Common Point Sets under Approximate Congruence. ESA 2000: 52-63 - [c1]Christoph Ambühl, Bernd Gärtner, Bernhard von Stengel:
Optimal Projective Algorithms for the List Update Problem. ICALP 2000: 305-316
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2025-01-09 13:19 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
