@article{Blomer/00,
AUTHOR = {Bl{\"o}mer, J.},
TITLE = {Denesting by bounded degree radicals},
JOURNAL = {Algorithmica},
VOLUME = {28},
NUMBER = {1},
PAGES = {2-15},
YEAR = {2000},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
}
@article{Brandes-Wagner/00,
AUTHOR = {Brandes, U. and Wagner, D.},
TITLE = {A linear time algorithm for the arc disjoint Menger problem in planar directed graphs},
JOURNAL = {Algorithmica},
VOLUME = {28},
NUMBER = {1},
PAGES = {16-36},
YEAR = {2000},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
}
@article{Diks-Pelc/00,
AUTHOR = {Diks, K. and Pelc, A.},
TITLE = {Optimal adaptive broadcasting with a bounded fraction of faulty nodes},
JOURNAL = {Algorithmica},
VOLUME = {28},
NUMBER = {1},
PAGES = {37-50},
YEAR = {2000},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
}
@article{Djidjev/00,
AUTHOR = {Djidjev, H.N.},
TITLE = {Partitioning planar graphs with vertex costs: Algorithms and applications},
JOURNAL = {Algorithmica},
VOLUME = {28},
NUMBER = {1},
PAGES = {51-75},
YEAR = {2000},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
}
@article{Frigioni-Italiano/00,
AUTHOR = {Frigioni, D. and Italiano, G.F.},
TITLE = {Dynamically switching vertices in planar graphs},
JOURNAL = {Algorithmica},
VOLUME = {28},
NUMBER = {1},
PAGES = {76-103},
YEAR = {2000},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
}
@article{Grebinski-Kucherov/00,
AUTHOR = {Grebinski, V. and Kucherov, G.},
TITLE = {Optimal reconstruction of graphs under the additive model},
JOURNAL = {Algorithmica},
VOLUME = {28},
NUMBER = {1},
PAGES = {104-124},
YEAR = {2000},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
}
@article{Kalyanasundaram-Pruhs/00,
AUTHOR = {Kalyanasundaram, B. and Pruhs, K.},
TITLE = {Fault-tolerant real-time scheduling},
JOURNAL = {Algorithmica},
VOLUME = {28},
NUMBER = {1},
PAGES = {125-144},
YEAR = {2000},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
}
@article{Trevisan/00,
AUTHOR = {Trevisan, L.},
TITLE = {Approximating satisfiable satisfiability problems},
JOURNAL = {Algorithmica},
VOLUME = {28},
NUMBER = {1},
PAGES = {145-172},
YEAR = {2000},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
}
@article{Seiden/00,
AUTHOR = {Seiden, S.S.},
TITLE = {Online randomized multiprocessor scheduling},
JOURNAL = {Algorithmica},
VOLUME = {28},
PAGES = {173-216},
YEAR = {2000},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
}
@article{Chen-Chen-Wada-Kawaguchi/00,
AUTHOR = {Chen, D.Z. and Chen, W. and Wada, K. and Kawaguchi, K.},
TITLE = {Parallel algorithms for partitioning sorted sets and related problems},
JOURNAL = {Algorithmica},
VOLUME = {28},
PAGES = {217-241},
YEAR = {2000},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
}
@article{Ruppert/00,
AUTHOR = {Ruppert, E.},
TITLE = {Finding the $k$ shortest paths in parallel},
JOURNAL = {Algorithmica},
VOLUME = {28},
PAGES = {242-254},
YEAR = {2000},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
}
@article{Gonzalez/00,
AUTHOR = {Gonzalez, T.F.},
TITLE = {Simple algorithms for the on-line multidimensional dictionary and related problems},
JOURNAL = {Algorithmica},
VOLUME = {28},
PAGES = {255-267},
YEAR = {2000},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
}
@article{Reif-Tate/00,
AUTHOR = {Reif, J.H. and Tate, S.R.},
TITLE = {Fast spatial decomposition and closest pair computation for limited precision input},
JOURNAL = {Algorithmica},
VOLUME = {28},
PAGES = {271-287},
YEAR = {2000},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
}
@article{Ranjan-Pontelli-Gupta-Longpre/00,
AUTHOR = {Ranjan, D. and Pontelli, E. and Gupta, G. and Longpre, L.},
TITLE = {The temporal precedence problem},
JOURNAL = {Algorithmica},
VOLUME = {28},
PAGES = {288-306},
YEAR = {2000},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
}
@article{Garcia-Lopez-Ramos/00,
AUTHOR = {Garc{\'{i}}a-L{\'{o}}pez, J. and Ramos, P.A.},
TITLE = {A unified approach to conic visibility},
JOURNAL = {Algorithmica},
VOLUME = {28},
PAGES = {307-322},
YEAR = {2000},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
}
@article{Heath-Vergara/00,
AUTHOR = {Heath, L.S. and Vergara, J.P.C.},
TITLE = {Sorting by short block-moves},
JOURNAL = {Algorithmica},
VOLUME = {28},
PAGES = {323-352},
YEAR = {2000},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
}
@article{de_Berg/00,
AUTHOR = {de Berg, M.},
TITLE = {Linear size binary space partitions for uncluttered scenes},
JOURNAL = {Algorithmica},
VOLUME = {28},
PAGES = {353-366},
YEAR = {2000},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
}
@article{Djidjev-Pantziou-Zaroliagis/00,
AUTHOR = {Djidjev, H.N. and Pantziou, G.E. and Zaroliagis, C.D.},
TITLE = {Improved algorithms for dynamic shortest paths},
JOURNAL = {Algorithmica},
VOLUME = {28},
PAGES = {367-389},
YEAR = {2000},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
}
@article{Chen-Lee/00,
AUTHOR = {Chen, H. Steven and Lee, D.T.},
TITLE = {A faster one-dimensional topological compaction algorithm with jog insertion},
JOURNAL = {Algorithmica},
VOLUME = {28},
PAGES = {390-421},
YEAR = {2000},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
}
@article{Guttman-Beck-Hassin-Khuller-Raghavachari/00,
AUTHOR = {Guttman-Beck, N. and Hassin, R. and Khuller, S. and Raghavachari, B.},
TITLE = {Approximation algorithms with bounded performance guarantees for the clustered Traveling Salesman problem},
JOURNAL = {Algorithmica},
VOLUME = {28},
PAGES = {422-437},
YEAR = {2000},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
}
@article{Maggs-Vocking/00,
AUTHOR = {Maggs, B.M. and V{\"o}cking, B.},
TITLE = {Improved routing and sorting on multibutterflies},
JOURNAL = {Algorithmica},
VOLUME = {28},
PAGES = {438-464},
YEAR = {2000},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
}
@article{Fortune/00,
AUTHOR = {Fortune, S.},
TITLE = {Introduction},
JOURNAL = {Algorithmica},
VOLUME = {27},
NUMBER = {1},
PAGES = {1-4},
YEAR = {2000},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
}
@article{Sugihara-Iri-Inagaki-Imai/00,
AUTHOR = {Sugihara, K. and Iri, M. and Inagaki, H. and Imai, T.},
TITLE = {Topology-oriented implementation --- An approach to robust geometric algorithms},
JOURNAL = {Algorithmica},
VOLUME = {27},
NUMBER = {1},
PAGES = {5-20},
YEAR = {2000},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
}
@article{Bronnimann-Yvinec/00,
AUTHOR = {Br{\"o}nnimann, H. and Yvinec, M.},
TITLE = {Efficient exact evaluation of signs of determinants},
JOURNAL = {Algorithmica},
VOLUME = {27},
NUMBER = {1},
PAGES = {21-56},
YEAR = {2000},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
}
@article{Milenkovic/00,
AUTHOR = {Milenkovic, V.J.},
TITLE = {Shortest path geometric rounding},
JOURNAL = {Algorithmica},
VOLUME = {27},
NUMBER = {1},
PAGES = {57-86},
YEAR = {2000},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
}
@article{Burnikel-Fleischer-Mehlhorn-Schirra/00,
AUTHOR = {Burnikel, C. and Fleischer, R. and Mehlhorn, K. and Schirra, S.},
TITLE = {A strong and easily computable separation bound for arithmetic expressions involving radicals},
JOURNAL = {Algorithmica},
VOLUME = {27},
NUMBER = {1},
PAGES = {87-99},
YEAR = {2000},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
}
@article{Bajaj-Royappa/00,
AUTHOR = {Bajaj, C.L. and Royappa, A.V.},
TITLE = {Parameterization in finite precision},
JOURNAL = {Algorithmica},
VOLUME = {27},
NUMBER = {1},
PAGES = {100-114},
YEAR = {2000},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
}
@article{Kapoor-Ramesh/00,
AUTHOR = {Kapoor, S. and Ramesh, H.},
TITLE = {An algorithm for enumerating all spanning trees of a directed graph},
JOURNAL = {Algorithmica},
VOLUME = {27},
NUMBER = {2},
PAGES = {120-130},
YEAR = {2000},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
}
@article{Bar-Yehuda/00,
AUTHOR = {Bar-Yehuda, R.},
TITLE = {One for the price of two: A unified approach for approximating covering problems},
JOURNAL = {Algorithmica},
VOLUME = {27},
NUMBER = {2},
PAGES = {131-144},
YEAR = {2000},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
}
@article{Navarro-Barbosa-Baeza-Yates-Cunto-Ziviani/00,
AUTHOR = {Navarro, G. and Barbosa, E.F. and Baeza-Yates, R. and Cunto, W. and Ziviani, N.},
TITLE = {Binary searching with nonuniform costs and its application to text retrieval},
JOURNAL = {Algorithmica},
VOLUME = {27},
NUMBER = {2},
PAGES = {145-169},
YEAR = {2000},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
}
@article{Schomer-Sellen-Teichmann-Yap/00,
AUTHOR = {Sch{\"o}mer, E. and Sellen, J. and Teichmann, M. and Yap, Chee},
TITLE = {Smallest enclosing cylinders},
JOURNAL = {Algorithmica},
VOLUME = {27},
NUMBER = {2},
PAGES = {170-186},
YEAR = {2000},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
}
@article{Sajith-Saxena/00,
AUTHOR = {Sajith, G. and Saxena, S.},
TITLE = {Optimal sublogarithmic time parallel algorithms on rooted forests},
JOURNAL = {Algorithmica},
VOLUME = {27},
NUMBER = {2},
PAGES = {187-197},
YEAR = {2000},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
}
@article{Guttman-Beck-Hassin/00,
AUTHOR = {Guttman-Beck, N. and Hassin, R.},
TITLE = {Approximation algorithms for minimum $K$-cut},
JOURNAL = {Algorithmica},
VOLUME = {27},
NUMBER = {2},
PAGES = {198-207},
YEAR = {2000},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
}
@article{Bodlaender/00,
AUTHOR = {Bodlaender, H.L.},
TITLE = {Introduction},
JOURNAL = {Algorithmica},
VOLUME = {27},
PAGES = {209-211},
YEAR = {2000},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
}
@article{Chaudhuri-Zaroliagis/00,
AUTHOR = {Chaudhuri, S. and Zaroliagis, C.D.},
TITLE = {Shortest paths in digraphs of small treewidth --- Part I: Sequential algorithms},
JOURNAL = {Algorithmica},
VOLUME = {27},
PAGES = {212-226},
YEAR = {2000},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
}
@article{Zhou-Fuse-Nishizeki/00,
AUTHOR = {Zhou, X. and Fuse, K. and Nishizeki, T.},
TITLE = {A linear algorithm for finding $[g,f]$-colorings of partial $k$-trees},
JOURNAL = {Algorithmica},
VOLUME = {27},
PAGES = {227-243},
YEAR = {2000},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
}
@article{Alstrup-Lauridsen-Thorup/00,
AUTHOR = {Alstrup, S. and Lauridsen, P.W. and Thorup, M.},
TITLE = {Generalized dominators for structured programs},
JOURNAL = {Algorithmica},
VOLUME = {27},
PAGES = {244-253},
YEAR = {2000},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
}
@article{Gupta-Kaller-Shermer/00,
AUTHOR = {Gupta, A. and Kaller, D. and Shermer, T.},
TITLE = {Linear-time algorithms for partial $k$-tree complements},
JOURNAL = {Algorithmica},
VOLUME = {27},
PAGES = {254-274},
YEAR = {2000},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
}
@article{Eppstein/00a,
AUTHOR = {Eppstein, D.},
TITLE = {Diameter and treewidth in minor-closed graph families},
JOURNAL = {Algorithmica},
VOLUME = {27},
PAGES = {275-291},
YEAR = {2000},
URL = {http://springerlink.metapress.com/openurl.asp?genre=article&issn=0178-4617&volume=27&spage=275},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
}
@article{Hagerup/00,
AUTHOR = {Hagerup, T.},
TITLE = {Dynamic algorithms for graphs of bounded treewidth},
JOURNAL = {Algorithmica},
VOLUME = {27},
PAGES = {292-315},
YEAR = {2000},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
}
@article{Lucet-Manouvrier-Carlier/00,
AUTHOR = {Lucet, C. and Manouvrier, J.-F. and Carlier, J.},
TITLE = {Evaluating network reliability and 2-edge-connected reliability in linear time for bounded pathwidth graphs},
JOURNAL = {Algorithmica},
VOLUME = {27},
PAGES = {316-336},
YEAR = {2000},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
}
@article{Dessmark-Lingas-Proskurowski/00,
AUTHOR = {Dessmark, A. and Lingas, A. and Proskurowski, A.},
TITLE = {Faster algorithms for subgraph isomorphism of $k$-connected partial $k$-trees},
JOURNAL = {Algorithmica},
VOLUME = {27},
PAGES = {337-347},
YEAR = {2000},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
}
@article{Kaller/00,
AUTHOR = {Kaller, D.},
TITLE = {Definability equals recognizability of partial 3-trees and $k$-connected partial $k$-trees},
JOURNAL = {Algorithmica},
VOLUME = {27},
PAGES = {348-381},
YEAR = {2000},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
}
@article{Aspvall-Proskurowski-Telle/00,
AUTHOR = {Aspvall, B. and Proskurowski, A. and Telle, J.A.},
TITLE = {Memory requirements for table computations in partial $k$-tree algorithms},
JOURNAL = {Algorithmica},
VOLUME = {27},
PAGES = {382-394},
YEAR = {2000},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
}
@article{Peng-Ko-Ho-Hsu-Tang/00,
AUTHOR = {Peng, S.-L. and Ko, M.-T. and Ho, C.-W. and Hsu, T.-s. and Tang, C.Y.},
TITLE = {Graph searching on some subclasses of chordal graphs},
JOURNAL = {Algorithmica},
VOLUME = {27},
PAGES = {395-426},
YEAR = {2000},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
}
@article{Zhou-Tamura-Nishizeki/00,
AUTHOR = {Zhou, X. and Tamura, S. and Nishizeki, T.},
TITLE = {Finding edge-disjoint paths in partial $k$-trees},
JOURNAL = {Algorithmica},
VOLUME = {26},
NUMBER = {1},
PAGES = {3-30},
YEAR = {2000},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
}
@article{Chaudhuri-Subrahmanyam-Wagner-Zaroliagis/00,
AUTHOR = {Chaudhuri, S. and Subrahmanyam, K.V. and Wagner, F. and Zaroliagis, C.D.},
TITLE = {Computing mimicking networks},
JOURNAL = {Algorithmica},
VOLUME = {26},
NUMBER = {1},
PAGES = {31-49},
YEAR = {2000},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
}
@article{Nagamochi-Nakamura-Ibaraki/00,
AUTHOR = {Nagamochi, H. and Nakamura, S. and Ibaraki, T.},
TITLE = {A simplified ${\tilde{O}}(nm)$ time edge-splitting algorithm in undirected graphs},
JOURNAL = {Algorithmica},
VOLUME = {26},
NUMBER = {1},
PAGES = {50-67},
YEAR = {2000},
URL = {http://springerlink.metapress.com/openurl.asp?genre=article&issn=0178-4617&volume=26&issue=1&spage=50},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
}
@article{Fossmeier-Kaufmann/00,
AUTHOR = {F{\"o}{\"ss}meier, U. and Kaufmann, M.},
TITLE = {On exact solutions for the rectilinear Steiner tree problem --- Part I: Theoretical results},
JOURNAL = {Algorithmica},
VOLUME = {26},
NUMBER = {1},
PAGES = {68-99},
YEAR = {2000},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
}
@article{Papakostas-Tollis/00,
AUTHOR = {Papakostas, A. and Tollis, I.G.},
TITLE = {Efficient orthogonal drawings of high degree graphs},
JOURNAL = {Algorithmica},
VOLUME = {26},
NUMBER = {1},
PAGES = {100-125},
YEAR = {2000},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
}
@article{Weihe-Willhalm/00,
AUTHOR = {Weihe, K. and Willhalm, T.},
TITLE = {Reconstructing the topology of a CAD model --- A discrete approach},
JOURNAL = {Algorithmica},
VOLUME = {26},
NUMBER = {1},
PAGES = {126-147},
YEAR = {2000},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
}
@article{Mohring-Muller-Hannemann/00,
AUTHOR = {M{\"o}hring, R.H. and M{\"u}ller-Hannemann, M.},
TITLE = {Complexity and modeling aspects of mesh refinement into quadrilaterals},
JOURNAL = {Algorithmica},
VOLUME = {26},
NUMBER = {1},
PAGES = {148-171},
YEAR = {2000},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
}
@article{Junger-Rinaldi-Thienel/00,
AUTHOR = {J{\"u}nger, M. and Rinaldi, G. and Thienel, S.},
TITLE = {Practical performance of efficient minimum cut algorithms},
JOURNAL = {Algorithmica},
VOLUME = {26},
NUMBER = {1},
PAGES = {172-195},
YEAR = {2000},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
}
@article{Arkin-Held-Smith/00,
AUTHOR = {Arkin, E.M. and Held, M. and Smith, C.L.},
TITLE = {Optimization problems related to zigzag pocket machining},
JOURNAL = {Algorithmica},
VOLUME = {26},
NUMBER = {2},
PAGES = {197-236},
YEAR = {2000},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
}
@article{Berthome-Ferreira-Maggs-Perennes-Plaxton/00,
AUTHOR = {Berthom{\'e}, P. and Ferreira, A. and Maggs, B.M. and Perennes, S. and Plaxton, C.G.},
TITLE = {Sorting-based selection algorithms for hypercubic networks},
JOURNAL = {Algorithmica},
VOLUME = {26},
NUMBER = {2},
PAGES = {237-254},
YEAR = {2000},
URL = {http://springerlink.metapress.com/openurl.asp?genre=article&issn=0178-4617&volume=26&issue=2&spage=237},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
}
@article{Chang-Yap/00,
AUTHOR = {Chang, E.-C. and Yap, C.},
TITLE = {A simultaneous search problem},
JOURNAL = {Algorithmica},
VOLUME = {26},
NUMBER = {2},
PAGES = {255-262},
YEAR = {2000},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
}
@article{Andrews-Atallah-Chen-Lee/00,
AUTHOR = {Andrews, M.G. and Atallah, M.J. and Chen, D.Z. and Lee, D.T.},
TITLE = {Parallel algorithms for maximum matching in complements of interval graphs and related problems},
JOURNAL = {Algorithmica},
VOLUME = {26},
NUMBER = {2},
PAGES = {263-289},
YEAR = {2000},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
}
@article{Uno-Yagiura/00,
AUTHOR = {Uno, T. and Yagiura, M.},
TITLE = {Fast algorithms to enumerate all common intervals of two permutations},
JOURNAL = {Algorithmica},
VOLUME = {26},
NUMBER = {2},
PAGES = {290-309},
YEAR = {2000},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
}
@article{Akella-Huang-Lynch-Mason/00,
AUTHOR = {Akella, S. and Huang, W.H. and Lynch, K.M. and Mason, M.T.},
TITLE = {Parts feeding on a conveyor with a one joint robot},
JOURNAL = {Algorithmica},
VOLUME = {26},
NUMBER = {3-4},
PAGES = {313-344},
YEAR = {2000},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
}
@article{Teichmann-Mishra/00,
AUTHOR = {Teichmann, M. and Mishra, B.},
TITLE = {Probabilistic algorithms for efficient grasping and fixturing},
JOURNAL = {Algorithmica},
VOLUME = {26},
NUMBER = {3-4},
PAGES = {345-363},
YEAR = {2000},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
}
@article{Briggs-Donald/00,
AUTHOR = {Briggs, A.J. and Donald, B.R.},
TITLE = {Visibility-based planning of sensor control strategies},
JOURNAL = {Algorithmica},
VOLUME = {26},
NUMBER = {3-4},
PAGES = {364-388},
YEAR = {2000},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
}
@article{Bohringer-Bhatt-Donald-Goldberg/00,
AUTHOR = {B{\"o}hringer, K.-F. and Bhatt, V. and Donald, B.R. and Goldberg, K.},
TITLE = {Algorithms for sensorless manipulation using a vibrating surface},
JOURNAL = {Algorithmica},
VOLUME = {26},
NUMBER = {3-4},
PAGES = {389-429},
YEAR = {2000},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
}
@article{LaValle/00,
AUTHOR = {LaValle, S.M.},
TITLE = {Robot motion planning: A game-theoretic foundation},
JOURNAL = {Algorithmica},
VOLUME = {26},
NUMBER = {3-4},
PAGES = {430-465},
YEAR = {2000},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
}
@article{Sudang-Ponce-Srinivasa/00,
AUTHOR = {Sudang, A. and Ponce, J. and Srinivasa, N.},
TITLE = {Grasping and in-hand manipulation: Geometry and algorithms},
JOURNAL = {Algorithmica},
VOLUME = {26},
NUMBER = {3-4},
PAGES = {466-493},
YEAR = {2000},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
}
@article{van_der_Stappen-Goldberg-Overmars/00,
AUTHOR = {van der Stappen, A.F. and Goldberg, K. and Overmars, M.H.},
TITLE = {Geometric eccentricity and the complexity of manipulation plans},
JOURNAL = {Algorithmica},
VOLUME = {26},
NUMBER = {3-4},
PAGES = {494-514},
YEAR = {2000},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
}
@article{Brown-Donald/00,
AUTHOR = {Brown, R.G. and Donald, B.R.},
TITLE = {Mobile robot self-localization without explicit landmarks},
JOURNAL = {Algorithmica},
VOLUME = {26},
NUMBER = {3-4},
PAGES = {515-559},
YEAR = {2000},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
}
@article{Marigo-Ceccarelli-Piccinocchi-Bicchi/00,
AUTHOR = {Marigo, A. and Ceccarelli, M. and Piccinocchi, S. and Bicchi, A.},
TITLE = {Planning motions of polyhedral parts by rolling},
JOURNAL = {Algorithmica},
VOLUME = {26},
NUMBER = {3-4},
PAGES = {560-576},
YEAR = {2000},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
}
@article{Halperin-Latombe-Wilson/00,
AUTHOR = {Halperin, D. and Latombe, J.-C. and Wilson, R.H.},
TITLE = {A general framework for assembly planning: The motion space approach},
JOURNAL = {Algorithmica},
VOLUME = {26},
NUMBER = {3-4},
PAGES = {577-601},
YEAR = {2000},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
}