default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDAlgorithmica, Volume 26, 2000
Volume 26, Number 1, 2000
- Takao Nishizeki, Roberto Tamassia, Dorothea Wagner:
Foreword. 1-2 - Xiao Zhou, Syurei Tamura, Takao Nishizeki:
Finding Edge-Disjoint Paths in Partial k-Trees. 3-30 - Shiva Chaudhuri, K. V. Subrahmanyam
, Frank Wagner, Christos D. Zaroliagis:
Computing Mimicking Networks. 31-49 - Hiroshi Nagamochi, S. Nakamura, Toshihide Ibaraki:
A Simplified Õ(nm) Time Edge-Splitting Algorithm in Undirected Graphs. 50-67 - Ulrich Fößmeier, Michael Kaufmann:
On Exact Solutions for the Rectilinear Steiner Tree Problem Part I: Theoretical Results. 68-99 - Achilleas Papakostas, Ioannis G. Tollis:
Efficient Orthogonal Drawings of High Degree Graphs. 100-125 - Karsten Weihe, Thomas Willhalm:
Reconstructing the Topology of a CAD Model - a Discrete Approach. 126-147 - Rolf H. Möhring, Matthias Müller-Hannemann:
Complexity and Modeling Aspects of Mesh Refinement into Quadrilater. 148-171 - Michael Jünger, Giovanni Rinaldi, Stefan Thienel:
Practical Performance of Efficient Minimum Cut Algorithms. 172-195
Volume 26, Number 2, 2000
- Esther M. Arkin, Martin Held, Christopher L. Smith:
Optimization Problems Related to Zigzag Pocket Machining. 197-236 - Pascal Berthomé, Afonso Ferreira, Bruce M. Maggs, Stephane Perennes, C. Greg Plaxton:
Sorting-Based Selection Algorithms for Hypercubic Networks. 237-254 - Ee-Chien Chang, Chee-Keng Yap:
A Simultaneous Search Problem. 255-262 - Marilyn G. Andrews, Mikhail J. Atallah, Danny Z. Chen, D. T. Lee:
Parallel Algorithms for Maximum Matching in Complements of Interval Graphs and Related Problems. 263-289 - Takeaki Uno, Mutsunori Yagiura:
Fast Algorithms to Enumerate All Common Intervals of Two Permutations. 290-309
Volume 26, Numbers 3-4, 2000
- Rajeev Motwani, Prabhakar Raghavan:
Guest Editors' Foreword. 311-312 - Srinivas Akella, Wesley H. Huang, Kevin M. Lynch, Matthew T. Mason:
Parts Feeding on a Conveyor with a One Joint Robot. 313-344 - Marek Teichmann, Bud Mishra:
Probabilistic Algorithms for Efficient Grasping and Fixturing. 345-363 - Amy J. Briggs, Bruce Randall Donald:
Visibility-Based Planning of Sensor Control Strategies. 364-388 - Karl-Friedrich Böhringer, Vivek Bhatt, Bruce Randall Donald, Kenneth Y. Goldberg:
Algorithms for Sensorless Manipulation Using a Vibrating Surface. 389-429 - Steven M. LaValle:
Robot Motion Planning: A Game-Theoretic Foundation. 430-465 - Attawith Sudsang:
Grasping and In-Hand Manipulation: Geometry and Algorithms. 466-493 - A. Frank van der Stappen, Kenneth Y. Goldberg:
Geometric Eccentricity and the Complexity of Manipulation Plans. 494-514 - Russell G. Brown, Bruce Randall Donald:
Mobile Robot Self-Localization without Explicit Landmarks. 515-559 - Alessia Marigo, Massimo Ceccarelli, Simone Piccinocchi, Antonio Bicchi:
Planning Motions of Polyhedral Parts by Rolling. 560-576 - Dan Halperin, Jean-Claude Latombe, Randall H. Wilson:
A General Framework for Assembly Planning: The Motion Space Approach. 577-601
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-03-25 00:07 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:
