default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID4. AAIM 2008: Shanghai, China
- Rudolf Fleischer, Jinhui Xu:
Algorithmic Aspects in Information and Management, 4th International Conference, AAIM 2008, Shanghai, China, June 23-25, 2008. Proceedings. Lecture Notes in Computer Science 5034, Springer 2008, ISBN 978-3-540-68865-5 - Ding-Zhu Du:
Double Partition: (6+epsilon)-Approximation for Minimum Weight Dominating Set in Unit Disk Graphs. 1 - Vijay V. Vazirani:
Nash Bargaining Via Flexible Budget Markets. 2 - Eric Angel, Evripidis Bampis, Laurent Gourvès:
On the Minimum Hitting Set of Bundles Problem. 3-14 - Nikhil Bansal, Ho-Leung Chan, Kirk Pruhs:
Speed Scaling with a Solar Cell. 15-26 - Christopher L. Barrett, Keith R. Bisset, Martin Holzer, Goran Konjevod
, Madhav V. Marathe, Dorothea Wagner:
Engineering Label-Constrained Shortest-Path Algorithms. 27-37 - Robert Benkoczi, Binay K. Bhattacharya, Qiaosheng Shi:
New Upper Bounds on Continuous Tree Edge-Partition Problem. 38-49 - Florian Berger, Rolf Klein, Doron Nussbaum, Jörg-Rüdiger Sack, Jiehua Yi:
A Meeting Scheduling Problem Respecting Time and Space. 50-59 - Nadja Betzler, Michael R. Fellows, Jiong Guo, Rolf Niedermeier, Frances A. Rosamond:
Fixed-Parameter Algorithms for Kemeny Scores. 60-71 - Vincenzo Bonifaci, Peter Korteweg, Alberto Marchetti-Spaccamela, Leen Stougie:
The Distributed Wireless Gathering Problem. 72-83 - Zhi-Zhong Chen, Ruka Tanahashi:
Approximating Maximum Edge 2-Coloring in Simple Graphs Via Local Improvement. 84-96 - Zhi-Zhong Chen, Ruka Tanahashi, Lusheng Wang:
An Improved Randomized Approximation Algorithm for Maximum Triangle Packing. 97-108 - Yam Ki Cheung, Ovidiu Daescu:
Line Facility Location in Weighted Regions. 109-119 - Marek Chrobak, Christoph Dürr, Mathilde Hurand, Julien Robert:
Algorithms for Temperature-Aware Task Scheduling in Microprocessor Systems. 120-130 - Daniel Delling, Marco Gaertler, Robert Görke, Dorothea Wagner:
Engineering Comparators for Graph Clusterings. 131-142 - Danny Dyer, Boting Yang, Öznur Yasar:
On the Fast Searching Problem. 143-154 - Jeff Edmonds, Kirk Pruhs, Jaisingh Solanki:
Confidently Cutting a Cake into Approximately Fair Pieces. 155-164 - Piotr Faliszewski, Edith Hemaspaandra, Lane A. Hemaspaandra, Jörg Rothe:
Copeland Voting Fully Resists Constructive Control. 165-176 - Piotr Faliszewski, Lane A. Hemaspaandra:
The Complexity of Power-Index Comparison. 177-187 - Michael R. Fellows, Henning Fernau:
Facility Location Problems: A Parameterized View. 188-199 - Hua Guo, Anil Maheshwari, Jörg-Rüdiger Sack:
Shortest Path Queries in Polygonal Domains. 200-211 - Zeyu Guo, He Sun, Hong Zhu:
A Fast 2-Approximation Algorithm for the Minimum Manhattan Network Problem. 212-223 - Gregory Z. Gutin, Arash Rafiey, Anders Yeo:
Minimum Cost Homomorphism Dichotomy for Oriented Cycles. 224-234 - Gregory Z. Gutin, Igor Razgon, Eun Jung Kim:
Minimum Leaf Out-Branching Problems. 235-246 - Stéphane Le Roux:
Graphs and Path Equilibria. 247-258 - Hanno Lefmann:
No lGrid-Points in Spaces of Small Dimension. 259-270 - Leo Liberti, Franco Raimondi:
The Secret Santa Problem. 271-279 - Shieu-Hong Lin:
Finding Optimal Refueling Policies in Transportation Networks. 280-291 - Naoto Miyoshi, Takeya Shigezumi, Ryuhei Uehara, Osamu Watanabe:
Scale Free Interval Graphs. 292-303 - Sadish Sadasivam, Huaming Zhang:
On Representation of Planar Graphs by Segments. 304-315 - Tianping Shuai, Donglei Du, Xiaoyue Jiang:
An Optimal On-Line Algorithm for Preemptive Scheduling on Two Uniform Machines in the lp Norm. 316-327 - Feifeng Zheng, E. Zhang, Yinfeng Xu, Xiaoping Wu:
An Optimal Strategy for Online Non-uniform Length Order Scheduling. 328-336 - Yunhong Zhou, Dennis M. Wilkinson, Robert Schreiber, Rong Pan:
Large-Scale Parallel Collaborative Filtering for the Netflix Prize. 337-348
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 2026-01-27 23:56 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:
