default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDAlgorithmica, Volume 41, 2005
Volume 41, Number 1, January 2005
- Irene Finocchi
, Alessandro Panconesi, Riccardo Silvestri:
An Experimental Analysis of Simple, Distributed Vertex Coloring Algorithms. 1-23 - Joan Feigenbaum, Sampath Kannan, Jian Zhang:
Computing Diameter in the Streaming and Sliding-Window Models. 25-41 - Refael Hassin, Asaf Levin:
Approximation Algorithms for Quickest Spanning Tree Problems. 43-52 - Guoliang Xue, Wei Xiao:
A Polynomial Time Approximation Scheme for Minimum Cost Delay-Constrained Multicast Tree under a Steiner Topology. 53-72
Volume 41, Number 2, February 2005
- Fedor V. Fomin, Pinar Heggernes, Jan Arne Telle:
Graph Searching, Elimination Trees, and a Generalization of Bandwidth. 73-87 - Gonzalo Navarro, Mathieu Raffinot:
New Techniques for Regular Expression Searching. 89-116 - Jochen Könemann, Asaf Levin, Amitabh Sinha:
Approximating the Degree-Bounded Minimum Diameter Spanning Tree Problem. 117-129 - Cees Duin:
A Branch-Checking Algorithm for All-Pairs Shortest Paths. 131-145
Volume 41, Number 3, March 2005
- Sariel Har-Peled, Soham Mazumdar:
Fast Algorithms for Computing the Smallest k-Enclosing Circle. 147-157 - Vladlen Koltun, Carola Wenk:
Matching Polyhedral Terrains Using Overlays of Envelopes. 159-183 - Sariel Har-Peled, Bardia Sadri:
How Fast Is the k-Means Method? 185-202 - Heikki Hyyrö, Gonzalo Navarro:
Bit-Parallel Witnesses and Their Applications to Approximate String Matching. 203-231
Volume 41, Number 4, April 2005
- Paz Carmi, Shlomi Dolev, Sariel Har-Peled, Matthew J. Katz, Michael Segal:
Geographic Quorum System Approximations. 233-244 - Erik D. Demaine, Mohammad Taghi Hajiaghayi, Dimitrios M. Thilikos:
Exponential Speedup of Fixed-Parameter Algorithms for Classes of Graphs Excluding Single-Crossing Graphs as Minors. 245-267 - Sorina Dumitrescu, Xiaolin Wu:
Optimal Two-Description Scalar Quantizer Design. 269-287 - Carsten Gutwenger, Petra Mutzel, René Weiskircher:
Inserting an Edge into a Planar Graph. 289-308 - Yi-Jen Chiang:
New Approximation Results for the Maximum Scatter TSP. 309-341
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-09-19 23:33 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:
