Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDAlgorithmica, Volume 53, 2009
Volume 53, Number 1, January 2009
- Reuven Cohen
, Pierre Fraigniaud, David Ilcinkas, Amos Korman, David Peleg:
Labeling Schemes for Tree Representation. 1-15 - Piotr Berman, Jieun K. Jeong:
Consistent Sets of Secondary Structures in Proteins. 16-34 - José Soares, Marco Aurelio Stefanes:
Algorithms for Maximum Independent Set in Convex Bipartite Graphs. 35-49 - Lars Arge, Mark de Berg, Herman J. Haverkort:
Cache-Oblivious R-Trees. 50-68 - Bodo Manthey, L. Shankar Ram:
Approximation Algorithms for Multi-Criteria Traveling Salesman Problems. 69-88 - Mohammad Taghi Hajiaghayi, Guy Kortsarz, Mohammad R. Salavatipour:
Approximating Buy-at-Bulk and Shallow-Light k-Steiner Trees. 89-103 - Martin Hoefer:
Non-Cooperative Tree Creation. 104-131 - George Karakostas, Stavros G. Kolliopoulos:
Stackelberg Strategies for Selfish Routing in General Multicommodity Networks. 132-153
Volume 53, Number 2, February 2009
- Danny Z. Chen, D. T. Lee:
Guest Editors' Forward. 155-156 - Sergey Bereg, Ovidiu Daescu, Minghui Jiang:
A PTAS for Cutting Out Polygons with Lines. 157-171 - Joseph Wun-Tat Chan, Prudence W. H. Wong, Fencol C. C. Yung:
On Dynamic Bin Packing: An Improved Lower Bound and Resource Augmentation Analysis. 172-206 - Hiroshi Nagamochi:
A Detachment Algorithm for Inferring a Graph from Path Frequency. 207-224 - George Karakostas, Stavros G. Kolliopoulos:
Edge Pricing of Multicommodity Networks for Selfish Users with Elastic Demands. 225-249 - Xi Chen, Xiaotie Deng:
A Simplicial Approach for Discrete Fixed Point Theorems. 250-262
Volume 53, Number 3, March 2009
- Xujin Chen, Bo Chen:
Approximation Algorithms for Soft-Capacitated Facility Location in Capacitated Network Design. 263-297 - D. T. Lee, Tien-Ching Lin, Hsueh-I Lu:
Fast Algorithms for the Density Finding Problem. 298-313 - Amihood Amir, Ayelet Butman, Moshe Lewenstein, Ely Porat:
Real Two Dimensional Scaled Matching. 314-336 - Jan Arpe, Bodo Manthey:
Approximability of Minimum AND-Circuits. 337-357 - Fedor V. Fomin, Pierre Fraigniaud, Nicolas Nisse:
Nondeterministic Graph Searching: From Pathwidth to Treewidth. 358-373 - Joel I. Seiferas:
Sorting Networks of Logarithmic Depth, Further Simplified. 374-384 - Leah Epstein, Thomas Erlebach, Asaf Levin:
Variable Sized Online Interval Coloring with Bandwidth. 385-401 - Romeo Rizzi:
Minimum Weakly Fundamental Cycle Bases Are Hard To Find. 402-424 - Pangfeng Liu, May-Chen Kuo, Da-Wei Wang:
An Approximation Algorithm and Dynamic Programming for Reduction in Heterogeneous Environments. 425-453
Volume 53, Number 4, April 2009
- Yossi Azar, Thomas Erlebach:
Foreword. 455-456 - Mohammad Ali Abam, Mark de Berg, Sheung-Hung Poon, Bettina Speckmann:
Kinetic Collision Detection for Convex Fat Objects. 457-473 - Peyman Afshani, Timothy M. Chan:
Dynamic Connectivity for Axis-Parallel Rectangles. 474-487 - Christoph Ambühl, Monaldo Mastrolilli:
Single Machine Precedence Constrained Scheduling Is a Vertex Cover Problem. 488-503 - Tomás Ebenlendr, Wojciech Jawor, Jirí Sgall:
Preemptive Online Scheduling: Optimal Algorithms for All Speeds. 504-522 - Matthias Englert, Matthias Westermann:
Lower and Upper Bounds on FIFO Buffer Management in QoS Switches. 523-548 - Sumit Ganguly, Lakshminath Bhuvanagiri:
Hierarchical Sampling from Sketches: Estimating Functions over Data Streams. 549-582 - Friedrich Eisenbrand, Andreas Karrenbauer, Martin Skutella, Chihao Xu:
Multiline Addressing by Network Flow. 583-596 - Umberto Ferraro Petrillo, Irene Finocchi, Giuseppe F. Italiano:
The Price of Resiliency: a Case Study on Sorting with Memory Faults. 597-620
a service of 
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 2024-04-25 04:43 CEST 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:
