SIAM Journal on Discrete Mathematics, Volume 16

Volume 16, Number 1, 2002

• Eric Rémila:
  On the Structure of Some Spaces of Tilings. 1-19
  Electronic Edition (link) BibTeX
• Michal Parnas, Dana Ron, Alex Samorodnitsky:
  Testing Basic Boolean Formulae. 20-46
  Electronic Edition (link) BibTeX
• Nicholas Pippenger:
  Enumeration of Matchings in the Incidence Graphs of Complete and Complete Bipartite Graphs. 47-64
  Electronic Edition (link) BibTeX
• Edgar M. Palmer, Ronald C. Read, Robert W. Robinson:
  Counting Claw-Free Cubic Graphs. 65-73
  Electronic Edition (link) BibTeX
• Karen L. Collins, Benjamin Shemmer:
  Constructions of 3-Colorable Cores. 74-80
  Electronic Edition (link) BibTeX
• Oliver Schirokauer:
  The Special Function Field Sieve. 81-98
  Electronic Edition (link) BibTeX
• Oleg Pikhurko:
  Asymptotic Size Ramsey Results for Bipartite Graphs. 99-113
  Electronic Edition (link) BibTeX
• Vasken Bohossian, Jehoshua Bruck:
  Algebraic Techniques for Constructing Minimal Weight Threshold Functions. 114-126
  Electronic Edition (link) BibTeX
• Lázaro Cánovas, Mercedes Landete, Alfredo Marín:
  Facet Obtaining Procedures for Set Packing Problems. 127-155
  Electronic Edition (link) BibTeX
• Klaus Dohmen:
  Improved Inclusion-Exclusion Identities and Bonferroni Inequalities with Reliability Applications. 156-171
  Electronic Edition (link) BibTeX

Volume 16, Number 2, 2003

• Yukiyasu Mutoh, Toshio Morihara, Masakazu Jimbo, Hung-Lin Fu:
  The Existence of 2x4 Grid-Block Designs and Their Applications. 173-178
  Electronic Edition (link) BibTeX
• Graeme Kemkes, Chiu Fan Lee, Donatella Merlini, L. Bruce Richmond:
  Stirling Numbers for Complex Arguments: Asymptotics and Identities. 179-191
  Electronic Edition (link) BibTeX
• Dorit S. Hochbaum, Maurice Queyranne:
  Minimizing a Convex Cost Closure Set. 192-207
  Electronic Edition (link) BibTeX
• Jean-Michel Autebert, Sylviane R. Schwer:
  On Generalized Delannoy Paths. 208-223
  Electronic Edition (link) BibTeX
• Carlo Blundo, Paolo D'Arco, Alfredo De Santis, Douglas R. Stinson:
  Contrast Optimal Threshold Visual Cryptography Schemes. 224-261
  Electronic Edition (link) BibTeX
• Luke Pebody, A. J. Radcliffe, Alex D. Scott:
  Finite Subsets of the Plane are 18-Reconstructible. 262-275
  Electronic Edition (link) BibTeX
• Richard P. Brent, Shuhong Gao, Alan G. B. Lauder:
  Random Krylov Spaces over Finite Fields. 276-287
  Electronic Edition (link) BibTeX
• Klaus Jansen, Roberto Solis-Oba, Maxim Sviridenko:
  Makespan Minimization in Job Shops: A Linear Time Approximation Scheme. 288-300
  Electronic Edition (link) BibTeX
• Konrad Engel, Sven Guttmann:
  Testing Bandwidth k for k-Connected Graphs. 301-312
  Electronic Edition (link) BibTeX
• Maxim Sviridenko:
  Makespan Minimization in No-Wait Flow Shops: A Polynomial Time Approximation Scheme. 313-322
  Electronic Edition (link) BibTeX
• Hans-Jürgen Bandelt, Victor Chepoi:
  1-Hyperbolic Graphs. 323-334
  Electronic Edition (link) BibTeX
• Jørgen Bang-Jensen, Jing Huang, Anders Yeo:
  Strongly Connected Spanning Subdigraphs with the Minimum Number of Arcs in Quasi-transitive Digraphs. 335-343
  Electronic Edition (link) BibTeX

Volume 16, Number 3, 2003

• Brian Lucena:
  A New Lower Bound for Tree-Width Using Maximum Cardinality Search. 345-353
  Electronic Edition (link) BibTeX
• Jung Hee Cheon, Seongtaek Chee:
  Nonlinearity of Boolean Functions and Hyperelliptic Curves. 354-365
  Electronic Edition (link) BibTeX
• L. Sunil Chandran:
  A High Girth Graph Construction. 366-370
  Electronic Edition (link) BibTeX
• Svante Linusson, John Shareshian:
  Complexes of t-Colorable Graphs. 371-389
  Electronic Edition (link) BibTeX
• Ari Trachtenberg, Alexander Vardy:
  Full-Rank Tilings of $\mathbbF^8_\!2$ Do Not Exist. 390-392
  Electronic Edition (link) BibTeX
• Noga Alon, Seannie Dar, Michal Parnas, Dana Ron:
  Testing of Clustering. 393-417
  Electronic Edition (link) BibTeX
• Francesc Comellas, Margarida Mitjana:
  The Spectra of Cycle Prefix Digraphs. 418-421
  Electronic Edition (link) BibTeX
• Ravi Kumar, D. Sivakumar:
  On Polynomial-Factor Approximations to the Shortest Lattice Vector Length. 422-425
  Electronic Edition (link) BibTeX
• Daniel Král, Riste Skrekovski:
  A Theorem about the Channel Assignment Problem. 426-437
  Electronic Edition (link) BibTeX
• Yury Metelsky, Regina Tyshkevich:
  Line Graphs of Helly Hypergraphs. 438-448
  Electronic Edition (link) BibTeX
• Tomás Feder, Pavol Hell, Sulamita Klein, Rajeev Motwani:
  List Partitions. 449-478
  Electronic Edition (link) BibTeX
• Xiangwei Liu, Gilbert Strang, Susan Ott:
  Localized Eigenvectors from Widely Spaced Matrix Modifications. 479-498
  Electronic Edition (link) BibTeX
• Simon R. Blackburn:
  Frameproof Codes. 499-510
  Electronic Edition (link) BibTeX
• Dion Gijswijt, Alexander Schrijver:
  On the b-Stable Set Polytope of Graphs without Bad K₄. 511-516
  Electronic Edition (link) BibTeX

Volume 16, Number 4, 2003

• C. W. Ko, F. Bruce Shepherd:
  Bipartite Domination and Simultaneous Matroid Covers. 517-523
  Electronic Edition (link) BibTeX
• Raphael Yuster:
  Equitable Coloring of k-Uniform Hypergraphs. 524-532
  Electronic Edition (link) BibTeX
• Eyal Kushilevitz, Rafail Ostrovsky, Adi Rosén:
  Amortizing Randomness in Private Multiparty Computations. 533-544
  Electronic Edition (link) BibTeX
• Fabio Scarabotti:
  Fourier Analysis of a Class of Finite Radon Transforms. 545-554
  Electronic Edition (link) BibTeX
• Brady Hunsaker, Anton J. Kleywegt, Martin W. P. Savelsbergh, Craig A. Tovey:
  Optimal Online Algorithms for Minimax Resource Scheduling. 555-590
  Electronic Edition (link) BibTeX
• Jon-Lark Kim, Keith E. Mellinger, Vera Pless:
  Projections of Binary Linear Codes onto Larger Fields. 591-603
  Electronic Edition (link) BibTeX
• Ioana Dumitriu, Prasad Tetali, Peter Winkler:
  On Playing Golf with Two Balls. 604-615
  Electronic Edition (link) BibTeX
• Sean Curran, Xingxing Yu:
  Nonseparating Cycles in 4-Connected Graphs. 616-629
  Electronic Edition (link) BibTeX
• Michael R. Capalbo:
  An Explicit Construction of Lower-Diameter Cubic Graphs. 635-650
  Electronic Edition (link) BibTeX
• Geir Agnarsson, Magnús M. Halldórsson:
  Coloring Powers of Planar Graphs. 651-662
  Electronic Edition (link) BibTeX
• Ian H. Dinwoodie, Edward Mosteig:
  Statistical Inference for Internal Network Reliability with Spatial Dependence. 663-674
  Electronic Edition (link) BibTeX