@article{Baraff-Mattikalli-Khosla/97,
AUTHOR = {Baraff, D. and Mattikalli, R. and Khosla, P.},
TITLE = {Minimal fixturing of frictionless assemblies: Complexity and Algorithms},
JOURNAL = {Algorithmica},
VOLUME = {19},
PAGES = {4-39},
YEAR = {1997},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
}
@article{Wallack-Canny/97,
AUTHOR = {Wallack, A.S. and Canny, J.F.},
TITLE = {Planning for modular and hybrid fixtures},
JOURNAL = {Algorithmica},
VOLUME = {19},
PAGES = {40-60},
YEAR = {1997},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
}
@article{Asberg-Blanco-Bose-Garcia-Lopez-Overmars-Toussaint-Wilfong-Zhu/97,
AUTHOR = {Asberg, B. and Blanco, G. and Bose, P. and Garcia-Lopez, J. and Overmars, M. and Toussaint, G. and Wilfong, G. and Zhu, B.},
TITLE = {Feasibility of design in stereolithography},
JOURNAL = {Algorithmica},
VOLUME = {19},
PAGES = {61-83},
YEAR = {1997},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
}
@article{Bose-Bremner-Kreveld/97,
AUTHOR = {Bose, P. and Bremner, D. and Kreveld, M. van},
TITLE = {Determining the castability of simple polyhedra},
JOURNAL = {Algorithmica},
VOLUME = {19},
PAGES = {84-113},
YEAR = {1997},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
}
@article{Karasick-Lieber-Nackman-Rajan/97,
AUTHOR = {Karasick, M.S. and Lieber, D. and Nackman, L.R. and Rajan, V.T.},
TITLE = {Visualization of three-dimensional Delaunay meshes},
JOURNAL = {Algorithmica},
VOLUME = {19},
PAGES = {114-128},
YEAR = {1997},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
}
@article{Rus/97,
AUTHOR = {Rus, D.},
TITLE = {Coordinated manipulation of objects in a plane},
JOURNAL = {Algorithmica},
VOLUME = {19},
PAGES = {129-147},
YEAR = {1997},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
}
@article{Daniels-Milenkovic/97,
AUTHOR = {Daniels, K. and Milenkovic, V.J.},
TITLE = {Multiple translational containment --- Part I: An approximate algorithm},
JOURNAL = {Algorithmica},
VOLUME = {19},
PAGES = {148-182},
YEAR = {1997},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
}
@article{Milenkovic/97,
AUTHOR = {Milenkovic, V.},
TITLE = {Multiple translational containment --- Part II: Exact algorithms},
JOURNAL = {Algorithmica},
VOLUME = {19},
PAGES = {183-218},
YEAR = {1997},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
}
@article{Emiris-Canny-Seidel/97,
AUTHOR = {Emiris, I.Z. and Canny, J.F. and Seidel, R.},
TITLE = {Efficient perturbations for handling geometric degeneracies},
JOURNAL = {Algorithmica},
VOLUME = {19},
PAGES = {219-242},
YEAR = {1997},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
}
@article{Bajaj-Bernardini-Xu/97,
AUTHOR = {Bajaj, C.L. and Bernardini, F. and Xu, G.},
TITLE = {Reconstructing surfaces and functions on surfaces from unorganized three-dimensional data},
JOURNAL = {Algorithmica},
VOLUME = {19},
PAGES = {243-261},
YEAR = {1997},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
}
@article{Brady-Brown-Powers/97,
AUTHOR = {Brady, M.L. and Brown, D.J. and Powers, K.D.},
TITLE = {Hexagonal models for channel routing},
JOURNAL = {Algorithmica},
VOLUME = {19},
PAGES = {263-290},
YEAR = {1997},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
}
@article{Aggarwal-Kravets-Park-Sen/97,
AUTHOR = {Aggarwal, A. and Kravets, D. and Park, J.K. and Sen, S.},
TITLE = {Parallel searching in generalized Monge arrays},
JOURNAL = {Algorithmica},
VOLUME = {19},
PAGES = {291-317},
YEAR = {1997},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
}
@article{Weng/97,
AUTHOR = {Weng, J.F.},
TITLE = {Expansion of linear Steiner trees},
JOURNAL = {Algorithmica},
VOLUME = {19},
PAGES = {318-330},
YEAR = {1997},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
}
@article{Giegerich-Kurtz/97,
AUTHOR = {Giegerich, R. and Kurtz, S.},
TITLE = {From Ukkonen to McCreight and Weiner: A unifying view of linear-time suffix tree construction},
JOURNAL = {Algorithmica},
VOLUME = {19},
PAGES = {331-353},
YEAR = {1997},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
}
@article{Chen-He/97,
AUTHOR = {Chen, Z.-Z. and He, X.},
TITLE = {Parallel algorithms for maximal acyclic sets},
JOURNAL = {Algorithmica},
VOLUME = {19},
PAGES = {354-367},
YEAR = {1997},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
}
@article{Miller-Teng/97,
AUTHOR = {Miller, G.L. and Teng, S.-H.},
TITLE = {Tree-based parallel algorithm design},
JOURNAL = {Algorithmica},
VOLUME = {19},
PAGES = {369-389},
YEAR = {1997},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
}
@article{Cherkassky-Goldberg/97,
AUTHOR = {Cherkassky, B.V. and Goldberg, A.V.},
TITLE = {On implementing the push-relabel method for the maximum flow problem},
JOURNAL = {Algorithmica},
VOLUME = {19},
PAGES = {390-410},
YEAR = {1997},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
}
@article{Lin-Lin/97,
AUTHOR = {Lin, Shun-Shii and Lin, Kwei-Jay},
TITLE = {A pinwheel scheduler for three distinct numbers with a tight schedulability bound},
JOURNAL = {Algorithmica},
VOLUME = {19},
PAGES = {411-426},
YEAR = {1997},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
}
@article{Biedl-Kant-Kaufmann/97,
AUTHOR = {Biedl, T. and Kant, G. and Kaufmann, M.},
TITLE = {On triangulating planar graphs under the four-connectivity constraint},
JOURNAL = {Algorithmica},
VOLUME = {19},
PAGES = {427-446},
YEAR = {1997},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
}
@article{Das-Kapoor-Smid/97,
AUTHOR = {Das, G. and Kapoor, S. and Smid, M.},
TITLE = {On the complexity of approximating Euclidean Traveling Salesman tours and minimum spanning trees},
JOURNAL = {Algorithmica},
VOLUME = {19},
PAGES = {447-460},
YEAR = {1997},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
}
@article{Garg-Vazirani-Yannakakis/97,
AUTHOR = {Garg, N. and Vazirani, V.V. and Yannakakis, M.},
TITLE = {Primal-dual approximation algorithms for integral flow and multicut in trees},
JOURNAL = {Algorithmica},
VOLUME = {18},
NUMBER = {1},
PAGES = {3-20},
YEAR = {1997},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
}
@article{Ravi-Williamson/97,
AUTHOR = {Ravi, R. and Williamson, D.P.},
TITLE = {An approximation algorithm for minimum-cost vertex-connectivity problems},
JOURNAL = {Algorithmica},
VOLUME = {18},
NUMBER = {1},
PAGES = {21-43},
YEAR = {1997},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
}
@article{Peleg-Schechtman-Wool/97,
AUTHOR = {Peleg, D. and Schechtman, G. and Wool, A.},
TITLE = {Randomized approximation of bounded multicovering problems},
JOURNAL = {Algorithmica},
VOLUME = {18},
NUMBER = {1},
PAGES = {44-66},
YEAR = {1997},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
}
@article{Frieze-Jerrum/97,
AUTHOR = {Frieze, A. and Jerrum, M.},
TITLE = {Improved approximation algorithms for MAX $k$-Cut and MAX BISECTION},
JOURNAL = {Algorithmica},
VOLUME = {18},
NUMBER = {1},
PAGES = {67-81},
YEAR = {1997},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
}
@article{Karger-Motwani-Ramkumar/97,
AUTHOR = {Karger, D. and Motwani, R. and Ramkumar, G.D.S.},
TITLE = {On approximating the longest path in a graph},
JOURNAL = {Algorithmica},
VOLUME = {18},
NUMBER = {1},
PAGES = {82-98},
YEAR = {1997},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
}
@article{Zelikovsky/97,
AUTHOR = {Zelikovsky, A.},
TITLE = {A series of approximation algorithms for the acyclic directed Steiner tree problem},
JOURNAL = {Algorithmica},
VOLUME = {18},
NUMBER = {1},
PAGES = {99-110},
YEAR = {1997},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
}
@article{Garg-Hochbaum/97,
AUTHOR = {Garg, N. and Hochbaum, D.S.},
TITLE = {An $O(\log k)$-approximation algorithm for the $k$ minimum spanning tree problem in the plane},
JOURNAL = {Algorithmica},
VOLUME = {18},
NUMBER = {1},
PAGES = {111-121},
YEAR = {1997},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
}
@article{Miyazawa-Wakabayashi/97,
AUTHOR = {Miyazawa, F.K. and Wakabayashi, Y.},
TITLE = {An algorithm for the three-dimensional packing problem with asymptotic performance analysis},
JOURNAL = {Algorithmica},
VOLUME = {18},
NUMBER = {1},
PAGES = {122-144},
YEAR = {1997},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
}
@article{Halldorsson-Radhakrishnan/97,
AUTHOR = {Halld{\'o}rsson, M.M. and Radhakrishnan, J.},
TITLE = {Greed is good: Approximating independent sets in sparse and bounded-degree graphs},
JOURNAL = {Algorithmica},
VOLUME = {18},
NUMBER = {1},
PAGES = {145-163},
YEAR = {1997},
URL = {http://springerlink.metapress.com/openurl.asp?genre=article&issn=0178-4617&volume=18&issue=1&spage=145},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
}
@article{Chen-Ierardi/97,
AUTHOR = {Chen, Yui-Bin and Ierardi, D.},
TITLE = {Time-optimal trajectories of a rod in the plane subject to velocity constraints},
JOURNAL = {Algorithmica},
VOLUME = {18},
NUMBER = {2},
PAGES = {165-197},
YEAR = {1997},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
}
@article{Tsai-Lee/97,
AUTHOR = {Tsai, K.H. and Lee, D.T.},
TITLE = {$k$ best cuts for circular-arc graphs},
JOURNAL = {Algorithmica},
VOLUME = {18},
NUMBER = {2},
PAGES = {198-216},
YEAR = {1997},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
}
@article{Chew-Fortune/97,
AUTHOR = {Chew, L.P. and Fortune, S.},
TITLE = {Sorting helps for Voronoi diagrams},
JOURNAL = {Algorithmica},
VOLUME = {18},
NUMBER = {2},
PAGES = {217-228},
YEAR = {1997},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
}
@article{Tokuyama/97,
AUTHOR = {Tokuyama, Takeshi},
TITLE = {Orthogonal queries in segments},
JOURNAL = {Algorithmica},
VOLUME = {18},
NUMBER = {2},
PAGES = {229-245},
YEAR = {1997},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
}
@article{Overmars-Santoro/97,
AUTHOR = {Overmars, M. and Santoro, N.},
TITLE = {Improved bounds for electing a leader in a synchronous ring},
JOURNAL = {Algorithmica},
VOLUME = {18},
NUMBER = {2},
PAGES = {246-262},
YEAR = {1997},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
}
@article{King/97,
AUTHOR = {King, V.},
TITLE = {A simpler minimum spanning tree verification algorithm},
JOURNAL = {Algorithmica},
VOLUME = {18},
NUMBER = {2},
PAGES = {263-270},
YEAR = {1997},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
}
@article{Rice-Bunke-Nartker/97,
AUTHOR = {Rice, S.V. and Bunke, H. and Nartker, T.A.},
TITLE = {Classes of cost functions for string edit distance},
JOURNAL = {Algorithmica},
VOLUME = {18},
NUMBER = {2},
PAGES = {271-280},
YEAR = {1997},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
}
@article{Albers/97,
AUTHOR = {Albers, S.},
TITLE = {On the influence of lookahead in competitive paging algorithms},
JOURNAL = {Algorithmica},
VOLUME = {18},
NUMBER = {3},
PAGES = {283-305},
YEAR = {1997},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
}
@article{de_Berg-Kreveld/97,
AUTHOR = {de Berg, M. and Kreveld, M. van},
TITLE = {Trekking in the Alps without freezing or getting tired},
JOURNAL = {Algorithmica},
VOLUME = {18},
NUMBER = {3},
PAGES = {306-323},
YEAR = {1997},
URL = {http://springerlink.metapress.com/openurl.asp?genre=article&issn=0178-4617&volume=18&issue=3&spage=306},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
}
@article{Cohen-Tamassia/97,
AUTHOR = {Cohen, R.F. and Tamassia, R.},
TITLE = {Combine and conquer},
JOURNAL = {Algorithmica},
VOLUME = {18},
NUMBER = {3},
PAGES = {324-362},
YEAR = {1997},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
}
@article{Weihe/97,
AUTHOR = {Weihe, K.},
TITLE = {Multicommodity flows in even, planar networks},
JOURNAL = {Algorithmica},
VOLUME = {18},
NUMBER = {3},
PAGES = {363-383},
YEAR = {1997},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
}
@article{Ramachandran-Yang/97,
AUTHOR = {Ramachandran, Vijaya and Yang, Honghua},
TITLE = {An efficient parallel algorithm for the layered planar monotone circuit value problem},
JOURNAL = {Algorithmica},
VOLUME = {18},
NUMBER = {3},
PAGES = {384-404},
YEAR = {1997},
URL = {http://springerlink.metapress.com/openurl.asp?genre=article&issn=0178-4617&volume=18&issue=3&spage=384},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
}
@article{Gerstel-Zaks/97,
AUTHOR = {Gerstel, O. and Zaks, S.},
TITLE = {The bit complexity of distributed sorting},
JOURNAL = {Algorithmica},
VOLUME = {18},
NUMBER = {3},
PAGES = {405-416},
YEAR = {1997},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
}
@article{Kaufmann-Raman-Sibeyn/97,
AUTHOR = {Kaufmann, M. and Raman, R. and Sibeyn, J.F.},
TITLE = {Routing on meshes with buses},
JOURNAL = {Algorithmica},
VOLUME = {18},
NUMBER = {3},
PAGES = {417-444},
YEAR = {1997},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
}
@article{Mayr-Werchner/97,
AUTHOR = {Mayr, E.W. and Werchner, R.},
TITLE = {Optimal tree contraction and term matching on the hypercube and related networks},
JOURNAL = {Algorithmica},
VOLUME = {18},
NUMBER = {3},
PAGES = {445-460},
YEAR = {1997},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
}
@article{Burley-Irani/97,
AUTHOR = {Burley, W.R. and Irani, S.},
TITLE = {On algorithm design for metrical task systems},
JOURNAL = {Algorithmica},
VOLUME = {18},
NUMBER = {4},
PAGES = {461-485},
YEAR = {1997},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
}
@article{Dolev-Welch/97,
AUTHOR = {Dolev, S. and Welch, J.L.},
TITLE = {Wait-free clock synchronization},
JOURNAL = {Algorithmica},
VOLUME = {18},
NUMBER = {4},
PAGES = {486-511},
YEAR = {1997},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
}
@article{Muthukrishnan/97,
AUTHOR = {Muthukrishnan, S.},
TITLE = {Detecting false matches in string-matching algorithms},
JOURNAL = {Algorithmica},
VOLUME = {18},
NUMBER = {4},
PAGES = {512-520},
YEAR = {1997},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
}
@article{Beals/97,
AUTHOR = {Beals, R.},
TITLE = {Equivalence of binary and ternary algebraic decision trees},
JOURNAL = {Algorithmica},
VOLUME = {18},
NUMBER = {4},
PAGES = {521-523},
YEAR = {1997},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
}
@article{Bespamyatnikh/97,
AUTHOR = {Bespamyatnikh, S.N.},
TITLE = {On constructing minimum spanning trees in $R{k}_{1}$},
JOURNAL = {Algorithmica},
VOLUME = {18},
NUMBER = {4},
PAGES = {524-529},
YEAR = {1997},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
}
@article{Matsui/97,
AUTHOR = {Matsui, T.},
TITLE = {A flexible algorithm for generating all the spanning trees in undirected graphs},
JOURNAL = {Algorithmica},
VOLUME = {18},
NUMBER = {4},
PAGES = {530-543},
YEAR = {1997},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
}
@article{Imielinska-Kalantari/97,
AUTHOR = {Imieli{\'n}ska, C. and Kalantari, B.},
TITLE = {A general class of heuristics for minimum weight perfect matching and fast special cases with doubly and triply logarithmic errors},
JOURNAL = {Algorithmica},
VOLUME = {18},
NUMBER = {4},
PAGES = {544-559},
YEAR = {1997},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
}
@article{Pan-Dong-Liu/97,
AUTHOR = {Pan, Peichen and Dong, Sai-keung and Liu, C.L.},
TITLE = {Optimal graph constraint reduction for symbolic layout compaction},
JOURNAL = {Algorithmica},
VOLUME = {18},
NUMBER = {4},
PAGES = {560-574},
YEAR = {1997},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
}
@article{Romer-Rosier/97,
AUTHOR = {Romer, T.H. and Rosier, L.E.},
TITLE = {An algorithm reminiscent of Euclidean-$gcd$ for computing a function related to pinwheel scheduling},
JOURNAL = {Algorithmica},
VOLUME = {17},
NUMBER = {1},
PAGES = {1-10},
YEAR = {1997},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
}
@article{Dixon-Tarjan/97,
AUTHOR = {Dixon, B. and Tarjan, R.E.},
TITLE = {Optimal parallel verification of minimum spanning trees in logarithmic time},
JOURNAL = {Algorithmica},
VOLUME = {17},
NUMBER = {1},
PAGES = {11-18},
YEAR = {1997},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
}
@article{Dehne-Klein/97,
AUTHOR = {Dehne, F. and Klein, R.},
TITLE = {``The big sweep'': On the power of the wavefront approach to Voronoi diagrams},
JOURNAL = {Algorithmica},
VOLUME = {17},
NUMBER = {1},
PAGES = {19-32},
YEAR = {1997},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
}
@article{Arya-Smid/97,
AUTHOR = {Arya, S. and Smid, M.},
TITLE = {Efficient construction of a bounded-degree spanner with low weight},
JOURNAL = {Algorithmica},
VOLUME = {17},
NUMBER = {1},
PAGES = {33-54},
YEAR = {1997},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
}
@article{Hagerup-Kutylowski/97,
AUTHOR = {Hagerup, T. and Kuty{\l}owski, M.},
TITLE = {Fast integer merging on the EREW PRAM},
JOURNAL = {Algorithmica},
VOLUME = {17},
NUMBER = {1},
PAGES = {55-66},
YEAR = {1997},
URL = {http://springerlink.metapress.com/openurl.asp?genre=article&issn=0178-4617&volume=17&issue=1&spage=55},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
}
@article{Bang-Jensen-El_Haddad-Manoussakis-Przytycka/97,
AUTHOR = {Bang-Jensen, J. and El Haddad, M. and Manoussakis, Y. and Przytycka, T.M.},
TITLE = {Parallel algorithms for the Hamiltonian cycle and Hamiltonian path problems in semicomplete bipartite digraphs},
JOURNAL = {Algorithmica},
VOLUME = {17},
NUMBER = {1},
PAGES = {67-87},
YEAR = {1997},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
}
@article{Greenberg-Shih/97,
AUTHOR = {Greenberg, R.I. and Shih, J.-D.},
TITLE = {Minimizing channel density with movable terminals},
JOURNAL = {Algorithmica},
VOLUME = {17},
PAGES = {89-99},
YEAR = {1997},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
}
@article{Granot-Skorin-Kapov-Tamir/97,
AUTHOR = {Granot, F. and Skorin-Kapov, J. and Tamir, A.},
TITLE = {Using quadratic programming to solve high multiplicity scheduling problems on parallel machines},
JOURNAL = {Algorithmica},
VOLUME = {17},
PAGES = {100-110},
YEAR = {1997},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
}
@article{Avnaim-Boissonnat-Devillers-Preparata-Yvinec/97,
AUTHOR = {Avnaim, F. and Boissonnat, J.-D. and Devillers, O. and Preparata, F.P. and Yvinec, M.},
TITLE = {Evaluating signs of determinants using single-precision arithmetic},
JOURNAL = {Algorithmica},
VOLUME = {17},
PAGES = {111-132},
YEAR = {1997},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
}
@article{Bhuyan-Deogun-Raghavan/97,
AUTHOR = {Bhuyan, J.N. and Deogun, J.S. and Raghavan, V.V.},
TITLE = {Algorithms for the boundary selection problem},
JOURNAL = {Algorithmica},
VOLUME = {17},
PAGES = {133-161},
YEAR = {1997},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
}
@article{Alonso-Remy-Schott/97,
AUTHOR = {Alonso, L. and R{\'{e}}my, J.L. and Schott, R.},
TITLE = {A linear-time algorithm for the generation of trees},
JOURNAL = {Algorithmica},
VOLUME = {17},
PAGES = {162-182},
YEAR = {1997},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
}
@article{Mehlhorn-Sundar-Uhrig/97,
AUTHOR = {Mehlhorn, K. and Sundar, R. and Uhrig, C.},
TITLE = {Maintaining dynamic sequences under equality tests in polylogarithmic time},
JOURNAL = {Algorithmica},
VOLUME = {17},
PAGES = {183-198},
YEAR = {1997},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
}
@article{Cohen-Eades-Lin-Ruskey/97,
AUTHOR = {Cohen, R.F. and Eades, P. and Lin, Tao and Ruskey, F.},
TITLE = {Three-dimensional graph drawing},
JOURNAL = {Algorithmica},
VOLUME = {17},
PAGES = {199-208},
YEAR = {1997},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
}
@article{Alon-Yuster-Zwick/97,
AUTHOR = {Alon, N. and Yuster, R. and Zwick, U.},
TITLE = {Finding and counting given length cycles},
JOURNAL = {Algorithmica},
VOLUME = {17},
PAGES = {209-223},
YEAR = {1997},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
}
@article{Kaufmann-Sibeyn/97,
AUTHOR = {Kaufmann, M. and Sibeyn, J.F.},
TITLE = {Randomized multipacket routing and sorting on meshes},
JOURNAL = {Algorithmica},
VOLUME = {17},
PAGES = {224-244},
YEAR = {1997},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
}
@article{Chazelle-Palios/97,
AUTHOR = {Chazelle, B. and Palios, L.},
TITLE = {Decomposing the boundary of a nonconvex polyhedron},
JOURNAL = {Algorithmica},
VOLUME = {17},
PAGES = {245-265},
YEAR = {1997},
URL = {http://springerlink.metapress.com/openurl.asp?genre=article&issn=0178-4617&volume=17&spage=245},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
}
@article{Chen/97,
AUTHOR = {Chen, L.},
TITLE = {Efficient parallel recognition of some circular arc graphs, II},
JOURNAL = {Algorithmica},
VOLUME = {17},
PAGES = {266-280},
YEAR = {1997},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
}
@article{Guha-Suzuki/97,
AUTHOR = {Guha, S. and Suzuki, I.},
TITLE = {Proximity problems for points on a rectilinear plane with rectangular obstacles},
JOURNAL = {Algorithmica},
VOLUME = {17},
PAGES = {281-307},
YEAR = {1997},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
}
@article{Bazzi-Neiger/97,
AUTHOR = {Bazzi, R.A. and Neiger, G.},
TITLE = {The complexity of almost-optimal simultaneous coordination},
JOURNAL = {Algorithmica},
VOLUME = {17},
PAGES = {308-321},
YEAR = {1997},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
}
@article{Wenger/97,
AUTHOR = {Wenger, R.},
TITLE = {Randomized quickhull},
JOURNAL = {Algorithmica},
VOLUME = {17},
PAGES = {322-329},
YEAR = {1997},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
}
@article{Berman-DasGupta/97,
AUTHOR = {Berman, P. and DasGupta, B.},
TITLE = {Complexities of efficient solutions of rectilinear polygon cover problems},
JOURNAL = {Algorithmica},
VOLUME = {17},
PAGES = {331-356},
YEAR = {1997},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
}
@article{Rimon/97,
AUTHOR = {Rimon, E.},
TITLE = {Construction of $C$-space roadmaps from local sensory data. What should the sensors look for?},
JOURNAL = {Algorithmica},
VOLUME = {17},
PAGES = {357-379},
YEAR = {1997},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
}
@article{Pellegrini/97,
AUTHOR = {Pellegrini, M.},
TITLE = {On counting pairs of intersecting segments and off-line triangle range searching},
JOURNAL = {Algorithmica},
VOLUME = {17},
PAGES = {380-398},
YEAR = {1997},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
}
@article{Han-Pan-Reif/97,
AUTHOR = {Han, Yijie and Pan, V.Y. and Reif, J.H.},
TITLE = {Efficient parallel algorithms for computing all pair shortest paths in directed graphs},
JOURNAL = {Algorithmica},
VOLUME = {17},
PAGES = {399-415},
YEAR = {1997},
URL = {http://springerlink.metapress.com/openurl.asp?genre=article&issn=0178-4617&volume=17&spage=399},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
}
@article{de_Agostino-Petreschi-Sterbini/97,
AUTHOR = {de Agostino, S. and Petreschi, R. and Sterbini, A.},
TITLE = {An $O(n^3)$ recognition algorithm for bithreshold graphs},
JOURNAL = {Algorithmica},
VOLUME = {17},
PAGES = {416-425},
YEAR = {1997},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
}
@article{Hambrusch-Tu/97,
AUTHOR = {Hambrusch, S.E. and Tu, Hung-Yi},
TITLE = {New algorithms for minimizing the longest wire length during circuit compaction},
JOURNAL = {Algorithmica},
VOLUME = {17},
PAGES = {426-448},
YEAR = {1997},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
}
@article{Alon-Srinivasan/97,
AUTHOR = {Alon, N. and Srinivasan, A.},
TITLE = {Improved parallel approximation of a class of integer programming problems},
JOURNAL = {Algorithmica},
VOLUME = {17},
PAGES = {449-462},
YEAR = {1997},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
}