default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDAlgorithmica, Volume 40, 2004
Volume 40, Number 1, September 2004
- Mirela Damian, Sriram V. Pemmaraju:
Computing Optimal Diameter-Bounded Polygon Partitions. 1-14 - Vida Dujmovic, Sue Whitesides:
An Efficient Fixed Parameter Tractable Algorithm for 1-Sided Crossing Minimization. 15-31 - Giovanni Manzini
, Paolo Ferragina:
Engineering a Lightweight Suffix Array Construction Algorithm. 33-50 - Franziska Berger, Peter Gritzmann, Sven de Vries:
Minimum Cycle Bases for Network Graphs. 51-62
Volume 40, Number 2, October 2004
- Evanthia Papadopoulou:
The Hausdorff Voronoi Diagram of Point Clusters in the Plane. 63-82 - Jianer Chen, Donald K. Friesen, Weijia Jia, Iyad A. Kanj:
Using Nondeterminism to Design Efficient Deterministic Algorithms. 83-97 - Yih-En Andrew Ban, Sergey Bereg, Nabil H. Mustafa:
A Conjecture on Wiener Indices in Combinatorial Chemistry. 99-117 - Enrico Nardelli, Guido Proietti, Peter Widmayer:
Nearly Linear Time Minimum Spanning Tree Maintenance for Transient Node Failures. 119-132 - Marcin Peczarski:
New Results in Minimum-Comparison Sorting. 133-145
Volume 40, Number 3, November 2004
- Alon Efrat, Piotr Indyk, Suresh Venkatasubramanian:
Pattern Matching for Sets of Segments. 147-160 - Jianbo Qian, Cao An Wang:
A Linear-Time Approximation Scheme for Maximum Weight Triangulation of Convex Polygons. 161-172 - Yoshiharu Kohayakawa, Flávio Keidi Miyazawa, Prabhakar Raghavan, Yoshiko Wakabayashi:
Multidimensional Cube Packing. 173-187 - Sanjeev Arora, Kevin L. Chang:
Approximation Schemes for Degree-Restricted MST and Red-Blue Separation Problems. 189-210 - Erik D. Demaine, Mohammad Taghi Hajiaghayi:
Diameter and Treewidth in Minor-Closed Graph Families, Revisited. 211-215
Volume 40, Number 4, December 2004
- Stefano Leonardi:
Preface. 217 - Uriel Feige, László Lovász, Prasad Tetali:
Approximating Min Sum Set Cover. 219-234 - Michal Malafiejski, Krzysztof Giaro, Robert Janczewski, Marek Kubale:
Sum Coloring of Bipartite Graphs with Bounded Degree. 235-244 - Chaitanya Swamy, Amit Kumar:
Primal-Dual Algorithms for Connected Facility Location Problems. 245-269 - Spyros Angelopoulos, Allan Borodin:
The Power of Priority Algorithms for Facility Location and Set Cover. 271-291 - Liane Lewin-Eytan, Joseph Naor, Ariel Orda:
Admission Control in Networks with Advance Reservations. 293-304 - Nikhil Bansal, Kedar Dhamdhere, Jochen Könemann, Amitabh Sinha:
Non-Clairvoyant Scheduling for Minimizing Mean Slowdown. 305-318 - Maarten Lipmann, Xiwen Lu, Willem de Paepe, René Sitters, Leen Stougie:
On-Line Dial-a-Ride Problems Under a Restricted Information Model. 319-329
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-11-21 20:30 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:
