default search action
Algorithmica, Volume 30, 2001
Volume 30, Number 1, 2001
- David Fernández-Baca:
On Nonlinear Parametric Search. 1-11 - Tak Wah Lam, Fung Ling Yue:
Optimal Edge Ranking of Trees in Linear Time. 12-33 - Amir M. Ben-Amram, Zvi Galil:
A Generalization of a Lower Bound Technique due to Fredman and Saks. 34-66 - Jean-Daniel Boissonnat, Jurek Czyzowicz, Olivier Devillers, Mariette Yvinec:
Circular Separability of Polygons. 67-82 - Daniel J. Rosenkrantz, Lin Yu, S. S. Ravi:
Efficient Construction of Minimum Makespan Schedules for Tasks with a Fixed Number of Distinct Execution Times. 83-100 - Ran El-Yaniv, Amos Fiat, Richard M. Karp, G. Turpin:
Optimal Search and One-Way Trading Online Algorithms. 101-139
Volume 30, Number 2, 2001
- Marc J. van Kreveld:
Guest Editor's Foreword. 141-143 - Christopher M. Gold, Jack Snoeyink:
A One-Step Crust and Skeleton Extraction Algorithm. 144-163 - Arnon Amir, Alon Efrat, Piotr Indyk, Hanan Samet:
Efficient Regular Data Structures and Algorithms for Dilation, Location, and Proximity Problems. 164-187 - Dimitris Papadias, Nikos Mamoulis, Yannis Theodoridis:
Constraint-Based Processing of Multiway Spatial Joins. 188-215 - Vladimir Estivill-Castro, Michael E. Houle:
Robust Distance-Based Clustering with Applications to Spatial Data Mining. 216-242 - James J. Little, Ping Shi:
Structural Lines, TINs, and DEMs. 243-263 - William S. Evans, David G. Kirkpatrick, G. Townsend:
Right-Triangulated Irregular Networks. 264-286 - M. Lonergan, Cliff B. Jones:
An Iterative Displacement Method for Conflict Resolution in Map Generalization. 287-301 - William A. Mackaness, Ross S. Purves:
Automated Displacement for Large Numbers of Discrete Map Objects. 302-311 - Nicolas Regnauld:
Contextual Building Typification in Automated Map Generalization. 312-333 - Frank Wagner, Alexander Wolff, Vikas Kapoor, Tycho Strijk:
Three Rules Suffice for Good Label Placement. 334-349
Volume 30, Number 3, 2001
- Klaus Jansen, José D. P. Rolim:
Guest Editors' Introduction. 351-352 - Joseph Cheriyan, Tibor Jordán, Zeev Nutov:
On Rooted Node-Connectivity Problems. 353-375 - Prasad Tetali, Santosh S. Vempala:
Random Sampling of Euler Tours. 376-385 - Marek Karpinski:
Polynomial Time Approximation Schemes for Some Dense Instances of NP-Hard Optimization Problems. 386-397 - Maxim Sviridenko:
Best Possible Approximation Algorithm for MAX SAT with Cardinality Constraint. 398-405 - V. Kumar:
An Approximation Algorithm for Circular Arc Colouring. 406-417 - Michael E. Saks, Shiyu Zhou:
Sample Spaces with Small Bias on Neighborhoods and Error-Correcting Communication Protocols. 418-431 - Guy Kortsarz:
On the Hardness of Approximating Spanners. 432-450 - Christoph Baur, Sándor P. Fekete:
Approximation of Geometric Dispersion Problems. 451-470
Volume 30, Number 4, 2001
- Giuseppe F. Italiano:
Guest Editor's Introduction. 471-472 - Adam L. Buchsbaum, Raffaele Giancarlo, Jeffery R. Westbrook:
An Approximate Determinization Algorithm for Weighted Finite-State Automata. 503-526 - Mark Lanthier, Anil Maheshwari, Jörg-Rüdiger Sack:
Approximating Shortest Paths on Weighted Polyhedral Surfaces. 527-562 - Martin Held:
FIST: Fast Industrial-Strength Triangulation of Polygons. 563-596 - Thomas Christof, Gerhard Reinelt:
Algorithmic Aspects of Using Small Instance Relaxations in Parallel Branch-and-Cut. 597-629 - Bram de Jager, J. Banens:
VISOR: Vast Independence System Optimization Routine. 630-644 - Myungho Lee, Wenheng Liu, Viktor K. Prasanna:
Parallel Implementation of a Class of Adaptive Signal Processing Applications. 645-684 - Bruno Codenotti, Mauro Leoncini, Franco P. Preparata:
The Role of Arithmetic in Fast Parallel Matrix Inversion. 685-707 - Victor Y. Pan, Yanqiang Yu:
Certification of Numerical Computation of the Sign of the Determinant of a Matrix. 708-724
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.