Last update:
Mon Aug 26 15:56:45 MDT 2024
Jerrold R. Griggs and
Douglas B. West Extremal values of the interval number
of a graph . . . . . . . . . . . . . . . 1--7
R. L. Graham and
S.-Y. R. Li and
W. C. W. Li On the structure of $t$-designs . . . . 8--14
Daniel J. Kleitman and
Kenneth J. Winston Ensembles and largest sojourns of random
walks . . . . . . . . . . . . . . . . . 15--20
Gerard J. Chang and
F. K. Hwang A group testing problem . . . . . . . . 21--24
A. Meir and
J. W. Moon and
J. R. Pounder On the order of random channel networks 25--33
James Greenberg and
Curtis Greene and
Stuart Hastings A combinatorial problem arising in the
study of reaction-diffusion equations 34--42
Frank Ruskey On the average shape of binary trees . . 43--50
Richard T. Wong Worst-case analysis of network design
problem heuristics . . . . . . . . . . . 51--63
Kenneth A. Berman A proof of Tutte's trinity theorem and a
new determinant formula . . . . . . . . 64--69
Arthur M. Farley and
Stephen T. Hedetniemi and
Sandra L. Mitchell Rectilinear Steiner trees in rectangle
trees . . . . . . . . . . . . . . . . . 70--81
Arnold Barnett and
John Mazzarino On the sequential search for
spatially-distributed events . . . . . . 82--91
J. Demetrovics Candidate keys and antichains . . . . . 92--92
Guy Latouche and
Marcel F. Neuts Efficient algorithmic solutions to
exponential tandem queues with blocking 93--106
Sharad V. Kanetkar and
Meghanad D. Wagh On construction of matrices with
distinct submatrices . . . . . . . . . . 107--113
Gérard Letac and
Lajos Takács Random walks on a $600$-cell . . . . . . 114--120
Harvey Diamond Asymptotic equilibria in a class of
$N$-person symmetric games . . . . . . . 121--136
Charles F. Dunkl Orthogonal polynomials in two variables
of $q$-Hahn and $q$-Jacobi type . . . . 137--151
E. N. Gilbert Random colorings of a lattice of squares
in the plane . . . . . . . . . . . . . . 152--159
Dennis Stanton Some Erd\Hos--Ko--Rado theorems for
Chevalley groups . . . . . . . . . . . . 160--163
Nicholas Pippenger A new lower bound for the number of
switches in rearrangeable networks . . . 164--167
Richard P. Stanley Weyl groups, the hard Lefschetz Theorem,
and the Sperner property . . . . . . . . 168--184
Shmuel Friedland and
Hans Schneider The growth of powers of a nonnegative
matrix . . . . . . . . . . . . . . . . . 185--200
V. Aggarwal and
R. Chandrasekaran and
K. P. K. Nair Discounted stochastic ratio games . . . 201--210
Michael Saks Dilworth numbers, incidence maps and
product partial orders . . . . . . . . . 211--215
M. R. Garey and
D. S. Johnson and
G. L. Miller and
C. H. Papadimitriou The complexity of coloring circular arcs
and chords . . . . . . . . . . . . . . . 216--227
Sukhamay Kundu and
E. Sampathkumar and
James Shearer and
Dean Sturtevant Reconstruction of a pair of graphs from
their concatenations . . . . . . . . . . 228--231
E. Arthurs and
B. W. Stuck Controlling overload in a digital system 232--250
R. L. Graham and
A. C. Yao and
F. F. Yao Some monotonicity properties of partial
orders . . . . . . . . . . . . . . . . . 251--258
J. Aczél and
C. Wagner A characterization of weighted
arithmetic means . . . . . . . . . . . . 259--260
Gerard Cornuejols and
George L. Nemhauser and
Laurence A. Wolsey A canonical representation of simple
plant location problems and its
applications . . . . . . . . . . . . . . 261--272
Carl D. Meyer, Jr. The condition of a finite Markov chain
and perturbation bounds for the limiting
probabilities . . . . . . . . . . . . . 273--283
Allan R. Sampson Nonnegative Cholesky decomposition and
its application to association of random
variables . . . . . . . . . . . . . . . 284--291
John R. Gilbert A note on the NP-completeness of vertex
elimination on directed graphs . . . . . 292--294
L. A. Shepp The FKG inequality and some monotonicity
properties of partial orders . . . . . . 295--299
Moshe Friedman and
Jeffrey L. Winter An asymptotic solution of inventory
lot-size models with homogeneous
time-dependent demand functions . . . . 300--314
Z. Drezner and
G. O. Wesolowsky Single facility $l_p$-distance minimax
location . . . . . . . . . . . . . . . . 315--321
F. R. K. Chung and
F. K. Hwang The connection patterns of two complete
binary trees . . . . . . . . . . . . . . 322--335
Ph. Delsarte and
Y. Genin and
Y. Kamp Planar least-squares inverse
polynomials. II. Asymptotic behavior . . 336--344
Ludwig Baringhaus Characterization of distributions by
random sums . . . . . . . . . . . . . . 345--347
Y. Soun and
K. Truemper Single commodity representation of
multicommodity networks . . . . . . . . 348--358
Kenneth A. Berman A graph-theoretical approach to handicap
ranking of tournaments and paired
comparisons . . . . . . . . . . . . . . 359--361
James B. Saxe Dynamic-programming algorithms for
recognizing small-bandwidth graphs in
polynomial time . . . . . . . . . . . . 363--369
R. Chandrasekaran and
A. Tamir An $O((n$ ${\rm log}$ $p)^2)$ algorithm
for the continuous $p$-center problem on
a tree . . . . . . . . . . . . . . . . . 370--375
Peter Frankl and
Zoltán Füredi The Erd\Hos-Ko-Rado theorem for integer
sequences . . . . . . . . . . . . . . . 376--381
R. L. Graham and
N. J. A. Sloane On additive bases and harmonious graphs 382--404
F. R. K. Chung and
P. C. Fishburn and
R. L. Graham On unimodality for linear extensions of
partial orders . . . . . . . . . . . . . 405--410
Solomon W. Golomb Obtaining specified irreducible
polynomials over finite fields . . . . . 411--418
Mordechai Lewin Totally nonnegative, $M$-, and Jacobi
matrices . . . . . . . . . . . . . . . . 419--421
Jan R. Magnus and
H. Neudecker The elimination matrix: some lemmas and
applications . . . . . . . . . . . . . . 422--449
Edward A. Bertram and
Victor K. Wei Decomposing a permutation into two large
cycles: an enumeration . . . . . . . . . 450--461
A. Meir and
J. W. Moon and
J. R. Pounder Acknowledgment of priority: ``On the
order of random channel networks'' . . . 462--462
F. R. K. Chung On the decomposition of graphs . . . . . 1--12
Richard T. Bumby A problem with telephones . . . . . . . 13--18
Tommy Elfving On the sensitivity of the gravity model 19--24
Uriel G. Rothblum Sensitive growth analysis of
multiplicative systems. I. The dynamic
approach . . . . . . . . . . . . . . . . 25--34
Gerard J. Chang and
F. K. Hwang A group testing problem on two disjoint
sets . . . . . . . . . . . . . . . . . . 35--38
P. L. Hammer and
T. Ibaraki and
B. Simeone Threshold sequences . . . . . . . . . . 39--49
J. H. Dinitz and
D. R. Stinson A fast algorithm for finding strong
starters . . . . . . . . . . . . . . . . 50--56
A. Berman and
B. N. Parlett and
R. J. Plemmons Diagonal scaling to an orthogonal matrix 57--65
S. K. Jain and
L. E. Snyder Nonnegative $\lambda$-monotone matrices 66--76
Mihalis Yannakakis Computing the minimum fill-in is
NP-complete . . . . . . . . . . . . . . 77--79
M. C. Hu and
F. K. Hwang and
Ju Kwei Wang A boundary problem for group testing . . 81--87
James B. Orlin and
Maurizio A. Bonuccelli and
Daniel P. Bovet An $O(n^2)$ algorithm for coloring
proper circular arc graphs . . . . . . . 88--93
P. Delsarte and
Y. Genin and
Y. Kamp Generalized Schur representation of
matrix-valued functions . . . . . . . . 94--107
Thomas Inukai and
Louis Weinberg Whitney connectivity of matroids . . . . 108--120
Pierre A. von Kaenel Some constructions for convolutional and
block codes . . . . . . . . . . . . . . 121--126
Peter C. Fishburn Maximum semiorders in interval orders 127--135
F. Alberto Grünbaum Eigenvectors of a Toeplitz matrix:
discrete version of the prolate
spheroidal wave functions . . . . . . . 136--141
D. J. Kleitman and
Michael E. Saks Set orderings requiring costliest
alphabetic binary trees . . . . . . . . 142--146
B. S. Baker and
E. G. Coffman, Jr. A tight asymptotic bound, for
Next-Fit-Decreasing bin-packing . . . . 147--152
Lajos Takács Random flights on regular polytopes . . 153--171
Rick Giles Adjacency on the postman polyhedron . . 172--175
Marci Perlstadt Sampling schemes for Fourier transform
reconstruction . . . . . . . . . . . . . 176--191
Ph. Delsarte and
Y. Genin and
Y. Kamp Half-plane minimization of matrix-valued
quadratic functionals . . . . . . . . . 192--211
H. Z. Aashtiani and
T. L. Magnanti Equilibria on a congested transportation
network . . . . . . . . . . . . . . . . 213--226
Harvey J. Greenberg and
J. Richard Lundgren and
John S. Maybee Graph theoretic methods for the
qualitative analysis of rectangular
matrices . . . . . . . . . . . . . . . . 227--239
Michael O. Albertson and
Claire J. O'Keefe Covering regions with squares . . . . . 240--243
Julián Aráoz and
Ellis L. Johnson Some results on polyhedra of semigroup
problems . . . . . . . . . . . . . . . . 244--258
Ronald L. Smith $M$-matrices whose inverses are
stochastic . . . . . . . . . . . . . . . 259--265
James H. McKay and
Stuart Sui-Sheng Wang The $v\times v$ $(0,1,-1)$-circulant
equation $AA^{\sf T}=vI-J$ . . . . . . . 266--274
A. H. Zemanian Equilibrium and stability in a periodic
marketing ring . . . . . . . . . . . . . 275--288
B. L. Granovsky Optimal formulae of the conditional
Monte Carlo . . . . . . . . . . . . . . 289--294
Douglas B. West and
Craig A. Tovey Semiantichains and unichain coverings in
direct products of partial orders . . . 295--305
G. W. Peck A Helly theorem for sets . . . . . . . . 306--308
James B. Shearer A counterexample to a bin packing
conjecture . . . . . . . . . . . . . . . 309--310
Y. P. Mack Local properties of $k$-NN regression
estimates . . . . . . . . . . . . . . . 311--323
Kiem Phong Vo The Schensted correspondence and
lexicographic matchings on multi-subset
lattices . . . . . . . . . . . . . . . . 324--332
Nathan Linial and
Bruce L. Rothschild Incidence matrices of subsets---a rank
formula . . . . . . . . . . . . . . . . 333--340
R. B. Nain and
Kanwar Sen Fluctuation results for Markov-dependent
trials . . . . . . . . . . . . . . . . . 341--346
Stephen M. Gagola, Jr. Weight enumerators of normalized codes 347--380
Arthur M. Farley and
Andrzej Proskurowski Broadcasting in trees with multipole
originators . . . . . . . . . . . . . . 381--386
S. F. Assmann and
G. W. Peck and
M. M. Syslo and
J. Zak The bandwidth of caterpillars with hairs
of length 1 and 2* . . . . . . . . . . . 387--393
Seth Chaiken and
Daniel J. Kleitman and
Michael Saks and
James Shearer Covering regions by rectangles . . . . . 394--410
B. L. Hulme and
P. J. Slater Minimean location of different
facilities on a line network . . . . . . 411--415
S. Baum and
L. E. Trotter, Jr. Integer rounding for polymatroid and
branching optimization problems . . . . 416--425
F. K. Hwang and
Tien Tai Song and
Ding Zhu Du Hypergeometric and generalized
hypergeometric group testing . . . . . . 426--428
Emden R. Gansner Acyclic digraphs, Young tableaux and
nilpotent matrices . . . . . . . . . . . 429--440
D. G. Kelly and
J. W. Tolle Expected number of vertices of a random
convex polyhedron . . . . . . . . . . . 441--451
C. L. Mallows and
N. J. A. Sloane Weight enumerators of self-orthogonal
codes over ${\rm GF}(3)$ . . . . . . . . 452--460
B. E. Flinchbaugh and
L. K. Jones Strong connectivity in directional
nearest-neighbor graphs . . . . . . . . 461--463
T. Downs and
P. K. W. Chan The reliability of standby systems with
a faulty switch . . . . . . . . . . . . 464--471
H. K. Wimmer The algebraic Riccati equation without
complete controllability . . . . . . . . 1--12
C. J. K. Batty and
M. J. Pelling and
D. G. Rogers Some recurrence relations of recursive
minimization . . . . . . . . . . . . . . 13--29
J. V. Brawley Counting matrices by Drazin index . . . 30--34
Helmut Prodinger Generalizing the sum of digits function 35--42
Robert Calderbank and
David B. Wales Multiplying vectors in binary quadratic
residue codes . . . . . . . . . . . . . 43--55
Manish C. Bhattacharjee The class of mean residual lives and
some consequences . . . . . . . . . . . 56--65
F. R. K. Chung and
M. R. Garey and
D. S. Johnson On packing two-dimensional bins . . . . 66--76
Guy Latouche A phase-type semi-Markov point process 77--90
L. Lovász and
Y. Yemini On generic rigidity in the plane . . . . 91--98
Thomas Lengauer Upper and lower bounds on the complexity
of the min-cut linear arrangement
problem on trees . . . . . . . . . . . . 99--113
R. Taylor Switchings constrained to
$2$-connectivity in simple graphs . . . 114--121
Ray Redheffer and
Zhi Ming Zhou A class of matrices connected with
Volterra prey-predator equations . . . . 122--134
R. S. Booth An odd order search problem . . . . . . 135--143
Philip C. Jones Computing an optimal invariant capital
stock . . . . . . . . . . . . . . . . . 145--150
William M. Kantor Spreads, translation planes and Kerdock
sets. I . . . . . . . . . . . . . . . . 151--165
Michael O. Ball and
J. Scott Provan Bounds on the reliability polynomial for
shellable independence systems . . . . . 166--181
P. L. Buzytsky An effective formula for the number of
solutions of linear Boolean equations 182--186
Charles J. Colbourn Farey series and maximal outerplanar
graphs . . . . . . . . . . . . . . . . . 187--189
Bryan L. Deuermeyer and
Donald K. Friesen and
Michael A. Langston Scheduling to maximize the minimum
processor finish time in a
multiprocessor system . . . . . . . . . 190--196
Yoshimi Egawa and
S. K. Jain Nonnegative matrices $A$ such that
$Ax=b$ has nonnegative best approximate
solution . . . . . . . . . . . . . . . . 197--213
William H. Cunningham Decomposition of directed graphs . . . . 214--228
Hristo Nicolov Djidjev On the problem of partitioning planar
graphs . . . . . . . . . . . . . . . . . 229--240
Marcia de Brandes and
Kevin T. Phelps and
Vojt\vech Rödl Coloring Steiner triple systems . . . . 241--249
R. S. Varga and
D. Y. Cai On the $LU$ factorization of
$M$-matrices: cardinality of the set
${\cal P}^g_n(A)$ . . . . . . . . . . . 250--259
M. M. Klawe and
D. G. Corneil and
A. Proskurowski Isomorphism testing in hookup classes 260--274
Robert A. Proctor Representations of ${\germ s}{\germ
l}(2,\,{\bf C})$ on posets and the
Sperner property . . . . . . . . . . . . 275--280
James B. Shearer A class of perfect graphs . . . . . . . 281--284
Frank Harary and
Andrew Vince and
Dale Worley A point-symmetric graph that is nowhere
reversible . . . . . . . . . . . . . . . 285--287
Daniel Granot and
Gur Huberman The relationship between convex games
and minimum cost spanning tree games: a
case for permutationally convex games 288--292
David Carlson and
B. N. Datta and
Charles R. Johnson A semidefinite Lyapunov theorem and the
characterization of tridiagonal
$D$-stable matrices . . . . . . . . . . 293--304
Charles J. Colbourn and
Marlene J. Colbourn and
Kevin T. Phelps and
Vojt\vech Rödl Coloring block designs is NP-complete 305--307
W. M. Kantor Spreads, translation planes and Kerdock
sets. II . . . . . . . . . . . . . . . . 308--318
Seth Chaiken A combinatorial proof of the all minors
matrix tree theorem . . . . . . . . . . 319--329
Michael Saks A class of perfect graphs associated
with planar rectilinear regions . . . . 330--342
Joseph Rosenblatt and
Paul D. Seymour The structure of homometric sets . . . . 343--350
Mihalis Yannakakis The complexity of the partial order
dimension problem . . . . . . . . . . . 351--358
N. G. de Bruijn and
D. A. Klarner Multisets of aperiodic cycles . . . . . 359--368
C. J. K. Batty and
D. G. Rogers Some maximal solutions of the
generalized subadditive inequality . . . 369--378
John A. Wisniewski and
Ahmed H. Sameh Parallel algorithms for network routing
problems and recurrences . . . . . . . . 379--394
Jeffrey A. Ross On the exponent of a primitive, nearly
reducible matrix. II . . . . . . . . . . 395--410
Nicholas Pippenger and
Andrew C.-C. C. Yao Rearrangeable networks with limited
depth . . . . . . . . . . . . . . . . . 411--417
Douglas B. West Gossiping without duplicate
transmissions . . . . . . . . . . . . . 418--419
Robert J. Opsut On the computation of the competition
number of a graph . . . . . . . . . . . 420--428
Gernot M. Engel and
Hans Schneider Algorithms for testing the diagonal
similarity of matrices and related
problems . . . . . . . . . . . . . . . . 429--438
J. Peschon and
D. Ross New methods for evaluating distribution
automation and control (DAC) systems
benefits . . . . . . . . . . . . . . . . 439--452
W. P. Drews Practical applications of discrete
mathematical programming in Exxon . . . 453--464
R. Häggkvist and
P. Hell Sorting and merging in rounds . . . . . 465--473
Paolo M. Camerini and
Giulia Galbiati The bounded path tree problem . . . . . 474--484
R. Leibowitz and
S. F. Assmann and
G. W. Peck The interval count of a graph . . . . . 485--494
Ko Wei Lih Majorization of finite partially ordered
sets . . . . . . . . . . . . . . . . . . 495--503
Gerard Cornuejols and
Jean-Michel Thizy A primal approach to the simple plant
location problem . . . . . . . . . . . . 504--510
P. L. Hammer and
P. Hansen and
B. Simeone Vertices belonging to all or to no
maximum stable sets of a graph . . . . . 511--522
Ding Zhu Du and
F. K. Hwang Minimizing a combinatorial function . . 523--528
Eric Goles Fixed point behavior of threshold
functions on a finite set . . . . . . . 529--531
F. Frances Yao Speed-up in dynamic programming . . . . 532--540
Earl R. Barnes An algorithm for partitioning the nodes
of a graph . . . . . . . . . . . . . . . 541--550
William F. Lucas and
Kai Michaelis Finite solution theory for coalitional
games . . . . . . . . . . . . . . . . . 551--565
Margaret B. Cozzens and
Fred S. Roberts Double semiorders and double
indifference graphs . . . . . . . . . . 566--583
Marshall L. Fisher and
Laurence A. Wolsey On the greedy heuristic for continuous
covering and packing problems . . . . . 584--591
Kenneth Baclawski Recursive algorithms for unitary and
symplectic group representations . . . . 592--605
P. M. Winkler Correlation among partial orders . . . . 1--7
J. W. Moon On level numbers of $t$-ary trees . . . 8--13
G. Seroussi and
A. Lempel On symmetric representations of finite
fields . . . . . . . . . . . . . . . . . 14--21
Peter Tannenbaum Partitions of $Z^n_2$ . . . . . . . . . 22--29
E. S. Barnes and
N. J. A. Sloane The optimal lattice quantizer in three
dimensions . . . . . . . . . . . . . . . 30--41
S. Chaiken and
A. K. Dewdney and
P. J. Slater An optimal diagonal tree code . . . . . 42--49
Harvey J. Greenberg and
J. Richard Lundgren and
John S. Maybee Rectangular matrices and signed graphs 50--61
Kenneth A. Berman Leaky electricity: $1$-chain formulas
for the current and voltage . . . . . . 62--66
David E. Daykin and
Peter Frankl Inequalities for subsets of a set and
KLYM posets . . . . . . . . . . . . . . 67--69
Georg Gati The complexity of solving polynomial
equations by prime root extractions . . 70--71
M. R. Garey and
D. S. Johnson and
R. E. Tarjan and
M. Yannakakis Scheduling opposing forests . . . . . . 72--93
Marci Perlstadt Chopped orthogonal polynomial
expansions---some discrete cases . . . . 94--100
C. Christen Optimal detection of two complementary
defectives . . . . . . . . . . . . . . . 101--110
Silvio Ursic and
Cyro Patarra Exact solution of systems of linear
equations with iterative methods . . . . 111--115
Richard A. Brualdi and
Qiao Li Linear transformations on nonnegative
matrices preserving properties of
irreducibility and full
indecomposability . . . . . . . . . . . 116--131
Gerhard Gierz and
Werner Poguntke Minimizing setups for ordered sets: a
linear algebraic approach . . . . . . . 132--144
A. Neumaier Lattices of simplex type . . . . . . . . 145--160
T. R. Walsh Generating nonisomorphic maps without
storing them . . . . . . . . . . . . . . 161--178
I. P. Goulden and
D. M. Jackson and
J. W. Reilly The Hammond series of a symmetric
function and its application to
$P$-recursiveness . . . . . . . . . . . 179--193
J. Kahn and
M. Klawe and
D. Kleitman Traditional galleries require fewer
watchmen . . . . . . . . . . . . . . . . 194--206
Nimrod Megiddo and
Arie Tamir Finding least-distances lines . . . . . 207--211
William Cook A minimal totally dual integral defining
system for the $b$-matching polyhedron 212--220
Dorit S. Hochbaum On the fractional solution to the set
covering problem . . . . . . . . . . . . 221--222
Ray Redheffer and
Alexander Voigt Matrix products that can be evaluated in
closed form . . . . . . . . . . . . . . 223--230
Peter Kirschenhofer Subblock occurrences in the $q$-ary
representation of $n$ . . . . . . . . . 231--236
Stephen L. Campbell Index two linear time-varying singular
systems of differential equations . . . 237--243
Shoji Shinoda and
Wai Kai Chen and
Shu Park Chan The concept of two-chord tiesets and its
application to an algebraic
characterization of non-series-parallel
graphs . . . . . . . . . . . . . . . . . 244--252
Nimrod Megiddo and
Eitan Zemel and
S. Louis Hakimi The maximum coverage location problem 253--261
J. Scott Provan Determinacy in linear systems and
networks . . . . . . . . . . . . . . . . 262--278
Philippe Delsarte and
Y. Genin and
Y. Kamp Equivalence classes of Hermitian
matrices and their Schur parametrization 279--289
Peter C. Fishburn Threshold-bounded interval orders and a
theory of picycles . . . . . . . . . . . 290--305
J. E. Hopcroft and
M. S. Krishnamoorthy On the harmonious coloring of graphs . . 306--311
M. R. Garey and
D. S. Johnson Crossing number is NP-complete . . . . . 312--316
Stephen M. Gagola, Jr. Weight enumerators of normalized codes.
II. The Hermitian case . . . . . . . . . 317--354
K\=okichi Sugihara On some problems in the design of plane
skeletal structures . . . . . . . . . . 355--362
Arie Tamir A class of balanced matrices arising
from location problems . . . . . . . . . 363--370
C. Mark Aulick and
Thomas M. Gallie Isolating error effects in solving
ill-posed problems . . . . . . . . . . . 371--376
Abraham Berman and
Daniel Hershkowitz Matrix diagonal stability and its
implications . . . . . . . . . . . . . . 377--382
B. S. Baker and
A. R. Calderbank and
E. G. Coffman, Jr. and
J. C. Lagarias Approximation algorithms for maximizing
the number of squares packed into a
rectangle . . . . . . . . . . . . . . . 383--397
K. T. Phelps A combinatorial construction of perfect
codes . . . . . . . . . . . . . . . . . 398--403
Garry N. Newsam and
John D. Ramsdell Estimation of sparse Jacobian matrices 404--418
M. Deza and
P. Frankl Erd\Hos-Ko-Rado theorem---$22$ years
later . . . . . . . . . . . . . . . . . 419--431
P. Lancaster and
P. Rózsa On the matrix equation $AX+X^* A^* =C$ 432--436
Stephen M. Tanny and
Michael Zuker Signs of terms in a combinatorial
recursion . . . . . . . . . . . . . . . 437--441
Edward M. Bolger The Banzhaf index for multicandidate
presidential elections . . . . . . . . . 442--458
Louis W. Shapiro and
Wen Jin Woan and
Seyoum Getu Runs, slides and moments . . . . . . . . 459--466
Seth Chaiken A matroid abstraction of the
Bott--Duffin constrained inverse . . . . 467--475
Charles R. Johnson and
D. D. Olesky and
P. van den Driessche A class of $M$-matrices with tree graphs 476--480
Neil L. White and
Walter Whiteley The algebraic geometry of stresses in
frameworks . . . . . . . . . . . . . . . 481--511
Yehoshua Perl and
Yossi Shiloach Efficient optimization of monotonic
functions on trees . . . . . . . . . . . 512--516
Stephen L. Campbell and
Linda R. Petzold Canonical forms and solvable singular
systems of differential equations . . . 517--521
Kai Wang On the polynomials of graphs . . . . . . 522--528
S. P. Bhattacharyya Generalized controllability,
$(A,\,B)$-invariant subspaces and
parameter invariant control . . . . . . 529--533
Russell Merris and
William Watkins Tensors and graphs . . . . . . . . . . . 534--547
F. R. K. Chung and
A. L. Rosenberg and
Lawrence Snyder Perfect storage representations for
families of data structures . . . . . . 548--565
J. Aczél and
C. T. Ng and
C. Wagner Aggregation theorems for allocation
problems . . . . . . . . . . . . . . . . 1--8
Harald K. Wimmer On the dimension of bi-infinite systems 9--10
D. de Werra Preemptive scheduling, linear
programming and network flows . . . . . 11--20
A. Claus A new formulation for the travelling
salesman problem . . . . . . . . . . . . 21--25
S.-P. Han and
O. L. Mangasarian Characterization of positive definite
and semidefinite matrices via quadratic
programming duality . . . . . . . . . . 26--32
R. E. Funderlic and
R. J. Plemmons A combined direct-iterative method for
certain $M$-matrix linear systems . . . 33--42
Eugeniusz Toczy\lowski A hierarchical representation of the
inverse for sparse matrices . . . . . . 43--56
Kai Wang Spectra of some graphs . . . . . . . . . 57--60
Michael L. Fredman and
János Komlós On the Size of Separating Systems and
Families of Perfect Hash Functions . . . 61--68
Hosam Mahmoud and
Boris Pittel On the most probable shape of a search
tree grown from a random permutation . . 69--81
Nathan Friedman and
Abraham Boyarsky Entropy versus speed in ergodic Markov
maps . . . . . . . . . . . . . . . . . . 82--93
F. A. Bostock On a discrete search problem on three
arcs . . . . . . . . . . . . . . . . . . 94--100
Gerhard Herden Some aspects of clustering functions . . 101--116
J. M. S. Simões-Pereira A note on optimal and suboptimal digraph
realizations of quasidistance matrices 117--132
Donald J. Rose Convergent regular splittings for
singular $M$-matrices . . . . . . . . . 133--144
F. K. Hwang Three versions of a group testing game 145--153
Michael A. Langston Performance of heuristics for a computer
resource allocation problem . . . . . . 154--161
Andy Boucher It's hard to color antirectangles . . . 162--163
J. R. Koury and
D. F. McAllister and
W. J. Stewart Iterative methods for computing
stationary distributions of nearly
completely decomposable Markov chains 164--186
Moody T. Chu The generalized Toda flow, the ${\rm
QR}$ algorithm and the center manifold
theory . . . . . . . . . . . . . . . . . 187--201
Frank Thomson Leighton and
Margaret Lepley and
Gary L. Miller Layouts for the shuffle-exchange graph
based on the complex plane diagram . . . 202--215
Harvey J. Greenberg and
J. Richard Lundgren and
John S. Maybee Inverting signed graphs . . . . . . . . 216--223
K. T. Phelps A general product construction for error
correcting codes . . . . . . . . . . . . 224--228
Bernhard Korte and
László Lovász Greedoids and linear objective functions 229--238
Dominique de Werra On some properties of the struction of a
graph . . . . . . . . . . . . . . . . . 239--243
Michael J. Todd $J^{\prime} $: a new triangulation of
${\bf R}^n$ . . . . . . . . . . . . . . 244--254
Bernie L. Hulme Boolean methods of optimization over
independence systems . . . . . . . . . . 255--262
Peter C. Fishburn Discrete mathematics in voting and group
choice . . . . . . . . . . . . . . . . . 263--275
I. F. Blake and
R. Fuji-Hara and
R. C. Mullin and
S. A. Vanstone Computing logarithms in finite fields of
characteristic two . . . . . . . . . . . 276--285
R. Michael Tanner Explicit concentrators from generalized
$N$-gons . . . . . . . . . . . . . . . . 287--293
J. H. Conway and
N. J. A. Sloane On the Vorono\uì regions of certain
lattices . . . . . . . . . . . . . . . . 294--305
John R. Gilbert and
Donald J. Rose and
Anders Edenbrandt A separator theorem for chordal graphs 306--313
R. M. M. Mattheij Stability of block $LU$-decompositions
of matrices arising from BVP . . . . . . 314--331
Gerard J. Chang and
George L. Nemhauser The $k$-domination and $k$-stability
problems on sun-free chordal graphs . . 332--345
David Carlson and
B. N. Datta and
Hans Schneider On the controllability of matrix pairs
$(A,\,K)$ with $K$ positive semidefinite 346--350
Richard I. Shrager Optical spectra from chemical titration:
an analysis by SVD . . . . . . . . . . . 351--358
R. V. Moody and
J. Patera Characters of elements of finite order
in Lie groups . . . . . . . . . . . . . 359--383
C. J. Liu and
Yutze Chow On operator and formal sum methods for
graph enumeration problems . . . . . . . 384--406
John F. Sallee The middle-cut triangulations of the
$n$-cube . . . . . . . . . . . . . . . . 407--419
Renu Laskar and
John Pfaff and
S. M. Hedetniemi and
S. T. Hedetniemi On the algorithmic complexity of total
domination . . . . . . . . . . . . . . . 420--425
P. M. Camerini and
F. Maffioli Unlabelled partition systems:
optimization and complexity . . . . . . 426--441
David A. Carlson On reducing the space requirements of a
straight-line algorithm . . . . . . . . 442--450
Michael O. Albertson and
David M. Berman Combinatorial aspects of the orrery
model of syntax . . . . . . . . . . . . 451--456
Stephen Barnett Multiplication of generalized
polynomials, with applications to
classical orthogonal polynomials . . . . 457--462
R. S. Garfinkel and
P. S. Sundararaghavan Hamiltonian cycles in striped graphs:
the two-stripe problem . . . . . . . . . 463--466
Michael J. Todd Complementarity in oriented matroids . . 467--485
Shayle R. Searle and
William H. Swallow and
Charles E. McCulloch Nontestable hypotheses in linear models 486--496
Gerhard Herden The approximation of arbitrary
clustering functions by clustering
functions which satisfy overlapping
criteria . . . . . . . . . . . . . . . . 497--507
Amnon B. Barak and
Paul Erd\Hos On the maximal number of strongly
independent vertices in a random acyclic
directed graph . . . . . . . . . . . . . 508--514
Louis J. Billera and
Beth Spellman Munson Triangulations of oriented matroids and
convex polytopes . . . . . . . . . . . . 515--525
Bengt Aspvall and
John R. Gilbert Graph coloring using eigenvalue
decomposition . . . . . . . . . . . . . 526--538
A. Federgrün and
P. J. Schweitzer A fixed point approach to undiscounted
Markov renewal programs . . . . . . . . 539--550
Karel \vCulík On metapaths in metagraphs . . . . . . . 551--568
Yoram Moses and
Amos Noy On the encoding of relations by graphs 569--578
Margaret B. Cozzens and
Rochelle Leibowitz Threshold dimension of graphs . . . . . 579--595
Gérard Y. Vichniac Instability in discrete algorithms and
exact reversibility . . . . . . . . . . 596--602
James M. Abello and
Charles R. Johnson How large are transitive simple majority
domains . . . . . . . . . . . . . . . . 603--618
Uriel G. Rothblum Explicit solutions to optimization
problems on the intersections of the
unit ball of the $l_1$ and $l_\infty$
norms with a hyperplane . . . . . . . . 619--632
Ronald N. Goldman Polya's urn model and computer aided
geometric design . . . . . . . . . . . . 1--28
Mohamed A. Rabie A simple game with no symmetric solution 29--31
Hiroshi Hashimoto Decomposition of fuzzy matrices . . . . 32--38
Gilbert G. Walter Complexity and stability in
compartmental models . . . . . . . . . . 39--46
G. J. Butler and
Charles R. Johnson and
H. Wolkowicz Nonnegative solutions of a quadratic
matrix equation arising from comparison
theorems in ordinary differential
equations . . . . . . . . . . . . . . . 47--53
Günther Schmidt and
Thomas Ströhlein On kernels of graphs and solutions of
games: a synopsis based on relations and
fixpoints . . . . . . . . . . . . . . . 54--65
Daniel Boley A perturbation result for linear control
problems . . . . . . . . . . . . . . . . 66--72
Barton R. Plumstead and
Joan B. Plumstead Bounds for cube coloring . . . . . . . . 73--78
Mikio Kano and
Akio Sakamoto Ranking the vertices of a paired
comparison digraph . . . . . . . . . . . 79--92
Charles H. Goldberg and
Douglas B. West Bisection of circle colorings . . . . . 93--106
Minh Thanh Tran and
Mahmoud E. Sawan On the discrete Riccati matrix equation 107--108
Gerard J. Chang and
George L. Nemhauser Covering, packing and generalized
perfection . . . . . . . . . . . . . . . 109--132
James M. Abello Intrinsic limitations of the majority
rule, an algorithmic approach . . . . . 133--144
Milan Randi\'c On the characteristic equations of the
characteristic polynomial . . . . . . . 145--162
F. K. Hwang and
J. Sun and
E. Y. Yao Optimal set partitioning . . . . . . . . 163--170
Julián Aráoz and
Ellis L. Johnson Mappings and facets for nonabelian group
problems . . . . . . . . . . . . . . . . 171--188
Eitan Zemel Probabilistic analysis of geometric
location problems . . . . . . . . . . . 189--200
John de Pillis and
Michael Neumann The effect of the perturbation of
Hermitian matrices on their eigenvectors 201--209
H. W. Carter and
M. A. Breuer and
Z. A. Syed Incremental processing applied to
Munkres' algorithm and its application
in Steinberg's placement procedure . . . 210--219
Charles A. Hall Numerical solution of Navier--Stokes
problems by the dual variable method . . 220--236
George B. Dantzig and
B. Curtis Eaves and
Uriel G. Rothblum A decomposition and scaling-inequality
for line-sum-symmetric nonnegative
matrices . . . . . . . . . . . . . . . . 237--241
Chia-Shin Chung A note on the number of invariant
capital stocks . . . . . . . . . . . . . 242--244
Lala B. Krishna Error bounds for the SSOR semi-iterative
method . . . . . . . . . . . . . . . . . 245--250
John Frederick Fink Randomly near-traceable graphs . . . . . 251--258
Ching-Shui Cheng and
Joseph C. Masaro and
Chi Song Wong Optimal weighing designs . . . . . . . . 259--267
Fan R. K. Chung On the cutwidth and the topological
bandwidth of a tree . . . . . . . . . . 268--277
Hideo Sawami and
Hiroshi Niki Optimum overrelaxation parameter for the
SOR method for solving the eigenvalue
problem . . . . . . . . . . . . . . . . 278--282
Edward M. Bolger Monotonicity and other paradoxes in some
proportional representation schemes . . 283--291
Barbara R. Peskin and
David R. Richman A method to compute minimal polynomials 292--299
Neil Robertson and
P. D. Seymour Disjoint paths---a survey . . . . . . . 300--305
Robert Endre Tarjan Amortized computational complexity . . . 306--318
Paul Helman and
Arnon Rosenthal A comprehensive model of dynamic
programming . . . . . . . . . . . . . . 319--334
Mark Ciancutti On discrete search for a multiple number
of objects . . . . . . . . . . . . . . . 335--340
Sheau Wei Fu and
Mahmoud E. Sawan Solution of the discrete Lyapunov
equation . . . . . . . . . . . . . . . . 341--344
N. Alon and
M. Tarsi Covering multigraphs by simple circuits 345--350
Charles R. Johnson and
Leiba Rodman Convex sets of Hermitian matrices with
constant inertia . . . . . . . . . . . . 351--359
Steven Homer and
Jerry Goldman Doubly-periodic sequences and
two-dimensional recurrences . . . . . . 360--370
Nariyasu Minamide An extension of the matrix inversion
lemma . . . . . . . . . . . . . . . . . 371--377
Nariyasu Minamide Recursive best approximate solution
algorithms . . . . . . . . . . . . . . . 378--383
Craig A. Tovey Hill climbing with multiple local optima 384--393
A. Bagchi and
A. K. Pal Asymptotic normality in the generalized
Polya-Eggenberger urn model, with an
application to computer data structures 394--405
H. D. Victory, Jr. On nonnegative solutions of matrix
equations . . . . . . . . . . . . . . . 406--412
Shinsei Tazawa Decomposition of a complete multipartite
graph into isomorphic claws . . . . . . 413--417
F. S. Makedon and
C. H. Papadimitriou and
I. H. Sudborough Topological bandwidth . . . . . . . . . 418--444
F. R. K. Chung and
R. E. Tarjan and
W. J. Paul and
R. Reischuk Coding strings by pairs of strings . . . 445--461
Carolyn R. Johnson Convergence of a nonlinear sharpening
transformation for digital images . . . 462--465
Egon Balas Disjunctive programming and a hierarchy
of relaxations for discrete optimization
problems . . . . . . . . . . . . . . . . 466--486
Earl R. Barnes and
Alan J. Hoffman On transportation problems with upper
bounds on leading rectangles . . . . . . 487--496
P. L. Hammer and
N. V. R. Mahadev Bithreshold graphs . . . . . . . . . . . 497--506
Joshua H. Rabinowitz and
Viera Kr\vnanová Proulx An asymptotic approach to the channel
assignment problem . . . . . . . . . . . 507--518
G. S. Bloom and
D. F. Hsu On graceful directed graphs . . . . . . 519--536
Maurice Tchuente Permutation factorization on
star-connected networks of binary
automata . . . . . . . . . . . . . . . . 537--540
Frank Uhlig The field of values of a complex matrix,
an explicit description in the $2\times
2$ case . . . . . . . . . . . . . . . . 541--545
William F. Trench Explicit inversion formulas for Toeplitz
band matrices . . . . . . . . . . . . . 546--554
A. Hadjidimos On the optimization of the classical
iterative schemes for the solution of
complex singular linear systems . . . . 555--566
P. E. Proctor Implementation of a double-basis simplex
method for the general linear
programming problem . . . . . . . . . . 567--575
David G. Kirkpatrick and
Maria Klawe and
Nicholas Pippenger Some graph-colouring theorems with
applications to generalized connection
networks . . . . . . . . . . . . . . . . 576--582
H. J. Tiersma On subcodes of generalized second order
Reed--Muller codes . . . . . . . . . . . 583--591
Ray Redheffer Volterra multipliers. I . . . . . . . . 592--611
Ray Redheffer Volterra multipliers. II . . . . . . . . 612--623
Adhemar Bultheel The asymptotic behavior of Toeplitz
determinants generated by the Laurent
coefficients of a meromorphic function 624--629
Dianne P. O'Leary and
R. E. White Multisplittings of matrices and parallel
solution of linear systems . . . . . . . 630--640
Saul Stahl Homology as a tool in integer
programming . . . . . . . . . . . . . . 641--642
Karl Gustafson and
Robert Hartman Graph theory and fluid dynamics . . . . 643--656
Mei Gu Guan and
William Pulleyblank Eulerian orientations and circulations 657--664
Danny Dolev and
Manfred K. Warmuth Profile scheduling of opposing forests
and level orders . . . . . . . . . . . . 665--687
Yakov Ben-Haim Convex sets and nondestructive assay . . 688--706
Dorit S. Hochbaum and
David B. Shmoys An $O(\vert V\vert^2)$ algorithm for the
planar $3$-cut problem . . . . . . . . . 707--712
M. H. El-Zahar and
I. Rival Examples of jump-critical ordered sets 713--720
A. J. Hoffman and
A. W. J. Kolen and
M. Sakarovitch Totally-balanced and greedy matrices . . 721--730
Richard D. Hill and
E. Eugene Underwood On the matrix adjoint (adjugate) . . . . 731--737
David E. Daykin and
Jacqueline W. Daykin Order preserving maps and linear
extensions of a finite poset . . . . . . 738--748
E. Goles Ch. Dynamical behaviour of neural networks 749--754
Kenneth A. Berman Bicycles and spanning trees . . . . . . 1--12
Kenneth A. Berman and
Michael Hawrylycz Telephone problems with failures . . . . 13--17
Colin D. Walter Adjacency matrices . . . . . . . . . . . 18--29
R. E. Funderlic and
R. J. Plemmons Updating $LU$ factorizations for
computing stationary distributions . . . 30--42
Richard A. Games The geometry of $m$-sequences:
three-valued crosscorrelations and
quadrics in finite projective geometry 43--52
Zalman Rubinstein On the number of real quadratic factors
of polynomials . . . . . . . . . . . . . 53--59
I. P. Goulden and
D. M. Jackson Labelled graphs with small vertex
degrees and $P$-recursiveness . . . . . 60--66
Martin Farber An analogue of the Shannon capacity of a
graph . . . . . . . . . . . . . . . . . 67--72
P. C. Fishburn and
P. Frankl and
D. Freed and
J. C. Lagarias and
A. M. Odlyzko Probabilities for intersecting systems
and random subsets of finite sets . . . 73--79
Yoo Pyo Hong and
Roger A. Horn On the reduction of a matrix to
triangular or diagonal form by
consimilarity . . . . . . . . . . . . . 80--88
F. T. Boesch and
J. F. Wang Super line-connectivity properties of
circulant graphs . . . . . . . . . . . . 89--98
David R. Kincaid and
Thomas C. Oppe and
David M. Young Vector Computations for Sparse Linear
Systems . . . . . . . . . . . . . . . . 99--112
M. Mollard A generalized parity function and its
use in the construction of perfect codes 113--115
Sergei V. Kerov and
Anatol M. Vershik The characters of the infinite symmetric
group and probability properties of the
Robinson-Schensted-Knuth algorithm . . . 116--124
Herbert S. Wilf The number of maximal independent sets
in a tree . . . . . . . . . . . . . . . 125--130
Andrzej Proskurowski and
Maciej M. Sys\lo Efficient vertex-and edge-coloring of
outerplanar graphs . . . . . . . . . . . 131--136
R. E. White Parallel algorithms for nonlinear
problems . . . . . . . . . . . . . . . . 137--149
W. D. Wei and
Y. Z. Cai and
C. L. Liu and
A. M. Odlyzko Balloting labelling and personnel
assignment . . . . . . . . . . . . . . . 150--158
Nader Mehravari Generalized binary binomial group
testing . . . . . . . . . . . . . . . . 159--166
William F. Trench On the eigenvalue problem for a class of
band matrices including those with
Toeplitz inverses . . . . . . . . . . . 167--179
W. J. Harrod $LU$-decompositions of tridiagonal
irreducible $H$-matrices . . . . . . . . 180--187
William N. Anderson, Jr. and
George E. Trapp Inverse problems for means of matrices 188--192
J. J. Buoni Incomplete factorization of singular
$M$-matrices . . . . . . . . . . . . . . 193--198
P. Hell and
D. G. Kirkpatrick Packings by complete bipartite graphs 199--209
Guillermo Owen Values of graph-restricted games . . . . 210--220
Thomas F. Coleman and
Jin-Yi Cai The cyclic coloring problem and
estimation of sparse Hessian matrices 221--235
Kenneth D. Clark Difference methods for the numerical
solution of time-varying singular
systems of differential equations . . . 236--246
Dorit S. Hochbaum and
David B. Shmoys A packing problem you can almost solve
by sitting on your suitcase . . . . . . 247--257
F. K. Hwang Simplified reliabilities for
consecutive-$k$-out-of-$n$ systems . . . 258--264
Richard A. Brualdi and
Ernie S. Solheid On the spectral radius of complementary
acyclic matrices of zeros and ones . . . 265--272
Gene H. Golub and
Carl D. Meyer, Jr. Using the ${QR}$ Factorization and Group
Inversion to Compute, Differentiate, and
estimate the Sensitivity of Stationary
Probabilities for Markov Chains . . . . 273--281
Marshall W. Buck Expanders and diffusers . . . . . . . . 282--304
Stefan Arnborg and
Andrzej Proskurowski Characterization and recognition of
partial $3$-trees . . . . . . . . . . . 305--314
Masaki Togai An application of the singular value
decomposition to manipulability and
sensitivity of industrial robots . . . . 315--320
J. L. Delport and
D. H. Martin A multiplier method for identifying
keyblocks in excavations through jointed
rock . . . . . . . . . . . . . . . . . . 321--330
Nathan Linial Hard enumeration problems in geometry
and combinatorics . . . . . . . . . . . 331--335
Ray Redheffer Erratum: ``Volterra multipliers. II'' 336--336
Robert J. Plemmons A parallel block iterative scheme
applied to computations in structural
analysis . . . . . . . . . . . . . . . . 337--347
Martin W. Broin and
Timothy J. Lowe A dynamic programming algorithm for
covering problems with (greedy) totally
balanced constraint matrices . . . . . . 348--357
F. Alberto Grünbaum A property of the Legendre differential
equation and its discretization . . . . 358--361
G. Galambos Parametric lower bound for on-line
bin-packing . . . . . . . . . . . . . . 362--367
Alan A. Ahac and
D. D. Olesky A stable method for the $LU$
factorization of $M$-matrices . . . . . 368--378
R. Hassin and
A. Tamir Efficient algorithms for optimization
and selection on series-parallel graphs 379--389
G. P. Barker and
R. J. Plemmons Convergent iterations for computing
stationary distributions of Markov
chains . . . . . . . . . . . . . . . . . 390--398
A. Satyanarayana and
Zohel Khalil On an invariant of graphs and the
reliability polynomial . . . . . . . . . 399--403
J. A. Morrison Weighted averages of Radon transforms on
$Z^k_2$ . . . . . . . . . . . . . . . . 404--413
Jesse L. Barlow On the smallest positive singular value
of a singular $M$-matrix with
applications to ergodic Markov chains 414--424
Moody T. Chu Curves on $S^{n-1}$ that lead to
eigenvalues or their means of a matrix 425--432
Martin Farber and
Robert E. Jamison Convexity in graphs and hypergraphs . . 433--444
Wade D. Cook and
Moshe Kress Relationships between $l^1$ metrics on
rankings: the case of ties . . . . . . . 445--451
Ervin Györi A short proof of the rectilinear art
gallery theorem . . . . . . . . . . . . 452--454
O. L. Mangasarian and
T. H. Shiau A variable-complexity norm maximization
problem . . . . . . . . . . . . . . . . 455--461
Eivind Stensholt Keldysh chains and factorizations of
matrix polynomials . . . . . . . . . . . 462--469
Rodica Simion and
Herbert S. Wilf The distribution of prefix overlap in
consecutive dictionary entries . . . . . 470--475
J. Burkardt and
C. Hall and
T. Porsching The dual variable method for the
solution of compressible fluid flow
problems . . . . . . . . . . . . . . . . 476--483
Russell Merris The second immanantal polynomial and the
centroid of a graph . . . . . . . . . . 484--503
Burkhard Monien The bandwidth minimization problem for
caterpillars with hair length $3$ is
NP-complete . . . . . . . . . . . . . . 505--512
Murli M. Gupta A spectrum enveloping technique for
iterative solution of central difference
approximations of convection-diffusion
equations . . . . . . . . . . . . . . . 513--526
Thomas F. Coleman and
Alex Pothen The null space problem. I. Complexity 527--537
George J. Davis Column $LU$ factorization with pivoting
on a message-passing multiprocessor . . 538--550
Michael Neumann Neighborhoods of dominant convergence
for the SSOR method . . . . . . . . . . 551--559
János Körner Fredman-Komlós bounds and information
theory . . . . . . . . . . . . . . . . . 560--570
Graeme Mitchison and
Richard Durbin Optimal numberings of an $N\times N$
array . . . . . . . . . . . . . . . . . 571--582
Moshe Haviv and
Y. Ritov An approximation to the stationary
distribution of a nearly completely
decomposable Markov chain and its error
bound . . . . . . . . . . . . . . . . . 583--588
Moshe Haviv An approximation to the stationary
distribution of a nearly completely
decomposable Markov chain and its error
analysis . . . . . . . . . . . . . . . . 589--593
I. S. Duff and
C. W. Gear Computing the structural index . . . . . 594--603
Jerrold R. Griggs and
Philip J. Hanlon and
Michael S. Waterman Sequence alignments with matched
sections . . . . . . . . . . . . . . . . 604--608
W. N. Anderson, Jr. and
T. D. Morley and
G. E. Trapp Cascade addition and subtraction of
matrices . . . . . . . . . . . . . . . . 609--626
Charles R. Johnson and
Helene M. Shapiro Mathematical aspects of the relative
gain array $(A\circ A^{-{\sf T}})$ . . . 627--644
Neil White and
Walter Whiteley The algebraic geometry of motions of
bar-and-body frameworks . . . . . . . . 1--32
Fan R. K. Chung and
Frank Thomson Leighton and
Arnold L. Rosenberg Embedding graphs in books: a layout
problem with applications to VLSI design 33--58
Ralph Byers and
Stephen Nash On the singular ``vectors'' of the
Lyapunov operator . . . . . . . . . . . 59--66
John S. Maybee and
Gerry M. Wiener $L$-functions and their inverses . . . . 67--76
Jean-Paul Doignon Threshold representations of multiple
semiorders . . . . . . . . . . . . . . . 77--84
Christian Buchta On the number of vertices of random
polyhedra with a given number of facets 85--92
P. B. Gibbons and
E. Mendelsohn The existence of a subsquare free Latin
square of side $12$ . . . . . . . . . . 93--99
George Phillip Barker and
Michael Laidacker and
George Poole Projectionally exposed cones . . . . . . 100--105
Jürgen Garloff and
Volker Hattenbach The spectra of matrices having sums of
principal minors with alternating sign 106--107
Daniel Hershkowitz and
Volker Mehrmann and
Hans Schneider Matrices with sign symmetric diagonal
shifts or scalar shifts . . . . . . . . 108--122
Kazuo Murota and
Masao Iri and
Masataka Nakamura Combinatorial canonical form of layered
mixed matrices and its application to
block-triangularization of systems of
linear/nonlinear equations . . . . . . . 123--149
Paul Erd\Hos and
Edward T. Ordman and
Yechezkel Zalcstein Bounds on threshold dimension and
disjoint threshold coverings . . . . . . 151--154
Stephen Barnett Change of basis for products of
orthogonal polynomials . . . . . . . . . 155--162
Ellis L. Johnson and
Sebastiano Mosterts On four problems in graph theory . . . . 163--185
Dragomir \vZ. \Dbarokovi\'c Quadratic cones invariant under some
linear operators . . . . . . . . . . . . 186--191
Ronald Keith Perline Discrete time-band limiting operators
and commuting tridiagonal matrices . . . 192--195
Simeon M. Berman An extension of Plackett's differential
equation for the multivariate normal
density . . . . . . . . . . . . . . . . 196--197
Lenwood S. Heath Embedding outerplanar graphs in small
books . . . . . . . . . . . . . . . . . 198--218
Dipa Choudhury and
Roger A. Horn A complex orthogonal-symmetric analog of
the polar decomposition . . . . . . . . 219--225
Daniel P. Heyman Further comparisons of direct methods
for computing stationary distributions
of Markov chains . . . . . . . . . . . . 226--232
Wojciech Szpankowski Solution of a linear recurrence equation
arising in the analysis of some
algorithms . . . . . . . . . . . . . . . 233--250
Douglas R. Shier and
David E. Whited Algebraic methods applied to network
reliability problems . . . . . . . . . . 251--262
David Eberly and
Paul Hartung Group convolutions and matrix transforms 263--276
Stefan Arnborg and
Derek G. Corneil and
Andrzej Proskurowski Complexity of finding embeddings in a
$k$-tree . . . . . . . . . . . . . . . . 277--284
D. Coppersmith and
I. Gopal and
C. K. Wong Distribution of the minimum channel
width in VLSI wiring . . . . . . . . . . 285--290
John de Pillis Tensor equivalents for solution of
linear systems: a parallel algorithm . . 291--312
Wayne W. Barrett and
Charles R. Johnson and
D. D. Olesky and
P. van den Driessche Inherited matrix entries: principal
submatrices of the inverse . . . . . . . 313--322
André Bouchet Digraph decompositions and Eulerian
systems . . . . . . . . . . . . . . . . 323--337
Henry Beker and
Chris Mitchell Permutations with restricted
displacement . . . . . . . . . . . . . . 338--363
W. Byers and
A. Boyarsky Markov maps and the spectral radius of
$0$-$1$ matrices . . . . . . . . . . . . 364--374
Joseph W. H. Liu An application of generalized tree
pebbling to sparse matrix factorization 375--395
Bernard Philippe An algorithm to improve nearly
orthonormal sets of vectors on a vector
processor . . . . . . . . . . . . . . . 396--403
Charles J. Colbourn Network resilience . . . . . . . . . . . 404--409
Andrzej Ehrenfeucht and
Jeffrey Haemer and
David Haussler Quasimonotonic sequences: theory,
algorithms and applications . . . . . . 410--429
J. H. Dinitz and
D. R. Stinson A hill-climbing algorithm for the
construction of one-factorizations and
Room squares . . . . . . . . . . . . . . 430--438
Ramsey W. Haddad and
Shaibal Roy and
Alejandro A. Schäffer On gossiping with faulty telephone lines 439--445
John R. Gilbert and
Michael T. Heath Computing a sparse basis for the null
space . . . . . . . . . . . . . . . . . 446--459
Edward M. Bolger A class of efficient values for games in
partition function form . . . . . . . . 460--466
William C. Waterhouse The structure of monomial circulant
matrices . . . . . . . . . . . . . . . . 467--482
Robert L. Ellis and
Israel Gohberg and
David C. Lay Invertible selfadjoint extensions of
band matrices and their entropy . . . . 483--500
Devendra Chhetry and
Allan R. Sampson A projection decomposition for bivariate
discrete probability distributions . . . 501--509
D. Z. Du and
F. K. Hwang Optimal assignments for consecutive-$2$
graphs . . . . . . . . . . . . . . . . . 510--518
J. L. Lewandowski and
C. L. Liu SS/TDMA satellite communications with
$k$-permutation switching modes . . . . 519--534
D. G. Corneil and
J. M. Keil A dynamic programming approach to the
dominating set problem on $k$-trees . . 535--543
Thomas F. Coleman and
Alex Pothen The null space problem. II. Algorithms 544--563
Michael Aschbacher and
Pierre Baldi and
Eric B. Baum and
Richard M. Wilson Embeddings of ultrametric spaces in
finite-dimensional structures . . . . . 564--577
Jia Yu Shao The exponent set of primitive, nearly
reducible matrices . . . . . . . . . . . 578--584
J. Scott Provan Substitutes and complements in
constrained linear models . . . . . . . 585--603
Karen E. Kilby and
N. J. A. Sloane On the covering radius problem for
codes. I. Bounds on normalized covering
radius . . . . . . . . . . . . . . . . . 604--618
Karen E. Kilby and
N. J. A. Sloane On the covering radius problem for
codes. II. Codes of low dimension;
normal and abnormal codes . . . . . . . 619--627
P. C. Fishburn Latent subsets for dual intersecting
systems . . . . . . . . . . . . . . . . 628--634
Seth Chaiken Extremal length and width of blocking
polyhedra, Kirchhoff spaces and
multiport networks . . . . . . . . . . . 635--645
Andrzej Lingas A new heuristic for minimum weight
triangulation . . . . . . . . . . . . . 646--658
Margaret B. Cozzens and
Shu Shih Y. Wu On minimum critically $n$-edge-connected
graphs . . . . . . . . . . . . . . . . . 659--669
W. L. Green and
T. D. Morley Four variational formulations of the
contraharmonic mean of operators . . . . 670--673
William N. Anderson, Jr. and
Michael E. Mays and
Thomas D. Morley and
George E. Trapp The contraharmonic mean of HSD matrices 674--682
Erich Kaltofen and
M. S. Krishnamoorthy and
B. David Saunders Fast parallel computation of Hermite and
Smith forms of polynomial matrices . . . 683--690
Lorenzo O. Hilliard The case of equality in Hopf's
inequality . . . . . . . . . . . . . . . 691--709
H. Wendel The general minimum fill-in problem . . 710--745
Peter Matthews Mixing rates for a random walk on the
cube . . . . . . . . . . . . . . . . . . 746--752
Richard A. Games An algebraic construction of sonar
sequences using $M$-sequences . . . . . 753--761
Ding Zhu Du and
Ker-I Ko Some completeness results on decision
trees and group testing . . . . . . . . 762--777
Yair Be'ery and
Jakov Snyders A recursive Hadamard transform optimal
soft decision decoding algorithm . . . . 778--789
P. J. Eberlein On one-sided Jacobi methods for parallel
computation . . . . . . . . . . . . . . 790--796
Bernard F. Lamond An efficient factorization for the group
inverse . . . . . . . . . . . . . . . . 797--808
Sheng Chen and
Yunbo Tian Note on ``On the Singular `Vectors' of
the Lyapunov Operator'' by R. Byers and
S. Nash . . . . . . . . . . . . . . . . 1069--1072