default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDAlgorithmica, Volume 28, 2000
Volume 28, Number 1, 2000
- Gerhard J. Woeginger:
Introduction. 1 - Johannes Blömer:
Denesting by Bounded Degree Radicals. 2-15 - Ulrik Brandes, Dorothea Wagner:
A Linear Time Algorithm for the Arc Disjoint Menger Problem in Planar Directed Graphs. 16-36 - Krzysztof Diks, Andrzej Pelc:
Optimal Adaptive Broadcasting with a Bounded Fraction of Faulty Nodes. 37-50 - Hristo N. Djidjev
:
Partitioning Planar Graphs with Vertex Costs: Algorithms and Applications. 51-75 - Daniele Frigioni, Giuseppe F. Italiano:
Dynamically Switching Vertices in Planar Graphs. 76-103 - Vladimir Grebinski, Gregory Kucherov:
Optimal Reconstruction of Graphs under the Additive Model. 104-124 - Bala Kalyanasundaram, Kirk Pruhs:
Fault-Tolerant Real-Time Scheduling. 125-144 - Luca Trevisan:
Approximating Satisfiable Satisfiability Problems. 145-172
Volume 28, Number 2, 2000
- Steven S. Seiden:
Online Randomized Multiprocessor Scheduling. 173-216 - Danny Z. Chen, Wei Chen, Koichi Wada, Kimio Kawaguchi:
Parallel Algorithms for Partitioning Sorted Sets and Related Problems. 217-241 - Eric Ruppert:
Finding the k Shortest Paths in Parallel. 242-254 - Teofilo F. Gonzalez:
Simple Algorithms for the On-Line Multidimensional Dictionary and Related Problems. 255-267
Volume 28, Number 3, 2000
- Bala Kalyanasundaram, Kirk Pruhs, Eric Torng:
Errata: A New Algorithm for Scheduling Periodic, Real-Time Tasks. 269-270 - John H. Reif:
Fast Spatial Decomposition and Closest Pair Computation for Limited Precision Input. 271-287 - Desh Ranjan, Enrico Pontelli, Gopal Gupta, Luc Longpré:
The Temporal Precedence Problem. 288-306 - Jesus Garcia-Lopez, Pedro A. Ramos:
A Unified Approach to Conic Visibility. 307-322 - Lenwood S. Heath, John Paul C. Vergara:
Sorting by Short Block-Moves. 323-354 - Mark de Berg:
Linear Size Binary Space Partitions for Uncluttered Scenes. 353-366
Volume 28, Number 4, 2000
- Hristo N. Djidjev, Grammati E. Pantziou, Christos D. Zaroliagis:
Improved Algorithms for Dynamic Shortest Paths. 367-389 - Hsiao-Feng Steven Chen, D. T. Lee:
A Faster One-Dimensional Topological Compaction Algorithm with Jog Insertion. 390-421 - Nili Guttmann-Beck, Refael Hassin, Samir Khuller, Balaji Raghavachari:
Approximation Algorithms with Bounded Performance Guarantees for the Clustered Traveling Salesman Problem. 422-437 - Bruce M. Maggs, Berthold Vöcking:
Improved Routing and Sorting on Multibutterflies. 438-437
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-02-02 22:29 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:
