Jeffrey C. Lagarias: Papers on Discrete Mathematics and Combinatorial Optimization

• Minimum Range Sequences of all k-subsets of a Set ,
  F. K. Hwang and J. C. Lagarias,
  Discrete Mathematics 19 (1977), pp. 257-264.

• Optimal pairs of score vectors for positional scoring rules ,
  W. Gehrlein, B. Gopinath, J. C. Lagarias and P. Fishburn ,
  Appl. Math. Optim. 88 (1982), pp. 309-324.

• Minimal Storage Representations for Binary Relations ,
  J. C. Lagarias and D. E. Swartwout,
  Information Processing Letters 14 (1982) 63-66.
  [Preliminary version in: Proc. ACM-SIGMOD 1981 International Conf. on
  the Management of Data , (Y. E. Lien, ed.), ACM 1991, pp. 1-9.]

• On the tightest packing of sums of vectors ,
  J. R. Griggs, J. C. Lagarias, A. M. Odlyzko, and J. B. Shearer,
  European J. Combinatorics 4 (1983), pp. 231-236.

• Approximation Algorithms for Maximizing the Number of Squares Packed in a Rectangle ,
  B. Baker, A. R. Calderbank, E. G. Coffman and J. C. Lagarias,
  SIAM J. Alg. Disc. Methods 4 (1983), pp. 383-397.

• On the capacity of disjointly shared networks,
  J. C. Lagarias, A. M. Odlyzko, and D. B. Zagier,
  Computer Networks and ISDN Systems, 10 (1985), pp. 275-285.

• Probabilities for intersecting systems and random subsets of finite sets,
  P. C. Fishburn, P. Frankl, D. Freed, J. C. Lagarias, and A. M. Odlyzko,
  SIAM J. Alg. Discr. Methods, 7 (1986), pp. 73-79.

• Algorithms for square packing: A probabilistic analysis ,
  E. G. Coffman, Jr. and J. C. Lagarias,
  SIAM J. Computing (1989), pp. 166-185.

• Sets Uniquely Determined by Projection I. Continuous Case,
  P. C. Fishburn, J. C. Lagarias, J. A. Reeds and L. A. Shepp,
  SIAM J. Applied Math. 50 (1990), pp. 288-306.

• Sets Uniquely Determined by Projections II. Discrete Case ,
  P. C. Fishburn, J. C. Lagarias, J. A. Reeds and L. A. Shepp,
  Discrete Math. 91 (1991), pp. 141-151.

• Self-packing of Centrally Symmetric Convex Bodies in R^2 ,
  P. G. Doyle, J. C. Lagarias and D. S. Randall,
  Discrete & Computational Geometry 8 (1992), PP. 171-189.

• Interference-Minimizing Colorings of Distance-Regular Graphs ,
  P. C. Fishburn, J. H. Kim, J. C. Lagarias and P. E. Wright,
  SIAM J. Discrete Math. , 11 (1998), pp. 15-40. [PostScript]

• Processor Shadowing: Maximizing Expected Throughput in Fault-Tolerant Systems ,
  J. L. Bruno, E. G. Coffman, Jr., J. C. Lagarias, T. J. Richardson and P. W. Shor,
  Mathematics of Operations Research , 24 (1999), 362--382.

• Well-spaced labellings of points in rectangular grids ,
  J. C. Lagarias,
  SIAM J. Discrete Math. , 13 (2000), 521-534. [PostScript]

• Pinwheel scheduling: achievable densities ,
  P. C. Fishburn and J. C. Lagarias,
  Algorithmica , 34 (2002), No. 1, 14--38. [PostScript]