default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDAlgorithmica, Volume 35, 2003
Volume 35, Number 1, January 2003
- Julien Basch, Leonidas J. Guibas, G. D. Ramkumar:
Reporting Red - Blue Intersections between Two Sets of Connected Line Segments. 1-20 - Peter Sanders, Sebastian Egner, Jan H. M. Korst:
Fast Concurrent Access to Parallel Disks. 21-55 - Enrico Nardelli, Guido Proietti
, Peter Widmayer:
Swapping a Failing Edge of a Single Source Shortest Paths Tree Is Good and Fast. 56-74 - Kurt Mehlhorn, Peter Sanders:
Scanning Multiple Sequences Via Cache Memory. 75-93
Volume 35, Number 2, February 2003
- Andrea E. F. Clementi, Paolo Penna, Afonso Ferreira, Stephane Perennes, Riccardo Silvestri:
The Minimum Range Assignment Problem on Linear Radio Networks. 95-110 - Abraham P. Punnen, François Margot, Santosh N. Kabadi:
TSP Heuristics: Domination Analysis and Complexity. 111-127 - David Pisinger:
Dynamic Programming on the Word RAM. 128-145 - Claire Kenyon, Nicolas Schabanel:
The Data Broadcast Problem with Non-Uniform Transmission Times. 146-175 - Lene M. Favrholdt, Morten N. Nielsen:
On-Line Edge-Coloring with a Fixed Number of Colors. 176-191
Volume 35, Number 3, March 2003
- Hon Wai Leong, Hiroshi Imai:
Guest Editors' Foreword. 193 - Mikhail J. Atallah, Danny Z. Chen, Ovidiu Daescu:
Efficient Parallel Algorithms for Planar st-Graphs. 194-215 - Hiroyuki Kazuyoshi:
An Approximation Algorithm for a Large-Scale Facility Location Problem. 216-224 - Yoshiyuki Takao:
Finding a Region with the Minimum Total L1 Distance from Prescribed Terminals. 225-256 - Vijaya Chung:
A Randomized Linear-Work EREW PRAM Algorithm to Find a Minimum Spanning Forest. 257-268 - Takeshi Hisao:
A Characterization of Planar Graphs by Pseudo-Line Arrangements. 269-285
Volume 35, Number 4, April 2003
- Subhash Suri, Tuomas Sandholm, Priyank Ramesh Warkhede:
Compressing Two-Dimensional Routing Tables. 287-300 - Lars Engebretsen:
An Explicit Lower Bound for TSP with Distances One and Two. 301-318 - Philip N. Klein, Robert H. B. Netzer, Hsueh-I Lu:
Detecting Race Conditions in Parallel Programs that Use Semaphores. 321-345 - Veli Mäkinen, Esko Ukkonen, Gonzalo Navarro:
Approximate Matching of Run-Length Compressed Strings. 347-369
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-11-02 21:05 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:
