default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDJournal of Algorithms, Volume 37
Volume 37, Number 1, October 2000
- Howard J. Karloff:
Foreword. 1 - András A. Benczúr, David R. Karger
:
Augmenting Undirected Edge Connectivity in Õ(n2) Time. 2-36 - Martin Farach-Colton, Vincenzo Liberatore:
On Local Register Allocation. 37-65 - Naveen Garg, Goran Konjevod, R. Ravi:
A Polylogarithmic Approximation Algorithm for the Group Steiner Tree Problem. 66-84 - David A. Grable, Alessandro Panconesi:
Fast Distributed Algorithms for Brooks-Vizing Colorings. 85-120 - Ming-Deh A. Huang, Yiu-Chung Wong:
Extended Hilbert Irreducibility and Its Applications. 121-145 - Madhukar R. Korupolu, C. Greg Plaxton, Rajmohan Rajaraman:
Analysis of a Local Search Heuristic for Facility Location Problems. 146-188 - Raimund Seidel, Udo Adamy:
On the Exact Worst Case Query Complexity of Planar Point Location. 189-217 - Neal E. Young:
On-Line Paging Against Adversarially Biased Random Inputs. 218-235
Volume 37, Number 2, November 2000
- Kaihong Xu:
The Asymptotic Worst-Case Behavior of the FFD Heuristic for Small Items. 237-246 - Amihood Amir, Yonatan Aumann, Gad M. Landau, Moshe Lewenstein, Noa Lewenstein:
Pattern Matching with Swaps. 247-266 - Kevin Cattell, Frank Ruskey, Joe Sawada, Micaela Serra, C. Robert Miers:
Fast Algorithms to Generate Necklaces, Unlabeled Necklaces, and Irreducible Polynomials over GF(2). 267-282 - Yiannis S. Boutalis, Constantin Papaodysseus, Elias Koukoutsis:
A New Multichannel Recursive Least Squares Algorithm for Very Robust and Efficient Adaptive Filtering. 283-308 - Amihood Amir, Dmitry Keselman, Gad M. Landau, Moshe Lewenstein, Noa Lewenstein, Michael Rodeh:
Text Indexing and Dictionary Matching with One Error. 309-325 - Jørgen Bang-Jensen, Tibor Jordán:
Splitting Off Edges within a Specified Subset Preserving the Edge-Connectivity of the Graph. 326-343 - Sorana Froda:
On Assessing the Performance of Randomized Algorithms. 344-362 - Md. Saidur Rahman, Shin-Ichi Nakano, Takao Nishizeki:
Box-Rectangular Drawings of Plane Graphs. 363-398 - Michael T. Goodrich, Christopher G. Wagner:
A Framework for Drawing Planar Graphs with Curves and Polylines. 399-421 - Amotz Bar-Noy, Magnús M. Halldórsson, Guy Kortsarz, Ravit Salman, Hadas Shachnai:
Sum Multicoloring of Graphs. 422-450 - Adam Smith, Subhash Suri:
Rectangular Tiling in Multidimensional Arrays. 451-467 - Shay Kutten, Rafail Ostrovsky, Boaz Patt-Shamir:
The Las-Vegas Processor Identity Problem (How and When to Be Unique). 468-494 - David Pokrass Jacobs, Robert E. Jamison:
Complexity of Recognizing Equal Unions in Families of Sets. 495-504 - Celina M. H. de Figueiredo, Sulamita Klein, Yoshiharu Kohayakawa, Bruce A. Reed:
Finding Skew Partitions Efficiently. 505-521 - Sebastian Böcker, David Bryant, Andreas W. M. Dress, Mike A. Steel:
Algorithmic Aspects of Tree Amalgamation. 522-537 - Subhas C. Nandy, Bhargab B. Bhattacharya, Antonio Hernández-Barrera:
Safety Zone Problem. 538-569 - David Eppstein:
Incremental and Decremental Maintenance of Planar Width. 570-577
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-12-04 01:27 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:
