default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID5. AAIM 2009: San Francisco, CA, USA
- Andrew V. Goldberg, Yunhong Zhou:
Algorithmic Aspects in Information and Management, 5th International Conference, AAIM 2009, San Francisco, CA, USA, June 15-17, 2009. Proceedings. Lecture Notes in Computer Science 5564, Springer 2009, ISBN 978-3-642-02157-2 - Andrei Z. Broder:
Algorithmic Challenge in Online Advertising. 1 - Edward Y. Chang:
Parallel Algorithms for Collaborative Filtering. 2 - John Abraham, Zhixiang Chen, Richard H. Fowler, Bin Fu, Binhai Zhu:
On the Approximability of Some Haplotyping Problems. 3-14 - Daniel Andersson, Vladimir Gurvich, Thomas Dueholm Hansen:
On Acyclicity of Games with Cycles. 15-28 - Mauro Aprea, Esteban Feuerstein, Gustavo Sadovoy, Alejandro Strejilevich de Loma:
Discrete online TSP. 29-42 - Mary V. Ashley, Tanya Y. Berger-Wolf
, Wanpracha Art Chaovalitwongse, Bhaskar DasGupta, Ashfaq A. Khokhar, Saad I. Sheikh:
On Approximating an Implicit Cover Problem in Biology. 43-54 - Haris Aziz, Oded Lachish, Mike Paterson, Rahul Savani:
Power Indices in Spanning Connectivity Games. 55-67 - Andrew Byde, Terence Kelly, Yunhong Zhou, Robert Endre Tarjan:
Efficiently Generating k-Best Solutions to Procurement Auctions. 68-84 - Philip J. Charles, Jacob M. Howe, Andy King:
Integer Polyhedra for Program Analysis. 85-99 - Yam Ki Cheung, Ovidiu Daescu:
Line Segment Facility Location in Weighted Subdivisions. 100-113 - Francis Y. L. Chin, Marek Chrobak, Li Yan:
Algorithms for Placing Monitors in a Flow Network. 114-128 - Marek Chrobak, Jirí Sgall:
Three Results on Frequency Assignment in Linear Cellular Networks. 129-139 - Atlas F. Cook, Carola Wenk:
Link Distance and Shortest Path Problems in the Plane. 140-151 - Daniel Delling, Robert Görke, Christian Schulz, Dorothea Wagner:
Orca Reduction and ContrAction Graph Clustering. 152-165 - Xiaotie Deng, Jie Zhang:
Equiseparability on Terminal Wiener Index. 166-174 - Changxing Dong, Gerold Jäger, Dirk Richter, Paul Molitor:
Effective Tour Searching for TSP by Contraction of Pseudo Backbone Edges. 175-187 - Esteban Feuerstein, Pablo Ariel Heiber, Matías Lopez-Rosenfeld, Marcelo Mydlarz:
Optimal Auctions Capturing Constraints in Sponsored Search. 188-201 - Sumit Ganguly:
A Note on Estimating Hybrid Frequency Moment of Data Streams. 202-211 - Andrew V. Goldberg:
Two-Level Push-Relabel Algorithm for the Maximum Flow Problem. 212-225 - Jiong Guo, Christian Komusiewicz, Rolf Niedermeier, Johannes Uhlmann:
A More Relaxed Model for Graph-Based Data Clustering: s-Plex Editing. 226-239 - Scott Duke Kominers:
Dynamic Position Auctions with Consumer Search. 240-250 - Jon Lee, Shmuel Onn, Robert Weismantel:
Nonlinear Optimization over a Weighted Independence System. 251-264 - Fei Li:
Improved Online Algorithms for Multiplexing Weighted Packets in Bounded Buffers. 265-278 - Tim Nonner, Alexander Souza:
Latency Constrained Aggregation in Chain Networks Admits a PTAS. 279-291 - Amin Saberi, Ying Wang:
Cutting a Cake for Five People. 292-300 - Yi Wang, Hongjie Bai, Matt Stanton, Wen-Yen Chen, Edward Y. Chang:
PLDA: Parallel Latent Dirichlet Allocation for Large-Scale Applications. 301-314 - Feifeng Zheng, Yinfeng Xu, Chung Keung Poon:
On Job Scheduling with Preemption Penalties. 315-325
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.
last updated on 2025-12-12 01:06 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:
