@article{Cole-Goodrich/92,
AUTHOR = {Cole, Richard and Goodrich, Michael T.},
TITLE = {Optimal parallel algorithms for point-set and polygon problems},
JOURNAL = {Algorithmica},
VOLUME = {7},
NUMBER = {1},
PAGES = {3-23},
YEAR = {1992},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
}
@article{Chandran-Kim-Mount/92,
AUTHOR = {Chandran, Sharat and Kim, Sung Kwon and Mount, David M.},
TITLE = {Parallel computational geometry of rectangles},
JOURNAL = {Algorithmica},
VOLUME = {7},
NUMBER = {1},
PAGES = {25-49},
YEAR = {1992},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
}
@article{Cohen-Miller-Sarraf-Stout/92,
AUTHOR = {Cohen, Ed and Miller, Russ and Sarraf, Elias M. and Stout, Quentin F.},
TITLE = {Efficient convexity and domination algorithms for fine- and medium-grain hypercube computers},
JOURNAL = {Algorithmica},
VOLUME = {7},
NUMBER = {1},
PAGES = {51-75},
YEAR = {1992},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
}
@article{Sanz-Cypher/92,
AUTHOR = {Sanz, Jorge L.C. and Cypher, Robert},
TITLE = {Data reduction and fast routing: A strategy for efficient algorithms for message-passing parallel computers},
JOURNAL = {Algorithmica},
VOLUME = {7},
NUMBER = {1},
PAGES = {77-89},
YEAR = {1992},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
}
@article{Reif-Sen/92,
AUTHOR = {Reif, John H. and Sen, Sandeep},
TITLE = {Optimal randomized parallel algorithms for computational geometry},
JOURNAL = {Algorithmica},
VOLUME = {7},
NUMBER = {1},
PAGES = {91-117},
YEAR = {1992},
URL = {http://springerlink.metapress.com/openurl.asp?genre=article&issn=0178-4617&volume=7&issue=1&spage=91},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
}
@article{Du-Hwang/92,
AUTHOR = {Du, D.-Z. and Hwang, F.K.},
TITLE = {A proof of the Gilbert-Pollak conjecture on the Steiner Ratio},
JOURNAL = {Algorithmica},
VOLUME = {7},
PAGES = {121-135},
YEAR = {1992},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
}
@article{Smith/92,
AUTHOR = {Smith, Warren D.},
TITLE = {How to find Steiner minimal trees in Euclidean $d$-space},
JOURNAL = {Algorithmica},
VOLUME = {7},
PAGES = {137-177},
YEAR = {1992},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
}
@article{Liu-Du/92,
AUTHOR = {Liu, Zi-Cheng and Du, Ding-Zhu},
TITLE = {On Steiner minimal trees with $L_p$ distance},
JOURNAL = {Algorithmica},
VOLUME = {7},
PAGES = {179-191},
YEAR = {1992},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
}
@article{Rubinstein-Thomas/92,
AUTHOR = {Rubinstein, J.H. and Thomas, D.A.},
TITLE = {Graham's problem on shortest networks for points on a circle},
JOURNAL = {Algorithmica},
VOLUME = {7},
PAGES = {193-218},
YEAR = {1992},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
}
@article{Cockayne-Hewgill/92,
AUTHOR = {Cockayne, E.J. and Hewgill, D.E.},
TITLE = {Improved computation of plane Steiner minimal trees},
JOURNAL = {Algorithmica},
VOLUME = {7},
PAGES = {219-229},
YEAR = {1992},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
}
@article{Booth-Weng/92,
AUTHOR = {Booth, R.S. and Weng, J.F.},
TITLE = {Steiner minimal trees for a class of zigzag lines},
JOURNAL = {Algorithmica},
VOLUME = {7},
PAGES = {231-246},
YEAR = {1992},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
}
@article{Richards-Salowe/92,
AUTHOR = {Richards, D.S. and Salowe, J.S.},
TITLE = {A linear-time algorithm to construct a rectilinear Steiner minimal tree for $k$-extremal point sets},
JOURNAL = {Algorithmica},
VOLUME = {7},
PAGES = {247-276},
YEAR = {1992},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
}
@article{Rao-Sadayappan-Hwang-Shor/92,
AUTHOR = {Rao, Sailesh K. and Sadayappan, P. and Hwang, Frank K. and Shor, Peter W.},
TITLE = {The rectilinear Steiner arborescence problem},
JOURNAL = {Algorithmica},
VOLUME = {7},
PAGES = {277-288},
YEAR = {1992},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
}
@article{Provan/92,
AUTHOR = {Provan, J. Scott},
TITLE = {Two new criteria for finding Steiner hulls in Steiner tree problems},
JOURNAL = {Algorithmica},
VOLUME = {7},
PAGES = {289-302},
YEAR = {1992},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
}
@article{Colbourn/92,
AUTHOR = {Colbourn, Charles J.},
TITLE = {A note on bounding $k$-terminal reliability},
JOURNAL = {Algorithmica},
VOLUME = {7},
PAGES = {303-307},
YEAR = {1992},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
}
@article{Winter-MacGregor_Smith/92,
AUTHOR = {Winter, Pawel and MacGregor Smith, J.},
TITLE = {Path-distance heuristics for the Steiner problem in undirected networks},
JOURNAL = {Algorithmica},
VOLUME = {7},
PAGES = {309-327},
YEAR = {1992},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
}
@article{Smith-Shor/92,
AUTHOR = {Smith, Warren D. and Shor, Peter W.},
TITLE = {Steiner tree problems},
JOURNAL = {Algorithmica},
VOLUME = {7},
PAGES = {329-332},
YEAR = {1992},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
}
@article{Voss/92,
AUTHOR = {Vo{\"ss}, Stefan},
TITLE = {Problems with generalized Steiner problems},
JOURNAL = {Algorithmica},
VOLUME = {7},
PAGES = {333-335},
YEAR = {1992},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
}
@article{Hopcroft-Kahn/92,
AUTHOR = {Hopcroft, John E. and Kahn, Peter J.},
TITLE = {A paradigm for robust geometric algorithms},
JOURNAL = {Algorithmica},
VOLUME = {7},
PAGES = {339-380},
YEAR = {1992},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
}
@article{Guibas-Knuth-Sharir/92,
AUTHOR = {Guibas, Leonidas J. and Knuth, Donald E. and Sharir, Micha},
TITLE = {Randomized incremental construction of Delaunay and Voronoi diagrams},
JOURNAL = {Algorithmica},
VOLUME = {7},
PAGES = {381-413},
YEAR = {1992},
URL = {http://springerlink.metapress.com/openurl.asp?genre=article&issn=0178-4617&volume=7&spage=381},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
}
@article{Liao/92,
AUTHOR = {Liao, Andrew M.},
TITLE = {Three priority queue applications revisited},
JOURNAL = {Algorithmica},
VOLUME = {7},
PAGES = {415-427},
YEAR = {1992},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
}
@article{Westbrook-Tarjan/92,
AUTHOR = {Westbrook, Jeffery and Tarjan, Robert E.},
TITLE = {Maintaining bridge-connected and biconnected components on-line},
JOURNAL = {Algorithmica},
VOLUME = {7},
PAGES = {433-464},
YEAR = {1992},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
}
@article{Gabow-Westermann/92,
AUTHOR = {Gabow, Harold N. and Westermann, Herbert H.},
TITLE = {Forests, Frames, and Games: Algorithms for matroid sums and applications},
JOURNAL = {Algorithmica},
VOLUME = {7},
PAGES = {465-497},
YEAR = {1992},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
}
@article{Gusfield-Martel/92,
AUTHOR = {Gusfield, Dan and Martel, Charles},
TITLE = {A fast algorithm for the generalized parametric minimum cut problem and applications},
JOURNAL = {Algorithmica},
VOLUME = {7},
PAGES = {499-519},
YEAR = {1992},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
}
@article{Mishra-Tarjan/92,
AUTHOR = {Mishra, B. and Tarjan, R.E.},
TITLE = {A linear-time algorithm for finding an ambitus},
JOURNAL = {Algorithmica},
VOLUME = {7},
PAGES = {521-554},
YEAR = {1992},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
}
@article{Borie-Parker-Tovey/92,
AUTHOR = {Borie, Richard B. and Parker, R. Gary and Tovey, Craig A.},
TITLE = {Automatic generation of linear-time algorithms from predicate calculus descriptions of problems on recursively constructed graph families},
JOURNAL = {Algorithmica},
VOLUME = {7},
PAGES = {555-581},
YEAR = {1992},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
}
@article{Nagamochi-Ibaraki/92,
AUTHOR = {Nagamochi, Hiroshi and Ibaraki, Toshihide},
TITLE = {A linear-time algorithm for finding a sparse $k$-connected spanning subgraph of a $k$-connected graph},
JOURNAL = {Algorithmica},
VOLUME = {7},
PAGES = {583-596},
YEAR = {1992},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
}
@article{Reif-Spirakis/92,
AUTHOR = {Reif, John and Spirakis, Paul},
TITLE = {Expected parallel time and sequential space complexity of graph and digraph problems},
JOURNAL = {Algorithmica},
VOLUME = {7},
PAGES = {597-630},
YEAR = {1992},
URL = {http://springerlink.metapress.com/openurl.asp?genre=article&issn=0178-4617&volume=7&spage=597},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
}
@article{Lucas-Sackrowitz/92,
AUTHOR = {Lucas, Joan M. and Sackrowitz, Marian Gunsher},
TITLE = {Efficient parallel algorithms for path problems in directed graphs},
JOURNAL = {Algorithmica},
VOLUME = {7},
PAGES = {631-648},
YEAR = {1992},
URL = {http://springerlink.metapress.com/openurl.asp?genre=article&issn=0178-4617&volume=7&spage=631},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
}