Graf, Daniel How to sort by walking and swapping on paths and trees. (English) Zbl 1372.68075 Algorithmica 78, No. 4, 1151-1181 (2017). MSC: 68P10 68Q17 68R05 68R10 68T40 68W05 PDFBibTeX XMLCite \textit{D. Graf}, Algorithmica 78, No. 4, 1151--1181 (2017; Zbl 1372.68075) Full Text: DOI
Salzman, Oren; Hemmer, Michael; Raveh, Barak; Halperin, Dan Motion planning via manifold samples. (English) Zbl 1308.68134 Algorithmica 67, No. 4, 547-565 (2013). MSC: 68T40 52B55 68T20 68U05 PDFBibTeX XMLCite \textit{O. Salzman} et al., Algorithmica 67, No. 4, 547--565 (2013; Zbl 1308.68134) Full Text: DOI arXiv
Goraly, Gilad; Hassin, Refael Multi-color pebble motion on graphs. (English) Zbl 1202.68280 Algorithmica 58, No. 3, 610-636 (2010). MSC: 68R10 68T20 PDFBibTeX XMLCite \textit{G. Goraly} and \textit{R. Hassin}, Algorithmica 58, No. 3, 610--636 (2010; Zbl 1202.68280) Full Text: DOI
Auger, Anne; Teytaud, Olivier Continuous lunches are free plus the design of optimal optimization algorithms. (English) Zbl 1206.90133 Algorithmica 57, No. 1, 121-146 (2010). Reviewer: Svetlana A. Kravchenko (Minsk) MSC: 90C27 90C59 68T20 PDFBibTeX XMLCite \textit{A. Auger} and \textit{O. Teytaud}, Algorithmica 57, No. 1, 121--146 (2010; Zbl 1206.90133) Full Text: DOI Link
Reif, John H.; Sun, Zheng Movement planning in the presence of flows. (English) Zbl 1064.68087 Algorithmica 39, No. 2, 127-153 (2004). MSC: 68T40 68T20 PDFBibTeX XMLCite \textit{J. H. Reif} and \textit{Z. Sun}, Algorithmica 39, No. 2, 127--153 (2004; Zbl 1064.68087) Full Text: DOI
Boissonnat, Jean-Daniel; Ghosh, S. K.; Kavitha, T.; Lazard, Sylvain An algorithm for computing a convex and simple path of bounded curvature in a simple polygon. (English) Zbl 1001.68180 Algorithmica 34, No. 2, 109-156 (2002). MSC: 68W05 68U05 PDFBibTeX XMLCite \textit{J.-D. Boissonnat} et al., Algorithmica 34, No. 2, 109--156 (2002; Zbl 1001.68180) Full Text: DOI
Marigo, A.; Ceccarelli, M.; Piccinocchi, S.; Bicchi, A. Planning motions of polyhedral parts by rolling. (English) Zbl 0997.93072 Algorithmica 26, No. 3-4, 560-576 (2000). Reviewer: Kurt Marti (Neubiberg/München) MSC: 93C85 68Q25 70B15 68T40 PDFBibTeX XMLCite \textit{A. Marigo} et al., Algorithmica 26, No. 3--4, 560--576 (2000; Zbl 0997.93072) Full Text: DOI
Auletta, V.; Monti, A.; Parente, M.; Persiano, P. A linear-time algorithm for the feasibility of pebble motion on trees. (English) Zbl 0921.68090 Algorithmica 23, No. 3, 223-245 (1999). MSC: 68R05 05C05 68W05 68W40 PDFBibTeX XMLCite \textit{V. Auletta} et al., Algorithmica 23, No. 3, 223--245 (1999; Zbl 0921.68090) Full Text: DOI
Icking, Christian; Rote, Günter; Welzl, Emo; Yap, Chee Shortest paths for line segments. (English) Zbl 0781.68118 Algorithmica 10, No. 2-4, 182-200 (1993). Reviewer: C.Icking MSC: 68U05 68U99 PDFBibTeX XMLCite \textit{C. Icking} et al., Algorithmica 10, No. 2--4, 182--200 (1993; Zbl 0781.68118) Full Text: DOI
Mitchell, Joseph S. B.; Rote, Günter; Woeginger, Gerhard Minimum-link paths among obstacles in the plane. (English) Zbl 0788.68144 Algorithmica 8, No. 5-6, 431-459 (1992). Reviewer: M.Křivánek (Praha) MSC: 68U05 68Q25 PDFBibTeX XMLCite \textit{J. S. B. Mitchell} et al., Algorithmica 8, No. 5--6, 431--459 (1992; Zbl 0788.68144) Full Text: DOI
Alt, Helmut; Fleischer, Rudolf; Kaufmann, Michael; Mehlhorn, Kurt; Näher, Stefan; Schirra, Stefan; Uhrig, Christian Approximate motion planning and the complexity of the boundary of the union of simple geometric figures. (English) Zbl 0760.68082 Algorithmica 8, No. 5-6, 391-406 (1992). Reviewer: N.Korneenko (Bialystok) MSC: 68U05 68Q25 PDFBibTeX XMLCite \textit{H. Alt} et al., Algorithmica 8, No. 5--6, 391--406 (1992; Zbl 0760.68082) Full Text: DOI
Schwartz, Jacob T.; Sharir, Micha Finding effective “Force targets” for two-dimensional, multifinger frictional grips. (English) Zbl 0754.68122 Algorithmica 8, No. 1, 1-20 (1992). MSC: 68U99 68Q25 68U05 PDFBibTeX XMLCite \textit{J. T. Schwartz} and \textit{M. Sharir}, Algorithmica 8, No. 1, 1--20 (1992; Zbl 0754.68122) Full Text: DOI
Donald, Bruce R. The complexity of planar compliant motion planning under uncertainty. (English) Zbl 0696.68054 Algorithmica 5, No. 3, 353-382 (1990). MSC: 68Q25 68T99 68U99 03D15 PDFBibTeX XMLCite \textit{B. R. Donald}, Algorithmica 5, No. 3, 353--382 (1990; Zbl 0696.68054) Full Text: DOI
Erdmann, Michael; Lozano-Pérez, Tomás On multiple moving objects. (English) Zbl 0643.68152 Algorithmica 2, 477-521 (1987). MSC: 68T99 70B15 68T20 PDFBibTeX XMLCite \textit{M. Erdmann} and \textit{T. Lozano-Pérez}, Algorithmica 2, 477--521 (1987; Zbl 0643.68152) Full Text: DOI
Ó’Dúnlaing, Colm Motion planning with inertial constraints. (English) Zbl 0643.68151 Algorithmica 2, 431-475 (1987). MSC: 68T99 68Q25 70B15 PDFBibTeX XMLCite \textit{C. Ó'Dúnlaing}, Algorithmica 2, 431--475 (1987; Zbl 0643.68151) Full Text: DOI
Lumelsky, Vladimir J.; Stepanov, Alexander A. Path-planning strategies for a point mobile automaton moving amidst unknown obstacles of arbitrary shape. (English) Zbl 0643.68150 Algorithmica 2, 403-430 (1987). MSC: 68T99 68Q25 70B15 PDFBibTeX XMLCite \textit{V. J. Lumelsky} and \textit{A. A. Stepanov}, Algorithmica 2, 403--430 (1987; Zbl 0643.68150) Full Text: DOI
Sifrony, S.; Sharir, M. A new efficient motion-planning algorithm for a rod in two-dimensional polygonal space. (English) Zbl 0643.68049 Algorithmica 2, 367-402 (1987). MSC: 68Q25 52-04 PDFBibTeX XMLCite \textit{S. Sifrony} and \textit{M. Sharir}, Algorithmica 2, 367--402 (1987; Zbl 0643.68049) Full Text: DOI
Papadimitriou, Christos H.; Silverberg, Ellen B. Optimal piecewise linear motion of an object among obstacles. (English) Zbl 0637.68082 Algorithmica 2, 523-539 (1987). MSC: 68R99 68Q25 68U99 51H99 PDFBibTeX XMLCite \textit{C. H. Papadimitriou} and \textit{E. B. Silverberg}, Algorithmica 2, 523--539 (1987; Zbl 0637.68082) Full Text: DOI
Ó’Dúnlaing, Colm; Sharir, Micha; Yap, Chee Generalized Voronoi diagrams for a ladder. II: Efficient construction of the diagram. (English) Zbl 0631.68042 Algorithmica 2, 27-59 (1987). Reviewer: H.Edelsbrunner MSC: 68Q25 52Bxx 52A37 51M20 PDFBibTeX XMLCite \textit{C. Ó'Dúnlaing} et al., Algorithmica 2, 27--59 (1987; Zbl 0631.68042) Full Text: DOI