Fraenkel, Aviezri S. Planar kernel and Grundy with \(d\leq 3\), \(dout\leq 2\), \(din\leq 2\) are NP- complete. (English) Zbl 0493.68040 Discrete Appl. Math. 3, 257-262 (1981). MSC: 68Q25 05C20 68R10 PDF BibTeX XML Cite \textit{A. S. Fraenkel}, Discrete Appl. Math. 3, 257--262 (1981; Zbl 0493.68040) Full Text: DOI
Ehrenfeucht, A.; Rozenberg, G.; Verraedt, R. Basic formulas and languages. I: The theory. (English) Zbl 0488.68047 Discrete Appl. Math. 3, 235-255 (1981). MSC: 68Q45 68Q42 PDF BibTeX XML Cite \textit{A. Ehrenfeucht} et al., Discrete Appl. Math. 3, 235--255 (1981; Zbl 0488.68047) Full Text: DOI
Rozenberg, Grzegorz; Salomaa, Arto Table systems with unconditional transfer. (English) Zbl 0486.68076 Discrete Appl. Math. 3, 319-322 (1981). MSC: 68Q45 PDF BibTeX XML Cite \textit{G. Rozenberg} and \textit{A. Salomaa}, Discrete Appl. Math. 3, 319--322 (1981; Zbl 0486.68076) Full Text: DOI
Maurer, H. A.; Salomaa, A.; Wood, D. Decidability and density in two-symbol grammar forms. (English) Zbl 0482.68072 Discrete Appl. Math. 3, 289-299 (1981). MSC: 68Q45 PDF BibTeX XML Cite \textit{H. A. Maurer} et al., Discrete Appl. Math. 3, 289--299 (1981; Zbl 0482.68072) Full Text: DOI
Colbourn, Marlene J.; Colbourn, Charles J. Concerning the complexity of deciding isomorphism of block designs. (English) Zbl 0475.05075 Discrete Appl. Math. 3, 155-162 (1981). MSC: 05C99 05B05 PDF BibTeX XML Cite \textit{M. J. Colbourn} and \textit{C. J. Colbourn}, Discrete Appl. Math. 3, 155--162 (1981; Zbl 0475.05075) Full Text: DOI
Poljak, Svatopluk; Rödl, Vojtěch; Turzík, Daniel Complexity of representation of graphs by set systems. (English) Zbl 0473.68064 Discrete Appl. Math. 3, 301-312 (1981). MSC: 68R10 68Q25 05C99 PDF BibTeX XML Cite \textit{S. Poljak} et al., Discrete Appl. Math. 3, 301--312 (1981; Zbl 0473.68064) Full Text: DOI
Beck, Jozsef; Fiala, Tibor “Integer-making” theorems. (English) Zbl 0473.05046 Discrete Appl. Math. 3, 1-8 (1981). Reviewer: Tiberiu Spircu (Bucureşti) MSC: 05C99 90C10 05D05 PDF BibTeX XML Cite \textit{J. Beck} and \textit{T. Fiala}, Discrete Appl. Math. 3, 1--8 (1981; Zbl 0473.05046) Full Text: DOI
Zeitlin, Zeev Minimization of maximum absolute deviation in integers. (English) Zbl 0471.90075 Discrete Appl. Math. 3, 203-220 (1981). MSC: 90C10 90C90 91A99 49J35 PDF BibTeX XML Cite \textit{Z. Zeitlin}, Discrete Appl. Math. 3, 203--220 (1981; Zbl 0471.90075) Full Text: DOI
Thayse, A. Universal algorithms for evaluating Boolean functions. (English) Zbl 0469.94019 Discrete Appl. Math. 3, 53-65 (1981). MSC: 94C10 PDF BibTeX XML Cite \textit{A. Thayse}, Discrete Appl. Math. 3, 53--65 (1981; Zbl 0469.94019) Full Text: DOI
Akiyama, J.; Avis, D.; Chvatal, V.; Era, H. Balancing signed graphs. (English) Zbl 0468.05066 Discrete Appl. Math. 3, 227-233 (1981). MSC: 05C99 PDF BibTeX XML Cite \textit{J. Akiyama} et al., Discrete Appl. Math. 3, 227--233 (1981; Zbl 0468.05066) Full Text: DOI
Slater, Peter J. Accretion centers: A generalization of branch weight centroids. (English) Zbl 0467.05045 Discrete Appl. Math. 3, 187-192 (1981). MSC: 05C40 05C05 PDF BibTeX XML Cite \textit{P. J. Slater}, Discrete Appl. Math. 3, 187--192 (1981; Zbl 0467.05045) Full Text: DOI
Ishii, Hiroaki; Shiode, Shogo; Nishida, Toshio; Namasuya, Yoshikazu Stochastic spanning tree problem. (English) Zbl 0466.90056 Discrete Appl. Math. 3, 263-273 (1981). MSC: 90C15 90C35 90B10 65K05 68Q25 90C10 PDF BibTeX XML Cite \textit{H. Ishii} et al., Discrete Appl. Math. 3, 263--273 (1981; Zbl 0466.90056) Full Text: DOI
Martello, Silvano; Toth, Paolo A bound and bound algorithm for the zero-one multiple knapsack problem. (English) Zbl 0466.90050 Discrete Appl. Math. 3, 275-288 (1981). MSC: 90C09 90C05 65K05 PDF BibTeX XML Cite \textit{S. Martello} and \textit{P. Toth}, Discrete Appl. Math. 3, 275--288 (1981; Zbl 0466.90050) Full Text: DOI
Maurer, H. A.; Salomaa, A.; Wood, D. Colorings and interpretations: a connection between graphs and grammar forms. (English) Zbl 0466.05034 Discrete Appl. Math. 3, 119-135 (1981). MSC: 05C15 68Q45 PDF BibTeX XML Cite \textit{H. A. Maurer} et al., Discrete Appl. Math. 3, 119--135 (1981; Zbl 0466.05034) Full Text: DOI
Klarner, D. A. Mathematical crystal growth. I. II. (English) Zbl 0466.05007 Discrete Appl. Math. 3, 47-52, 113-117 (1981). MSC: 05A15 16W60 PDF BibTeX XML Cite \textit{D. A. Klarner}, Discrete Appl. Math. 3, 47--52, 113--117 (1981; Zbl 0466.05007) Full Text: DOI
Gens, G. V.; Levner, E. V. Fast approximation algorithm for job sequencing with deadlines. (English) Zbl 0464.90035 Discrete Appl. Math. 3, 313-318 (1981). MSC: 90B35 65K05 68Q25 PDF BibTeX XML Cite \textit{G. V. Gens} and \textit{E. V. Levner}, Discrete Appl. Math. 3, 313--318 (1981; Zbl 0464.90035) Full Text: DOI
Corneil, D. G.; Lerchs, H.; Stewart Burlingham, L. Complement reducible graphs. (English) Zbl 0463.05057 Discrete Appl. Math. 3, 163-174 (1981). MSC: 05C75 05C05 PDF BibTeX XML Cite \textit{D. G. Corneil} et al., Discrete Appl. Math. 3, 163--174 (1981; Zbl 0463.05057) Full Text: DOI
Holdridge, D. B.; Davis, J. A. Comment on ”A note on perfect Lee-codes”. (English) Zbl 0461.94004 Discrete Appl. Math. 3, 221 (1981). MSC: 94B25 PDF BibTeX XML Cite \textit{D. B. Holdridge} and \textit{J. A. Davis}, Discrete Appl. Math. 3, 221 (1981; Zbl 0461.94004) Full Text: DOI
Wolsey, L. A. The b-hull of an integer program. (English) Zbl 0457.90055 Discrete Appl. Math. 3, 193-201 (1981). MSC: 90C10 PDF BibTeX XML Cite \textit{L. A. Wolsey}, Discrete Appl. Math. 3, 193--201 (1981; Zbl 0457.90055) Full Text: DOI
Gale, David; Politof, Themistocles Substitutes and complements in network flow problems. (English) Zbl 0457.90029 Discrete Appl. Math. 3, 175-186 (1981). MSC: 90B10 PDF BibTeX XML Cite \textit{D. Gale} and \textit{T. Politof}, Discrete Appl. Math. 3, 175--186 (1981; Zbl 0457.90029) Full Text: DOI
Krichevskii, R. E.; Ryabko, B. Ya.; Haritonov, A. Yu. Optimal key for taxons ordered in accordance with their frequencies. (English) Zbl 0455.92001 Discrete Appl. Math. 3, 67-72 (1981). MSC: 92-XX 62P10 94A17 PDF BibTeX XML Cite \textit{R. E. Krichevskii} et al., Discrete Appl. Math. 3, 67--72 (1981; Zbl 0455.92001) Full Text: DOI
Boesch, F. T.; Suffel, C. L. Realizability of p-point graphs with prescribed minimum degree, maximum degree, and point-connectivity. (English) Zbl 0455.05038 Discrete Appl. Math. 3, 9-18 (1981). MSC: 05C35 05C40 PDF BibTeX XML Cite \textit{F. T. Boesch} and \textit{C. L. Suffel}, Discrete Appl. Math. 3, 9--18 (1981; Zbl 0455.05038) Full Text: DOI
Goles, E.; Olivos, J. Comportement périodique des fonctions à seuil binaires et applications. (French) Zbl 0454.68042 Discrete Appl. Math. 3, 93-105 (1981). MSC: 68Q80 94C10 92B05 91E99 91B10 PDF BibTeX XML Cite \textit{E. Goles} and \textit{J. Olivos}, Discrete Appl. Math. 3, 93--105 (1981; Zbl 0454.68042) Full Text: DOI
Janowitz, M. F. Continuous L-cluster methods. (English) Zbl 0454.62056 Discrete Appl. Math. 3, 107-112 (1981). MSC: 62H30 06A06 54F99 PDF BibTeX XML Cite \textit{M. F. Janowitz}, Discrete Appl. Math. 3, 107--112 (1981; Zbl 0454.62056) Full Text: DOI
Lepistö, Timo A note on perfect Lee-codes over small alphabets. (English) Zbl 0453.94022 Discrete Appl. Math. 3, 73-74 (1981). MSC: 94B25 05B40 PDF BibTeX XML Cite \textit{T. Lepistö}, Discrete Appl. Math. 3, 73--74 (1981; Zbl 0453.94022) Full Text: DOI
Karp, Richard M.; Orlin, James B. Parametric shortest path algorithms with an application to cyclic staffing. (English) Zbl 0453.68032 Discrete Appl. Math. 3, 37-45 (1981). MSC: 68R10 05C38 PDF BibTeX XML Cite \textit{R. M. Karp} and \textit{J. B. Orlin}, Discrete Appl. Math. 3, 37--45 (1981; Zbl 0453.68032) Full Text: DOI
Takamizawa, K.; Nishizeki, T.; Saito, N. Combinatorial problems on series-parallel graphs. (English) Zbl 0452.68070 Discrete Appl. Math. 3, 75-76 (1981). MSC: 68R10 68Q25 PDF BibTeX XML Cite \textit{K. Takamizawa} et al., Discrete Appl. Math. 3, 75--76 (1981; Zbl 0452.68070) Full Text: DOI
Cuninghame-Green, R. A. Integer programming by long division. (English) Zbl 0451.90085 Discrete Appl. Math. 3, 19-25 (1981). MSC: 90C10 20K01 90C48 PDF BibTeX XML Cite \textit{R. A. Cuninghame-Green}, Discrete Appl. Math. 3, 19--25 (1981; Zbl 0451.90085) Full Text: DOI
Fishburn, Peter C. Inverted orders for monotone scoring rules. (English) Zbl 0451.90010 Discrete Appl. Math. 3, 27-36 (1981). MSC: 91B14 PDF BibTeX XML Cite \textit{P. C. Fishburn}, Discrete Appl. Math. 3, 27--36 (1981; Zbl 0451.90010) Full Text: DOI
Durand, Dominique; Bruneau, Claude-Marcel Graph theory and molecular distribution. I: copolycondensation of polyfunctional monomers bearing identical reactive groups. (English) Zbl 0451.05045 Discrete Appl. Math. 3, 79-91 (1981). MSC: 05C99 05C05 05C30 PDF BibTeX XML Cite \textit{D. Durand} and \textit{C.-M. Bruneau}, Discrete Appl. Math. 3, 79--91 (1981; Zbl 0451.05045) Full Text: DOI
Watanabe, Toshimasa; Ae, Tadashi; Nakamura, Akira On the removal of forbidden graphs by edge-deletion or by edge- contraction. (English) Zbl 0448.05052 Discrete Appl. Math. 3, 151-153 (1981). MSC: 05C99 05C35 PDF BibTeX XML Cite \textit{T. Watanabe} et al., Discrete Appl. Math. 3, 151--153 (1981; Zbl 0448.05052) Full Text: DOI
Monma, C. L. Sequencing with general precedence constraints. (English) Zbl 0438.90037 Discrete Appl. Math. 3, 137-150 (1981). MSC: 90B35 PDF BibTeX XML Cite \textit{C. L. Monma}, Discrete Appl. Math. 3, 137--150 (1981; Zbl 0438.90037) Full Text: DOI