default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDAlgorithmica, Volume 50, 2008
Volume 50, Number 1, January 2008
- Dimitris Fotakis
:
On the Competitive Ratio for Online Facility Location. 1-57 - Min-Te Sun, Chih-Wei Yi, Chuan-Kai Yang, Ten-Hwang Lai:
An Optimal Algorithm for the Minimum Disc Cover Problem. 58-71 - Nir Naaman, Raphael Rom:
Average Case Analysis of Bounded Space Bin Packing Algorithms. 72-97 - Anupam Gupta, Aravind Srinivasan, Éva Tardos:
Cost-Sharing Mechanisms for Network Design. 98-119 - Raffaella Gentilini, Carla Piazza, Alberto Policriti:
Symbolic Graphs: Linear Solutions to Connectivity Related Problems. 120-158 - Leonid Khachiyan, Endre Boros, Khaled M. Elbassioni, Vladimir Gurvich:
On Enumerating Minimal Dicuts and Strongly Connected Subgraphs. 159-172
Volume 50, Number 2, February 2008
- Frank K. H. A. Dehne, Jörg-Rüdiger Sack:
Introduction to Special Issue. 173-174 - Minkyoung Cho, David M. Mount:
Improved Approximation Bounds for Planar Point Pattern Matching. 175-207 - Karim Douïeb, Stefan Langerman:
Dynamic Hotlinks. 208-222 - Kazuo Iwama, Andrzej Lingas, Masaki Okita:
Max-Stretch Reduction for Tree Spanners. 223-235 - Timothy M. Chan:
All-Pairs Shortest Paths with Real Weights in O ( n 3/log n ) Time. 236-243 - André Berger, Ojas Parekh:
Linear Time Algorithms for Generalized Edge Dominating Set Problems. 244-254 - Ilya Baran, Erik D. Demaine, Dmitriy A. Katz:
Optimally Adaptive Integration of Univariate Lipschitz Functions. 255-278 - Michael A. Bender, David P. Bunde, Erik D. Demaine, Sándor P. Fekete, Vitus J. Leung, Henk Meijer, Cynthia A. Phillips:
Communication-Aware Processor Allocation for Supercomputers: Finding Point Sets of Small Average Distance. 279-298
Volume 50, Number 3, March 2008
- Bang Ye Wu, Chih-Yuan Hsiao, Kun-Mao Chao:
The Swap Edges of a Multiple-Sources Routing Tree. 299-311 - Patchrawat Uthaisombut:
Generalization of EDF and LLF: Identifying All Optimal Online Algorithms for Minimizing Maximum Lateness. 312-328 - Petra Berenbrink, Tom Friedetzky, Russell A. Martin:
On the Stability of Dynamic Diffusion Load Balancing. 329-350 - Richard Cole, Lukasz Kowalik:
New Linear-Time Algorithms for Edge-Coloring Planar Graphs. 351-368 - Vincent Berry, Zeshan Peng, H. F. Ting:
From Constrained to Unconstrained Maximum Agreement Subtree in Linear Time. 369-385 - Iris Reinbacher, Marc Benkert, Marc J. van Kreveld, Joseph S. B. Mitchell, Jack Snoeyink, Alexander Wolff:
Delineating Boundaries for Imprecise Regions. 386-414
Volume 50, Number 4, April 2008
- José R. Correa, Marcos A. Kiwi:
Foreword. 415-417 - Nayantara Bhatnagar, Dana Randall, Vijay V. Vazirani, Eric Vigoda:
Random Bichromatic Matchings. 418-445 - Béla Bollobás, Guy Kindler, Imre Leader, Ryan O'Donnell:
Eliminating Cycles in the Discrete Torus. 446-454 - Marek Chrobak, Claire Kenyon, John Noga, Neal E. Young:
Incremental Medians via Online Bidding. 455-478 - Parikshit Gopalan, Venkatesan Guruswami, Richard J. Lipton:
Algorithms for Modular Counting of Roots of Multivariate Polynomials. 479-496 - Loïck Lhote, Brigitte Vallée:
Gaussian Laws for the Main Parameters of the Euclid Algorithms. 497-554 - Mariko Sakashita, Kazuhisa Makino, Satoru Fujishige:
Minimum Cost Source Location Problems with Flow Requirements. 555-583 - Ilya Baran, Erik D. Demaine, Mihai Patrascu:
Subquadratic Algorithms for 3SUM. 584-596
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-01-22 20:21 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:
