Klawe, Maria M. A tight bound for black and white pebbles on the pyramid. (English) Zbl 0632.68042 J. Assoc. Comput. Mach. 32, 218-228 (1985). MSC: 68Q25 68R10 PDFBibTeX XMLCite \textit{M. M. Klawe}, J. Assoc. Comput. Mach. 32, 218--228 (1985; Zbl 0632.68042) Full Text: DOI
Brudaru, O. A parallel algorithm for a variant of the acyclic partition problem. (English) Zbl 0615.68046 Graphen und Netzwerke - Theorie und Anwendungen, 30. int. wiss. Kolloq., Ilmenau 1985, Heft 5, 29-32 (1985). MSC: 68R10 05C70 05C20 PDFBibTeX XML
Klawe, Maria M. The complexity of pebbling for two classes of graphs. (English) Zbl 0593.05057 Graph theory with applications to algorithms and computer science, Proc. 5th Int. Conf., Kalamazoo/Mich. 1984, 475-487 (1985). MSC: 05C99 05C20 68Q25 PDFBibTeX XML
Richter, Knut Complexity of the robot sequencing problem. (English) Zbl 0587.90053 Seminarber., Humboldt-Univ. Berlin, Sekt. Math. 71, 94-99 (1985). MSC: 90B35 90C10 68R10 05C35 68Q25 PDFBibTeX XMLCite \textit{K. Richter}, Seminarber., Humboldt-Univ. Berlin, Sekt. Math. 71, 94--99 (1985; Zbl 0587.90053)
Savage, John E.; Vitter, Jeffrey Scott Parallelism in space-time tradeoffs. (English) Zbl 0586.68057 VLSI: Algorithms and architectures, Proc. Int. Workshop Parallel Comput. VLSI, Amalfi/Italy 1984, 49-58 (1985). MSC: 68R10 68Q25 68N25 PDFBibTeX XML
Green, Christopher D.; Suraweera, Francis A path entropy function for rooted acyclic digraphs. (English) Zbl 0585.05010 J. Univ. Kuwait, Sci. 12, 15-21 (1985). Reviewer: P.Avery MSC: 05C20 05C38 05C05 68R10 PDFBibTeX XMLCite \textit{C. D. Green} and \textit{F. Suraweera}, J. Univ. Kuwait, Sci. 12, 15--21 (1985; Zbl 0585.05010)
Dunne, Paul E. Lower bounds on the complexity of 1-time only branching programs. (English) Zbl 0575.68064 Fundamentals of computation theory, Proc. 5th Int. Conf., Cottbus/Ger. 1985, Lect. Notes Comput. Sci. 199, 90-99 (1985). MSC: 68Q25 68R10 94C10 05C45 05C70 PDFBibTeX XML
Asano, Tetsuo; Sato, Shinichi Long path enumeration algorithms for timing verification on large digital systems. (English) Zbl 0572.05034 Graph theory with applications to algorithms and computer science, Proc. 5th Int. Conf., Kalamazoo/Mich. 1984, 25-35 (1985). Reviewer: E.M.Palmer MSC: 05C30 05C38 68R10 PDFBibTeX XML
Hanlon, P. The chromatic polynomial of an unlabeled graph. (English) Zbl 0567.05025 J. Comb. Theory, Ser. B 38, 226-239 (1985). Reviewer: E.M.Palmer MSC: 05C15 05C20 05C30 PDFBibTeX XMLCite \textit{P. Hanlon}, J. Comb. Theory, Ser. B 38, 226--239 (1985; Zbl 0567.05025) Full Text: DOI
Reinelt, G. The linear ordering problem: algorithms and applications. (English) Zbl 0565.68058 Research and Exposition in Mathematics, 8. Berlin: Heldermann Verlag. XI, 158 p. (1985). Reviewer: J.K.Lenstra MSC: 68Rxx 90C05 90-04 68-02 90-02 PDFBibTeX XML
Thomassen, Carsten The 2-linkage problem for acyclic digraphs. (English) Zbl 0563.05027 Discrete Math. 55, 73-87 (1985). Reviewer: W.-K.Chen MSC: 05C20 05C38 05C10 PDFBibTeX XMLCite \textit{C. Thomassen}, Discrete Math. 55, 73--87 (1985; Zbl 0563.05027) Full Text: DOI
Jünger, M. Polyhedral combinatorics and the acyclic subdigraph problem. (English) Zbl 0557.68045 Research and Exposition in Mathematics, 7. Berlin: Heldermann Verlag. x, 128 p. DM 36.00 (1985). Reviewer: Jan Karel Lenstra (Amsterdam) MSC: 90C57 90-02 05-02 68-02 05C20 51M20 68R10 PDFBibTeX XML