Ghosh, Subir Kumar Computing the visibility polygon from a convex set and related problems. (English) Zbl 0718.68096 J. Algorithms 12, No. 1, 75-95 (1991). MSC: 68U05 68Q25 PDF BibTeX XML Cite \textit{S. K. Ghosh}, J. Algorithms 12, No. 1, 75--95 (1991; Zbl 0718.68096) Full Text: DOI
Gibbons, Phillip; Karp, Richard; Ramachandran, Vijaya; Soroker, Danny; Tarjan, Robert Transitive compaction in parallel via branchings. (English) Zbl 0718.68058 J. Algorithms 12, No. 1, 110-125 (1991). Reviewer: M.Zimand (Bucureşti) MSC: 68R10 68W15 PDF BibTeX XML Cite \textit{P. Gibbons} et al., J. Algorithms 12, No. 1, 110--125 (1991; Zbl 0718.68058) Full Text: DOI
Wilf, Herbert S. Two algorithms for the sieve method. (English) Zbl 0717.68078 J. Algorithms 12, No. 1, 179-182 (1991). Reviewer: S.Fomin MSC: 68R05 PDF BibTeX XML Cite \textit{H. S. Wilf}, J. Algorithms 12, No. 1, 179--182 (1991; Zbl 0717.68078) Full Text: DOI
Cheng, Siu Wing; Janardan, Ravi Efficient maintenance of the union of intervals on a line, with applications. (English) Zbl 0715.68084 J. Algorithms 12, No. 1, 57-74 (1991). MSC: 68U05 68Q25 68P05 PDF BibTeX XML Cite \textit{S. W. Cheng} and \textit{R. Janardan}, J. Algorithms 12, No. 1, 57--74 (1991; Zbl 0715.68084) Full Text: DOI
Aggarwal, Alok; Imai, Hiroshi; Katoh, Naoki; Suri, Subhash Finding k points with minimum diameter and related problems. (English) Zbl 0715.68082 J. Algorithms 12, No. 1, 38-56 (1991). Reviewer: H.-D.Hecker MSC: 68U05 68T10 PDF BibTeX XML Cite \textit{A. Aggarwal} et al., J. Algorithms 12, No. 1, 38--56 (1991; Zbl 0715.68082) Full Text: DOI
Tan, Jimmy J. M. A necessary and sufficient condition for the existence of a complete stable matching. (English) Zbl 0715.68069 J. Algorithms 12, No. 1, 154-178 (1991). MSC: 68R05 68Q25 68W10 PDF BibTeX XML Cite \textit{J. J. M. Tan}, J. Algorithms 12, No. 1, 154--178 (1991; Zbl 0715.68069) Full Text: DOI
Hayward, Ryan; McDiarmid, Colin Average case analysis of heap building by repeated insertion. (English) Zbl 0715.68038 J. Algorithms 12, No. 1, 126-153 (1991). MSC: 68Q25 68P05 PDF BibTeX XML Cite \textit{R. Hayward} and \textit{C. McDiarmid}, J. Algorithms 12, No. 1, 126--153 (1991; Zbl 0715.68038) Full Text: DOI
Przytycka, T.; Corneil, D. G. Parallel algorithms for parity graphs. (English) Zbl 0715.68034 J. Algorithms 12, No. 1, 96-109 (1991). MSC: 68W15 68R10 68Q25 PDF BibTeX XML Cite \textit{T. Przytycka} and \textit{D. G. Corneil}, J. Algorithms 12, No. 1, 96--109 (1991; Zbl 0715.68034) Full Text: DOI
Matoušek, Jiří; Thomas, Robin Algorithms finding tree-decompositions of graphs. (English) Zbl 0712.68077 J. Algorithms 12, No. 1, 1-22 (1991). MSC: 68R10 68Q25 05C85 PDF BibTeX XML Cite \textit{J. Matoušek} and \textit{R. Thomas}, J. Algorithms 12, No. 1, 1--22 (1991; Zbl 0712.68077) Full Text: DOI
He, Xin An improved algorithm for the planar 3-cut problem. (English) Zbl 0712.68075 J. Algorithms 12, No. 1, 23-37 (1991). MSC: 68R10 68Q25 05C85 PDF BibTeX XML Cite \textit{X. He}, J. Algorithms 12, No. 1, 23--37 (1991; Zbl 0712.68075) Full Text: DOI