Table of contents for issues of SIAM Journal on Discrete Mathematics

Last update: Thu Oct 19 06:27:42 MDT 2023                Valid HTML 3.2!

Volume 1, Number 1, February, 1988
Volume 1, Number 2, May, 1988
Volume 1, Number 3, August, 1988
Volume 1, Number 4, November, 1988
Volume 2, Number 1, February, 1989
Volume 2, Number 2, May, 1989
Volume 2, Number 3, August, 1989
Volume 2, Number 4, November, 1989
Volume 3, Number 1, February, 1990
Volume 3, Number 2, May, 1990
Volume 3, Number 3, August, 1990
Volume 3, Number 4, November, 1990
Volume 4, Number 1, February, 1991
Volume 4, Number 2, May, 1991
Volume 4, Number 3, August, 1991
Volume 4, Number 4, November, 1991
Volume 5, Number 1, February, 1992
Volume 5, Number 2, May, 1992
Volume 5, Number 3, August, 1992
Volume 5, Number 4, November, 1992
Volume 6, Number 1, February, 1993
Volume 6, Number 2, May, 1993
Volume 6, Number 3, August, 1993
Volume 6, Number 4, November, 1993
Volume 7, Number 1, February, 1994
Volume 7, Number 2, May, 1994
Volume 7, Number 3, August, 1994
Volume 7, Number 4, November, 1994
Volume 8, Number 1, February, 1995
Volume 8, Number 2, May, 1995
Volume 8, Number 3, August, 1995
Volume 8, Number 4, November, 1995
Volume 9, Number 1, February, 1996
Volume 9, Number 2, May, 1996
Volume 9, Number 3, August, 1996
Volume 9, Number 4, November, 1996
Volume 10, Number 1, February, 1997
Volume 10, Number 2, May, 1997
Volume 10, Number 3, August, 1997
Volume 10, Number 4, November, 1997
Volume 11, Number 1, February, 1998
Volume 11, Number 2, May, 1998
Volume 11, Number 3, August, 1998
Volume 11, Number 4, November, 1998
Volume 12, Number 1, February, 1999
Volume 12, Number 2, May, 1999
Volume 12, Number 3, August, 1999
Volume 12, Number 4, November, 1999
Volume 13, Number 1, 2000
Volume 13, Number 2, 2000
Volume 13, Number 3, 2000
Volume 13, Number 4, 2000
Volume 14, Number 1, 2000
Volume 14, Number 2, 2001
Volume 14, Number 3, 2001
Volume 14, Number 4, 2001
Volume 15, Number 1, 2001
Volume 15, Number 2, 2002
Volume 15, Number 3, 2002
Volume 15, Number 4, 2002
Volume 16, Number 1, 2002
Volume 16, Number 2, 2003
Volume 16, Number 3, 2003
Volume 16, Number 4, 2003
Volume 17, Number 1, 2003
Volume 17, Number 2, 2003
Volume 17, Number 3, 2004
Volume 17, Number 4, 2004
Volume 18, Number 1, 2004
Volume 18, Number 2, 2004
Volume 18, Number 3, 2004
Volume 18, Number 4, 2005
Volume 19, Number 1, 2005
Volume 19, Number 2, 2005
Volume 19, Number 3, 2005
Volume 19, Number 4, 2005
Volume 20, Number 1, January, 2006
Volume 20, Number 2, January, 2006
Volume 20, Number 3, January, 2006
Volume 20, Number 4, January, 2006
Volume 21, Number 1, 2007
Volume 21, Number 2, 2007
Volume 21, Number 3, 2007
Volume 21, Number 4, 2008
Volume 22, Number 1, 2008
Volume 22, Number 2, 2008
Volume 22, Number 3, 2008
Volume 22, Number 4, 2008
Volume 23, Number 1, 2009
Volume 23, Number 2, 2009
Volume 23, Number 3, 2009
Volume 23, Number 4, 2010
Volume 24, Number 1, 2010
Volume 24, Number 2, 2010
Volume 24, Number 3, 2010
Volume 24, Number 4, 2010
Volume 25, Number 1, 2011
Volume 25, Number 2, 2011
Volume 25, Number 3, 2011
Volume 25, Number 4, 2011
Volume 26, Number 1, 2012
Volume 26, Number 2, 2012
Volume 26, Number 3, 2012
Volume 26, Number 4, 2012
Volume 27, Number 1, 2013
Volume 27, Number 2, 2013
Volume 27, Number 3, 2013
Volume 27, Number 4, 2013
Volume 28, Number 1, 2014
Volume 28, Number 2, 2014
Volume 28, Number 3, 2014
Volume 28, Number 4, 2014
Volume 29, Number 1, 2015
Volume 29, Number 2, 2015
Volume 29, Number 3, 2015
Volume 29, Number 4, 2015
Volume 30, Number 1, 2016
Volume 30, Number 2, 2016
Volume 30, Number 3, 2016
Volume 30, Number 4, 2016
Volume 31, Number 1, 2017
Volume 31, Number 2, 2017
Volume 31, Number 3, 2017
Volume 31, Number 4, 2017
Volume 32, Number 1, 2018
Volume 32, Number 2, 2018
Volume 32, Number 3, 2018
Volume 32, Number 4, 2018
Volume 33, Number 1, 2019
Volume 33, Number 2, 2019
Volume 33, Number 3, 2019
Volume 33, Number 4, 2019
Volume 34, Number 1, 2020
Volume 34, Number 2, 2020
Volume 34, Number 3, 2020
Volume 34, Number 4, 2020
Volume 35, Number 1, 2021
Volume 35, Number 2, 2021
Volume 35, Number 3, 2021
Volume 35, Number 4, 2021
Volume 36, Number 1, 2022
Volume 36, Number 2, 2022
Volume 36, Number 3, 2022
Volume 36, Number 4, 2022
Volume 37, Number 1, 2023
Volume 37, Number 2, 2023
Volume 37, Number 3, 2023
Volume 37, Number 4, 2023
Volume 39, Number 4, December, 1997


SIAM Journal on Discrete Mathematics
Volume 1, Number 1, February, 1988

                   Pierre Baldi   Neural networks, acyclic orientations of
                                  the hypercube, and sets of orthogonal
                                  vectors  . . . . . . . . . . . . . . . . 1--13
               Daniel Bienstock   Asymptotic analysis of some network
                                  reliability models . . . . . . . . . . . 14--21
               David A. Carlson   Upper and lower bounds on time-space
                                  tradeoffs for computations with embedded
                                  fast Fourier transforms  . . . . . . . . 22--37
                X. M. Chang and   
                F. K. Hwang and   
                     J. F. Weng   Optimal detection of two defectives with
                                  a parity check device  . . . . . . . . . 38--44
             F. R. K. Chung and   
             Z. Füredi and   
                M. R. Garey and   
                   R. L. Graham   On the fractional covering number of
                                  hypergraphs  . . . . . . . . . . . . . . 45--49
               M. Haimovich and   
                 T. L. Magnanti   Extremum properties of hexagonal
                                  partitioning and the uniform
                                  distribution in Euclidean location . . . 50--64
                       Ker-I Ko   Searching for two objects by underweight
                                  feedback . . . . . . . . . . . . . . . . 65--70
             J. Körner and   
                      K. Marton   Graphs that split entropies  . . . . . . 71--79
                 M. S. Paterson   Universal chains and wiring layouts  . . 80--85
      Gregory J. E. Rawlins and   
             Peter Widmayer and   
                    Derick Wood   Hole problems for rectangles in the
                                  plane  . . . . . . . . . . . . . . . . . 86--97
        D. K. Ray-Chaudhuri and   
                   N. M. Singhi   On existence of $t$-designs with large
                                  $v$ and $\lambda$  . . . . . . . . . . . 98--104
                 Bruce E. Sagan   A note on independent sets in trees  . . 105--108
             Ákos Seress   Quick gossiping by conference calls  . . 109--120
                Bernd Sturmfels   Some applications of affine Gale
                                  diagrams to polytopes with few vertices  121--133
                   R. T. Worley   The Vorono\uì region of $E^*_7$ . . . . . 134--141
                    Martin Dowd   Questions related to the Erd\Hos--Turán
                                  conjecture . . . . . . . . . . . . . . . 142--150

SIAM Journal on Discrete Mathematics
Volume 1, Number 2, May, 1988

             Jason I. Brown and   
            Charles J. Colbourn   A set system polynomial with colouring
                                  and reliability applications . . . . . . 151--157
               Paul Feldman and   
              Joel Friedman and   
             Nicholas Pippenger   Wide-sense nonblocking networks  . . . . 158--173
               P. L. Hammer and   
                 B. Simeone and   
            Th. M. Liebling and   
                    D. de Werra   From linear separability to unimodality:
                                  a hierarchy of pseudo-Boolean functions  174--184
             Joan P. Hutchinson   On short noncontractible cycles in
                                  embedded graphs  . . . . . . . . . . . . 185--192
             Abraham Lempel and   
          Marcelo J. Weinberger   Self-complementary normal bases in
                                  finite fields  . . . . . . . . . . . . . 193--198
            Fred S. Roberts and   
                     Yonghua Xu   On the optimal strongly connected
                                  orientations of city street graphs. I.
                                  Large grids  . . . . . . . . . . . . . . 199--222
 J. M. S. Simões-Pereira   An optimality criterion for graph
                                  embeddings of metrics  . . . . . . . . . 223--229
              D. R. Stinson and   
                 S. A. Vanstone   A combinatorial approach to threshold
                                  schemes  . . . . . . . . . . . . . . . . 230--236
                Walter Whiteley   The union of matroids and the rigidity
                                  of frameworks  . . . . . . . . . . . . . 237--255
                  Y.-C. Yao and   
                    F. K. Hwang   A fundamental monotonicity in group
                                  testing  . . . . . . . . . . . . . . . . 256--259
                      Bing Zhou   Almost every randomly near-traceable
                                  graph has diameter at most two . . . . . 260--268

SIAM Journal on Discrete Mathematics
Volume 1, Number 3, August, 1988

                  Noga Alon and   
                     Yossi Azar   Sorting, approximate sorting, and
                                  searching in rounds  . . . . . . . . . . 269--280
  Jòrgen Bang-Jensen and   
                 Pavol Hell and   
              Gary MacGillivray   The complexity of colouring by
                                  semicomplete digraphs  . . . . . . . . . 281--298
             Earl R. Barnes and   
           Anthony Vannelli and   
                James Q. Walker   A new heuristic for partitioning the
                                  nodes of a graph . . . . . . . . . . . . 299--305
              P. Bertolazzi and   
                     A. Sassano   A class of polynomially solvable
                                  set-covering problems  . . . . . . . . . 306--316
           Alan A. Bertossi and   
                Alessandro Gori   Total domination and irredundance in
                                  weighted interval graphs . . . . . . . . 317--327
         B. Bollobás and   
                 F. R. K. Chung   The diameter of a cycle plus a random
                                  matching . . . . . . . . . . . . . . . . 328--333
          Peter C. Fishburn and   
    Helen M. Marcus-Roberts and   
                Fred S. Roberts   Unique finite difference measurement . . 334--354
   János Körner and   
           Gábor Simonyi   Separating partition systems and locally
                                  different sequences  . . . . . . . . . . 355--359
          Carl E. Langenhop and   
              William E. Wright   Certain occupancy numbers via an
                                  algorithm for computing their ratios . . 360--371
           Svatopluk Poljak and   
        Vojt\vech Rödl and   
                   Joel Spencer   Tournament ranking with expected profit
                                  in polynomial time . . . . . . . . . . . 372--376
                     Arie Tamir   Improved complexity bounds for center
                                  location problems on networks by using
                                  dynamic data structures  . . . . . . . . 377--396
            Gábor Tardos   Polynomial bound for a chip firing game
                                  on graphs  . . . . . . . . . . . . . . . 397--398
            Prabhakar Ragde and   
            William Steiger and   
     Endre Szemerédi and   
                  Avi Wigderson   The parallel complexity of element
                                  distinctness is $\Omega\sqrt{{\rm
                                  log}\,n}$  . . . . . . . . . . . . . . . 399--410

SIAM Journal on Discrete Mathematics
Volume 1, Number 4, November, 1988

                 Benny Chor and   
Mihály Geréb-Graus   On the influence of single participant
                                  in coin flipping schemes . . . . . . . . 411--415
                Ding Zhu Du and   
                    Zevi Miller   Matroids and subset interconnection
                                  design . . . . . . . . . . . . . . . . . 416--424
            Dominique Foata and   
               Doron Zeilberger   Laguerre polynomials, weighted
                                  derangements, and positivity . . . . . . 425--433
         Andrew V. Goldberg and   
           Serge A. Plotkin and   
             Gregory E. Shannon   Parallel symmetry-breaking in sparse
                                  graphs . . . . . . . . . . . . . . . . . 434--446
           Ramsey W. Haddad and   
     Alejandro A. Schäffer   Recognizing Bellman--Ford-orderable
                                  graphs . . . . . . . . . . . . . . . . . 447--471
                 Pavol Hell and   
          David Kirkpatrick and   
      Jan Kratochvíl and   
           Igor K\vrí\vz   On restricted two-factors  . . . . . . . 472--484
                G. A. Heuer and   
                  W. Dow Rieder   Silverman games on disjoint discrete
                                  sets . . . . . . . . . . . . . . . . . . 485--525
                H. A. Kierstead   The linearity of first-fit coloring of
                                  interval graphs  . . . . . . . . . . . . 526--530
         Arthur L. Liestman and   
               Joseph G. Peters   Broadcast networks of bounded degree . . 531--540
                    M. A. Steel   Distribution of the symmetric difference
                                  metric on phylogenetic trees . . . . . . 541--551
                  Peter Winkler   The complexity of metric realization . . 552--559


SIAM Journal on Discrete Mathematics
Volume 2, Number 1, February, 1989

             J.-P. Allouche and   
                  P. Hajnal and   
                  J. O. Shallit   Analysis of an infinite product
                                  algorithm  . . . . . . . . . . . . . . . 1--15
          Paolo M. Camerini and   
              Horst W. Hamacher   Intersection of two matroids:
                                  (condensed) border graphs and ranking    16--27
                 Ying Cheng and   
                N. J. A. Sloane   Codes from symmetry groups, and a
                                  $[32,17,8]$ code . . . . . . . . . . . . 28--37
             Hyeong-Ah Choi and   
             Kazuo Nakajima and   
                   Chong S. Rim   Graph bipartization and via minimization 38--47
                 D. de Caen and   
                  D. G. Hoffman   Impossibility of decomposing the
                                  complete graph on $n$ points into $n-1$
                                  isomorphic complete bipartite graphs . . 48--50
                P. Delsarte and   
                        Y. Kamp   Low rank matrices with a given sign
                                  pattern  . . . . . . . . . . . . . . . . 51--63
               S. L. Hakimi and   
               E. F. Schmeichel   A note on the vertex arboricity of a
                                  graph  . . . . . . . . . . . . . . . . . 64--67
           C. A. J. Hurkens and   
                   A. Schrijver   On the size of systems of sets every $t$
                                  of which have an SDR, with an
                                  application to the worst-case ratio of
                                  heuristics for packing problems  . . . . 68--72
               Gerhard Jaeschke   On solving rational congruences  . . . . 73--90
              Howard J. Karloff   How long can a Euclidean traveling
                                  salesman tour be . . . . . . . . . . . . 91--99
           Joseph W. H. Liu and   
              Andranik Mirzaian   A linear reordering algorithm for
                                  parallel pivoting of chordal graphs  . . 100--107
                 Noam Nisan and   
                  Danny Soroker   Parallel algorithms for zero-one
                                  supply-demand problems . . . . . . . . . 108--125
             Kazuo Sugihara and   
                  Ichiro Suzuki   Optimal algorithms for a pursuit-evasion
                                  problem in grids . . . . . . . . . . . . 126--143

SIAM Journal on Discrete Mathematics
Volume 2, Number 2, May, 1989

           Sandeep N. Bhatt and   
             F. R. K. Chung and   
             F. T. Leighton and   
            Arnold L. Rosenberg   Universal graphs for bounded-degree
                                  trees and planar graphs  . . . . . . . . 145--155
           Jonathan F. Buss and   
        Arnold L. Rosenberg and   
                Judson D. Knott   Vertex types in book-embeddings  . . . . 156--175
               Jianzhong Du and   
             Joseph Y.-T. Leung   Scheduling tree-structured tasks on two
                                  processors to minimize schedule length   176--196
            Joan Feigenbaum and   
               Ramsey W. Haddad   On factorable extensions and subgraphs
                                  of prime graphs  . . . . . . . . . . . . 197--218
                Dale R. Fox and   
         S. Kingsley Gnanendran   Recursive solutions for the generalized
                                  Erlang queueing systems  . . . . . . . . 219--230
          Gregory F. Lawler and   
                 John Sylvester   Determining resistances from boundary
                                  measurements in finite networks  . . . . 231--239
                   Michael Saks   A robust noncryptographic protocol for
                                  collective coin flipping . . . . . . . . 240--244
             Nicola Santoro and   
          Jeffrey B. Sidney and   
           Stuart J. Sidney and   
                  Jorge Urrutia   Geometric containment and partial orders 245--254
                    Philip Todd   A $k$-tree generalization that
                                  characterizes consistency of dimensioned
                                  engineering drawings . . . . . . . . . . 255--261
               James Allen Fill   The Radon transform on $Z_n$ . . . . . . 262--283

SIAM Journal on Discrete Mathematics
Volume 2, Number 3, August, 1989

                   M. Ajtai and   
                 D. Karabeg and   
           J. Komlós and   
            E. Szemerédi   Sorting in average time $o(\log n)$  . . 285--292
            Stephen F. Altschul   Leaf pairs and tree dissections  . . . . 293--299
         Gregory M. Constantine   On the invertibility of the discrete
                                  Radon transform  . . . . . . . . . . . . 300--306
                D. S. Franzblau   Performance guarantees on a sweep-line
                                  heuristic for covering rectilinear
                                  polygons with rectangles . . . . . . . . 307--321
              Mark Goldberg and   
                 Thomas Spencer   Constructing a maximal independent set
                                  in parallel  . . . . . . . . . . . . . . 322--328
                    J. Kahn and   
             J. C. Lagarias and   
             H. S. Witsenhausen   Single-suit two-person card play. III.
                                  The Mis\`ere game  . . . . . . . . . . . 329--343
                 D. J. Kleitman   Divisors without unit-congruent ratios   344--349
                     D. A. Lind   Perturbations of shifts of finite type   350--365
                  C. L. Mallows   Identities satisfied by iterated
                                  polynomials and $(Q,x)$-binomial
                                  coefficients . . . . . . . . . . . . . . 366--370
             Rajeev Motwani and   
         Arvind Raghunathan and   
                    Huzur Saran   Perfect graphs and orthogonally convex
                                  covers . . . . . . . . . . . . . . . . . 371--392
             Nicholas Pippenger   Random sequential adsorption on graphs   393--401
        Vojt\vech Rödl and   
                  Peter Winkler   A Ramsey-type theorem for orderings of a
                                  graph  . . . . . . . . . . . . . . . . . 402--406
               S. K. Tipnis and   
             L. E. Trotter, Jr.   Node-packing problems with integer
                                  rounding properties  . . . . . . . . . . 407--412
             Stephen A. Vavasis   Gaussian elimination with pivoting is
                                  ${\rm P}$-complete . . . . . . . . . . . 413--423

SIAM Journal on Discrete Mathematics
Volume 2, Number 4, November, 1989

                     Egon Balas   The asymmetric assignment problem and
                                  some new facets of the traveling
                                  salesman polytope on a directed graph    425--451
        Jean-Claude Bermond and   
                Claudine Peyrat   Induced subgraphs of the power of a
                                  cycle  . . . . . . . . . . . . . . . . . 452--455
               G. Chartrand and   
                   H. Hevia and   
              O. Oellermann and   
                    F. Saba and   
                     A. Schwenk   A matter of degree . . . . . . . . . . . 456--466
                Fan R. K. Chung   Pebbling in hypercubes . . . . . . . . . 467--472
               Jianzhong Du and   
             Joseph Y.-T. Leung   Complexity of scheduling parallel task
                                  systems  . . . . . . . . . . . . . . . . 473--487
                  Geoffrey Exoo   On two classical Ramsey numbers of the
                                  form $R(3,n)$  . . . . . . . . . . . . . 488--490
                  Z. Furedi and   
               J. R. Griggs and   
                 D. J. Kleitman   Pair labellings with given distance  . . 491--499
                F. K. Hwang and   
                      Y.-C. Yao   Cutoff point and monotonicity properties
                                  for multinomial group testing  . . . . . 500--507
               Rajeev Kohli and   
            Ramesh Krishnamurti   Average performance of heuristics for
                                  satisfiability . . . . . . . . . . . . . 508--523
                 H. Lefmann and   
                       B. Voigt   Partitions of $A^\omega$ . . . . . . . . 524--529
                   Boris Pittel   The average number of stable matchings   530--549
             Paolo Serafini and   
                 Walter Ukovich   A mathematical model for periodic
                                  scheduling problems  . . . . . . . . . . 550--581
             Brigitte Servatius   Birigidity in the plane  . . . . . . . . 582--589
                 Jeremy Spinrad   Prime testing for the split
                                  decomposition of a graph . . . . . . . . 590--599


SIAM Journal on Discrete Mathematics
Volume 3, Number 1, February, 1990

       Hans-Jürgen Bandelt   Recognition of Tree Metrics  . . . . . . 1--6
              Amotz Bar-Noy and   
                    Joseph Naor   Sorting, Minimal Feedback Sets, and
                                  Hamilton Paths in Tournaments  . . . . . 7--20
Béla Bollobás and   
              Graham Brightwell   Parallel Selection with High Probability 21--31
Béla Bollobás and   
                    Imre Leader   An Isoperimetric Inequality on the
                                  Discrete Torus . . . . . . . . . . . . . 32--37
                  M. Carter and   
                   M. Hendy and   
                   D. Penny and   
              L. A. Szekely and   
                  N. C. Wormald   On the Distribution of Lengths of
                                  Evolutionary Trees . . . . . . . . . . . 38--47
        Olivier Goldschmidt and   
              Dorit S. Hochbaum   A Fast Perfect-Matching Algorithm in
                                  Random Graphs  . . . . . . . . . . . . . 48--57
        Olivier Goldschmidt and   
              Dorit S. Hochbaum   Asymptotically Optimal Linear Algorithm
                                  for the Minimal $k$-Cut in a Random
                                  Graph  . . . . . . . . . . . . . . . . . 58--73
        Péter Hajnal and   
         Endre Szemerédi   Brooks Coloring in Parallel  . . . . . . 74--80
             Maria M. Klawe and   
             Daniel J. Kleitman   An Almost Linear Time Algorithm for
                                  Generalized Matrix Searching . . . . . . 81--97
                     Anna Lubiw   The Boolean Basis Problem and How to
                                  Cover Some Polygons by Rectangles  . . . 98--115
             Jean-Luc Petit and   
          Eric Térouanne   A Theory of Proportional Representation  116--139
               Muzhong Wang and   
                   Ian F. Blake   Bit Serial Multiplication in Finite
                                  Fields . . . . . . . . . . . . . . . . . 140--148
                     Jiang Zeng   Calcul saalschützien des partitions et
                                  des dérangements colorés. (French)
                                  [Saalschutz calculation of colored
                                  partitions and derangements] . . . . . . 149--156

SIAM Journal on Discrete Mathematics
Volume 3, Number 2, May, 1990

                   I. Adler and   
                     S. Cosares   Advantageous Properties of Dual
                                  Transhipment Polyhedra . . . . . . . . . 157--167
                 Jehoshua Bruck   Harmonic Analysis of Polynomial
                                  Threshold Functions  . . . . . . . . . . 168--177
           A. R. Calderbank and   
                 Patrick Morton   Quasi-Symmetric $3$-Designs and Elliptic
                                  Curves . . . . . . . . . . . . . . . . . 178--196
                  D. Duffus and   
                   B. Sands and   
                     P. Winkler   Maximal chains and antichains in Boolean
                                  lattices . . . . . . . . . . . . . . . . 197--205
             Michael R. Fellows   Transversals of Vertex Partitions in
                                  Graphs . . . . . . . . . . . . . . . . . 206--215
          Philippe Flajolet and   
                 Andrew Odlyzko   Singularity Analysis of Generating
                                  Functions  . . . . . . . . . . . . . . . 216--240
                G. Jacopini and   
               P. Mentrasti and   
                   G. Sontacchi   Reversible Turing Machines and
                                  Polynomial Time Reversibly Computable
                                  Functions  . . . . . . . . . . . . . . . 241--254
          Mauricio Karchmer and   
                  Avi Wigderson   Monotone Circuits for Connectivity
                                  Require Super-Logarithmic Depth  . . . . 255--265
                  Bruno Leclerc   Medians and Majorities in Semimodular
                                  Lattices . . . . . . . . . . . . . . . . 266--276
             Alexander Lubotzky   Locally Symmetric Graphs of Prescribed
                                  Girth and Coxeter Groups . . . . . . . . 277--280
               T. Przytycka and   
                J. H. Przytycki   On a Lower Bound for Short
                                  Noncontractible Cycles in Embedded
                                  Graphs . . . . . . . . . . . . . . . . . 281--293
              Hans Ulrich Simon   On Approximate Solutions for
                                  Combinatorial Optimization Problems  . . 294--310

SIAM Journal on Discrete Mathematics
Volume 3, Number 3, August, 1990

          Kenneth A. Berman and   
             Mokhtar H. Konsowa   Random Paths and Cuts, Electrical
                                  Networks, and Reversible Markov Chains   311--319
           Daniel Bienstock and   
         Ernest F. Brickell and   
                 Clyde L. Monma   On the structure of minimum-weight
                                  $k$-connected spanning networks  . . . . 320--329
           Nader H. Bshouty and   
                Gadiel Seroussi   Generalizations of the Normal Basis
                                  Theorem of Finite Fields . . . . . . . . 330--337
               John Cremona and   
                   Susan Landau   Shrinking Lattice Polyhedra  . . . . . . 338--348
                   D. Z. Du and   
                    F. K. Hwang   Optimal assembly of an $s$-stage
                                  $k$-out-of-$n$ system  . . . . . . . . . 349--354
                      P. Frankl   Canonical Antichains on the Circle and
                                  Applications . . . . . . . . . . . . . . 355--363
         G. B. Khosrovshahi and   
             S. Ajoodani-Namini   A New Basis for Trades . . . . . . . . . 364--372
         Daniel J. Kleitman and   
                Rakesh V. Vohra   Computing the Bandwidth of Interval
                                  Graphs . . . . . . . . . . . . . . . . . 373--375
               Shlomo Moran and   
                Yaron Wolfstahl   One-Page Book Embedding Under
                                  Vertex-Neighborhood Constraints  . . . . 376--390
            Takao Nishizeki and   
              Kenichi Kashiwagi   On the $1.1$ Edge-Coloring of
                                  Multigraphs  . . . . . . . . . . . . . . 391--410
           Hanif D. Sherali and   
                Warren P. Adams   A Hierarchy of Relaxations Between the
                                  Continuous and Convex Hull
                                  Representations for Zero-One Programming
                                  Problems . . . . . . . . . . . . . . . . 411--430
                 Cun Quan Zhang   Finding Critical Independent Sets and
                                  Critical Vertex Subsets are Polynomial
                                  Problems . . . . . . . . . . . . . . . . 431--438

SIAM Journal on Discrete Mathematics
Volume 3, Number 4, November, 1990

                  M. Aigner and   
                     E. Triesch   Irregular Assignments of Trees and
                                  Forests  . . . . . . . . . . . . . . . . 439--449
                David J. Aldous   The Random Walk Construction of Uniform
                                  Spanning Trees and Uniform Labelled
                                  Trees  . . . . . . . . . . . . . . . . . 450--465
                   E. M. Bolger   A Characterization of an Extension of
                                  the Banzhaf Value to Multicandidate
                                  Voting Games . . . . . . . . . . . . . . 466--477
              Peter C. Fishburn   Binary Probabilities Induced by Rankings 478--488
              Peter C. Fishburn   Thicknesses of Ordered Sets  . . . . . . 489--501
      Martin Grötschel and   
                 Clyde L. Monma   Integer Polyhedra Arising from Certain
                                  Network Design Problems with
                                  Connectivity Constraints . . . . . . . . 502--523
       Yahya Ould Hamidoune and   
                  Ralph Tindell   Vertex Transitivity and Super Line
                                  Connectedness  . . . . . . . . . . . . . 524--530
                Tung Lin Lu and   
                Pei Hsin Ho and   
                Gerard J. Chang   The Domatic Number Problem in Interval
                                  Graphs . . . . . . . . . . . . . . . . . 531--536
             Y. Manoussakis and   
                        Z. Tuza   Polynomial Algorithms for Finding Cycles
                                  and Paths in Bipartite Tournaments . . . 537--543
             Oliver Pretzel and   
                    Dale Youngs   Cycle Lengths and Graph Orientations . . 544--553
            Vijaya Ramachandran   A Minimax Arc Theorem for Reducible Flow
                                  Graphs . . . . . . . . . . . . . . . . . 554--560
                Carla D. Savage   Generating Permutations with
                                  $k$-Differences  . . . . . . . . . . . . 561--573
            Lajos Takács   On the Number of Distinct Forests  . . . 574--581
                 Craig A. Tovey   A Simplified Anomaly and Reduction for
                                  Precedence Constrained Multiprocessor
                                  Scheduling . . . . . . . . . . . . . . . 582--584
             Tai-Ching Tuan and   
                S. Louis Hakimi   River Routing with a Small Number of
                                  Jogs . . . . . . . . . . . . . . . . . . 585--597


SIAM Journal on Discrete Mathematics
Volume 4, Number 1, February, 1991

                   James Abello   The weak Bruhat order of $S_\Sigma$
                                  consistent sets, and Catalan numbers . . 1--16
              Dan Bienstock and   
               Ervin Györi   An extremal problem on sparse $0$-$1$
                                  matrices . . . . . . . . . . . . . . . . 17--27
               M. A. Bonuccelli   A Polynomial Time Optimal Algorithm for
                                  Satellite-Switched Time-Division
                                  Multiple Access Satellite Communications
                                  with General Switching Modes . . . . . . 28--35
                 Benny Chor and   
               Eyal Kushilevitz   A Zero-One Law for Boolean Privacy . . . 36--47
         E. G. Coffman, Jr. and   
                     P. W. Shor   A Simple Proof of the $O(\sqrt n
                                  \log^{3/4}n)$ Upright Matching Bound . . 48--57
                P. Flajolet and   
                       M. Soria   The Cycle Construction . . . . . . . . . 58--60
          Donald K. Friesen and   
            Michael A. Langston   Analysis of a Compound Bin Packing
                                  Algorithm  . . . . . . . . . . . . . . . 61--79
  H. Galeana-Sánchez and   
 L. Pastrana Ramírez and   
H. A. Rincón-Mejía   Semikernels, Quasi Kernels, and Grundy
                                  Functions in the Line Digraph  . . . . . 80--83
                 T. Ibaraki and   
                      S. Poljak   Weak three-linking in Eulerian digraphs  84--98
         Daniel J. Kleitman and   
                Douglas B. West   Spanning Trees with Many Leaves  . . . . 99--106
             Tomasz \Luczak and   
             Andrzej Ruci\'nski   Tree-Matchings in Graph Processes  . . . 107--120
             Nicholas Pippenger   The Expected Capacity of Concentrators   121--129
                   A. Schrijver   Edge-Disjoint Homotopic Paths in
                                  Straight-Line Planar Graphs  . . . . . . 130--138
           Roberto Tamassia and   
              Ioannis G. Tollis   Representations of Graphs on a Cylinder  139--149

SIAM Journal on Discrete Mathematics
Volume 4, Number 2, May, 1991

           Fawzi Al-Thukair and   
               Andrzej Pelc and   
                 Ivan Rival and   
                  Jorge Urrutia   Motion Planning, Two-Directional Point
                                  Representations, and Ordered Sets  . . . 151--163
               Ian F. Blake and   
                      Khun Kith   On the Complete Weight Enumerator of
                                  Reed--Solomon Codes  . . . . . . . . . . 164--171
                 M. Chrobak and   
                 H. Karloff and   
                   T. Payne and   
                S. Vishwanathan   New Results on Server Problems . . . . . 172--181
                Tuvi Etzion and   
                   Alan Hartman   Towards a large set of Steiner quadruple
                                  systems  . . . . . . . . . . . . . . . . 182--195
      Zoltán Füredi   Maximal Independent Subsets in Steiner
                                  Systems and in Planar Sets . . . . . . . 196--199
                 Eric Goles and   
         Servet Martínez   Lyapunov Functionals for Automata
                                  Networks Defined by Cyclically Monotone
                                  Functions  . . . . . . . . . . . . . . . 200--206
        Michelangelo Grigni and   
                    David Peleg   Tight Bounds on Minimum Broadcast
                                  Networks . . . . . . . . . . . . . . . . 207--222
      Jan Kratochvíl and   
                 Anna Lubiw and   
          Jaroslav Ne\vset\vril   Noncrossing Subgraphs in Topological
                                  Layouts  . . . . . . . . . . . . . . . . 223--244
                   Cheng Ng and   
           Daniel S. Hirschberg   Three-Dimensional Stable Matching
                                  Problems . . . . . . . . . . . . . . . . 245--252
               J. B. Remmel and   
                        M. Yang   Special Rim Hook Tabloids and Some New
                                  Multiplicity-Free $S$-Series . . . . . . 253--274
              Louis Shapiro and   
                 A. B. Stephens   Bootstrap Percolation, the Schroder
                                  Numbers, and the $N$-Kings Problem . . . 275--280
             P. K. McKinley and   
                   N. Hasan and   
         R. Libeskind-Hadas and   
                      C. L. Liu   Disjoint Covers in Replicated
                                  Heterogeneous Arrays . . . . . . . . . . 281--292
                    Martin Dowd   An Integer Program for Codes . . . . . . 293--303

SIAM Journal on Discrete Mathematics
Volume 4, Number 3, August, 1991

J.-P. Barthélémy and   
                 M. F. Janowitz   A Formal Theory of Consensus . . . . . . 305--322
              Marek Chrobak and   
            Lawrence L. Larmore   A New Approach to the Server Problem . . 323--328
               Paul Erd\Hos and   
             Peter Fishburn and   
      Zoltán Füredi   Midpoints of diagonals of convex
                                  $n$-gons . . . . . . . . . . . . . . . . 329--341
              Daniel Granot and   
             Darko Skorin-Kapov   NC Algorithms for Recognizing Partial
                                  $2$-Trees and $3$-Trees  . . . . . . . . 342--354
                 Jack E. Graver   Rigidity Matroids  . . . . . . . . . . . 355--368
               Makoto Imase and   
              Bernard M. Waxman   Dynamic Steiner tree problem . . . . . . 369--384
                  Sung Kwon Kim   Optimal Parallel Algorithms for Region
                                  Labeling and Medial Axis Transform of
                                  Binary Images  . . . . . . . . . . . . . 385--396
              Gary MacGillivray   On the Complexity of Colouring by
                                  Vertex-Transitive and Arc-Transitive
                                  Digraphs . . . . . . . . . . . . . . . . 397--408
                      Moni Naor   A Lower Bound on Probabilistic
                                  Algorithms for Distributive Ring
                                  Coloring . . . . . . . . . . . . . . . . 409--412
               Gara Pruesse and   
                   Frank Ruskey   Generating the Linear Extensions of
                                  Certain Posets by Transpositions . . . . 413--422
              Kai-Yeung Siu and   
                 Jehoshua Bruck   On the Power of Threshold Circuits with
                                  Small Weights  . . . . . . . . . . . . . 423--435
                     Shmuel Onn   On the Geometry and Computational
                                  Complexity of Radon Partitions in the
                                  Integer Lattice  . . . . . . . . . . . . 436--446
          Edward R. Scheinerman   A Note on Planar Graphs and Circle
                                  Orders . . . . . . . . . . . . . . . . . 447--450

SIAM Journal on Discrete Mathematics
Volume 4, Number 4, November, 1991

                Peter Alles and   
      Jaroslav Ne\vset\vril and   
               Svatopluk Poljak   Extendability, Dimensions, and Diagrams
                                  of Cyclic Orders . . . . . . . . . . . . 453--471
                 Shay Assaf and   
                      Eli Upfal   Fault Tolerant Sorting Networks  . . . . 472--480
           Richard B. Borie and   
             R. Gary Parker and   
                 Craig A. Tovey   Deterministic Decomposition of Recursive
                                  Graph Classes  . . . . . . . . . . . . . 481--501
             E. F. Brickell and   
                  D. R. Stinson   The Detection of Cheaters in Threshold
                                  Schemes  . . . . . . . . . . . . . . . . 502--510
               Mee Yee Chan and   
                 Shiang-Jen Lee   On the Existence of Hamiltonian Circuits
                                  in Faulty Hypercubes . . . . . . . . . . 511--527
                D. de Werra and   
                      Ph. Solot   Compact Cylindrical Chromatic Scheduling 528--534
        Andreas W. M. Dress and   
               Timothy F. Havel   Bound Smoothing under Chirality
                                  Constraints  . . . . . . . . . . . . . . 535--549
                     Arie Tamir   Obnoxious Facility Location on Graphs    550--567
                     Clara Chan   Plane Trees and $H$-Vectors of Shellable
                                  Cubical Complexes  . . . . . . . . . . . 568--574
            Stanley Xi Wang and   
              Edward C. Waymire   A large deviation rate and central limit
                                  theorem for Horton ratios  . . . . . . . 575--588
                    Martin Dowd   Erratum: ``An integer program for
                                  codes''  . . . . . . . . . . . . . . . . 589--589


SIAM Journal on Discrete Mathematics
Volume 5, Number 1, February, 1992

              Amotz Bar-Noy and   
             Rajeev Motwani and   
                    Joseph Naor   A Linear Time Approach to the Set Maxima
                                  Problem  . . . . . . . . . . . . . . . . 1--9
        Jean-Claude Bermond and   
                 Pavol Hell and   
         Arthur L. Liestman and   
               Joseph G. Peters   Broadcasting in Bounded Degree Graphs    10--24
            András Frank   Augmenting Graphs to Meet
                                  Edge-Connectivity Requirements . . . . . 25--53
          Hiroshi Nagamochi and   
              Toshihide Ibaraki   Computing Edge-Connectivity in
                                  Multigraphs and Capacitated Graphs . . . 54--66
               D. D. Olesky and   
                   T. A. Slater   A Forward Lower Restricted Ordering
                                  Algorithm for Digraphs . . . . . . . . . 67--73
          Edward R. Scheinerman   Generalized Chromatic Numbers of Random
                                  Graphs . . . . . . . . . . . . . . . . . 74--80
                David Zuckerman   A Technique for Lower Bounding the Cover
                                  Time . . . . . . . . . . . . . . . . . . 81--87
     László Babai   Bounded Round Interactive Proofs in
                                  Finite Groups  . . . . . . . . . . . . . 88--111
                 Guoli Ding and   
               A. Schrijver and   
                  P. D. Seymour   Disjoint Paths in a Planar Graph: a
                                  General Theorem  . . . . . . . . . . . . 112--116
         Michael R. Fellows and   
            Michael A. Langston   On Well-Partial-Order Theory and Its
                                  Application to Combinatorial Problems of
                                  VLSI Design  . . . . . . . . . . . . . . 117--126
             Robin Pemantle and   
                James Propp and   
                  Daniel Ullman   On Tensor Powers of Integer Programs . . 127--143
          David R. Guichard and   
                John W. Krussel   Pair Labelings of Graphs . . . . . . . . 144--149

SIAM Journal on Discrete Mathematics
Volume 5, Number 2, May, 1992

            Baruch Awerbuch and   
                    David Peleg   Routing with Polynomial
                                  Communication-Space Trade-Off  . . . . . 151--162
                   E. Boros and   
                   Y. Crama and   
                   P. L. Hammer   Chvatal Cuts and Odd Cycle Inequalities
                                  in Quadratic $0$-$1$ Optimization  . . . 163--177
              Luisa Gargano and   
                    Ugo Vaccaro   Minimum Time Broadcast Networks
                                  Tolerating a Logarithmic Number of
                                  Faults . . . . . . . . . . . . . . . . . 178--198
            Grzegorz Stachowiak   Hamilton Paths in Graphs of Linear
                                  Extensions for Unions of Posets  . . . . 199--206
                  Hui Shan Zhou   On the Nonmultiplicativity of Oriented
                                  Cycles . . . . . . . . . . . . . . . . . 207--218
                Dani\`ele Gardy   Normal Limiting Distributions for
                                  Projection and Semijoin Sizes  . . . . . 219--248
          Sampath K. Kannan and   
                Tandy J. Warnow   Triangulating $3$-Colored Graphs . . . . 249--258
                Richard M. Karp   Three-Stage Generalized Connectors . . . 259--272
               Eyal Kushilevitz   Privacy and Communication Complexity . . 273--284
                  R. D. Lou and   
             M. Sarrafzadeh and   
                      D. T. Lee   An Optimal Algorithm for the Maximum
                                  Two-Chain Problem  . . . . . . . . . . . 285--304

SIAM Journal on Discrete Mathematics
Volume 5, Number 3, August, 1992

                 Peter Borm and   
             Guillermo Owen and   
                      Stef Tijs   On the Position Value for Communication
                                  Situations . . . . . . . . . . . . . . . 305--320
                   Sunil Chopra   Polyhedra of the Equivalent Subgraph
                                  Problem and Some Edge Connectivity
                                  Problems . . . . . . . . . . . . . . . . 321--337
             Krzysztof Diks and   
                   Andrzej Pelc   Almost Safe Gossiping in Bounded Degree
                                  Networks . . . . . . . . . . . . . . . . 338--344
            Lajos Rónyai   Galois Groups and Factoring Polynomials
                                  Over Finite Fields . . . . . . . . . . . 345--365
  Jòrgen Bang-Jensen and   
              Carsten Thomassen   A Polynomial Algorithm for the $2$-Path
                                  Problem for Semicomplete Digraphs  . . . 366--376
         Arthur T. Benjamin and   
                   Fritz Juhnke   Another way of counting $N^N$  . . . . . 377--379
       Donald I. Cartwright and   
                 Wolfgang Woess   Infinite Graphs with Nonconstant
                                  Dirichlet Finite Harmonic Functions  . . 380--385
              Refael Hassin and   
                    Moshe Haviv   Mean Passage Times and Nearly Uncoupled
                                  Markov Chains  . . . . . . . . . . . . . 386--397
           Lenwood S. Heath and   
     Frank Thomson Leighton and   
            Arnold L. Rosenberg   Comparing Queues and Stacks as
                                  Mechanisms for Laying Out Graphs . . . . 398--412
                     Dongsu Kim   A Combinatorial Approach to Biorthogonal
                                  Polynomials  . . . . . . . . . . . . . . 413--421
            Donald E. Knuth and   
             Arvind Raghunathan   The Problem of Compatible
                                  Representatives  . . . . . . . . . . . . 422--427
          Daniel D. Sleator and   
           Robert E. Tarjan and   
            William P. Thurston   Short Encodings of Evolving Structures   428--450

SIAM Journal on Discrete Mathematics
Volume 5, Number 4, November, 1992

           A. Beutelspacher and   
              D. Jungnickel and   
         P. C. van Oorschot and   
                 S. A. Vanstone   Pair-splitting sets in ${\rm AG}(m,q)$   451--459
              Phillip Botti and   
             Russell Merris and   
                    Cheryl Vega   Laplacian Permanents of Trees  . . . . . 460--466
          Graham Brightwell and   
                   Colin Wright   The $1/3\mbox{--}2/3$ conjecture for
                                  $5$-thin posets  . . . . . . . . . . . . 467--474
                   Sunil Chopra   The Equivalent Subgraph and Directed Cut
                                  Polyhedra on Series-Parallel Graphs  . . 475--490
                   Geng Hua Fan   Covering Graphs by Cycles  . . . . . . . 491--496
                Seyoum Getu and   
           Louis W. Shapiro and   
               Wen-Jin Woan and   
                Leon C. Woodson   How to Guess a Generating Function . . . 497--499
              Kwang S. Hong and   
             Joseph Y.-T. Leung   Some results on Liu's conjecture . . . . 500--523
                Garth Isaak and   
              Suh-Ryung Kim and   
             Terry A. McKee and   
             F. R. McMorris and   
                Fred S. Roberts   $2$-competition graphs . . . . . . . . . 524--538
            Michael S. Jacobson   On the $p$-edge clique cover number of
                                  complete bipartite graphs  . . . . . . . 539--544
       Bala Kalyanasundaram and   
                Georg Schnitger   The Probabilistic Communication
                                  Complexity of Set Intersection . . . . . 545--557
                Maria Klawe and   
                   Tom Leighton   A Tight Lower Bound on the Size of
                                  Planar Permutation Networks  . . . . . . 558--563
       Christina Zamfirescu and   
               Tudor Zamfirescu   Hamiltonian Properties of Grid Graphs    564--570
             Jason I. Brown and   
            Charles J. Colbourn   Roots of the Reliability Polynomial  . . 571--585
          Jerrold R. Griggs and   
                   Roger K. Yeh   Labelling graphs with a condition at
                                  distance $2$ . . . . . . . . . . . . . . 586--595
             Sampath Kannan and   
                  Moni Naor and   
                  Steven Rudich   Implicit Representation of Graphs  . . . 596--603


SIAM Journal on Discrete Mathematics
Volume 6, Number 1, February, 1993

           A. R. Calderbank and   
                    P. Delsarte   On Error-Correcting Codes and Invariant
                                  Linear Forms . . . . . . . . . . . . . . 1--23
            Gerard J. Chang and   
              Martin Farber and   
                     Zsolt Tuza   Algorithmic Aspects of Neighborhood
                                  Numbers  . . . . . . . . . . . . . . . . 24--29
                John Donald and   
                     John Elwin   On the Structure of the Strong
                                  Orientations of a Graph  . . . . . . . . 30--43
            Antonio Mach\`i and   
                Filippo Mignosi   Garden of Eden Configurations for
                                  Cellular Automata on Cayley Graphs of
                                  Groups . . . . . . . . . . . . . . . . . 44--56
        S. Thomas McCormick and   
                 S. Frank Chang   The Weighted Sparsity Problem:
                                  Complexity and Algorithms  . . . . . . . 57--69
           Macdonald Morris and   
          Gabriel Schachtel and   
                  Samuel Karlin   Exact Formulas for Multitype Run
                                  Statistics in a Random Ordering  . . . . 70--86
                  Hui Shan Zhou   Characterization of the Homomorphic
                                  Preimages of Certain Oriented Cycles . . 87--99
             E. Rodney Canfield   Matchings in the Partition Lattice . . . 100--109
            Fan R. K. Chung and   
                  Prasad Tetali   Communication Complexity and Quasi
                                  Randomness . . . . . . . . . . . . . . . 110--123
               Daniel M. Gordon   Discrete logarithms in ${\rm GF}(p)$
                                  using the number field sieve . . . . . . 124--138
                  P. Nobili and   
                     A. Sassano   Polyhedral Properties of Clutter Amalgam 139--151
               Frank Ruskey and   
                   Carla Savage   Hamilton cycles that extend
                                  transposition matchings in Cayley graphs
                                  of $S_n$ . . . . . . . . . . . . . . . . 152--166
            Michael J. Todd and   
           Levent Tunçel   A New Triangularization for Simplicial
                                  Algorithms . . . . . . . . . . . . . . . 167--180

SIAM Journal on Discrete Mathematics
Volume 6, Number 2, May, 1993

         Hans L. Bodlaender and   
           Rolf H. Möhring   The Pathwidth and Treewidth of Cographs  181--188
              Odile Favaron and   
                 Pedro Mago and   
           Consuelo Maulino and   
                    Oscar Ordaz   Hamiltonian Properties of Bipartite
                                  Graphs and Digraphs with Bipartite
                                  Independence $2$ . . . . . . . . . . . . 189--196
                Bonita Rais and   
           Philippe Jacquet and   
           Wojciech Szpankowski   Limiting Distribution for the Depth in
                                  Patricia Tries . . . . . . . . . . . . . 197--213
       Graham R. Brightwell and   
          Edward R. Scheinerman   Representations of Planar Graphs . . . . 214--229
          Graham Brightwell and   
             William T. Trotter   The Order Dimension of Convex Polytopes  230--245
            Peter Gritzmann and   
                Bernd Sturmfels   Minkowski Addition of Polytopes:
                                  Computational Complexity and
                                  Applications to Gröbner Bases . . . . . . 246--269
                       G. Gutin   Finding a Longest Path in a Complete
                                  Multipartite Digraph . . . . . . . . . . 270--273
                Paul Helman and   
        Bernard M. E. Moret and   
               Henry D. Shapiro   An Exact Characterization of Greedy
                                  Structures . . . . . . . . . . . . . . . 274--283
       Mihály Hujter and   
                     Zsolt Tuza   The Number of Maximal Independent Sets
                                  in Triangle-Free Graphs  . . . . . . . . 284--288
            Ramana M. Idury and   
     Alejandro A. Schäffer   Triangulating three-colored graphs in
                                  linear time and linear space . . . . . . 289--293
                Jonathan Jedwab   Barker arrays. I. Even number of
                                  elements . . . . . . . . . . . . . . . . 294--308
            Jonathan Jedwab and   
             Sheelagh Lloyd and   
                Miranda Mowbray   Barker arrays. II. Odd number of
                                  elements . . . . . . . . . . . . . . . . 309--328
         Kenneth R. Vollmar and   
                   Yanjun Zhang   On the Enumeration of Steiner-Tree
                                  Topologies for the Points on a Circle    329--333

SIAM Journal on Discrete Mathematics
Volume 6, Number 3, August, 1993

                    Jiazhen Cai   Counting Embeddings of Planar Graphs
                                  Using DFS Trees  . . . . . . . . . . . . 335--352
             William Y. C. Chen   Induced Cycle Structures of the
                                  Hyperoctahedral Group  . . . . . . . . . 353--362
            Don Coppersmith and   
              Prasad Tetali and   
                  Peter Winkler   Collisions among Random Walks on a Graph 363--374
               J. D. Horton and   
                     K. Kilakos   Minimum Edge Dominating Sets . . . . . . 375--387
             A. Knopfmacher and   
                   J. N. Ridley   Reciprocal Sums over Partitions and
                                  Compositions . . . . . . . . . . . . . . 388--399
             Dieter Kratsch and   
                  Lorna Stewart   Domination on Cocomparability Graphs . . 400--417
                    Rachid Saad   Complexity of the Forwarding Index
                                  Problem  . . . . . . . . . . . . . . . . 418--427
                 Cun Quan Zhang   Parity Subgraph, Shortest Cycle Cover,
                                  and Postman Tour . . . . . . . . . . . . 428--431
            Joan Feigenbaum and   
             Jeremy A. Kahn and   
                   Carsten Lund   Complexity Results for POMSET Languages  432--442
              Mark Goldberg and   
                 Thomas Spencer   An Efficient Parallel Algorithm That
                                  Finds Independent Sets of Guaranteed
                                  Size . . . . . . . . . . . . . . . . . . 443--459
              Ming-Yang Kao and   
                   Dan Gusfield   Efficient detection and protection of
                                  information in cross tabulated tables.
                                  I. Linear invariant test . . . . . . . . 460--476
              Samir Khuller and   
                Joseph Naor and   
                   Philip Klein   The Lattice Structure of Flow in Planar
                                  Graphs . . . . . . . . . . . . . . . . . 477--490
   Jenö Töröcsik   $n+1$ segments beat $n$  . . . . . . . . 491--500
                   Andrew Vince   Replicating Tessellations  . . . . . . . 501--521

SIAM Journal on Discrete Mathematics
Volume 6, Number 4, November, 1993

                 Elias Dahlhaus   Fast Parallel Recognition of
                                  Ultrametrics and Tree Metrics  . . . . . 523--532
             Frank K. Hwang and   
          Uriel G. Rothblum and   
                    Larry Shepp   Monotone Optimal Multipartitions Using
                                  Schur Convexity with Respect to Partial
                                  Orders . . . . . . . . . . . . . . . . . 533--547
                  Alon Orlitsky   Interactive Communication of Balanced
                                  Distributions and of Correlated Files    548--564
                    S. Ueno and   
                  A. Bagchi and   
               S. L. Hakimi and   
               E. F. Schmeichel   On Minimum Fault-Tolerant Networks . . . 565--574
              Gerhard Woeginger   Improved Space for Bounded-Space,
                                  On-Line Bin-Packing  . . . . . . . . . . 575--581
            Jonathan Ashley and   
               Brian Marcus and   
           Dominique Perrin and   
                   Selim Tuncel   Surjective Extensions of Sliding-Block
                                  Codes  . . . . . . . . . . . . . . . . . 582--611
             Sylvia C. Boyd and   
                    Tianbao Hao   An Integer Polytope Related to the
                                  Design of Survivable Communication
                                  Networks . . . . . . . . . . . . . . . . 612--630
                D. de Werra and   
           N. V. R. Mahadev and   
                    U. N. Peled   Edge-Chromatic Scheduling with
                                  Simultaneity Constraints . . . . . . . . 631--641
               Bojana Obreni\'c   Embedding de Bruijn and Shuffle-Exchange
                                  Graphs in Five Pages . . . . . . . . . . 642--654
              K. Wendy Tang and   
                 Bruce W. Arden   Representations of Borel Cayley graphs   655--676
                   E. Goles and   
             S. Martínez   Errata: ``Lyapunov functionals for
                                  automata networks defined by cyclically
                                  monotone functions'' [SIAM J. Discrete
                                  Math. \bf 4 (1991), no. 2, 200--206; MR
                                  91m:68135] . . . . . . . . . . . . . . . 677--677


SIAM Journal on Discrete Mathematics
Volume 7, Number 1, February, 1994

                  Noga Alon and   
                 Jehoshua Bruck   Explicit Constructions of Depth-$2$
                                  Majority Circuits for Comparison and
                                  Addition . . . . . . . . . . . . . . . . 1--8
           Edward A. Bender and   
             E. Rodney Canfield   The Number of Degree-Restricted Rooted
                                  Maps on the Sphere . . . . . . . . . . . 9--15
                   Sunil Chopra   The Graph Partitioning Polytope on
                                  Series-Parallel and $4$-Wheel Free
                                  Graphs . . . . . . . . . . . . . . . . . 16--31
                 S. Felsner and   
                   M. Habib and   
             R. H. Möhring   On the Interplay between Interval
                                  Dimension and Dimension  . . . . . . . . 32--40
            Michael Fellows and   
                Gerd Fricke and   
         Stephen Hedetniemi and   
                   David Jacobs   The Private Neighbor Cube  . . . . . . . 41--47
             P. C. Fishburn and   
                    J. A. Reeds   Bell Inequalities, Grothendieck's
                                  Constant, and Root Two . . . . . . . . . 48--56
               D. Frank Hsu and   
                    Xing-De Jia   Extremal Problems in the Construction of
                                  Distributed Loop Networks  . . . . . . . 57--71
            H. A. Kierstead and   
              S. G. Penrice and   
                  W. T. Trotter   On-Line Coloring and Recursive Graph
                                  Theory . . . . . . . . . . . . . . . . . 72--89
                  I. Leader and   
                A. J. Radcliffe   Littlewood--Offord inequalities for
                                  random variables . . . . . . . . . . . . 90--101
             Chris Mitchell and   
             Michael Walker and   
                     Peter Wild   The Combinatorics of Perfect
                                  Authentication Schemes . . . . . . . . . 102--107
         Nicholas Pippenger and   
                       Geng Lin   Fault-Tolerant Circuit-Switching
                                  Networks . . . . . . . . . . . . . . . . 108--118
          Bogdan S. Chlebus and   
             Krzysztof Diks and   
                   Andrzej Pelc   Sorting on a Mesh-Connected Computer
                                  with Delaying Links  . . . . . . . . . . 119--132
                   Denise Sakai   Labelling Chordal Graphs: Distance Two
                                  Condition  . . . . . . . . . . . . . . . 133--140
        C. P. M. van Hoesel and   
         A. P. M. Wagelmans and   
                   L. A. Wolsey   Polyhedral Characterization of the
                                  Economic Lot-Sizing Problem with
                                  Start-Up Costs . . . . . . . . . . . . . 141--151
                       Lily Yen   A Note on Multiset Permutations  . . . . 152--155

SIAM Journal on Discrete Mathematics
Volume 7, Number 2, May, 1994

                     M. Sen and   
                   B. K. Sanyal   Indifference Digraphs: a Generalization
                                  of Indifference Graphs and Semiorders    157--165
                  Guo-Hui Zhang   Some New Bounds on Single-Change
                                  Covering Designs . . . . . . . . . . . . 166--171
                Seth Malitz and   
           Achilleas Papakostas   On the Angular Resolution of Planar
                                  Graphs . . . . . . . . . . . . . . . . . 172--183
                  Noga Alon and   
               Paul Seymour and   
                   Robin Thomas   Planar Separators  . . . . . . . . . . . 184--193
          G. M. Constantine and   
                   T. H. Savits   A Stochastic Process Interpretation of
                                  Partition Identities . . . . . . . . . . 194--202
                Genghua Fan and   
          Roland Häggkvist   The square of a Hamiltonian cycle  . . . 203--212
                Alan P. Sprague   An $O(n\log n)$ algorithm for bandwidth
                                  of interval graphs . . . . . . . . . . . 213--220
               Robert Grone and   
                 Russell Merris   The Laplacian spectrum of a graph. II    221--229
                   Tom Leighton   A $2d-1$ Lower Bound for Two-Layer
                                  Knock-Knee Channel Routing . . . . . . . 230--237
                  Claude Carlet   The divisors of $x^{2^m}+x$ of constant
                                  derivatives and degree $2^{m-2}$ . . . . 238--244
                   Sunil Chopra   The $k$-edge-connected spanning subgraph
                                  polyhedron . . . . . . . . . . . . . . . 245--259
              Daphne Koller and   
                 Nimrod Megiddo   Constructing Small Sample Spaces
                                  Satisfying Given Constraints . . . . . . 260--274
               Rajeev Kohli and   
        Ramesh Krishnamurti and   
            Prakash Mirchandani   The Minimum Satisfiability Problem . . . 275--283
              Kai-Yeung Siu and   
          Vwani P. Roychowdhury   On Optimal Depth Threshold Circuits for
                                  Multiplication and Related Problems  . . 284--292
             Alexander A. Ageev   On Finding Critical Independent and
                                  Vertex Sets  . . . . . . . . . . . . . . 293--295
             F. R. McMorris and   
            Tandy J. Warnow and   
                   Thomas Wimer   Triangulating Vertex-Colored Graphs  . . 296--306
           Svatopluk Poljak and   
                     Zsolt Tuza   Bipartite Subgraphs of Triangle-Free
                                  Graphs . . . . . . . . . . . . . . . . . 307--313
                    Jun Gao and   
              J. Michael Steele   Sums of Squares of Edge Lengths and
                                  Spacefilling Curve Heuristics for the
                                  Traveling Salesman Problem . . . . . . . 314--324
                   L. Babai and   
                    H. Oral and   
                   K. T. Phelps   Eulerian Self-Dual Codes . . . . . . . . 325--330
       Jayme L. Szwarcfiter and   
          Claudson F. Bornstein   Clique Graphs of Chordal and Path Graphs 331--336

SIAM Journal on Discrete Mathematics
Volume 7, Number 3, August, 1994

                      C. Mouaha   On systematic codes obtained from linear
                                  codes over ${\rm GF}(q^2)$ . . . . . . . 337--343
         Francisco Barahona and   
              Ali Ridha Mahjoub   Compositions of graphs and polyhedra. I.
                                  Balanced induced subgraphs and acyclic
                                  subgraphs  . . . . . . . . . . . . . . . 344--358
         Francisco Barahona and   
              Ali Ridha Mahjoub   Compositions of graphs and polyhedra.
                                  II. Stable sets  . . . . . . . . . . . . 359--371
         Francisco Barahona and   
              Ali Ridha Mahjoub   Compositions of graphs and polyhedra.
                                  III. Graphs with no $W_4$ minor  . . . . 372--389
         Francisco Barahona and   
               Jean Fonlupt and   
              Ali Ridha Mahjoub   Compositions of graphs and polyhedra.
                                  IV. Acyclic spanning subgraphs . . . . . 390--402
           David Hartvigsen and   
                 Russell Mardon   The All-Pairs Min Cut Problem and the
                                  Minimum Cycle Basis Problem on Planar
                                  Graphs . . . . . . . . . . . . . . . . . 403--418
          William M. Y. Goh and   
                   Eric Schmutz   Random Set Partitions  . . . . . . . . . 419--436
                  D. P. Day and   
       Ortrud R. Oellermann and   
                 Henda C. Swart   Steiner Distance-Hereditary Graphs . . . 437--442
             F. R. K. Chung and   
                   V. Faber and   
           Thomas A. Manteuffel   An Upper Bound on the Diameter of a
                                  Graph from Eigenvalues Associated with
                                  Its Laplacian  . . . . . . . . . . . . . 443--457
                 James F. Lynch   Random Resource Allocation Graphs and
                                  the Probability of Deadlock  . . . . . . 458--473
             F. R. K. Chung and   
              Wayne Goddard and   
             Daniel J. Kleitman   Even Cycles in Directed Graphs . . . . . 474--483
             Johan Håstad   On the Size of Weights for Threshold
                                  Gates  . . . . . . . . . . . . . . . . . 484--492
                David C. Fisher   Domination, Fractional Domination,
                                  $2$-Packing, and Graph Products  . . . . 493--498
               Ian F. Blake and   
                Shuhong Gao and   
               Ronald C. Mullin   Normal and self-dual normal bases from
                                  factorization of $cx^{q+1}+dx^q-ax-b$    499--512
                  Noga Alon and   
             F. R. K. Chung and   
                   R. L. Graham   Routing Permutations on Graphs Via
                                  Matchings  . . . . . . . . . . . . . . . 513--530

SIAM Journal on Discrete Mathematics
Volume 7, Number 4, November, 1994

                   E. Boros and   
               P. L. Hammer and   
                   J. N. Hooker   Predicting Cause-Effect Relationships
                                  from Incomplete Discrete Observations    531--543
        Patrick Solé and   
               Thomas Zaslavsky   A Coding Approach to Signed Graphs . . . 544--553
            G. Van der Geer and   
               M. Van der Vlugt   Generalized Hamming Weights of Melas
                                  Codes and Dual Melas Codes . . . . . . . 554--559
              Moshe Morgenstern   Ramanujan Diagrams . . . . . . . . . . . 560--570
           Peter Dankelmann and   
             Thomas Niessen and   
               Ingo Schiermeyer   On Path-Tough Graphs . . . . . . . . . . 571--584
        Jack A. A. van der Veen   A New Class of Pyramidally Solvable
                                  Symmetric Traveling Salesman Problems    585--592
                Arjana \vZitnik   Drawing Graphs on Surfaces . . . . . . . 593--597
                 Glenn Hurlbert   On universal cycles for $k$-subsets of
                                  an $n$-set . . . . . . . . . . . . . . . 598--604
         Arundhati Raychaudhuri   Further results on $T$-coloring and
                                  frequency assignment problems  . . . . . 605--613
                    Jianer Chen   A Linear-Time Algorithm for Isomorphism
                                  of Graphs of Bounded Average Genus . . . 614--631
              Ming-Yang Kao and   
          Martin Fürer and   
                     Xin He and   
            Balaji Raghavachari   Optimal Parallel Algorithms for
                                  Straight-Line Grid Embeddings of Planar
                                  Graphs . . . . . . . . . . . . . . . . . 632--646
              Ravi Sundaram and   
           Karan Sher Singh and   
                C. Pandu Rangan   Treewidth of Circular-Arc Graphs . . . . 647--655
          Michel X. Goemans and   
            David P. Williamson   New $\frac{3}{4}$-approximation
                                  algorithms for the maximum
                                  satisfiability problem . . . . . . . . . 656--666
             Yvo G. Desmedt and   
                   Yair Frankel   Homomorphic Zero-Knowledge Threshold
                                  Schemes over Any Finite Abelian Group    667--679


SIAM Journal on Discrete Mathematics
Volume 8, Number 1, February, 1995

             Thomas Andreae and   
       Hans-Jürgen Bandelt   Performance Guarantees for Approximation
                                  Algorithms Depending on Parametrized
                                  Triangle Inequalities  . . . . . . . . . 1--16
       André Bouchet and   
          William H. Cunningham   Delta-Matroids, Jump Systems, and
                                  Bisubmodular Polyhedra . . . . . . . . . 17--32
         Bradley S. Carlson and   
           C. Y. Roger Chen and   
          Dikran S. Meliksetian   Dual Eulerian properties of plane
                                  multigraphs  . . . . . . . . . . . . . . 33--50
                  M. Hofmeister   Enumeration of Concrete Regular Covering
                                  Projections  . . . . . . . . . . . . . . 51--61
                    Xing De Jia   Extremal Cayley digraphs of finite
                                  cyclic groups  . . . . . . . . . . . . . 62--75
          Mauricio Karchmer and   
           Eyal Kushilevitz and   
                     Noam Nisan   Fractional Covers and Communication
                                  Complexity . . . . . . . . . . . . . . . 76--92
           Eyal Kushilevitz and   
             Yishay Mansour and   
               Michael O. Rabin   On Lotteries with Unique Winners . . . . 93--98
               Yaw Ling Lin and   
               Steven S. Skiena   Algorithms for Square Roots of Graphs    99--118
László Lovász and   
                  Moni Naor and   
                Ilan Newman and   
                  Avi Wigderson   Search Problems in the Decision Tree
                                  Model  . . . . . . . . . . . . . . . . . 119--132
           Hanif D. Sherali and   
                    Youngho Lee   Sequential and Simultaneous Liftings of
                                  Minimal Cover Inequalities for
                                  Generalized Upper Bound Constrained
                                  Knapsack Polytopes . . . . . . . . . . . 133--153

SIAM Journal on Discrete Mathematics
Volume 8, Number 2, May, 1995

  Jòrgen Bang-Jensen and   
        András Frank and   
                   Bill Jackson   Preserving and Increasing Local
                                  Edge-Connectivity in Mixed Graphs  . . . 155--178
     Kathryn F. Fraughnaugh and   
        J. Richard Lundgren and   
              Sarah K. Merz and   
             John S. Maybee and   
              Norman J. Pullman   Competition Graphs of Strongly Connected
                                  and Hamiltonian Digraphs . . . . . . . . 179--185
      Jaime González and   
               Osvaldo Landaeta   A Competitive Strong Spanning Tree
                                  Algorithm for the Maximum Bipartite
                                  Matching Problem . . . . . . . . . . . . 186--195
Heikki O. Hämäläinen and   
            Iiro S. Honkala and   
            Simon N. Litsyn and   
Patric R. J. Östergård   Bounds for Binary Codes That Are
                                  Multiple Coverings of the Farthest-Off
                                  Points . . . . . . . . . . . . . . . . . 196--207
                 Pavol Hell and   
                    Xu Ding Zhu   The Existence of Homomorphisms to
                                  Oriented Cycles  . . . . . . . . . . . . 208--222
        Jeanette P. Schmidt and   
                Alan Siegel and   
             Aravind Srinivasan   Chernoff--Hoeffding bounds for
                                  applications with limited independence   223--250
              Jeremy P. Spinrad   Nonredundant $1$'s in $\Gamma$-free
                                  matrices . . . . . . . . . . . . . . . . 251--257
            Gary K. H. Yeap and   
              Majid Sarrafzadeh   Sliceable Floorplanning by Graph
                                  Dualization  . . . . . . . . . . . . . . 258--280
                Donald E. Knuth   Two-Way Rounding . . . . . . . . . . . . 281--290
         Arthur L. Liestman and   
              Thomas C. Shermer   Degree-Constrained Network Spanners with
                                  Nonconstant Delay  . . . . . . . . . . . 291--321
             Nicholas Pippenger   Analysis of a Recurrence Arising from a
                                  Construction for Nonblocking Networks    322--345

SIAM Journal on Discrete Mathematics
Volume 8, Number 3, August, 1995

                 Earl R. Barnes   An Inequality for Probability Moments
                                  with Applications  . . . . . . . . . . . 347--358
                Leizhen Cai and   
               Derek G. Corneil   Tree Spanners  . . . . . . . . . . . . . 359--387
                D. S. Franzblau   Combinatorial Algorithm for a Lower
                                  Bound on Frame Rigidity  . . . . . . . . 388--400
               Guy Kortsarz and   
                    David Peleg   Approximation Algorithms for
                                  Minimum-Time Broadcast . . . . . . . . . 401--427
             Laurent Alonso and   
         Edward M. Reingold and   
             René Schott   Multidimensional Divide-and-Conquer
                                  Maximin Recurrences  . . . . . . . . . . 428--447
            Beverly Jamison and   
                 Stephan Olariu   $p$-components and the homogeneous
                                  decomposition of graphs  . . . . . . . . 448--463
            Toniann Pitassi and   
              Alasdair Urquhart   The complexity of the Hajós calculus  . . 464--483

SIAM Journal on Discrete Mathematics
Volume 8, Number 4, November, 1995

         Henry A. Kierstead and   
         Stephen G. Penrice and   
             William T. Trotter   On-line and first-fit coloring of graphs
                                  that do not induce $P_5$ . . . . . . . . 485--498
     Marshall A. Whittlesey and   
            John P. Georges and   
                 David W. Mauro   On the $\lambda$-number of $Q_n$ and
                                  related graphs . . . . . . . . . . . . . 499--506
             F. R. McMorris and   
                   R. C. Powers   The Median Procedure in a Formal Theory
                                  of Consensus . . . . . . . . . . . . . . 507--516
   Hans-Jürgen Bandelt and   
          Michael Anthony Steel   Symmetric Matrices Representable by
                                  Weighted Trees Over a Cancellative
                                  Abelian Monoid . . . . . . . . . . . . . 517--525
         Ingo Althöfer and   
                    Imre Leader   Correlation of Boolean Functions and
                                  Pathology in Recursion Trees . . . . . . 526--535
                Ilan Newman and   
                  Avi Wigderson   Lower Bounds on Formula Size of Boolean
                                  Functions Using Hypergraph Entropy . . . 536--542
        Ronald I. Greenberg and   
                   Jau Der Shih   Feasible Offset and Optimal Offset for
                                  General Single-Layer Channel Routing . . 543--554
            Jonathan Ashley and   
                   Brian Marcus   Canonical Encoders for Sliding Block
                                  Decoders . . . . . . . . . . . . . . . . 555--605
         Hans L. Bodlaender and   
                  Ton Kloks and   
                 Dieter Kratsch   Treewidth and Pathwidth of Permutation
                                  Graphs . . . . . . . . . . . . . . . . . 606--616
           Sandeep N. Bhatt and   
            Fan R. K. Chung and   
     Frank Thomson Leighton and   
            Arnold L. Rosenberg   Salvage-Embeddings of Complete Trees . . 617--637
                Maria Klawe and   
                  Brendan Mumey   Upper and Lower Bounds on Constructing
                                  Alphabetic Binary Trees  . . . . . . . . 638--651
            Du\vsan B. Jevti\'c   On Families of Sets of Integral Vectors
                                  Whose Representatives Form Sum-Distinct
                                  Sets . . . . . . . . . . . . . . . . . . 652--660
        Ramesh Krishnamurti and   
             Bhagirath Narahari   An Approximation Algorithm for
                                  Preemptive Scheduling on Parallel-Task
                                  Systems  . . . . . . . . . . . . . . . . 661--669
       Jürgen Bokowski and   
                Peter Schuchert   Altshuler's sphere $M^9_{963}$ revisited 670--677
         Timothy Law Snyder and   
              J. Michael Steele   Equidistribution in All Dimensions of
                                  Worst-Case Point Sets for the Traveling
                                  Salesman Problem . . . . . . . . . . . . 678--683


SIAM Journal on Discrete Mathematics
Volume 9, Number 1, February, 1996

              Ulrich Faigle and   
            Alan J. Hoffman and   
                    Walter Kern   A Characterization of Nonnegative
                                  Box-Greedy Matrices  . . . . . . . . . . 1--6
             Krzysztof Diks and   
                   Andrzej Pelc   Efficient Gossiping by Packets in
                                  Networks With Random Faults  . . . . . . 7--18
                Greg Barnes and   
                    Uriel Feige   Short Random Walks on Graphs . . . . . . 19--28
            Ravi B. Boppana and   
              Babu O. Narayanan   The Biased Coin Problem  . . . . . . . . 29--36
     Marie-Claude Heydemann and   
           Joseph G. Peters and   
              Dominique Sotteau   Spanners of Hypercube-Derived Networks   37--54
                  Shi-Chun Tsai   Lower bounds on representing Boolean
                                  functions as polynomials in $Z_m$  . . . 55--62
            David J. Haglin and   
                  Marty J. Wolf   On Convex Subsets in Tournaments . . . . 63--70
               Satoru Iwata and   
                   Kazuo Murota   Horizontal Principal Structure of
                                  Layered Mixed Matrices: Decomposition of
                                  Discrete Systems by Design-Variable
                                  Selections . . . . . . . . . . . . . . . 71--86
                  Ming-Yang Kao   Data Security Equals Graph Connectivity  87--100
              Daniel P. Sanders   On Linear Recognition of Tree-Width At
                                  Most Four  . . . . . . . . . . . . . . . 101--117
                 Kimmo Eriksson   Chip-Firing Games on Mutating Graphs . . 118--128
             L. Aleksandrov and   
                     H. Djidjev   Linear Algorithms for Partitioning
                                  Embedded Graphs of Bounded Genus . . . . 129--150
              Brian Alspach and   
                Yi-Ping Liu and   
                 Cun-Quan Zhang   Nowhere-zero $4$-flows and Cayley graphs
                                  on solvable groups . . . . . . . . . . . 151--154
            Michael G. Luby and   
          Joseph Seffi Naor and   
                     Ariel Orda   Tight Bounds for Dynamic Storage
                                  Allocation . . . . . . . . . . . . . . . 155--166

SIAM Journal on Discrete Mathematics
Volume 9, Number 2, May, 1996

          Glenn K. Manacher and   
             Terrance A. Mankus   Finding a domatic partition of an
                                  interval graph in time $O(n)$  . . . . . 167--172
            Don Coppersmith and   
                Steven Phillips   On a question of Erd\Hos on subsequence
                                  sums . . . . . . . . . . . . . . . . . . 173--177
                    R. Ravi and   
                R. Sundaram and   
              M. V. Marathe and   
          D. J. Rosenkrantz and   
                     S. S. Ravi   Spanning Trees --- Short or Small  . . . 178--200
                    Tuvi Etzion   On the Nonexistence of Perfect Codes in
                                  the Johnson Scheme . . . . . . . . . . . 201--209
             Frank Hoffmann and   
                  Klaus Kriegel   A Graph-Coloring Result and its
                                  Consequences for Polygon-Guarding
                                  Problems . . . . . . . . . . . . . . . . 210--224
           Oswin Aichholzer and   
              Franz Aurenhammer   Classifying Hyperplanes in Hypercubes    225--232
          M. Grötschel and   
                  A. Martin and   
                  R. Weismantel   Packing Steiner trees: separation
                                  algorithms . . . . . . . . . . . . . . . 233--257
                  E. N. Mayoraz   On the Power of Democratic Networks  . . 258--268
       Michael O. Albertson and   
                      Ruth Haas   Bounding Functions and Rigid Graphs  . . 269--273
         Binay Bhattacharya and   
                 Pavol Hell and   
                     Jing Huang   A Linear Algorithm for Maximum Weight
                                  Cliques in Proper Circular Arc Graphs    274--289
             Jason I. Brown and   
      Richard J. Nowakowski and   
                   Douglas Rall   The Ultimate Categorical Independence
                                  Ratio of a Graph . . . . . . . . . . . . 290--300
            Don Coppersmith and   
                Uriel Feige and   
                  James Shearer   Random Walks on Regular and Irregular
                                  Graphs . . . . . . . . . . . . . . . . . 301--308
            Gerard J. Chang and   
                      David Kuo   The $L(2,1)$-labeling problem on graphs  309--316
       Srinivasa R. Arikati and   
                Anil Maheshwari   Realizing Degree Sequences in Parallel   317--338
          Thomas M. Kratzke and   
                Douglas B. West   The total interval number of a graph.
                                  II. Trees and complexity . . . . . . . . 339--348

SIAM Journal on Discrete Mathematics
Volume 9, Number 3, August, 1996

       Giuseppe Di Battista and   
                   Luca Vismara   Angles of Planar Triangular Graphs . . . 349--359
              Jovan Dj. Goli\'c   Constrained Embedding Probability for
                                  Two Binary Strings . . . . . . . . . . . 360--364
                 E. Andrew Boyd   On the Complexity of a Cutting Plane
                                  Algorithm for Solving Combinatorial
                                  Linear Programs  . . . . . . . . . . . . 365--376
             Jason I. Brown and   
        Charles J. Colbourn and   
                David G. Wagner   Cohen--Macaulay rings in network
                                  reliability  . . . . . . . . . . . . . . 377--392
               Gerard Cohen and   
               Simon Litsyn and   
            Alexander Vardy and   
            Gilles Zémor   Tilings of Binary Spaces . . . . . . . . 393--412
                    Tuvi Etzion   Nonequivalent $q$-ary perfect codes  . . 413--423
     Jürgen Bierbrauer and   
          K. Gopalakrishnan and   
                  D. R. Stinson   Orthogonal Arrays, Resilient Functions,
                                  Error-Correcting Codes, and Linear
                                  Programming Bounds . . . . . . . . . . . 424--452
            Robert Connelly and   
                Walter Whiteley   Second-Order Rigidity and Prestress
                                  Stability for Tensegrity Frameworks  . . 453--491
         Oliver Goldschmidt and   
          Dorit S. Hochbaum and   
                Cor Hurkens and   
                        Gang Yu   Approximation algorithms for the
                                  $k$-clique covering problem  . . . . . . 492--509

SIAM Journal on Discrete Mathematics
Volume 9, Number 4, November, 1996

              Yinan N. Shen and   
              Fabrizio Lombardi   Graph Algorithms for Conformance Testing
                                  Using the Rural Chinese Postman Tour . . 511--528
                David G. Wagner   Multipartition Series  . . . . . . . . . 529--544
                   Kazuo Murota   Valuated matroid intersection. I.
                                  Optimality criteria  . . . . . . . . . . 545--561
                   Kazuo Murota   Valuated matroid intersection. II.
                                  Algorithms . . . . . . . . . . . . . . . 562--576
       Andrzej Proskurowski and   
           Maciej M. Sys\lo and   
                  Pawe\l Winter   Plane Embeddings of $2$-Trees and
                                  Biconnected Partial $2$-Trees  . . . . . 577--596
               Ian F. Blake and   
                   Vahid Tarokh   On the Trellis Complexity of the Densest
                                  Lattice Packings in ${\bf R}^n$  . . . . 597--601
               Sunil Chopra and   
               Giovanni Rinaldi   The Graphical Asymmetric Traveling
                                  Salesman Polyhedron: Symmetric
                                  Inequalities . . . . . . . . . . . . . . 602--624
                 L. L. Doty and   
            R. J. Goldstone and   
                   C. L. Suffel   Cayley Graphs with Neighbor Connectivity
                                  One  . . . . . . . . . . . . . . . . . . 625--642
                  Jennifer Ryan   IIS-hypergraphs  . . . . . . . . . . . . 643--653
         Terry Min Yih Wang and   
                Carla D. Savage   A Gray code for necklaces of fixed
                                  density  . . . . . . . . . . . . . . . . 654--673
        Kathryn Fraughnaugh and   
               Stephen C. Locke   Finding Independent Sets in
                                  Triangle-Free Graphs . . . . . . . . . . 674--681


SIAM Journal on Discrete Mathematics
Volume 10, Number 1, February, 1997

           J. H. Rubinstein and   
               D. A. Thomas and   
                  N. C. Wormald   Steiner trees for terminals constrained
                                  to curves  . . . . . . . . . . . . . . . 1--17
                Svante Linusson   Partitions with restricted block sizes,
                                  Möbius functions, and the $k$-of-each
                                  problem  . . . . . . . . . . . . . . . . 18--29
                   Nabil Kahale   Isoperimetric inequalities and
                                  eigenvalues  . . . . . . . . . . . . . . 30--40
          George E. Andrews and   
              Davide Crippa and   
                    Klaus Simon   $q$-series arising from the study of
                                  random graphs  . . . . . . . . . . . . . 41--56
               Martin Juvan and   
                    Bojan Mohar   Obstructions for $2$-Möbius band
                                  embedding extension problem  . . . . . . 57--72
             Bruce Richmond and   
              Donatella Merlini   Stirling numbers for complex arguments   73--82
          Peter C. Fishburn and   
                 Jerry S. Kelly   Super Arrovian domains with strict
                                  preferences  . . . . . . . . . . . . . . 83--95
            Regina Urbaniak and   
          Robert Weismantel and   
         Günter M. Ziegler   A variant of the Buchberger algorithm
                                  for integer programming  . . . . . . . . 96--108
    Andreas Brandstädt and   
           Victor D. Chepoi and   
               Feodor F. Dragan   Clique $r$-domination and clique
                                  $r$-packing problems on dually chordal
                                  graphs . . . . . . . . . . . . . . . . . 109--127
            Pascale Charpin and   
                Victor Zinoviev   On coset weight distributions of the
                                  $3$-error-correcting BCH-codes . . . . . 128--145
  Siddharthan Ramachandramurthi   The structure and number of obstructions
                                  to treewidth . . . . . . . . . . . . . . 146--157
        András Frank and   
      Alexander V. Karzanov and   
        András Sebö   On integer multiflow maximization  . . . 158--170

SIAM Journal on Discrete Mathematics
Volume 10, Number 2, May, 1997

                   L. Tassiulas   Worst case length of nearest neighbor
                                  tours for the Euclidean traveling
                                  salesman problem . . . . . . . . . . . . 171--179
                 Andreas Hefner   A min-max theorem for a constrained
                                  matching problem . . . . . . . . . . . . 180--189
                      B. Yu and   
                J. Cheriyan and   
                   P. E. Haxell   Hypercubes and multicommodity flows  . . 190--200
                    Mark Ramras   Congestion-free optimal routings of
                                  hypercube automorphisms  . . . . . . . . 201--208
             Raphael Yuster and   
                      Uri Zwick   Finding even cycles even faster  . . . . 209--222
                Ron Holzman and   
                Yosi Marcus and   
                    David Peleg   Load balancing in quorum systems . . . . 223--245
             Michael Drmota and   
                Mich\`ele Soria   Images and preimages in random mappings  246--269
              Chris J. Mitchell   de Bruijn sequences and perfect factors  270--281
               Nicolas Sendrier   On the dimension of the hull . . . . . . 282--293
               Satoru Fujishige   A min-max theorem for bisubmodular
                                  polyhedra  . . . . . . . . . . . . . . . 294--308
             Edward Bertram and   
             Peter Horák   Decomposing $4$-regular graphs into
                                  triangle-free $2$-factors  . . . . . . . 309--317
Béla Bollobás and   
              Graham Brightwell   The structure of random graph orders . . 318--335

SIAM Journal on Discrete Mathematics
Volume 10, Number 3, August, 1997

               Arvind Gupta and   
            Russell Impagliazzo   Bounding the size of planar intertwines  337--358
                A. M. Hamel and   
                    M. A. Steel   The length of a leaf coloration on a
                                  random binary tree . . . . . . . . . . . 359--372
                H. A. Kierstead   Classes of graphs that are not vertex
                                  Ramsey . . . . . . . . . . . . . . . . . 373--380
             Neil J. Calkin and   
               Paul Erd\Hos and   
                 Craig A. Tovey   New Ramsey bounds from cyclic graphs of
                                  prime order  . . . . . . . . . . . . . . 381--387
                     J. F. Weng   Linear Steiner trees for infinite
                                  spirals  . . . . . . . . . . . . . . . . 388--398
           Derek G. Corneil and   
             Stephan Olariu and   
                  Lorna Stewart   Asteroidal triple-free graphs  . . . . . 399--430
                A. Sarangarajan   A lower bound for adjacencies on the
                                  traveling salesman polytope  . . . . . . 431--435
            J. Scott Provan and   
                 Manoj K. Chari   Counting problems associated with
                                  Steiner trees in graphs  . . . . . . . . 436--446
        Jean-Pierre Tillich and   
            Gilles Zémor   Optimal cycle codes constructed from
                                  Ramanujan graphs . . . . . . . . . . . . 447--459
           Michael J. Adams and   
                Bryan L. Shader   A construction for $(t,m,s)$-nets in
                                  base $q$ . . . . . . . . . . . . . . . . 460--468
          Hiroshi Nagamochi and   
         Kazuhiro Nishimura and   
              Toshihide Ibaraki   Computing all small cuts in an
                                  undirected network . . . . . . . . . . . 469--481
               Shao C. Fang and   
           Santosh S. Venkatesh   A threshold function for harmonic update 482--498
                       Lily Yen   A combinatorial proof for Stockhausen's
                                  problem  . . . . . . . . . . . . . . . . 499--504
          Mourad Baïou and   
              Ali Ridha Mahjoub   Steiner $2$-edge connected subgraph
                                  polytopes on series-parallel graphs  . . 505--514

SIAM Journal on Discrete Mathematics
Volume 10, Number 4, November, 1997

       Graham R. Brightwell and   
             William T. Trotter   The order dimension of planar maps . . . 515--528
             Jan Arne Telle and   
           Andrzej Proskurowski   Algorithms for vertex partitioning
                                  problems on partial $k$-trees  . . . . . 529--550
         Andrew V. Goldberg and   
                 Robert Kennedy   Global price updates help  . . . . . . . 551--572
           Cynthia Phillips and   
             Clifford Stein and   
                      Joel Wein   Task scheduling in networks  . . . . . . 573--598
           Lenwood S. Heath and   
            Sriram V. Pemmaraju   Stack and queue layouts of posets  . . . 599--625
           André Bouchet   Multimatroids. I. Coverings by
                                  independent sets . . . . . . . . . . . . 626--646
           Eyal Kushilevitz and   
                 Yishay Mansour   Randomness in private computations . . . 647--661
                Itsik Pe'er and   
                     Ron Shamir   Realizing interval graphs with size and
                                  distance constraints . . . . . . . . . . 662--687


SIAM Journal on Discrete Mathematics
Volume 11, Number 1, February, 1998

        Alexander Schrijver and   
               Paul Seymour and   
                  Peter Winkler   The Ring Loading Problem . . . . . . . . 1--14
             P. C. Fishburn and   
                  J. H. Kim and   
             J. C. Lagarias and   
                   P. E. Wright   Interference-Minimizing Colorings of
                                  Regular Graphs . . . . . . . . . . . . . 15--40
              D. R. Stinson and   
                         R. Wei   Combinatorial Properties and
                                  Constructions of Traceability Schemes
                                  and Frameproof Codes . . . . . . . . . . 41--53
             Neil J. Calkin and   
                Herbert S. Wilf   The Number of Independent Sets in a Grid
                                  Graph  . . . . . . . . . . . . . . . . . 54--60
           Eyal Kushilevitz and   
               Adi Rosén   A Randomness-Rounds Tradeoff in Private
                                  Computation  . . . . . . . . . . . . . . 61--80
       Vladimir G. Deuineko and   
        Rüdiger Rudolf and   
           Gerhard J. Woeginger   Sometimes Travelling is Easy: The Master
                                  Tour Problem . . . . . . . . . . . . . . 81--93
       Andrzej Proskurowski and   
               Frank Ruskey and   
                  Malcolm Smith   Analysis of Algorithms for Listing
                                  Equivalence Classes of $k$-ary Strings   94--109
                 Oliver Riordan   An Ordering on the Even Discrete Torus   110--127
              David R. Guichard   Competition Graphs of Hamiltonian
                                  Digraphs . . . . . . . . . . . . . . . . 128--134
               Bjorn Poonen and   
             Michael Rubinstein   The Number of Intersection Points Made
                                  by the Diagonals of a Regular Polygon    135--156
        Charles M. Fiduccia and   
          Rodney W. Forcade and   
    Jennifer S. Zito input epsf   Geometry and Diameter Bounds of Directed
                                  Cayley Graphs of Abelian Groups  . . . . 157--167
         Hans L. Bodlaender and   
         Jitender S. Deogun and   
               Klaus Jansen and   
                  Ton Kloks and   
             Dieter Kratsch and   
          Haiko Müller and   
                     Zsolt Tuza   Rankings of Graphs . . . . . . . . . . . 168--181

SIAM Journal on Discrete Mathematics
Volume 11, Number 2, May, 1998

             Robert W. Chen and   
                  Alan Zame and   
          Andrew M. Odlyzko and   
                 Larry A. Shepp   An Optimal Acceptance Policy for an Urn
                                  Scheme . . . . . . . . . . . . . . . . . 183--195
              Jon Kleinberg and   
              Michel X. Goemans   The Lovász Theta Function and a
                                  Semidefinite Programming Relaxation of
                                  Vertex Cover . . . . . . . . . . . . . . 196--204
                Tuvi Etzion and   
                Alexander Vardy   On Perfect Codes and Tilings: Problems
                                  and Solutions  . . . . . . . . . . . . . 205--223
               Vineet Bafna and   
               Pavel A. Pevzner   Sorting by Transpositions  . . . . . . . 224--240
          Chris J. Mitchell and   
            Kenneth G. Paterson   Perfect Factors from Cyclic Codes and
                                  Interleaving . . . . . . . . . . . . . . 241--264
              Rongquan Feng and   
                Jin Ho Kwak and   
                Juyoung Kim and   
                      Jaeun Lee   Isomorphism Classes of Concrete Graph
                                  Coverings  . . . . . . . . . . . . . . . 265--272
                Jin Ho Kwak and   
               Jang-Ho Chun and   
                      Jaeun Lee   Enumeration of Regular Graph Coverings
                                  Having Finite Abelian Covering
                                  Transformation Groups  . . . . . . . . . 273--285
             Michael Hofmeister   A Note on Counting Connected Graph
                                  Covering Projections . . . . . . . . . . 286--292
                Cristian Lenart   A Generalized Distance in Graphs and
                                  Centered Partitions  . . . . . . . . . . 293--304
                  M. Espona and   
                       O. Serra   Cayley Digraphs Based on the de Bruijn
                                  Networks . . . . . . . . . . . . . . . . 305--317
                  Tomasz Luczak   A Greedy Algorithm Estimating the Height
                                  of Random Trees  . . . . . . . . . . . . 318--329
               Karen L. Collins   Circulants and Sequences . . . . . . . . 330--339
  H. Galeana-Sánchez and   
                    Xueliang Li   Semikernels and $(k,l)$-Kernels in
                                  Digraphs . . . . . . . . . . . . . . . . 340--346

SIAM Journal on Discrete Mathematics
Volume 11, Number 3, August, 1998

 János Komlós and   
                    Yuan Ma and   
         Endre Szemerédi   Matching Nuts and Bolts in $O(n \log n)$
                                  Time . . . . . . . . . . . . . . . . . . 347--372
            Fred J. Rispoli and   
                 Steven Cosares   A Bound of $4$ for the Diameter of the
                                  Symmetric Traveling Salesman Polytope    373--380
              Jonathan Lichtner   Iterating an $\alpha$-ary Gray code  . . 381--386
              Ulrich Faigle and   
                    Walter Kern   Approximate Core Allocation for
                                  Binpacking Games . . . . . . . . . . . . 387--399
               Artur Czumaj and   
           Leszek Gasieniec and   
                   Andrzej Pelc   Time and Cost Trade-Offs in Gossiping    400--413
                  Victor Chepoi   On Distance-Preserving and Domination
                                  Elimination Orderings  . . . . . . . . . 414--436
    Andreas Brandstädt and   
              Feodor Dragan and   
              Victor Chepoi and   
                Vitaly Voloshin   Dually Chordal Graphs  . . . . . . . . . 437--455
         Anatoly R. Rubinov and   
             Vadim G. Timkovsky   String Noninclusion Optimization
                                  Problems . . . . . . . . . . . . . . . . 456--467
                  Martin Kochol   Partial Intersection Theorem and Flows
                                  in Abstract Networks . . . . . . . . . . 468--486
                    Mark Ramras   Congestion-free Routings of Linear
                                  Complement Permutations  . . . . . . . . 487--500
            C. Padró and   
                 P. Morillo and   
                X. Muñoz   Fault-Tolerant Fixed Routings in Some
                                  Families of Digraphs . . . . . . . . . . 501--509

SIAM Journal on Discrete Mathematics
Volume 11, Number 4, November, 1998

                 Benny Chor and   
                    Madhu Sudan   A Geometric Approach to Betweenness  . . 511--523
           A. M. H. Gerards and   
                 F. B. Shepherd   The Graphs with All Subgraphs
                                  $T$-Perfect  . . . . . . . . . . . . . . 524--545
                Shimon Even and   
                 Ami Litman and   
            Arnold L. Rosenberg   Monochromatic Paths and Triangulated
                                  Graphs . . . . . . . . . . . . . . . . . 546--556
        András Frank and   
          Toshihide Ibaraki and   
              Hiroshi Nagamochi   Two Arc-Disjoint Paths in Eulerian
                                  Digraphs . . . . . . . . . . . . . . . . 557--589
                 D. J. Guan and   
                     Xuding Zhu   Multiple Capacity Vehicle Routing on
                                  Paths  . . . . . . . . . . . . . . . . . 590--602
  Jòrgen Bang-Jensen and   
            Tibor Jordán   Edge-Connectivity Augmentation
                                  Preserving Simplicity  . . . . . . . . . 603--623
           Ramamohan Paturi and   
                   Francis Zane   Dimension of Projections in Boolean
                                  Functions  . . . . . . . . . . . . . . . 624--632
            Shiow-Fen Hwang and   
                Gerard J. Chang   $k$-Neighborhood-Covering and
                                  -Independence Problems for Chordal
                                  Graphs . . . . . . . . . . . . . . . . . 633--643
                  Yair Caro and   
            M. N. Ellingham and   
                    J. E. Ramey   Local Structure When All Maximal
                                  Independent Sets Have Equal Weight . . . 644--654
             John G. Gimbel and   
                   Ann N. Trenk   On the Weakness of an Ordered Set  . . . 655--663
              Yunghsiang S. Han   A New Decoding Algorithm for Complete
                                  Decoding of Linear Block Codes . . . . . 664--671


SIAM Journal on Discrete Mathematics
Volume 12, Number 1, February, 1999

         Andrew V. Goldberg and   
                     Satish Rao   Flows in Undirected Unit Capacity
                                  Networks . . . . . . . . . . . . . . . . 1--5
                    Bojan Mohar   A Linear Time Algorithm for Embedding
                                  Graphs in an Arbitrary Surface . . . . . 6--26
            Kevin T. Phelps and   
                     Mike LeVan   Nonsystematic perfect codes  . . . . . . 27--34
                   Josep Rif\`a   Well-Ordered Steiner Triple Systems and
                                  $1$-Perfect Partitions of the $n$-cube   35--47
               A. Czygrinow and   
                  S. Poljak and   
                   V. Rödl   Constructive Quasi-Ramsey Numbers and
                                  Tournament Ranking . . . . . . . . . . . 48--63
                   Louxin Zhang   Optimal Bounds for Matching Routing on
                                  Trees  . . . . . . . . . . . . . . . . . 64--77
              Ming-Yang Kao and   
                Stephen R. Tate   On-Line Difference Maximization  . . . . 78--90
                Alberto Caprara   Sorting Permutations by Reversals and
                                  Eulerian Cycle Decompositions  . . . . . 91--110
            Wilfried Imrich and   
              Sandi Klavzar and   
            Henry Martyn Mulder   Median Graphs and Triangle-Free Graphs   111--118
           Feodor F. Dragan and   
               Falk Nicolai and   
        Andreas Brandstädt   Convexity and HHD-Free Graphs  . . . . . 119--135
         Brigitte Servatius and   
                Walter Whiteley   Constraining Plane Configurations in
                                  Computer-Aided Design: Combinatorics of
                                  Directions and Lengths . . . . . . . . . 136--153

SIAM Journal on Discrete Mathematics
Volume 12, Number 2, May, 1999

          Philippe Flajolet and   
               Helmut Prodinger   On Stirling Numbers for Complex
                                  Arguments and Hankel Contours  . . . . . 155--159
  Jòrgen Bang-Jensen and   
            Harold N. Gabow and   
        Tibor Jordán and   
          Zoltán Szigeti   Edge-Connectivity Augmentation with
                                  Partition Constraints  . . . . . . . . . 160--207
                Alan Frieze and   
            Michal Karonski and   
                    Lubos Thoma   On Perfect Matchings and Hamilton Cycles
                                  in Sums of Random Trees  . . . . . . . . 208--216
               Zhicheng Gao and   
            Nicholas C. Wormald   The Size of the Largest Components in
                                  Random Planar Maps . . . . . . . . . . . 217--228
                Jianer Chen and   
               Saroja P. Kanchi   Graph Ear Decompositions and Graph
                                  Embeddings . . . . . . . . . . . . . . . 229--242
              Tero Laihonen and   
                   Simon Litsyn   New Bounds On Covering Radius as a
                                  Function of Dual Distance  . . . . . . . 243--251
                Ding-Zhu Du and   
             Frank K. Hwang and   
                   Guoliang Xue   Interconnecting Highways . . . . . . . . 252--261
          Jeannette Janssen and   
               Kyriakos Kilakos   Bounded Stable Sets: Polytopes and
                                  Colorings  . . . . . . . . . . . . . . . 262--275
              Hajo Broersma and   
                  Ton Kloks and   
             Dieter Kratsch and   
              Haiko Müller   Independent Sets in Asteroidal
                                  Triple-Free Graphs . . . . . . . . . . . 276--287

SIAM Journal on Discrete Mathematics
Volume 12, Number 3, August, 1999

               Vineet Bafna and   
               Piotr Berman and   
               Toshihiro Fujito   A $2$-Approximation Algorithm for the
                                  Undirected Feedback Vertex Set Problem   289--297
                   Todd G. Will   Switching Distance Between Graphs with
                                  the Same Degrees . . . . . . . . . . . . 298--306
                  Tao Jiang and   
               Dhruv Mubayi and   
             Aditya Shastri and   
                Douglas B. West   Edge-Bandwidth of Graphs . . . . . . . . 307--316
                     Xin He and   
              Ming-Yang Kao and   
                     Hsueh-I Lu   Linear-Time Succinct Encodings of Planar
                                  Graphs via Canonical Orderings . . . . . 317--325
            G. Bolotashvili and   
                 M. Kovalev and   
                     E. Girlich   New Facets of the Linear Ordering
                                  Polytope . . . . . . . . . . . . . . . . 326--336
              Hikoe Enomoto and   
        Miki Shimabara Miyauchi   Embedding Graphs into a Three Page Book
                                  with $O(m\log n)$ Crossings of Edges
                                  over the Spine . . . . . . . . . . . . . 337--341
Magnús M. Halldórsson and   
                Kazuo Iwano and   
                Naoki Katoh and   
               Takeshi Tokuyama   Finding Subsets Maximizing Minimum
                                  Structures . . . . . . . . . . . . . . . 342--359
             Stefan Felsner and   
                   Klaus Reuter   The Linear Extension Diameter of a Poset 360--373
      Jan Kratochvíl and   
                     Zsolt Tuza   Rankings of Directed Graphs  . . . . . . 374--384
András Gyárfás and   
Zoltán Király and   
                     Jeno Lehel   On-Line $3$-Chromatic Graphs I.
                                  Triangle-Free Graphs . . . . . . . . . . 385--411
                 Russell Merris   Note: An Upper Bound for the Diameter of
                                  a Graph  . . . . . . . . . . . . . . . . 412--412

SIAM Journal on Discrete Mathematics
Volume 12, Number 4, November, 1999

        Anders Björner and   
                 Volkmar Welker   Complexes of Directed Graphs . . . . . . 413--424
        Balaji Raghavachari and   
          Jeyakesavan Veerasamy   A $3/2$-Approximation Algorithm for the
                                  Mixed Postman Problem  . . . . . . . . . 425--433
          Bernhard Gittenberger   On the Contour of Random Trees . . . . . 434--458
             Cyril Gavoille and   
                    David Peleg   The Compactness of Interval Routing  . . 459--473
              Meena Mahajan and   
                       V. Vinay   Determinant: Old Algorithms, New
                                  Insights . . . . . . . . . . . . . . . . 474--490
                 Ko-Wei Lih and   
         Daphne Der-Fen Liu and   
                     Xuding Zhu   Star Extremal Circulant Graphs . . . . . 491--499
           William W. Hager and   
               Yaroslav Krylyuk   Graph Partitioning and Continuous
                                  Quadratic Programming  . . . . . . . . . 500--523
                 Samit Dasgupta   On the Size of Minimum Super Arrovian
                                  Domains  . . . . . . . . . . . . . . . . 524--534


SIAM Journal on Discrete Mathematics
Volume 13, Number 1, 2000

                  Tao Jiang and   
               Dhruv Mubayi and   
             Aditya Shastri and   
                Douglas B. West   Correction to ``Edge-Bandwidth of
                                  Graphs'' . . . . . . . . . . . . . . . . 1--1
     Jaikumar Radhakrishnan and   
                  Amnon Ta-Shma   Bounds for Dispersers, Extractors, and
                                  Depth-Two Superconcentrators . . . . . . 2--24
            R. E. L. Aldred and   
                     S. Bau and   
               D. A. Holton and   
               Brendan D. McKay   Nonhamiltonian $3$-Connected Cubic
                                  Planar Graphs  . . . . . . . . . . . . . 25--32
              John Ginsburg and   
                     Bill Sands   Completely Disconnecting the Complete
                                  Graph  . . . . . . . . . . . . . . . . . 33--47
    Chính T. Ho\`ang and   
                    Van Bang Le   Recognizing Perfect $2$-Split Graphs . . 48--55
            J. A. Hoogeveen and   
              A. P. A. Vestjens   A Best Possible Deterministic On-Line
                                  Algorithm for Minimizing Maximum
                                  Delivery Time on a Single Machine  . . . 56--63
                Yair Bartal and   
           Stefano Leonardi and   
Alberto Marchetti-Spaccamela and   
          Jirí Sgall and   
                   Leen Stougie   Multiprocessor Scheduling with Rejection 64--78
          Angela I. Barbero and   
                 Carlos Munuera   The Weight Hierarchy of Hermitian Codes  79--104
              Anne Canteaut and   
            Pascale Charpin and   
                 Hans Dobbertin   Weight Divisibility of Cyclic Codes,
                                  Highly Nonlinear Functions on $F_{2^m}$,
                                  and Crosscorrelation of Maximum-Length
                                  Sequences  . . . . . . . . . . . . . . . 105--138
            Y. O. Hamidoune and   
         A. S. Lladó and   
                   O. Serra and   
                     R. Tindell   On Isoperimetric Connectivity in
                                  Vertex-Transitive Graphs . . . . . . . . 139--144

SIAM Journal on Discrete Mathematics
Volume 13, Number 2, 2000

             Lisa Fleischer and   
                 James B. Orlin   Optimal Rounding of Instantaneous
                                  Fractional Flows Over Time . . . . . . . 145--153
               Gerald J. Janusz   Overlap and Covering Polynomials with
                                  Applications to Designs and Self-Dual
                                  Codes  . . . . . . . . . . . . . . . . . 154--178
  Jòrgen Bang-Jensen and   
                 Jing Huang and   
                     Anders Yeo   Convex-Round and Concave-Round Graphs    179--193
                Rod Forcade and   
                 Jack Lamoreaux   Lattice-Simplex Coverings and the
                                  $84$-Shape . . . . . . . . . . . . . . . 194--201
                  Yair Caro and   
            Douglas B. West and   
                 Raphael Yuster   Connected Domination and Spanning Trees
                                  with Many Leaves . . . . . . . . . . . . 202--211
                Endre Boros and   
                 Yves Crama and   
                   Oya Ekin and   
            Peter L. Hammer and   
          Toshihide Ibaraki and   
                Alexander Kogan   Boolean Normal Forms, Shellability, and
                                  Reliability Computations . . . . . . . . 212--226
             Satoshi Fujita and   
         Masafumi Yamashita and   
                    Tiko Kameda   A Study on $r$-Configurations --- a
                                  Resource Assignment Problem on Graphs    227--254
                   Guy Even and   
        Joseph (Seffi) Naor and   
            Baruch Schieber and   
                   Leonid Zosin   Approximating Minimum Subset Feedback
                                  Sets in Undirected Graphs with
                                  Applications . . . . . . . . . . . . . . 255--267
         Fred S. Annexstein and   
              Kenneth A. Berman   Directional Routing via Generalized
                                  $st$-Numberings  . . . . . . . . . . . . 268--279

SIAM Journal on Discrete Mathematics
Volume 13, Number 3, 2000

          Michel X. Goemans and   
            David P. Williamson   Two-Dimensional Gantt Charts and a
                                  Scheduling Algorithm of Lawler . . . . . 281--294
                    M. Cera and   
           A. Diánez and   
              A. Márquez   The Size of a Graph Without Topological
                                  Complete Subgraphs . . . . . . . . . . . 295--301
            Peter L. Hammer and   
            Alexander Kogan and   
              Uriel G. Rothblum   Evaluation, Strength, and Relevance of
                                  Variables of Boolean Functions . . . . . 302--312
                  Till Nierhoff   A Tight Bound on the Irregularity
                                  Strength of Graphs . . . . . . . . . . . 313--323
                Amos Beimel and   
             Mike Burmester and   
                Yvo Desmedt and   
               Eyal Kushilevitz   Computing Functions of a Shared Secret   324--345
         Ljiljana Brankovic and   
                Peter Horak and   
                   Mirka Miller   An Optimization Problem in Statistical
                                  Databases  . . . . . . . . . . . . . . . 346--353
                  Michael Naatz   The Graph of Linear Extensions Revisited 354--369
       Bala Kalyanasundaram and   
                  Kirk R. Pruhs   The Online Transportation Problem  . . . 370--383
         E. G. Coffman, Jr. and   
            C. Courcoubetis and   
                M. R. Garey and   
              D. S. Johnson and   
                 P. W. Shor and   
                R. R. Weber and   
                  M. Yannakakis   Bin Packing with Discrete Item Sizes,
                                  Part I: Perfect Packing Theorems and the
                                  Average Case Behavior of Optimal
                                  Packings . . . . . . . . . . . . . . . . 384--402
              Samir Khuller and   
              Yoram J. Sussmann   The Capacitated $K$-Center Problem . . . 403--418

SIAM Journal on Discrete Mathematics
Volume 13, Number 4, 2000

             George Steiner and   
                Paul Stephenson   Subset-Restricted Interchange for
                                  Dynamic Min-Max Scheduling Problems  . . 419--435
           Boaz Patt-Shamir and   
           Yiannis Tsiounis and   
                   Yair Frankel   Exact Analysis of Exact Change: The
                                  $k$-Payment Problem  . . . . . . . . . . 436--453
             Fedor V. Fomin and   
               Petr A. Golovach   Graph Searching and Interval Completion  454--464
         Andreas Birkendorf and   
         Andreas Böker and   
              Hans Ulrich Simon   Learning Deterministic Finite Automata
                                  from Smallest Counterexamples  . . . . . 465--491
     Gérard D. Cohen and   
               Iiro Honkala and   
           Antoine Lobstein and   
            Gilles Zémor   Bounds for Codes Identifying Vertices in
                                  the Hexagonal Grid . . . . . . . . . . . 492--504
              Lisa K. Fleischer   Approximating Fractional Multicommodity
                                  Flow Independent of the Number of
                                  Commodities  . . . . . . . . . . . . . . 505--520
            Jeffrey C. Lagarias   Well-Spaced Labelings of Points in
                                  Rectangular Grids  . . . . . . . . . . . 521--534


SIAM Journal on Discrete Mathematics
Volume 14, Number 1, 2000

               Miklos Ajtai and   
             Nimrod Megiddo and   
                    Orli Waarts   Improved Algorithms and Analysis for
                                  Secretary Problems and Generalizations   1--27
            John P. Georges and   
             David W. Mauro and   
               Melanie I. Stein   Labeling Products of Complete Graphs
                                  with a Condition at Distance Two . . . . 28--35
                     Mike Steel   Sufficient Conditions for Two Tree
                                  Reconstruction Techniques to Succeed on
                                  Sufficiently Long Sequences  . . . . . . 36--48
               David Hartvigsen   Compact Representations of Cuts  . . . . 49--66
        Leslie Ann Goldberg and   
              Mike Paterson and   
         Aravind Srinivasan and   
              Elizabeth Sweedyk   Better Approximation Guarantees for
                                  Job-Shop Scheduling  . . . . . . . . . . 67--92
             Nicholas Pippenger   Enumeration of Equicolorable Trees . . . 93--115
                  Michael Naatz   A Note on a Question of C. D. Savage . . 116--120
              Hikoe Enomoto and   
        Mirko Hornák and   
             Stanislav Jendrol'   Cyclic Chromatic Number of $3$-Connected
                                  Plane Graphs . . . . . . . . . . . . . . 121--137
              Michel X. Goemans   Approximate Edge Splitting . . . . . . . 138--141

SIAM Journal on Discrete Mathematics
Volume 14, Number 2, 2001

   Jesús A. De Loera and   
           Francisco Santos and   
              Fumihiko Takeuchi   Extremal Properties for Dissections of
                                  Convex $3$-Polytopes . . . . . . . . . . 143--161
        John B. Friedlander and   
            Igor E. Shparlinski   On the Distribution of Diffie--Hellman
                                  Triples with Sparse Exponents  . . . . . 162--169
                J. Cheriyan and   
                    A. Sebo and   
                     Z. Szigeti   Improving on the $1.5$-Approximation of
                                  a Smallest $2$-Edge Connected Spanning
                                  Subgraph . . . . . . . . . . . . . . . . 170--180
   János Körner and   
                   Angelo Monti   Compact Representations of the
                                  Intersection Structure of Families of
                                  Finite Sets  . . . . . . . . . . . . . . 181--192
          David A. Christie and   
               Robert W. Irving   Sorting Strings by Reversals and by
                                  Transpositions . . . . . . . . . . . . . 193--206
           Leszek Gasieniec and   
               Andrzej Pelc and   
                    David Peleg   The Wakeup Problem in Synchronous
                                  Broadcast Systems  . . . . . . . . . . . 207--222
                 Kevin D. Wayne   A New Property and a Faster Algorithm
                                  for Baseball Elimination . . . . . . . . 223--229
                  Gill Barequet   A Lower Bound for Heilbronn's Triangle
                                  Problem in $d$ Dimensions  . . . . . . . 230--236
                 Chi-Jen Lu and   
                  Shi-Chun Tsai   A Note on Iterating an $\alpha$-ary Gray
                                  Code . . . . . . . . . . . . . . . . . . 237--239
                  F. Ruskey and   
                C. R. Miers and   
                      J. Sawada   The Number of Irreducible Polynomials
                                  and Lyndon Words with Given Trace  . . . 240--245
            Alexander Ageev and   
              Refael Hassin and   
               Maxim Sviridenko   A $0.5$-Approximation Algorithm for MAX
                                  DICUT with Given Sizes of Parts  . . . . 246--255
             Ryoh Fuji-Hara and   
                  Ying Miao and   
                   Jianxing Yin   Optimal $(9 v, 4, 1)$ Optical Orthogonal
                                  Codes  . . . . . . . . . . . . . . . . . 256--266
           Michele Flammini and   
Stéphane Pérenn\`es   On the Optimality of General Lower
                                  Bounds for Broadcasting and Gossiping    267--282

SIAM Journal on Discrete Mathematics
Volume 14, Number 3, 2001

                    Tim Boykett   Construction of Ferrero Pairs of All
                                  Possible Orders  . . . . . . . . . . . . 283--285
           Krzysztof Bry\'s and   
                  Zbigniew Lonc   Monochromatic Partitions of Complete
                                  Uniform Hypergraphs  . . . . . . . . . . 286--290
                Young-Soo Myung   An Efficient Algorithm for the Ring
                                  Loading Problem with Integer Demand
                                  Splitting  . . . . . . . . . . . . . . . 291--298
                  Dorit Dor and   
         Johan Håstad and   
            Staffan Ulfberg and   
                      Uri Zwick   On Lower Bounds for Selecting the Median 299--311
                  Dorit Dor and   
                      Uri Zwick   Median Selection Requires
                                  \boldmath$(2+\epsilon)n$ Comparisons . . 312--325
            Thomas Erlebach and   
                   Klaus Jansen   The Maximum Edge-Disjoint Paths Problem
                                  in Bidirected Trees  . . . . . . . . . . 326--355
               Gregory L. Smith   Partitions and ($m$ and $n$) Sums of
                                  Products --- Two Cell Partition  . . . . 356--369
            Gerard J. Chang and   
         Justie Su-tzu Juan and   
             Daphne Der-Fen Liu   Minimum Span of No-Hole $(r+1)$-Distant
                                  Colorings  . . . . . . . . . . . . . . . 370--380
            Kazuhisa Makino and   
                    Tiko Kameda   Transformations on Regular Nondominated
                                  Coteries and Their Applications  . . . . 381--407
               Guy Kortsarz and   
             Robert Krauthgamer   On Approximating the Achromatic Number   408--422
             Alexander Barg and   
        Gérard Cohen and   
             Sylvia Encheva and   
        Gregory Kabatiansky and   
            Gilles Zémor   A Hypergraph Approach to the Identifying
                                  Parent Property: The Case of Multiple
                                  Parents  . . . . . . . . . . . . . . . . 423--431

SIAM Journal on Discrete Mathematics
Volume 14, Number 4, 2001

                 Amir Daneshgar   Forcing Structures and Cliques in
                                  Uniquely Vertex Colorable Graphs . . . . 433--445
             Lynn M. Batten and   
                Jeremy M. Dover   Blocking Semiovals of Type $(1, m + 1, n
                                  + 1)$  . . . . . . . . . . . . . . . . . 446--457
               Steven S. Seiden   An Optimal Online Algorithm for Bounded
                                  Space Variable-Sized Bin Packing . . . . 458--470
             Tomás Feder   Classification of Homomorphisms to
                                  Oriented Cycles and of $k$-Partite
                                  Satisfiability . . . . . . . . . . . . . 471--480
                  Noga Alon and   
        Charles J. Colbourn and   
            Alan C. H. Ling and   
                   Martin Tompa   Equireplicate Balanced Binary Codes for
                                  Oligo Arrays . . . . . . . . . . . . . . 481--497
          Rainer E. Burkard and   
            Helidon Dollani and   
                  Yixun Lin and   
               Günter Rote   The Obnoxious Center Problem on a Tree   498--509
                Weiping Shi and   
                Douglas B. West   Structural Diagnosis of Wiring Networks:
                                  Finding Connected Components of Unknown
                                  Subgraphs  . . . . . . . . . . . . . . . 510--523
              G. Brightwell and   
                  G. Oriolo and   
                 F. B. Shepherd   Reserving Resilient Capacity in a
                                  Network  . . . . . . . . . . . . . . . . 524--539
                S. H. Huang and   
                    F. K. Hwang   When is Individual Testing Optimal for
                                  Nonadaptive Group Testing? . . . . . . . 540--548
               Po-Ning Chen and   
              Yunghsiang S. Han   Asymptotic Minimum Covering Radius of
                                  Block Codes  . . . . . . . . . . . . . . 549--564


SIAM Journal on Discrete Mathematics
Volume 15, Number 1, 2001

                 M. A. Fiol and   
                     E. Garriga   An Algebraic Characterization of
                                  Completely Regular Codes in
                                  Distance-Regular Graphs  . . . . . . . . 1--13
               T. Blackmore and   
                   G. H. Norton   Determining When the Absolute State
                                  Complexity of a Hermitian Code Achieves
                                  Its DLP Bound  . . . . . . . . . . . . . 14--40
          Michal Hanckowiak and   
            Michal Karonski and   
           Alessandro Panconesi   On the Distributed Complexity of
                                  Computing Maximal Matchings  . . . . . . 41--57
                  Noga Alon and   
              Benny Sudakov and   
                      Uri Zwick   Constructing Worst Case Instances for
                                  Semidefinite Programming Based
                                  Approximation Algorithms . . . . . . . . 58--72
                Danny Dolev and   
               Yuval Harari and   
              Nathan Linial and   
                 Noam Nisan and   
                  Michal Parnas   Neighborhood Preserving Hashing and
                                  Approximate Queries  . . . . . . . . . . 73--85
                      Hong Wang   On Covering a Bipartite Graph with
                                  Cycles . . . . . . . . . . . . . . . . . 86--96
    Alexander Z. Zelikovsky and   
                 Ion I. Mandoiu   Practical Approximation Algorithms for
                                  Zero- and Bounded-Skew Trees . . . . . . 97--111
          Jean-Paul Doignon and   
                 Samuel Fiorini   Facets of the Weak Order Polytope
                                  Derived from the Induced Partition
                                  Projection . . . . . . . . . . . . . . . 112--121
           Josselin Garnier and   
                   Leila Kallel   Efficiency of Local Search with Multiple
                                  Local Optima . . . . . . . . . . . . . . 122--141

SIAM Journal on Discrete Mathematics
Volume 15, Number 2, 2002

            Oleg V. Borodin and   
             Douglas R. Woodall   Cyclic Colorings of $3$-Polytopes with
                                  Large Maximum Face Size  . . . . . . . . 143--154
                 Alexander Barg   On Some Polynomials Related to Weight
                                  Enumerators of Linear Codes  . . . . . . 155--164
          Michel X. Goemans and   
          Maurice Queyranne and   
          Andreas S. Schulz and   
            Martin Skutella and   
                  Yaoguang Wang   Single Machine Scheduling with Release
                                  Dates  . . . . . . . . . . . . . . . . . 165--192
                Biing-Feng Wang   Finding a $2$-Core of a Tree in Linear
                                  Time . . . . . . . . . . . . . . . . . . 193--210
                  Noga Alon and   
            Michael Krivelevich   Testing $k$-colorability . . . . . . . . 211--227
               Iiro Honkala and   
                 Andrew Klapper   Multicovering Bounds from Relative
                                  Covering Radii . . . . . . . . . . . . . 228--234
              Sandi Klavzar and   
            Henry Martyn Mulder   Partial Cubes and Crossing Graphs  . . . 235--251
               Piotr Berman and   
           Bhaskar DasGupta and   
               S. Muthukrishnan   Exact Size of Binary Space Partitionings
                                  and Improved Rectangle Tiling Algorithms 252--267
   Hans-Jürgen Bandelt and   
                  Victor Chepoi   Graphs with Connected Medians  . . . . . 268--282

SIAM Journal on Discrete Mathematics
Volume 15, Number 3, 2002

                    Romeo Rizzi   Finding $1$-Factors in Bipartite Regular
                                  Graphs and Edge-Coloring Bipartite
                                  Graphs . . . . . . . . . . . . . . . . . 283--288
                    Kalle Ranto   Infinite Families of $3$-Designs from
                                  $Z_4$-Goethals Codes with Block Size $8$ 289--304
                Ding-Zhu Du and   
             Frank K. Hwang and   
                Xiaohua Jia and   
                    Hung Q. Ngo   Optimal Consecutive-$k$-out-of-$n$:
                                  ${G}$ Cycle for $n \leq 2 k +1$  . . . . 305--316
           Yaagoub A. Ashir and   
                Iain A. Stewart   Fault-Tolerant Embeddings of Hamiltonian
                                  Circuits in $k$-ary $n$-Cubes  . . . . . 317--328
Gérard Cornuéjols and   
                Bertrand Guenin   Ideal Binary Clutters, Connectivity, and
                                  a Conjecture of Seymour  . . . . . . . . 329--352
         Jitender S. Deogun and   
                 Dieter Kratsch   Dominating Pair Graphs . . . . . . . . . 353--366
                 Bruce Kitchens   Multidimensional Convolutional Codes . . 367--381
          Peter C. Fishburn and   
                 Paul E. Wright   Interference Patterns in Regular Graphs
                                  with Bijective Colorings . . . . . . . . 382--402
            Alexander Schrijver   Strong T-Perfection of Bad-$K_4$-Free
                                  Graphs . . . . . . . . . . . . . . . . . 403--415
                David Peleg and   
                   Avishai Wool   How to Be an Efficient Snoop, or the
                                  Probe Complexity of Quorum Systems . . . 416--433

SIAM Journal on Discrete Mathematics
Volume 15, Number 4, 2002

                 D. Kratsch and   
                     L. Stewart   Approximating Bandwidth by Mixing
                                  Layouts of Interval Graphs . . . . . . . 435--449
          Andreas S. Schulz and   
                Martin Skutella   Scheduling Unrelated Machines by
                                  Randomized Rounding  . . . . . . . . . . 450--469
                Eddie Cheng and   
                  Sven de Vries   On the Facet-Inducing Antiweb-Wheel
                                  Inequalities for Stable Set Polytopes    470--487
             Sun-Yuan Hsieh and   
                Chin-Wen Ho and   
             Tsan-Sheng Hsu and   
                Ming-Tat Ko and   
                  Gen-Huey Chen   Characterization of Efficiently Parallel
                                  Solvable Problems on Distance-Hereditary
                                  Graphs . . . . . . . . . . . . . . . . . 488--518
           Teresa W. Haynes and   
       Sandra M. Hedetniemi and   
      Stephen T. Hedetniemi and   
             Michael A. Henning   Domination in Graphs Applied to Electric
                                  Power Networks . . . . . . . . . . . . . 519--529
              Refael Hassin and   
              Shlomi Rubinstein   Robust Matchings . . . . . . . . . . . . 530--537
               Wei-Fan Wang and   
                     Ko-Wei Lih   Choosability and Edge Choosability of
                                  Planar Graphs without Intersecting
                                  Triangles  . . . . . . . . . . . . . . . 538--545
                     Joe Sawada   A Fast Algorithm for Generating
                                  Nonisomorphic Chord Diagrams . . . . . . 546--561
           Michael A. Steel and   
László A. Székely   Inverting Random Functions II: Explicit
                                  Bounds for Discrete Maximum Likelihood
                                  Estimation, with Applications  . . . . . 562--575


SIAM Journal on Discrete Mathematics
Volume 16, Number 1, 2002

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

SIAM Journal on Discrete Mathematics
Volume 16, Number 2, 2003

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

SIAM Journal on Discrete Mathematics
Volume 16, Number 3, 2003

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

SIAM Journal on Discrete Mathematics
Volume 16, Number 4, 2003

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


SIAM Journal on Discrete Mathematics
Volume 17, Number 1, 2003

               Amy N. Myers and   
                Herbert S. Wilf   Some New Aspects of the Coupon
                                  Collector's Problem  . . . . . . . . . . 1--17
            Walid Ben-Ameur and   
                   Eric Gourdin   Internet Routing and Related Topology
                                  Issues . . . . . . . . . . . . . . . . . 18--49
                  Eric Gottlieb   On the Homology of the $h$, $k$-Equal
                                  Dowling Lattice  . . . . . . . . . . . . 50--71
        Tibor Jordán and   
          Zoltán Szigeti   Detachments Preserving Local
                                  Edge-Connectivity of Graphs  . . . . . . 72--87
            Tibor Jordán   Constrained Edge-Splitting Problems  . . 88--102
          H. Tapia-Recillas and   
                        G. Vega   On $Z_2$ $k$-Linear and Quaternary Codes 103--113
              Benoit Larose and   
László Zádori   The Complexity of the Extendibility
                                  Problem for Finite Posets  . . . . . . . 114--121
      Jesús Mario Bilbao   Cooperative Games under Augmenting
                                  Systems  . . . . . . . . . . . . . . . . 122--133
               Ronald Fagin and   
                 Ravi Kumar and   
                   D. Sivakumar   Comparing Top $k$ Lists  . . . . . . . . 134--160
         Tomás Feder and   
                 Pavol Hell and   
                    Bojan Mohar   Acyclic Homomorphisms and Circular
                                  Colorings of Digraphs  . . . . . . . . . 161--169

SIAM Journal on Discrete Mathematics
Volume 17, Number 2, 2003

          Gitit Ruckenstein and   
                    Ron M. Roth   Bounds on the List-Decoding Radius of
                                  Reed--Solomon Codes  . . . . . . . . . . 171--195
                   Yuan Luo and   
                 Wende Chen and   
                A. J. Han Vinck   The Determination of the Chain Good
                                  Weight Hierarchies with High Dimension   196--209
                Xueliang Li and   
                   Lusheng Wang   Solutions for Two Conjectures on the
                                  Inverse Problem of the Wiener Index of
                                  Peptoids . . . . . . . . . . . . . . . . 210--218
         M. Cemil Azizouglu and   
          Ömer Eugeciouglu   Extremal Sets Minimizing
                                  Dimension-Normalized Boundary in Hamming
                                  Graphs . . . . . . . . . . . . . . . . . 219--236
           Moshe Lewenstein and   
               Maxim Sviridenko   A $5/8$ Approximation Algorithm for the
                                  Maximum Asymmetric TSP . . . . . . . . . 237--248
                     Shmuel Onn   Convex Matroid Optimization  . . . . . . 249--253
  André Barbé and   
             Fritz von Haeseler   Symmetric Codes over Rings . . . . . . . 254--263
               Wei-Fan Wang and   
                     Ko-Wei Lih   Labeling Planar Graphs with Conditions
                                  on Girth and Distance Two  . . . . . . . 264--275
              Navin Kashyap and   
                 Paul H. Siegel   Equalities among Capacities of
                                  $(d,k)$-Constrained Systems  . . . . . . 276--297
                  Navin Kashyap   Maximizing the Shannon Capacity of
                                  Constrained Systems with Two Constraints 298--319
            John P. Georges and   
                 David W. Mauro   On Regular Graphs Optimally Labeled with
                                  a Condition at Distance Two  . . . . . . 320--331
             Dieter Kratsch and   
            Ho\`ang-Oanh Le and   
          Haiko Müller and   
              Erich Prisner and   
                Dorothea Wagner   Additive Tree Spanners . . . . . . . . . 332--340

SIAM Journal on Discrete Mathematics
Volume 17, Number 3, 2004

    Andreas Brandstädt and   
                    Van Bang Le   Split-Perfect Graphs: Characterizations
                                  and Algorithmic Use  . . . . . . . . . . 341--360
  Gábor Bacsó and   
            Sylvain Gravier and   
András Gyárfás and   
linebreak Myriam Preissmann and   
             András Sebo   Coloring the Maximal Cliques of Graphs   361--376
           William D. Banks and   
       Alessandro Conflitti and   
            Igor E. Shparlinski   Number Theoretic Designs for Directed
                                  Regular Graphs of Small Diameter . . . . 377--383
             Christine T. Cheng   Improved Approximation Algorithms for
                                  the Demand Routing and Slotting Problem
                                  with Unit Demands on Rings . . . . . . . 384--402
             Stefanie Gerke and   
                Colin McDiarmid   Graph Imperfection with a Co-Site
                                  Constraint . . . . . . . . . . . . . . . 403--425
             Alexander Barg and   
            Gilles Zémor   Error Exponents of Expander Codes under
                                  Linear-Complexity Decoding . . . . . . . 426--445
                 W. R. Chen and   
                F. K. Hwang and   
                     Xuding Zhu   Equivalence of the $1$-Rate Model to the
                                  Classical Model on Strictly Nonblocking
                                  Switching Networks . . . . . . . . . . . 446--452
             Andrei Krokhin and   
              Peter Jeavons and   
                  Peter Jonsson   Constraint Satisfaction Problems on
                                  Intervals and Lengths  . . . . . . . . . 453--477
          Randall Dougherty and   
                    Vance Faber   The Degree-Diameter Problem for Several
                                  Varieties of Cayley Graphs I: The
                                  Abelian Case . . . . . . . . . . . . . . 478--519

SIAM Journal on Discrete Mathematics
Volume 17, Number 4, 2004

           Michele Flammini and   
Stéphane Pérenn\`es   Lower Bounds on the Broadcasting and
                                  Gossiping Time of Restricted Protocols   521--540
                  Luca Trevisan   On Local Versus Global Satisfiability    541--547
           Vu Dong Tô and   
          Reihaneh Safavi-Naini   On the Maximal Codes of Length $3$ with
                                  the $2$-Identifiable Parent Property . . 548--570
            H. A. Kierstead and   
                   Yingxian Zhu   Radius Three Trees in Graphs with Large
                                  Chromatic Number . . . . . . . . . . . . 571--581
             Moses Charikar and   
              Jon Kleinberg and   
                 Ravi Kumar and   
        Sridhar Rajagopalan and   
                 Amit Sahai and   
                 Andrew Tomkins   Minimizing Wirelength in Zero and
                                  Bounded Skew Clock Trees . . . . . . . . 582--595
                 Jack E. Graver   Encoding Fullerenes and Geodesic Domes   596--614
            Erik Ordentlich and   
                    Ron M. Roth   Independent Sets in Regular Hypergraphs
                                  and Multidimensional Runlength-Limited
                                  Constraints  . . . . . . . . . . . . . . 615--623
                Guy Kindler and   
                      Dan Romik   On Distributions Computable by Random
                                  Walks on Graphs  . . . . . . . . . . . . 624--633
           Nabil H. Mustafa and   
               Aleksandar Pekec   Listen to Your Neighbors: How (Not) to
                                  Reach a Consensus  . . . . . . . . . . . 634--660
             Francisco Barahona   Fractional Packing of ${T}$-Joins  . . . 661--669
               Valentino Crespi   Exact Formulae for the Lovász Theta
                                  Function of Sparse Circulant Graphs  . . 670--674
                C. R. Miers and   
                      F. Ruskey   Counting Strings with Given Elementary
                                  Symmetric Function Evaluations I:
                                  Strings over \boldmath $\mathbb{Z}_p$
                                  with $p$ Prime . . . . . . . . . . . . . 675--685


SIAM Journal on Discrete Mathematics
Volume 18, Number 1, 2004

           Bikash Kumar Dey and   
                B. Sundar Rajan   Codes Closed under Arbitrary Abelian
                                  Group of Permutations  . . . . . . . . . 1--18
              Ching-Chi Lin and   
                 Hsueh-I Lu and   
                      I-Fan Sun   Improved Compact Visibility
                                  Representation of Planar Graph via
                                  Schnyder's Realizer  . . . . . . . . . . 19--29
       Venkatesan Guruswami and   
                 Sanjeev Khanna   On the Hardness of $4$-Coloring a
                                  $3$-Colorable Graph  . . . . . . . . . . 30--40
                Harold N. Gabow   An Ear Decomposition Approach to
                                  Approximating the Smallest $3$-Edge
                                  Connected Spanning Subgraph of a
                                  Multigraph . . . . . . . . . . . . . . . 41--70
                C. R. Miers and   
                      F. Ruskey   Counting Strings with Given Elementary
                                  Symmetric Function Evaluations II:
                                  Circular Strings . . . . . . . . . . . . 71--82
                Lap Chi Lau and   
               Derek G. Corneil   Recognizing Powers of Proper Interval,
                                  Split, and Chordal Graphs  . . . . . . . 83--102
                  Frank H. Lutz   Small Examples of Nonconstructible
                                  Simplicial Balls and Spheres . . . . . . 103--109
         Akshay-Kumar Katta and   
                 Jay Sethuraman   A Note on Bandits with a Twist . . . . . 110--113
               Lars Engebretsen   The Nonapproximability of Non-Boolean
                                  Predicates . . . . . . . . . . . . . . . 114--129
               Mark Goresky and   
             Andrew Klapper and   
                  Ram Murty and   
               Igor Shparlinski   On Decimations of $\ell$-Sequences . . . 130--140
           Gabriel A. Schachtel   Exact Word-Run Statistics in Random
                                  Orderings  . . . . . . . . . . . . . . . 141--158
              Jurriaan Hage and   
                     Tero Harju   A Characterization of Acyclic Switching
                                  Classes of Graphs Using Forbidden
                                  Subgraphs  . . . . . . . . . . . . . . . 159--176
          L. Sunil Chandran and   
                 L. Shankar Ram   On the Number of Minimum Cuts in a Graph 177--194
                   V. Lozin and   
                  D. Rautenbach   On the Band-, Tree-, and Clique-Width of
                                  Graphs with Bounded Vertex Degree  . . . 195--206
            Alexander Ageev and   
                   Yinyu Ye and   
                   Jiawei Zhang   Improved Combinatorial Approximation
                                  Algorithms for the $k$-Level Facility
                                  Location Problem . . . . . . . . . . . . 207--217

SIAM Journal on Discrete Mathematics
Volume 18, Number 2, 2004

                    Uriel Feige   Approximating Maximum Clique by Removing
                                  Subgraphs  . . . . . . . . . . . . . . . 219--225
 Celina M. H. de Figueiredo and   
 Frédéric Maffray   Optimizing Bull-Free Perfect Graphs  . . 226--240
               Todd G. Will and   
                 Heather Hulett   Parsimonious Multigraphs . . . . . . . . 241--245
             Franco Saliola and   
                Walter Whiteley   Constraining Plane Configurations in
                                  CAD: Circles, Lines, and Angles in the
                                  Plane  . . . . . . . . . . . . . . . . . 246--271
                Sarnath Ramnath   Dynamic Digraph Connectivity Hastens
                                  Minimum Sum-of-Diameters Clustering  . . 272--286
              David Huygens and   
          Ali Ridha Mahjoub and   
                 Pierre Pesneau   Two Edge-Disjoint Hop-Constrained Paths
                                  and Polyhedra  . . . . . . . . . . . . . 287--312
                 Xiang-dong Hou   A Note on the Proof of Niho's Conjecture 313--319
                     Chi-Jen Lu   Deterministic Hypergraph Coloring and
                                  Its Applications . . . . . . . . . . . . 320--331
        Dariusz R. Kowalski and   
                   Andrzej Pelc   Faster Deterministic Broadcasting in Ad
                                  Hoc Radio Networks . . . . . . . . . . . 332--346
                 Yossi Azar and   
                   Leah Epstein   On-Line Load Balancing of Temporary
                                  Tasks on Identical Machines  . . . . . . 347--352
               Guantao Chen and   
               George Davis and   
                 Frank Hall and   
               Zhongshan Li and   
              Kinnari Patel and   
                Michael Stewart   An Interlacing Result on Normalized
                                  Laplacians . . . . . . . . . . . . . . . 353--361
                  Zvi Galil and   
             Jong Geun Park and   
                    Kunsoo Park   Three-Dimensional Periodicity and Its
                                  Application to Pattern Matching  . . . . 362--381
Patric R. J. Östergård and   
                Alexander Vardy   Resolving the Existence of Full-Rank
                                  Tilings of Binary Hamming Spaces . . . . 382--387
                    M. Cera and   
           A. Diánez and   
              A. Márquez   Extremal Graphs without Topological
                                  Complete Subgraphs . . . . . . . . . . . 388--396
   Christos A. Athanasiadis and   
                  Victor Reiner   Noncrossing Partitions for the Group
                                  $D_n$  . . . . . . . . . . . . . . . . . 397--417
            Pawel Hitczenko and   
                Carla D. Savage   On the Multiplicity of Parts in a Random
                                  Composition of a Large Integer . . . . . 418--435

SIAM Journal on Discrete Mathematics
Volume 18, Number 3, 2004

           Matthew Franklin and   
                      Moti Yung   Secure Hypergraphs: Privacy from Partial
                                  Broadcast  . . . . . . . . . . . . . . . 437--450
            Daniel Král'   Coloring Powers of Chordal Graphs  . . . 451--461
                Yi-Wu Chang and   
         Joan P. Hutchinson and   
        Michael S. Jacobson and   
                 Jeno Lehel and   
                Douglas B. West   The Bar Visibility Number of a Graph . . 462--471
          Michelle R. DeDeo and   
               Elinor Velasquez   The Radon Transform on $\mathbb{Z}_n^k$  472--478
     Ken-ichi Kawarabayashi and   
             Chris Stephens and   
                     Xiaoya Zha   Orientable and Nonorientable Genera for
                                  Some Complete Tripartite Graphs  . . . . 479--487
             Hadas Shachnai and   
             Aravind Srinivasan   Finding Large Independent Sets in Graphs
                                  and Hypergraphs  . . . . . . . . . . . . 488--500
            Erik D. Demaine and   
             Fedor V. Fomin and   
  Mohammad Taghi Hajiaghayi and   
          Dimitrios M. Thilikos   Bidimensional Parameters and Local
                                  Treewidth  . . . . . . . . . . . . . . . 501--511
             Frank K. Hwang and   
              Uriel G. Rothblum   Partition-Optimization with Schur Convex
                                  Sum Objective Functions  . . . . . . . . 512--524
                   Marek Janata   Matroids Induced by Packing Subgraphs    525--541
       Michael O. Albertson and   
      Alexandr V. Kostochka and   
                Douglas B. West   Precoloring Extensions of Brooks'
                                  Theorem  . . . . . . . . . . . . . . . . 542--553
                 Pavol Hell and   
                     Jing Huang   Certifying LexBFS Recognition Algorithms
                                  for Proper Interval Graphs and Proper
                                  Interval Bigraphs  . . . . . . . . . . . 554--570
    Chính T. Ho\`ang and   
                     Bruce Reed   On the Co-$P_3$-Structure of Perfect
                                  Graphs . . . . . . . . . . . . . . . . . 571--576
         Gregory M. Constantine   Edge-Disjoint Isomorphic Multicolored
                                  Trees and Cycles in Complete Graphs  . . 577--580
          Balázs Fleiner   Detachment of Vertices of Graphs
                                  Preserving Edge-Connectivity . . . . . . 581--591
                Maxim Vsemirnov   Automorphisms of Projective Spaces and
                                  Min-Wise Independent Sets of
                                  Permutations . . . . . . . . . . . . . . 592--607
                 C. Chekuri and   
                  S. Khanna and   
                    J. Naor and   
                       L. Zosin   A Linear Programming Formulation and
                                  Approximation Algorithms for the Metric
                                  Labeling Problem . . . . . . . . . . . . 608--625
              Paul F. Dietz and   
           Joel I. Seiferas and   
                       Ju Zhang   A Tight Lower Bound for Online Monotonic
                                  List Labeling  . . . . . . . . . . . . . 626--637
                 Jim Geelen and   
        Petr Hlinený and   
                  Geoff Whittle   Bridging Separations in Matroids . . . . 638--646
                      E. Swartz   Lower Bounds for $h$-Vectors of $k$-CM,
                                  Independence, and Broken Circuit
                                  Complexes  . . . . . . . . . . . . . . . 647--661

SIAM Journal on Discrete Mathematics
Volume 18, Number 4, 2005

                 Gennian Ge and   
                  Ying Miao and   
                     Lihua Wang   Combinatorial Constructions for Optimal
                                  Splitting Authentication Codes . . . . . 663--678
           J. C. M. Janssen and   
             T. E. Wentzell and   
              S. L. Fitzpatrick   Lower Bounds from Tile Covers for the
                                  Channel Assignment Problem . . . . . . . 679--696
                  Noga Alon and   
                     Vera Asodi   Learning a Hidden Subgraph . . . . . . . 697--712
              Peter Keevash and   
                  Benny Sudakov   Set Systems with Restricted
                                  Cross-Intersections and the Minimum Rank
                                  of Inclusion Matrices  . . . . . . . . . 713--727
               Colin Cooper and   
                    Alan Frieze   The Cover Time of Random Regular Graphs  728--740
                Wensong Chu and   
        Charles J. Colbourn and   
              Solomon W. Golomb   A Recursive Construction For Regular
                                  Difference Triangle Sets . . . . . . . . 741--748
                S. Muñoz   On Identifying Maximal Covers  . . . . . 749--768
                       I. Gaber   Minimal-Time $k$-Line Broadcasting . . . 769--777
             Bostjan Bresar and   
            Wilfried Imrich and   
              Sandi Klavzar and   
                    Blaz Zmazek   Hypercubes As Direct Products  . . . . . 778--786
                 Seth Sullivant   Small Contingency Tables with Large Gaps 787--793
           Joseph Callaghan and   
           John J. Chew III and   
               Stephen M. Tanny   On the Behavior of a Family of
                                  Meta-Fibonacci Sequences . . . . . . . . 794--824
                  Tero Laihonen   On Optimal Edge-Robust and Vertex-Robust
                                  $(1,\leq l)$-Identifying Codes . . . . . 825--834
         Katharina T. Huber and   
            Vincent Moulton and   
                     Mike Steel   Four Characters Suffice to Convexly
                                  Define a Phylogenetic Tree . . . . . . . 835--843
              Yael Ben-Haim and   
                    Tuvi Etzion   On the Optimality of Coloring with a
                                  Lattice  . . . . . . . . . . . . . . . . 844--878


SIAM Journal on Discrete Mathematics
Volume 19, Number 1, 2005

                Harold N. Gabow   An Improved Analysis for Approximating
                                  the Smallest $k$-Edge Connected Spanning
                                  Subgraph of a Multigraph . . . . . . . . 1--18
             Michael Drmota and   
               Hsien-Kuei Hwang   Bimodality and Phase Transitions in the
                                  Profile Variance of Random Binary Search
                                  Trees  . . . . . . . . . . . . . . . . . 19--45
               Gunnar Forst and   
                  Anders Thorup   What Costs Are Minimized by Huffman
                                  Trees? . . . . . . . . . . . . . . . . . 46--68
              Yael Ben-Haim and   
                   Simon Litsyn   Exact Minimum Density of Codes
                                  Identifying Vertices in the Square Grid  69--82
            A. V. Kostochka and   
               K. Nakprasit and   
                S. V. Pemmaraju   On Equitable Coloring of $d$-Degenerate
                                  Graphs . . . . . . . . . . . . . . . . . 83--95
           Eyal Kushilevitz and   
                 Yishay Mansour   Computation in Noisy Radio Networks  . . 96--108
               Marc Chardon and   
                   Aziz Moukrim   The Coffman--Graham Algorithm Optimally
                                  Solves UET Task Systems with
                                  Overinterval Orders  . . . . . . . . . . 109--121
             Gabriel Robins and   
           Alexander Zelikovsky   Tighter Bounds for Graph Steiner Tree
                                  Approximation  . . . . . . . . . . . . . 122--134
     Tomás Dvorák   Hamiltonian Cycles with Prescribed Edges
                                  in Hypercubes  . . . . . . . . . . . . . 135--144
                 Sylvia Encheva   On Projective Codes Satisfying the Chain
                                  Condition  . . . . . . . . . . . . . . . 145--148
             Robert W. Chen and   
                  Alan Zame and   
              Chien-Tai Lin and   
                    Hsiu-fen Wu   A Random Version of Shepp's Urn Scheme   149--164
              James A. Muir and   
             Douglas R. Stinson   Alternative Digit Sets for Nonadjacent
                                  Representations  . . . . . . . . . . . . 165--191
                    Peter Brass   An Upper Bound for the $d$-Dimensional
                                  Analogue of Heilbronn's Triangle Problem 192--195
              Rongquan Feng and   
                Jin Ho Kwak and   
                 Young Soo Kwon   Enumerating Typical Circulant Covering
                                  Projections Onto a Circulant Graph . . . 196--207
            John P. Georges and   
                 David W. Mauro   On the Structure of Graphs with
                                  Non-Surjective $L(2,1)$-Labelings  . . . 208--223
            A. J. Radcliffe and   
                A. D. Scott and   
                   E. L. Wilmer   Reversals and Transpositions Over Finite
                                  Alphabets  . . . . . . . . . . . . . . . 224--244
             Sanjeev Khanna and   
        Joseph (Seffi) Naor and   
              F. Bruce Shepherd   Directed Network Design with Orientation
                                  Constraints  . . . . . . . . . . . . . . 245--257
                Amos Beimel and   
                    Yuval Ishai   On the Power of Nonlinear Secret-Sharing 258--280

SIAM Journal on Discrete Mathematics
Volume 19, Number 2, 2005

         Daphne Der-Fen Liu and   
                     Xuding Zhu   Circular Distance Two Labeling and the
                                  $\lambda$-Number for Outerplanar Graphs  281--293
             Roel Apfelbaum and   
                   Micha Sharir   Repeated Angles in Three and Four
                                  Dimensions . . . . . . . . . . . . . . . 294--300
            Don Coppersmith and   
               Moshe Lewenstein   Constructive Bounds on Ordered
                                  Factorizations . . . . . . . . . . . . . 301--303
               Satoru Iwata and   
        S. Thomas McCormick and   
                  Maiko Shigeno   A Strongly Polynomial Cut Canceling
                                  Algorithm for Minimum Cost Submodular
                                  Flow . . . . . . . . . . . . . . . . . . 304--320
         Panu Chaichanavong and   
                Brian H. Marcus   Stabilization of Block-Type-Decodability
                                  Properties for Constrained Systems . . . 321--344
             Tsan-Sheng Hsu and   
                  Ming-Yang Kao   Optimal Augmentation for Bipartite
                                  Componentwise Biconnectivity in Linear
                                  Time . . . . . . . . . . . . . . . . . . 345--362
           Iliya Bouyukliev and   
    Patric R. J. Östergard   Classification of Self-Orthogonal Codes
                                  over \boldmath $\F_3$ and \boldmath
                                  $\F_4$ . . . . . . . . . . . . . . . . . 363--370
         Alexander Burstein and   
                  Sergey Kitaev   On Unavoidable Sets of Word Patterns . . 371--381
              Carlos J. Luz and   
            Alexander Schrijver   A Convex Quadratic Characterization of
                                  the Lovász Theta Number . . . . . . . . . 382--387
                Jin Ho Kwak and   
          Alexander Mednykh and   
               Valery Liskovets   Enumeration of Branched Coverings of
                                  Nonorientable Surfaces With Cyclic
                                  Branch Points  . . . . . . . . . . . . . 388--398
                Sean Curran and   
                Orlando Lee and   
                    Xingxing Yu   Nonseparating Planar Chains in
                                  $4$-Connected Graphs . . . . . . . . . . 399--419
                      L. Ji and   
                         L. Zhu   Resolvable Steiner Quadruple Systems for
                                  the Last $23$ Orders . . . . . . . . . . 420--430
              Apurva Mudgal and   
                Craig Tovey and   
              Sam Greenberg and   
                    Sven Koenig   Bounds on the Travel Cost of a Mars
                                  Rover Prototype Search Heuristic . . . . 431--447
            Stephen Alstrup and   
               Philip Bille and   
                    Theis Rauhe   Labeling Schemes for Small Distances in
                                  Trees  . . . . . . . . . . . . . . . . . 448--462
              Philip Daniel and   
                 Charles Semple   A Class of General Supertree Methods for
                                  Nested Taxa  . . . . . . . . . . . . . . 463--480
              Mart de Graaf and   
                   Paul Valiant   Polynomial Representations of Symmetric
                                  Partial Boolean Functions  . . . . . . . 481--488
      Péter L. Erdos and   
  Zoltán Füredi and   
             Gyula O. H. Katona   Two-Part and $k$-Sperner Families: New
                                  Proofs Using Permutations  . . . . . . . 489--500
                    Hande Yaman   Polyhedral Analysis for the
                                  Uncapacitated Hub Location Problem with
                                  Modular Arc Capacities . . . . . . . . . 501--522
        Jean-Claude Bermond and   
        Charles J. Colbourn and   
              David Coudert and   
                 Gennian Ge and   
            Alan C. H. Ling and   
            Xavier Muñoz   Traffic Grooming in Unidirectional
                                  Wavelength-Division Multiplexed Rings
                                  with Grooming Ratio $C = 6$  . . . . . . 523--542

SIAM Journal on Discrete Mathematics
Volume 19, Number 3, 2005

         Tomás Feder and   
                    Carlos Subi   Disks on a Tree: Analysis of a
                                  Combinatorial Game . . . . . . . . . . . 543--552
Frédéric Maffray and   
              Nicolas Trotignon   Algorithms for Perfectly Contractile
                                  Graphs . . . . . . . . . . . . . . . . . 553--574
              Mohamed Didi Biha   On the $3$-Terminal Cut Polyhedron . . . 575--587
          Jirí Fiala and   
        Daniel Král' and   
               Riste Skrekovski   A Brooks-Type Theorem for the
                                  Generalized List T-Coloring  . . . . . . 588--609
         Daphne Der-Fen Liu and   
                     Xuding Zhu   Multilevel Distance Labelings for Paths
                                  and Cycles . . . . . . . . . . . . . . . 610--621
           Grzegorz Kubicki and   
                 Michal Morayne   Graph-Theoretic Generalization of the
                                  Secretary Problem: The Directed Path
                                  Case . . . . . . . . . . . . . . . . . . 622--632
                  Jakob Jonsson   Simplicial Complexes of Graphs and
                                  Hypergraphs with a Bounded Covering
                                  Number . . . . . . . . . . . . . . . . . 633--650
              David A. Pike and   
                       Yubo Zou   Decycling Cartesian Products of Two
                                  Cycles . . . . . . . . . . . . . . . . . 651--663
                  Petteri Kaski   Isomorph-Free Exhaustive Generation of
                                  Designs with Prescribed Groups of
                                  Automorphisms  . . . . . . . . . . . . . 664--690
                    Marcel Wild   The Asymptotic Number of Binary Codes
                                  and Binary Matroids  . . . . . . . . . . 691--699
              Joel Friedman and   
            Jean-Pierre Tillich   Generalized Alon--Boppana Theorems and
                                  Error-Correcting Codes . . . . . . . . . 700--718
                Alan Frieze and   
        Michael Krivelevich and   
                  Benny Sudakov   The Strong Chromatic Index of Random
                                  Graphs . . . . . . . . . . . . . . . . . 719--727
            Marcus Schaefer and   
             Daniel Stefankovic   Solvability of Graph Inequalities  . . . 728--743
           Dennis J. Brueni and   
               Lenwood S. Heath   The PMU Placement Problem  . . . . . . . 744--761
          Reuven Bar-Yehuda and   
                    Dror Rawitz   On the Equivalence between the
                                  Primal-Dual Schema and the Local Ratio
                                  Technique  . . . . . . . . . . . . . . . 762--797
                  Dion Gijswijt   Integer Decomposition for Polyhedra
                                  Defined by Nearly Totally Unimodular
                                  Matrices . . . . . . . . . . . . . . . . 798--806
              Lowell Abrams and   
           Donniell E. Fishkind   A Genus Bound for Digital Image
                                  Boundaries . . . . . . . . . . . . . . . 807--813

SIAM Journal on Discrete Mathematics
Volume 19, Number 4, 2005

           Faith Ellen Fich and   
  André Kündgen and   
       Michael J. Pelsmajer and   
             Radhika Ramamurthi   Graph Minors and Reliable Single Message
                                  Transmission . . . . . . . . . . . . . . 815--847
                Sean Curran and   
                Orlando Lee and   
                    Xingxing Yu   Chain Decompositions of $4$-Connected
                                  Graphs . . . . . . . . . . . . . . . . . 848--880
              Michael Elkin and   
                   Guy Kortsarz   Polylogarithmic Additive
                                  Inapproximability of the Radio Broadcast
                                  Problem  . . . . . . . . . . . . . . . . 881--899
            Pinar Heggernes and   
             Jan Arne Telle and   
                Yngve Villanger   Computing Minimal Triangulations in Time
                                  $O(n^{\alpha} \log n) = o(n^{2.376})$    900--913
          Jaroslav Nesetril and   
                  Claude Tardif   Short Answers to Exponentially Long
                                  Questions: Extremal Aspects of
                                  Homomorphism Duality . . . . . . . . . . 914--920
              Navin Kashyap and   
             Paul H. Siegel and   
                Alexander Vardy   An Application of Ramsey Theory to
                                  Coding for the Optical Channel . . . . . 921--937
             Susanne Albers and   
                     Helge Bals   Dynamic TCP Acknowledgment: Penalizing
                                  Long Delays  . . . . . . . . . . . . . . 938--951
                J. I. Brown and   
               R. J. Nowakowski   Well-Covered Vector Spaces of Graphs . . 952--965
               L. Khachiyan and   
                   E. Boros and   
              K. Elbassioni and   
                 V. Gurvich and   
                      K. Makino   On the Complexity of Some Enumeration
                                  Problems for Matroids  . . . . . . . . . 966--984
                   Sanming Zhou   Labelling Cayley Graphs on Abelian
                                  Groups . . . . . . . . . . . . . . . . . 985--1003
               Fabio Scarabotti   The Discrete Sine Transform and the
                                  Spectrum of the Finite $q$-ary Tree  . . 1004--1010
                   San Ling and   
            Ferruh Özbudak   Improved $p$-ary Codes and Sequence
                                  Families from Galois Rings of
                                  Characteristic p2  . . . . . . . . . . . 1011--1028
Béla Bollobás and   
            Don Coppersmith and   
                  Michael Elkin   Sparse Distance Preservers and Additive
                                  Spanners . . . . . . . . . . . . . . . . 1029--1055
             Ioana Dumitriu and   
                   Joel Spencer   The Two-Batch Liar Game over an
                                  Arbitrary Channel  . . . . . . . . . . . 1056--1064
           Satoru Fujishige and   
                   Satoru Iwata   Bisubmodular Function Minimization . . . 1065--1073


SIAM Journal on Discrete Mathematics
Volume 20, Number 1, January, 2006

          Andrzej Czygrinow and   
                 Glenn Hurlbert   Girth, Pebbling, and Grid Thresholds . . 1--10
             Michael Joswig and   
                Marc E. Pfetsch   Computing Optimal Morse Matchings  . . . 11--25
               Volkan Isler and   
             Sampath Kannan and   
                 Sanjeev Khanna   Randomized Pursuit-Evasion with Local
                                  Visibility . . . . . . . . . . . . . . . 26--41
           Michele Conforti and   
Gérard Cornuéjols and   
                Xinming Liu and   
          Kristina Vuskovic and   
               Giacomo Zambelli   Odd Hole Recognition in Graphs of
                                  Bounded Clique Size  . . . . . . . . . . 42--48
            Maria Axenovich and   
                    Ryan Martin   Avoiding Patterns in Matrices Via a
                                  Small Number of Changes  . . . . . . . . 49--54
      Zdenvek Dvorák and   
               Riste Skrekovski   A Theorem About a Contractible and Light
                                  Edge . . . . . . . . . . . . . . . . . . 55--61
          Daniela Kühn and   
                   Deryk Osthus   Improved Bounds for Topological Cliques
                                  in Graphs of Large Girth . . . . . . . . 62--78
               Wakaha Ogata and   
             Kaoru Kurosawa and   
             Douglas R. Stinson   Optimum Secret Sharing Scheme Secure
                                  against Cheating . . . . . . . . . . . . 79--95
                 Yusheng Li and   
                     Wenan Zang   Differential Methods for Finding
                                  Independent Sets in Hypergraphs  . . . . 96--104
           Derek G. Corneil and   
       Ekkehard Köhler and   
             Stephan Olariu and   
                  Lorna Stewart   Linear Orderings of Subfamilies of
                                  AT-Free Graphs . . . . . . . . . . . . . 105--118
            Chandra Chekuri and   
               Anupam Gupta and   
                Ilan Newman and   
            Yuri Rabinovich and   
              Alistair Sinclair   Embedding $k$-Outerplanar Graphs into
                                  $\ell_1$ . . . . . . . . . . . . . . . . 119--136
                      Noga Alon   Ranking Tournaments  . . . . . . . . . . 137--142
             Nicholas Pippenger   The Linking Probability of Deep
                                  Spider-Web Networks  . . . . . . . . . . 143--159
                 Michael Dinitz   Full Rank Tilings of Finite Abelian
                                  Groups . . . . . . . . . . . . . . . . . 160--170
                Paolo Dulio and   
         Richard J. Gardner and   
                     Carla Peri   Discrete Point X-rays  . . . . . . . . . 171--188
                E. de Klerk and   
                 J. Maharry and   
            D. V. Pasechnik and   
              R. B. Richter and   
                     G. Salazar   Improved Bounds for the Crossing Numbers
                                  of $K_{m,n}$ and $K_n$ . . . . . . . . . 189--202
   János Körner and   
              Claudia Malvenuto   Pairwise colliding permutations and the
                                  capacity of infinite graphs  . . . . . . 203--212
                   Kazuo Murota   $M$-Convex Functions on Jump Systems: a
                                  General Framework for Minsquare Graph
                                  Factor Problem . . . . . . . . . . . . . 213--226
             Andreas Alpers and   
                Peter Gritzmann   On Stability, Error Correction, and
                                  Noise Compensation in Discrete
                                  Tomography . . . . . . . . . . . . . . . 227--239
           Feodor F. Dragan and   
                 Chenyu Yan and   
                Irina Lomonosov   Collective tree spanners of graphs . . . 240--260
            Chandra Chekuri and   
               Sudipto Guha and   
            Joseph (Seffi) Naor   The Steiner $k$-Cut Problem  . . . . . . 261--271

SIAM Journal on Discrete Mathematics
Volume 20, Number 2, January, 2006

          Daniela Kühn and   
                   Deryk Osthus   Multicolored Hamilton Cycles and Perfect
                                  Matchings in Pseudorandom Graphs . . . . 273--286
              Hong-Bin Chen and   
                 Frank K. Hwang   On Multicast Rearrangeable $3$-stage
                                  Clos Networks Without First-Stage
                                  Fan-Out  . . . . . . . . . . . . . . . . 287--290
             Tomás Feder   A Dichotomy Theorem on Fixed Points of
                                  Several Nonexpansive Mappings  . . . . . 291--301
          Jerrold R. Griggs and   
             Xiaohua Teresa Jin   Real Number Graph Labellings with
                                  Distance Conditions  . . . . . . . . . . 302--327
               Paul W. Goldberg   A Bound on the Precision Required to
                                  Estimate a Boolean Perceptron from Its
                                  Average Satisfying Assignment  . . . . . 328--343
                Drago Bokal and   
              Gasper Fijavz and   
                    Bojan Mohar   The Minor Crossing Number  . . . . . . . 344--356
            Erik D. Demaine and   
   MohammadTaghi Hajiaghayi and   
          Dimitrios M. Thilikos   The Bidimensional Theory of
                                  Bounded-Genus Graphs . . . . . . . . . . 357--371
         Tomás Feder and   
                    Daniel Ford   Classification of Bipartite Boolean
                                  Constraint Satisfaction through
                                  Delta-Matroid Intersection . . . . . . . 372--394
                  Fan Chung and   
                     Linyuan Lu   The Volume of the Giant Component of a
                                  Random Graph with Given Expected Degrees 395--411
             Prosenjit Bose and   
                Luc Devroye and   
              William Evans and   
              David Kirkpatrick   On the Spanning Ratio of Gabriel Graphs
                                  and beta-Skeletons . . . . . . . . . . . 412--427
          Peter C. Fishburn and   
                Fred S. Roberts   Full Color Theorems for
                                  $L(2,1)$-Colorings . . . . . . . . . . . 428--443
              Hristo N. Djidjev   A Linear-Time Algorithm for Finding a
                                  Maximal Planar Subgraph  . . . . . . . . 444--462
            Don Coppersmith and   
                  Michael Elkin   Sparse Sourcewise and Pairwise Distance
                                  Preservers . . . . . . . . . . . . . . . 463--501
               Maik Weinard and   
                Georg Schnitger   On the Greedy Superstring Conjecture . . 502--522
               Shlomo Hoory and   
                 Stefan Szeider   A Note on Unsatisfiable $k$-CNF Formulas
                                  with Few Occurrences per Variable  . . . 523--528
                  Landon Rabern   On Graph Associations  . . . . . . . . . 529--535
        Daniel Král' and   
           Riste Skrekovski and   
                  Martin Tancer   Construction of Large Graphs with No
                                  Optimal Surjective $L(2,1)$-Labelings    536--543

SIAM Journal on Discrete Mathematics
Volume 20, Number 3, January, 2006

               Klaus Jansen and   
                Lorant Porkolab   On Preemptive Resource Constrained
                                  Scheduling: Polynomial-Time
                                  Approximation Schemes  . . . . . . . . . 545--563
                  S. Akbari and   
                 A. Alipour and   
                   H. L. Fu and   
                       Y. H. Lo   Multicolored Parallelisms of Isomorphic
                                  Spanning Trees . . . . . . . . . . . . . 564--567
                    Hong Xu and   
                    Wen-Feng Qi   Autocorrelations of Maximum Period FCSR
                                  Sequences  . . . . . . . . . . . . . . . 568--577
                 Jim Geelen and   
                 Xiangqian Zhou   A Splitter Theorem for Internally
                                  $4$-Connected Binary Matroids  . . . . . 578--587
                 Jim Geelen and   
               Bert Gerards and   
                  Geoff Whittle   Matroid $T$-Connectivity . . . . . . . . 588--596
                 Ion Gorgos and   
    Chính T. Ho\`ang and   
                Vitaly Voloshin   A Note on Quasi-triangulated Graphs  . . 597--602
                     Jun Ma and   
                   Liqun Pu and   
                       Hao Shen   Cycle Decompositions of $K_{n,n} - I$    603--609
                      Dan Romik   Shortest Paths in the Tower of Hanoi
                                  Graph and Finite Automata  . . . . . . . 610--622
         József Solymosi   Dense Arrangements are Locally Very
                                  Dense. I . . . . . . . . . . . . . . . . 623--627
               Ronald Fagin and   
                 Ravi Kumar and   
           Mohammad Mahdian and   
               D. Sivakumar and   
                       Erik Vee   Comparing Partial Rankings . . . . . . . 628--648
              Emanuele Munarini   A Combinatorial Interpretation of the
                                  Chebyshev Polynomials  . . . . . . . . . 649--655
                Kangmin Fan and   
           Simon J. Puglisi and   
                W. F. Smyth and   
                  Andrew Turpin   A New Periodicity Lemma  . . . . . . . . 656--668
               Atif Abueida and   
                   R. Sritharan   Cycle Extendability and Hamiltonian
                                  Cycles in Chordal Graph Classes  . . . . 669--681
               Guantao Chen and   
           Ralph J. Faudree and   
            Ronald J. Gould and   
            Michael S. Jacobson   Cycle Extendability of Hamiltonian
                                  Interval Graphs  . . . . . . . . . . . . 682--689
            Daniel Král'   The Channel Assignment Problem with
                                  Variable Weights . . . . . . . . . . . . 690--704
                Marta Arias and   
            Lenore J. Cowen and   
              Kofi A. Laing and   
         Rajmohan Rajaraman and   
                    Orjeta Taka   Compact Routing with Name Independence   705--726
              Irit Gat-Viks and   
            Richard M. Karp and   
                 Ron Shamir and   
                   Roded Sharan   Reconstructing Chain Functions in
                                  Genetic Networks . . . . . . . . . . . . 727--740
            Maria Axenovich and   
                    Ryan Martin   On the Strong Chromatic Number of Graphs 741--747
             Sofia Kovaleva and   
           Frits C. R. Spieksma   Approximation Algorithms for Rectangle
                                  Stabbing and Interval Stabbing Problems  748--768
               Kevin Milans and   
                    Bryan Clark   The Complexity of Graph Pebbling . . . . 769--798
                 F. M. Dong and   
                      K. M. Koh   On Graphs Having No Chromatic Zeros in
                                  $(1,2)$  . . . . . . . . . . . . . . . . 799--810

SIAM Journal on Discrete Mathematics
Volume 20, Number 4, January, 2006

                 Manuel Lladser   Uniform Formulae for Coefficients of
                                  Meromorphic Functions in Two Variables.
                                  Part I . . . . . . . . . . . . . . . . . 811--828
            Ronald J. Gould and   
         Alexandr Kostochka and   
                       Gexin Yu   On Minimum Degree Implying That a Graph
                                  is $H$-Linked  . . . . . . . . . . . . . 829--840
      Anxiao (Andrew) Jiang and   
               Matthew Cook and   
                 Jehoshua Bruck   Optimal Interleaving on Tori . . . . . . 841--879
      Alpár Jüttner   On Budgeted Optimization Problems  . . . 880--892
                 Samuel Fiorini   $0, 1/2$-Cuts and the Linear Ordering
                                  Problem: Surfaces That Define Facets . . 893--912
                 C. Gentile and   
                 P. Ventura and   
                  R. Weismantel   Mod-$2$ Cuts Generation Yields the
                                  Convex Hull of Bounded Integer Feasible
                                  Sets . . . . . . . . . . . . . . . . . . 913--919
     Sándor Szabó   Factoring Finite Abelian Groups by
                                  Subsets with Maximal Span  . . . . . . . 920--931
        Omer Giménez and   
        Petr Hlin ný and   
                       Marc Noy   Computing the Tutte Polynomial on Graphs
                                  of Bounded Clique-Width  . . . . . . . . 932--946
    E. Martínez-Moro and   
               I. F. Rúa   Multivariable Codes Over Finite Chain
                                  Rings: Serial Codes  . . . . . . . . . . 947--959
                  Martin Klazar   On Identities Concerning the Numbers of
                                  Crossings and Nestings of Two Edges in
                                  Matchings  . . . . . . . . . . . . . . . 960--976
          Santosh N. Kabadi and   
              Abraham P. Punnen   On cost matrices with two and three
                                  distinct values of Hamiltonian paths and
                                  cycles . . . . . . . . . . . . . . . . . 977--998
                John Little and   
                    Hal Schenck   Toric Surface Codes and Minkowski Sums   999--1014
                   Leah Epstein   Online Bin Packing with Cardinality
                                  Constraints  . . . . . . . . . . . . . . 1015--1030
              Peter Keevash and   
               Dhruv Mubayi and   
              Richard M. Wilson   Set Systems with No Singleton
                                  Intersection . . . . . . . . . . . . . . 1031--1041
                 Jim Geelen and   
             Peter J. Humphries   Rota's Basis Conjecture for Paving
                                  Matroids . . . . . . . . . . . . . . . . 1042--1045
        Carles Padró and   
                 Ignacio Gracia   Representing Small Identically Self-Dual
                                  Matroids by Self-Dual Codes  . . . . . . 1046--1055
    Sándor P. Fekete and   
       Ekkehard Köhler and   
              Jürgen Teich   Higher-Dimensional Packing with Order
                                  Constraints  . . . . . . . . . . . . . . 1056--1078


SIAM Journal on Discrete Mathematics
Volume 21, Number 1, 2007

         Oktay Günlük   A New Min-Cut Max-Flow Ratio for
                                  Multicommodity Flows . . . . . . . . . . 1--15
                      J. Sawada   A Simple Gray Code to List All Minimal
                                  Signed Binary Representations  . . . . . 16--25
         Bo\vstjan Bre\vsar and   
                Sandi Klav\vzar   Crossing Graphs as Joins of Graphs and
                                  Cartesian Products of Median Graphs  . . 26--32
              Stephan G. Wagner   Correlation of Graph-Theoretical Indices 33--46
                   S. Barik and   
                    S. Pati and   
                    B. K. Sarma   The Spectrum of the Corona of Two Graphs 47--56
          Josep Díaz and   
             Dieter Mitsche and   
            Xavier Pérez   Sharp Threshold for Hamiltonicity of
                                  Random Geometric Graphs  . . . . . . . . 57--65
                  Noga Alon and   
                 Anja Krech and   
             Tibor Szabó   Turán's Theorem in the Hypercube  . . . . 66--72
            Christian Avart and   
          Vojt ch Rödl and   
                Mathias Schacht   Every Monotone $3$-Graph Property is
                                  Testable . . . . . . . . . . . . . . . . 73--92
               Richard Cole and   
              ukasz Kowalik and   
             Riste \vSkrekovski   A Generalization of Kotzig's Theorem and
                                  Its Application  . . . . . . . . . . . . 93--106
           Yusuke Kobayashi and   
               Kazuo Murota and   
              Ken'ichiro Tanaka   Operations on $M$-Convex Functions on
                                  Jump Systems . . . . . . . . . . . . . . 107--129
                   Anna de Mier   A Natural Family of Flag Matroids  . . . 130--140
            Amitabha Bagchi and   
          Amitabh Chaudhary and   
       Christian Scheideler and   
                    Petr Kolman   Algorithms for Fault-Tolerant Routing in
                                  Circuit-Switched Networks  . . . . . . . 141--157
    Miroslav Chlebík and   
 Janka Chlebíková   The Complexity of Combinatorial
                                  Optimization Problems on $d$-Dimensional
                                  Boxes  . . . . . . . . . . . . . . . . . 158--169
                    Ian D. Gray   Vertex-Magic Total Labelings of Regular
                                  Graphs . . . . . . . . . . . . . . . . . 170--177
         Bernd Gärtner and   
                  Volker Kaibel   Two New Bounds for the Random-Edge
                                  Simplex-Algorithm  . . . . . . . . . . . 178--190
  Imre Bárány and   
       Ji\vrí Matou\vsek   Quadratically Many Colorful Simplices    191--198
           Ramesh Neelamani and   
               Sanjeeb Dash and   
            Richard G. Baraniuk   On Nearly Orthogonal Lattice Bases and
                                  Random Lattices  . . . . . . . . . . . . 199--219
            Matthias Köppe   A Primal Barvinok Algorithm Based on
                                  Irrational Decompositions  . . . . . . . 220--236
             P. N. Balister and   
              E. Györi and   
                   J. Lehel and   
                   R. H. Schelp   Adjacent Vertex Distinguishing
                                  Edge-Colorings . . . . . . . . . . . . . 237--250
                C. Balbuena and   
P. García--Vázquez   On the Minimum Order of Extremal Graphs
                                  to have a Prescribed Girth . . . . . . . 251--257
                   Margit Voigt   Precoloring Extension for $2$-connected
                                  Graphs . . . . . . . . . . . . . . . . . 258--263
            Maria Axenovich and   
           József Balogh   Graphs Having Small Number of Sizes on
                                  Induced $k$-Subgraphs  . . . . . . . . . 264--272

SIAM Journal on Discrete Mathematics
Volume 21, Number 2, 2007

           Michele Conforti and   
                   Bert Gerards   Packing Odd Circuits . . . . . . . . . . 273--302
                  Tamon Stephen   A Majorization Bound for the Eigenvalues
                                  of Some Graph Laplacians . . . . . . . . 303--312
           Giuseppe Paletta and   
          Paolamaria Pietramala   A New Approximation Algorithm for the
                                  Nonpreemptive Scheduling of Independent
                                  Jobs on Identical Parallel Processors    313--328
                  Noga Alon and   
                  Eyal Lubetzky   Graph Powers, Delsarte, Hoffman, Ramsey,
                                  and Shannon  . . . . . . . . . . . . . . 329--348
            Márton Makai   On Maximum Cost $K_{t,t}$-Free
                                  $t$-Matchings of Bipartite Graphs  . . . 349--360
               Guy Kortsarz and   
                   Sunil Shende   An Improved Approximation of the
                                  Achromatic Number on Bipartite Graphs    361--373
      Jaroslav Ne\vset\vril and   
        Ida \vSvejdarová   Small Diameters of Duals . . . . . . . . 374--384
            Micha A. Perles and   
                   Rom Pinchasi   Forbidden $k$-Sets in the Plane  . . . . 385--395
           Michele Conforti and   
             Marco Di Summa and   
             Laurence A. Wolsey   The Mixing Set with Flows  . . . . . . . 396--407
                  David Kravitz   RANDOM 2-SAT Does Not Depend on a Giant  408--422
 José Cáceres and   
            Carmen Hernando and   
               Merc\`e Mora and   
          Ignacio M. Pelayo and   
    María L. Puertas and   
               Carlos Seara and   
                  David R. Wood   On the Metric Dimension of Cartesian
                                  Products of Graphs . . . . . . . . . . . 423--441
        Vojt\uech Rödl and   
         Andrzej Ruci\'nski and   
                Mathias Schacht   Ramsey Properties of Random $k$-Partite,
                                  $k$-Uniform Hypergraphs  . . . . . . . . 442--460
                 Matt DeVos and   
             Javad Ebrahimi and   
           Mohammad Ghebleh and   
                Luis Goddyn and   
                Bojan Mohar and   
                  Reza Naserasr   Circular Coloring the Plane  . . . . . . 461--465
       Sorin Constantinescu and   
                    Lucian Ilie   The Lempel--Ziv Complexity of Fixed
                                  Points of Morphisms  . . . . . . . . . . 466--481
           C. A. J. Hurkens and   
          J. C. M. Keijsper and   
                     L. Stougie   Virtual Private Network Design: a Proof
                                  of the Tree Routing Conjecture on Ring
                                  Networks . . . . . . . . . . . . . . . . 482--503
           Akiyoshi Shioura and   
              Ken'ichiro Tanaka   Polynomial-Time Algorithms for Linear
                                  and Convex Optimization on Jump Systems  504--522
          Stephen G. Hartke and   
     Jennifer Vandenbussche and   
                    Paul Wenger   Further Results on Bar $k$-Visibility
                                  Graphs . . . . . . . . . . . . . . . . . 523--531
           Ronald L. Graham and   
                 Minming Li and   
                 Frances F. Yao   Optimal Tree Structures for Group Key
                                  Management with Batch Updates  . . . . . 532--547
              Rongquan Feng and   
                Jin Ho Kwak and   
                 Young Soo Kwon   Erratum: Enumerating Typical Circulant
                                  Covering Projections onto a Circulant
                                  Graph  . . . . . . . . . . . . . . . . . 548--550

SIAM Journal on Discrete Mathematics
Volume 21, Number 3, 2007

                    Hande Yaman   The Integer Knapsack Cover Polyhedron    551--572
                 Anne Berry and   
    Martin Charles Golumbic and   
               Marina Lipshteyn   Recognizing Chordal Probe Graphs and
                                  Cycle-Bicolorable Graphs . . . . . . . . 573--591
                Cor Hurkens and   
             Leo van Iersel and   
            Judith Keijsper and   
                Steven Kelk and   
               Leen Stougie and   
                     John Tromp   Prefix Reversals on Binary and Ternary
                                  Strings  . . . . . . . . . . . . . . . . 592--611
            Joseph Cheriyan and   
                   Adrian Vetta   Approximation Algorithms for Network
                                  Design with Metric Costs . . . . . . . . 612--636
              Kenneth A. Berman   Locating Servers for Reliability and
                                  Affine Embeddings  . . . . . . . . . . . 637--646
                       A. Vince   Discrete Lines and Wandering Paths . . . 647--661
               Denis Cornaz and   
               A. Ridha Mahjoub   The Maximum Induced Bipartite Subgraph
                                  Problem with Edge Weights  . . . . . . . 662--675
            Shakhar Smorodinsky   On The Chromatic Number of Geometric
                                  Hypergraphs  . . . . . . . . . . . . . . 676--687
             Robert Babilon and   
  Vít Jelínek and   
        Daniel Král' and   
                    Pavel Valtr   Labelings of Graphs with Fixed and
                                  Variable Edge-Weights  . . . . . . . . . 688--706
             Roel Apfelbaum and   
                   Micha Sharir   Large Complete Bipartite Subgraphs in
                                  Incidence Graphs of Points and
                                  Hyperplanes  . . . . . . . . . . . . . . 707--725
                       Qi Cheng   Constructing Finite Field Extensions
                                  with Large Order Elements  . . . . . . . 726--730
                Jeffrey A. Ryan   A Two-Set Problem on Coloring the
                                  Integers . . . . . . . . . . . . . . . . 731--736
        Gábor Tardos and   
        Géza Tóth   Crossing Stars in Topological Graphs . . 737--749
               Simon \vSpacapan   Optimal Lee-Type Local Structures in
                                  Cartesian Products of Cycles and Paths   750--762
       Domingo Gómez and   
            Jaime Gutierrez and   
             Álvar Ibeas   Cayley Digraphs of Finite Abelian Groups
                                  and Monomial Ideals  . . . . . . . . . . 763--784
             T. L. Alderson and   
             Keith E. Mellinger   Constructions of Optical Orthogonal
                                  Codes from Finite Geometry . . . . . . . 785--793
           Bruce M. Landman and   
                Aaron Robertson   Avoiding Monochromatic Sequences With
                                  Special Gaps . . . . . . . . . . . . . . 794--801
                 Jim Geelen and   
                     Kerri Webb   On Rota's Basis Conjecture . . . . . . . 802--804
             Yeow Meng Chee and   
                Alan C. H. Ling   On Extremal $k$-Graphs Without Repeated
                                  Copies of $2$-Intersecting Edges . . . . 805--821

SIAM Journal on Discrete Mathematics
Volume 21, Number 4, 2008

        Jean-Claude Bermond and   
            Afonso Ferreira and   
Stéphane Pérennes and   
               Joseph G. Peters   Neighborhood Broadcasting in Hypercubes  823--843
                  Hong-Jian Lai   $\bmod (2p + 1)$-Orientations and
                                  $K_{1,2p+1}$-Decompositions  . . . . . . 844--850
                 Gennian Ge and   
                Alan C. H. Ling   On the Existence of $({K}_5 \setminus
                                  e)$-Designs with Application to Optical
                                  Networks . . . . . . . . . . . . . . . . 851--864
        Harald Niederreiter and   
            Ferruh Özbudak   Improved Asymptotic Bounds for Codes
                                  Using Distinguished Divisors of Global
                                  Function Fields  . . . . . . . . . . . . 865--899
             Kathie Cameron and   
           Elaine M. Eschen and   
    Chính T. Ho\`ang and   
                   R. Sritharan   The Complexity of the List Partition
                                  Problem for Graphs . . . . . . . . . . . 900--929
             Rajeev Motwani and   
                 Assaf Naor and   
                 Rina Panigrahy   Lower Bounds on Locality Sensitive
                                  Hashing  . . . . . . . . . . . . . . . . 930--935
                     Ken Takata   A Worst-Case Analysis of the Sequential
                                  Method to List the Minimal Hitting Sets
                                  of a Hypergraph  . . . . . . . . . . . . 936--946
                  B. Pittel and   
                   L. Shepp and   
                    E. Veklerov   On the Number of Fixed Pairs in a Random
                                  Instance of the Stable Marriage Problem  947--958
              Koji Momihara and   
        Meinard Müller and   
                Junya Satoh and   
                 Masakazu Jimbo   Constant Weight Conflict-Avoiding Codes  959--979
                  Benny Sudakov   Ramsey Numbers and the Size of Graphs    980--986
            Robert H. Sloan and   
Balázs Szörényi and   
       György Turán   On $k$-Term DNF with the Largest Number
                                  of Prime Implicants  . . . . . . . . . . 987--998
Benjamin Lévêque and   
 Frédéric Maffray   Coloring Bull-Free Perfectly Contractile
                                  Graphs . . . . . . . . . . . . . . . . . 999--1018
                 Moshe Dror and   
                 James B. Orlin   Combinatorial Optimization with Explicit
                                  Delineation of the Ground Set by a
                                  Collection of Subsets  . . . . . . . . . 1019--1034
           Peter Dankelmann and   
             Simon Mukwembi and   
                 Henda C. Swart   Average Distance and Edge-Connectivity
                                  II . . . . . . . . . . . . . . . . . . . 1035--1052
                     Linyuan Lu   Explicit Construction of Small Folkman
                                  Graphs . . . . . . . . . . . . . . . . . 1053--1060
              Yoshimi Egawa and   
              Katsumi Inoue and   
         Ken-ichi Kawarabayashi   Nonseparating Induced Cycles Consisting
                                  of Contractible Edges in $k$-Connected
                                  Graphs . . . . . . . . . . . . . . . . . 1061--1070
               K. S. Sudeep and   
            Sundar Vishwanathan   Matched-Factor $d$-Domatic Coloring of
                                  Graphs . . . . . . . . . . . . . . . . . 1071--1082
                   Liqun Pu and   
                   Hao Shen and   
                     Jun Ma and   
                       San Ling   Cycle Systems in the Complete Bipartite
                                  Graph Plus a One-Factor  . . . . . . . . 1083--1092


SIAM Journal on Discrete Mathematics
Volume 22, Number 1, 2008

         Tomás Feder and   
                 Pavol Hell and   
                     Jing Huang   Brooks-Type Theorems for Pair-List
                                  Colorings and List Homomorphisms . . . . 1--14
                  Eleni Tzanaki   Faces of Generalized Cluster Complexes
                                  and Noncrossing Partitions . . . . . . . 15--30
              William P. Orrick   Switching Operations for Hadamard
                                  Matrices . . . . . . . . . . . . . . . . 31--50
Frédéric Maffray and   
          Nicolas Trotignon and   
          Kristina Vu\vskovi\'c   Algorithms for Square-3PC($\cdot,
                                  \cdot$)-Free Berge Graphs  . . . . . . . 51--71
           Hajo J. Broersma and   
           Agostino Capponi and   
           Daniël Paulusma   A New Algorithm for On-line Coloring
                                  Bipartite Graphs . . . . . . . . . . . . 72--91
           Peter Dankelmann and   
             Simon Mukwembi and   
                 Henda C. Swart   Average Distance and Edge-Connectivity I 92--101
                   Isolde Adler   Tree-Related Widths of Graphs and
                                  Hypergraphs  . . . . . . . . . . . . . . 102--123
          Gruia C\ualinescu and   
          Adrian Dumitrescu and   
              János Pach   Reconfigurations in Graphs and Grids . . 124--138
   Zden\uek Dvo\vrák and   
         Riste \vSkrekovski and   
                  Martin Tancer   List-Coloring Squares of Sparse Subcubic
                                  Graphs . . . . . . . . . . . . . . . . . 139--159
              Qunqiang Feng and   
           Hosam M. Mahmoud and   
                Alois Panholzer   Phase Changes in Subtree Varieties in
                                  Random Recursive and Binary Search Trees 160--184
      Dániel Gerbner and   
    Balázs Patkós   $\ell$-Chain Profile Vectors . . . . . . 185--193
                 Dan Hefetz and   
        Michael Krivelevich and   
       Milo\vs Stojakovi\'c and   
             Tibor Szabó   Planarity, Colorability, and Minor Games 194--212
                Jeong-Hyun Kang   $L(2,1)$-Labeling of Hamiltonian graphs
                                  with Maximum Degree $3$  . . . . . . . . 213--230
Frédéric Havet and   
Jean-Sébastien Sereni and   
             Riste \vSkrekovski   3-Facial Coloring of Plane Graphs  . . . 231--247
                   Jun Wang and   
                   Huajun Zhang   Normalized Matching Property of
                                  Restricted Subspace Lattices . . . . . . 248--255
                  Navin Kashyap   Matroid Pathwidth and Code Trellis
                                  Complexity . . . . . . . . . . . . . . . 256--272
                   Marko Moisio   On the Duals of Binary Hyper-Kloosterman
                                  Codes  . . . . . . . . . . . . . . . . . 273--287
                Genghua Fan and   
                 Chuixiang Zhou   Ore Condition and Nowhere-Zero $3$-Flows 288--294
   Ji\vrÍ Matou\vsek and   
Ale\vs P\vrÍv\uetivý   Large Monochromatic Components in
                                  Two-Colored Grids  . . . . . . . . . . . 295--311
             Andrei Krokhin and   
                  Benoit Larose   Maximizing Supermodular Functions on
                                  Product Lattices, with Application to
                                  Maximum Constraint Satisfaction  . . . . 312--328
Cláudia Linhares Sales and   
Frédéric Maffray and   
                     Bruce Reed   On Planar Quasi-Parity Graphs  . . . . . 329--347
              Mei-Chu Chang and   
                   Chui Zhi Yao   An Explicit Bound On Double Exponential
                                  Sums Related to Diffie--Hellman
                                  Distributions  . . . . . . . . . . . . . 348--359
                Amos Beimel and   
                Tamir Tassa and   
                   Enav Weinreb   Characterizing Ideal Weighted Threshold
                                  Secret Sharing . . . . . . . . . . . . . 360--397
            A. V. Kostochka and   
                     Xuding Zhu   Adapted List Coloring of Graphs and
                                  Hypergraphs  . . . . . . . . . . . . . . 398--408
               Min Chih Lin and   
           Jayme L. Szwarcfiter   Unit Circular-Arc Graph Representations
                                  and Feasible Circulations  . . . . . . . 409--423

SIAM Journal on Discrete Mathematics
Volume 22, Number 2, 2008

                Reza Akhtar and   
                  Tao Jiang and   
                    Zevi Miller   Asymptotic Determination of
                                  Edge-Bandwidth of Multidimensional Grids
                                  and Hamming Graphs . . . . . . . . . . . 425--449
                   David Offner   Polychromatic Colorings of Subcubes of
                                  the Hypercube  . . . . . . . . . . . . . 450--454
                  Dillon Mayhew   Matroid Complexity and Nonsuccinct
                                  Descriptions . . . . . . . . . . . . . . 455--466
               V. Rödl and   
                     M. Siggers   On Ramsey Minimal Graphs . . . . . . . . 467--488
   János Körner and   
          Claudia Malvenuto and   
           Gábor Simonyi   Graph-Different Permutations . . . . . . 489--499
                   Rong Luo and   
                     Rui Xu and   
                 Wenan Zang and   
                 Cun-Quan Zhang   Realizing Degree Sequences with Graphs
                                  Having Nowhere-Zero $3$-Flows  . . . . . 500--519
             Prasad Chebolu and   
                    Alan Frieze   Hamilton Cycles in Random Lifts of
                                  Directed Graphs  . . . . . . . . . . . . 520--540
        Daniel Král' and   
         Mat\uej StehlÍk   Coloring of Triangle-Free Graphs on the
                                  Double Torus . . . . . . . . . . . . . . 541--553
                Paul Dorbec and   
             Michel Mollard and   
            Sandi Klav\vzar and   
               Simon \vSpacapan   Power Domination in Product Graphs . . . 554--567
         Z. Dvo\vrák and   
            R. \vSkrekovski and   
                       T. Valla   Planar Graphs of Odd-Girth at Least $9$
                                  are Homomorphic to the Petersen Graph    568--591
               Steve Butler and   
     Mohammad T. Hajiaghayi and   
        Robert D. Kleinberg and   
                   Tom Leighton   Hat Guessing Games . . . . . . . . . . . 592--605
      Angel Corberán and   
                Isaac Plana and   
         José M. Sanchis   The Windy General Routing Polyhedron: a
                                  Global View of Many Known Arc Routing
                                  Polyhedra  . . . . . . . . . . . . . . . 606--628
                Shlomo Ahal and   
                Yuri Rabinovich   On Complexity of the Subpattern Problem  629--649
            Pascale Charpin and   
            Gohar M. Kyureghyan   Cubic Monomial Bent Functions: a
                                  Subclass of $\mathcal{M}$  . . . . . . . 650--665
                    Sang-il Oum   Rank-Width and Well-Quasi-Ordering . . . 666--682
               C. D. Godsil and   
                   M. W. Newman   Coloring an Orthogonality Graph  . . . . 683--692
                Uriel Feige and   
                      Eran Ofek   Finding a Maximum Independent Set in a
                                  Sparse Random Graph  . . . . . . . . . . 693--718
           Brendan D. McKay and   
                 Ian M. Wanless   A Census of Small Latin Hypercubes . . . 719--736
                 D. Siersma and   
                   M. van Manen   The Nine Morse Generic Tetrahedra  . . . 737--746
             J. Díaz and   
            X. Pérez and   
                M. J. Serna and   
                  N. C. Wormald   Walkers on the Cycle and the Grid  . . . 747--775
            David Eisenstat and   
                Gary Gordon and   
                 Amanda Redlich   Combinatorial Properties of a Rooted
                                  Graph Polynomial . . . . . . . . . . . . 776--785
                  Noga Alon and   
               Tali Kaufman and   
        Michael Krivelevich and   
                       Dana Ron   Testing Triangle-Freeness in General
                                  Graphs . . . . . . . . . . . . . . . . . 786--819
                  Landon Rabern   A Note On Reed's Conjecture  . . . . . . 820--827
                   Rom Pinchasi   The Minimum Number of Distinct Areas of
                                  Triangles Determined by a Set of $n$
                                  Points in the Plane  . . . . . . . . . . 828--831
               Arvind Gupta and   
         Jan van den Heuvel and   
        Ján Ma\vnuch and   
            Ladislav Stacho and   
                  Xiaohong Zhao   On the Complexity of Ordered Colorings   832--847

SIAM Journal on Discrete Mathematics
Volume 22, Number 3, 2008

                     Zsolt Tuza   Hereditary Domination in Graphs:
                                  Characterization with Forbidden Induced
                                  Subgraphs  . . . . . . . . . . . . . . . 849--853
     Jácint Szabó   Matroid Parity and Jump Systems: a
                                  Solution to a Conjecture of Recski . . . 854--860
      Tomá\vs Kaiser and   
             Riste \vSkrekovski   Cycles Intersecting Edge-Cuts of
                                  Prescribed Sizes . . . . . . . . . . . . 861--874
                 Nathan Reading   Chains in the Noncrossing Partition
                                  Lattice  . . . . . . . . . . . . . . . . 875--886
       József Balogh and   
          Stephen G. Hartke and   
                     Qi Liu and   
                       Gexin Yu   On the First-Fit Chromatic Number of
                                  Graphs . . . . . . . . . . . . . . . . . 887--900
              Yael Berstein and   
                    Jon Lee and   
        Hugo Maruri-Aguilar and   
                 Shmuel Onn and   
             Eva Riccomagno and   
          Robert Weismantel and   
                     Henry Wynn   Nonlinear Matroid Optimization and
                                  Experimental Design  . . . . . . . . . . 901--919
                 Paul S. Bonsma   Spanning Trees with Many Leaves in
                                  Graphs With Minimum Degree Three . . . . 920--937
        Richard C. Brewster and   
                Tomas Feder and   
                 Pavol Hell and   
                 Jing Huang and   
              Gary MacGillivray   Near-Unanimity Functions and Varieties
                                  of Reflexive Graphs  . . . . . . . . . . 938--960
          Bhalchandra D. Thatte   Combinatorics of Pedigrees I:
                                  Counterexamples to a Reconstruction
                                  Question . . . . . . . . . . . . . . . . 961--970
               Heping Zhang and   
          Peter Che Bor Lam and   
                  Wai Chee Shiu   Resonance Graphs and a Binary Coding for
                                  the $1$-Factors of Benzenoid Systems . . 971--984
               Russell Kirk and   
                       Hua Wang   Largest Number of Subtrees of Trees with
                                  a Given Maximum Degree . . . . . . . . . 985--995
          Jerrold R. Griggs and   
             Xiaohua Teresa Jin   Real Number Channel Assignments for
                                  Lattices . . . . . . . . . . . . . . . . 996--1021
              Anne Bergeron and   
              Cedric Chauve and   
      Fabien de Montgolfier and   
               Mathieu Raffinot   Computing Common Intervals of $K$
                                  Permutations, with Applications to
                                  Modular Decomposition of Graphs  . . . . 1022--1039
                  Susan S. Wang   Structure and Coloring of Graphs with
                                  Only Small Odd Cycles  . . . . . . . . . 1040--1072
         Michael Armbruster and   
         Christoph Helmberg and   
    Marzena Fügenschuh and   
               Alexander Martin   On the Graph Bisection Cut Polytope  . . 1073--1098
         William Y. C. Chen and   
                      Deheng Xu   Labeled Partitions and the
                                  $q$-Derangement Numbers  . . . . . . . . 1099--1104
             Masao Ishikawa and   
            Anisse Kasraoui and   
                     Jiang Zeng   Euler--Mahonian Statistics on Ordered
                                  Set Partitions . . . . . . . . . . . . . 1105--1137
              Hemanshu Kaul and   
                Douglas B. West   Long Local Searches for Maximal
                                  Bipartite Subgraphs  . . . . . . . . . . 1138--1144
     József Solymosi and   
            Konrad J. Swanepoel   Elementary Incidence Theorems for
                                  Complex Numbers and Quaternions  . . . . 1145--1148
              Paul Balister and   
Béla Bollobás and   
                 Stefanie Gerke   Sequences with Changing Dependencies . . 1149--1154
Ádám Timár   Split Hypergraphs  . . . . . . . . . . . 1155--1163
           Maria Chudnovsky and   
                  Rohan Kapadia   Detecting a Theta or a Prism . . . . . . 1164--1186
           Csaba D. Tóth   Axis-Aligned Subdivisions with Low
                                  Stabbing Numbers . . . . . . . . . . . . 1187--1204
                     K. P. Webb   The Vector Space over $GF(2)$ Generated
                                  by the Common Bases of Two Binary
                                  Matroids . . . . . . . . . . . . . . . . 1205--1214
              Vladimir Ejov and   
             Jerzy A. Filar and   
              Walter Murray and   
                Giang T. Nguyen   Determinants and Longest Cycles of
                                  Graphs . . . . . . . . . . . . . . . . . 1215--1225
            Laurent Beaudou and   
            Sylvain Gravier and   
                  Kahina Meslem   Isometric Embeddings of Subdivided
                                  Complete Graphs in the Hypercube . . . . 1226--1238
             Cyril Gavoille and   
                Christophe Paul   Optimal Distance Labeling for Interval
                                  Graphs and Related Graph Families  . . . 1239--1258

SIAM Journal on Discrete Mathematics
Volume 22, Number 4, 2008

           Derek G. Corneil and   
             Richard M. Krueger   A Unified View of Graph Searching  . . . 1259--1276
             Anna Bretscher and   
              Derek Corneil and   
               Michel Habib and   
                Christophe Paul   A Simple Linear Time LexBFS Cograph
                                  Recognition Algorithm  . . . . . . . . . 1277--1296
                  V. Arvind and   
         Christine T. Cheng and   
              Nikhil R. Devanur   On Computing the Distinguishing Numbers
                                  of Planar Graphs and Beyond: a Counting
                                  Approach . . . . . . . . . . . . . . . . 1297--1324
                  Noga Alon and   
        Michael Krivelevich and   
                  Benny Sudakov   Large Nearly Regular Induced Subgraphs   1325--1337
                     Olof Heden   Perfect Codes of Length $n$ with Kernels
                                  of Dimension $n - \log(n + 1) - 3$ . . . 1338--1350
                    C. Balbuena   Incidence Matrices of Projective Planes
                                  and of Some Regular Bipartite Graphs of
                                  Girth $6$ with Few Vertices  . . . . . . 1351--1363
                     Xin He and   
                  Huaming Zhang   Nearly Optimal Visibility
                                  Representations of Plane Graphs  . . . . 1364--1380
              Henning Bruhn and   
                    Xingxing Yu   Hamilton Cycles in Planar Locally Finite
                                  Graphs . . . . . . . . . . . . . . . . . 1381--1392
         Simon R. Blackburn and   
                Tuvi Etzion and   
                   Siaw-Lynn Ng   Prolific Codes with the Identifiable
                                  Parent Property  . . . . . . . . . . . . 1393--1410
               Satoru Iwata and   
               Kenjiro Takazawa   The Independent Even Factor Problem  . . 1411--1427
                F. Comellas and   
            C. Dalfó and   
                     M. A. Fiol   Multidimensional Manhattan Street
                                  Networks . . . . . . . . . . . . . . . . 1428--1447
Tomá\vs Dvo\vrák and   
                    Petr Gregor   Partitions of Faulty Hypercubes into
                                  Paths with Prescribed Endvertices  . . . 1448--1461
            \Lukasz Kowalik and   
Jean-Sébastien Sereni and   
             Riste \vSkrekovski   Total-Coloring of Plane Graphs with
                                  Maximum Degree Nine  . . . . . . . . . . 1462--1479
          Adam N. Letchford and   
            Gerhard Reinelt and   
              Dirk Oliver Theis   Odd Minimum Cut Sets and $b$-Matchings
                                  Revisited  . . . . . . . . . . . . . . . 1480--1487
             Federica Garin and   
                  Fabio Fagnani   Analysis of Serial Turbo Codes over
                                  Abelian Groups for Symmetric Channels    1488--1526
                David E. Speyer   Tropical Linear Spaces . . . . . . . . . 1527--1558
        Daniel Král' and   
                   Petr \vSkoda   Bounds for the Real Number Graph
                                  Labellings and Application to Labellings
                                  of the Triangular Lattice  . . . . . . . 1559--1569
                  Xiao Zhou and   
                Takao Nishizeki   Orthogonal Drawings of Series-Parallel
                                  Graphs with Minimum Bends  . . . . . . . 1570--1604
   Ji\vrí Matou\vsek and   
Ale\vs P\vrív\uetivý and   
               Petr \vSkovro\vn   How Many Points Can Be Reconstructed
                                  from $k$ Projections?  . . . . . . . . . 1605--1623
              Gregory Gutin and   
               Arash Rafiey and   
                     Anders Yeo   Minimum Cost Homomorphisms to
                                  Semicomplete Bipartite Digraphs  . . . . 1624--1639
          Mohamed Didi Biha and   
       Hervé Kerivin and   
               A. Ridha Mahjoub   On the Polytope of the
                                  $(1,2)$-Survivable Network Design
                                  Problem  . . . . . . . . . . . . . . . . 1640--1666


SIAM Journal on Discrete Mathematics
Volume 23, Number 1, 2009

             Stephen Graves and   
           Toma\vz Pisanski and   
                Mark E. Watkins   Growth of Edge-Homogeneous Tessellations 1--18
               Giacomo Como and   
                  Fabio Fagnani   Average Spectra and Minimum Distances of
                                  Low-Density Parity-Check Codes over
                                  Abelian Groups . . . . . . . . . . . . . 19--53
                  Jian-Liang Wu   The Linear Arboricity of Graphs on
                                  Surfaces of Negative Euler
                                  Characteristic . . . . . . . . . . . . . 54--58
            Pascale Charpin and   
              Tor Helleseth and   
                Victor Zinoviev   On Cosets of Weight $4$ of ${\rm
                                  BCH}(2^m,8), m$ Even, and Exponential
                                  Sums . . . . . . . . . . . . . . . . . . 59--78
               Simon Litsyn and   
               Alexander Shpunt   On the Distribution of Boolean Function
                                  Nonlinearity . . . . . . . . . . . . . . 79--95
     Ken-ichi Kawarabayashi and   
                Raiji Mukae and   
              Atsuhiro Nakamoto   $K_6$-Minors in Triangulations on the
                                  Klein Bottle . . . . . . . . . . . . . . 96--108
        Charles J. Colbourn and   
                Hung-Lin Fu and   
                 Gennian Ge and   
            Alan C. H. Ling and   
                   Hui-Chuan Lu   Minimizing SONET ADMs in Unidirectional
                                  WDM Rings with Grooming Ratio Seven  . . 109--122
              Alex Iosevich and   
                     Doowon Koh   The Erd\Hos--Falconer Distance Problem,
                                  Exponential Sums, and Fourier Analytic
                                  Approach to Incidence Theorems in Vector
                                  Spaces over Finite Fields  . . . . . . . 123--135
               S. N. Kabadi and   
                     J. Yan and   
                      D. Du and   
                  K. P. K. Nair   Integer Exact Network Synthesis Problem  136--154
                  Jacob Fox and   
                  Benny Sudakov   Ramsey-Type Problem for an Almost
                                  Monochromatic $K_4$  . . . . . . . . . . 155--162
            Chandra Chekuri and   
              F. Bruce Shepherd   Approximate Integer Decompositions for
                                  Undirected Network Design Problems . . . 163--177
               Hamed Hatami and   
                Avner Magen and   
             Evangelos Markakis   Integrality Gaps of Semidefinite
                                  Programs for Vertex Cover and Relations
                                  to $\ell_1$ Embeddability of Negative
                                  Type Metrics . . . . . . . . . . . . . . 178--194
                 Raphael Yuster   Disjoint Color-Avoiding Triangles  . . . 195--204
                     Baogang Xu   On $(3,1)^*$-Coloring of Plane Graphs    205--220
María Jose Chávez and   
          Ga\vsper Fijav\vz and   
     Alberto Márquez and   
          Atsuhiro Nakamoto and   
        Esperanza Suárez   Geometric Realization of Möbius
                                  Triangulations . . . . . . . . . . . . . 221--232
                  Noga Alon and   
                Pawe Pra at and   
               Nicholas Wormald   Cleaning Regular Graphs with Brushes . . 233--250
                     Asaf Levin   Approximating the Unweighted $k$-Set
                                  Cover Problem: Greedy Meets Local Search 251--264
                   D. Benko and   
                   C. Ernst and   
                    D. Lanphier   Asymptotic Bounds on the Integrity of
                                  Graphs and Separator Theorems for Graphs 265--277
                  Noga Alon and   
               Asaf Shapira and   
                       Uri Stav   Can a Graph Have Distinct Regular
                                  Partitions?  . . . . . . . . . . . . . . 278--287
           Michael Behrisch and   
               Anusch Taraz and   
               Michael Ueckerdt   Coloring Random Intersection Graphs and
                                  Complex Networks . . . . . . . . . . . . 288--299
               Andrew Beveridge   Centers for Random Walks on Trees  . . . 300--318
                 Mario Marietti   A Combinatorial Characterization of
                                  Coxeter Groups . . . . . . . . . . . . . 319--332
                Petri Rosendahl   On Cusick's Method and Value Sets of
                                  Certain Polynomials over Finite Fields   333--343
   Zden\uek Dvo\vrák and   
         Stanislav Jendrol' and   
        Daniel Král' and   
                      Gyula Pap   Matchings and Nonrainbow Colorings . . . 344--348
             David Richerby and   
          Dimitrios M. Thilikos   Graph Searching in a Crime Wave  . . . . 349--368
                Timothy Y. Chow   Reduction of Rota's Basis Conjecture to
                                  a Problem on Three Bases . . . . . . . . 369--371
     Ken-ichi Kawarabayashi and   
        Daniel Král' and   
                Jan Kyn\vcl and   
         Bernard Lidický   $6$-Critical Graphs on the Klein Bottle  372--383
              Ivan Soprunov and   
                Jenya Soprunova   Toric Surface Codes and Minkowski Length
                                  of Polygons  . . . . . . . . . . . . . . 384--400
      Miklós Bóna   Real Zeros and Normal Distribution for
                                  Statistics on Stirling Permutations
                                  Defined by Gessel and Stanley  . . . . . 401--406
              Joachim Kneis and   
          Daniel Mölle and   
             Stefan Richter and   
               Peter Rossmanith   A Bound on the Pathwidth of Sparse
                                  Graphs with Applications to Exact
                                  Algorithms . . . . . . . . . . . . . . . 407--427
                   A. Berry and   
                 R. Krueger and   
                     G. Simonet   Maximal Label Search Algorithms to
                                  Compute Perfect and Minimal Elimination
                                  Orderings  . . . . . . . . . . . . . . . 428--446
          Nachum Dershowitz and   
                    Shmuel Zaks   More Patterns in Trees: Up and Down,
                                  Young and Old, Odd and Even  . . . . . . 447--465
                  Noga Alon and   
             Fedor V. Fomin and   
              Gregory Gutin and   
        Michael Krivelevich and   
                  Saket Saurabh   Spanning Directed Trees with Many Leaves 466--476
   Zden\uek Dvo\vrák and   
             Riste \vSkrekovski   $k$-Chromatic Number of Graphs on
                                  Surfaces . . . . . . . . . . . . . . . . 477--486
           Khaled M. Elbassioni   Algorithms for Dualization over Products
                                  of Partially Ordered Sets  . . . . . . . 487--510
                 Jakub Przyby o   Linear Bound on the Irregularity
                                  Strength and the Total Vertex
                                  Irregularity Strength of Graphs  . . . . 511--516
         Michael J. Ferrara and   
                   John Schmitt   A General Lower Bound for Potentially
                                  $H$-Graphic Sequences  . . . . . . . . . 517--526
       L. Wyatt Alverson II and   
         Robert G. Donnelly and   
             Scott J. Lewis and   
              Marti McClard and   
             Robert Pervine and   
          Robert A. Proctor and   
               N. J. Wildberger   Distributive Lattices Defined for
                                  Representations of Rank Two Semisimple
                                  Lie Algebras . . . . . . . . . . . . . . 527--559

SIAM Journal on Discrete Mathematics
Volume 23, Number 2, 2009

            Denis S. Krotov and   
            Vladimir N. Potapov   $n$-Ary Quasigroups of Order $4$ . . . . 561--570
       Víctor Blanco and   
                   Justo Puerto   Partial Gröbner Bases for Multiobjective
                                  Integer Linear Optimization  . . . . . . 571--595
               Carl Bracken and   
               Eimear Byrne and   
               Nadya Markin and   
                   Gary McGuire   Fourier Spectra of Binomial APN
                                  Functions  . . . . . . . . . . . . . . . 596--608
                 Chuangyin Dang   An Arbitrary Starting Homotopy-Like
                                  Simplicial Algorithm for Computing an
                                  Integer Point in a Class of Polytopes    609--633
            Airat Bekmetjev and   
              Charles A. Cusack   Pebbling Algorithms in Diameter Two
                                  Graphs . . . . . . . . . . . . . . . . . 634--646
               Satoru Iwata and   
               Mizuyo Takamatsu   Computing the Degrees of All Cofactors
                                  in Mixed Polynomial Matrices . . . . . . 647--660
                    Guo-Niu Han   Yet Another Generalization of
                                  Postnikov's Hook Length Formula for
                                  Binary Trees . . . . . . . . . . . . . . 661--664
            Mourad Ba\"\iou and   
             Francisco Barahona   On the Integrality of Some Facility
                                  Location Polytopes . . . . . . . . . . . 665--679
          Morten H. Nielsen and   
           Ortrud R. Oellermann   Steiner Trees and Convex Geometries  . . 680--693
                   Sanming Zhou   A Class of Arc-Transitive Cayley Graphs
                                  as Models for Interconnection Networks   694--714
             Naftali Sommer and   
                 Meir Feder and   
                    Ofir Shalvi   Finding the Closest Lattice Point by
                                  Iterative Slicing  . . . . . . . . . . . 715--731
                  Hip H\`an and   
                Yury Person and   
                Mathias Schacht   On Perfect Matchings in Uniform
                                  Hypergraphs with Large Minimum Vertex
                                  Degree . . . . . . . . . . . . . . . . . 732--748
                  Yezhou Wu and   
                 Wenan Zang and   
                 Cun-Quan Zhang   A Characterization of Almost CIS Graphs  749--753
             Joseph Brennan and   
                   Guantao Chen   Toric Geometry of Series-Parallel Graphs 754--764
                 Sergi Elizalde   The Number of Permutations Realized By a
                                  Shift  . . . . . . . . . . . . . . . . . 765--786
      Svetlana Poznanovi\'c and   
                  Catherine Yan   Crossings and Nestings of Two Edges in
                                  Set Partitions . . . . . . . . . . . . . 787--804
                  Tian Tian and   
                    Wen-Feng Qi   Autocorrelation and Distinctness of
                                  Decimations of $\ell$-Sequences  . . . . 805--821
               Leah Epstein and   
            Thomas Erlebach and   
                     Asaf Levin   Online Capacitated Interval Coloring . . 822--841
              Jean Bourgain and   
              Todd Cochrane and   
           Jennifer Paulhus and   
             Christopher Pinner   Decimations of $\ell$-Sequences and
                                  Permutations of Even Residues $\bmod p$  842--857
           Mariko Sakashita and   
            Kazuhisa Makino and   
          Hiroshi Nagamochi and   
               Satoru Fujishige   Minimum Transversals in Posimodular
                                  Systems  . . . . . . . . . . . . . . . . 858--871
         Daniel W. Cranston and   
                Douglas B. West   Classes of $3$-Regular Graphs That Are
                                  $(7, 2)$-Edge-Choosable  . . . . . . . . 872--881
                J. A. Bondy and   
              X. Buchwalder and   
                     F. Mercier   Lexicographic Products and a Conjecture
                                  of Hahn and Jackson  . . . . . . . . . . 882--887
                        Yi Zhao   Bipartite Graph Tiling . . . . . . . . . 888--900
       József Balogh and   
                    Ryan Martin   On Avoider-Enforcer Games  . . . . . . . 901--908
         Michael R. Fellows and   
        Frances A. Rosamond and   
                 Udi Rotics and   
                 Stefan Szeider   Clique-Width is NP-Complete  . . . . . . 909--939
                 Gennian Ge and   
                  Ying Miao and   
                   Xiande Zhang   On Block Sequences of Steiner Quadruple
                                  Systems with Error Correcting
                                  Consecutive Unions . . . . . . . . . . . 940--958
            Ioannis Caragiannis   Wavelength Management in WDM Rings to
                                  Maximize the Number of Connections . . . 959--978
       Nicolas Lichiardopol and   
          Attila Pór and   
   Jean-Sébastien Sereni   A Step toward the Bermond--Thomassen
                                  Conjecture about Disjoint Cycles in
                                  Digraphs . . . . . . . . . . . . . . . . 979--992
           Andrew Beveridge and   
                 Tom Bohman and   
                Alan Frieze and   
                  Oleg Pikhurko   Memoryless Rules for Achlioptas
                                  Processes  . . . . . . . . . . . . . . . 993--1008
                    Jay Schweig   A Convex-Ear Decomposition for
                                  Rank-Selected Subposets of Supersolvable
                                  Lattices . . . . . . . . . . . . . . . . 1009--1022
                    Dong Ye and   
                Zhongbin Qi and   
                   Heping Zhang   On $k$-Resonant Fullerene Graphs . . . . 1023--1044
               Rucong Zhang and   
                 Gennian Ge and   
            Alan C. H. Ling and   
                Hung-Lin Fu and   
                 Yukiyasu Mutoh   The Existence of $r \times 4$ Grid-Block
                                  Designs with $r = 3, 4$  . . . . . . . . 1045--1062
             Jozef Mi\vskuf and   
         Riste \vSkrekovski and   
                  Martin Tancer   Backbone Colorings and Generalized
                                  Mycielski Graphs . . . . . . . . . . . . 1063--1070
            Peter Hamburger and   
                 Attila Por and   
                     Matt Walsh   Kneser Representations of Graphs . . . . 1071--1081
                   T. Britz and   
                   G. Royle and   
                   K. Shiromoto   Designs from Matroids  . . . . . . . . . 1082--1099
             Ji\vrí Fink   Connectivity of Matching Graph of
                                  Hypercube  . . . . . . . . . . . . . . . 1100--1109
                Yair Bartal and   
            Leonard J. Schulman   Universal Immersion Spaces for
                                  Edge-Colored Graphs and Nearest-Neighbor
                                  Metrics  . . . . . . . . . . . . . . . . 1110--1115

SIAM Journal on Discrete Mathematics
Volume 23, Number 3, 2009

               Jason Morton and   
               Lior Pachter and   
                  Anne Shiu and   
            Bernd Sturmfels and   
                 Oliver Wienand   Convex Rank Tests and Semigraphoids  . . 1117--1134
          Benjamin McClosky and   
                 Illya V. Hicks   The Co-2-plex Polytope and Integral
                                  Systems  . . . . . . . . . . . . . . . . 1135--1148
       Graham R. Brightwell and   
                  Peter Winkler   Submodular Percolation . . . . . . . . . 1149--1178
                   Babak Farzad   Planar Graphs without $7$-Cycles Are
                                  $4$-Choosable  . . . . . . . . . . . . . 1179--1199
                  A. K. Lal and   
               B. Bhattacharjya   Breaking the Symmetries of the Book
                                  Graph and the Generalized Petersen Graph 1200--1216
                A. J. Wolfe and   
              A. C. H. Ling and   
                   J. H. Dinitz   The Existence of $N_2$ Resolvable Latin
                                  Squares  . . . . . . . . . . . . . . . . 1217--1237
                Genghua Fan and   
                      Naidan Ji   Relative Length of Longest Paths and
                                  Cycles in $2$-Connected Graphs . . . . . 1238--1248
         William Y. C. Chen and   
               Jiuqiang Liu and   
               Larry X. W. Wang   Families of Sets with Intersecting
                                  Clusters . . . . . . . . . . . . . . . . 1249--1260
Eyjólfur Ingi Ásgeirsson and   
                    Cliff Stein   Divide-and-Conquer Approximation
                                  Algorithm for Vertex Cover . . . . . . . 1261--1280
            Alberto Del Pia and   
               Giacomo Zambelli   Half-Integral Vertex Covers on Bipartite
                                  Bidirected Graphs: Total Dual
                                  Integrality and Cut-Rank . . . . . . . . 1281--1296
           Nicola Apollonio and   
        András Sebö   Minconvex Factors of Prescribed Size in
                                  Graphs . . . . . . . . . . . . . . . . . 1297--1310
                 Omid Amini and   
                Florian Huc and   
Stéphane Pérennes   On the Path-Width of Planar Graphs . . . 1311--1316
       Michael J. Pelsmajer and   
            Marcus Schaefer and   
                  Despina Stasi   Strong Hanani--Tutte on the Projective
                                  Plane  . . . . . . . . . . . . . . . . . 1317--1323
                 Linyuan Lu and   
                        Yi Zhao   An Exact Result for Hypergraphs and
                                  Upper Bounds for the Turán Density of
                                  $K^r_{r+1}$  . . . . . . . . . . . . . . 1324--1334
          Daniela Kühn and   
               Deryk Osthus and   
                Andrew Treglown   An Ore-type Theorem for Perfect Packings
                                  in Graphs  . . . . . . . . . . . . . . . 1335--1355
          Kevin P. Costello and   
                         Van Vu   Concentration of Random Determinants and
                                  Permanent Estimators . . . . . . . . . . 1356--1371
                  Rok Erman and   
         Suzana Jure\vci\vc and   
        Daniel Král' and   
                Kris Stopar and   
                     Nik Stopar   Optimal Real Number Graph Labellings of
                                  a Subfamily of Kneser Graphs . . . . . . 1372--1381
              Ashkan Aazami and   
                     Kael Stilp   Approximation Algorithms and Hardness
                                  for Domination with Propagation  . . . . 1382--1399
                      Ning Chen   On the Approximability of Influence in
                                  Social Networks  . . . . . . . . . . . . 1400--1415
         Sergei L. Bezrukov and   
                       Uwe Leck   A Simple Proof of the
                                  Karakhanyan--Riordan Theorem on the Even
                                  Discrete Torus . . . . . . . . . . . . . 1416--1421
          Warwick de Launey and   
                 David A. Levin   $(1,-1)$-Matrices with Near-Extremal
                                  Properties . . . . . . . . . . . . . . . 1422--1440
                Dawn Curtis and   
               Taylor Hines and   
             Glenn Hurlbert and   
                  Tatiana Moyer   Near-Universal Cycles for Subsets Exist  1441--1449
          Bridget Eileen Tenner   Optimizing Linear Extensions . . . . . . 1450--1454
     Jennifer Vandenbussche and   
            Douglas B. West and   
                       Gexin Yu   On the Pagenumber of $k$-Trees . . . . . 1455--1464
        Daniel Král' and   
Jean-Sébastien Sereni and   
               Michael Stiebitz   A New Lower Bound on the Number of
                                  Perfect Matchings in Cubic Graphs  . . . 1465--1483
           Pierre Fouilhoux and   
       Martine Labbé and   
           A. Ridha Mahjoub and   
                    Hande Yaman   Generating Facets for the Independence
                                  System Polytope  . . . . . . . . . . . . 1484--1506
               Akiko Manada and   
                  Navin Kashyap   A Comparative Study of Periods in a
                                  Periodic-Finite-Type Shift . . . . . . . 1507--1524
                      Eric Bach   Improved Asymptotic Formulas for
                                  Counting Correlation Immune Boolean
                                  Functions  . . . . . . . . . . . . . . . 1525--1538
     Jennifer Vandenbussche and   
                Douglas B. West   Matching Extendability in Hypercubes . . 1539--1547
              Hal Kierstead and   
                Bojan Mohar and   
           Simon \vSpacapan and   
                Daqing Yang and   
                     Xuding Zhu   The Two-Coloring Number and Degenerate
                                  Colorings of Planar Graphs . . . . . . . 1548--1560
Dávid Kunszenti-Kovács   Network Perturbations and Asymptotic
                                  Periodicity of Recurrent Flows in
                                  Infinite Networks  . . . . . . . . . . . 1561--1574
           Erin W. Chambers and   
            Bill Kinnersley and   
                Noah Prince and   
                Douglas B. West   Extremal Problems for Roman Domination   1575--1586
           Guillaume Chapuy and   
              Michel Marcus and   
               Gilles Schaeffer   A Bijection for Rooted Maps on
                                  Orientable Surfaces  . . . . . . . . . . 1587--1611
          Juraj Hromkovi\vc and   
       Przemys\lawa Kanarek and   
               Ralf Klasing and   
             Krzysztof Lory and   
               Walter Unger and   
                 Hubert Wagener   On the Size of Permutation Networks and
                                  Consequences for Efficient Simulation of
                                  Hypercube Algorithms on Bounded-Degree
                                  Networks . . . . . . . . . . . . . . . . 1612--1645
                 W. H. Chan and   
            Peter C. B. Lam and   
                     W. C. Shiu   Edge-Face Total Chromatic Number of
                                  Halin Graphs . . . . . . . . . . . . . . 1646--1654

SIAM Journal on Discrete Mathematics
Volume 23, Number 4, 2010

  Imre Bárány and   
          Attila Pór and   
                    Pavel Valtr   Paths with No Small Angles . . . . . . . 1655--1666
                    Jon Lee and   
                 Shmuel Onn and   
              Robert Weismantel   Approximate Nonlinear Optimization over
                                  Weighted Independence Systems  . . . . . 1667--1681
           Amin Coja-Oghlan and   
             André Lanka   Finding Planted Partitions in Random
                                  Graphs with General Degree Distributions 1682--1714
                     Bin Fu and   
              Ming-Yang Kao and   
                   Lusheng Wang   Probabilistic Analysis of a Motif
                                  Discovery Algorithm for Multiple
                                  Sequences  . . . . . . . . . . . . . . . 1715--1737
               Colin Cooper and   
                Alan Frieze and   
                  Tomasz Radzik   Multiple Random Walks in Random Regular
                                  Graphs . . . . . . . . . . . . . . . . . 1738--1761
               Hamed Hatami and   
                     Xuding Zhu   The Fractional Chromatic Number of
                                  Graphs of Maximum Degree at Most Three   1762--1775
    Conrado Martínez and   
                Lucia Moura and   
             Daniel Panario and   
                  Brett Stevens   Locating Errors Using ELAs, Covering
                                  Arrays, and Adaptive Testing Algorithms  1776--1799
         George B. Mertzios and   
                 Ignasi Sau and   
                    Shmuel Zaks   A New Intersection Model and Improved
                                  Algorithms for Tolerance Graphs  . . . . 1800--1813
                Cai Leizhen and   
                    Wang Weifan   The Surviving Rate of a Graph for the
                                  Firefighter Problem  . . . . . . . . . . 1814--1826
                 Yuval Emek and   
                    David Peleg   A Tight Upper Bound on the Probabilistic
                                  Embedding of Series-Parallel Graphs  . . 1827--1841
              Walter Didimo and   
         Francesco Giordano and   
                Giuseppe Liotta   Upward Spirality and Upward Planarity
                                  Testing  . . . . . . . . . . . . . . . . 1842--1899
       Ágnes Tóth   The Ultimate Categorical Independence
                                  Ratio of Complete Multipartite Graphs    1900--1904
           Derek G. Corneil and   
             Stephan Olariu and   
                  Lorna Stewart   The LBFS Structure and Recognition of
                                  Interval Graphs  . . . . . . . . . . . . 1905--1953
                   David Conlon   On-line Ramsey Numbers . . . . . . . . . 1954--1963
      Nikolaos Fountoulakis and   
                     Anna Huber   Quasirandom Rumor Spreading on the
                                  Complete Graph Is as Fast as Randomized
                                  Rumor Spreading  . . . . . . . . . . . . 1964--1991
          Bart\lomiej Bosek and   
            Tomasz Krawczyk and   
                Edward Szczypka   First-Fit Algorithm for the On-Line
                                  Chain Partitioning Problem . . . . . . . 1992--1999
           Amin Coja-Oghlan and   
               Colin Cooper and   
                    Alan Frieze   An Efficient Sparse Regularity Concept   2000--2034
        Daniel K. Benvenuti and   
              Abraham P. Punnen   SC-Hamiltonicity and Its Linkages with
                                  Strong Hamiltonicity of a Graph  . . . . 2035--2041
      Ghidewon Abay-Asmerom and   
         Richard H. Hammack and   
            Craig E. Larson and   
                Dewey T. Taylor   Direct Product Factorization of
                                  Bipartite Graphs with
                                  Bipartition-reversing Involutions  . . . 2042--2052
                    Jon Lee and   
          Vahab S. Mirrokni and   
        Viswanath Nagarajan and   
               Maxim Sviridenko   Maximizing Nonmonotone Submodular
                                  Functions under Matroid or Knapsack
                                  Constraints  . . . . . . . . . . . . . . 2053--2078
                     Hsueh-I Lu   Improved Compact Routing Tables for
                                  Planar Networks via Orderly Spanning
                                  Trees  . . . . . . . . . . . . . . . . . 2079--2092
            Igor E. Shparlinski   On the Distribution of Orbits of
                                  $\mathrm{PGL}_2(q)$ in
                                  $\mathbb{F}_{q^n}$ and the Klapper
                                  Conjecture . . . . . . . . . . . . . . . 2093--2099
             Sun-Yuan Hsieh and   
                   Chia-Wei Lee   Pancyclicity of Restricted
                                  Hypercube-Like Networks under the
                                  Conditional Fault Model  . . . . . . . . 2100--2119
               Lara Dolecek and   
              Venkat Anantharam   Repetition Error Correcting Sets:
                                  Explicit Constructions and Prefixing
                                  Methods  . . . . . . . . . . . . . . . . 2120--2146
           Oswin Aichholzer and   
               Thomas Hackl and   
             Clemens Huemer and   
             Ferran Hurtado and   
             Birgit Vogtenhuber   Large Bichromatic Point Sets Admit Empty
                                  Monochromatic $4$-Gons . . . . . . . . . 2147--2155
        Chính T. Ho\`ang   On the Complexity of Finding a Sun in a
                                  Graph  . . . . . . . . . . . . . . . . . 2156--2162
           Mitre C. Dourado and   
        Fábio Protti and   
          Dieter Rautenbach and   
           Jayme L. Szwarcfiter   On the Hull Number of Triangle-Free
                                  Graphs . . . . . . . . . . . . . . . . . 2163--2172
             Noam D. Elkies and   
            Scott Duke Kominers   On the Classification of Type II Codes
                                  of Length $24$ . . . . . . . . . . . . . 2173--2177
             Jeanette C. McLeod   Asymptotic Enumeration of
                                  $k$-Edge-Colored $k$-Regular Graphs  . . 2178--2197
           Giuseppe Paletta and   
             Francesca Vocaturo   A Short Note on an Advance in Estimating
                                  the Worst-Case Performance Ratio of the
                                  MPS Algorithm  . . . . . . . . . . . . . 2198--2203
                Mark H. Siggers   A New Proof of the $H$-Coloring
                                  Dichotomy  . . . . . . . . . . . . . . . 2204--2210
   René Quilodrán   The Joints Problem in $\mathbb{R}^n$ . . 2211--2213


SIAM Journal on Discrete Mathematics
Volume 24, Number 1, 2010

        Michael Krivelevich and   
              Choongbum Lee and   
                  Benny Sudakov   Resilient Pancyclicity of Random and
                                  Pseudorandom Graphs  . . . . . . . . . . 1--16
          Reinhard Steffens and   
              Thorsten Theobald   Combinatorics and Genus of Tropical
                                  Intersections and Ehrhart Theory . . . . 17--32
             Yeow Meng Chee and   
                 Gennian Ge and   
                Alan C. H. Ling   Spectrum of Sizes for Perfect
                                  Deletion-Correcting Codes  . . . . . . . 33--55
     Ken-ichi Kawarabayashi and   
                    Bojan Mohar   Star Coloring and Acyclic Coloring of
                                  Locally Planar Graphs  . . . . . . . . . 56--71
          Pierre Fraigniaud and   
          Emmanuelle Lebhar and   
                     Zvi Lotker   A Lower Bound for Network Navigability   72--81
              Jeong Ok Choi and   
          Stephen G. Hartke and   
                  Hemanshu Kaul   Distinguishing Chromatic Number of
                                  Cartesian Products of Graphs . . . . . . 82--100
         Tomás Feder and   
                 Pavol Hell and   
              Peter Jonsson and   
             Andrei Krokhin and   
                   Gustav Nordh   Retractions to Pseudoforests . . . . . . 101--112
                   Igor Pak and   
                Ernesto Vallejo   Reductions of Young Tableau Bijections   113--145
            Aleksandrs Slivkins   Parameterized Tractability of
                                  Edge-Disjoint Paths on Directed Acyclic
                                  Graphs . . . . . . . . . . . . . . . . . 146--157
               Amitabh Basu and   
           Michele Conforti and   
Gérard Cornuéjols and   
               Giacomo Zambelli   Minimal Inequalities for an Infinite
                                  Relaxation of Integer Programs . . . . . 158--168
       David J. Grynkiewicz and   
                Vsevolod F. Lev   $1$-Saturating Sets, Caps, and
                                  Doubling-Critical Sets in Binary Spaces  169--190
                   A. B. Dieker   Interlacings for Random Walks on
                                  Weighted Graphs and the Interchange
                                  Process  . . . . . . . . . . . . . . . . 191--206
       Andriy V. Bondarenko and   
            Maryna S. Viazovska   Spherical Designs via Brouwer Fixed
                                  Point Theorem  . . . . . . . . . . . . . 207--217
                 Gennian Ge and   
                Dawei Huang and   
                      Ying Miao   Monotonic Directed Designs . . . . . . . 218--238
    Andreas Brandstädt and   
             Vadim V. Lozin and   
                 Raffaele Mosca   Independent Sets of Maximum Weight in
                                  Apple-Free Graphs  . . . . . . . . . . . 239--254
               Guy Kortsarz and   
           Michael Langberg and   
                     Zeev Nutov   Approximating Maximum Subgraphs without
                                  Short Cycles . . . . . . . . . . . . . . 255--269
      Deeparnab Chakrabarty and   
              Aranyak Mehta and   
              Vijay V. Vazirani   Design is as Easy as Optimization  . . . 270--286
          Reuven Bar-Yehuda and   
             Danny Hermelin and   
                    Dror Rawitz   An Extension of the Nemhauser--Trotter
                                  Theorem to Generalized Vertex Cover with
                                  Applications . . . . . . . . . . . . . . 287--300
  André Kündgen and   
       Michael J. Pelsmajer and   
             Radhika Ramamurthi   $k$-Robust Single-Message Transmission   301--321
                  Brendan Nagle   On Computing the Frequencies of Induced
                                  Subhypergraphs . . . . . . . . . . . . . 322--329
      Tomá\vs Kaiser and   
        Daniel Král' and   
     Bernard Lidický and   
       Pavel Nejedlý and   
          Robert \vSámal   Short Cycle Covers of Graphs with
                                  Minimum Degree Three . . . . . . . . . . 330--355

SIAM Journal on Discrete Mathematics
Volume 24, Number 2, 2010

          Jan Hladký and   
                Mathias Schacht   Note on Bipartite Graph Tilings  . . . . 357--362
               Viet-Hang Nguyen   On Abstract Rigidity Matroids  . . . . . 363--369
                 F. M. Dong and   
                      K. M. Koh   On Zero-Free Intervals in $(1,2)$ of
                                  Chromatic Polynomials of Some Families
                                  of Graphs  . . . . . . . . . . . . . . . 370--378
       Michael J. Pelsmajer and   
            Marcus Schaefer and   
         Daniel \vStefankovi\vc   Removing Independently Even Crossings    379--393
                 David G. Glynn   The Conjectures of Alon--Tarsi and Rota
                                  in Dimension Prime Minus One . . . . . . 394--399
        Jean-Claude Bermond and   
        Charles J. Colbourn and   
           Lucia Gionfriddo and   
        Gaetano Quattrocchi and   
                     Ignasi Sau   Drop Cost and Wavelength Optimal
                                  Two-Period Grooming with Ratio $4$ . . . 400--419
          Jeannette Janssen and   
                    Pawe Pra at   Rank-Based Attachment Leads to Power Law
                                  Graphs . . . . . . . . . . . . . . . . . 420--440
          Graham Brightwell and   
        Gérard Cohen and   
           Emanuela Fachini and   
        Marianne Fairthorne and   
   János Körner and   
       Gábor Simonyi and   
       Ágnes Tóth   Permutation Capacities of Families of
                                  Oriented Infinite Paths  . . . . . . . . 441--456
                   Klaus Jansen   An EPTAS for Scheduling Jobs on Uniform
                                  Processors: Using an MILP Relaxation
                                  with a Constant Number of Integral
                                  Variables  . . . . . . . . . . . . . . . 457--485
          Andrzej Czygrinow and   
             Louis DeBiasio and   
                H. A. Kierstead   $2$-Factors of Bipartite Graphs with
                                  Asymmetric Minimum Degrees . . . . . . . 486--504
                Ernie Croot and   
                   Derrick Hart   $h$-Fold Sums from a Set with Few
                                  Products . . . . . . . . . . . . . . . . 505--519
           David J. Abraham and   
            Telikepalli Kavitha   Voting Paths . . . . . . . . . . . . . . 520--537
                    R. Ravi and   
                  Amitabh Sinha   Approximation Algorithms for
                                  Multicommodity Facility Location
                                  Problems . . . . . . . . . . . . . . . . 538--551
     Agnieszka Görlich and   
                  Andrzej \.Zak   On Packable Digraphs . . . . . . . . . . 552--557
               Colin Cooper and   
                Alan Frieze and   
            Michael Krivelevich   Hamilton Cycles in Random Graphs with a
                                  Fixed Degree Sequence  . . . . . . . . . 558--569
            Aviezri S. Fraenkel   Complementary Iterated Floor Words and
                                  the Flora Game . . . . . . . . . . . . . 570--588
                 Jong Yoon Hyun   A Subgroup of the Full Poset-Isometry
                                  Group  . . . . . . . . . . . . . . . . . 589--599
                     Peter Borg   Cross-Intersecting Families of Partial
                                  Permutations . . . . . . . . . . . . . . 600--608
               Oren Weimann and   
                 Raphael Yuster   Computing the Girth of a Planar Graph in
                                  $O(n \log n)$ Time . . . . . . . . . . . 609--616
               Hung-Min Sun and   
              Huaxiong Wang and   
                Bying-He Ku and   
                 Josef Pieprzyk   Decomposition Construction for Secret
                                  Sharing Schemes with Graph Access
                                  Structures in Polynomial Time  . . . . . 617--638
            Mindaugas Bloznelis   Component Evolution in General Random
                                  Intersection Graphs  . . . . . . . . . . 639--654
              Ivan Soprunov and   
                Jenya Soprunova   Bringing Toric Codes to the Next
                                  Dimension  . . . . . . . . . . . . . . . 655--665
             Stephan Brandt and   
             Jozef Mi\vskuf and   
          Dieter Rautenbach and   
            Friedrich Regen and   
                  Imre Z. Ruzsa   Edge-Injective and Edge-Surjective
                                  Vertex Labellings  . . . . . . . . . . . 666--683
       Brian D. O. Anderson and   
                Iman Shames and   
               Guoqiang Mao and   
                  Bari\cs Fidan   Formal Theory of Noisy Sensor Network
                                  Localization . . . . . . . . . . . . . . 684--698
       Franti\vsek Kardo\vs and   
           Dan Král' and   
   Jean-Sébastien Sereni   The Last Fraction of a Fractional
                                  Conjecture . . . . . . . . . . . . . . . 699--707

SIAM Journal on Discrete Mathematics
Volume 24, Number 3, 2010

      Demetres Christofides and   
              Peter Keevash and   
          Daniela Kühn and   
                   Deryk Osthus   A Semiexact Degree Condition for
                                  Hamilton Cycles in Digraphs  . . . . . . 709--756
        Péter Csorba and   
          Cor A. J. Hurkens and   
           Gerhard J. Woeginger   The Alcuin Number of a Graph and Its
                                  Connections to the Vertex Cover Number   757--769
              Henning Bruhn and   
                     Maya Stein   $t$-Perfection Is Always Strong for
                                  Claw-Free Graphs . . . . . . . . . . . . 770--781
                    Uriel Feige   On Optimal Strategies for a Hat Game on
                                  Graphs . . . . . . . . . . . . . . . . . 782--791
       Rodrigo de A. Hausen and   
              Luerbio Faria and   
 Celina M. H. de Figueiredo and   
         Luis Antonio B. Kowada   Unitary Toric Classes, the Reality and
                                  Desire Diagram, and Sorting by
                                  Transpositions . . . . . . . . . . . . . 792--807
               Randy Cogill and   
                     Cheng Peng   A Spanning Tree Method for Bounding
                                  Hitting Times of Random Walks on Graphs  808--820
           C. Cortés and   
                C. I. Grima and   
                 F. Hurtado and   
          A. Márquez and   
                  F. Santos and   
                  J. Valenzuela   Transforming Triangulations on Nonplanar
                                  Surfaces . . . . . . . . . . . . . . . . 821--840
              N. R. Aravind and   
              C. R. Subramanian   Bounds on Edge Colorings with
                                  Restrictions on the Union of Color
                                  Classes  . . . . . . . . . . . . . . . . 841--852
             Marco Di Summa and   
             Laurence A. Wolsey   Lot-Sizing with Stock Upper Bounds and
                                  Fixed Charges  . . . . . . . . . . . . . 853--875
               Stephen Suen and   
                Kevin P. Wagner   Some Results for the Acceptance Urn
                                  Model  . . . . . . . . . . . . . . . . . 876--891
                  Noga Alon and   
               Ohad N. Feldheim   The Brunn--Minkowski Inequality and
                                  Nontrivial Cycles in the Discrete Torus  892--894
               Andrew Beveridge   Connectivity of Random Cubic Sum Graphs  895--909
               Rom Pinchasi and   
                   Allan Pinkus   Dominating Subsets under Projections . . 910--920
     Petter Brändén   Discrete Concavity and the Half-Plane
                                  Property . . . . . . . . . . . . . . . . 921--933
   Zden\vek Dvo\vrák and   
     Bernard Lidický and   
             Riste \vSkrekovski   3-Choosability of Triangle-Free Planar
                                  Graphs with Constraints on 4-Cycles  . . 934--945
          Alexander A. Razborov   On 3-Hypergraphs with Forbidden 4-Vertex
                                  Configurations . . . . . . . . . . . . . 946--963
         Zoltan Füredi and   
                 Ida Kantor and   
               Angelo Monti and   
              Blerina Sinaimeri   On Reverse-Free Codes and Permutations   964--978
         Bo\vstjan Bre\vsar and   
            Sandi Klav\vzar and   
                Douglas F. Rall   Domination Game and an Imagination
                                  Strategy . . . . . . . . . . . . . . . . 979--991
                  E. Algaba and   
               J. M. Bilbao and   
                     M. Slikker   A Value for Games Restricted by
                                  Augmenting Systems . . . . . . . . . . . 992--1010
       József Balogh and   
               Wojciech Samotij   Almost All $C_4$-Free Graphs Have Fewer
                                  than $(1 - \varepsilon)\,
                                  \mathrm{ex}(n,C_4)$ Edges  . . . . . . . 1011--1018
                  Satoshi Murai   On Face Vectors of Barycentric
                                  Subdivisions of Manifolds  . . . . . . . 1019--1037
                  Tao Jiang and   
              Oleg Pikhurko and   
                 Zelealem Yilma   Set Systems without a Strong Simplex . . 1038--1045
                 Tom Bohman and   
              Andrzej Dudek and   
                Alan Frieze and   
                  Oleg Pikhurko   Flips in Graphs  . . . . . . . . . . . . 1046--1055
                Arjen Stolk and   
             K. Joost Batenburg   An Algebraic Framework for Discrete
                                  Tomography: Revealing the Structure of
                                  Dependencies . . . . . . . . . . . . . . 1056--1079
             Samuel Fiorini and   
           Gianpaolo Oriolo and   
             Laura Sanit\`a and   
              Dirk Oliver Theis   The VPN Problem with Concave Costs . . . 1080--1090
            Robert Lukot'ka and   
        Ján Mazák   Cubic Graphs with Given Circular
                                  Chromatic Index  . . . . . . . . . . . . 1091--1103
                   A. Franc and   
                 M. Goulard and   
                     N. Peyrard   Chordal Graphs to Identify Graphical
                                  Model Solutions of Maximum of Entropy
                                  Under Constraints on Marginals . . . . . 1104--1116
      Deeparnab Chakrabarty and   
          Nikhil R. Devanur and   
              Vijay V. Vazirani   Rationality and Strongly Polynomial
                                  Solvability of Eisenberg--Gale Markets
                                  with Two Agents  . . . . . . . . . . . . 1117--1136
               P. E. Haxell and   
                  G. T. Wilfong   On the Stable Paths Problem  . . . . . . 1137--1152
                    Ngo Dac Tan   3-Arc-Dominated Digraphs . . . . . . . . 1153--1161
               Colin Cooper and   
                    Alan Frieze   Random Walks with Look-Ahead in
                                  Scale-Free Random Graphs . . . . . . . . 1162--1176
          Adrian Dumitrescu and   
                   Howi Kok and   
              Ichiro Suzuki and   
                Pawe \.Zylinski   Vision-Based Pursuit-Evasion in a Grid   1177--1204
             Benjamin Doerr and   
                   Mahmoud Fouz   Hereditary Discrepancies in Different
                                  Numbers of Colors II . . . . . . . . . . 1205--1213

SIAM Journal on Discrete Mathematics
Volume 24, Number 4, 2010

        Julia Böttcher and   
               Peter Heinig and   
                   Anusch Taraz   Embedding into Bipartite Graphs  . . . . 1215--1233
                  Zihui Liu and   
                   Jie Wang and   
                     Xin-Wen Wu   On the Relative Generalized Hamming
                                  Weights of Linear Codes and their
                                  Subcodes . . . . . . . . . . . . . . . . 1234--1241
                 Linyuan Lu and   
                    Yiting Yang   A Lower Bound on the Transposition
                                  Diameter . . . . . . . . . . . . . . . . 1242--1249
              Stefan Forcey and   
                Aaron Lauve and   
                  Frank Sottile   Hopf Structures on the Multiplihedra . . 1250--1271
         William Y. C. Chen and   
          Andrew Y. Z. Wang and   
           Catherine H. Yan and   
               Alina F. Y. Zhao   Mixed Statistics on 01-Fillings of Moon
                                  Polyominoes  . . . . . . . . . . . . . . 1272--1290
                  Bernd Schulze   Symmetry as a Sufficient Condition for a
                                  Finite Flex  . . . . . . . . . . . . . . 1291--1312
                      Jacob Fox   Complete Minors and Independence Number  1313--1321
                Leizhen Cai and   
               Yongxi Cheng and   
                Elad Verbin and   
                      Yuan Zhou   Surviving Rates of Graphs with Bounded
                                  Treewidth for the Firefighter Problem    1322--1335
         Michael A. Henning and   
                     Anders Yeo   Strong Transversals in Hypergraphs and
                                  Double Total Domination in Graphs  . . . 1336--1355
              Nicholas A. Loehr   Abacus Proofs of Schur Function
                                  Identities . . . . . . . . . . . . . . . 1356--1370
                   Erez Louidor   The Tradeoff Function for a Class of
                                  $\mathrm{RLL}(d,k)$ Constraints  . . . . 1371--1398
   Hans-Jürgen Bandelt and   
              Victor Chepoi and   
                 David Eppstein   Combinatorics and Geometry of Finite and
                                  Infinite Squaregraphs  . . . . . . . . . 1399--1440
          Reuven Bar-Yehuda and   
                Guy Flysher and   
       Julián Mestre and   
                    Dror Rawitz   Approximation of Partial Capacitated
                                  Vertex Cover . . . . . . . . . . . . . . 1441--1469
                     Suil O and   
          Sebastian M. Cioab\ua   Edge-Connectivity, Eigenvalues, and
                                  Matchings in Regular Graphs  . . . . . . 1470--1481
                Wei-Tian Li and   
                 Linyuan Lu and   
                    Yiting Yang   Routing Numbers of Cycles, Complete
                                  Bipartite Graphs, and Hypercubes . . . . 1482--1494
            Michael Krivelevich   Embedding Spanning Trees in Random
                                  Graphs . . . . . . . . . . . . . . . . . 1495--1500
             Anna Adamaszek and   
                Micha Adamaszek   Large-Girth Roots of Graphs  . . . . . . 1501--1514
                 Zhishi Pan and   
                     Xuding Zhu   Multiple Coloring of Cone Graphs . . . . 1515--1526
                  Yusuke Suzuki   Re-embeddings of Maximum 1-Planar Graphs 1527--1540
            Walid Ben-Ameur and   
                 Makhlouf Hadji   Designing Steiner Networks with
                                  Unicyclic Connected Components: An Easy
                                  Problem  . . . . . . . . . . . . . . . . 1541--1557
                  F. Colomo and   
                   A. G. Pronko   The Limit Shape of Large Alternating
                                  Sign Matrices  . . . . . . . . . . . . . 1558--1571
                   Rong Luo and   
Jean-Sébastien Sereni and   
    D. Christopher Stephens and   
                       Gexin Yu   Equitable Coloring of Sparse Planar
                                  Graphs . . . . . . . . . . . . . . . . . 1572--1583
                     Maya Stein   Ends and Vertices of Small Degree in
                                  Infinite Minimally $k$-(Edge)-Connected
                                  Graphs . . . . . . . . . . . . . . . . . 1584--1596
              Shinya Fujita and   
                      Henry Liu   The Balanced Decomposition Number and
                                  Vertex Connectivity  . . . . . . . . . . 1597--1616
               Max A. Alekseyev   On the Number of Two-Dimensional
                                  Threshold Functions  . . . . . . . . . . 1617--1631
              David R. Wood and   
                Svante Linusson   Thomassen's Choosability Argument
                                  Revisited  . . . . . . . . . . . . . . . 1632--1637
               David Hartvigsen   Neighbor Systems and the Greedy
                                  Algorithm  . . . . . . . . . . . . . . . 1638--1661
                  Jiong Guo and   
      Christian Komusiewicz and   
           Rolf Niedermeier and   
               Johannes Uhlmann   A More Relaxed Model for Graph-Based
                                  Data Clustering: $s$-Plex Cluster
                                  Editing  . . . . . . . . . . . . . . . . 1662--1683
             Nets Hawk Katz and   
                   Paul Koester   On Additive Doubling and Energy  . . . . 1684--1693
      Andrea E. F. Clementi and   
              Claudio Macci and   
               Angelo Monti and   
         Francesco Pasquale and   
             Riccardo Silvestri   Flooding Time of Edge-Markovian Evolving
                                  Graphs . . . . . . . . . . . . . . . . . 1694--1712
             Sergio Cabello and   
               Günter Rote   Obnoxious Centers in Graphs  . . . . . . 1713--1730
                    Paul Wollan   Bridges in Highly Connected Graphs . . . 1731--1741
                Joseph E. Bonin   A Construction of Infinite Sets of
                                  Intertwines for Pairs of Matroids  . . . 1742--1752
            Ömer Egecioglu   Bessel Polynomials and the Partial Sums
                                  of the Exponential Series  . . . . . . . 1753--1762


SIAM Journal on Discrete Mathematics
Volume 25, Number 1, 2011

            Mourad Ba\"\iou and   
         Francisco Barahona and   
                    Jose Correa   On the $p$-Median Polytope and the
                                  Intersection Property: Polyhedra and
                                  Algorithms . . . . . . . . . . . . . . . 1--20
    György Dósa and   
                   Leah Epstein   Preemptive Online Scheduling with
                                  Reordering . . . . . . . . . . . . . . . 21--49
               Alina Ostafe and   
            Igor E. Shparlinski   Pseudorandomness and Dynamics of Fermat
                                  Quotients  . . . . . . . . . . . . . . . 50--71
         Christine T. Cheng and   
                      Anhua Lin   Stable Roommates Matchings, Mirror
                                  Posets, Median Graphs, and the
                                  Local/Global Median Phenomenon in Stable
                                  Matchings  . . . . . . . . . . . . . . . 72--94
                 Markus Chimani   Facets in the Crossing Number Polytope   95--111
             Stefan Felsner and   
                 Mareike Massow   Linear Extension Diameter of Downset
                                  Lattices of Two-Dimensional Posets . . . 112--129
                   D. Magos and   
                     I. Mourtos   On the Facial Structure of the
                                  Alldifferent System  . . . . . . . . . . 130--158
                Brendon Stanton   Improved Bounds for $r$-Identifying
                                  Codes of the Hex Grid  . . . . . . . . . 159--169
         Ararat Harutyunyan and   
                    Bojan Mohar   Gallai's Theorem for List Coloring of
                                  Digraphs . . . . . . . . . . . . . . . . 170--180
              Michael Elkin and   
                   Shay Solomon   Narrow-Shallow-Low-Light Trees with and
                                  without Steiner Points . . . . . . . . . 181--210
                    Seth Pettie   Origins of Nonlinearity in
                                  Davenport--Schinzel Sequences  . . . . . 211--233
                 Omid Amini and   
            Simon Griffiths and   
                    Florian Huc   Subgraphs of Weakly Quasi-Random
                                  Oriented Graphs  . . . . . . . . . . . . 234--259
                 Serguei Norine   Turán Graphs and the Number of Colorings  260--266
                Mark Ramras and   
              Elizabeth Donovan   The Automorphism Group of a Johnson
                                  Graph  . . . . . . . . . . . . . . . . . 267--270
              Dillon Mayhew and   
              Geoff Whittle and   
          Stefan H. M. van Zwam   An Obstacle to a Decomposition Theorem
                                  for Near-Regular Matroids  . . . . . . . 271--279
             Jack E. Graver and   
                Gerald T. Cargo   When Does a Curve Bound a Distorted
                                  Disk?  . . . . . . . . . . . . . . . . . 280--305
           Feodor F. Dragan and   
                Martin Matamala   Navigating in a Graph by Aid of Its
                                  Spanning Tree Metric . . . . . . . . . . 306--332
Jérémie Chalopin and   
              Victor Chepoi and   
              Nicolas Nisse and   
                   Yann Vax\`es   Cop and Robber Games When the Robber Can
                                  Hide and Ride  . . . . . . . . . . . . . 333--359
            Federico Ardila and   
              Matthias Beck and   
              Serkan Hosten and   
             Julian Pfeifle and   
                   Kim Seashore   Root Polytopes and Growth Series of Root
                                  Lattices . . . . . . . . . . . . . . . . 360--378
   Diego A. Morán R. and   
                 Santanu S. Dey   On Maximal $S$-Free Convex Sets  . . . . 379--393
                Xiaodong Xu and   
                 Zehui Shao and   
     Stanis\law P. Radziszowski   More Constructive Lower Bounds on
                                  Classical Ramsey Numbers . . . . . . . . 394--400
                  Rok Erman and   
Frédéric Havet and   
     Bernard Lidický and   
          Ondrej Pangrác   5-Coloring Graphs with 4 Crossings . . . 401--422
                 Omer Angel and   
           Alexander E. Holroyd   Rotor Walks on General Trees . . . . . . 423--446
                   Jang Soo Kim   Front Representation of Set Partitions   447--461

SIAM Journal on Discrete Mathematics
Volume 25, Number 2, 2011

            Manu Basavaraju and   
          L. Sunil Chandran and   
              Nathann Cohen and   
Frédéric Havet and   
             Tobias Müller   Acyclic Edge-Coloring of Planar Graphs   463--478
          Emilio Di Giacomo and   
         Francesco Giordano and   
                Giuseppe Liotta   Upward Topological Book Embeddings of
                                  DAGs . . . . . . . . . . . . . . . . . . 479--489
              Cynthia Loten and   
                  Claude Tardif   Near-Unanimity Polymorphisms on
                                  Structures with Finite Duality . . . . . 490--496
             David Richerby and   
          Dimitrios M. Thilikos   Searching for a Visible, Lazy Fugitive   497--513
               Ross J. Kang and   
Jean-Sébastien Sereni and   
           Matej Stehlík   Every Plane Graph of Maximum Degree $8$
                                  has an Edge-Face $9$-Coloring  . . . . . 514--533
                 Michel Mollard   On Vertex Partitions of Hypercubes by
                                  Isometric Trees  . . . . . . . . . . . . 534--538
                A. M. Hamel and   
                     R. C. King   Bijective Proof of a Symplectic Dual
                                  Pair Identity  . . . . . . . . . . . . . 539--560
               Shaofan Wang and   
               Renhong Wang and   
                 Dehui Kong and   
                     Baocai Yin   Estimate of the Bézout Number for Linear
                                  Piecewise Algebraic Curves Over
                                  Arbitrary Triangulations . . . . . . . . 561--582
                  Jiong Guo and   
           Rolf Niedermeier and   
            Ondrej Suchý   Parameterized Complexity of Arc-Weighted
                                  Directed Steiner Problems  . . . . . . . 583--599
              J.-C. Bermond and   
                 Y. M. Chee and   
                   N. Cohen and   
                       X. Zhang   The $\alpha$-Arboricity of Complete
                                  Uniform Hypergraphs  . . . . . . . . . . 600--610
                 Zhao Zhang and   
                         Hao Li   Eulerian Subgraphs Containing Given
                                  Vertices . . . . . . . . . . . . . . . . 611--621
             Shalom Eliahou and   
Jorge Ramírez Alfonsín   Two-Generator Numerical Semigroups and
                                  Fermat and Mersenne Numbers  . . . . . . 622--630
                  Noga Alon and   
             Dániel Marx   Sparse Balanced Partitions and the
                                  Complexity of Subgraph Problems  . . . . 631--644
               Birgit van Dalen   Boundary Length of Reconstructions in
                                  Discrete Tomography  . . . . . . . . . . 645--659
                     Yufei Zhao   The Bipartite Swapping Trick on Graph
                                  Homomorphisms  . . . . . . . . . . . . . 660--680
                    Le Anh Vinh   The Erd\Hos--Falconer Distance Problem
                                  on the Unit Sphere in Vector Spaces Over
                                  Finite Fields  . . . . . . . . . . . . . 681--684
            Evan Borenstein and   
                    Ernie Croot   On a Certain Generalization of the
                                  Balog--Szemerédi--Gowers Theorem  . . . . 685--694
László A. Végh   Augmenting Undirected Node-Connectivity
                                  by One . . . . . . . . . . . . . . . . . 695--718
                   Shira Zerbib   On the Zone Complexity of a Vertex . . . 719--730
             Marco Di Summa and   
             Laurence A. Wolsey   Erratum: Lot-Sizing with Stock Upper
                                  Bounds and Fixed Charges . . . . . . . . 731--732
         Marc Mézard and   
                  Prasad Tetali   Special Section on Constraint
                                  Satisfaction Problems and Message
                                  Passing Algorithms . . . . . . . . . . . 733--735
                Uriel Feige and   
         Abraham D. Flaxman and   
                  Dan Vilenchik   On the Diameter of the Set of Satisfying
                                  Assignments in Random Satisfiable
                                  $k$-CNF Formulas . . . . . . . . . . . . 736--749
     Lenka Zdeborová and   
               Florent Krzakala   Quiet Planting in the Locked Constraint
                                  Satisfaction Problems  . . . . . . . . . 750--770
           Andrea Montanari and   
           Ricardo Restrepo and   
                  Prasad Tetali   Reconstruction and Clustering in Random
                                  Constraint Satisfaction Problems . . . . 771--808
        Nayantara Bhatnagar and   
                  Juan Vera and   
                Eric Vigoda and   
                     Dror Weitz   Reconstruction for Colorings on Trees    809--826
                  B. Lucier and   
                      M. Molloy   The Glauber Dynamics for Colorings of
                                  Bounded Degree Trees . . . . . . . . . . 827--853
        Nayantara Bhatnagar and   
                  Elitza Maneva   A Computational Method for Bounding the
                                  Probability of Reconstruction on Trees   854--871
    Constantinos Daskalakis and   
            Elchanan Mossel and   
                 Sebastien Roch   Phylogenies without Branch Bounds:
                                  Contracting the Short, Pruning the Deep  872--893
               David Galvin and   
           Fabio Martinelli and   
             Kavita Ramanan and   
                  Prasad Tetali   The Multistate Hard Core Model on a
                                  Regular Tree . . . . . . . . . . . . . . 894--915
            Manuel Bodirsky and   
            Daniel Král'   Limit Behavior of Locally Consistent
                                  Constraint Satisfaction Problems . . . . 916--933
              Steven Jaslar and   
               Sekhar Tatikonda   Maximum Weight Partial Colorings on
                                  Sparse Random Graphs . . . . . . . . . . 934--955
          Shrinivas Kudekar and   
                 Nicolas Macris   Decay of Correlations for Sparse Graph
                                  Error Correcting Codes . . . . . . . . . 956--988
              Mohsen Bayati and   
            Christian Borgs and   
            Jennifer Chayes and   
              Riccardo Zecchina   Belief Propagation for Weighted
                                  $b$-Matchings on Arbitrary Graphs and
                                  its Relation to Linear Programs with
                                  Integer Solutions  . . . . . . . . . . . 989--1011
      Venkat Chandrasekaran and   
             Misha Chertkov and   
             David Gamarnik and   
              Devavrat Shah and   
                    Jinwoo Shin   Counting Independent Sets Using the
                                  Bethe Approximation  . . . . . . . . . . 1012--1034

SIAM Journal on Discrete Mathematics
Volume 25, Number 3, 2011

                Yijin Zhang and   
            Kenneth W. Shum and   
                Wing Shing Wong   Strongly Conflict-Avoiding Codes . . . . 1035--1053
              Joshua Cooper and   
             Stephen Fenner and   
                  Semmy Purewal   Monochromatic Boxes in Colored Grids . . 1054--1068
        Tomás Kaiser and   
        Ondrej Rucký and   
               Riste Skrekovski   Graphs with Odd Cycle Lengths $5$ and
                                  $7$ are $3$-Colorable  . . . . . . . . . 1069--1088
         MohammadAli Safari and   
       Mohammad R. Salavatipour   A Constant Factor Approximation for
                                  Minimum $\lambda$-Edge-Connected
                                  $k$-Subgraph with Metric Costs . . . . . 1089--1102
                 F. M. Dong and   
                   Bill Jackson   A Zero-Free Interval for Chromatic
                                  Polynomials of Nearly $3$-Connected
                                  Plane Graphs . . . . . . . . . . . . . . 1103--1118
                  Hiroshi Hirai   Folder Complexes and Multiflow
                                  Combinatorial Dualities  . . . . . . . . 1119--1143
                  Fumei Lam and   
               Dan Gusfield and   
                Srinath Sridhar   Generalizing the Splits Equivalence
                                  Theorem and Four Gamete Condition:
                                  Perfect Phylogeny on Three-State
                                  Characters . . . . . . . . . . . . . . . 1144--1175
           Sonny Ben-Shimon and   
        Michael Krivelevich and   
                  Benny Sudakov   On the Resilience of Hamiltonicity and
                                  Optimal Packing of Hamilton Cycles in
                                  Random Graphs  . . . . . . . . . . . . . 1176--1193
         Daniel Stefankovic and   
                    Eric Vigoda   Fast Convergence of Markov Chain Monte
                                  Carlo Algorithms for Phylogenetic
                                  Reconstruction with Homogeneous Data on
                                  Closely Related Species  . . . . . . . . 1194--1211
                 Viktor Harangi   Acute Sets In Euclidean Spaces . . . . . 1212--1229
               Leah Epstein and   
                 Asaf Levin and   
                   Rob van Stee   Max-min Online Allocations with a
                                  Reordering Buffer  . . . . . . . . . . . 1230--1250
               Leah Epstein and   
                 Asaf Levin and   
       Julián Mestre and   
                    Danny Segev   Improved Approximation Guarantees for
                                  Weighted Matching in the Semi-streaming
                                  Model  . . . . . . . . . . . . . . . . . 1251--1265
                 Jovisa Zuni\'c   Note on the Number of Two-Dimensional
                                  Threshold Functions  . . . . . . . . . . 1266--1268
             Ross Churchley and   
                     Jing Huang   Line-Polar Graphs: Characterization and
                                  Recognition  . . . . . . . . . . . . . . 1269--1284
                Liangpan Li and   
            Oliver Roche-Newton   An improved sum-product estimate for
                                  general finite fields  . . . . . . . . . 1285--1296
              Andrew Berget and   
                Sen-Peng Eu and   
                  Victor Reiner   Constructions for Cyclic Sieving
                                  Phenomena  . . . . . . . . . . . . . . . 1297--1314
Laura Chávez-Lomelí and   
                Luis Goddyn and   
     Winfried Hochstättler   Balancing Covectors  . . . . . . . . . . 1315--1318
               M. Kalkowski and   
              M. Karo\'nski and   
                     F. Pfender   A New Upper Bound for the Irregularity
                                  Strength of Graphs . . . . . . . . . . . 1319--1321
     Ken-ichi Kawarabayashi and   
               Yusuke Kobayashi   An Improved Algorithm for the
                                  Half-Disjoint Paths Problem  . . . . . . 1322--1330
             Fedor V. Fomin and   
           Petr A. Golovach and   
          Dimitrios M. Thilikos   Approximating Width Parameters of
                                  Hypergraphs with Excluded Minors . . . . 1331--1348
           Joshua A. Taylor and   
                 Franz S. Hover   Laplacians for flow networks . . . . . . 1349--1364
                 Mira Gonen and   
                   Dana Ron and   
                  Yuval Shavitt   Counting Stars and Other Small Subgraphs
                                  in Sublinear-Time  . . . . . . . . . . . 1365--1411
               Chase Albert and   
               Chi-Kwong Li and   
             Gilbert Strang and   
                       Gexin Yu   Permutations as Product of Parallel
                                  Transpositions . . . . . . . . . . . . . 1412--1417
            Pinar Heggernes and   
          Daniel Lokshtanov and   
               Rodica Mihai and   
            Charis Papadopoulos   Cutwidth of Split Graphs and Threshold
                                  Graphs . . . . . . . . . . . . . . . . . 1418--1437
                 Alex Scott and   
                  Benny Sudakov   A Bound for the Cops and Robbers Problem 1438--1442
    Daniel Gonçalves and   
           Alexandre Pinlou and   
           Michaël Rao and   
 Stéphan Thomassé   The Domination Number of Grids . . . . . 1443--1453
           Frantisek Kardos and   
        Daniel Král' and   
                      Jan Volec   Fractional colorings of cubic graphs
                                  with large girth . . . . . . . . . . . . 1454--1476

SIAM Journal on Discrete Mathematics
Volume 25, Number 4, 2011

          Andrzej Czygrinow and   
                 Louis DeBiasio   A Note on Bipartite Graph Tiling . . . . 1477--1489
        Xavier Muñoz and   
                 Zhentao Li and   
                     Ignasi Sau   Edge-Partitioning Regular Graphs for
                                  Ring Traffic Grooming with a Priori
                                  Placement of the ADMs  . . . . . . . . . 1490--1505
                     Megan Owen   Computing Geodesic Distances in Tree
                                  Space  . . . . . . . . . . . . . . . . . 1506--1529
         William Y. C. Chen and   
             Neil J. Y. Fan and   
              Jeffrey Y. T. Jia   Labeled Ballot Paths and the Springer
                                  Numbers  . . . . . . . . . . . . . . . . 1530--1546
                    Fei Gao and   
                     Gennian Ge   A Complete Generalization of Clatworthy
                                  Group Divisible Designs  . . . . . . . . 1547--1561
           Ronitt Rubinfeld and   
                   Asaf Shapira   Sublinear Time Algorithms  . . . . . . . 1562--1588
            Peter Gritzmann and   
           Barbara Langfeld and   
              Markus Wiegelmann   Uniqueness in Discrete Tomography: Three
                                  Remarks and a Corollary  . . . . . . . . 1589--1599
             Sergio Cabello and   
Éric Colin de Verdi\`ere and   
                Francis Lazarus   Finding Cycles with Topological
                                  Properties in Embedded Graphs  . . . . . 1600--1614
             Michael Drmota and   
           Éric Fusy and   
                Mihyun Kang and   
             Veronika Kraus and   
              Juanjo Rué   Asymptotic Study of Subcritical Graph
                                  Classes  . . . . . . . . . . . . . . . . 1615--1651
                Paul Bonsma and   
               Florian Zickfeld   A $3/2$-Approximation Algorithm for
                                  Finding Spanning Trees with Many Leaves
                                  in Cubic Graphs  . . . . . . . . . . . . 1652--1666
                  Henry Lin and   
            Tim Roughgarden and   
          Éva Tardos and   
                 Asher Walkover   Stronger Bounds on Braess's Paradox and
                                  the Maximum Latency of Selfish Routing   1667--1686
              Abhijin Adiga and   
          Diptendu Bhowmick and   
              L. Sunil Chandran   Boxicity and Poset Dimension . . . . . . 1687--1698
             Hiroshi Nozaki and   
                       Sho Suda   Bounds on $s$-Distance Sets with
                                  Strength $t$ . . . . . . . . . . . . . . 1699--1713
             Geir Agnarsson and   
             Jill Bigley Dunham   A Note on the Maximum Number of Edges of
                                  Nonflowerable Coin Graphs  . . . . . . . 1714--1721
                  Sagi Snir and   
                 Raphael Yuster   A Linear Time Approximation Scheme for
                                  Maximum Quartet Consistency on Sparse
                                  Sampled Inputs . . . . . . . . . . . . . 1722--1736
        Tomás Kaiser and   
       Matej Stehlík and   
               Riste Skrekovski   On the $2$-Resonance of Fullerenes . . . 1737--1745
       Zdenek Dvorák and   
     Bernard Lidický and   
               Riste Skrekovski   Graphs with Two Crossings Are
                                  $5$-Choosable  . . . . . . . . . . . . . 1746--1753
               R. P. Anstee and   
                J. Blackman and   
                   Hangjun Yang   Perfect Matchings in Grid Graphs after
                                  Vertex Deletions . . . . . . . . . . . . 1754--1767
               Jonathan Browder   Face Numbers of Certain Cohen--Macaulay
                                  Flag Complexes . . . . . . . . . . . . . 1768--1777
                R. Ahlswede and   
                    H. Aydinian   On Security of Statistical Databases . . 1778--1791
      Nicholas J. A. Harvey and   
 Tamás Király and   
                    Lap Chi Lau   On Disjoint Common Bases in Two Matroids 1792--1803
        Tomás Kaiser and   
    Mickaël Montassier and   
           André Raspaud   Covering a Graph by Forests and a
                                  Matching . . . . . . . . . . . . . . . . 1804--1811
              Todd Cochrane and   
                Sergei Konyagin   Proof of the Goresky Klapper Conjecture
                                  on Decimations of $L$-sequences  . . . . 1812--1831
             Antonio Blanca and   
               Anant P. Godbole   On Universal Cycles for new Classes of
                                  Combinatorial Structures . . . . . . . . 1832--1842
        Tewodros Amdeberhan and   
Mahír Bílen Can and   
                 Victor H. Moll   Broken Bracelets, Molien Series,
                                  Paraffin Wax, and an Elliptic Curve of
                                  Conductor $48$ . . . . . . . . . . . . . 1843--1859
              Natalie Arkus and   
      Vinothan N. Manoharan and   
             Michael P. Brenner   Deriving Finite Sphere Packings  . . . . 1860--1901
             A. W. M. Dress and   
                K. T. Huber and   
                  J. Koolen and   
                     V. Moulton   Blocks and Cut Vertices of the Buneman
                                  Graph  . . . . . . . . . . . . . . . . . 1902--1919


SIAM Journal on Discrete Mathematics
Volume 26, Number 1, 2012

              Boris Alexeev and   
          Alexandra Fradkin and   
                      Ilhee Kim   Forbidden Induced Subgraphs of
                                  Double-split Graphs  . . . . . . . . . . 1--14
       Domingos Dellamonica and   
Subrahmanyam Kalyanasundaram and   
              Daniel Martin and   
          Vojtech Rödl and   
                   Asaf Shapira   A Deterministic Algorithm for the
                                  Frieze--Kannan Regularity Lemma  . . . . 15--29
            Don Coppersmith and   
               Victor S. Miller   Binary Nontiles  . . . . . . . . . . . . 30--38
              Minghui Jiang and   
             Vincent Pilaud and   
                Pedro J. Tejada   On a Dispersion Problem in Grid Labeling 39--51
               Hai-Yang Zhu and   
               Xin-Zhong Lu and   
                Cui-Qi Wang and   
                      Ming Chen   Labeling Planar Graphs without
                                  4,5-Cycles with a Condition on Distance
                                  Two  . . . . . . . . . . . . . . . . . . 52--64
              Douglas S. Stones   Formulae for the Alon--Tarsi Conjecture  65--70
  János Barát and   
  Zoltán Füredi and   
                 Ida Kantor and   
                Younjin Kim and   
    Balázs Patkós   Large $B_d$-Free and Union-free
                                  Subfamilies  . . . . . . . . . . . . . . 71--76
                Petr Gregor and   
           Riste Skrekovski and   
             Vida Vukasinovi\'c   Queue Layouts of Hypercubes  . . . . . . 77--88
              David Cook II and   
                      Uwe Nagel   Cohen--Macaulay Graphs and Face Vectors
                                  of Flag Complexes  . . . . . . . . . . . 89--101
                 Guoli Ding and   
                      Cheng Liu   A Chain Theorem for $3^+$-Connected
                                  Graphs . . . . . . . . . . . . . . . . . 102--113
               Akiyoshi Shioura   Neighbor Systems, Jump Systems, and
                                  Bisubmodular Polyhedra . . . . . . . . . 114--144
Frédéric Havet and   
                 Bruce Reed and   
   Jean-Sébastien Sereni   Griggs and Yeh's Conjecture and
                                  $L(p,1)$-labelings . . . . . . . . . . . 145--168
               Babak Farzad and   
              Dirk Oliver Theis   Random Lifts of $K_5\backslash e$ are
                                  $3$-Colorable  . . . . . . . . . . . . . 169--176
        Raphaël M. Jungers   The Synchronizing Probability Function
                                  of an Automaton  . . . . . . . . . . . . 177--192
              Chun-Hung Liu and   
                Gerard J. Chang   Roman Domination on $2$-Connected Graphs 193--205
         Alejandro Erickson and   
              Abraham Isgur and   
         Bradley W. Jackson and   
               Frank Ruskey and   
               Stephen M. Tanny   Nested Recurrence Relations with
                                  Conolly-like Solutions . . . . . . . . . 206--238
              Darryn Bryant and   
       Nicholas J. Cavenagh and   
           Barbara Maenhaut and   
                  Kyle Pula and   
                 Ian M. Wanless   Nonextendible Latin Cuboids  . . . . . . 239--249
                   Shay Solomon   The MST of Symmetric Disk Graphs (in
                                  Arbitrary Metric Spaces) is Light  . . . 250--262
               Klaus Jansen and   
              Roberto Solis-Oba   Packing Squares with Profits . . . . . . 263--279
               Wendy Finbow and   
                Elissa Ross and   
                Walter Whiteley   The Rigidity of Spherical Frameworks:
                                  Swapping Blocks and Holes  . . . . . . . 280--304
              Eyal Ackerman and   
             Radoslav Fulek and   
           Csaba D. Tóth   Graphs That Admit Polyline Drawings with
                                  Few Crossing Angles  . . . . . . . . . . 305--320
   János Körner and   
             Silvia Messuti and   
           Gábor Simonyi   Families of Graph-different Hamilton
                                  Paths  . . . . . . . . . . . . . . . . . 321--329
        Christoph Dürr and   
       Flavio Guiñez and   
                Martin Matamala   Reconstructing $3$-Colored Grids from
                                  Horizontal and Vertical Projections is
                                  NP-Hard: a Solution to the $2$-Atom
                                  Problem in Discrete Tomography . . . . . 330--352
  Domingos Dellamonica, Jr. and   
       Yoshiharu Kohayakawa and   
          Vojtech Rödl and   
             Andrzej Ruci\'nski   Universality of Random Graphs  . . . . . 353--374
               Hsin-Lung Wu and   
                 Jen-Chun Chang   Constructing Constant Composition Codes
                                  via Distance-Increasing Mappings . . . . 375--383
                Bryn Garrod and   
           Grzegorz Kubicki and   
                 Michal Morayne   How to Choose the Best Twins . . . . . . 384--398
             Vadim E. Levit and   
                Eugen Mandrescu   Vertices Belonging to All Critical Sets
                                  of a Graph . . . . . . . . . . . . . . . 399--403
            Manuel Bodirsky and   
                 Hubie Chen and   
             Tomás Feder   On the Complexity of MMSNP . . . . . . . 404--414

SIAM Journal on Discrete Mathematics
Volume 26, Number 2, 2012

            Andreas Brieden and   
                Peter Gritzmann   On Optimal Weighted Balanced
                                  Clusterings: Gravity Bodies and Power
                                  Diagrams . . . . . . . . . . . . . . . . 415--434
                 Deepak Bal and   
                    Alan Frieze   Packing Tight Hamilton Cycles in Uniform
                                  Hypergraphs  . . . . . . . . . . . . . . 435--451
             Andrew D. King and   
                 Linyuan Lu and   
                      Xing Peng   A Fractional Analogue of Brooks' Theorem 452--471
        Beáta Faller and   
                     Mike Steel   Trait-Dependent Extinction Leads to
                                  Greater Expected Biodiversity Loss . . . 472--481
      Maria Elisa Fernandes and   
            Dimitri Leemans and   
                     Mark Mixer   All Alternating Groups $A_n$ with $n
                                  \geq 12$ Have Polytopes of Rank
                                  $\lfloor\frac{n-1}{2}\rfloor$  . . . . . 482--498
             Pierre Charbit and   
      Fabien de Montgolfier and   
               Mathieu Raffinot   Linear Time Split Decomposition
                                  Revisited  . . . . . . . . . . . . . . . 499--514
               Gennadiy Averkov   On the Size of Lattice Simplices with a
                                  Single Interior Lattice Point  . . . . . 515--526
             Saori Watanabe and   
                 Kota Ishii and   
                  Masanori Sawa   A $q$-Analogue of the Addressing Problem
                                  of Graphs by Graham and Pollak . . . . . 527--536
              Svante Janson and   
                    Yuval Peres   Hitting Times for Random Walks with
                                  Restarts . . . . . . . . . . . . . . . . 537--547
                     Boris Bukh   Multidimensional Kruskal--Katona Theorem 548--554
            Brandon Humpert and   
               Jeremy L. Martin   The Incidence Hopf Algebra of Graphs . . 555--570
             Fedor V. Fomin and   
           Petr A. Golovach and   
                   Pawel Pralat   Cops and Robber with Constraints . . . . 571--590
           Yusuke Kobayashi and   
                 Yuichi Yoshida   Algorithms for Finding a Maximum
                                  Non-$k$-Linked Graph . . . . . . . . . . 591--604
               Frank Ruskey and   
                 Joe Sawada and   
                 Aaron Williams   De Bruijn Sequences for Fixed-Weight
                                  Binary Strings . . . . . . . . . . . . . 605--617
        Arnab Bhattacharyya and   
           Elena Grigorescu and   
                 Madhav Jha and   
                Kyomin Jung and   
        Sofya Raskhodnikova and   
              David P. Woodruff   Lower Bounds for Local Monotonicity
                                  Reconstruction from Transitive-Closure
                                  Spanners . . . . . . . . . . . . . . . . 618--646
        Daniel Král' and   
                Matjaz Krnc and   
               Martin Kupec and   
                Borut Luzar and   
                      Jan Volec   Extending Fractional Precolorings  . . . 647--660
          Atsuhiro Nakamoto and   
              Katsuhiro Ota and   
                    Kenta Ozeki   Book Embedding of Toroidal Bipartite
                                  Graphs . . . . . . . . . . . . . . . . . 661--669
        Michael Krivelevich and   
               Reto Spöhel   Creating Small Subgraphs in Achlioptas
                                  Processes With Growing Parameter . . . . 670--686
         Michael A. Henning and   
                     Anders Yeo   Vertex Disjoint Cycles of Different
                                  Length in Digraphs . . . . . . . . . . . 687--694
                 Omid Amini and   
             Fedor V. Fomin and   
                  Saket Saurabh   Counting Subgraphs via Homomorphisms . . 695--717
                 Zvi Lotker and   
           Boaz Patt-Shamir and   
                    Dror Rawitz   Rent, Lease, or Buy: Randomized
                                  Algorithms for Multislope Ski Rental . . 718--736
  Zoltán Füredi and   
                    Attila Sali   Optimal Multivalued Shattering . . . . . 737--744
          Tomoki Nakamigawa and   
             Norihide Tokushige   Counting Lattice Paths via a New Cycle
                                  Lemma  . . . . . . . . . . . . . . . . . 745--754
              Dillon Mayhew and   
                   Gordon Royle   The Internally $4$-Connected Binary
                                  Matroids with No $M(K_5\backslash
                                  e)$-Minor  . . . . . . . . . . . . . . . 755--767
         Harold Connamacher and   
                 Michael Molloy   The Satisfiability Threshold for a
                                  Seemingly Intractable Random Constraint
                                  Satisfaction Problem . . . . . . . . . . 768--800
                Julie Delon and   
             Julien Salomon and   
              Andrei Sobolevski   Local Matching Indicators for Transport
                                  Problems with Concave Costs  . . . . . . 801--827
            D. Dzindzalieta and   
             T. Juskevicius and   
                    M. Sileikis   Optimal Probability Inequalities for
                                  Random Walks Related to Problems in
                                  Extremal Combinatorics . . . . . . . . . 828--837
            John Goldwasser and   
                    John Talbot   Vertex Ramsey Problems in the Hypercube  838--853
                 Seth Sullivant   The Disentangling Number for
                                  Phylogenetic Mixtures  . . . . . . . . . 856--859
           Maria Chudnovsky and   
                   Paul Seymour   Growing Without Cloning  . . . . . . . . 860--880

SIAM Journal on Discrete Mathematics
Volume 26, Number 3, 2012

                 David G. Glynn   An Invariant for Hypersurfaces in Prime
                                  Characteristic . . . . . . . . . . . . . 881--883
        Daniel Král' and   
Jean-Sébastien Sereni and   
                Ladislav Stacho   Min-Max Relations for Odd Cycles in
                                  Planar Graphs  . . . . . . . . . . . . . 884--895
              Vijay V. Vazirani   Rational Convex Programs and Efficient
                                  Algorithms for $2$-Player Nash and
                                  Nonsymmetric Bargaining Games  . . . . . 896--918
          Charles A. Cusack and   
              Timothy Lewis and   
             Daniel Simpson and   
                 Samuel Taggart   The Complexity of Pebbling in Diameter
                                  Two Graphs . . . . . . . . . . . . . . . 919--928
          Rommel M. Barbosa and   
         Erika M. M. Coelho and   
           Mitre C. Dourado and   
          Dieter Rautenbach and   
           Jayme L. Szwarcfiter   On the Carathéodory Number for the
                                  Convexity of Paths of Order Three  . . . 929--939
         George B. Mertzios and   
               Derek G. Corneil   A Simple Polynomial Algorithm for the
                                  Longest Path Problem on Cocomparability
                                  Graphs . . . . . . . . . . . . . . . . . 940--963
        Michael Krivelevich and   
               Wojciech Samotij   Optimal Packings of Hamilton Cycles in
                                  Sparse Random Graphs . . . . . . . . . . 964--982
                Y. Ollivier and   
                     C. Villani   A Curved Brunn--Minkowski Inequality on
                                  the Discrete Hypercube, Or: What Is the
                                  Ricci Curvature of the Discrete
                                  Hypercube? . . . . . . . . . . . . . . . 983--996
                    Le Anh Vinh   On the Permanents of Matrices with
                                  Restricted Entries Over Finite Fields    997--1007
            Pinar Heggernes and   
             Pim van 't Hof and   
          Daniel Lokshtanov and   
                Jesper Nederlof   Computing the Cutwidth of Bipartite
                                  Permutation Graphs in Linear Time  . . . 1008--1021
                 Xujin Chen and   
                Zhibin Chen and   
                     Wenan Zang   Total Dual Integrality in Some Facility
                                  Location Problems  . . . . . . . . . . . 1022--1030
           Michael Belfrage and   
         Torsten Mütze and   
               Reto Spöhel   Probabilistic One-Player Ramsey Games
                                  via Deterministic Two-Player Games . . . 1031--1049
            Tristram Bogart and   
                      Eric Katz   Obstructions to Lifting Tropical Curves
                                  in Surfaces in $3$-Space . . . . . . . . 1050--1067
            Vida Dujmovi\'c and   
         Gwenaël Joret and   
                  David R. Wood   An Improved Bound for First-Fit on
                                  Posets Without Two Long Incomparable
                                  Chains . . . . . . . . . . . . . . . . . 1068--1075
             David G. Glynn and   
                    David Byatt   Graphs for Orthogonal Arrays and
                                  Projective Planes of Even Order  . . . . 1076--1087
                 Binlong Li and   
      Zdenek Ryjácek and   
                  Ying Wang and   
                 Shenggui Zhang   Pairs of Heavy Subgraphs for
                                  Hamiltonicity of $2$-Connected Graphs    1088--1103
                Jan Draisma and   
      Tyrrell B. McAllister and   
                  Benjamin Nill   Lattice-Width Directions and Minkowski's
                                  $3^d$-Theorem  . . . . . . . . . . . . . 1104--1107
              Gregory Gutin and   
                     Mark Jones   Note on Large Subsets of Binary Vectors
                                  with Similar Distances . . . . . . . . . 1108--1111
           T. Arthur Terlep and   
                Jason Williford   Graphs from Generalized Kac--Moody
                                  Algebras . . . . . . . . . . . . . . . . 1112--1120
           Naonori Kakimura and   
         Ken-ichi Kawarabayashi   Packing Directed Circuits through
                                  Prescribed Vertices Bounded Fractionally 1121--1133
                Kunal Dutta and   
               Dhruv Mubayi and   
              C. R. Subramanian   New Lower Bounds for the Independence
                                  Number of Sparse Graphs and Hypergraphs  1134--1147
            Laurent Bulteau and   
           Guillaume Fertin and   
                     Irena Rusu   Sorting by Transpositions Is Difficult   1148--1180
                     Soumik Pal   Brownian Approximation to Counting
                                  Graphs . . . . . . . . . . . . . . . . . 1181--1188
             Enoch Peserico and   
                    Luca Pretto   HITS Can Converge Slowly, But Not Too
                                  Slowly, in Score and Rank  . . . . . . . 1189--1209
       Víctor Blanco and   
                   Justo Puerto   An Application of Integer Programming to
                                  the Decomposition of Numerical
                                  Semigroups . . . . . . . . . . . . . . . 1210--1237
                  Tao Jiang and   
                  Robert Seiver   Turán Numbers of Subdivided Graphs  . . . 1238--1255
          Daniel S. Shetler and   
           Michael A. Wurtz and   
      Stanislaw P. Radziszowski   On Some Multicolor Ramsey Numbers
                                  Involving $K_3+e$ and $K_4-e$  . . . . . 1256--1264
                Abbas Mehrabian   On the Density of Nearly Regular Graphs
                                  with a Good Edge-Labeling  . . . . . . . 1265--1268
         Ararat Harutyunyan and   
                    Bojan Mohar   Planar Graphs Have Exponentially Many
                                  $3$-Arboricities . . . . . . . . . . . . 1269--1280
                    Irena Penev   Coloring Bull-Free Perfect Graphs  . . . 1281--1309
             Chiara Ravazzi and   
                  Fabio Fagnani   On the Growth Rate of the Input-Output
                                  Weight Distribution of Convolutional
                                  Encoders . . . . . . . . . . . . . . . . 1310--1345
                 Xujin Chen and   
                 Guoli Ding and   
                Xiaodong Hu and   
                     Wenan Zang   The Maximum-Weight Stable Matching
                                  Problem: Duality and Efficiency  . . . . 1346--1360
              Volker Kaibel and   
     Kanstantsin Pashkovich and   
              Dirk Oliver Theis   Symmetry Matters for Sizes of Extended
                                  Formulations . . . . . . . . . . . . . . 1361--1382
               Ross J. Kang and   
             Matthias Mnich and   
             Tobias Müller   Induced Matchings in Subcubic Planar
                                  Graphs . . . . . . . . . . . . . . . . . 1383--1411
             Shin-ichi Tanigawa   Generic Rigidity Matroids with Dilworth
                                  Truncations  . . . . . . . . . . . . . . 1412--1439
          Daniela Kühn and   
                   Deryk Osthus   On Pósa's Conjecture for Random Graphs    1440--1457
              Luerbio Faria and   
             Sulamita Klein and   
           Matej Stehlík   Odd Cycle Transversals and Independent
                                  Sets in Fullerene Graphs . . . . . . . . 1458--1469

SIAM Journal on Discrete Mathematics
Volume 26, Number 4, 2012

           Amin Coja-Oghlan and   
      Angelica Y. Pachon-Pinzon   The Decimation Process in Random $k$-SAT 1471--1509
            Pierre Aboulker and   
        Marko Radovanovi\'c and   
          Nicolas Trotignon and   
            Kristina Vuskovi\'c   Graphs That Do Not Contain a Cycle with
                                  a Node That Has at Least Two Neighbors
                                  on It  . . . . . . . . . . . . . . . . . 1510--1531
              Yong-Gao Chen and   
                  Quan-Hui Yang   On a Problem of Nathanson Related to
                                  Minimal Additive Complements . . . . . . 1532--1536
          Andreas Wendemuth and   
                Italo Simonelli   Majority Decisions in Overlapping
                                  Committees and Asymptotic Size of
                                  Dichotomies  . . . . . . . . . . . . . . 1537--1549
            Erik Ordentlich and   
           Farzad Parvaresh and   
                    Ron M. Roth   Asymptotic Enumeration of Binary
                                  Matrices with Bounded Row and Column
                                  Sums . . . . . . . . . . . . . . . . . . 1550--1575
                 Pavol Hell and   
                   Arash Rafiey   Monotone Proper Interval Digraphs and
                                  Min-Max Orderings  . . . . . . . . . . . 1576--1596
                 Pavol Hell and   
                   Arash Rafiey   The Dichotomy of Minimum Cost
                                  Homomorphism Problems for Digraphs . . . 1597--1608
       József Balogh and   
                 Tom Bohman and   
Béla Bollobás and   
                        Yi Zhao   Turán Densities of Some Hypergraphs
                                  Related to $K_{k+1}^k$ . . . . . . . . . 1609--1617
           Elena Grigorescu and   
               Tali Kaufman and   
                    Madhu Sudan   Succinct Representation of Codes with
                                  Applications to Testing  . . . . . . . . 1618--1634
                Steven Kelk and   
             Leo van Iersel and   
               Nela Leki\'c and   
                Simone Linz and   
         Celine Scornavacca and   
                   Leen Stougie   Cycle Killer\ldotsQu'est-ce que c'est?
                                  On the Comparative Approximability of
                                  Hybridization Number and Directed
                                  Feedback Vertex Set  . . . . . . . . . . 1635--1656
      Dániel Gerbner and   
              Nathan Lemons and   
                Cory Palmer and   
Balázs Patkós and   
             Vajk Szécsi   Almost Intersecting Families of Sets . . 1657--1669
       Giuseppe Di Battista and   
             Fabrizio Frati and   
            Maurizio Patrignani   Nonconvex Representations of Plane
                                  Graphs . . . . . . . . . . . . . . . . . 1670--1681
Frédéric Maffray and   
           Grégory Morel   On $3$-Colorable $ P_5 $-Free Graphs . . 1682--1708
            Dariusz Dereniowski   From Pathwidth to Connected Pathwidth    1709--1732
                   A. Nixon and   
                 J. C. Owen and   
                    S. C. Power   Rigidity of Frameworks Supported on
                                  Surfaces . . . . . . . . . . . . . . . . 1733--1757
             Sushmita Gupta and   
            Venkatesh Raman and   
                  Saket Saurabh   Maximum $r$-Regular Induced Subgraph
                                  Problem: Fast Exponential Algorithms and
                                  Combinatorial Bounds . . . . . . . . . . 1758--1780
     Cem Günerí and   
            Ferruh Özbudak   A Bound on the Minimum Distance of
                                  Quasi-cyclic Codes . . . . . . . . . . . 1781--1796
                  Deanna Dreher   Cycles in Graphs and Covers  . . . . . . 1797--1819


SIAM Journal on Discrete Mathematics
Volume 27, Number 1, 2013

                Hamed Amini and   
                Moez Draief and   
                   Marc Lelarge   Flooding in Weighted Sparse Random
                                  Graphs . . . . . . . . . . . . . . . . . 1--26
               Roman Glebov and   
            Michael Krivelevich   On the Number of Hamilton Cycles in
                                  Sparse Random Graphs . . . . . . . . . . 27--42
          Chien-Chung Huang and   
            Telikepalli Kavitha   Near-Popular Matchings in the Roommates
                                  Problem  . . . . . . . . . . . . . . . . 43--62
                Sylvia Boyd and   
                Maryam Haghighi   Mixed and Circular Multichromosomal
                                  Genomic Median Problem . . . . . . . . . 63--74
              Frederic Dorn and   
               Hannes Moser and   
           Rolf Niedermeier and   
                 Mathias Weller   Efficient Algorithms for Eulerian
                                  Extension and Rural Postman  . . . . . . 75--94
           Maria Chudnovsky and   
             Andrew D. King and   
         Matthieu Plumettaz and   
                   Paul Seymour   A Local Strengthening of Reed's $ \omega
                                  $, $ \Delta $, $ \chi $ Conjecture for
                                  Quasi-line Graphs  . . . . . . . . . . . 95--108
        Nicolai Hähnle and   
             Laura Sanit\`a and   
                 Rico Zenklusen   Stable Routing and Unique-Max Coloring
                                  on Trees . . . . . . . . . . . . . . . . 109--125
           Bartlomiej Bosek and   
            Tomasz Krawczyk and   
               Grzegorz Matecki   First-Fit Coloring of Incomparability
                                  Graphs . . . . . . . . . . . . . . . . . 126--140
                 Roman Cada and   
                Shuya Chiba and   
                Kenta Ozeki and   
          Petr Vrána and   
              Kiyoshi Yoshimoto   $ {4, 5} $ Is Not Coverable: a
                                  Counterexample to a Conjecture of Kaiser
                                  and Skrekovski . . . . . . . . . . . . . 141--144
              Paul Balister and   
Béla Bollobás and   
            Jenö Lehel and   
                 Michal Morayne   Repeated Degrees in Random Uniform
                                  Hypergraphs  . . . . . . . . . . . . . . 145--154
                Naoki Katoh and   
             Shin-ichi Tanigawa   Rooted-Tree Decompositions with Matroid
                                  Constraints and the Infinitesimal
                                  Rigidity of Frameworks with Boundaries   155--185
           Akiyoshi Shioura and   
     Natalia V. Shakhlevich and   
           Vitaly A. Strusevich   A Submodular Optimization Approach to
                                  Bicriteria Scheduling Problems with
                                  Controllable Processing Times on
                                  Parallel Machines  . . . . . . . . . . . 186--204
         Tobias Müller and   
       Erik Jan van Leeuwen and   
                Jan van Leeuwen   Integer Representations of Convex
                                  Polygon Intersection Graphs  . . . . . . 205--231
                  Josef Cibulka   Maximum Size of Reverse-Free Sets of
                                  Permutations . . . . . . . . . . . . . . 232--239
Béla Bollobás and   
            David Pritchard and   
            Thomas Rothvoss and   
                     Alex Scott   Cover-Decomposition and Polychromatic
                                  Numbers  . . . . . . . . . . . . . . . . 240--256
        Robert Scheidweiler and   
               Eberhard Triesch   A Lower Bound for the Complexity of
                                  Monotone Graph Properties  . . . . . . . 257--265
              Vijay V. Vazirani   Nonseparable, Concave Utilities Are Easy
                                  --- in a Perfect Price Discrimination
                                  Market Model . . . . . . . . . . . . . . 266--273
               Zan-Bo Zhang and   
              Xiaoyan Zhang and   
                    Xuelian Wen   Directed Hamilton Cycles in Digraphs and
                                  Matching Alternating Hamilton Cycles in
                                  Bipartite Graphs . . . . . . . . . . . . 274--289
                Marek Cygan and   
           Marcin Pilipczuk and   
           Michal Pilipczuk and   
       Jakub Onufry Wojtaszczyk   Subset Feedback Vertex Set Is
                                  Fixed-Parameter Tractable  . . . . . . . 290--309
           Chun-Ying Chiang and   
            Liang-Hao Huang and   
                   Hong-Gwa Yeh   Target Set Selection Problem for
                                  Honeycomb Networks . . . . . . . . . . . 310--328
            Bertrand Guenin and   
              Irene Pivotto and   
                    Paul Wollan   Relationships between Pairs of
                                  Representations of Signed Binary
                                  Matroids . . . . . . . . . . . . . . . . 329--341
              Graeme Kemkes and   
               Nicholas Wormald   An Improved Upper Bound on the Length of
                                  the Longest Cycle of a Supercritical
                                  Random Graph . . . . . . . . . . . . . . 342--362
                  Noga Alon and   
                 Yuval Emek and   
             Michal Feldman and   
              Moshe Tennenholtz   Adversarial Leakage in Games . . . . . . 363--385
                         Pu Gao   Distributions of Sparse Spanning
                                  Subgraphs in Random Graphs . . . . . . . 386--401
                  Michael Snook   The Complexity of Deletion Problems for
                                  Matroids . . . . . . . . . . . . . . . . 402--421
                    Kenta Ozeki   Spanning Trees with Bounded Maximum
                                  Degrees of Graphs on Surfaces  . . . . . 422--435
                Jakub Kozik and   
                    Piotr Micek   Nonrepetitive Choice Number of Trees . . 436--446
                  Hoi H. Nguyen   On the Singularity of Random
                                  Combinatorial Matrices . . . . . . . . . 447--458
                Kristin M. Shaw   A Tropical Intersection Product in
                                  Matroidal Fans . . . . . . . . . . . . . 459--491
             Robert Brijder and   
          Hendrik Jan Hoogeboom   Nullity and Loop Complementation for
                                  Delta-Matroids . . . . . . . . . . . . . 492--506
      Deeparnab Chakrabarty and   
       Jochen Könemann and   
                David Pritchard   Hypergraphic LP Relaxations for Steiner
                                  Trees  . . . . . . . . . . . . . . . . . 507--533
         Daniel W. Cranston and   
                  Landon Rabern   Coloring Claw-Free Graphs with $ \Delta
                                  - 1 $ Colors . . . . . . . . . . . . . . 534--549
                  Jacob Fox and   
          János Pach and   
                     Andrew Suk   The Number of Edges in $k$-Quasi-planar
                                  Graphs . . . . . . . . . . . . . . . . . 550--561
                      Noga Alon   Minimizing the Number of Carries in
                                  Addition . . . . . . . . . . . . . . . . 562--566
 Olivier Durand de Gevigney and   
           Viet-Hang Nguyen and   
          Zoltán Szigeti   Matroid-Based Packing of Arborescences   567--574
                Simeon Ball and   
                  Aart Blokhuis   A Bound for the Maximum Weight of a
                                  Linear Code  . . . . . . . . . . . . . . 575--583
                  Owen Hill and   
                       Gexin Yu   A Relaxation of Steinberg's Conjecture   584--596

SIAM Journal on Discrete Mathematics
Volume 27, Number 2, 2013

                 Zhiquan Hu and   
                  Ka Ho Law and   
                     Wenan Zang   An Optimal Binding Number Condition for
                                  Bipancyclism . . . . . . . . . . . . . . 597--618
                E. de Klerk and   
            D. V. Pasechnik and   
                     G. Salazar   Improved Lower Bounds on Book Crossing
                                  Numbers of Complete Graphs . . . . . . . 619--633
          Graham Brightwell and   
                 Mareike Massow   Diametral Pairs of Linear Extensions . . 634--649
           Sariel Har-Peled and   
         Bernard Lidický   Peeling the Grid . . . . . . . . . . . . 650--655
                  Noga Alon and   
            Erik D. Demaine and   
     Mohammad T. Hajiaghayi and   
                   Tom Leighton   Basic Network Creation Games . . . . . . 656--668
   Konstantinos Papalamprou and   
             Leonidas Pitsoulis   Decomposition of Binary Signed-Graphic
                                  Matroids . . . . . . . . . . . . . . . . 669--692
              Peter Keevash and   
                 Zhentao Li and   
                Bojan Mohar and   
                     Bruce Reed   Digraph Girth via Chromatic Number . . . 693--696
                 Maya Stein and   
             José Zamora   Forcing Large Complete (Topological)
                                  Minors in Infinite Graphs  . . . . . . . 697--707
               Allen O'Neal and   
                Peter J. Slater   Uniqueness of Vertex Magic Constants . . 708--716
              C. C. Centeno and   
                L. D. Penso and   
              D. Rautenbach and   
     V. G. Pereira de Sá   Geodetic Number versus Hull Number in $
                                  P_3 $-Convexity  . . . . . . . . . . . . 717--731
             Anthony Bonato and   
             Dieter Mitsche and   
                   Pawel Pralat   Vertex-Pursuit in Random Directed
                                  Acyclic Graphs . . . . . . . . . . . . . 732--756
   Edita Mácajová   Bridgeless Cubic Graphs Are $ (7, 2)
                                  $-Edge-Choosable . . . . . . . . . . . . 757--767
                Alan Frieze and   
               Simcha Haber and   
                 Mikhail Lavrov   On the Game Chromatic Number of Sparse
                                  Random Graphs  . . . . . . . . . . . . . 768--790
                    Yin Tan and   
               Longjiang Qu and   
                   San Ling and   
                   Chik How Tan   On the Fourier Spectra of New APN
                                  Functions  . . . . . . . . . . . . . . . 791--801
          Adrian Dumitrescu and   
        André Schulz and   
               Adam Sheffer and   
           Csaba D. Tóth   Bounds on the Maximum Multiplicity of
                                  Some Common Geometric Graphs . . . . . . 802--826
                  Daniel Simson   A Coxeter--Gram Classification of
                                  Positive Simply Laced Edge-Bipartite
                                  Graphs . . . . . . . . . . . . . . . . . 827--854
     Joachim von zur Gathen and   
              Alfredo Viola and   
             Konstantin Ziegler   Counting Reducible, Powerful, and
                                  Relatively Irreducible Multivariate
                                  Polynomials over Finite Fields . . . . . 855--891
           Miroslaw Kowaluk and   
             Andrzej Lingas and   
              Eva-Marta Lundell   Counting and Detecting Small Subgraphs
                                  via Equations  . . . . . . . . . . . . . 892--909
            John Goldwasser and   
                    Ryan Hansen   The Exact Turán Number of $ F(3, 3) $ and
                                  All Extremal Configurations  . . . . . . 910--917
                Sylvia Boyd and   
               Satoru Iwata and   
               Kenjiro Takazawa   Finding $2$-Factors Closer to TSP Tours
                                  in Cubic Graphs  . . . . . . . . . . . . 918--939
     Marcelo H. de Carvalho and   
 Cláudio L. Lucchesi and   
                 U. S. R. Murty   On the Number of Perfect Matchings in a
                                  Bipartite Graph  . . . . . . . . . . . . 940--958
              Choongbum Lee and   
                Po-Shen Loh and   
                  Benny Sudakov   Self-Similarity of Graphs  . . . . . . . 959--972
         Sergei V. Konyagin and   
                   Misha Rudnev   On New Sum--Product-Type Estimates . . . 973--990
         Wendy Finbow-Singh and   
                Walter Whiteley   Isostatic Block and Hole Frameworks  . . 991--1020
                Imdadullah Khan   Perfect Matchings in 3-Uniform
                                  Hypergraphs with Large Vertex Degree . . 1021--1039
                  Paul Horn and   
             Steve La Fleur and   
              Vojtech Rödl   Jumps and Nonjumps in Multigraphs  . . . 1040--1054
                Lajos Hajdu and   
                   Rob Tijdeman   Bounds for Approximate Discrete
                                  Tomography Solutions . . . . . . . . . . 1055--1066
              Sarit Buzaglo and   
                    Tuvi Etzion   Tilings by $ (0.5, n) $-Crosses and
                                  Perfect Codes  . . . . . . . . . . . . . 1067--1081
              Tomas Rokicki and   
           Herbert Kociemba and   
            Morley Davidson and   
                 John Dethridge   The Diameter of the Rubik's Cube Group
                                  Is Twenty  . . . . . . . . . . . . . . . 1082--1105
                    Suho Oh and   
               Hwanchul Yoo and   
                    Taedong Yun   Rainbow Graphs and Switching Classes . . 1106--1111
                  Koji Momihara   Skew Hadamard Difference Sets from
                                  Cyclotomic Strongly Regular Graphs . . . 1112--1122
          Michel X. Goemans and   
            José A. Soto   Algorithms for Symmetric Submodular
                                  Function Minimization under Hereditary
                                  Constraints and Generalizations  . . . . 1123--1145
                Steven Klee and   
                 Isabella Novik   From Flag Complexes to Banner Complexes  1146--1158
            J. C. Ku-Cauich and   
              H. Tapia-Recillas   Systematic Authentication Codes Based on
                                  a Class of Bent Functions and the Gray
                                  Map on a Galois Ring . . . . . . . . . . 1159--1170
      Balázs Keszegh and   
          János Pach and   
Dömötör Pálvölgyi   Drawing Planar Graphs of Bounded Degree
                                  with Few Slopes  . . . . . . . . . . . . 1171--1183
          Katherine Edwards and   
                 Andrew D. King   Bounding the Fractional Chromatic Number
                                  of $ K_\Delta $-Free Graphs  . . . . . . 1184--1208

SIAM Journal on Discrete Mathematics
Volume 27, Number 3, 2013

  Archontia C. Giannopoulou and   
          Dimitrios M. Thilikos   Optimizing the Graph Minors Weak
                                  Structure Theorem  . . . . . . . . . . . 1209--1227
            Abbas Mehrabian and   
             Dieter Mitsche and   
                   Pawel Pralat   On the Maximum Density of Graphs with
                                  Unique-Path Labelings  . . . . . . . . . 1228--1233
                 Ryo Fujita and   
           Yusuke Kobayashi and   
                Kazuhisa Makino   Robust Matchings and Matroid
                                  Intersections  . . . . . . . . . . . . . 1234--1256
           Naonori Kakimura and   
                Kazuhisa Makino   Robust Independence Systems  . . . . . . 1257--1273
                  Daniel Kotlar   On Circuits and Serial Symmetric
                                  Basis-Exchange in Matroids . . . . . . . 1274--1286
    Péter L. Erd\Hos and   
              Claude Tardif and   
            Gábor Tardos   Caterpillar Dualities and Regular
                                  Languages  . . . . . . . . . . . . . . . 1287--1294
                Niek Bouman and   
                Jan Draisma and   
    Johan S. H. van Leeuwaarden   Energy Minimization of Repelling
                                  Particles on a Toric Grid  . . . . . . . 1295--1312
                 Jakub Przybylo   Neighbor Distinguishing Edge Colorings
                                  via the Combinatorial Nullstellensatz    1313--1322
                     Andrew Suk   Density Theorems for Intersection Graphs
                                  of $t$-Monotone Curves . . . . . . . . . 1323--1334
                 Josef Dick and   
               Makoto Matsumoto   On the Fast Computation of the Weight
                                  Enumerator Polynomial and the $t$ Value
                                  of Digital Nets over Finite Abelian
                                  Groups . . . . . . . . . . . . . . . . . 1335--1359
             Victoria Horan and   
                 Glenn Hurlbert   Universal Cycles for Weak Orders . . . . 1360--1371
               Deryk Osthus and   
               Katherine Staden   Approximate Hamilton Decompositions of
                                  Robustly Expanding Regular Digraphs  . . 1372--1409
                Anthony Labarre   Lower Bounding Edit Distances between
                                  Permutations . . . . . . . . . . . . . . 1410--1428
            Maria Axenovich and   
           Andrew Beveridge and   
         Joan P. Hutchinson and   
                Douglas B. West   Visibility Number of Directed Graphs . . 1429--1449
                J. Cheriyan and   
                 B. Laekhanukit   Approximation Algorithms for
                                  Minimum-Cost $ k \hbox {-}(S, T) $
                                  Connected Digraphs . . . . . . . . . . . 1450--1481
                Simeon Ball and   
        Carles Padró and   
              Zsuzsa Weiner and   
                  Chaoping Xing   On the Representability of the Biuniform
                                  Matroid  . . . . . . . . . . . . . . . . 1482--1491
           Gennadiy Averkov and   
           Michele Conforti and   
            Alberto Del Pia and   
             Marco Di Summa and   
                    Yuri Faenza   On the Convergence of the Affine Hull of
                                  the Chvátal--Gomory Closures  . . . . . . 1492--1502
                Marek Cygan and   
               Guy Kortsarz and   
                     Zeev Nutov   Steiner Forest Orientation Problems  . . 1503--1513
                 Guoli Ding and   
                  Stan Dziobiak   On $3$-Connected Graphs of Path-Width at
                                  Most Three . . . . . . . . . . . . . . . 1514--1526
                   G. Calinescu   Approximate Min-Power Strong
                                  Connectivity . . . . . . . . . . . . . . 1527--1543
               Brian Marcus and   
                  Ronnie Pavlov   Computing Bounds for Entropy of
                                  Stationary $ \mathbb {Z}^d $ Markov
                                  Random Fields  . . . . . . . . . . . . . 1544--1558
                Paul Dorbec and   
         Michael A. Henning and   
  Christian Löwenstein and   
         Mickael Montassier and   
           André Raspaud   Generalized Power Domination in Regular
                                  Graphs . . . . . . . . . . . . . . . . . 1559--1574
   János Körner and   
                     Irene Muzi   Degree-Doubling Graph Families . . . . . 1575--1583
                  Hong Shen and   
                     Shihong Xu   Approximation Algorithms for Fault
                                  Tolerant Facility Allocation . . . . . . 1584--1609
               Gennadiy Averkov   On Maximal $S$-Free Sets and the Helly
                                  Number for the Family of $S$-Convex Sets 1610--1624
              Shinya Fujita and   
                 Colton Magnant   Forbidden Rainbow Subgraphs That Force
                                  Large Highly Connected Monochromatic
                                  Subgraphs  . . . . . . . . . . . . . . . 1625--1637

SIAM Journal on Discrete Mathematics
Volume 27, Number 4, 2013

       Peter Bürgisser and   
            Christian Ikenmeyer   Deciding Positivity of
                                  Littlewood--Richardson Coefficients  . . 1639--1681
Luís Felipe I. Cunha and   
     Luis Antonio B. Kowada and   
       Rodrigo de A. Hausen and   
     Celina M. H. de Figueiredo   Advancing the Transposition Distance and
                                  Diameter through Lonely Permutations . . 1682--1709
        Tibor Jordán and   
       Gábor Domokos and   
          Krisztina Tóth   Geometric Sensitivity of Rigid Graphs    1710--1726
           Michael S. Payne and   
                  David R. Wood   On the General Position Subset Selection
                                  Problem  . . . . . . . . . . . . . . . . 1727--1733
        Richard C. Brewster and   
            Sean McGuinness and   
          Morten Hegner Nielsen   Factors with Multiple Degree Constraints
                                  in Graphs  . . . . . . . . . . . . . . . 1734--1747
               Colin Cooper and   
       Robert Elsässer and   
               Hirotaka Ono and   
                  Tomasz Radzik   Coalescing Random Walks and Voting on
                                  Connected Graphs . . . . . . . . . . . . 1748--1758
            Lee-Ad Gottlieb and   
             Robert Krauthgamer   Proximity Algorithms for Nearly Doubling
                                  Spaces . . . . . . . . . . . . . . . . . 1759--1769
            Vida Dujmovi\'c and   
           Daniel J. Harvey and   
         Gwenaël Joret and   
                 Bruce Reed and   
                  David R. Wood   A Linear-Time Algorithm for Finding a
                                  Complete Graph Minor in a Dense Graph    1770--1774
       Panagiotis Cheilaris and   
      Balázs Keszegh and   
Dömötör Pálvölgyi   Unique-Maximum and Conflict-Free
                                  Coloring for Hypergraphs and Tree Graphs 1775--1787
               Guantao Chen and   
                Akira Saito and   
                  Songling Shan   The Existence of a $2$-Factor in a Graph
                                  Satisfying the Local Chvátal--Erd\Hos
                                  Condition  . . . . . . . . . . . . . . . 1788--1799
      Timothy D. LeSaulnier and   
                Noah Prince and   
             Paul S. Wenger and   
            Douglas B. West and   
                   Pratik Worah   Total Acquisition in Graphs  . . . . . . 1800--1819
            Paul H. Edelman and   
           Tatiana Gvozdeva and   
                 Arkadii Slinko   Simplicial Complexes Obtained from
                                  Qualitative Probability Orders . . . . . 1820--1843
             Yeow Meng Chee and   
        Charles J. Colbourn and   
             Daniel Horsley and   
                   Junling Zhou   Sequence Covering Arrays . . . . . . . . 1844--1861
               Hongliang Lu and   
           David G. L. Wang and   
                     Qinglin Yu   On the Existence of General Factors in
                                  Regular Graphs . . . . . . . . . . . . . 1862--1869
            Igor E. Shparlinski   Additive Decompositions of Subgroups of
                                  Finite Fields  . . . . . . . . . . . . . 1870--1879
               T. Kyle Petersen   On the Shard Intersection Order of a
                                  Coxeter Group  . . . . . . . . . . . . . 1880--1912
               Atif Abueida and   
               Arthur Busch and   
                   R. Sritharan   Hamiltonian Spider Intersection Graphs
                                  Are Cycle Extendable . . . . . . . . . . 1913--1923
          James M. Carraher and   
              Stephen G. Hartke   Eulerian Circuits with No Monochromatic
                                  Transitions in Edge-colored Digraphs . . 1924--1939
         Tomás Feder and   
                 Pavol Hell and   
           Beno\^\it Larose and   
              Cynthia Loten and   
               Mark Siggers and   
                  Claude Tardif   Graphs Admitting $k$-NU Operations. Part
                                  1: The Reflexive Case  . . . . . . . . . 1940--1963
             Fedor V. Fomin and   
              Saket Saurabh and   
                Yngve Villanger   A Polynomial Kernel for Proper Interval
                                  Vertex Deletion  . . . . . . . . . . . . 1964--1976
                  Cunsheng Ding   Cyclic Codes from Some Monomials and
                                  Trinomials . . . . . . . . . . . . . . . 1977--1994
       József Balogh and   
                    Cory Palmer   On the Tree Packing Conjecture . . . . . 1995--2006
          Hartmut Führ and   
              Isaac Z. Pesenson   Poincaré and Plancherel--Polya
                                  Inequalities in Harmonic Analysis on
                                  Weighted Combinatorial Graphs  . . . . . 2007--2028
              Yingqian Wang and   
                      Lingji Xu   Improper Choosability of Planar Graphs
                                  without $4$-Cycles . . . . . . . . . . . 2029--2037
                    Le Anh Vinh   On Four-Variable Expanders in Finite
                                  Fields . . . . . . . . . . . . . . . . . 2038--2048
                   Guy Even and   
                  Nissim Halabi   Local-Optimality Guarantees Based on
                                  Paths for Optimal Decoding . . . . . . . 2049--2063
        Catherine Greenhill and   
               Brendan D. McKay   Asymptotic Enumeration of Sparse
                                  Multigraphs with Given Degrees . . . . . 2064--2089
      William B. Kinnersley and   
            Douglas B. West and   
                    Reza Zamani   Extremal Problems for Game Domination
                                  Number . . . . . . . . . . . . . . . . . 2090--2107
         Hans L. Bodlaender and   
          Bart M. P. Jansen and   
                 Stefan Kratsch   Preprocessing for Treewidth: a
                                  Combinatorial Analysis through
                                  Kernelization  . . . . . . . . . . . . . 2108--2142
            Pinar Heggernes and   
             Pim Van 'T Hof and   
          Daniel Lokshtanov and   
                Christophe Paul   Obtaining a Bipartite Graph by
                                  Contracting Few Edges  . . . . . . . . . 2143--2156
                   Pawel Pralat   Sparse Graphs Are Not Flammable  . . . . 2157--2166


SIAM Journal on Discrete Mathematics
Volume 28, Number 1, 2014

              Zhixiong Chen and   
                 Arne Winterhof   Interpolation of Fermat Quotients  . . . 1--7
                Cai Heng Li and   
                Shaohui Sun and   
                        Jing Xu   Self-Complementary Circulants of
                                  Prime-Power Order  . . . . . . . . . . . 8--17
                       Allan Lo   An Edge-Colored Version of Dirac's
                                  Theorem  . . . . . . . . . . . . . . . . 18--36
                  Mario Ullrich   Swendsen--Wang Is Faster than
                                  Single-Bond Dynamics . . . . . . . . . . 37--48
             Leo van Iersel and   
                Steven Kelk and   
               Nela Leki\'c and   
                   Leen Stougie   Approximation Algorithms for Nonbinary
                                  Agreement Forests  . . . . . . . . . . . 49--66
          Andrzej Czygrinow and   
                 Theodore Molla   Tight Codegree Condition for the
                                  Existence of Loose Hamilton Cycles in
                                  $3$-Graphs . . . . . . . . . . . . . . . 67--76
           Brendan D. McKay and   
          Pascal Schweitzer and   
             Patrick Schweitzer   Competition Numbers, Quasi-line Graphs,
                                  and Holes  . . . . . . . . . . . . . . . 77--91
                      Hao Huang   On the Maximum Induced Density of
                                  Directed Stars and Related Problems  . . 92--98
      Deeparnab Chakrabarty and   
                 Gagan Goel and   
          Vijay V. Vazirani and   
                   Lei Wang and   
                   Changyuan Yu   Submodularity Helps in Nash and
                                  Nonsymmetric Bargaining Games  . . . . . 99--115
                 Radoslav Fulek   Estimating the Number of Disjoint Edges
                                  in Simple Topological Graphs via
                                  Cylindrical Drawings . . . . . . . . . . 116--121
              Christian Richter   A Density Result for Random Packings of
                                  Unit Disks . . . . . . . . . . . . . . . 122--126
         Robert Krauthgamer and   
      Huy L. Nguy\~ên and   
                 Tamar Zondiner   Preserving Terminal Distances Using
                                  Minors . . . . . . . . . . . . . . . . . 127--141
    Antonio Breda d'Azevedo and   
   Ilda Inácio Rodrigues   Bicontactual Regular Hypermaps . . . . . 142--159
               Ronald Gould and   
                  Paul Horn and   
                 Colton Magnant   Multiply Chorded Cycles  . . . . . . . . 160--172
        Russell Impagliazzo and   
           Cristopher Moore and   
              Alexander Russell   An Entropic Proof of Chang's Inequality  173--176
       Zdenek Dvorák and   
        Tereza Klimosová   Strong Immersions and Maximum Degree . . 177--187
                 Tony Huynh and   
          Stefan H. M. van Zwam   Intertwining Connectivities in
                                  Representable Matroids . . . . . . . . . 188--196
             Piotr Majerski and   
                 Jakub Przybylo   On the Irregularity Strength of Dense
                                  Graphs . . . . . . . . . . . . . . . . . 197--205
              Cheng-Wei Lee and   
                     Hsueh-I Lu   Replacement Paths via Row Minima of
                                  Concise Matrices . . . . . . . . . . . . 206--225
           Guillaume Chapuy and   
                 Matt DeVos and   
           Jessica McDonald and   
                Bojan Mohar and   
                  Diego Scheide   Packing Triangles in Weighted Graphs . . 226--239
                   Anja Fischer   An Analysis of the Asymmetric Quadratic
                                  Traveling Salesman Polytope  . . . . . . 240--276
         Hans L. Bodlaender and   
          Bart M. P. Jansen and   
                 Stefan Kratsch   Kernelization Lower Bounds by
                                  Cross-Composition  . . . . . . . . . . . 277--305
               Antoine Deza and   
Frédéric Meunier and   
          Pauline Sarrabezolles   A Combinatorial Approach to Colourful
                                  Simplicial Depth . . . . . . . . . . . . 306--322
             Laura Florescu and   
         Shirshendu Ganguly and   
              Lionel Levine and   
                    Yuval Peres   Escape Rates for Rotor Walks in $
                                  \mathbb {Z}^d $  . . . . . . . . . . . . 323--334
          Dieter Rautenbach and   
   Jean-Sébastien Sereni   Transversals of Longest Paths and Cycles 335--341
            Cyril Banderier and   
           Hsien-Kuei Hwang and   
         Vlady Ravelomanana and   
               Vytas Zacharovas   Analysis of an Exhaustive Search
                                  Algorithm in Random Graphs and the $
                                  n^{c \log n}$-Asymptotics  . . . . . . . 342--371
                 Alex Scott and   
               Elizabeth Wilmer   Hypergraphs of Bounded Disjointness  . . 372--384
                Ron Aharoni and   
                  Daniel Kotlar   A Weak Version of Rota's Bases
                                  Conjecture for Odd Dimensions  . . . . . 385--393
             Liam O'Carroll and   
   Francesc Planas-Vilanova and   
           Rafael H. Villarreal   Degree and Algebraic Properties of
                                  Lattice and Matrix Ideals  . . . . . . . 394--427
                  Nathan Kaplan   MacWilliams Identities for $m$-tuple
                                  Weight Enumerators . . . . . . . . . . . 428--444
               Kenjiro Takazawa   Optimal Matching Forests and Valuated
                                  Delta-Matroids . . . . . . . . . . . . . 445--467
                 Felix Joos and   
          Dieter Rautenbach and   
                   Thomas Sasse   Induced Matchings in Subcubic Graphs . . 468--473
        Jeroen Schillewaert and   
                      Koen Thas   Construction and Comparison of
                                  Authentication Codes . . . . . . . . . . 474--489
                    Tasuku Soma   Fast Deterministic Algorithms for Matrix
                                  Completion Problems  . . . . . . . . . . 490--502
         Dániel Marx and   
                    Paul Wollan   Immersions in Highly Edge Connected
                                  Graphs . . . . . . . . . . . . . . . . . 503--520
       Zdenek Dvorák and   
         Bernard Lidický   $4$-Critical Graphs on Surfaces Without
                                  Contractible $ (\leq 4)$-Cycles  . . . . 521--552
             Brett Kolesnik and   
                   Nick Wormald   Lower Bounds for the Isoperimetric
                                  Numbers of Random Regular Graphs . . . . 553--575

SIAM Journal on Discrete Mathematics
Volume 28, Number 2, 2014

            Chandra Chekuri and   
                  Nitish Korula   A Graph Reduction Step Preserving
                                  Element-Connectivity and Packing Steiner
                                  Trees and Forests  . . . . . . . . . . . 577--597
                  Piotr 'Sniady   Robinson--Schensted--Knuth Algorithm,
                                  Jeu de Taquin, and Kerov--Vershik
                                  Measures on Infinite Tableaux  . . . . . 598--630
             Mathew Francis and   
                 Pavol Hell and   
                   Juraj Stacho   Blocking Quadruple: a New Obstruction to
                                  Circular-Arc Graphs  . . . . . . . . . . 631--655
                Hamed Amini and   
                    Yuval Peres   Shortest-Weight Paths in Random Regular
                                  Graphs . . . . . . . . . . . . . . . . . 656--672
          Jennifer Iglesias and   
             Nathaniel Ince and   
                    Po-Shen Loh   Computing with Voting Trees  . . . . . . 673--684
              Azhvan Ahmady and   
              Jason P. Bell and   
                    Bojan Mohar   Integral Cayley Graphs and Groups  . . . 685--701
                  Xing Peng and   
                  Craig Timmons   Infinite Turán Problems for Bipartite
                                  Graphs . . . . . . . . . . . . . . . . . 702--710
                Neal Bushaw and   
                  Nathan Kettle   Turán Numbers for Forests of Paths in
                                  Hypergraphs  . . . . . . . . . . . . . . 711--721
               Longjiang Qu and   
                  Cunsheng Ding   Dickson Polynomials of the Second Kind
                                  that Permute $ \mathbb {Z}_m $ . . . . . 722--735
        Elizabeth S. Allman and   
             John A. Rhodes and   
                  Amelia Taylor   A Semialgebraic Description of the
                                  General Markov Model on Phylogenetic
                                  Trees  . . . . . . . . . . . . . . . . . 736--755
                Rahil Baber and   
                    John Talbot   A Solution to the $ 2 / 3 $ Conjecture   756--766
             Itai Benjamini and   
               Igor Shinkar and   
                     Gilad Tsur   Acquaintance Time of a Graph . . . . . . 767--785
              Pablo Candela and   
                    Olof Sisask   Convergence Results for Systems of
                                  Linear Forms on Cyclic Groups and
                                  Periodic Nilsequences  . . . . . . . . . 786--810
                  Noga Alon and   
            Harout Aydinian and   
                      Hao Huang   Maximizing the Number of Nonnegative
                                  Subsets  . . . . . . . . . . . . . . . . 811--816
         Tomás Feder and   
                 Pavol Hell and   
           Beno\^\it Larose and   
               Mark Siggers and   
                  Claude Tardif   Graphs Admitting $k$-NU Operations. Part
                                  2: The Irreflexive Case  . . . . . . . . 817--834
           Ricardo Restrepo and   
         Daniel Stefankovic and   
               Juan C. Vera and   
                Eric Vigoda and   
                     Linji Yang   Phase Transition for Glauber Dynamics
                                  for Independent Sets on Regular Trees    835--861
                  Rohan Kapadia   Matroids with a Modular $4$-Point Line   862--877
             Fedor V. Fomin and   
               Petr A. Golovach   Long Circuits and Large Euler Subgraphs  878--892
                 Raphael Yuster   Edge-Disjoint Cliques in Graphs with
                                  High Minimum Degree  . . . . . . . . . . 893--910
                  Wesley Pegden   An Extension of the Moser--Tardos
                                  Algorithmic Local Lemma  . . . . . . . . 911--917
              Karen Meagher and   
                    Pablo Spiga   An Erd\Hos--Ko--Rado Theorem for the
                                  Derangement Graph of $ {\rm PGL}_3 (q) $
                                  Acting on the Projective Plane . . . . . 918--941
           Naonori Kakimura and   
               Mizuyo Takamatsu   Matching Problems with Delta-Matroid
                                  Constraints  . . . . . . . . . . . . . . 942--961
            Gábor Hetyei   Hurwitzian Continued Fractions
                                  Containing a Repeated Constant and An
                                  Arithmetic Progression . . . . . . . . . 962--985
            Federico Ardila and   
                  Tia Baker and   
                   Rika Yatchak   Moving Robots Efficiently Using the
                                  Combinatorics of $ {\rm CAT}(0) $
                                  Cubical Complexes  . . . . . . . . . . . 986--1007

SIAM Journal on Discrete Mathematics
Volume 28, Number 3, 2014

                Ron Goldman and   
            Plamen Simeonov and   
                  Yilmaz Simsek   Generating Functions for the
                                  $q$-Bernstein Bases  . . . . . . . . . . 1009--1025
           William L. Kocay and   
               Donald L. Kreher   On Reconstructing Graphs and Their
                                  Complements  . . . . . . . . . . . . . . 1026--1034
             Philip M. Long and   
              Rocco A. Servedio   On the Weight of Halfspaces over Hamming
                                  Balls  . . . . . . . . . . . . . . . . . 1035--1061
               Shoni Gilboa and   
                   Rom Pinchasi   On the Union of Arithmetic Progressions  1062--1073
                 Chris Berg and   
             Franco Saliola and   
                   Luis Serrano   Combinatorial Expansions for Families of
                                  Noncommutative $k$-Schur Functions . . . 1074--1092
                 Stefan Felsner   The Order Dimension of Planar Maps
                                  Revisited  . . . . . . . . . . . . . . . 1093--1101
                  Chun-Hung Liu   An Upper Bound on the Fractional
                                  Chromatic Number of Triangle-Free
                                  Subcubic Graphs  . . . . . . . . . . . . 1102--1136
           Nicola Apollonio and   
                  Bruno Simeone   Improved Approximation of Maximum Vertex
                                  Coverage Problem on Bipartite Graphs . . 1137--1151
                K. T. Huber and   
                 V. Moulton and   
                  C. Semple and   
                          T. Wu   Representing Partitions on Trees . . . . 1152--1172
               Shay Solomon and   
                  Michael Elkin   Balancing Degree, Diameter, and Weight
                                  in Euclidean Spanners  . . . . . . . . . 1173--1198
                 Daniel Horsley   Embedding Partial Steiner Triple Systems
                                  with Few Triples . . . . . . . . . . . . 1199--1213
                   Allan Lo and   
            Klas Markström   $ {\ell }$-Degree Turán Density . . . . . 1214--1225
                Genghua Fan and   
                 Baogang Xu and   
                 Tianjun Ye and   
                    Xingxing Yu   Forbidden Subgraphs and $3$-Colorings    1226--1256
              Roi Krakovski and   
                    Bojan Mohar   Homological Face-Width Condition Forcing
                                  $ K_6 $-Minors in Graphs on Surfaces . . 1257--1275
          Michael E. Picollelli   The Final Size of the $ C_{\ell } $-free
                                  Process  . . . . . . . . . . . . . . . . 1276--1305
       Geoffrey R. Grimmett and   
                   Zhongyang Li   Strict Inequalities for Connective
                                  Constants of Transitive Graphs . . . . . 1306--1333
          Marcin Kami\'nski and   
                 Lukasz Kowalik   Beyond the Vizing's Bound for at Most
                                  Seven Colors . . . . . . . . . . . . . . 1334--1362
         Gwenaël Joret and   
            Christophe Paul and   
                 Ignasi Sau and   
              Saket Saurabh and   
 Stéphan Thomassé   Hitting and Harvesting Pumpkins  . . . . 1363--1390
             Sergio Cabello and   
             Markus Chimani and   
            Petr Hlinený   Computing the Stretch of an Embedded
                                  Graph  . . . . . . . . . . . . . . . . . 1391--1401
                  Rong Chen and   
                  Geoff Whittle   Intertwining Connectivity in Matroids    1402--1404
         Robby G. McKilliam and   
                 Alex Grant and   
         I. Vaughan L. Clarkson   Finding a Closest Point in a Lattice of
                                  Voronoi's First Kind . . . . . . . . . . 1405--1422
                  Meghana Nasre   Popular Matchings: Structure and
                                  Strategic Issues . . . . . . . . . . . . 1423--1448
       Liliana Alcón and   
           Marisa Gutierrez and   
                 Glenn Hurlbert   Pebbling in Split Graphs . . . . . . . . 1449--1466
              Jeong Han Kim and   
                  Sang June Lee   Universality of Random Graphs for Graphs
                                  of Maximum Degree Two  . . . . . . . . . 1467--1478
       Christos A. Athanasiadis   Edgewise Subdivisions, Local
                                  $h$-Polynomials, and Excedances in the
                                  Wreath Product $ \mathbb {Z}_r \wr
                                  \mathfrak {S}_n$ . . . . . . . . . . . . 1479--1492
                  Noga Alon and   
                  Sagi Snir and   
                 Raphael Yuster   On the Compatibility of Quartet Trees    1493--1507
         Satyan L. Devadoss and   
                Daoji Huang and   
              Dominic Spadacene   Polyhedral Covers of Tree Space  . . . . 1508--1514
              Abhijin Adiga and   
              L. Sunil Chandran   Representing a Cubic Graph as the
                                  Intersection Graph of Axis-Parallel
                                  Boxes in Three Dimensions  . . . . . . . 1515--1539
         Katharina Jochemko and   
                   Raman Sanyal   Arithmetic of Marked Order Polytopes,
                                  Monotone Triangle Reciprocity, and
                                  Partial Colorings  . . . . . . . . . . . 1540--1558
          Joseph P. S. Kung and   
              Dillon Mayhew and   
              Irene Pivotto and   
                Gordon F. Royle   Maximum Size Binary Matroids with no $
                                  {\rm AG}(3, 2) $-Minor are Graphic . . . 1559--1577
                Yehuda Afek and   
           Yakov Babichenko and   
                Uriel Feige and   
                  Eli Gafni and   
                Nati Linial and   
                  Benny Sudakov   Musical Chairs . . . . . . . . . . . . . 1578--1600
              David Coudert and   
              Guillaume Ducoffe   Recognition of $ C_4 $-Free and $ 1 / 2
                                  $-Hyperbolic Graphs  . . . . . . . . . . 1601--1617
           Nicolas Lichiardopol   Proof of a Conjecture of Henning and Yeo
                                  on Vertex-Disjoint Directed Cycles . . . 1618--1627
                  Yezhou Wu and   
                    Dong Ye and   
                 Wenan Zang and   
                 Cun-Quan Zhang   Nowhere-Zero $3$-Flows in Signed Graphs  1628--1637
                  Noga Alon and   
            Erik D. Demaine and   
   MohammadTaghi Hajiaghayi and   
   Panagiotis Kanellopoulos and   
                   Tom Leighton   Correction: Basic Network Creation Games 1638--1640

SIAM Journal on Discrete Mathematics
Volume 28, Number 4, 2014

             Thomas J. Savitsky   Enumeration of $2$-Polymatroids on up to
                                  Seven Elements . . . . . . . . . . . . . 1641--1650
        Dóra Erd\Hos and   
        András Frank and   
           Krisztián Kun   Sink-Stable Sets of Digraphs . . . . . . 1651--1674
            Jessica Enright and   
              Lorna Stewart and   
            Gábor Tardos   On List Coloring and List Homomorphism
                                  of Permutation and Interval Graphs . . . 1675--1685
                    Andrzej Zak   On Packing Two Graphs with Bounded Sum
                                  of Sizes and Maximum Degree  . . . . . . 1686--1698
                  Reut Levi and   
                   Dana Ron and   
               Ronitt Rubinfeld   Testing Similar Means  . . . . . . . . . 1699--1724
                 Nir Halman and   
              Diego Klabjan and   
               Chung-Lun Li and   
                James Orlin and   
              David Simchi-Levi   Fully Polynomial Time Approximation
                                  Schemes for Stochastic Dynamic Programs  1725--1796
               Bill Jackson and   
        Tibor Jordán and   
             Shin-ichi Tanigawa   Combinatorial Conditions for the Unique
                                  Completability of Low-Rank Matrices  . . 1797--1819
                    Ping Li and   
                  Hong-Jian Lai   On Mod $ (2 s + 1)$-Orientations of
                                  Graphs . . . . . . . . . . . . . . . . . 1820--1827
                 Anna Huber and   
                 Andrei Krokhin   Oracle Tractability of Skew Bisubmodular
                                  Functions  . . . . . . . . . . . . . . . 1828--1837
              Peter Keevash and   
                  John Lenz and   
                   Dhruv Mubayi   Spectral Extremal Problems for
                                  Hypergraphs  . . . . . . . . . . . . . . 1838--1854
           Satoru Fujishige and   
             Shin-ichi Tanigawa   A Min-Max Theorem for Transversal
                                  Submodular Functions and Its
                                  Implications . . . . . . . . . . . . . . 1855--1875
                J. Carmesin and   
                 R. Diestel and   
                  M. Hamann and   
                 F. Hundertmark   $k$-Blocks: a Connectivity Invariant for
                                  Graphs . . . . . . . . . . . . . . . . . 1876--1891
                Yiqiao Wang and   
                 Xiaoxue Hu and   
                    Weifan Wang   Planar Graphs with $ \Delta \ge 9 $ are
                                  Entirely $ (\Delta + 2) $-Colorable  . . 1892--1905
             A. Mohammadian and   
               B. Tayfeh-Rezaie   On a Family of Diamond-Free Strongly
                                  Regular Graphs . . . . . . . . . . . . . 1906--1915
Mamadou Moustapha Kanté and   
            Vincent Limouzy and   
                Arnaud Mary and   
                Lhouari Nourine   On the Enumeration of Minimal Dominating
                                  Sets and Related Notions . . . . . . . . 1916--1929
                   Rom Pinchasi   A Finite Family of Pseudodiscs Must
                                  Include a ``Small'' Pseudodisc . . . . . 1930--1934
                Javier Cano and   
       Csaba D. Tóth and   
                  Jorge Urrutia   Upper Bound Constructions for Untangling
                                  Planar Geometric Graphs  . . . . . . . . 1935--1943
                Michael J. Todd   An Improved Kalai--Kleitman Bound for
                                  the Diameter of a Polyhedron . . . . . . 1944--1947
              Jean Cardinal and   
               Kolja Knauer and   
                Piotr Micek and   
               Torsten Ueckerdt   Making Octants Colorful and Related
                                  Covering Decomposition Problems  . . . . 1948--1959
         Marek Eliás and   
       Jirí Matousek and   
Edgardo Roldán-Pensado and   
        Zuzana Safernová   Lower Bounds on Geometric Ramsey
                                  Functions  . . . . . . . . . . . . . . . 1960--1970
           Pavlos Eirinakis and   
            Dimitrios Magos and   
                Ioannis Mourtos   From One Stable Marriage to the Next:
                                  How Long Is the Way? . . . . . . . . . . 1971--1979
              Frank Mousset and   
              Rajko Nenadov and   
                Angelika Steger   On the Number of Graphs Without Large
                                  Cliques  . . . . . . . . . . . . . . . . 1980--1986
Jérémie Chalopin and   
              Victor Chepoi and   
            Panos Papasoglu and   
        Timothée Pecatte   Cop and Robber Game and Hyperbolicity    1987--2007
                   A. Nixon and   
                 J. C. Owen and   
                    S. C. Power   A Characterization of Generically Rigid
                                  Frameworks on Surfaces of Revolution . . 2008--2028
               Julio Araujo and   
              Nicolas Nisse and   
Stéphane Pérennes   Weighted Coloring in Trees . . . . . . . 2029--2041
                 Boris Bukh and   
                         Jie Ma   Longest Common Subsequences in Sets of
                                  Words  . . . . . . . . . . . . . . . . . 2042--2049


SIAM Journal on Discrete Mathematics
Volume 29, Number 1, 2015

                Jiehua Chen and   
      Christian Komusiewicz and   
           Rolf Niedermeier and   
               Manuel Sorge and   
        Ondrej Suchý and   
                 Mathias Weller   Polynomial-Time Data Reduction for the
                                  Subset Interconnection Design Problem    1--25
                 Roman Cada and   
                Shuya Chiba and   
                Kenta Ozeki and   
          Petr Vrána and   
              Kiyoshi Yoshimoto   A Relationship Between Thomassen's
                                  Conjecture and Bondy's Conjecture  . . . 26--35
       Venkatesan Guruswami and   
           Sushant Sachdeva and   
                    Rishi Saket   Inapproximability of Minimum Vertex
                                  Cover on $k$-Uniform $k$-Partite
                                  Hypergraphs  . . . . . . . . . . . . . . 36--58
                  Noga Alon and   
            Manu Basavaraju and   
          L. Sunil Chandran and   
              Rogers Mathew and   
          Deepak Rajendraprasad   Separation Dimension of Bounded Degree
                                  Graphs . . . . . . . . . . . . . . . . . 59--64
                 F. Foucaud and   
             M. Krivelevich and   
                    G. Perarnau   Large Subgraphs without Short Cycles . . 65--78
              Cunsheng Ding and   
               Longjiang Qu and   
                 Qiang Wang and   
                   Jin Yuan and   
                   Pingzhi Yuan   Permutation Trinomials Over Finite
                                  Fields with Even Characteristic  . . . . 79--92
             Ciprian Borcea and   
             Ileana Streinu and   
             Shin-ichi Tanigawa   Periodic Body-and-Bar Frameworks . . . . 93--112
          Steffen Borgwardt and   
          Elisabeth Finhold and   
               Raymond Hemmecke   On the Circuit Diameter of Dual
                                  Transportation Polyhedra . . . . . . . . 113--121
             Stefan Kratsch and   
           Marcin Pilipczuk and   
           MichaL Pilipczuk and   
          Magnus Wahlström   Fixed-Parameter Tractability of Multicut
                                  in Directed Acyclic Graphs . . . . . . . 122--144
             Daniel C. McDonald   On-Line Vertex Ranking of Trees  . . . . 145--156
           Max A. Alekseyev and   
           Marina G. Basova and   
           Nikolai Yu. Zolotykh   On the Minimal Teaching Sets of
                                  Two-Dimensional Threshold Functions  . . 157--165
           Michele Conforti and   
            Alberto Del Pia and   
             Marco Di Summa and   
                Yuri Faenza and   
                  Roland Grappe   Reverse Chvátal--Gomory Rank  . . . . . . 166--181
           Cristopher Moore and   
              Alexander Russell   Approximate Representations, Approximate
                                  Homomorphisms, and Low-Dimensional
                                  Embeddings of Groups . . . . . . . . . . 182--197
  János Barát and   
            Vida Dujmovi\'c and   
         Gwenaël Joret and   
           Michael S. Payne and   
             Ludmila Scharf and   
             Daria Schymura and   
                Pavel Valtr and   
                  David R. Wood   Empty Pentagons in Point Sets with
                                  Collinearities . . . . . . . . . . . . . 198--209
             Huy T\`ai H\`a and   
                  Kuei-Nuan Lin   Normal $0$--$1$ Polytopes  . . . . . . . 210--223
         Fabricio Benevides and   
               Michal Przykucki   Maximum Percolation Time in
                                  Two-Dimensional Bootstrap Percolation    224--251
          Jaroslaw Grytczuk and   
              Wojciech Lubawski   Splitting Multidimensional Necklaces and
                                  Measurable Colorings of Euclidean Spaces 252--258
            José A. Soto   Improved Analysis of a Max-Cut Algorithm
                                  Based on Spectral Partitioning . . . . . 259--268
             Martin E. Malandro   Fourier Inversion for Finite Inverse
                                  Semigroups . . . . . . . . . . . . . . . 269--296
           Maria Chudnovsky and   
               Sergey Norin and   
                 Bruce Reed and   
                   Paul Seymour   Excluding a Substar and an Antisubstar   297--308
         Michael A. Henning and   
                     Anders Yeo   Total Transversals in Hypergraphs and
                                  Their Applications . . . . . . . . . . . 309--320
   Guido F. Montúfar and   
                   Jason Morton   When Does a Mixture of Products Contain
                                  a Product of Mixtures? . . . . . . . . . 321--347
           Petr A. Golovach and   
       Daniël Paulusma and   
           Erik Jan van Leeuwen   Induced Disjoint Paths in Claw-Free
                                  Graphs . . . . . . . . . . . . . . . . . 348--375
            Igor E. Shparlinski   Cayley Graphs Generated by Small Degree
                                  Polynomials over Finite Fields . . . . . 376--381
     Albrecht Böttcher and   
           Lenny Fukshansky and   
       Stephan Ramon Garcia and   
                  Hiren Maharaj   On Lattices Generated by Finite Abelian
                                  Groups . . . . . . . . . . . . . . . . . 382--404
          Stephane Durocher and   
               Debajyoti Mondal   Plane $3$-Trees: Embeddability and
                                  Approximation  . . . . . . . . . . . . . 405--420
             Richard Montgomery   Almost All Friendly Matrices Have Many
                                  Obstructions . . . . . . . . . . . . . . 421--430
                Brendon Rhoades   Alexander Duality and Rational
                                  Associahedra . . . . . . . . . . . . . . 431--460
                Melody Chan and   
               Darren Glass and   
           Matthew Macauley and   
            David Perkinson and   
               Caryn Werner and   
                    Qiaoyu Yang   Sandpiles, Spanning Trees, and Plane
                                  Duality  . . . . . . . . . . . . . . . . 461--471
               David Conlon and   
                  Jacob Fox and   
            William Gasarch and   
            David G. Harris and   
             Douglas Ulrich and   
                 Samuel Zbarsky   Distinct Volume Subsets  . . . . . . . . 472--480
    Péter L. Erd\Hos and   
István Miklós and   
        Zoltán Toroczkai   A Decomposition Based Proof for Fast
                                  Mixing of a Markov Chain over Balanced
                                  Realizations of a Joint Degree Matrix    481--499
            Andrzej Grzesik and   
             Michal Morayne and   
          Ma\lgorzata Sulkowska   From Directed Path to Linear Order ---
                                  The Best Choice Problem for Powers of
                                  Directed Path  . . . . . . . . . . . . . 500--513
             Brendan Murphy and   
        Oliver Roche-Newton and   
                  Ilya Shkredov   Variations on the Sum-Product Problem    514--540
         Valentas Kurauskas and   
            Katarzyna Rybarczyk   On the Chromatic Index of Random Uniform
                                  Hypergraphs  . . . . . . . . . . . . . . 541--558
            Mareike Fischer and   
             Leo van Iersel and   
                Steven Kelk and   
             Celine Scornavacca   On Computing the Maximum Parsimony Score
                                  of a Phylogenetic Network  . . . . . . . 559--585
              Michael Fuchs and   
                 Chung-Kuei Lee   The Wiener Index of Random Digital Trees 586--614
              Tian-Yi Jiang and   
                 Ziv Scully and   
                   Yan X. Zhang   Motors and Impossible Firing Patterns in
                                  the Parallel Chip-Firing Game  . . . . . 615--630
           Nader H. Bshouty and   
                  Hanna Mazzawi   On Parity Check $ (0, 1)$-Matrix over $
                                  \mathbb {Z}_p$ . . . . . . . . . . . . . 631--657
         Richard P. Stanley and   
               Fabrizio Zanello   The Catalan Case of Armstrong's
                                  Conjecture on Simultaneous Core
                                  Partitions . . . . . . . . . . . . . . . 658--666
             Xiang-Ke Chang and   
               Xing-Biao Hu and   
                      Guoce Xin   Hankel Determinant Solutions to Several
                                  Discrete Integrable Systems and the
                                  Laurent Property . . . . . . . . . . . . 667--682
Valérie Gauthier Umanña and   
               Mauricio Velasco   Dual Toric Codes and Polytopes of Degree
                                  One  . . . . . . . . . . . . . . . . . . 683--692
              Darryn Bryant and   
                 Daniel Horsley   Steiner Triple Systems without Parallel
                                  Classes  . . . . . . . . . . . . . . . . 693--696

SIAM Journal on Discrete Mathematics
Volume 29, Number 2, 2015

                    Jing Xi and   
                 Ruriko Yoshida   The Characteristic Imset Polytope of
                                  Bayesian Networks with Ordered Nodes . . 697--715
                Florian Pfender   Combined Degree and Connectivity
                                  Conditions for $H$-Linked Graphs . . . . 716--729
                   Peter Nelson   Matroids Denser than a Projective
                                  Geometry . . . . . . . . . . . . . . . . 730--735
                 Nathan Reading   Noncrossing Arc Diagrams and Canonical
                                  Join Representations . . . . . . . . . . 736--750
          Xavier Allamigeon and   
           Pascal Benchimol and   
    Stéphane Gaubert and   
                 Michael Joswig   Tropicalizing the Simplex Algorithm  . . 751--795
               Peter Nelson and   
          Stefan H. M. van Zwam   Matroids Representable Over Fields With
                                  a Common Subfield  . . . . . . . . . . . 796--810
       József Balogh and   
                Gelasio Salazar   Book Embeddings of Regular Graphs  . . . 811--822
       Maximilien Gadouleau and   
              Nicholas Georgiou   New Constructions and Bounds for
                                  Winkler's Hat Game . . . . . . . . . . . 823--834
           Magnus Bordewich and   
                 Charles Semple   Defining a Phylogenetic Tree with the
                                  Minimum Number of $r$-State Characters   835--853
Ayça Çesmelio\uglu and   
             Wilfried Meidl and   
                 Alexander Pott   Bent Functions, Spreads, and
                                  $o$-Polynomials  . . . . . . . . . . . . 854--867
         Alexandr Kostochka and   
               Dhruv Mubayi and   
        Jacques Verstraëte   Turán Problems and Shadows III:
                                  Expansions of Graphs . . . . . . . . . . 868--876
              Manuel Lafond and   
                    Ben Seamone   Hamiltonian Chordal Graphs are not Cycle
                                  Extendable . . . . . . . . . . . . . . . 877--887
     René van Bevern and   
           Robert Bredereck and   
                Jiehua Chen and   
             Vincent Froese and   
           Rolf Niedermeier and   
           Gerhard J. Woeginger   Network-Based Vertex Dissolution . . . . 888--914
         José Correa and   
          Omar Larré and   
            José A. Soto   TSP Tours in Cubic Graphs: Beyond $ 4 /
                                  3 $  . . . . . . . . . . . . . . . . . . 915--939
         Katharina T. Huber and   
           George Kettleborough   Distinguished Minimal Topological Lassos 940--961
        Julia Böttcher and   
       Yoshiharu Kohayakawa and   
               Anusch Taraz and   
             Andreas Würfl   An Extension of the Blow-up Lemma to
                                  Arrangeable Graphs . . . . . . . . . . . 962--1001
          Jonathan L. Gross and   
             Toufik Mansour and   
           Thomas W. Tucker and   
               David G. L. Wang   Log-Concavity of Combinations of
                                  Sequences and Applications to Genus
                                  Distributions  . . . . . . . . . . . . . 1002--1029
               Guantao Chen and   
            Ronald J. Gould and   
          Kazuhide Hirohata and   
              Katsuhiro Ota and   
                  Songling Shan   Disjoint Chorded Cycles of the Same
                                  Length . . . . . . . . . . . . . . . . . 1030--1041
                Mihyun Kang and   
             Christoph Koch and   
  Angélica Pachón   The Phase Transition in Multitype
                                  Binomial Random Graphs . . . . . . . . . 1042--1064
             Barnaby Martin and   
          Florent Madelaine and   
                   Juraj Stacho   Constraint Satisfaction with Counting
                                  Quantifiers  . . . . . . . . . . . . . . 1065--1113
            Ignacio Cascudo and   
              Ronald Cramer and   
            Diego Mirandola and   
        Carles Padró and   
                  Chaoping Xing   On Secret Sharing with Nonlinear Product
                                  Reconstruction . . . . . . . . . . . . . 1114--1131

SIAM Journal on Discrete Mathematics
Volume 29, Number 3, 2015

                     Zhihan Gao   On the Metric $s$--$t$ Path Traveling
                                  Salesman Problem . . . . . . . . . . . . 1133--1149
             George B. Mertzios   The Recognition of Simple-Triangle
                                  Graphs and of Linear-Interval Orders is
                                  Polynomial . . . . . . . . . . . . . . . 1150--1185
               Roman Glebov and   
             Anita Liebenau and   
             Tibor Szabó   On the Concentration of the Domination
                                  Number of the Random Graph . . . . . . . 1186--1206
                Yair Bartal and   
            Lee-Ad Gottlieb and   
                    Ofer Neiman   On the Impossibility of Dimension
                                  Reduction for Doubling Subsets of $
                                  \ell_p $ . . . . . . . . . . . . . . . . 1207--1222
               David Galvin and   
                  Jeff Kahn and   
               Dana Randall and   
              Gregory B. Sorkin   Phase coexistence and torpid mixing in
                                  the $3$-coloring model on $ {\mathbb
                                  Z}^d$  . . . . . . . . . . . . . . . . . 1223--1244
              Miriam Farber and   
            Charles Johnson and   
                     Leon Zhang   The Number of Interlacing Equalities
                                  Resulting from Removal of a Vertex from
                                  a Tree . . . . . . . . . . . . . . . . . 1245--1258
              Bernd Schulze and   
             Shin-ichi Tanigawa   Infinitesimal Rigidity of Symmetric
                                  Bar-Joint Frameworks . . . . . . . . . . 1259--1286
          David Adjiashvili and   
                Timm Oertel and   
              Robert Weismantel   A Polyhedral Frobenius Theorem with
                                  Applications to Integer Optimization . . 1287--1302
           Cristopher Moore and   
              Alexander Russell   Optimal $ \varepsilon $-Biased Sets with
                                  Just a Little Randomness . . . . . . . . 1303--1311
              Michael Elkin and   
                Ofer Neiman and   
                   Shay Solomon   Light Spanners . . . . . . . . . . . . . 1312--1321
             Peter Floderus and   
          Miros\law Kowaluk and   
             Andrzej Lingas and   
              Eva-Marta Lundell   Detecting and Counting Small Pattern
                                  Graphs . . . . . . . . . . . . . . . . . 1322--1339
            Jayadev Acharya and   
              Hirakendu Das and   
          Olgica Milenkovic and   
              Alon Orlitsky and   
                   Shengjun Pan   String Reconstruction from Substring
                                  Compositions . . . . . . . . . . . . . . 1340--1371
          Adrian Dumitrescu and   
              Minghui Jiang and   
           Csaba D. Tóth   Computing Opaque Interior Barriers \`a
                                  la Shermer . . . . . . . . . . . . . . . 1372--1386
Barbora Candráková and   
                Robert Lukot'ka   Avoiding $5$-Circuits in $2$-Factors of
                                  Cubic Graphs . . . . . . . . . . . . . . 1387--1405
Péter Csikvári and   
                    Zhicong Lin   Homomorphisms of Trees into a Path . . . 1406--1422
               Guantao Chen and   
              Hikoe Enomoto and   
                Kenta Ozeki and   
               Shoichi Tsuchiya   Plane Triangulations Without a Spanning
                                  Halin Subgraph: Counterexamples to the
                                  Lovász--Plummer Conjecture on Halin
                                  Graphs . . . . . . . . . . . . . . . . . 1423--1426
           Petr A. Golovach and   
            Pinar Heggernes and   
             Pim van 't Hof and   
                Christophe Paul   Hadwiger Number of Graphs with Small
                                  Chordality . . . . . . . . . . . . . . . 1427--1451
          Kshipra Bhawalkar and   
              Jon Kleinberg and   
                 Kevin Lewi and   
            Tim Roughgarden and   
                  Aneesh Sharma   Preventing Unraveling in Social
                                  Networks: The Anchored $k$-Core Problem  1452--1475
                 Lisa Espig and   
                Alan Frieze and   
        Michael Krivelevich and   
                  Wesley Pegden   Walker--Breaker Games  . . . . . . . . . 1476--1485
            Claudio Qureshi and   
                 Daniel Panario   Rédei Actions on Finite Fields and
                                  Multiplication Map in Cyclic Group . . . 1486--1503
       Victor Falgas--Ravry and   
            Edward Marchant and   
              Oleg Pikhurko and   
                Emil R. Vaughan   The Codegree Threshold for $3$-Graphs
                                  with Independent Neighborhoods . . . . . 1504--1539
             Yeow Meng Chee and   
               Han Mao Kiah and   
      Punarbasu Purkayastha and   
            Patrick Solé   Product Construction of Affine Codes . . 1540--1552
             Louis DeBiasio and   
          Daniela Kühn and   
             Theodore Molla and   
               Deryk Osthus and   
                  Amelia Taylor   Arbitrary Orientations of Hamilton
                                  Cycles in Digraphs . . . . . . . . . . . 1553--1584
      Deeparnab Chakrabarty and   
                    Zhiyi Huang   Recognizing Coverage Functions . . . . . 1585--1599
          Clemens Heuberger and   
               Daniel Krenn and   
                 Stephan Wagner   Canonical Trees, Compact Prefix-Free
                                  Codes, and Sums of Unit Fractions: a
                                  Probabilistic Analysis . . . . . . . . . 1600--1653
        Michael Krivelevich and   
            Daniel Reichman and   
               Wojciech Samotij   Smoothed Analysis on Connected Graphs    1654--1669
               Ross J. Kang and   
          János Pach and   
               Viresh Patel and   
                     Guus Regts   A Precise Threshold for Quasi-Ramsey
                                  Numbers  . . . . . . . . . . . . . . . . 1670--1682
             Dennis Clemens and   
                Asaf Ferber and   
               Roman Glebov and   
                 Dan Hefetz and   
                 Anita Liebenau   Building Spanning Trees Quickly in
                                  Maker-Breaker Games  . . . . . . . . . . 1683--1705
                Shou-Jun Xu and   
                  Rob Gysel and   
                   Dan Gusfield   Minimum Average Distance Clique Trees    1706--1734
                  Marthe Bonamy   Planar graphs with $ \Delta \geq 8 $ are
                                  ($ \Delta + 1 $)-edge-choosable  . . . . 1735--1763
      Attila Bernáth and   
           Yusuke Kobayashi and   
               Tatsuya Matsuoka   The Generalized Terminal Backup Problem  1764--1782

SIAM Journal on Discrete Mathematics
Volume 29, Number 4, 2015

                  Joel A. Tropp   Integer Factorization of a
                                  Positive-Definite Matrix . . . . . . . . 1783--1791
         Daniel W. Cranston and   
                  Landon Rabern   Graphs with $ \chi = \Delta $ Have Big
                                  Cliques  . . . . . . . . . . . . . . . . 1792--1814
               Prachi Goyal and   
            Neeldhara Misra and   
              Fahad Panolan and   
                  Meirav Zehavi   Deterministic Algorithms for Matching
                                  and Packing Problems Based on
                                  Representative Sets  . . . . . . . . . . 1815--1836
           Nicola Apollonio and   
                 Anna Galluccio   Minimally Unbalanced Diamond-Free Graphs
                                  and Dyck-Paths . . . . . . . . . . . . . 1837--1863
           Valentin Garnero and   
            Christophe Paul and   
                 Ignasi Sau and   
          Dimitrios M. Thilikos   Explicit Linear Kernels via Dynamic
                                  Programming  . . . . . . . . . . . . . . 1864--1894
               Juan C. Vera and   
                Eric Vigoda and   
                     Linji Yang   Improved Bounds on the Phase Transition
                                  for the Hard-Core Model in 2 Dimensions  1895--1915
          Emanuele Delucchi and   
                Martin Dlugosch   Bergman Complexes of Lattice Path
                                  Matroids . . . . . . . . . . . . . . . . 1916--1930
               Sepp Hartung and   
       André Nichterlein   NP-Hardness and Fixed-Parameter
                                  Tractability of Realizing Degree
                                  Sequences with Directed Acyclic Graphs   1931--1960
              Ivan Bliznets and   
             Fedor V. Fomin and   
           Marcin Pilipczuk and   
               Michal Pilipczuk   A Subexponential Parameterized Algorithm
                                  for Proper Interval Completion . . . . . 1961--1987
                Qizhong Lin and   
                     Yusheng Li   A Folkman Linear Family  . . . . . . . . 1988--1998
              Choongbum Lee and   
                    Sang-il Oum   Number of Cliques in Graphs with a
                                  Forbidden Subdivision  . . . . . . . . . 1999--2005
          Ross M. McConnell and   
                 Yahav Nussbaum   Linear-Time Recognition of Probe
                                  Interval Graphs  . . . . . . . . . . . . 2006--2046
           Nicolas Bousquet and   
    Aurélie Lagoutte and   
                 Zhentao Li and   
              Aline Parreau and   
 Stéphan Thomassé   Identifying Codes in Hereditary Classes
                                  of Graphs and VC-Dimension . . . . . . . 2047--2064
    Daniel Irving Bernstein and   
             Lam Si Tung Ho and   
                 Colby Long and   
                 Mike Steel and   
         Katherine St. John and   
                 Seth Sullivant   Bounds on the Expected Size of the
                                  Maximum Agreement Subtree  . . . . . . . 2065--2074
          Atsuhiro Nakamoto and   
              Kenta Noguchi and   
                    Kenta Ozeki   Extension to Even Triangulations . . . . 2075--2087
         Jennifer Diemunsch and   
            Michael Ferrara and   
           Sogol Jahanbekam and   
                 James M. Shook   Extremal Theorems for Degree Sequence
                                  Packing and the Two-Color Discrete
                                  Tomography Problem . . . . . . . . . . . 2088--2099
                  Anton Deitmar   Ihara Zeta Functions of Infinite
                                  Weighted Graphs  . . . . . . . . . . . . 2100--2116
            Gordon F. Royle and   
                  Alan D. Sokal   Linear Bound in Terms of Maxmaxflow for
                                  the Chromatic Roots of Series-Parallel
                                  Graphs . . . . . . . . . . . . . . . . . 2117--2159
                Kosta Dosen and   
                 Zoran Petri\'c   A Planarity Criterion for Graphs . . . . 2160--2165
                    Yi Wang and   
                 Jian Cheng and   
                   Rong Luo and   
                 Cun-Quan Zhang   Vector Flows and Integer Flows . . . . . 2166--2178
           Gabriel Coutinho and   
                      Henry Liu   No Laplacian Perfect State Transfer in
                                  Trees  . . . . . . . . . . . . . . . . . 2179--2188
                    Seth Pettie   Three Generalizations of
                                  Davenport--Schinzel Sequences  . . . . . 2189--2238
        Telikepalli Kavitha and   
                Nithin M. Varma   Small Stretch Pairwise Spanners and
                                  Approximate $D$-Preservers . . . . . . . 2239--2254
              Andrzej Dudek and   
             Alan M. Frieze and   
     Charalampos E. Tsourakakis   Rainbow Connection of Random Regular
                                  Graphs . . . . . . . . . . . . . . . . . 2255--2266
Ignacio García-Marco and   
Jorge Luis Ramírez Alfonsín   Matroid Toric Ideals: Complete
                                  Intersection, Minors, and Minimal
                                  Systems of Generators  . . . . . . . . . 2267--2276
                 Shmuel Onn and   
          Pauline Sarrabezolles   Huge Unimodular $n$-Fold Programs  . . . 2277--2283
          Valentin Féray   Cyclic Inclusion-Exclusion . . . . . . . 2284--2311
       Maximilien Gadouleau and   
             Adrien Richard and   
              Sòren Riis   Fixed Points of Boolean Networks,
                                  Guessing Graphs, and Coding Theory . . . 2312--2335
           Daniel J. Harvey and   
                  David R. Wood   Cycles of Given Size in a Dense Graph    2336--2349
                     Felix Joos   Random Subgraphs in Sparse Graphs  . . . 2350--2360
              Johan Thapper and   
         Stanislav Zivný   Necessary Conditions for Tractability of
                                  Valued CSPs  . . . . . . . . . . . . . . 2361--2384
          Katherine Edwards and   
             Dong Yeap Kang and   
                Jaehoon Kim and   
                Sang-il Oum and   
                   Paul Seymour   A Relative of Hadwiger's Conjecture  . . 2385--2388
                Vsevolod F. Lev   Edge-Isoperimetric Problem for Cayley
                                  Graphs and Generalized Takagi Functions  2389--2411
                Weifan Wang and   
                   Danjun Huang   A Characterization on the Adjacent
                                  Vertex Distinguishing Index of Planar
                                  Graphs with Large Maximum Degree . . . . 2412--2431


SIAM Journal on Discrete Mathematics
Volume 30, Number 1, 2016

Dániel Korándi and   
                Yuval Peled and   
                  Benny Sudakov   A Random Triadic Process . . . . . . . . 1--19
         Michael A. Henning and   
          William B. Kinnersley   Domination Game: a proof of the $ 3 /
                                  5$-Conjecture for Graphs with Minimum
                                  Degree at Least Two  . . . . . . . . . . 20--35
          François Dross   Fractional Triangle Decompositions in
                                  Graphs with Large Minimum Degree . . . . 36--42
             Nathan Lindzey and   
              Ross M. McConnell   Linear-Time Algorithms for Finding
                                  Tucker Submatrices and
                                  Lekkerkerker--Boland Subgraphs . . . . . 43--69
      Diego A. Morán and   
                 Santanu S. Dey   Closedness of Integer Hulls of Simple
                                  Conic Sets . . . . . . . . . . . . . . . 70--99
  Karola Mészáros   Pipe Dream Complexes and Triangulations
                                  of Root Polytopes Belong Together  . . . 100--111
     Ken-ichi Kawarabayashi and   
                    Kenta Ozeki   $5$-Connected Toroidal Graphs are
                                  Hamiltonian-Connected  . . . . . . . . . 112--140
                 Ahmad Abdi and   
      Andreas Emil Feldmann and   
            Bertrand Guenin and   
       Jochen Könemann and   
                 Laura Sanit\`a   Lehman's Theorem and the Directed
                                  Steiner Tree Problem . . . . . . . . . . 141--153
                 Felix Joos and   
               Viet Hang Nguyen   Induced Matchings in Graphs of Degree at
                                  Most $4$ . . . . . . . . . . . . . . . . 154--165
               Colin Cooper and   
                    Alan Frieze   Vacant Sets and Vacant Nets: Component
                                  Structures Induced by a Random Walk  . . 166--205
              Louis Esperet and   
                   Pascal Ochem   Islands in Graphs on Surfaces  . . . . . 206--219
              Gregory Gutin and   
                   Viresh Patel   Parameterized Traveling Salesman
                                  Problem: Beating the Average . . . . . . 220--238
         Gábor Braun and   
              Sebastian Pokutta   A Polyhedral Characterization of Border
                                  Bases  . . . . . . . . . . . . . . . . . 239--265
      Nirattaya Khamsemanan and   
           Rafail Ostrovsky and   
              William E. Skeith   On the Black-box Use of Somewhat
                                  Homomorphic Encryption in Noninteractive
                                  Two-Party Protocols  . . . . . . . . . . 266--295
                  Fan Chung and   
                      Xing Peng   Decomposition of Random Graphs into
                                  Complete Bipartite Graphs  . . . . . . . 296--310
Mamadou Moustapha Kanté and   
                Lhouari Nourine   Polynomial Time Algorithms for Computing
                                  a Minimum Hull Set in
                                  Distance-Hereditary and Chordal Graphs   311--326
                Martin Skutella   A Note on the Ring Loading Problem . . . 327--342
                  K. Jansen and   
                    F. Land and   
                        K. Land   Bounding the Running Time of Algorithms
                                  for Scheduling and Packing Problems  . . 343--366
               David Covert and   
                 Doowon Koh and   
                    Youngjin Pi   On the Sums of Any $k$ Points in Finite
                                  Fields . . . . . . . . . . . . . . . . . 367--382
             Fedor V. Fomin and   
          Daniel Lokshtanov and   
            Neeldhara Misra and   
         Geevarghese Philip and   
                  Saket Saurabh   Hitting Forbidden Minors: Approximation
                                  and Kernelization  . . . . . . . . . . . 383--410
                  Yu Hin Au and   
           Levent Tunçel   A Comprehensive Analysis of Polyhedral
                                  Lift-and-Project Methods . . . . . . . . 411--451
               Adrian Bondy and   
              Zbigniew Lonc and   
              Pawel Rz\kazewski   Constructing Optimal $k$-Radius
                                  Sequences  . . . . . . . . . . . . . . . 452--464
              Paul Balister and   
Béla Bollobás and   
            Jenö Lehel and   
                 Michal Morayne   Random Hypergraph Irregularity . . . . . 465--473
               Yutaro Yamaguchi   Packing $A$-Paths in Group-Labelled
                                  Graphs via Linear Matroid Parity . . . . 474--492
                James Oxley and   
             Charles Semple and   
                  Geoff Whittle   A Wheels-and-Whirls Theorem for
                                  $3$-Connected $2$-Polymatroids . . . . . 493--524
            Michael Hebdige and   
            Daniel Král'   Third Case of the Cyclic Coloring
                                  Conjecture . . . . . . . . . . . . . . . 525--548
                     Boris Bukh   Bounds on Equiangular Lines and on
                                  Related Spherical Codes  . . . . . . . . 549--554
              Andrzej Dudek and   
                   Pawel Pralat   Acquaintance Time of Random Graphs Near
                                  Connectivity Threshold . . . . . . . . . 555--568
           Derek G. Corneil and   
Jérémie Dusart and   
               Michel Habib and   
           Ekkehard Köhler   On the Power of Graph Searching for
                                  Cocomparability Graphs . . . . . . . . . 569--591
                Irena Penev and   
Stéphan Thomassé and   
              Nicolas Trotignon   Isolating Highly Connected Induced
                                  Subgraphs  . . . . . . . . . . . . . . . 592--619

SIAM Journal on Discrete Mathematics
Volume 30, Number 2, 2016

             Michael Drmota and   
              Manuel Kauers and   
             Lukas Spiegelhofer   On a Conjecture of Cusick Concerning the
                                  Sum of Digits of $n$ and $ n + t$  . . . 621--649
      Emil-Alexandru Ciolan and   
Pedro A. García-Sánchez and   
                   Pieter Moree   Cyclotomic Numerical Semigroups  . . . . 650--668
                  M. Blanco and   
                      F. Santos   Lattice $3$-Polytopes with Few Lattice
                                  Points . . . . . . . . . . . . . . . . . 669--686
                  M. Blanco and   
                      F. Santos   Lattice $3$-Polytopes with Six Lattice
                                  Points . . . . . . . . . . . . . . . . . 687--717
                  Noga Alon and   
             Humberto Naves and   
                  Benny Sudakov   On the Maximum Quartet Distance between
                                  Phylogenetic Trees . . . . . . . . . . . 718--735
  Karola Mészáros   $h$-Polynomials of Reduction Trees . . . 736--762
                Kai Kellner and   
              Thorsten Theobald   Sum of Squares Certificates for
                                  Containment of $ \mathcal {H}
                                  $-Polytopes in $ \mathcal {V}
                                  $-Polytopes  . . . . . . . . . . . . . . 763--776
                Takuro Fukunaga   Approximating the Generalized Terminal
                                  Backup Problem via Half-Integral
                                  Multiflow Relaxation . . . . . . . . . . 777--800
              Sarah Miracle and   
               Dana Randall and   
       Amanda Pascoe Streib and   
                  Prasad Tetali   Sampling and Counting $3$-Orientations
                                  of Planar Triangulations . . . . . . . . 801--831
              Henning Bruhn and   
                 Oliver Schaudt   Claw-Free $t$-Perfect Graphs Can Be
                                  Recognized in Polynomial Time  . . . . . 832--855
              Benjamin Bond and   
                  Lionel Levine   Abelian Networks I. Foundations and
                                  Examples . . . . . . . . . . . . . . . . 856--874
                     Jens Vygen   Reassembling Trees for the Traveling
                                  Salesman . . . . . . . . . . . . . . . . 875--894
                Jaehoon Kim and   
          Daniela Kühn and   
                   Deryk Osthus   Bipartitions of Highly Connected
                                  Tournaments  . . . . . . . . . . . . . . 895--911
              Winfried Just and   
                    Sungwoo Ahn   Lengths of Attractors and Transients in
                                  Neuronal Networks with Random
                                  Connectivities . . . . . . . . . . . . . 912--933
               Misha Rudnev and   
                    J. M. Selig   On the Use of the Klein Quadric for
                                  Geometric Incidence Problems in Two
                                  Dimensions . . . . . . . . . . . . . . . 934--954
            M. N. Ellingham and   
          Emily A. Marshall and   
                Kenta Ozeki and   
               Shoichi Tsuchiya   A Characterization of $ K_{2, 4}
                                  $-Minor-Free Graphs  . . . . . . . . . . 955--975
             Tuan-Yow Chien and   
                 Shayne Waldron   A Characterization of Projective Unitary
                                  Equivalence of Finite Frames and
                                  Applications . . . . . . . . . . . . . . 976--994
      François Gonze and   
        Raphaël M. Jungers   On the Synchronizing Probability
                                  Function and the Triple Rendezvous Time
                                  for Synchronizing Automata . . . . . . . 995--1014
             Aistis Atminas and   
             Andrew Collins and   
                 Jan Foniok and   
                 Vadim V. Lozin   Deciding the Bell Number for Hereditary
                                  Graph Properties . . . . . . . . . . . . 1015--1031
              Or Ordentlich and   
                 Ofer Shayevitz   An Upper Bound on the Sizes of
                                  Multiset-Union-Free Families . . . . . . 1032--1045
               Arun P. Mani and   
              Rebecca J. Stones   The Number of Labeled Connected Graphs
                                  Modulo Prime Powers  . . . . . . . . . . 1046--1057
                 Anindya De and   
         Ilias Diakonikolas and   
              Rocco A. Servedio   A Robust Khintchine Inequality, and
                                  Algorithms for Computing Optimal
                                  Constants in Fourier Analysis and
                                  High-Dimensional Geometry  . . . . . . . 1058--1094
       Zdenek Dvorák and   
                   Sergey Norin   Strongly Sublinear Separators and
                                  Polynomial Expansion . . . . . . . . . . 1095--1101
                Shagnik Das and   
                      Tuan Tran   Removal and Stability for
                                  Erd\Hos--Ko--Rado  . . . . . . . . . . . 1102--1114
       Johnny Guzmán and   
               Caroline Klivans   Chip Firing on General Invertible
                                  Matrices . . . . . . . . . . . . . . . . 1115--1127
                   A. Isgur and   
                    R. Lech and   
                   S. Moore and   
                   S. Tanny and   
                Y. Verberne and   
                       Y. Zhang   Constructing New Families of Nested
                                  Recursions with Slow Solutions . . . . . 1128--1147
    Sören Lennart Berg and   
                    Martin Henk   Lattice Point Inequalities for Centered
                                  Convex Bodies  . . . . . . . . . . . . . 1148--1158
              Marthe Bonamy and   
           Nicolas Bousquet and   
 Stéphan Thomassé   The Erd\Hos--Hajnal Conjecture for Long
                                  Holes and Antiholes  . . . . . . . . . . 1159--1164
                Jeff Cooper and   
                   Dhruv Mubayi   Coloring Sparse Hypergraphs  . . . . . . 1165--1180
                  Mei-Chu Chang   A Remark on Sieving in Biased Coin
                                  Convolutions . . . . . . . . . . . . . . 1181--1192
          Fatemeh Mohammadi and   
Eduardo Sáenz-de-Cabezón and   
                  Henry P. Wynn   The Algebraic Method in Tree Percolation 1193--1212
               Martin Grohe and   
              Pascal Schweitzer   Computing with Tangles . . . . . . . . . 1213--1247
        Tomás Kaiser and   
           Edita Rollová   Nowhere-Zero Flows in Signed
                                  Series-Parallel Graphs . . . . . . . . . 1248--1258
                   Hailun Zheng   Minimal Balanced Triangulations of
                                  Sphere Bundles over the Circle . . . . . 1259--1268
                Sinan Aksoy and   
                      Paul Horn   Graphs with Many Strong Orientations . . 1269--1282
                 Pat Devlin and   
                      Jeff Kahn   On ``stability'' in the
                                  Erd\Hos--Ko--Rado Theorem  . . . . . . . 1283--1289
          Mourad BaÏou and   
             Francisco Barahona   Maximum Weighted Induced Bipartite
                                  Subgraphs and Acyclic Subgraphs of
                                  Planar Cubic Graphs  . . . . . . . . . . 1290--1301
               Iddo Ben-Ari and   
               Steven J. Miller   A Probabilistic Approach to Generalized
                                  Zeckendorf Decompositions  . . . . . . . 1302--1332
                 Mikhail Lavrov   An Upper Bound for the Hales--Jewett
                                  Number $ \mathrm {HJ}(4, 2) $  . . . . . 1333--1342

SIAM Journal on Discrete Mathematics
Volume 30, Number 3, 2016

          Daniela Kühn and   
               Deryk Osthus and   
                  Amelia Taylor   On the Random Greedy $F$-Free Hypergraph
                                  Process  . . . . . . . . . . . . . . . . 1343--1350
                        Jie Han   Perfect Matchings in Hypergraphs and the
                                  Erd\Hos Matching Conjecture  . . . . . . 1351--1357
            Phong Q. Nguyen and   
            Igor E. Shparlinski   Counting Co-Cyclic Lattices  . . . . . . 1358--1370
  Archontia C. Giannopoulou and   
          Daniel Lokshtanov and   
              Saket Saurabh and   
            Ondrej Suchý   Tree Deletion Set Has a Polynomial
                                  Kernel but No $ {\rm
                                  OPT}^{\mathcal{O}(1)} $ Approximation    1371--1384
              Richard Ehrenborg   Cyclically Consecutive Permutation
                                  Avoidance  . . . . . . . . . . . . . . . 1385--1390
            Matthias Hamann and   
          Daniel Weißauer   Bounding Connected Tree-Width  . . . . . 1391--1400
            Manu Basavaraju and   
          Mathew C. Francis and   
            M. S. Ramanujan and   
                  Saket Saurabh   Partially Polynomial Kernels for Set
                                  Cover and Test Cover . . . . . . . . . . 1401--1423
              David Coudert and   
          Guillaume Ducoffe and   
                  Nicolas Nisse   To Approximate Treewidth, Use
                                  Treelength!  . . . . . . . . . . . . . . 1424--1436
                   Jun Yang and   
               Fady Alajaji and   
                  Glen Takahara   Lower Bounds on the Probability of a
                                  Finite Union of Events . . . . . . . . . 1437--1452
                        Jie Han   Near Perfect Matchings in $k$-Uniform
                                  Hypergraphs II . . . . . . . . . . . . . 1453--1469
              Matthias Beck and   
             Benjamin Braun and   
        Matthias Köppe and   
            Carla D. Savage and   
     Zafeirakis Zafeirakopoulos   Generating Functions and Triangulations
                                  for Lecture Hall Cones . . . . . . . . . 1470--1479
                  Ben Clark and   
              Dillon Mayhew and   
            Stefan van Zwam and   
                  Geoff Whittle   The Structure of $ \{ U_{2, 5}, U_{3, 5}
                                  \} $-Fragile Matroids  . . . . . . . . . 1480--1508
        Sebastian M. Cioaba and   
             Jack H. Koolen and   
             Hiroshi Nozaki and   
              Jason R. Vermette   Maximizing the Order of a Regular Graph
                                  of Given Valency and Second Eigenvalue   1509--1525
                    Mark Wildon   A Combinatorial Proof of a Plethystic
                                  Murnaghan--Nakayama Rule . . . . . . . . 1526--1533
            Diego Cifuentes and   
               Pablo A. Parrilo   Exploiting Chordal Structure in
                                  Polynomial Ideals: a Gröbner Bases
                                  Approach . . . . . . . . . . . . . . . . 1534--1570
           Michele Conforti and   
             Samuel Fiorini and   
         Kanstantsin Pashkovich   Cut Dominants and Forbidden Minors . . . 1571--1589
               Carolyn Chun and   
                 Guoli Ding and   
              Dillon Mayhew and   
                    James Oxley   Unavoidable Connected Matroids Retaining
                                  a Specified Minor  . . . . . . . . . . . 1590--1606
             Leo van Iersel and   
                Steven Kelk and   
               Nela Leki\'c and   
              Chris Whidden and   
                    Norbert Zeh   Hybridization Number on Three Rooted
                                  Binary Trees is EPT  . . . . . . . . . . 1607--1631
         William Y. C. Chen and   
             Alan J. X. Guo and   
               Peter L. Guo and   
          Harry H. Y. Huang and   
               Thomas Y. H. Liu   $s$-Inversion Sequences and
                                  $P$-Partitions of Type $B$ . . . . . . . 1632--1643
                Thomas Boys and   
         Claudiu Valculescu and   
                 Frank de Zeeuw   On the Number of Ordinary Conics . . . . 1644--1659
           Ricky X. F. Chen and   
            Christian M. Reidys   Plane Permutations and Applications to a
                                  Result of Zagier--Stanley and Distances
                                  of Permutations  . . . . . . . . . . . . 1660--1684
  Archontia C. Giannopoulou and   
             George B. Mertzios   New Geometric Representations and
                                  Domination Problems on Tolerance and
                                  Multitolerance Graphs  . . . . . . . . . 1685--1725
              Hiroshi Hirai and   
                   Yuni Iwamasa   On $k$-Submodular Relaxation . . . . . . 1726--1736
         Carolina Benedetti and   
              Joshua Hallam and   
                  John Machacek   Combinatorial Hopf Algebras of
                                  Simplicial Complexes . . . . . . . . . . 1737--1757
Kristóf Bérczi and   
 Tamás Király and   
               Yusuke Kobayashi   Covering Intersecting Bi-set Families
                                  under Matroid Constraints  . . . . . . . 1758--1774
            Bertrand Guenin and   
                  Leanne Stuive   Single Commodity-Flow Algorithms for
                                  Lifts of Graphic and CoGraphic Matroids  1775--1797
           Julien Cassaigne and   
         Eric Duchêne and   
                    Michel Rigo   Nonhomogeneous Beatty Sequences Leading
                                  to Invariant Games . . . . . . . . . . . 1798--1829
       Csilla Bujtás and   
         Michael A. Henning and   
                     Zsolt Tuza   Transversal Game on Hypergraphs and the
                                  $ \frac {3}{4}$-Conjecture on the Total
                                  Domination Game  . . . . . . . . . . . . 1830--1847
                Kunal Dutta and   
              C. R. Subramanian   Improved Bounds on Induced Acyclic
                                  Subgraphs in Random Digraphs . . . . . . 1848--1865
          Octavio Arizmendi and   
                Gelasio Salazar   Large Area Convex Holes in Random Point
                                  Sets . . . . . . . . . . . . . . . . . . 1866--1875
                     Felix Joos   Induced Matchings in Graphs of Bounded
                                  Maximum Degree . . . . . . . . . . . . . 1876--1882
                 Thomas Perrett   Chromatic Roots and Minor-Closed
                                  Families of Graphs . . . . . . . . . . . 1883--1897

SIAM Journal on Discrete Mathematics
Volume 30, Number 4, 2016

        Victor Falgas-Ravry and   
                        Yi Zhao   Codegree Thresholds for Covering
                                  $3$-Uniform Hypergraphs  . . . . . . . . 1899--1917
                   Luca Ferrari   Dyck Algebras, Interval Temporal Logic,
                                  and Posets of Intervals  . . . . . . . . 1918--1937
               Ross J. Kang and   
          François Pirot   Coloring Powers and Girth  . . . . . . . 1938--1949
               Sergey Bereg and   
       Alexander E. Holroyd and   
             Lev Nachmanson and   
                 Sergey Pupyrev   Representing Permutations with Few Moves 1950--1977
               Ronald Fagin and   
                 Ravi Kumar and   
           Mohammad Mahdian and   
               D. Sivakumar and   
                       Erik Vee   An Algorithmic View of Voting  . . . . . 1978--1996
                   Ben Lund and   
                Shubhangi Saraf   Incidence Bounds for Block Designs . . . 1997--2010
        Charles J. Colbourn and   
                 Bingli Fan and   
                 Daniel Horsley   Disjoint Spread Systems and Fault
                                  Location . . . . . . . . . . . . . . . . 2011--2026
           Tomasz Kociumaka and   
          Jakub Radoszewski and   
                Wojciech Rytter   Efficient Ranking of Lyndon Words and
                                  Decoding Lexicographically Minimal de
                                  Bruijn Sequence  . . . . . . . . . . . . 2027--2046
             Christine T. Cheng   On the Stable Matchings That Can Be
                                  Reached When the Agents Go Marching in
                                  One By One . . . . . . . . . . . . . . . 2047--2063
                   Stasys Jukna   Tropical Complexity, Sidon Sets, and
                                  Dynamic Programming  . . . . . . . . . . 2064--2085
Barbora Candráková and   
                 Robert Lukotka   Short Cycle Covers on Cubic Graphs by
                                  Choosing a $2$-Factor  . . . . . . . . . 2086--2106
            Csaba Király   On Maximal Independent Arborescence
                                  Packing  . . . . . . . . . . . . . . . . 2107--2114
               Michael Tait and   
                  Craig Timmons   Independent Sets in Polarity Graphs  . . 2115--2129
                Tobias Windisch   Rapid Mixing and Markov Bases  . . . . . 2130--2145
               Benjamin Iriarte   Largest Eigenvalue of the Laplacian
                                  Matrix: Its Eigenspace and Transitive
                                  Orientations . . . . . . . . . . . . . . 2146--2161
                   Arnau Padrol   Extension Complexity of Polytopes with
                                  Few Vertices or Facets . . . . . . . . . 2162--2176
              Gregory Gutin and   
                 Mark Jones and   
          Magnus Wahlström   The Mixed Chinese Postman Problem
                                  Parameterized by Pathwidth and Treedepth 2177--2205
           Michele Conforti and   
                 Marco Di Summa   Maximal $S$-Free Convex Sets and the
                                  Helly Number . . . . . . . . . . . . . . 2206--2216
                Mustazee Rahman   Factor of IID Percolation on Trees . . . 2217--2242
            Chong Shangguan and   
                     Gennian Ge   Separating Hash Families: a Johnson-type
                                  bound and New Constructions  . . . . . . 2243--2264
              J. V. de Jong and   
               J. C. McLeod and   
                       M. Steel   Neighborhoods of Phylogenetic Trees:
                                  Exact and Asymptotic Counts  . . . . . . 2265--2287
    Andreas Brandstädt and   
                 Raffaele Mosca   Weighted Efficient Domination for $ P_5
                                  $-Free and $ P_6 $-Free Graphs . . . . . 2288--2303


SIAM Journal on Discrete Mathematics
Volume 31, Number 1, 2017

          Richard W. Kenyon and   
                David B. Wilson   The Space of Circular Planar Electrical
                                  Networks . . . . . . . . . . . . . . . . 1--28
              Florian Meier and   
                     Ueli Peter   Push is Fast on Sparse Random Graphs . . 29--49
             David Burstein and   
                 Jonathan Rubin   Sufficient Conditions for Graphicality
                                  of Bidegree Sequences  . . . . . . . . . 50--62
        Andrew Gainer-Dewar and   
              Paola Vera-Licona   The Minimal Hitting Set Generation
                                  Problem: Algorithms and Computation  . . 63--100
               Leah Epstein and   
                 Asaf Levin and   
              Alan J. Soper and   
           Vitaly A. Strusevich   Power of Preemption for Minimizing Total
                                  Completion Time on Uniform Parallel
                                  Machines . . . . . . . . . . . . . . . . 101--123
                  Tao Jiang and   
                  Andrew Newman   Small Dense Subgraphs of a Graph . . . . 124--142
                Rudi Mrazovi\'c   One-Point Concentration of the Clique
                                  and Chromatic Numbers of the Random
                                  Cayley Graph on $ \mathbb {F}_2^n $  . . 143--154
        Michael Krivelevich and   
               Matthew Kwan and   
                  Benny Sudakov   Bounded-Degree Spanning Trees in
                                  Randomly Perturbed Graphs  . . . . . . . 155--171
             Stefan Felsner and   
              Irina Mustata and   
                  Martin Pergel   The Complexity of the Partial Order
                                  Dimension Problem: Closing the Gap . . . 172--189
          James M. Carraher and   
              Stephen G. Hartke   Eulerian Circuits with No Monochromatic
                                  Transitions in Edge-Colored Digraphs
                                  with all Vertices of Outdegree Three . . 190--209
                    Peng Li and   
                      Yaokun Wu   A Linear Time Algorithm for the
                                  $1$-Fixed-Endpoint Path Cover Problem on
                                  Interval Graphs  . . . . . . . . . . . . 210--239
              Longxiu Huang and   
                       Tao Wang   On the Number of Neighbors in Normal
                                  Tiling . . . . . . . . . . . . . . . . . 240--253
                Kevin Grace and   
          Stefan H. M. van Zwam   Templates for Binary Matroids  . . . . . 254--282
              Martin Hoefer and   
                    Lisa Wagner   Locally Stable Marriage with Strict
                                  Preferences  . . . . . . . . . . . . . . 283--316
              Kassie Archer and   
               Scott M. LaLonde   Allowed Patterns of Symmetric Tent Maps
                                  via Commuter Functions . . . . . . . . . 317--334
      Attila Bernáth and   
              Roland Grappe and   
          Zoltán Szigeti   Partition Constrained Covering of a
                                  Symmetric Crossing Supermodular Function
                                  by a Graph . . . . . . . . . . . . . . . 335--382
           Katherine Staden and   
                Andrew Treglown   On Degree Sequences Forcing The Square
                                  of a Hamilton Cycle  . . . . . . . . . . 383--437
             Samuel Fiorini and   
                 Tony Huynh and   
         Gwenaël Joret and   
          Antonios Varvitsiotis   The Excluded Minors for Isometric
                                  Realizability in the Plane . . . . . . . 438--453
            Hung-Chun Liang and   
                     Hsueh-I Lu   Minimum Cuts and Shortest Cycles in
                                  Directed Planar Graphs via Noncrossing
                                  Shortest Paths . . . . . . . . . . . . . 454--476
                 Amanda Redlich   A Power-of-Two-Choices Unbalanced
                                  Allocation Process . . . . . . . . . . . 477--488
                Alan Frieze and   
                 Tony Johansson   Minimum Cost Matching in a Random Graph
                                  with Random Costs  . . . . . . . . . . . 489--510
           Petr A. Golovach and   
          Marcin Kami\'nski and   
          Spyridon Maniatis and   
          Dimitrios M. Thilikos   The Parameterized Complexity of Graph
                                  Cyclability  . . . . . . . . . . . . . . 511--541
              N. R. Aravind and   
              R. B. Sandeep and   
               Naveen Sivadasan   Dichotomy Results on the Hardness of
                                  $H$-free Edge Modification Problems  . . 542--561
                   James R. Lee   Covering the Large Spectrum and
                                  Generalized Riesz Products . . . . . . . 562--572
              Amotz Bar-Noy and   
                Dror Rawitz and   
                 Peter Terlecky   Maximizing Barrier Coverage Lifetime
                                  with Mobile Sensors  . . . . . . . . . . 573--596
              Chun Lam Chan and   
          Winston Fernandes and   
              Navin Kashyap and   
           Manjunath Krishnapur   Phase Transitions for the Uniform
                                  Distribution in the Pattern Maximum
                                  Likelihood Problem and its Bethe
                                  Approximation  . . . . . . . . . . . . . 597--631
                Sylvia Boyd and   
               Philippe Legault   Toward a $ 6 / 5 $ Bound for the Minimum
                                  Cost $2$-Edge Connected Spanning
                                  Subgraph . . . . . . . . . . . . . . . . 632--644
               Adrian Bondy and   
              Zbigniew Lonc and   
              Pawel Rz\kazewski   Erratum: Constructing Optimal $k$-Radius
                                  Sequences  . . . . . . . . . . . . . . . 645--646

SIAM Journal on Discrete Mathematics
Volume 31, Number 2, 2017

          Hüseyin Acan and   
        Andrea Collevecchio and   
            Abbas Mehrabian and   
                   Nick Wormald   On the Push&Pull Protocol for Rumor
                                  Spreading  . . . . . . . . . . . . . . . 647--668
       Gerard Jennhwa Chang and   
              Guan-Huei Duh and   
             Tsai-Lien Wong and   
                     Xuding Zhu   Total Weight Choosability of Trees . . . 669--686
     Andreas Björklund and   
               Vikram Kamat and   
             Lukasz Kowalik and   
                  Meirav Zehavi   Spotting Trees with Few Leaves . . . . . 687--713
                      Ringi Kim   Unavoidable Subtournaments in Large
                                  Tournaments with No Homogeneous Sets . . 714--725
         Daniel W. Cranston and   
                  Landon Rabern   List-Coloring Claw-Free Graphs with $
                                  \Delta - 1 $ Colors  . . . . . . . . . . 726--748
                 Oded Regev and   
       Noah Stephens-Davidowitz   An Inequality for Gaussians on Lattices  749--757
           Sandy H. L. Chen and   
                      Amy M. Fu   A $ 4 n$-Point Elliptic Interpolation
                                  Formula and its Applications . . . . . . 758--765
           Naonori Kakimura and   
     Ken-ichi Kawarabayashi and   
               Yusuke Kobayashi   Packing Edge-Disjoint Odd Eulerian
                                  Subgraphs Through Prescribed Vertices in
                                  $4$-Edge-Connected Graphs  . . . . . . . 766--782
               Marie Mauhar and   
             Joseph Rusinko and   
                     Zoe Vernon   $H$-Representation of the Kimura-3
                                  Polytope for the $m$-Claw Tree . . . . . 783--795
                 Xingde Jia and   
                      Jian Shen   Extremal Bases for Finite Cyclic Groups  796--804
            Vida Dujmovi\'c and   
             David Eppstein and   
                  David R. Wood   Structure of Graphs with Locally
                                  Restricted Crossings . . . . . . . . . . 805--824
             Maurice Cheung and   
       Julián Mestre and   
            David B. Shmoys and   
           José Verschae   A Primal-Dual Approximation Algorithm
                                  for Min-Sum Single-Machine Scheduling
                                  Problems . . . . . . . . . . . . . . . . 825--838
          Monika Balvociute and   
               David Bryant and   
               Andreas Spillner   When Can Splits be Drawn in the Plane?   839--856
               Michael S. Payne   Bichromatic Lines in the Plane . . . . . 857--864
       Zdenek Dvorák and   
         Bernard Lidický   Fine Structure of $4$-Critical
                                  Triangle-Free Graphs II. Planar
                                  Triangle-Free Graphs with Two Precolored
                                  $4$-Cycles . . . . . . . . . . . . . . . 865--874
    Daniel Irving Bernstein and   
                     Colby Long   L-Infinity Optimization to Linear Spaces
                                  and Phylogenetic Trees . . . . . . . . . 875--889
                 Roman Cada and   
                Shuya Chiba and   
                Kenta Ozeki and   
              Kiyoshi Yoshimoto   On Dominating Even Subgraphs in Cubic
                                  Graphs . . . . . . . . . . . . . . . . . 890--907
                   Wei-Hsuan Yu   New Bounds for Equiangular Lines and
                                  Spherical Two-Distance Sets  . . . . . . 908--917
          Arthur L. B. Yang and   
                Philip B. Zhang   Brenti's Open Problem on the
                                  Real-Rootedness of $q$-Eulerian
                                  Polynomials of Type $D$  . . . . . . . . 918--926
               Eimear Byrne and   
              Alberto Ravagnani   Covering Radius of Matrix Codes Endowed
                                  with the Rank Metric . . . . . . . . . . 927--944
          Jan Hladký and   
 János Komlós and   
               Diana Piguet and   
   Miklós Simonovits and   
                 Maya Stein and   
         Endre Szemerédi   The Approximate Loebl--Komlós--Sós
                                  Conjecture I: The Sparse Decomposition   945--982
          Jan Hladký and   
 János Komlós and   
               Diana Piguet and   
   Miklós Simonovits and   
                 Maya Stein and   
         Endre Szemerédi   The Approximate Loebl--Komlós--Sós
                                  Conjecture II: The Rough Structure of
                                  LKS Graphs . . . . . . . . . . . . . . . 983--1016
          Jan Hladký and   
 János Komlós and   
               Diana Piguet and   
   Miklós Simonovits and   
                 Maya Stein and   
         Endre Szemerédi   The Approximate Loebl--Komlós--Sós
                                  Conjecture III: The Finer Structure of
                                  LKS Graphs . . . . . . . . . . . . . . . 1017--1071
          Jan Hladký and   
 János Komlós and   
               Diana Piguet and   
   Miklós Simonovits and   
                 Maya Stein and   
         Endre Szemerédi   The Approximate Loebl--Komlós--Sós
                                  Conjecture IV: Embedding Techniques and
                                  the Proof of the Main Result . . . . . . 1072--1148
               Hongliang Lu and   
               David G. L. Wang   A Tutte-Type Characterization for Graph
                                  Factors  . . . . . . . . . . . . . . . . 1149--1159
             A. Coja-Oghlan and   
               A. Haqshenas and   
                   S. Hetterich   Walksat Stalls Well Below Satisfiability 1160--1173
             Andrea Francke and   
           Csaba D. Tóth   A Census of Plane Graphs with Polyline
                                  Edges  . . . . . . . . . . . . . . . . . 1174--1195
         Christoph Helmberg and   
               Israel Rocha and   
              Uwe Schwerdtfeger   Combinatorial Algorithms for Minimizing
                                  the Maximum Laplacian and Signless
                                  Laplacian Eigenvalues of Weighted Graphs 1196--1216
       Rémy Belmonte and   
             Fedor V. Fomin and   
           Petr A. Golovach and   
                M. S. Ramanujan   Metric Dimension of Bounded Tree-length
                                  Graphs . . . . . . . . . . . . . . . . . 1217--1243
 Karthekeyan Chandrasekaran and   
          Venkata Gandikota and   
               Elena Grigorescu   Deciding Orthogonality in
                                  Construction-$A$ Lattices  . . . . . . . 1244--1262
             Arnold Filtser and   
             Robert Krauthgamer   Sparsification of Two-Variable Valued
                                  Constraint Satisfaction Problems . . . . 1263--1276
             Kaushik Sarkar and   
            Charles J. Colbourn   Upper Bounds on the Size of Covering
                                  Arrays . . . . . . . . . . . . . . . . . 1277--1293
                 Mark Jones and   
          Daniel Lokshtanov and   
            M. S. Ramanujan and   
              Saket Saurabh and   
            Ondrej Suchý   Parameterized Complexity of Directed
                                  Steiner Tree on Sparse Graphs  . . . . . 1294--1327
             Dieter Mitsche and   
               Guillem Perarnau   On Treewidth and Related Parameters of
                                  Random Geometric Graphs  . . . . . . . . 1328--1354
       Zdenek Dvorák and   
                 Matthias Mnich   Large Independent Sets in Triangle-Free
                                  Planar Graphs  . . . . . . . . . . . . . 1355--1373
               Richard Lang and   
             Oliver Schaudt and   
                     Maya Stein   Almost Partitioning a $3$-Edge-Colored $
                                  K_{n, n}$ into Five Monochromatic Cycles 1374--1402
               Eimear Byrne and   
                Marco Calderini   Bounding the Optimal Rate of the ICSI
                                  and ICCSI problem  . . . . . . . . . . . 1403--1427
              P.-L. Giscard and   
                      P. Rochet   Algebraic Combinatorics on Trace
                                  Monoids: Extending Number Theory to
                                  Walks on Graphs  . . . . . . . . . . . . 1428--1453
       Jean-Claude Belfiore and   
         Cem Güner\.\i and   
              Buket Özkaya   Quasi-Cyclic Subcodes of Cyclic Codes    1454--1475

SIAM Journal on Discrete Mathematics
Volume 31, Number 3, 2017

                Yann Disser and   
                  Max Klimm and   
               Nicole Megow and   
              Sebastian Stiller   Packing a Knapsack of Unknown Capacity   1477--1497
             Ryan R. Martin and   
            Richard Mycroft and   
                   Jozef Skokan   An Asymptotic Multipartite Kühn--Osthus
                                  Theorem  . . . . . . . . . . . . . . . . 1498--1513
           Reinhard Diestel and   
            Philipp Eberenz and   
                    Joshua Erde   Duality Theorems for Blocks and Tangles
                                  in Graphs  . . . . . . . . . . . . . . . 1514--1528
                    Joshua Erde   Refining a Tree-Decomposition which
                                  Distinguishes Tangles  . . . . . . . . . 1529--1551
       Venkatesan Guruswami and   
                   Euiwoong Lee   Inapproximability of
                                  $H$-Transversal/Packing  . . . . . . . . 1552--1571
                Zi-Xia Song and   
                   Brian Thomas   Hadwiger's Conjecture for Graphs with
                                  Forbidden Holes  . . . . . . . . . . . . 1572--1580
          Daniel Lokshtanov and   
           Pranabendu Misra and   
            M. S. Ramanujan and   
                  Saket Saurabh   Hitting Selected (Odd) Cycles  . . . . . 1581--1615
              Henning Bruhn and   
                     Elke Fuchs   $t$-Perfection in $ P_5$-Free Graphs . . 1616--1633
                G. R. Omidi and   
                    M. Shahsiah   Diagonal Ramsey Numbers of Loose Cycles
                                  in Uniform Hypergraphs . . . . . . . . . 1634--1669
 Wouter Cames van Batenburg and   
              Louis Esperet and   
             Tobias Müller   Coloring Jordan Regions and Curves . . . 1670--1684
         Hossein Esfandiari and   
   MohammadTaghi Hajiaghayi and   
              Vahid Liaghat and   
            Morteza Monemizadeh   Prophet Secretary  . . . . . . . . . . . 1685--1701
              Julio Aracena and   
             Adrien Richard and   
                 Lilian Salinas   Number of Fixed Points and Disjoint
                                  Cycles in Monotone Boolean Networks  . . 1702--1725
                Ron Aharoni and   
                Dani Kotlar and   
                        Ran Ziv   Representation of Large Matchings in
                                  Bipartite Graphs . . . . . . . . . . . . 1726--1731
        Éva Czabarka and   
László A. Székely and   
                 Stephan Wagner   Inducibility in Binary Trees and
                                  Crossings in Random Tanglegrams  . . . . 1732--1750
             Michael P. Kim and   
           Warut Suksompong and   
  Virginia Vassilevska Williams   Who Can Win a Single-Elimination
                                  Tournament?  . . . . . . . . . . . . . . 1751--1764
            Monique Laurent and   
              Matteo Seminaroti   Similarity-First Search: a New Algorithm
                                  with Application to Robinsonian Matrix
                                  Recognition  . . . . . . . . . . . . . . 1765--1800
               Naoyuki Kamiyama   Popular Matchings with Ties and Matroid
                                  Constraints  . . . . . . . . . . . . . . 1801--1819
               Klaus Heeger and   
                     Jens Vygen   Two-Connected Spanning Subgraphs with at
                                  Most $ \frac {10}{7}{OPT} $ Edges  . . . 1820--1835
                 Ligang Jin and   
                Yingli Kang and   
           Michael Schubert and   
                  Yingqian Wang   Plane Graphs without $4$- and $5$-Cycles
                                  and without Ext-Triangular $7$-Cycles
                                  are $3$-Colorable  . . . . . . . . . . . 1836--1847
       József Balogh and   
                   Hong Liu and   
             Maryam Sharifzadeh   On Two Problems in Ramsey--Turán Theory   1848--1866
                    Dayu He and   
                         Xin He   Optimal Monotone Drawings of Trees . . . 1867--1877
             Brendan Murphy and   
        Oliver Roche-Newton and   
               Ilya D. Shkredov   Variations on the Sum--Product Problem
                                  II . . . . . . . . . . . . . . . . . . . 1878--1894
                Kenz Kallal and   
                 Tomoka Kan and   
                      Eric Wang   Improved Lower Bounds for Kissing
                                  Numbers in Dimensions $ 25 $ through $
                                  31 $ . . . . . . . . . . . . . . . . . . 1895--1908
                   Jiaao Li and   
              Hong-Jian Lai and   
                       Rong Luo   Group Connectivity, Strongly $ Z_m
                                  $-Connectivity, and Edge Disjoint
                                  Spanning Trees . . . . . . . . . . . . . 1909--1922
Edita Mácajová and   
                Martin Skoviera   Odd Decompositions of Eulerian Graphs    1923--1936
Edita Mácajová and   
                Martin Skoviera   Nowhere-Zero Flows on Signed Eulerian
                                  Graphs . . . . . . . . . . . . . . . . . 1937--1952
       Alejandro H. Morales and   
                   Igor Pak and   
                   Greta Panova   Hook Formulas for Skew Shapes II.
                                  Combinatorial Proofs and Enumerative
                                  Applications . . . . . . . . . . . . . . 1953--1989
               Zan-Bo Zhang and   
              Xiaoyan Zhang and   
              Hajo Broersma and   
                    Dingjun Lou   Extremal and Degree Conditions for Path
                                  Extendability in Digraphs  . . . . . . . 1990--2014
                     Bo Lin and   
            Bernd Sturmfels and   
              Xiaoxian Tang and   
                 Ruriko Yoshida   Convexity in Tree Spaces . . . . . . . . 2015--2038
         Daniel W. Cranston and   
                  Landon Rabern   Short Fans and the $ 5 / 6 $ Bound for
                                  Line Graphs  . . . . . . . . . . . . . . 2039--2063
 Jean-Philippe Labbé and   
                      Eran Nevo   Bounds for Entries of $ \gamma $-Vectors
                                  of Flag Homology Spheres . . . . . . . . 2064--2078
              Andrzej Dudek and   
                   Pawel Pralat   On some Multicolor Ramsey Properties of
                                  Random Graphs  . . . . . . . . . . . . . 2079--2092
           Davide Bolognini and   
            Antonio Macchia and   
           Emanuele Ventura and   
                 Volkmar Welker   The Poset of Proper Divisibility . . . . 2093--2109
    Raimundo Briceño and   
                  Ronnie Pavlov   Strong Spatial Mixing in Homomorphism
                                  Spaces . . . . . . . . . . . . . . . . . 2110--2137
              Arijit Bishnu and   
               Sameer Desai and   
               Arijit Ghosh and   
             Mayank Goswami and   
                Subhabrata Paul   Uniformity of Point Samples in Metric
                                  Spaces Using Gap Ratio . . . . . . . . . 2138--2171
             Bugra Caskurlu and   
            Vahan Mkrtchyan and   
                Ojas Parekh and   
                   K. Subramani   Partial Vertex Cover and Budgeted
                                  Maximum Coverage in Bipartite Graphs . . 2172--2184
            Amer E. Mouawad and   
            Naomi Nishimura and   
             Vinayak Pathak and   
                Venkatesh Raman   Shortest Reconfiguration Paths in the
                                  Solution Space of Boolean Formulas . . . 2185--2200
                 Zhentao Li and   
                    Bojan Mohar   Planar Digraphs of Digirth Four are
                                  $2$-Colorable  . . . . . . . . . . . . . 2201--2205
             Dong Yeap Kang and   
                Jaehoon Kim and   
                Younjin Kim and   
                     Geewon Suh   Sparse Spanning $k$-Connected Subgraphs
                                  in Tournaments . . . . . . . . . . . . . 2206--2227
                 Sejun Park and   
                    Jinwoo Shin   Convergence and Correctness of
                                  Max-Product Belief Propagation for
                                  Linear Programming . . . . . . . . . . . 2228--2246
               Yinghui Wang and   
             Richard P. Stanley   The Smith Normal Form Distribution of a
                                  Random Integer Matrix  . . . . . . . . . 2247--2268
         Mladen Kovacevi\'c and   
              Vincent Y. F. Tan   Improved Bounds on Sidon Sets via
                                  Lattice Packings of Simplices  . . . . . 2269--2278

SIAM Journal on Discrete Mathematics
Volume 31, Number 4, 2017

             David A. Cohen and   
           Martin C. Cooper and   
           Peter G. Jeavons and   
             Andrei Krokhin and   
              Robert Powell and   
         Stanislav Zivný   Binarisation for Valued Constraint
                                  Satisfaction Problems  . . . . . . . . . 2279--2300
       Silouanos Brazitikos and   
           Thodoris Karageorgos   An Algorithmic Regularity Lemma for $
                                  L_p $ Regular Sparse Matrices  . . . . . 2301--2313
      Dániel Gerbner and   
                    Cory Palmer   Extremal Results for Berge Hypergraphs   2314--2327
Josefran de Oliveira Bastos and   
    Guilherme Oliveira Mota and   
            Mathias Schacht and   
            Jakob Schnitzer and   
             Fabian Schulenburg   Loose Hamiltonian Cycles Forced by Large
                                  $ (k - 2)$-Degree --- Approximate
                                  Version  . . . . . . . . . . . . . . . . 2328--2347
          Ágnes Cseh and   
          Chien-Chung Huang and   
            Telikepalli Kavitha   Popular Matchings with Two-Sided
                                  Preferences and One-Sided Ties . . . . . 2348--2377
            Thomas Chappell and   
              Tobias Friedl and   
                   Raman Sanyal   Two Double Poset Polytopes . . . . . . . 2378--2413
          Jeannette Janssen and   
                Abbas Mehrabian   Rumors Spread Slowly in a Small-World
                                  Spatial Network  . . . . . . . . . . . . 2414--2428
               Guantao Chen and   
              Hikoe Enomoto and   
                Kenta Ozeki and   
               Shoichi Tsuchiya   Plane Triangulations Without a Spanning
                                  Halin Subgraph II  . . . . . . . . . . . 2429--2439
                  Meirav Zehavi   Maximum Minimal Vertex Cover
                                  Parameterized by Vertex Cover  . . . . . 2440--2456
                   Beifang Chen   Conformal Decomposition of Integral
                                  Tensions and Potentials of Signed Graphs 2457--2478
                  Brendan Nagle   Constructive Packings of Triple Systems  2479--2516
                  Noga Alon and   
                  Guy Rutenberg   Broadcast Transmission to Prioritizing
                                  Receivers  . . . . . . . . . . . . . . . 2517--2529
                     Shuxing Li   The Minimum Distance of Some
                                  Narrow-Sense Primitive BCH Codes . . . . 2530--2569
              Vladimir Gruji\'c   Quasisymmetric Functions for Nestohedra  2570--2585
              Francis Black and   
         Elizabeth Drellich and   
              Julianna Tymoczko   Valid Plane Trees: Combinatorial Models
                                  for RNA Secondary Structures with
                                  Watson--Crick Base Pairs . . . . . . . . 2586--2602
              Darryn Bryant and   
        Charles J. Colbourn and   
             Daniel Horsley and   
                 Ian M. Wanless   Steiner Triple Systems with High
                                  Chromatic Index  . . . . . . . . . . . . 2603--2611
António Pedro Goucha and   
        João Gouveia and   
                 Pedro M. Silva   On Ranks of Regular Polygons . . . . . . 2612--2625
              Amey Bhangale and   
               Rajiv Gandhi and   
     Mohammad T. Hajiaghayi and   
            Rohit Khandekar and   
                   Guy Kortsarz   Bi-Covering: Covering Edges with Two
                                  Small Subsets of Vertices  . . . . . . . 2626--2646
              Carlos Hoppen and   
              Hanno Lefmann and   
                  Knut Odermann   A Rainbow Erd\Hos--Rothschild Problem    2647--2674
            Federico Ardila and   
            Hanner Bastidas and   
             Cesar Ceballos and   
                       John Guo   The Configuration Space of a Robotic Arm
                                  in a Tunnel  . . . . . . . . . . . . . . 2675--2702
                  Lele Wang and   
                 Ofer Shayevitz   Graph Information Ratio  . . . . . . . . 2703--2734
            Robert Connelly and   
              Steven J. Gortler   Prestress Stability of Triangulated
                                  Convex Polytopes and Universal
                                  Second-Order Rigidity  . . . . . . . . . 2735--2753
         Gwenaël Joret and   
                Piotr Micek and   
                  Veit Wiechert   Planar Posets Have Dimension at Most
                                  Linear in Their Height . . . . . . . . . 2754--2790


SIAM Journal on Discrete Mathematics
Volume 32, Number 1, 2018

             Tyler Seacrest and   
              Francis Edward Su   A Lower Bound Technique for
                                  Triangulations of Simplotopes  . . . . . 1--28
                   Jiaao Li and   
                 Xinmin Hou and   
               Miaomiao Han and   
                  Hong-Jian Lai   Mod $ (2 p + 1)$-Orientation on
                                  Bipartite Graphs and Complementary
                                  Graphs . . . . . . . . . . . . . . . . . 29--43
             Jaroslaw Byrka and   
             Aravind Srinivasan   Approximation Algorithms for Stochastic
                                  and Risk-Averse Optimization . . . . . . 44--63
          Fatemeh Mohammadi and   
             Caroline Uhler and   
               Charles Wang and   
                   Josephine Yu   Generalized Permutohedra from
                                  Probabilistic Graphical Models . . . . . 64--93
       Zdenek Dvorák and   
         Bernard Lidický   Fine Structure of $4$-Critical
                                  Triangle-Free Graphs III. General
                                  Surfaces . . . . . . . . . . . . . . . . 94--105
        Selçuk Kavut and   
            Subhamoy Maitra and   
            Ferruh Özbudak   A Super-Set of Patterson--Wiedemann
                                  Functions: Upper Bounds and Possible
                                  Nonlinearities . . . . . . . . . . . . . 106--122
         Gwenaël Joret and   
                  David R. Wood   $ K_4 $-Minor-Free Induced Subgraphs of
                                  Sparse Connected Graphs  . . . . . . . . 123--147
          Mathew C. Francis and   
                 Dalu Jacob and   
                Satyabrata Jana   Uniquely Restricted Matchings in
                                  Interval Graphs  . . . . . . . . . . . . 148--172
                     Bobby Shen   Parametrizing an Integer Linear Program
                                  by an Integer  . . . . . . . . . . . . . 173--190
              Kyungyong Lee and   
                      Li Li and   
              Nicholas A. Loehr   A Combinatorial Approach to the Symmetry
                                  of $ q, t$-Catalan Numbers . . . . . . . 191--232
            Alexander Hoyer and   
                   Robin Thomas   Four Edge-Independent Spanning Trees . . 233--248
            Daniel Pellicer and   
            Gordon Ian Williams   Pyramids Over Regular $3$-Tori . . . . . 249--265
      Dániel Gerbner and   
      Balázs Keszegh and   
                Cory Palmer and   
    Balázs Patkós   On the Number of Cycles in a Graph with
                                  Restricted Cycle Lengths . . . . . . . . 266--279
              Benny Sudakov and   
                   Pedro Vieira   Two Remarks on Eventown and Oddtown
                                  Problems . . . . . . . . . . . . . . . . 280--295
                     Jie Ma and   
                        Bo Ning   Coloring Graphs with Two Odd Cycle
                                  Lengths  . . . . . . . . . . . . . . . . 296--319
               David Hartvigsen   Packing $k$-Matchings and $k$-Critical
                                  Graphs . . . . . . . . . . . . . . . . . 320--351
        Stephen R. Chestnut and   
          Robert Hildebrand and   
                 Rico Zenklusen   Sublinear Bounds for a Quantitative
                                  Doignon--Bell--Scarf Theorem . . . . . . 352--371
                   Jun Wang and   
                   Huajun Zhang   Intersecting Families in Symmetric
                                  Unions of Direct Products of Set
                                  Families . . . . . . . . . . . . . . . . 372--381
               Hongliang Lu and   
                    Xingxing Yu   On Rainbow Matchings for Hypergraphs . . 382--393
                Shuya Chiba and   
               Tomoki Yamashita   On Directed $2$-factors in Digraphs and
                                  $2$-factors Containing Perfect Matchings
                                  in Bipartite Graphs  . . . . . . . . . . 394--409
       Yoshiharu Kohayakawa and   
              Sang June Lee and   
     Carlos Gustavo Moreira and   
              Vojtech Rödl   Infinite Sidon Sets Contained in Sparse
                                  Random Sets of Integers  . . . . . . . . 410--449
António Girão and   
                Kamil Popielarz   Large Induced Subgraphs with $k$
                                  Vertices of Almost Maximum Degree  . . . 450--454
              Miroslav Rada and   
            Michal Cerný   A New Algorithm for Enumeration of Cells
                                  of Hyperplane Arrangements and a
                                  Comparison with Avis and Fukuda's
                                  Reverse Search . . . . . . . . . . . . . 455--473
         William Y. C. Chen and   
                    Lisa H. Sun   Stanley's Lemma and Multiple Theta
                                  Functions  . . . . . . . . . . . . . . . 474--504
               Jianfeng Hou and   
                  Shufei Wu and   
               Qinghou Zeng and   
                    Wenxing Zhu   The Bollobás--Scott Conjecture for
                                  $4$-Uniform Hypergraphs  . . . . . . . . 505--521
               Hongliang Lu and   
                   Yan Wang and   
                    Xingxing Yu   Almost Perfect Matchings in $ k$-Partite
                                  $k$-Graphs . . . . . . . . . . . . . . . 522--533
              Louis Esperet and   
Rémi de Joannis de Verclos and   
                Tien-Nam Le and   
 Stéphan Thomassé   Additive Bases and Flows in Graphs . . . 534--542
      Stéphane Bessy and   
           Mitre C. Dourado and   
             Lucia D. Penso and   
              Dieter Rautenbach   The Geodetic Hull Number is Hard for
                                  Chordal Graphs . . . . . . . . . . . . . 543--547
                   He Huang and   
                Binzhou Xia and   
                   Sanming Zhou   Perfect Codes in Cayley Graphs . . . . . 548--559
Kristóf Bérczi and   
               Satoru Iwata and   
                   Jun Kato and   
               Yutaro Yamaguchi   Making Bipartite Graphs DM-Irreducible   560--590
               Megumi Asada and   
              Florian Frick and   
            Vivek Pisharody and   
             Maxwell Polevy and   
               David Stoner and   
             Ling Hei Tsang and   
                    Zoe Wellner   Fair Division and Generalizations of
                                  Sperner- and KKM-type Results  . . . . . 591--610
            Michael Krivelevich   Finding and Using Expanders in Locally
                                  Sparse Graphs  . . . . . . . . . . . . . 611--623
           Lucas Boczkowski and   
                Yuval Peres and   
                    Perla Sousi   Sensitivity of Mixing Times in Eulerian
                                  Digraphs . . . . . . . . . . . . . . . . 624--655
             Till Fluschnik and   
             Danny Hermelin and   
   André Nichterlein and   
               Rolf Niedermeier   Fractals for Kernelization Lower Bounds  656--681
              David Coudert and   
              Guillaume Ducoffe   Revisiting Decomposition by Clique
                                  Separators . . . . . . . . . . . . . . . 682--694
               Chris Dowden and   
                Mihyun Kang and   
          Philipp Sprüssel   The Evolution of Random Graphs on
                                  Surfaces . . . . . . . . . . . . . . . . 695--727
              Benoit Larose and   
                   Mark Siggers   NU Polymorphisms on Reflexive Digraphs   728--749
       Herbert Edelsbrunner and   
             Mabel Iglesias-Ham   On the Optimality of the FCC Lattice for
                                  Soft Sphere Packing  . . . . . . . . . . 750--782
                        Tri Lai   Lozenge Tilings of a Halved Hexagon with
                                  an Array of Triangles Removed from the
                                  Boundary . . . . . . . . . . . . . . . . 783--814

SIAM Journal on Discrete Mathematics
Volume 32, Number 2, 2018

                  Simon Macourt   Incidence Results and Bounds Of
                                  Trilinear and Quadrilinear Exponential
                                  Sums . . . . . . . . . . . . . . . . . . 815--825
             Hi\^\dep H\`an and   
        Vojt\uech Rödl and   
             Tibor Szabó   Vertex Folkman Numbers and the Minimum
                                  Degree of Minimal Ramsey Graphs  . . . . 826--838
            Vida Dujmovi\'c and   
         Gwenaël Joret and   
                  Pat Morin and   
               Sergey Norin and   
                  David R. Wood   Orthogonal Tree Decompositions of Graphs 839--863
      Dániel Gerbner and   
      Balázs Keszegh and   
Gábor Mészáros and   
Balázs Patkós and   
       Máté Vizer   Line Percolation in Finite Projective
                                  Planes . . . . . . . . . . . . . . . . . 864--881
         Geevarghese Philip and   
               Ashutosh Rai and   
                  Saket Saurabh   Generalized Pseudoforest Deletion:
                                  Algorithms and Uniform Kernel  . . . . . 882--901
            Laurent Beaudou and   
           Peter Dankelmann and   
            Florent Foucaud and   
         Michael A. Henning and   
                Arnaud Mary and   
                  Aline Parreau   Bounding the Order of a Graph Using Its
                                  Diameter and Metric Dimension: a Study
                                  Through Tree Decompositions and VC
                                  Dimension  . . . . . . . . . . . . . . . 902--918
                        Jie Han   On Perfect Matchings and Tilings in
                                  Uniform Hypergraphs  . . . . . . . . . . 919--932
            Beka Ergemlidze and   
           Ervin Györi and   
               Abhishek Methuku   $3$-Uniform Hypergraphs and Linear
                                  Cycles . . . . . . . . . . . . . . . . . 933--950
           Maria Chudnovsky and   
                Vaidy Sivaraman   Odd Holes in Bull-Free Graphs  . . . . . 951--955
                 Jian Cheng and   
                     You Lu and   
                   Rong Luo and   
                 Cun-Quan Zhang   Signed Graphs: From Modulo Flows to
                                  Integer-Valued Flows . . . . . . . . . . 956--965
             Fedor V. Fomin and   
          Daniel Lokshtanov and   
               S. M. Meesum and   
              Saket Saurabh and   
                  Meirav Zehavi   Matrix Rigidity from the Viewpoint of
                                  Parameterized Complexity . . . . . . . . 966--985
               Danny Nguyen and   
                       Igor Pak   Enumerating Projections of Integer
                                  Points in Unbounded Polyhedra  . . . . . 986--1002
                Sean Cleary and   
                    Roland Maio   Edge Conflicts do not Determine
                                  Geodesics in the Associahedron . . . . . 1003--1015
  Zoltán Füredi and   
                     Ida Kantor   Kneser Ranks of Random Graphs and
                                  Minimum Difference Representations . . . 1016--1028
          Samantha Dahlberg and   
     Stephanie van Willigenburg   Lollipop and Lariat Symmetric Functions  1029--1039
                David Jekel and   
                   Avi Levy and   
                  Will Dana and   
             Austin Stromme and   
               Collin Litterell   Algebraic Properties of Generalized
                                  Graph Laplacians: Resistor Networks,
                                  Critical Groups, and Homological Algebra 1040--1110
           Maria Chudnovsky and   
                   Juraj Stacho   $3$-Colorable Subclasses of $ P_8$-Free
                                  Graphs . . . . . . . . . . . . . . . . . 1111--1138
               Donald K. Wagner   A Characterization of Graphic Matroids
                                  Based on Circuit Orderings . . . . . . . 1139--1144
               Peter Nelson and   
               Jorn van der Pol   Doubly Exponentially Many Ingleton
                                  Matroids . . . . . . . . . . . . . . . . 1145--1153
                   Allan Lo and   
                        Yi Zhao   Codegree Turán Density of Complete
                                  $r$-Uniform Hypergraphs  . . . . . . . . 1154--1158
                         Pu Gao   The Stripping Process Can be Slow: Part
                                  II . . . . . . . . . . . . . . . . . . . 1159--1188
            Pradeesha Ashok and   
               Aditi Dudeja and   
             Sudeshna Kolay and   
                  Saket Saurabh   Exact and Fixed Parameter Tractable
                                  Algorithms for Max-Conflict-Free
                                  Coloring in Hypergraphs  . . . . . . . . 1189--1208
                Ilkyoo Choi and   
              Chun-Hung Liu and   
                    Sang-il Oum   Characterization of Cycle Obstruction
                                  Sets for Improper Coloring Planar Graphs 1209--1228
                     Bo Lin and   
                 Ruriko Yoshida   Tropical Fermat--Weber Points  . . . . . 1229--1245
              Henning Bruhn and   
          Matthias Heinlein and   
                     Felix Joos   Frames, $A$-Paths, and the Erd\Hos--Pósa
                                  Property . . . . . . . . . . . . . . . . 1246--1260
   Dániel Korándi   Rainbow Saturation and Graph Capacities  1261--1264
 Karthekeyan Chandrasekaran and   
           Mahdi Cheraghchi and   
          Venkata Gandikota and   
               Elena Grigorescu   Local Testing of Lattices  . . . . . . . 1265--1295
            Mehtaab Sawhney and   
                   David Stoner   On Symmetric But Not Cyclotomic
                                  Numerical Semigroups . . . . . . . . . . 1296--1304
                    Xiaofeng Gu   Spanning Rigid Subgraph Packing and
                                  Sparse Subgraph Covering . . . . . . . . 1305--1313
           Tobias Friedrich and   
                  Anton Krohmer   On the Diameter of Hyperbolic Random
                                  Graphs . . . . . . . . . . . . . . . . . 1314--1334
Konstanty Junosza-Szaniawski and   
         Pawe\l Rz\kazewski and   
       Joanna Sokó\l and   
              Krzysztof W\kesek   Online Coloring and $ L(2, 1) $-Labeling
                                  of Unit Disk Intersection Graphs . . . . 1335--1350
               J. Chappelon and   
L. Martínez-Sandoval and   
               L. Montejano and   
            L. P. Montejano and   
J. L. Ramírez Alfonsín   Codimension Two and Three Kneser
                                  Transversals . . . . . . . . . . . . . . 1351--1363
             Hi\^\dep H\`an and   
          Andrea Jiménez   Improved Bound on the Maximum Number of
                                  Clique-Free Colorings with Two and Three
                                  Colors . . . . . . . . . . . . . . . . . 1364--1368
             Andreas Alpers and   
                Peter Gritzmann   On Double-Resolution Imaging and
                                  Discrete Tomography  . . . . . . . . . . 1369--1399
                  Kevin Hendrey   Sparse Graphs of High Gonality . . . . . 1400--1407
               D. P. Bourne and   
                 D. Cushing and   
                     S. Liu and   
              F. Münch and   
                 N. Peyerimhoff   Ollivier--Ricci Idleness Functions of
                                  Graphs . . . . . . . . . . . . . . . . . 1408--1424
            Petr Hlinený   A Simpler Self-reduction Algorithm for
                                  Matroid Path-Width . . . . . . . . . . . 1425--1440
Anne-Maria Ernvall-Hytönen and   
              Esa V. Vesalainen   On the Secrecy Gain of $ \ell $-Modular
                                  Lattices . . . . . . . . . . . . . . . . 1441--1457
       Eden Chlamtác and   
             Michael Dinitz and   
           Christian Konrad and   
               Guy Kortsarz and   
                 George Rabanca   The Densest $k$-Subhypergraph Problem    1458--1477
 Cláudio L. Lucchesi and   
     Marcelo H. de Carvalho and   
             Nishad Kothari and   
                 U. S. R. Murty   On Two Unsolved Problems Concerning
                                  Matching Covered Graphs  . . . . . . . . 1478--1504
            Michael Anastos and   
                  Joseph Briggs   Packing Directed Hamilton Cycles Online  1505--1539

SIAM Journal on Discrete Mathematics
Volume 32, Number 3, 2018

               Nicole Megow and   
           José Verschae   Dual Techniques for Scheduling on a
                                  Machine with Varying Speed . . . . . . . 1541--1571
                 Isabella Novik   From Acute Sets to Centrally Symmetric
                                  $2$-Neighborly Polytopes . . . . . . . . 1572--1576
              Peter Keevash and   
                Liana Yepremyan   Rainbow Matchings in Properly Colored
                                  Multigraphs  . . . . . . . . . . . . . . 1577--1584
                 Lisa Espig and   
                Alan Frieze and   
            Michael Krivelevich   Elegantly Colored Paths and Cycles in
                                  Edge Colored Random Graphs . . . . . . . 1585--1618
           Akanksha Agrawal and   
          Daniel Lokshtanov and   
        Diptapriyo Majumdar and   
            Amer E. Mouawad and   
                  Saket Saurabh   Kernelization of Cycle Packing with
                                  Relaxed Disjointness Constraints . . . . 1619--1643
                  Hoang Dau and   
              Olgica Milenkovic   MaxMinSum Steiner Systems for Access
                                  Balancing in Distributed Storage . . . . 1644--1671
             Lukasz Kowalik and   
                 Juho Lauri and   
              Arkadiusz Soca\la   On the Fine-Grained Complexity of
                                  Rainbow Coloring . . . . . . . . . . . . 1672--1705
          Christoph Glanzer and   
          Robert Weismantel and   
                 Rico Zenklusen   On the Number of Distinct Rows of a
                                  Matrix with Bounded Subdeterminants  . . 1706--1720
                  V. Arvind and   
        Partha Mukhopadhyay and   
        Prajakta Nimbhorkar and   
                   Yadu Vasudev   Expanding Generating Sets for Solvable
                                  Permutation Groups . . . . . . . . . . . 1721--1740
              Gaetan Bisson and   
                 Mehdi Tibouchi   Constructing Permutation Rational
                                  Functions from Isogenies . . . . . . . . 1741--1749
                 Ahmad Abdi and   
         Kanstantsin Pashkovich   Delta Minors, Delta Free Clutters, and
                                  Entanglement . . . . . . . . . . . . . . 1750--1774
       Zdenek Dvorák and   
         Bernard Lidický   Fine Structure of $4$-Critical
                                  Triangle-Free Graphs I. Planar Graphs
                                  with Two Triangles and $3$-Colorability
                                  of Chains  . . . . . . . . . . . . . . . 1775--1805
                 Stefan Kratsch   A Randomized Polynomial Kernelization
                                  for Vertex Cover with a Smaller
                                  Parameter  . . . . . . . . . . . . . . . 1806--1839
María A. Hernández Cifre and   
             David Iglesias and   
Jesús Yepes Nicolás   On a Discrete Brunn--Minkowski Type
                                  Inequality . . . . . . . . . . . . . . . 1840--1856
              Manuel Aprile and   
           Alfonso Cevallos and   
                    Yuri Faenza   On $2$-Level Polytopes Arising in
                                  Combinatorial Settings . . . . . . . . . 1857--1886
          Harry H. Y. Huang and   
               Larry X. W. Wang   The Corners of Core Partitions . . . . . 1887--1902
          Reuven Bar-Yehuda and   
                Erez Kantor and   
                Shay Kutten and   
                    Dror Rawitz   Growing Half-Balls: Minimizing Storage
                                  and Communication Costs in Content
                                  Delivery Networks  . . . . . . . . . . . 1903--1921
           Maximilien Gadouleau   Finite Dynamical Systems, Hat Games, and
                                  Coding Theory  . . . . . . . . . . . . . 1922--1945
               Yanping Wang and   
               Weiguo Zhang and   
                  Zhengbang Zha   Six New Classes of Permutation
                                  Trinomials over $ \mathbb {F}_{2^n} $    1946--1961
        Petr Hlinený and   
              Carsten Thomassen   Deciding Parity of Graph Crossing Number 1962--1965
               Sarah Cannon and   
              Sarah Miracle and   
                   Dana Randall   Phase Transitions in Random Dyadic
                                  Tilings and Rectangular Dissections  . . 1966--1992
                   Bao-Xuan Zhu   Positivity of Iterated Sequences of
                                  Polynomials  . . . . . . . . . . . . . . 1993--2010
Guillermo Pineda-Villavicencio and   
                Julien Ugon and   
                     David Yost   The Excess Degree of a Polytope  . . . . 2011--2046
             Leo van Iersel and   
                Vincent Moulton   Leaf-Reconstructibility of Phylogenetic
                                  Networks . . . . . . . . . . . . . . . . 2047--2066
               Antoine Deza and   
                 Asaf Levin and   
             Syed M. Meesum and   
                     Shmuel Onn   Optimization over Degree Sequences . . . 2067--2079
           Carlos A. Alfaro and   
                Alan Arroyo and   
        Marek Dernár and   
                    Bojan Mohar   The Crossing Number of the Cone of a
                                  Graph  . . . . . . . . . . . . . . . . . 2080--2093
       Barbora Duník and   
                 Robert Lukotka   Cubic TSP: a 1.3-Approximation . . . . . 2094--2114
                Alan Frieze and   
              Wesley Pegden and   
              Gregory B. Sorkin   The Distribution of Minimum-Weight
                                  Cliques and Other Subgraphs in Graphs
                                  with Random Edge Weights . . . . . . . . 2115--2133
            Chandra Chekuri and   
                  Alina Ene and   
               Marcin Pilipczuk   Constant Congestion Routing of Symmetric
                                  Demands in Planar Directed Graphs  . . . 2134--2160
                 Sihuang Hu and   
             Nir Weinberger and   
                 Ofer Shayevitz   On the VC-Dimension of Binary Codes  . . 2161--2171
                 Linyuan Lu and   
                     Zhiyu Wang   On the Size-Ramsey Number of Tight Paths 2172--2179
           Takeharu Shiraga and   
            Yukiko Yamauchi and   
               Shuji Kijima and   
             Masafumi Yamashita   Deterministic Random Walks for Rapidly
                                  Mixing Chains  . . . . . . . . . . . . . 2180--2193
                Michael Anastos   Connectivity of the $k$-Out Hypercube    2194--2216
               Ramin Javadi and   
               Gholamreza Omidi   On a Question of Erd\Hos and Faudree on
                                  the Size Ramsey Numbers  . . . . . . . . 2217--2228
                 Sihuang Hu and   
                Itzhak Tamo and   
                 Ofer Shayevitz   A Bound on the Shannon Capacity via a
                                  Linear Programming Variation . . . . . . 2229--2241
            Arseniy Akopyan and   
              Erel Segal-Halevi   Counting Blanks in Polygonal
                                  Arrangements . . . . . . . . . . . . . . 2242--2257
          Bart M. P. Jansen and   
               Marcin Pilipczuk   Approximation and Kernelization for
                                  Chordal Vertex Deletion  . . . . . . . . 2258--2301
            Pierre Aboulker and   
             Samuel Fiorini and   
                 Tony Huynh and   
         Gwenaël Joret and   
       Jean-Florent Raymond and   
                     Ignasi Sau   A Tight Erd\Hos--Pósa Function for Wheel
                                  Minors . . . . . . . . . . . . . . . . . 2302--2312
            Catherine Erbes and   
            Michael Ferrara and   
             Ryan R. Martin and   
                    Paul Wenger   Stability of the Potential Function  . . 2313--2331
          Daniel Lokshtanov and   
          Micha\l Pilipczuk and   
                  Saket Saurabh   Below All Subsets for Minimal Connected
                                  Dominating Set . . . . . . . . . . . . . 2332--2345
              Tim E. Wilson and   
                  David R. Wood   Anagram-Free Colorings of Graph
                                  Subdivisions . . . . . . . . . . . . . . 2346--2360
             Adam Mammoliti and   
                   Thomas Britz   On Mubayi's Conjecture and Conditionally
                                  Intersecting Sets  . . . . . . . . . . . 2361--2380

SIAM Journal on Discrete Mathematics
Volume 32, Number 4, 2018

           Michaël Rao and   
             Matthieu Rosenfeld   Avoiding Two Consecutive Blocks of Same
                                  Size and Same Sum over $ \mathbb {Z}^2 $ 2381--2397
               Colin Cooper and   
                Martin Dyer and   
                Alan Frieze and   
          Nicolás Rivera   Discordant Voting Processes on Finite
                                  Graphs . . . . . . . . . . . . . . . . . 2398--2420
           Edgardo Riquelme and   
       Nicolas Thériault   Symbolic Trisection Polynomials for
                                  Genus $2$ Curves in Odd Characteristic   2421--2440
           Tobias Friedrich and   
        Maximilian Katzmann and   
                  Anton Krohmer   Unbounded Discrepancy of Deterministic
                                  Random Walks on Grids  . . . . . . . . . 2441--2452
      Sándor Z. Kiss and   
        Csaba Sándor and   
                  Quan-Hui Yang   On a Conjecture of Erd\Hos about Sets
                                  without $k$ Pairwise Coprime Integers    2453--2466
               Martin Grohe and   
           Stephan Kreutzer and   
           Roman Rabinovich and   
         Sebastian Siebertz and   
      Konstantinos Stavropoulos   Coloring and Covering Nowhere Dense
                                  Graphs . . . . . . . . . . . . . . . . . 2467--2481
  Bernardo M. Ábrego and   
           Oswin Aichholzer and   
Silvia Fernández-Merchant and   
              Dan McQuillan and   
                Bojan Mohar and   
               Petra Mutzel and   
                Pedro Ramos and   
           R. Bruce Richter and   
             Birgit Vogtenhuber   Bishellable drawings of $ K_n $  . . . . 2482--2492
                     Ben Krause   Dimension-Free $ L^p $-Maximal
                                  Inequalities for Spherical Means in the
                                  Hypercube  . . . . . . . . . . . . . . . 2493--2511
             Fedor V. Fomin and   
           Petr A. Golovach and   
          Daniel Lokshtanov and   
                  Saket Saurabh   Covering Vectors by Spaces: Regular
                                  Matroids . . . . . . . . . . . . . . . . 2512--2565
              Man-Kwun Chiu and   
                  Matias Korman   High Dimensional Consistent Digital
                                  Segments . . . . . . . . . . . . . . . . 2566--2590
              Anthony Nixon and   
              Bernd Schulze and   
         Shin-ichi Tanigawa and   
                Walter Whiteley   Rigidity of Frameworks on Expanding
                                  Spheres  . . . . . . . . . . . . . . . . 2591--2611
             Fedor V. Fomin and   
           Petr A. Golovach and   
          Dimitrios M. Thilikos   Structured Connectivity Augmentation . . 2612--2635
                  Hannah Cairns   Some Halting Problems for Abelian
                                  Sandpiles Are Undecidable in Dimension
                                  Three  . . . . . . . . . . . . . . . . . 2636--2666
            Alexander Sidorenko   Extremal Problems on the Hypercube and
                                  the Codegree Turán Density of Complete
                                  $r$-Graphs . . . . . . . . . . . . . . . 2667--2674
               Zachary Abel and   
             Victor Alvarez and   
            Erik D. Demaine and   
    Sándor P. Fekete and   
                  Aman Gour and   
            Adam Hesterberg and   
          Phillip Keldenich and   
             Christian Scheffer   Conflict-Free Coloring of Graphs . . . . 2675--2702
          Stephane Durocher and   
               Debajyoti Mondal   Relating Graph Thickness to Planar
                                  Layers and Bend Complexity . . . . . . . 2703--2719
             Anna Adamaszek and   
               Artur Czumaj and   
             Andrzej Lingas and   
       Jakub Onufry Wojtaszczyk   Approximation Schemes for Capacitated
                                  Geometric Network Design . . . . . . . . 2720--2746
                 Jerome Galtier   Computing Weighted Strength and
                                  Applications to Partitioning . . . . . . 2747--2782
                Kenta Ozeki and   
            Carol T. Zamfirescu   Every $4$-Connected Graph with Crossing
                                  Number $2$ is Hamiltonian  . . . . . . . 2783--2794
            Mathilde Bouvel and   
          Veronica Guerrini and   
          Andrew Rechnitzer and   
                 Simone Rinaldi   Semi-Baxter and Strong-Baxter: Two
                                  Relatives of the Baxter Sequence . . . . 2795--2819
         George B. Mertzios and   
   André Nichterlein and   
               Rolf Niedermeier   A Linear-Time Algorithm for
                                  Maximum-Cardinality Matching on
                                  Cocomparability Graphs . . . . . . . . . 2820--2835
                   Ben Lund and   
            Shubhangi Saraf and   
                   Charles Wolf   Finite Field Kakeya and Nikodym Sets in
                                  Three Dimensions . . . . . . . . . . . . 2836--2849
                  I. Terada and   
                 R. C. King and   
                     O. Azenhas   The Symmetry of Littlewood--Richardson
                                  Coefficients: a New Hive Model
                                  Involutory Bijection . . . . . . . . . . 2850--2899
               Changhong Lu and   
                     Ping Zhang   $ K_5^- $-Subdivision in $4$-Connected
                                  Graphs . . . . . . . . . . . . . . . . . 2900--2915
           Andrey Kupavskii and   
              Maksim Zhukovskii   Short Monadic Second Order Sentences
                                  about Sparse Random Graphs . . . . . . . 2916--2940
             Laura Florescu and   
                Yuval Peres and   
   Miklós Z. Rácz   Optimal Control for Diffusions on Graphs 2941--2972
             Badria Alsulmi and   
              Todd Cochrane and   
     Michael J. Mossinghoff and   
              Vincent Pigno and   
               Chris Pinner and   
           C. J. Richardson and   
                   Ian Thompson   A Generalization of the Goresky--Klapper
                                  Conjecture, Part I . . . . . . . . . . . 2973--3002
            Vida Dujmovi\'c and   
         Gwenaël Joret and   
                  Pat Morin and   
               Sergey Norin and   
                  David R. Wood   Corrigendum: Orthogonal Tree
                                  Decompositions of Graphs . . . . . . . . 3003--3004


SIAM Journal on Discrete Mathematics
Volume 33, Number 1, 2019

                 Sean Kafer and   
     Kanstantsin Pashkovich and   
                 Laura Sanit\`a   On the Circuit Diameter of Some
                                  Combinatorial Polytopes  . . . . . . . . 1--25
                Kevin Grace and   
          Stefan H. M. van Zwam   The Highly Connected Even-Cycle and
                                  Even-Cut Matroids  . . . . . . . . . . . 26--67
                 Robert Hancock   The Maker--Breaker Rado Game on a Random
                                  Set of Integers  . . . . . . . . . . . . 68--94
          Thomas Kalinowski and   
                Nina Kamcev and   
                  Benny Sudakov   The Zero Forcing Number of Graphs  . . . 95--115
            Stephen Alstrup and   
                Haim Kaplan and   
              Mikkel Thorup and   
                      Uri Zwick   Adjacency Labeling Schemes and
                                  Induced-Universal Graphs . . . . . . . . 116--137
                    James Oxley   A Matroid Extension Result . . . . . . . 138--152
             Robert Hancock and   
           Katherine Staden and   
                Andrew Treglown   Independent Sets in Hypergraphs and
                                  Ramsey Properties of Graphs and the
                                  Integers . . . . . . . . . . . . . . . . 153--188
             Neil J. Y. Fan and   
               Peter L. Guo and   
               Sophie C. C. Sun   Proof of a Conjecture of
                                  Reiner--Tenner--Yong on Barely
                                  Set-Valued Tableaux  . . . . . . . . . . 189--196
                     G. O. Mota   Three-Color Bipartite Ramsey Number for
                                  Graphs with Small Bandwidth  . . . . . . 197--208
             Yeow Meng Chee and   
                    Fei Gao and   
               Han Mao Kiah and   
         Alan Chi Hung Ling and   
                  Hui Zhang and   
                   Xiande Zhang   Decompositions of Edge-Colored Digraphs:
                                  a New Technique in the Construction of
                                  Constant-Weight Codes and Related
                                  Families . . . . . . . . . . . . . . . . 209--229
                  Hao Huang and   
                         Jie Ma   On Tight Cycles in Hypergraphs . . . . . 230--237
                  Deng Tang and   
        Selçuk Kavut and   
               Bimal Mandal and   
                Subhamoy Maitra   Modifying Maiorana--McFarland Type Bent
                                  Functions for Good Cryptographic
                                  Properties and Efficient Implementation  238--256
                Shiping Liu and   
       Florentin Münch and   
            Norbert Peyerimhoff   Curvature and Higher Order Buser
                                  Inequalities for the Graph Connection
                                  Laplacian  . . . . . . . . . . . . . . . 257--305
            Carolina Medina and   
Jorge Ramírez-Alfonsín and   
                Gelasio Salazar   On the Number of Unknot Diagrams . . . . 306--326
             Fedor V. Fomin and   
              Petteri Kaski and   
          Daniel Lokshtanov and   
              Fahad Panolan and   
                  Saket Saurabh   Parameterized Single-Exponential Time
                                  Polynomial Space Algorithm for Steiner
                                  Tree . . . . . . . . . . . . . . . . . . 327--345
          Daniel Weißauer   On the Block Number of Graphs  . . . . . 346--357
              Nick Brettell and   
            Rutger Campbell and   
               Deborah Chun and   
                Kevin Grace and   
                  Geoff Whittle   On a Generalization of Spikes  . . . . . 358--372
               Peter Nelson and   
               Jorn van der Pol   On the Number of Biased Graphs . . . . . 373--382
András Gyárfás   The Turán Number of Berge $ K_4 $ in
                                  Triple Systems . . . . . . . . . . . . . 383--392
               Guantao Chen and   
                  Xing Feng and   
                 Fuliang Lu and   
                  Lianzhu Zhang   Disjoint Odd Cycles in Cubic Solid
                                  Bricks . . . . . . . . . . . . . . . . . 393--397
              Nathan Keller and   
                  Noam Lifshitz   A Note on Large $H$-Intersecting
                                  Families . . . . . . . . . . . . . . . . 398--401
                    Ishay Haviv   Sum-Free Sets of Integers with a
                                  Forbidden Sum  . . . . . . . . . . . . . 402--424
            Giacomo Micheli and   
                 Violetta Weger   On Rectangular Unimodular Matrices over
                                  the Algebraic Integers . . . . . . . . . 425--437
              Carlos Hoppen and   
         Roberto F. Parente and   
              Cristiane M. Sato   Packing Arborescences in Random Digraphs 438--453
    Anastasios Sidiropoulos and   
               Mihai Badoiu and   
            Kedar Dhamdhere and   
               Anupam Gupta and   
                Piotr Indyk and   
            Yuri Rabinovich and   
               Harald Racke and   
                        R. Ravi   Approximation Algorithms for
                                  Low-Distortion Embeddings into
                                  Low-Dimensional Spaces . . . . . . . . . 454--473
          Béla Csaba and   
         Judit Nagy-György   Embedding Graphs Having Ore-Degree at
                                  Most Five  . . . . . . . . . . . . . . . 474--508
                 Roee David and   
              Karthik C. S. and   
             Bundit Laekhanukit   On the Complexity of Closest Pair via
                                  Polar-Pair of Point-Sets . . . . . . . . 509--527
            Michael Anastos and   
                    Alan Frieze   Pattern Colored Hamilton Cycles in
                                  Random Graphs  . . . . . . . . . . . . . 528--545
                David G. Harris   Some Results on Chromatic Number as a
                                  Function of Triangle Count . . . . . . . 546--563
                Jaehoon Kim and   
                Younjin Kim and   
                       Hong Liu   Two Conjectures in Ramsey--Turán Theory   564--586

SIAM Journal on Discrete Mathematics
Volume 33, Number 2, 2019

              Alessio Conte and   
             Roberto Grossi and   
              Andrea Marino and   
                   Luca Versari   Listing Maximal Subgraphs Satisfying
                                  Strongly Accessible Properties . . . . . 587--613
             Daniel W. Cranston   Acyclic Edge-Coloring of Planar Graphs:
                                  $ \Delta $ Colors Suffice When $ \Delta
                                  $ is Large . . . . . . . . . . . . . . . 614--628
                  Noga Alon and   
                  Nadav Sherman   Induced Universal Hypergraphs  . . . . . 629--642
           Václav Rozhon   A Local Approach to the Erd\Hos--Sós
                                  Conjecture . . . . . . . . . . . . . . . 643--664
             Nir Weinberger and   
                 Ofer Shayevitz   Self-Predicting Boolean Functions  . . . 665--693
                  Zihan Tan and   
                     Liwei Zeng   On the Inequalities of Projected Volumes
                                  and the Constructible Region . . . . . . 694--711
           Mahya Ghandehari and   
              Jeannette Janssen   An Optimization Parameter for Seriation
                                  of Noisy Data  . . . . . . . . . . . . . 712--730
                Yury Polyanskiy   Hypercontractivity of Spherical Averages
                                  in Hamming Space . . . . . . . . . . . . 731--754
               Amitabh Basu and   
             Santanu S. Dey and   
                    Joseph Paat   Nonunique Lifting of Integer Variables
                                  in Minimal Inequalities  . . . . . . . . 755--783
                 Boris Bukh and   
                   Xavier Goaoc   Shatter Functions with Polynomial Growth
                                  Rates  . . . . . . . . . . . . . . . . . 784--794
             Fedor V. Fomin and   
              Petr Golovach and   
              Fahad Panolan and   
                  Saket Saurabh   Editing to Connected $F$-Degree Graph    795--836
              Tomasz Schoen and   
               Ilya D. Shkredov   An Upper Bound for Weak $ B_k $-Sets . . 837--844
              Therese Biedl and   
               Ahmad Biniaz and   
            Robert Cummings and   
                 Anna Lubiw and   
               Florin Manea and   
               Dirk Nowotka and   
                Jeffrey Shallit   Rollercoasters: Long Sequences without
                                  Short Runs . . . . . . . . . . . . . . . 845--861
  Zoltán Füredi and   
                  Tao Jiang and   
         Alexandr Kostochka and   
               Dhruv Mubayi and   
        Jacques Verstraëte   Hypergraphs Not Containing a Tight Tree
                                  with a Bounded Trunk . . . . . . . . . . 862--873
                T. Karthick and   
 Frédéric Maffray   Square-Free Graphs with No Six-Vertex
                                  Induced Path . . . . . . . . . . . . . . 874--909
                   Hunter Spink   Orthogonal Symmetric Chain
                                  Decompositions of Hypercubes . . . . . . 910--932
Edita Mácajová and   
       Edita Rollová and   
                Martin Skoviera   Circuit Covers of Signed Eulerian Graphs 933--957
                      Paul Horn   A Spacial Gradient Estimate for
                                  Solutions to the Heat Equation on Graphs 958--975
              Janko Gravner and   
               J. E. Paguyo and   
                   Erik Slivken   Maximal Spanning Time for Neighborhood
                                  Growth on the Hamming Plane  . . . . . . 976--993
             Mikhail Lavrov and   
                Po-Shen Loh and   
          Arnau Messegué   Distance-Uniform Graphs with Large
                                  Diameter . . . . . . . . . . . . . . . . 994--1005
                Jacob Focke and   
        Leslie Ann Goldberg and   
         Stanislav Zivný   The Complexity of Counting Surjective
                                  Homomorphisms and Compactions  . . . . . 1006--1043
                Abdul Basit and   
                       Ben Lund   An Improved Sum-Product Bound for
                                  Quaternions  . . . . . . . . . . . . . . 1044--1060
                Matthias Walter   Complete Description of Matching
                                  Polytopes with One Linearized Quadratic
                                  Term for Bipartite Graphs  . . . . . . . 1061--1094
              Serge Gaspers and   
                  Shenwei Huang   $ (2 P_2, K_4) $-Free Graphs are
                                  $4$-Colorable  . . . . . . . . . . . . . 1095--1120

SIAM Journal on Discrete Mathematics
Volume 33, Number 3, 2019

             Yasushi Kawase and   
               Hanna Sumita and   
                Takuro Fukunaga   Submodular Maximization with Uncertain
                                  Knapsack Capacity  . . . . . . . . . . . 1121--1145
                Martin Dyer and   
                   Haiko Muller   Counting Perfect Matchings and the
                                  Switch Chain . . . . . . . . . . . . . . 1146--1174
               Martin Babka and   
         Jan Bulánek and   
      Vladim'r Cunát and   
       Michal Koucký and   
                Michael E. Saks   On Online Labeling with Large Label Set  1175--1193
          Daniel Lokshtanov and   
            Amer E. Mouawad and   
              Saket Saurabh and   
                  Meirav Zehavi   Packing Cycles Faster Than Erd\Hos--Posa 1194--1215
              Andrzej Dudek and   
               Sean English and   
                 Alan M. Frieze   A Random Variant of the Game of Plates
                                  and Olives . . . . . . . . . . . . . . . 1216--1227
         Daniel W. Cranston and   
                  Landon Rabern   The Hilton--Zhao Conjecture is True for
                                  Graphs with Maximum Degree $4$ . . . . . 1228--1241
               Eimear Byrne and   
              Alberto Ravagnani   An Assmus--Mattson Theorem for Rank
                                  Metric Codes . . . . . . . . . . . . . . 1242--1260
       József Balogh and   
     Bernard Lidický and   
                Gelasio Salazar   Closing in on Hill's Conjecture  . . . . 1261--1276
             Syed M. Meesum and   
              Fahad Panolan and   
              Saket Saurabh and   
                  Meirav Zehavi   Rank Vertex Cover as a Natural Problem
                                  for Algebraic Compression  . . . . . . . 1277--1296
                   Wei Dong and   
                     Baogang Xu   $2$-Distance Coloring of Planar Graphs
                                  without $4$-Cycles and $5$-Cycles  . . . 1297--1312
          Stephen D. Miller and   
       Noah Stephens-Davidowitz   Kissing Numbers and Transference
                                  Theorems from Generalized Tail Bounds    1313--1325
               Shiliang Gao and   
                   Shira Zerbib   The $ (2, 2) $ and $ (4, 3) $ Properties
                                  in Families of Fat Sets in the Plane . . 1326--1337
              Naman Agarwal and   
 Karthekeyan Chandrasekaran and   
            Alexandra Kolla and   
                    Vivek Madan   On the Expansion of Group-Based Lifts    1338--1373
               Colin Cooper and   
             Alan M. Frieze and   
                  Wesley Pegden   On the Cover Time of Dense Graphs  . . . 1374--1389
          Atsuhiro Nakamoto and   
              Kenta Noguchi and   
                    Kenta Ozeki   Extension to $3$-Colorable
                                  Triangulations . . . . . . . . . . . . . 1390--1414
                John Gimbel and   
  André Kündgen and   
                 Binlong Li and   
              Carsten Thomassen   Fractional Coloring Methods with
                                  Applications to Degenerate Graphs and
                                  Graphs on Surfaces . . . . . . . . . . . 1415--1430
               Naoyuki Kamiyama   Pareto Stable Matchings under One-Sided
                                  Matroid Constraints  . . . . . . . . . . 1431--1451
                 Yuichi Yoshida   Maximizing a Monotone Submodular
                                  Function with a Bounded Curvature under
                                  a Knapsack Constraint  . . . . . . . . . 1452--1471
                 Zhiyang He and   
                   Michael Tait   Hypergraphs with Few Berge Paths of
                                  Fixed Length between Vertices  . . . . . 1472--1481
                   Guangyue Han   On Mergings in Acyclic Directed Graphs   1482--1502
             Louis DeBiasio and   
                       Allan Lo   Spanning Trees with Few Branch Vertices  1503--1520
               Guido Besomi and   
Matías Pavez-Signé and   
                     Maya Stein   Degree Conditions for Embedding Trees    1521--1555
                Steven Kelk and   
                    Simone Linz   A Tight Kernel for Computing the Tree
                                  Bisection and Reconnection Distance
                                  between Two Phylogenetic Trees . . . . . 1556--1574
                 Peter Ayre and   
            Catherine Greenhill   Rigid Colorings of Hypergraphs and
                                  Contiguity . . . . . . . . . . . . . . . 1575--1606
            Aaron Bernstein and   
           Karl Däubel and   
                Yann Disser and   
                  Max Klimm and   
         Torsten Mütze and   
                 Frieder Smolny   Distance-Preserving Graph Contractions   1607--1636
        João Gouveia and   
            Antonio Macchia and   
            Rekha R. Thomas and   
                      Amy Wiebe   The Slack Realization Space of a
                                  Polytope . . . . . . . . . . . . . . . . 1637--1653
                Joshua Erde and   
          Daniel Weißauer   A Short Derivation of the Structure
                                  Theorem for Graphs with Excluded
                                  Topological Minors . . . . . . . . . . . 1654--1661
        Gérard Cohen and   
           Emanuela Fachini and   
       János Körner   Interlocked Permutations . . . . . . . . 1662--1668
  Domingos Dellamonica, Jr. and   
              Vojtech Rödl   Packing Paths in Steiner Triple Systems  1669--1690
István Kovács and   
          Daniel Soltész   On $k$-Neighbor Separated Permutations   1691--1711
                       Yu Yokoi   Matroidal Choice Functions . . . . . . . 1712--1724
        Daniel I. Bernstein and   
                   Robert Krone   The Tropical Cayley--Menger Variety  . . 1725--1742
               Eduard Eiben and   
            Mithilesh Kumar and   
            Amer E. Mouawad and   
              Fahad Panolan and   
             Sebastian Siebertz   Lossy Kernels for Connected Dominating
                                  Set on Sparse Graphs . . . . . . . . . . 1743--1771
               Gweneth McKinley   Superlogarithmic Cliques in Dense
                                  Inhomogeneous Random Graphs  . . . . . . 1772--1800

SIAM Journal on Discrete Mathematics
Volume 33, Number 4, 2019

                Kenta Ozeki and   
          Atsuhiro Nakamoto and   
                Takayuki Nozawa   Book Embedding of Graphs on the
                                  Projective Plane . . . . . . . . . . . . 1801--1836
 Alberto Espuny Díaz and   
                 Felix Joos and   
          Daniela Kühn and   
                   Deryk Osthus   Edge Correlations in Random Regular
                                  Hypergraphs and Applications to Subgraph
                                  Testing  . . . . . . . . . . . . . . . . 1837--1863
                        Thao Do   Representation Complexities of
                                  Semialgebraic Graphs . . . . . . . . . . 1864--1877
          Daniel Lokshtanov and   
              Saket Saurabh and   
             Roohani Sharma and   
                  Meirav Zehavi   Balanced Judicious Bipartition is
                                  Fixed-Parameter Tractable  . . . . . . . 1878--1911
                Roy Oursler and   
              Andrzej Czygrinow   Tight Minimum Degree Condition for the
                                  Existence of Loose Cycle Tilings in
                                  $3$-Graphs . . . . . . . . . . . . . . . 1912--1931
               Tobias Harks and   
               Anja Schedel and   
                   Manuel Surek   A Characterization of Undirected Graphs
                                  Admitting Optimal Cost Shares  . . . . . 1932--1996
               Guantao Chen and   
                  Songling Shan   Dirac's Condition for Spanning Halin
                                  Subgraphs  . . . . . . . . . . . . . . . 1997--2022
 Lucas de Oliveira Contiero and   
              Carlos Hoppen and   
              Hanno Lefmann and   
                  Knut Odermann   Stability Results for Two Classes of
                                  Hypergraphs  . . . . . . . . . . . . . . 2023--2040
                Joseph Hyde and   
                   Hong Liu and   
                Andrew Treglown   A Degree Sequence Komlós Theorem  . . . . 2041--2061
               Klaus Jansen and   
               Kim-Manuel Klein   A Robust AFPTAS for Online Bin Packing
                                  with Polynomial Migration  . . . . . . . 2062--2091
            Benjamin Burton and   
             Sergio Cabello and   
             Stefan Kratsch and   
             William Pettersson   The Parameterized Complexity of Finding
                                  a $2$-Sphere in a Simplicial Complex . . 2092--2110
           Elena Grigorescu and   
                Akash Kumar and   
                    Karl Wimmer   Flipping Out with Many Flips: Hardness
                                  of Testing $k$-Monotonicity  . . . . . . 2111--2125
                   Sam Mattheus   Trace of Products in Finite Fields from
                                  a Combinatorial Point of View  . . . . . 2126--2139
            Stephen Melczer and   
                 Mark C. Wilson   Higher Dimensional Lattice Walks:
                                  Connecting Combinatorial and Analytic
                                  Behavior . . . . . . . . . . . . . . . . 2140--2174
          Elad Aigner-Horev and   
                    Yury Person   Monochromatic Schur Triples in Randomly
                                  Perturbed Dense Sets of Integers . . . . 2175--2180
              Alexandre Rok and   
                Bartosz Walczak   Outerstring Graphs are $ \chi $-Bounded  2181--2199
                Marcos Kiwi and   
                 Dieter Mitsche   On the Second Largest Component of
                                  Random Hyperbolic Graphs . . . . . . . . 2200--2217
              Claude Tardif and   
                 Marcin Wrochna   Hedetniemi's Conjecture and Strongly
                                  Multiplicative Graphs  . . . . . . . . . 2218--2250
              Tomasz Luczak and   
                  Joanna Polcyn   Paths in Hypergraphs: a Rescaling
                                  Phenomenon . . . . . . . . . . . . . . . 2251--2266
                 Talya Eden and   
                   Dana Ron and   
                   C. Seshadhri   Sublinear Time Estimation of Degree
                                  Distribution Moments: The Arboricity
                                  Connection . . . . . . . . . . . . . . . 2267--2285
                 Soojin Cho and   
                      JiSun Huh   On $e$-Positivity and $e$-Unimodality of
                                  Chromatic Quasi-symmetric Functions  . . 2286--2315
               Pratik Misra and   
                 Seth Sullivant   Bounds on the Expected Size of the
                                  Maximum Agreement Subtree for a Given
                                  Tree Shape . . . . . . . . . . . . . . . 2316--2325
Ivona Bezáková and   
           Radu Curticapean and   
                Holger Dell and   
                 Fedor V. Fomin   Finding Detours is Fixed-Parameter
                                  Tractable  . . . . . . . . . . . . . . . 2326--2345
António Girão and   
      Teeradej Kittipassorn and   
                Kamil Popielarz   Partite Saturation of Complete Graphs    2346--2359
                 Shoham Letzter   Many $H$-Copies in Graphs with a
                                  Forbidden Tree . . . . . . . . . . . . . 2360--2368
                 Swee Hong Chan   Rotor Walks on Transient Graphs and the
                                  Wired Spanning Forest  . . . . . . . . . 2369--2393
               Ricky I. Liu and   
Karola Mészáros and   
               Avery St. Dizier   Gelfand--Tsetlin Polytopes: a Story of
                                  Flow and Order Polytopes . . . . . . . . 2394--2415
       József Balogh and   
                        Lina Li   The Typical Structure of Gallai
                                  Colorings and Their Extremal Graphs  . . 2416--2443
                Yandong Bai and   
             Yannis Manoussakis   On the Number of Vertex-Disjoint Cycles
                                  in Digraphs  . . . . . . . . . . . . . . 2444--2451
        Samuel C. Gutekunst and   
            David P. Williamson   Characterizing the Integrality Gap of
                                  the Subtour LP for the Circulant
                                  Traveling Salesman Problem . . . . . . . 2452--2478
              Emily J. King and   
                  Xiaoxian Tang   New Upper Bounds for Equiangular Lines
                                  by Pillar Decomposition  . . . . . . . . 2479--2508
                 Jingxue Ma and   
                     Gennian Ge   Optimal Binary Linear Locally Repairable
                                  Codes with Disjoint Repair Groups  . . . 2509--2529


SIAM Journal on Discrete Mathematics
Volume 34, Number 1, 2020

             Stefan Felsner and   
               Linda Kleist and   
         Torsten Mütze and   
                    Leon Sering   Rainbow Cycles in Flip Graphs  . . . . . 1--39
            Michal D\kebski and   
         Jaros\law Grytczuk and   
              Barbara Nayar and   
             Urszula Pastwa and   
       Joanna Sokó\l and   
        Micha\l Tuczy\'nski and   
          Przemys\law Wenus and   
              Krzysztof W\kesek   Avoiding Multiple Repetitions in
                                  Euclidean Spaces . . . . . . . . . . . . 40--52
             Alan M. Frieze and   
                   Tomasz Tkocz   Random Graphs with a Fixed Maximum
                                  Degree . . . . . . . . . . . . . . . . . 53--61
               Frantisek Kardos   A Computer-Assisted Proof of the
                                  Barnette--Goodey Conjecture: Not Only
                                  Fullerene Graphs Are Hamiltonian . . . . 62--100
         Robert Krauthgamer and   
              Havana Inbal Rika   Refined Vertex Sparsifiers of Planar
                                  Graphs . . . . . . . . . . . . . . . . . 101--129
             Gramoz Goranci and   
           Monika Henzinger and   
                       Pan Peng   Improved Guarantees for Vertex
                                  Sparsification in Planar Graphs  . . . . 130--162
                 Tony Huynh and   
                   Peter Nelson   The Matroid Secretary Problem for
                                  Minor-Closed Classes and Random Matroids 163--176
                  Sara Fish and   
             Cosmin Pohoata and   
                   Adam Sheffer   Local Properties via Color Energy Graphs
                                  and Forbidden Configurations . . . . . . 177--187
                 Robert Lukotka   Short Cycle Covers of Cubic Graphs and
                                  Intersecting $5$-Circuits  . . . . . . . 188--211
Dániel Garamvölgyi and   
            Tibor Jordán   Global Rigidity of Unit Ball Graphs  . . 212--229
             Anurag Bishnoi and   
                 Valentina Pepe   Nonintersecting Ryser Hypergraphs  . . . 230--240
                  Oliver Janzer   The Extremal Number of the Subdivisions
                                  of the Complete Bipartite Graph  . . . . 241--250
              Samir Khuller and   
             Manish Purohit and   
            Kanthi K. Sarpatwar   Analyzing the Optimal Neighborhood:
                                  Algorithms for Partial and Budgeted
                                  Connected Dominating Set Problems  . . . 251--270
                     Ran Gu and   
                   Jiaao Li and   
                   Yongtang Shi   Anti-Ramsey Numbers of Paths and Cycles
                                  in Hypergraphs . . . . . . . . . . . . . 271--307
         Alexander Barvinok and   
            Anthony Della Pella   Testing for Dense Subsets in a Graph via
                                  the Partition Function . . . . . . . . . 308--327
                 Marcin Wrochna   Homomorphism Reconfiguration via
                                  Homotopy . . . . . . . . . . . . . . . . 328--350
      Dániel Gerbner and   
           Abhishek Methuku and   
           Gholamreza Omidi and   
       Máté Vizer   Ramsey Problems for Berge Hypergraphs    351--369
     Laure Marêché   Combinatorics for General Kinetically
                                  Constrained Spin Models  . . . . . . . . 370--384
               David Conlon and   
                  Jacob Fox and   
                  Benny Sudakov   Books versus Triangles at the Extremal
                                  Density  . . . . . . . . . . . . . . . . 385--398
                    Brant Jones   Weighted Games of Best Choice  . . . . . 399--414
                    Joshua Erde   Directed Path-Decompositions . . . . . . 415--430
           Maria Chudnovsky and   
             Jan Goedgebeur and   
             Oliver Schaudt and   
                 Mingxian Zhong   Obstructions for Three-Coloring and List
                                  Three-Coloring $H$-Free Graphs . . . . . 431--469
   Marcel K. de Carli Silva and   
           Levent Tunçel   A Notion of Total Dual Integrality for
                                  Convex, Semidefinite, and Extended
                                  Formulations . . . . . . . . . . . . . . 470--496
         Daniel W. Cranston and   
                       Jiaao Li   Circular Flows in Planar Graphs  . . . . 497--519
       Venkatesan Guruswami and   
                    Sai Sandeep   Rainbow Coloring Hardness via Low
                                  Sensitivity Polymorphisms  . . . . . . . 520--537
       Zdenek Dvorák and   
                     Xiaolan Hu   Fractional Coloring of Planar Graphs of
                                  Girth Five . . . . . . . . . . . . . . . 538--555
                  Tao Jiang and   
                         Yu Qiu   Turán Numbers of Bipartite Subdivisions   556--570
           Junpei Nakashima and   
            Yukiko Yamauchi and   
               Shuji Kijima and   
             Masafumi Yamashita   Finding Submodularity Hidden in
                                  Symmetric Difference . . . . . . . . . . 571--585
            Kevin G. Milans and   
               Michael C. Wigal   A Dichotomy Theorem for First-Fit Chain
                                  Partitions . . . . . . . . . . . . . . . 586--596
             Peter J. Dukes and   
                 Daniel Horsley   On the Minimum Degree Required for a
                                  Triangle Decomposition . . . . . . . . . 597--610
                   Xin Fang and   
           Ghislain Fourier and   
          Jan-Philipp Litza and   
                Christoph Pegel   A Continuous Family of Marked Poset
                                  Polytopes  . . . . . . . . . . . . . . . 611--639
                  Iyad Kanj and   
      Christian Komusiewicz and   
               Manuel Sorge and   
           Erik Jan van Leeuwen   Solving Partition Problems Almost Always
                                  Requires Pushing Many Vertices Around    640--681
                  F. Becker and   
             P. Montealegre and   
                I. Rapaport and   
                     I. Todinca   The Impact of Locality in the Broadcast
                                  Congested Clique Model . . . . . . . . . 682--700
        Daniel Irving Bernstein   L-Infinity Optimization to Bergman Fans
                                  of Matroids with an Application to
                                  Phylogenetics  . . . . . . . . . . . . . 701--720
                 Boris Bukh and   
               Raymond Hogenson   Length of the Longest Common Subsequence
                                  between Overlapping Words  . . . . . . . 721--729
           Christian Engels and   
                 Mohit Garg and   
            Kazuhisa Makino and   
                       Anup Rao   On Expressing Majority as a Majority of
                                  Majorities . . . . . . . . . . . . . . . 730--741
             Antonio Blanca and   
            Andreas Galanis and   
        Leslie Ann Goldberg and   
         Daniel Stefankovic and   
                Eric Vigoda and   
                      Kuan Yang   Sampling in Uniqueness from the Potts
                                  and Random-Cluster Models on Random
                                  Regular Graphs . . . . . . . . . . . . . 742--793
    Bhaswar B. Bhattacharya and   
          Somabha Mukherjee and   
                Sumit Mukherjee   The Second-Moment Phenomenon for
                                  Monochromatic Subgraphs  . . . . . . . . 794--824
               Silvia Butti and   
         Stanislav Zivný   Sparsification of Binary CSPs  . . . . . 825--842
          Khaled Elbassioni and   
                Kazuhisa Makino   Enumerating Vertices of Covering
                                  Polyhedra with Totally Unimodular
                                  Constraint Matrices  . . . . . . . . . . 843--864
                 Alantha Newman   An Improved Analysis of the
                                  Mömke--Svensson Algorithm for Graph-TSP
                                  on Subquartic Graphs . . . . . . . . . . 865--884
                  Noga Alon and   
          Jonathan D. Cohen and   
        Thomas L. Griffiths and   
           Pasin Manurangsi and   
            Daniel Reichman and   
               Igor Shinkar and   
                 Tal Wagner and   
                   Alexander Yu   Multitasking Capacity: Hardness Results
                                  and Improved Constructions . . . . . . . 885--903
                 Ran Gelles and   
           Rafail Ostrovsky and   
                   Alan Roytman   Efficient Error-Correcting Codes for
                                  Sliding Windows  . . . . . . . . . . . . 904--937
                   Ken Yamamoto   Large Deviation Theorem for Branches of
                                  the Random Binary Tree in the
                                  Horton--Strahler Analysis  . . . . . . . 938--949
                Uriel Feige and   
                Anne Kenyon and   
                   Shimon Kogan   On the Profile of Multiplicities of
                                  Complete Subgraphs . . . . . . . . . . . 950--971
               O-joung Kwon and   
                    Sang-il Oum   Scattered Classes of Graphs  . . . . . . 972--999
                  Zihan Tan and   
                     Liwei Zeng   Erratum for ``On the Inequalities of
                                  Projected Volumes and the Constructible
                                  Region'' . . . . . . . . . . . . . . . . 1000--1000

SIAM Journal on Discrete Mathematics
Volume 34, Number 2, 2020

              Rajko Nenadov and   
                 Yanitsa Pehova   On a Ramsey--Turán Variant of the
                                  Hajnal--Szemerédi Theorem . . . . . . . . 1001--1010
             Toufik Mansour and   
              Reza Rastegar and   
         Alexander Roitershtein   Finite Automata, Probabilistic Method,
                                  and Occurrence Enumeration of a Pattern
                                  in Words and Permutations  . . . . . . . 1011--1038
             Benjamin Plaut and   
                Tim Roughgarden   Almost Envy-Freeness with General
                                  Valuations . . . . . . . . . . . . . . . 1039--1068
    Bhaswar B. Bhattacharya and   
             Shirshendu Ganguly   Upper Tails for Edge Eigenvalues of
                                  Random Graphs  . . . . . . . . . . . . . 1069--1083
       Rémy Belmonte and   
             Michael Lampis and   
                   Valia Mitsou   Parameterized (Approximate) Defective
                                  Coloring . . . . . . . . . . . . . . . . 1084--1106
   Alexandre Blanché and   
        Konrad K. Dabrowski and   
            Matthew Johnson and   
             Vadim V. Lozin and   
       Daniël Paulusma and   
                Viktor Zamaraev   Clique-Width for Graph Classes Closed
                                  under Complementation  . . . . . . . . . 1107--1147
                  R. Gabrys and   
                  H. S. Dau and   
             C. J. Colbourn and   
                  O. Milenkovic   Set-Codes with Small Intersections and
                                  Small Discrepancies  . . . . . . . . . . 1148--1171
             Michael Joswig and   
                     Georg Loho   Monomial Tropical Cones for
                                  Multicriteria Optimization . . . . . . . 1172--1191
                  Yezhou Wu and   
                        Dong Ye   Minimum $T$-Joins and Signed-Circuit
                                  Covering . . . . . . . . . . . . . . . . 1192--1204
                     Sean Dewar   Infinitesimal Rigidity in Normed Planes  1205--1231
                 Paul Beame and   
        Shayan Oveis Gharan and   
                       Xin Yang   On the Bias of Reed--Muller Codes over
                                  Odd Prime Fields . . . . . . . . . . . . 1232--1247
                  Pavel Etingof   Angle-Restricted Sets and Zero-Free
                                  Regions for the Permanent  . . . . . . . 1248--1260
            Christian Haase and   
               Florian Kohl and   
              Akiyoshi Tsuchiya   Levelness of Order Polytopes . . . . . . 1261--1280
             Neil J. Y. Fan and   
               Peter L. Guo and   
           Simon C. Y. Peng and   
               Sophie C. C. Sun   Lattice Points in the Newton Polytopes
                                  of Key Polynomials . . . . . . . . . . . 1281--1289
                    Jun Gao and   
                         Jie Ma   A Conjecture of Verstraëte on
                                  Vertex-Disjoint Cycles . . . . . . . . . 1290--1301
           Akanksha Agrawal and   
             Fedor V. Fomin and   
          Daniel Lokshtanov and   
              Saket Saurabh and   
              Prafullkumar Tale   Path Contraction Faster than $ 2^n $ . . 1302--1325
          Danila Cherkashin and   
                   Fedor Petrov   Regular Behavior of the Maximal
                                  Hypergraph Chromatic Number  . . . . . . 1326--1333
            Chandra Chekuri and   
               Kent Quanrud and   
                        Chao Xu   LP Relaxation and Tree Packing for
                                  Minimum $k$-Cut  . . . . . . . . . . . . 1334--1353
      Debsoumya Chakraborti and   
                    Po-Shen Loh   Extremal Graphs with Local Covering
                                  Conditions . . . . . . . . . . . . . . . 1354--1374
  Seyyed Aliasghar Hosseini and   
               Fiachra Knox and   
                    Bojan Mohar   Cops and Robbers on Graphs of Bounded
                                  Diameter . . . . . . . . . . . . . . . . 1375--1384
 Karthekeyan Chandrasekaran and   
             Matthias Mnich and   
               Sahand Mozaffari   Odd Multiway Cut in Directed Acyclic
                                  Graphs . . . . . . . . . . . . . . . . . 1385--1408
             Alexander Birx and   
                    Yann Disser   Tight Analysis of the Smartstart
                                  Algorithm for Online Dial-a-Ride on the
                                  Line . . . . . . . . . . . . . . . . . . 1409--1443
           Ivailo Hartarsky and   
Tamás Róbert Mezei   Complexity of Two-dimensional Bootstrap
                                  Percolation Difficulty: Algorithm and
                                  NP-Hardness  . . . . . . . . . . . . . . 1444--1459
Sebastián Bustamante and   
                Jan Corsten and   
         Nóra Frankl and   
          Alexey Pokrovskiy and   
                   Jozef Skokan   Partitioning Edge-Colored Hypergraphs
                                  into Few Monochromatic Tight Cycles  . . 1460--1471
           Maria Chudnovsky and   
           Marcin Pilipczuk and   
          Micha\l Pilipczuk and   
 Stéphan Thomassé   On the Maximum Weight Independent Set
                                  Problem in Graphs without Induced Cycles
                                  of Length at Least Five  . . . . . . . . 1472--1483

SIAM Journal on Discrete Mathematics
Volume 34, Number 3, 2020

                    Hui Zhu and   
                Liying Kang and   
                  Zhenyu Ni and   
                    Erfang Shan   The Turán Number of Berge--$ K_4 $ in
                                  $3$-Uniform Hypergraphs  . . . . . . . . 1485--1492
            Chong Shangguan and   
                    Itzhak Tamo   Sparse Hypergraphs with Applications to
                                  Coding Theory  . . . . . . . . . . . . . 1493--1504
           Pasin Manurangsi and   
               Warut Suksompong   When Do Envy-Free Allocations Exist? . . 1505--1521
                  Tara Fife and   
              Dillon Mayhew and   
                James Oxley and   
                 Charles Semple   The Unbreakable Frame Matroids . . . . . 1522--1537
                 Michael Lampis   Finer Tight Bounds for Coloring on
                                  Clique-Width . . . . . . . . . . . . . . 1538--1558
                    Abigail Raz   Upper Tail Bounds for Cycles . . . . . . 1559--1586
             Fedor V. Fomin and   
           Petr A. Golovach and   
          Daniel Lokshtanov and   
              Fahad Panolan and   
              Saket Saurabh and   
                  Meirav Zehavi   Going Far from Degeneracy  . . . . . . . 1587--1601
                Hailong Dao and   
           Joseph Doolittle and   
                    Justin Lyle   Minimal Cohen--Macaulay Simplicial
                                  Complexes  . . . . . . . . . . . . . . . 1602--1608
 Wouter Cames van Batenburg and   
         Gwenaël Joret and   
                   Arthur Ulmer   Erd\Hos--Pósa from Ball Packing . . . . . 1609--1619
                 Boris Bukh and   
              Oleksandr Rudenko   Order-Isomorphic Twins in Permutations   1620--1622
               Julien Baste and   
                 Ignasi Sau and   
          Dimitrios M. Thilikos   Hitting Minors on Bounded Treewidth
                                  Graphs. I. General Upper Bounds  . . . . 1623--1648
                 Sungjin Im and   
                     Shi Li and   
               Benjamin Moseley   Breaking $ 1 - 1 / e $ Barrier for
                                  Nonpreemptive Throughput Maximization    1649--1669
            Matthew Coulson and   
               Guillem Perarnau   A Rainbow Dirac's Theorem  . . . . . . . 1670--1692
            Vida Dujmovi\'c and   
             David Eppstein and   
         Gwenaël Joret and   
                  Pat Morin and   
                  David R. Wood   Minor-Closed Graph Classes with Bounded
                                  Layered Pathwidth  . . . . . . . . . . . 1693--1709
                 Pavol Hell and   
                 Jing Huang and   
          Ross M. McConnell and   
                   Arash Rafiey   Min-Orderable Digraphs . . . . . . . . . 1710--1724
         Daniel W. Cranston and   
              Matthew P. Yancey   Sparse Graphs Are Near-Bipartite . . . . 1725--1768
     Marcelo H. De Carvalho and   
             Nishad Kothari and   
                Xiumei Wang and   
                      Yixun Lin   Birkhoff--von Neumann Graphs that are
                                  PM-Compact . . . . . . . . . . . . . . . 1769--1790
                  Chen Avin and   
          Marcin Bienkowski and   
             Andreas Loukas and   
               Maciej Pacut and   
                  Stefan Schmid   Dynamic Balanced Graph Partitioning  . . 1791--1812
      Dániel Gerbner and   
      Dániel T. Nagy and   
Balázs Patkós and   
       Máté Vizer   $t$-Wise Berge and $t$-Heavy Hypergraphs 1813--1829
                 Shishuo Fu and   
                Guo-Niu Han and   
                    Zhicong Lin   $k$-Arrangements, Statistics, and
                                  Patterns . . . . . . . . . . . . . . . . 1830--1853
            Laurent Bulteau and   
             Vincent Froese and   
               Rolf Niedermeier   Tight Hardness Results for Consensus
                                  Problems on Circular Strings and Time
                                  Series . . . . . . . . . . . . . . . . . 1854--1883
          Alexey Pokrovskiy and   
                  Benny Sudakov   Ramsey Goodness of Cycles  . . . . . . . 1884--1908
                Xuanlong Ma and   
              Gary L. Walls and   
               Kaishun Wang and   
                   Sanming Zhou   Subgroup Perfect Codes in Cayley Graphs  1909--1921
               Dhruv Mubayi and   
                 Caroline Terry   Extremal Theory of Locally Sparse
                                  Multigraphs  . . . . . . . . . . . . . . 1922--1943
                Yuanan Diao and   
                Claus Ernst and   
            Gábor Hetyei   Invariants of Rational Links Represented
                                  by Reduced Alternating Diagrams  . . . . 1944--1968
                 Pavol Hell and   
                 Jing Huang and   
          Jephian C.-H. Lin and   
              Ross M. McConnell   Bipartite Analogues of Comparability and
                                  Cocomparability Graphs . . . . . . . . . 1969--1983
             Brendan Murphy and   
                  James Wheeler   Growth in Some Finite Three-Dimensional
                                  Matrix Groups  . . . . . . . . . . . . . 1984--1998
                 Gennian Ge and   
                 Yifan Jing and   
                 Zixiang Xu and   
                      Tao Zhang   Color Isomorphic Even Cycles and a
                                  Related Ramsey Problem . . . . . . . . . 1999--2008
                  Fei Huang and   
               Shanshan Guo and   
                  Jinjiang Yuan   A Short Note on Open-Neighborhood
                                  Conflict-Free Colorings of Graphs  . . . 2009--2015

SIAM Journal on Discrete Mathematics
Volume 34, Number 4, 2020

            Jannik Silvanus and   
                     Jens Vygen   Few Sequence Pairs Suffice: Representing
                                  All Rectangle Placements . . . . . . . . 2017--2032
              Oliver Cooley and   
                Wenjie Fang and   
         Nicola Del Giudice and   
                    Mihyun Kang   Subcritical Random Hypergraphs,
                                  High-Order Components, and Hypertrees    2033--2062
                Lucas Laird and   
       Richard C. Tillquist and   
             Stephen Becker and   
              Manuel E. Lladser   Resolvability of Hamming Graphs  . . . . 2063--2081
           Jannik Matuschke and   
        S. Thomas McCormick and   
               Gianpaolo Oriolo   Rerouting Flows when Links Fail  . . . . 2082--2107
               Guido Besomi and   
Matías Pavez-Signé and   
                     Maya Stein   Maximum and Minimum Degree Conditions
                                  for Embedding Trees  . . . . . . . . . . 2108--2123
              Simon Macourt and   
           Giorgis Petridis and   
           Ilya D. Shkredov and   
            Igor E. Shparlinski   Bounds of Trilinear and Trinomial
                                  Exponential Sums . . . . . . . . . . . . 2124--2136
       Zdenek Dvorák and   
                     Xiaolan Hu   $ (3 a \colon a)$-List-Colorability of
                                  Embedded Graphs of Girth at Least Five   2137--2165
                     You Lu and   
                   Rong Luo and   
           Michael Schubert and   
            Eckhard Steffen and   
                 Cun-Quan Zhang   Flows on Signed Graphs without Long
                                  Barbells . . . . . . . . . . . . . . . . 2166--2182
     Ken-ichi Kawarabayashi and   
                        Chao Xu   Minimum Violation Vertex Maps and Their
                                  Applications to Cut Problems . . . . . . 2183--2207
                 Zixiang Xu and   
                     Gennian Ge   Erd\Hos--Falconer Distance Problem under
                                  Hamming Metric in Vector Spaces over
                                  Finite Fields  . . . . . . . . . . . . . 2208--2220
         Gwenaël Joret and   
                 William Lochet   Progress on the Adjacent Vertex
                                  Distinguishing Edge Coloring Conjecture  2221--2238
             Vojtech Dvorak and   
           Peter van Hintum and   
                    Marius Tiba   Improved Bound for Tomaszewski's Problem 2239--2249
              Eyal Ackerman and   
      Balázs Keszegh and   
Dömötör Pálvölgyi   Coloring Hypergraphs Defined by Stabbed
                                  Pseudo-Disks and ABAB-Free Hypergraphs   2250--2269
               Peter Nelson and   
                    Sophia Park   A Ramsey Theorem for Biased Graphs . . . 2270--2281
               Klaus Jansen and   
          Alexandra Lassota and   
                 Lars Rohwedder   Near-Linear Time Algorithm for $n$-Fold
                                  ILPs via Color Coding  . . . . . . . . . 2282--2299
  András Pongrácz   Binary Linear Codes with Near-Extremal
                                  Maximum Distance . . . . . . . . . . . . 2300--2317
              Amotz Bar-Noy and   
           Keerti Choudhary and   
                David Peleg and   
                    Dror Rawitz   Efficiently Realizing Interval Sequences 2318--2337
            Chong Shangguan and   
                    Itzhak Tamo   New Turán Exponents for Two Extremal
                                  Hypergraph Problems  . . . . . . . . . . 2338--2345
                 Linyuan Lu and   
                     Zhiyu Wang   Anti-Ramsey Number of Edge-Disjoint
                                  Rainbow Spanning Trees . . . . . . . . . 2346--2362
            Tristram Bogart and   
              John Goodrick and   
                    Kevin Woods   A Parametric Version of LLL and Some
                                  Consequences: Parametric Shortest and
                                  Closest Vector Problems  . . . . . . . . 2363--2387
            Stephen Melczer and   
               Greta Panova and   
                 Robin Pemantle   Counting Partitions inside a Rectangle   2388--2410
            Alexey Glazyrin and   
                    Josiah Park   Repeated Minimizers of $p$-Frame
                                  Energies . . . . . . . . . . . . . . . . 2411--2423
             Benjamin Braun and   
                  Julianne Vega   Hajós-Type Constructions and Neighborhood
                                  Complexes  . . . . . . . . . . . . . . . 2424--2447
                   Jin-Hui Fang   On Generalized Perfect Difference
                                  Sumsets  . . . . . . . . . . . . . . . . 2448--2456
              Ergun Akleman and   
                Jianer Chen and   
          Jonathan L. Gross and   
                       Shiyu Hu   A Topologically Complete Theory of
                                  Weaving  . . . . . . . . . . . . . . . . 2457--2480
   Mathieu Dutour Sikiri\'c and   
              Alexey Garber and   
            Alexander Magazinov   On the Voronoi Conjecture for
                                  Combinatorially Voronoi Parallelohedra
                                  in Dimension 5 . . . . . . . . . . . . . 2481--2501
               Mehdi Makhul and   
               Audie Warren and   
                 Arne Winterhof   The Spherical Kakeya Problem in Finite
                                  Fields . . . . . . . . . . . . . . . . . 2502--2509
               Alexander Strang   Solutions to the Minimum Variance
                                  Problem Using Delaunay Triangulation . . 2510--2531
Dániel Korándi and   
          János Pach and   
            István Tomon   Large Homogeneous Submatrices  . . . . . 2532--2552
                  George Shakan   A Large Gap in a Dilate of a Set . . . . 2553--2555
                  Jacob Fox and   
                        Fan Wei   On the Number of Cliques in Graphs with
                                  a Forbidden Subdivision or Immersion . . 2556--2582
               Jianfeng Hou and   
                  Shufei Wu and   
               Qinghou Zeng and   
                    Wenxing Zhu   Erratum: The Bollobás--Scott Conjecture
                                  for $4$-Uniform Hypergraphs  . . . . . . 2583--2584


SIAM Journal on Discrete Mathematics
Volume 35, Number 1, 2021

                  Hiroki Oshima   Improved Randomized Algorithm for
                                  $k$-Submodular Function Maximization . . 1--22
                Qizhong Lin and   
                      Xiudi Liu   Ramsey Numbers Involving Large Books . . 23--34
    Hél\`ene Barcelo and   
              Curtis Greene and   
         Abdul Salam Jarrah and   
                 Volkmar Welker   On the Vanishing of Discrete Singular
                                  Cubical Homology for Graphs  . . . . . . 35--54
         Laurent Feuilloley and   
                   Michel Habib   Graph Classes and Forbidden Patterns on
                                  Three Vertices . . . . . . . . . . . . . 55--90
            Meysam Alishahi and   
 Frédéric Meunier   Topological Bounds for Graph
                                  Representations over Any Field . . . . . 91--104
     Archontia Giannopoulou and   
          Micha\l Pilipczuk and   
       Jean-Florent Raymond and   
      Dimitrios M. Thilikos and   
                 Marcin Wrochna   Linear Kernels for Edge Deletion
                                  Problems to Immersion-Closed Graph
                                  Classes  . . . . . . . . . . . . . . . . 105--151
          Steffen Borgwardt and   
                   Charles Viss   Constructing Clustering Transformations  152--178
            Satoshi Noguchi and   
                Xiao-Nan Lu and   
             Masakazu Jimbo and   
                      Ying Miao   BCH Codes with Minimum Distance
                                  Proportional to Code Length  . . . . . . 179--193
            Oliver Roche-Newton   Sums, Products, and Dilates on Sparse
                                  Graphs . . . . . . . . . . . . . . . . . 194--204
           Alexander Garver and   
             Stefan Grosser and   
          Jacob P. Matherne and   
              Alejandro Morales   Counting Linear Extensions of Posets
                                  with Determinants of Hook Lengths  . . . 205--233
            Dustin G. Mixon and   
                  Hans Parshall   Globally Optimizing Small Codes in Real
                                  Projective Spaces  . . . . . . . . . . . 234--249
             Louis DeBiasio and   
                   Allan Lo and   
             Theodore Molla and   
                Andrew Treglown   Transitive Tournament Tilings in
                                  Oriented Graphs with Large Minimum Total
                                  Degree . . . . . . . . . . . . . . . . . 250--266
              Oliver Cooley and   
         Nemanja Dragani\'c and   
                Mihyun Kang and   
                  Benny Sudakov   Large Induced Matchings in Random Graphs 267--280
                Nina Kamcev and   
             Anita Liebenau and   
              David R. Wood and   
                Liana Yepremyan   The Size Ramsey Number of Graphs with
                                  Bounded Treewidth  . . . . . . . . . . . 281--293
            A. Nicholas Day and   
                  Amites Sarkar   On a Conjecture of Nagy on Extremal
                                  Densities  . . . . . . . . . . . . . . . 294--306
              Ilya Shkredov and   
                Jozsef Solymosi   The Uniformity Conjecture in Additive
                                  Combinatorics  . . . . . . . . . . . . . 307--321
            Quentin Dubroff and   
                  Jacob Fox and   
                Max Wenqiang Xu   A Note on the Erd\Hos Distinct Subset
                                  Sums Problem . . . . . . . . . . . . . . 322--324
              Matteo Gallet and   
            Georg Grasegger and   
        Jan Legerský and   
                  Josef Schicho   On the Existence of Paradoxical Motions
                                  of Generically Rigid Graphs on the
                                  Sphere . . . . . . . . . . . . . . . . . 325--361
                 Pavol Hell and   
César Hernández-Cruz and   
                 Jing Huang and   
              Jephian C.-H. Lin   Strong Chordality of Graphs with
                                  Possible Loops . . . . . . . . . . . . . 362--375
               Miaomiao Han and   
                   Jiaao Li and   
                   Rong Luo and   
               Yongtang Shi and   
                 Cun-Quan Zhang   Integer Flows and Modulo Orientations of
                                  Signed Graphs  . . . . . . . . . . . . . 376--391
     Henning Bruhn-Fujimoto and   
              Matthias Heinlein   $ K_4 $-Subdivisions Have the
                                  Edge--Erd\Hos--Pósa Property  . . . . . . 392--430
                 Runrun Liu and   
               Martin Rolek and   
    D. Christopher Stephens and   
                    Dong Ye and   
                       Gexin Yu   Connectivity for Kite-Linked Graphs  . . 431--446
          Marcin Bria\'nski and   
                Piotr Micek and   
          Micha\l Pilipczuk and   
             Micha\l T. Seweryn   Erd\Hos--Hajnal Properties for Powers of
                                  Sparse Graphs  . . . . . . . . . . . . . 447--464
           Eyal Kushilevitz and   
           Rafail Ostrovsky and   
            Emmanuel Prouff and   
           Adi Rosén and   
            Adrian Thillard and   
                Damien Vergnaud   Lower and Upper Bounds on the Randomness
                                  Complexity of Private Computations of
                                  AND  . . . . . . . . . . . . . . . . . . 465--484
                    Ngo Dac Tan   Tournaments and Bipartite Tournaments
                                  without Vertex Disjoint Cycles of
                                  Different Lengths  . . . . . . . . . . . 485--494
                M. McDevitt and   
                      N. Ruskuc   Atomicity and Well Quasi-Order for
                                  Consecutive Orderings on Words and
                                  Permutations . . . . . . . . . . . . . . 495--520
               Michael Tait and   
                     Robert Won   Improved Bounds on Sizes of Generalized
                                  Caps in $ A G(n, q) $  . . . . . . . . . 521--531
                Qizhong Lin and   
                      Xing Peng   Large Book-Cycle Ramsey Numbers  . . . . 532--545
        Pavel Dvorák and   
        Andreas E. Feldmann and   
                 Dusan Knop and   
Tomás Masarík and   
        Tomás Toufar and   
            Pavel Veselý   Parameterized Approximation Schemes for
                                  Steiner Trees with Small Number of
                                  Steiner Vertices . . . . . . . . . . . . 546--574
              Gregory Gutin and   
        Diptapriyo Majumdar and   
         Sebastian Ordyniak and   
          Magnus Wahlström   Parameterized Pre-Coloring Extension and
                                  List Coloring Problems . . . . . . . . . 575--596

SIAM Journal on Discrete Mathematics
Volume 35, Number 2, 2021

               O-joung Kwon and   
           Jean-Florent Raymond   Packing and Covering Induced
                                  Subdivisions . . . . . . . . . . . . . . 597--636
             Oleg Karpenkov and   
              Christian Mueller   Geometric Criteria for Realizability of
                                  Tensegrities in Higher Dimensions  . . . 637--660
                   Rose McCarty   Dense Induced Subgraphs of Dense
                                  Bipartite Graphs . . . . . . . . . . . . 661--667
           Pasin Manurangsi and   
               Warut Suksompong   Closing Gaps in Asymptotic Fair Division 668--706
          Martín D. Safe   Circularly Compatible Ones,
                                  $D$-Circularity, and Proper Circular-Arc
                                  Bigraphs . . . . . . . . . . . . . . . . 707--751
          Chien-Chung Huang and   
               Mathieu Mari and   
             Claire Mathieu and   
             Kevin Schewior and   
                     Jens Vygen   An Approximation Algorithm for Fully
                                  Planar Edge-Disjoint Paths . . . . . . . 752--769
                   Stasys Jukna   Notes on Hazard-Free Circuits  . . . . . 770--787
                    Hoon Oh and   
         Ariel D. Procaccia and   
               Warut Suksompong   Fairly Allocating Many Goods with Few
                                  Queries  . . . . . . . . . . . . . . . . 788--813
                 Ivan Aidun and   
               Frances Dean and   
             Ralph Morrison and   
                  Teresa Yu and   
                     Julie Yuan   Gonality Sequences of Graphs . . . . . . 814--839
            Steven Chaplick and   
             Fedor V. Fomin and   
           Petr A. Golovach and   
                 Dusan Knop and   
                    Peter Zeman   Kernelization of Graph Hamiltonicity:
                                  Proper $H$-Graphs  . . . . . . . . . . . 840--892
              Henning Bruhn and   
                 Felix Joos and   
                 Oliver Schaudt   Erd\Hos--Pósa Property for Labeled
                                  Minors: $2$-Connected Minors . . . . . . 893--914
Gábor Damásdi and   
             Stefan Felsner and   
António Girão and   
      Balázs Keszegh and   
                David Lewis and   
      Dániel T. Nagy and   
               Torsten Ueckerdt   On Covering Numbers, Young Diagrams, and
                                  the Local Dimension of Posets  . . . . . 915--927
               Bill Jackson and   
              Anthony Nixon and   
             Shin-ichi Tanigawa   An Improved Bound for the Rigidity of
                                  Linearly Constrained Frameworks  . . . . 928--933
      Wojciech Czerwi\'nski and   
            Wojciech Nadara and   
               Marcin Pilipczuk   Improved Bounds for the Excluded-Minor
                                  Approximation of Treedepth . . . . . . . 934--947
                    Xiaofeng Gu   A Proof of Brouwer's Toughness
                                  Conjecture . . . . . . . . . . . . . . . 948--952
              Guillaume Ducoffe   Faster Approximation Algorithms for
                                  Computing Shortest Cycles on Weighted
                                  Graphs . . . . . . . . . . . . . . . . . 953--969
             Andrea Freschi and   
                Joseph Hyde and   
                Joanna Lada and   
                Andrew Treglown   A Note on Color-Bias Hamilton Cycles in
                                  Dense Graphs . . . . . . . . . . . . . . 970--975
        Igor E. Shparlinski and   
                     Qiang Wang   Exponential Sums with Sparse Polynomials
                                  over Finite Fields . . . . . . . . . . . 976--987
              Rajko Nenadov and   
                 Milos Truji\'c   Sprinkling a Few Random Edges Doubles
                                  the Power  . . . . . . . . . . . . . . . 988--1004
                Xiaonan Liu and   
                    Xingxing Yu   Number of Hamiltonian Cycles in Planar
                                  Triangulations . . . . . . . . . . . . . 1005--1021
               Hongliang Lu and   
                Xingxing Yu and   
                   Xiaofan Yuan   Nearly Perfect Matchings in Uniform
                                  Hypergraphs  . . . . . . . . . . . . . . 1022--1049
                Alan Arroyo and   
           R. Bruce Richter and   
               Matthew Sunohara   Extending Drawings of Complete Graphs
                                  into Arrangements of Pseudocircles . . . 1050--1076
               Dongchun Han and   
                   Hanbin Zhang   A Reciprocity on Finite Abelian Groups
                                  Involving Zero-Sum Sequences . . . . . . 1077--1095
           Amin Coja-Oghlan and   
              Max Hahn-Klimroth   The Cut Metric for Probability
                                  Distributions  . . . . . . . . . . . . . 1096--1135
            Maria Axenovich and   
Jean-Sébastien Sereni and   
             Richard Snyder and   
                      Lea Weber   Bipartite Independence Number in Graphs
                                  with Bounded Maximum Degree  . . . . . . 1136--1148
       Zdenek Dvorák and   
               Rose McCarty and   
                   Sergey Norin   Sublinear Separators in Intersection
                                  Graphs of Convex Shapes  . . . . . . . . 1149--1164
      Debsoumya Chakraborti and   
                 Da Qi Chen and   
                 Mihir Hasabnis   Minimizing the Number of Edges in $
                                  K_{(s, t)} $-Saturated Bipartite Graphs  1165--1181
                 Alan M. Frieze   The Effect of Adding Randomly Weighted
                                  Edges  . . . . . . . . . . . . . . . . . 1182--1200
            Mohamed Barakat and   
            Reimer Behrends and   
      Christopher Jefferson and   
           Lukas Kühne and   
                  Martin Leuner   On the Generation of Rank 3 Simple
                                  Matroids with an Application to Terao's
                                  Freeness Conjecture  . . . . . . . . . . 1201--1223
              Louis Esperet and   
             Cyril Gavoille and   
                Carla Groenland   Isometric Universal Graphs . . . . . . . 1224--1237
              Carlos Hoppen and   
       Yoshiharu Kohayakawa and   
               Richard Lang and   
              Hanno Lefmann and   
                Henrique Stagni   On the Query Complexity of Estimating
                                  the Distance to Hereditary Graph
                                  Properties . . . . . . . . . . . . . . . 1238--1251
              Stefan Kiefer and   
                Corto N. Mascle   On Nonnegative Integer Matrices and
                                  Short Killing Words  . . . . . . . . . . 1252--1267
              Dusko Joji\'c and   
              Gaiane Panina and   
              Rade Zivaljevi\'c   Splitting Necklaces, with Constraints    1268--1286
Edita Mácajová and   
                Martin Skoviera   Perfect Matching Index versus Circular
                                  Flow Number of a Cubic Graph . . . . . . 1287--1297
             Fedor V. Fomin and   
               Petr A. Golovach   Kernelization of Whitney Switches  . . . 1298--1336
    Sándor P. Fekete and   
               Linda Kleist and   
                 Dominik Krupke   Minimum Scan Cover with Angular
                                  Transition Costs . . . . . . . . . . . . 1337--1355
                  Ben Clark and   
                Kevin Grace and   
                James Oxley and   
          Stefan H. M. van Zwam   On the Highly Connected Dyadic,
                                  Near-Regular, and Sixth-Root-of-Unity
                                  Matroids . . . . . . . . . . . . . . . . 1356--1380
                Wenjian Liu and   
                      Ning Ning   Phase Transition of the
                                  Reconstructability of a General Model
                                  with Different In-Community and
                                  Out-Community Mutations on an Infinite
                                  Tree . . . . . . . . . . . . . . . . . . 1381--1417
             Jesse Beisegel and   
            Carolin Denkert and   
       Ekkehard Köhler and   
                Matjaz Krnc and   
               Nevena Pivac and   
           Robert Scheffler and   
                Martin Strehler   The Recognition Problem of Graph Search
                                  Trees  . . . . . . . . . . . . . . . . . 1418--1446
       Yoshiharu Kohayakawa and   
     Walner Mendonça and   
    Guilherme Oliveira Mota and   
            Bjarne Schülke   Covering $3$-Edge-Colored Random Graphs
                                  with Monochromatic Trees . . . . . . . . 1447--1459
              Safwat Nassar and   
                 Raphael Yuster   All Feedback Arc Sets of a Random Turán
                                  Tournament Have $ \lfloor n / k \rfloor
                                  - k + 1 $ Disjoint $k$-Cliques (and This
                                  Is Tight)  . . . . . . . . . . . . . . . 1460--1477
               John Engbers and   
                 Aysel Erey and   
                  Jacob Fox and   
                      Xiaoyu He   Tomescu's Graph Coloring Conjecture for
                                  $ \ell $-Connected Graphs  . . . . . . . 1478--1502
                Martin Dyer and   
                Mark Jerrum and   
          Haiko Müller and   
            Kristina Vuskovi\'c   Counting Weighted Independent Sets
                                  beyond the Permanent . . . . . . . . . . 1503--1524

SIAM Journal on Discrete Mathematics
Volume 35, Number 3, 2021

              Jozsef Balogh and   
              Nathan Lemons and   
                    Cory Palmer   Maximum Size Intersecting Families of
                                  Bounded Minimum Positive Co-degree . . . 1525--1535
                 Martin Vodicka   Normality of the Kimura $3$-Parameter
                                  Model  . . . . . . . . . . . . . . . . . 1536--1547
                  Tao Zhang and   
                     Gennian Ge   On the Codegree Density of $ P G_m(q) $  1548--1556
            Charles Carlson and   
            Alexandra Kolla and   
                     Ray Li and   
                 Nitya Mani and   
              Benny Sudakov and   
                  Luca Trevisan   Lower Bounds for Max-Cut in $H$-Free
                                  Graphs via Semidefinite Programming  . . 1557--1568
          Elad Aigner-Horev and   
                     Dan Hefetz   Rainbow Hamilton Cycles in Randomly
                                  Colored Randomly Perturbed Dense Graphs  1569--1577
                  Oleg R. Musin   Majorization and Minimal Energy on
                                  Spheres  . . . . . . . . . . . . . . . . 1578--1591
                    Ke Chen and   
          Adrian Dumitrescu and   
            Wolfgang Mulzer and   
           Csaba D. Tóth   On the Stretch Factor of Polygonal
                                  Chains . . . . . . . . . . . . . . . . . 1592--1614
              Travis Dillon and   
           Pablo Soberón   A Mélange of Diameter Helly-Type Theorems 1615--1627
            Mokshay Madiman and   
                 Liyao Wang and   
                     Jae Oh Woo   Entropy Inequalities for Sums in Prime
                                  Cyclic Groups  . . . . . . . . . . . . . 1628--1649
               Jang Soo Kim and   
                     Meesue Yoo   Generalized Schur Function Determinants
                                  Using the Bazin Identity . . . . . . . . 1650--1672
         James A. Long, Jr. and   
            Kevin G. Milans and   
                  Andrea Munaro   Sublinear Longest Path Transversals  . . 1673--1677
                Imre Leader and   
         Zarko Randelovi\'c and   
                 Eero Räty   Inequalities on Projected Volumes  . . . 1678--1687
               Rohit Gurjar and   
            Nisheeth K. Vishnoi   On the Number of Circuits in Regular
                                  Matroids (with Connections to Lattices
                                  and Codes) . . . . . . . . . . . . . . . 1688--1705
            Carol T. Zamfirescu   $ K_2 $-Hamiltonian Graphs: I  . . . . . 1706--1728
               Wanshun Yang and   
                Yiqiao Wang and   
                Weifan Wang and   
                     Ko-Wei Lih   IC-Planar Graphs Are $6$-Choosable . . . 1729--1745
         Mo\"\ise Blanchard and   
   Jesús A. De Loera and   
               Quentin Louveaux   On the Length of Monotone Paths in
                                  Polyhedra  . . . . . . . . . . . . . . . 1746--1768
         Daniel W. Cranston and   
              Matthew P. Yancey   Vertex Partitions into an Independent
                                  Set and a Forest with Each Component
                                  Small  . . . . . . . . . . . . . . . . . 1769--1791
       Frank Fuhlbrück and   
       Johannes Köbler and   
                 Oleg Verbitsky   Identifiability of Graphs with Small
                                  Color Classes by the Weisfeiler--Leman
                                  Algorithm  . . . . . . . . . . . . . . . 1792--1853
            Michael Anastos and   
                Alan Frieze and   
                         Pu Gao   Hamiltonicity of Random Graphs in the
                                  Stochastic Block Model . . . . . . . . . 1854--1880
       Benjamin Bergougnoux and   
 Mamadou Moustapha Kanté   More Applications of the $d$-Neighbor
                                  Equivalence: Acyclicity and Connectivity
                                  Constraints  . . . . . . . . . . . . . . 1881--1926
 Lucas de Oliveira Contiero and   
              Carlos Hoppen and   
              Hanno Lefmann and   
                  Knut Odermann   Rainbow Erd\Hos--Rothschild Problem for
                                  the Fano Plane . . . . . . . . . . . . . 1927--1951
               Papa A. Sissokho   Geometry of the Minimal Solutions of a
                                  Linear Diophantine Equation  . . . . . . 1952--1963
             Radoslav Fulek and   
          Balázs Keszegh   Saturation Problems about Forbidden
                                  $0$--$1$ Submatrices . . . . . . . . . . 1964--1977
             Thomas Magnard and   
           Michael Skotnica and   
                  Martin Tancer   Shellings and Sheddings Induced by
                                  Collapses  . . . . . . . . . . . . . . . 1978--2002
         Hans L. Bodlaender and   
             Sudeshna Kolay and   
                Astrid Pieterse   Parameterized Complexity of
                                  Conflict-Free Graph Coloring . . . . . . 2003--2038
                   Qing Cui and   
              On-Hei Solomon Lo   Tight Gaps in the Cycle Spectrum of
                                  $3$-Connected Planar Graphs  . . . . . . 2039--2048
                 Eric N. Stucky   Parity-Unimodality and a Cyclic Sieving
                                  Phenomenon for Necklaces . . . . . . . . 2049--2069
        Srikanth Srinivasan and   
           Utkarsh Tripathi and   
                   S. Venkitesh   On the Probabilistic Degrees of
                                  Symmetric Boolean Functions  . . . . . . 2070--2092
               Linus Setiabrata   Faces of Root Polytopes  . . . . . . . . 2093--2114
               Guozhen Rong and   
                  Wenjun Li and   
               Jianxin Wang and   
                   Yongjie Yang   Cycle Extendability of Hamiltonian
                                  Strongly Chordal Graphs  . . . . . . . . 2115--2128
             Shang-En Huang and   
                    Seth Pettie   Lower Bounds on Sparse Spanners,
                                  Emulators, and Diameter-Reducing
                                  Shortcuts  . . . . . . . . . . . . . . . 2129--2144
            Patrick Bennett and   
               Ryan Cushman and   
                  Andrzej Dudek   Closing the Random Graph Gap in Tuza's
                                  Conjecture through the Online Triangle
                                  Packing Process  . . . . . . . . . . . . 2145--2169
                  Sam Spiro and   
        Jacques Verstraëte   Relative Turán Problems for Uniform
                                  Hypergraphs  . . . . . . . . . . . . . . 2170--2191
Kristóf Bérczi and   
      Tamás Schwarcz and   
               Yutaro Yamaguchi   List Coloring of Two Matroids through
                                  Reduction to Partition Matroids  . . . . 2192--2209
                   Luiz Moreira   Ramsey Goodness of Clique Versus Paths
                                  in Random Graphs . . . . . . . . . . . . 2210--2222
Edita Mácajová and   
                Martin Skoviera   Cubic Graphs with No Short Cycle Covers  2223--2233
                Weiting Cao and   
            Douglas B. West and   
                       Yan Yang   On the Bar Visibility Number of Complete
                                  Bipartite Graphs . . . . . . . . . . . . 2234--2248
               David Conlon and   
               Mykhaylo Tyomkyn   Repeated Patterns in Proper Colorings    2249--2264
          Felix Hommelsheim and   
       Moritz Muehlenthaler and   
                 Oliver Schaudt   How to Secure Matchings against Edge
                                  Failures . . . . . . . . . . . . . . . . 2265--2292

SIAM Journal on Discrete Mathematics
Volume 35, Number 4, 2021

                Ron Aharoni and   
              Joseph Briggs and   
                Ron Holzman and   
                    Zilin Jiang   Rainbow Odd Cycles . . . . . . . . . . . 2293--2303
       Oliver Weller-Davies and   
                 Mike Steel and   
                     Jotun Hein   Combinatorics of Polymer-Based Models of
                                  Early Metabolism . . . . . . . . . . . . 2304--2316
                    Jun Gao and   
                 Qingyi Huo and   
                         Jie Ma   A Strengthening on Odd Cycles in Graphs
                                  of Given Chromatic Number  . . . . . . . 2317--2327
     Bernard Lidický and   
                Florian Pfender   Semidefinite Programming and Ramsey
                                  Numbers  . . . . . . . . . . . . . . . . 2328--2344
        S. Thomas McCormick and   
                Britta Peis and   
        Robert Scheidweiler and   
                Frank Vallentin   A Polynomial Time Algorithm for Solving
                                  the Closest Vector Problem in Zonotopal
                                  Lattices . . . . . . . . . . . . . . . . 2345--2356
           Maria Chudnovsky and   
                 Jason King and   
          Micha\l Pilipczuk and   
         Pawe\l Rz\kazewski and   
                  Sophie Spirkl   Finding Large $H$-Colorable Subgraphs in
                                  Hereditary Graph Classes . . . . . . . . 2357--2386
          Bart M. P. Jansen and   
        Marcin L. Pilipczuk and   
           Erik Jan van Leeuwen   A Deterministic Polynomial Kernel for
                                  Odd Cycle Transversal and Vertex
                                  Multiway Cut in Planar Graphs  . . . . . 2387--2429
              Oliver Cooley and   
             Frederik Garbe and   
               Eng Keat Hng and   
                Mihyun Kang and   
Nicolás Sanhueza-Matamala and   
                   Julian Zalla   Longest Paths in Random Hypergraphs  . . 2430--2458
              Nathan Bowler and   
                Joshua Erde and   
             Florian Lehner and   
                       Max Pitz   Bounding the Cop Number of a Graph by
                                  Its Genus  . . . . . . . . . . . . . . . 2459--2489
                Momoko Hayamizu   A Structure Theorem for Rooted Binary
                                  Phylogenetic Networks and Its
                                  Implications for Tree-Based Networks . . 2490--2516
                Dani Kotlar and   
                  Elad Roda and   
                        Ran Ziv   On Sequential Basis Exchange in Matroids 2517--2519
                Xiaofeng Gu and   
                   Wei Meng and   
               Martin Rolek and   
                   Yue Wang and   
                       Gexin Yu   Sufficient Conditions for
                                  $2$-Dimensional Global Rigidity  . . . . 2520--2534
              Hong-Jian Lai and   
                   Lucian Mazza   A Note on Group Colorings and Group
                                  Structure  . . . . . . . . . . . . . . . 2535--2543
                 Jisu Jeong and   
               Eun Jung Kim and   
                    Sang-il Oum   Finding Branch-Decompositions of
                                  Matroids, Hypergraphs, and More  . . . . 2544--2617
     Clément Dallard and   
             Martin Milanic and   
                  Kenny Storgel   Treewidth versus Clique Number. I. Graph
                                  Classes with a Forbidden Structure . . . 2618--2646
                 Logan Crew and   
                  Sophie Spirkl   A Complete Multipartite Basis for the
                                  Chromatic Symmetric Function . . . . . . 2647--2661
Kristóf Bérczi and   
           Naonori Kakimura and   
               Yusuke Kobayashi   Market Pricing for Matroid Rank
                                  Valuations . . . . . . . . . . . . . . . 2662--2678
                  Tzvi Alon and   
                     Nir Halman   Automatic Generation of FPTASes for
                                  Stochastic Monotone Dynamic Programs
                                  Made Easier  . . . . . . . . . . . . . . 2679--2722
             Dennis Clemens and   
              Fabian Hamann and   
              Yannick Mogge and   
                   Olaf Parczyk   Maker-Breaker Games on Randomly
                                  Perturbed Graphs . . . . . . . . . . . . 2723--2748
                Jacob Focke and   
        Leslie Ann Goldberg and   
                  Marc Roth and   
         Stanislav Zivný   Counting Homomorphisms to $ K_4
                                  $-Minor-Free Graphs, Modulo 2  . . . . . 2749--2814
      François Pirot and   
   Jean-Sébastien Sereni   Fractional Chromatic Number, Maximum
                                  Degree, and Girth  . . . . . . . . . . . 2815--2843
    Gabriel Ferreira Barros and   
  Bruno Pasqualotto Cavalar and   
       Yoshiharu Kohayakawa and   
             Tássio Naia   Orientation Ramsey Thresholds for Cycles
                                  and Cliques  . . . . . . . . . . . . . . 2844--2857
                    Bin Han and   
                 Jianxi Mao and   
                     Jiang Zeng   Equidistributions around Special Kinds
                                  of Descents and Excedances . . . . . . . 2858--2879
Nathan Benedetto Proença and   
   Marcel K. de Carli Silva and   
               Gabriel Coutinho   Dual Hoffman Bounds for the Stability
                                  and Chromatic Numbers Based on
                                  Semidefinite Programming . . . . . . . . 2880--2907
                  Carla Michini   Tight Cycle Relaxations for the Cut
                                  Polytope . . . . . . . . . . . . . . . . 2908--2921
        Konrad K. Dabrowski and   
      François Dross and   
                 Jisu Jeong and   
    Mamadou M. Kanté and   
               O-joung Kwon and   
                Sang-il Oum and   
           Daniël Paulusma   Tree Pivot-Minors and Linear Rank-Width  2922--2945
            Tristram Bogart and   
Anna-Lena Horlemann-Trautmann and   
               David Karpuk and   
            Alessandro Neri and   
               Mauricio Velasco   Constructing Partial MDS Codes from
                                  Reducible Algebraic Curves . . . . . . . 2946--2970
                   Bao-Xuan Zhu   Total Positivity from the Exponential
                                  Riordan Arrays . . . . . . . . . . . . . 2971--3003
                 Philip M. Long   Superlinear Integrality Gaps for the
                                  Minimum Majority Problem . . . . . . . . 3004--3016
           Micha\l D\kebski and   
Ma\lgorzata \'Sleszy\'nska-Nowak   $t$-Strong Cliques and the
                                  Degree-Diameter Problem  . . . . . . . . 3017--3029
               Donald K. Wagner   Nonseparating Cocircuits in Binary
                                  Matroids . . . . . . . . . . . . . . . . 3030--3049


SIAM Journal on Discrete Mathematics
Volume 36, Number 1, 2022

      Nikolaos Fountoulakis and   
                 Felix Joos and   
               Guillem Perarnau   Percolation on Random Graphs with a
                                  Fixed Degree Sequence  . . . . . . . . . 1--46
    Ajani De Vas Gunasekara and   
                 Daniel Horsley   An Evans-Style Result for Block Designs  47--63
              Manuel Lafond and   
                 Binhai Zhu and   
                       Peng Zou   Computing the Tandem Duplication
                                  Distance is NP-Hard  . . . . . . . . . . 64--91
           Anthony Harrison and   
            Jenya Soprunova and   
                Patrick Tierney   Lattice Size of Plane Convex Bodies  . . 92--102
                  Jiaxi Nie and   
        Jacques Verstraëte   Ramsey Numbers for Nontrivial Berge
                                  Cycles . . . . . . . . . . . . . . . . . 103--113
            Micha\l Laso\'n and   
              Mateusz Micha\lek   A Note on Seminormality of Cut Polytopes 114--117
        Georgios Amanatidis and   
                   Pieter Kleer   Rapid Mixing of the Switch Markov Chain
                                  for $2$-Class Joint Degree Matrices  . . 118--146
        Pedro Araújo and   
          Simón Piga and   
                Mathias Schacht   Localized Codegree Conditions for Tight
                                  Hamilton Cycles in $3$-Uniform
                                  Hypergraphs  . . . . . . . . . . . . . . 147--169
                 Alex Scott and   
               Paul Seymour and   
                  Sophie Spirkl   Pure Pairs VI: Excluding an Ordered Tree 170--187
          Ágnes Cseh and   
                Yuri Faenza and   
        Telikepalli Kavitha and   
                Vladlena Powers   Understanding Popular Matchings via
                                  Stable Matchings . . . . . . . . . . . . 188--213
               Martin Balko and   
       Máté Vizer   On Ordered Ramsey Numbers of Tripartite
                                  $3$-Uniform Hypergraphs  . . . . . . . . 214--228
                Zichao Dong and   
                        Zhuo Wu   On the Stability of the Graph
                                  Independence Number  . . . . . . . . . . 229--240
                   Zequn Lv and   
                     Mei Lu and   
                       Yi Zhang   Perfect Matching and Hamilton Tight
                                  Cycle Decomposition of Complete
                                  $n$-Balanced $r$-Partite $k$-Uniform
                                  Hypergraphs  . . . . . . . . . . . . . . 241--251
              Sandra Kiefer and   
                   Daniel Neuen   The Power of the Weisfeiler--Leman
                                  Algorithm to Decompose Graphs  . . . . . 252--298
                David J. Aldous   On the Largest Common Subtree of Random
                                  Leaf-Labeled Binary Trees  . . . . . . . 299--314
                Vsevolod F. Lev   Small Doubling in Groups with Moderate
                                  Torsion  . . . . . . . . . . . . . . . . 315--335
           Magnus Bordewich and   
                Simone Linz and   
                 Megan Owen and   
          Katherine St.John and   
             Charles Semple and   
                 Kristina Wicke   On the Maximum Agreement Subtree
                                  Conjecture for Balanced Trees  . . . . . 336--354
          Chien-Chung Huang and   
           Naonori Kakimura and   
               Simon Mauras and   
                 Yuichi Yoshida   Approximability of Monotone Submodular
                                  Function Maximization under Cardinality
                                  and Matroid Constraints in the Streaming
                                  Model  . . . . . . . . . . . . . . . . . 355--382
             Marta Panizzut and   
          Magnus Dehli Vigeland   Tropical Lines on Cubic Surfaces . . . . 383--410
    Mamadou M. Kanté and   
            Christophe Paul and   
          Dimitrios M. Thilikos   A Linear Fixed Parameter Tractable
                                  Algorithm for Connected Pathwidth  . . . 411--435
         Barnabás Janzer   The Generalized Rainbow Turán Problem for
                                  Cycles . . . . . . . . . . . . . . . . . 436--448
               Hongyi Jiang and   
                   Amitabh Basu   Enumerating Integer Points in Polytopes
                                  with Bounded Subdeterminants . . . . . . 449--460
        Gianira N. Alfarano and   
            Martino Borello and   
            Alessandro Neri and   
              Alberto Ravagnani   Three Combinatorial Perspectives on
                                  Minimal Codes  . . . . . . . . . . . . . 461--489
Guillermo Pineda-Villavicencio and   
         Benjamin Schröter   Reconstructibility of Matroid Polytopes  490--508
              Victor Chepoi and   
               Kolja Knauer and   
                Manon Philibert   Ample Completions of Oriented Matroids
                                  and Complexes of Uniform Oriented
                                  Matroids . . . . . . . . . . . . . . . . 509--535
        Pavel Dvorák and   
                 Dusan Knop and   
            Tomás Toufar   Target Set Selection in Dense Graph
                                  Classes  . . . . . . . . . . . . . . . . 536--572
              Paul Balister and   
             Emil Powierski and   
                 Alex Scott and   
                       Jane Tan   A Note on Infinite Antichain Density . . 573--577
  Jòrgen Bang-Jensen and   
            Thomas Schweser and   
               Michael Stiebitz   Digraphs and Variable Degeneracy . . . . 578--595
             Sushmita Gupta and   
              Saket Saurabh and   
                  Meirav Zehavi   On Treewidth and Stable Marriage:
                                  Parameterized Algorithms and Hardness
                                  Results (Complete Characterization)  . . 596--681
         Caitlyn Booms-Peot and   
               Daniel Erman and   
                       Jay Yang   Characteristic Dependence of Syzygies of
                                  Random Monomial Ideals . . . . . . . . . 682--701
               Kenjiro Takazawa   Excluded $t$-Factors in Bipartite
                                  Graphs: Unified Framework for
                                  Nonbipartite Matchings, Restricted
                                  $2$-Matchings, and Matroids  . . . . . . 702--727
                 Yahav Alon and   
            Michael Krivelevich   Hitting Time of Edge Disjoint Hamilton
                                  Cycles in Random Subgraph Processes on
                                  Dense Base Graphs  . . . . . . . . . . . 728--754
            Carol T. Zamfirescu   Regular Graphs with Few Longest Cycles   755--776
Jérémy Lavollée and   
            Konrad J. Swanepoel   Bounding the Number of Edges of
                                  Matchstick Graphs  . . . . . . . . . . . 777--785
                 Zilong Yan and   
                   Yuejian Peng   An Irrational Lagrangian Density of a
                                  Single Hypergraph  . . . . . . . . . . . 786--822
              Nicolas Bitar and   
                 Eric Goles and   
              Pedro Montealegre   Computational Complexity of Biased
                                  Diffusion-Limited Aggregation  . . . . . 823--866

SIAM Journal on Discrete Mathematics
Volume 36, Number 2, 2022

               Karl Däubel   An Improved Upper Bound for the Ring
                                  Loading Problem  . . . . . . . . . . . . 867--887
            M. Levent Dogan and   
      Alperen A. Ergür and   
              Jake D. Mundo and   
               Elias Tsigaridas   The Multivariate Schwartz--Zippel Lemma  888--910
           Akanksha Agrawal and   
            Lawqueen Kanesh and   
              Fahad Panolan and   
            M. S. Ramanujan and   
                  Saket Saurabh   A Fixed-Parameter Tractable Algorithm
                                  for Elimination Distance to Bounded
                                  Degree Graphs  . . . . . . . . . . . . . 911--921
Tomás Masarík and   
           Marcin Pilipczuk and   
         Pawe\l Rz\kazewski and   
                   Manuel Sorge   Constant Congestion Brambles in Directed
                                  Graphs . . . . . . . . . . . . . . . . . 922--938
               Stijn Cambie and   
 Wouter Cames van Batenburg and   
Rémi de Joannis de Verclos and   
                   Ross J. Kang   Maximizing Line Subgraphs of Diameter at
                                  Most $t$ . . . . . . . . . . . . . . . . 939--950
             Grigory Ivanov and   
   Márton Naszódi   A Quantitative Helly-Type Theorem:
                                  Containment in a Homothet  . . . . . . . 951--957
                Esther Ezra and   
                Orit E. Raz and   
               Micha Sharir and   
                    Joshua Zahl   Counting and Cutting Rich Lenses in
                                  Arrangements of Circles  . . . . . . . . 958--974
               Thomas Kahle and   
                Dinh Van Le and   
                 Tim Römer   Invariant Chains in Algebra and Discrete
                                  Geometry . . . . . . . . . . . . . . . . 975--999
                Guorong Gao and   
                   An Chang and   
                       Yuan Hou   Spectral Radius on Linear $r$-Graphs
                                  without Expanded $ K_{r + 1} $ . . . . . 1000--1011
                 Ahmad Abdi and   
Gérard Cornuéjols and   
            Bertrand Guenin and   
           Levent Tunçel   Clean Clutters and Dyadic Fractional
                                  Packings . . . . . . . . . . . . . . . . 1012--1037
            Candida Bowtell and   
                    Joseph Hyde   A Degree Sequence Strengthening of the
                                  Vertex Degree Threshold for a Perfect
                                  Matching in $3$-Uniform Hypergraphs  . . 1038--1063
            Igor E. Shparlinski   Multiplicative Properties of Hilbert
                                  Cubes  . . . . . . . . . . . . . . . . . 1064--1070
                   Anup Rao and   
                Amir Yehudayoff   Anticoncentration and the Exact
                                  Gap-Hamming Problem  . . . . . . . . . . 1071--1092
               Tongseok Lim and   
               Robert J. McCann   On the Cardinality of Sets in $ R^d $
                                  Obeying a Slightly Obtuse Angle Bound    1093--1101
               Takehiro Ito and   
           Naonori Kakimura and   
           Naoyuki Kamiyama and   
           Yusuke Kobayashi and   
                 Yoshio Okamoto   Shortest Reconfiguration of Perfect
                                  Matchings via Alternating Cycles . . . . 1102--1123
                Ewan Davies and   
            Freddie Illingworth   The $ \chi $-Ramsey Problem for
                                  Triangle-Free Graphs . . . . . . . . . . 1124--1134
Péter Pál Pach and   
        Richárd Palincza   Sets Avoiding Six-Term Arithmetic
                                  Progressions in $ \mathbb {Z}_6^n $ are
                                  Exponentially Small  . . . . . . . . . . 1135--1142
      Maria Elisa Fernandes and   
      Claudio Alexandre Piedade   The Degrees of Regular Polytopes of Type
                                  $ [4, 4, 4] $  . . . . . . . . . . . . . 1143--1155
                Xiaohui Bei and   
             Ayumi Igarashi and   
                 Xinhang Lu and   
               Warut Suksompong   The Price of Connectivity in Fair
                                  Division . . . . . . . . . . . . . . . . 1156--1186
              Oliver Janzer and   
           Abhishek Methuku and   
Zoltán Lóránt Nagy   On the Turán Number of the Blow-Up of the
                                  Hexagon  . . . . . . . . . . . . . . . . 1187--1199
                Dan Bergren and   
               Eduard Eiben and   
              Robert Ganian and   
                      Iyad Kanj   On Covering Segments with Unit Intervals 1200--1230
                James Oxley and   
                     Zach Walsh   $2$-Modular Matrices . . . . . . . . . . 1231--1248
           Martin Böhm and   
              Ruben Hoeksma and   
               Nicole Megow and   
           Lukas Nölke and   
                 Bertrand Simon   On Hop-Constrained Steiner Trees in
                                  Tree-Like Metrics  . . . . . . . . . . . 1249--1273
                     Pu Gao and   
              Calum MacRury and   
                 Pawe\l Pra\lat   Perfect Matchings in the Semirandom
                                  Graph Process  . . . . . . . . . . . . . 1274--1290
           Michaela Coleman and   
          Anton Dochtermann and   
               Nathan Geist and   
                        Suho Oh   Completing and Extending Shellings of
                                  Vertex Decomposable Complexes  . . . . . 1291--1305
           Amin Coja-Oghlan and   
              Philipp Loick and   
     Balázs F. Mezei and   
              Gregory B. Sorkin   The Ising Antiferromagnet and Max Cut on
                                  Random Regular Graphs  . . . . . . . . . 1306--1342
             Raphael M. Steiner   Disjoint Cycles with Length Constraints
                                  in Digraphs of Large Connectivity or
                                  Large Minimum Degree . . . . . . . . . . 1343--1362
               Viresh Patel and   
                   Fabian Stroh   A Polynomial-Time Algorithm to Determine
                                  (Almost) Hamiltonicity of Dense Regular
                                  Graphs . . . . . . . . . . . . . . . . . 1363--1393
                 Tuan A. Do and   
                Joshua Erde and   
                    Mihyun Kang   Planarity and Genus of Sparse Random
                                  Bipartite Graphs . . . . . . . . . . . . 1394--1415
             Peter Bradshaw and   
Tomás Masarík and   
        Jana Novotná and   
                Ladislav Stacho   Robust Connectivity of Graphs on
                                  Surfaces . . . . . . . . . . . . . . . . 1416--1435
              S. Rasoul Etesami   Online Assortment and Market
                                  Segmentation under Bertrand Competition
                                  with Set-Dependent Revenues  . . . . . . 1436--1466
               Naoyuki Kamiyama   A Matroid Generalization of the
                                  Super-Stable Matching Problem  . . . . . 1467--1482
       József Balogh and   
             Ryan R. Martin and   
      Dániel T. Nagy and   
    Balázs Patkós   On Generalized Turán Results in Height
                                  Two Posets . . . . . . . . . . . . . . . 1483--1495
          On-Hei Solomon Lo and   
                   Jianguo Qian   Hamiltonian Cycles in $4$-Connected
                                  Planar and Projective Planar
                                  Triangulations with Few $4$-Separators   1496--1501

SIAM Journal on Discrete Mathematics
Volume 36, Number 3, 2022

        Simona Boyadzhiyska and   
             Dennis Clemens and   
                  Pranshu Gupta   Minimal Ramsey Graphs with Many Vertices
                                  of Small Degree  . . . . . . . . . . . . 1503--1528
              Michael Elkin and   
                    Ofer Neiman   Lossless Prioritized Embeddings  . . . . 1529--1550
             Luis Montejano and   
Jorge L. Ramírez Alfonsín and   
                   Ivan Rasskin   Self-Dual Maps I: Antipodality . . . . . 1551--1566
             Guyslain Naves and   
                 Bruce Shepherd   When Do Gomory--Hu Subtrees Exist? . . . 1567--1585
            Vincent Moulton and   
                     Taoyang Wu   Posets and Spaces of $k$-Noncrossing RNA
                                  Structures . . . . . . . . . . . . . . . 1586--1611
                 Yahav Alon and   
        Michael Krivelevich and   
                 Peleg Michaeli   Spanning Trees at the Connectivity
                                  Threshold  . . . . . . . . . . . . . . . 1612--1626
                      Rong Chen   The $9$-Connected Excluded Minors for
                                  the Class of Quasi-graphic Matroids  . . 1627--1644
               Hongliang Lu and   
                   Yan Wang and   
                    Xingxing Yu   Rainbow Perfect Matchings for
                                  $4$-Uniform Hypergraphs  . . . . . . . . 1645--1662
             Ian M. Wanless and   
                  David R. Wood   A General Framework for Hypergraph
                                  Coloring . . . . . . . . . . . . . . . . 1663--1677
            Adam Blumenthal and   
     Bernard Lidický and   
             Ryan R. Martin and   
               Sergey Norin and   
            Florian Pfender and   
                      Jan Volec   Counterexamples to a Conjecture of
                                  Harris on Hall Ratio . . . . . . . . . . 1678--1686
             Alan M. Frieze and   
              Wesley Pegden and   
                   Tomasz Tkocz   On the Cover Time of the Emerging Giant  1687--1710
               Peter Nelson and   
                Kazuhiro Nomoto   The Structure of $ I_4 $-Free and
                                  Triangle-Free Binary Matroids  . . . . . 1711--1729
                Sylvia Boyd and   
            Joseph Cheriyan and   
            Robert Cummings and   
                Logan Grout and   
          Sharat Ibrahimpur and   
      Zoltán Szigeti and   
                        Lu Wang   A $ \frac {4}{3} $-Approximation
                                  Algorithm for the Minimum $2$-Edge
                                  Connected Multisubgraph Problem in the
                                  Half-Integral Case . . . . . . . . . . . 1730--1747
María A. Hernández Cifre and   
                  Eduardo Lucas   On Discrete LOG-Brunn--Minkowski Type
                                  Inequalities . . . . . . . . . . . . . . 1748--1760
       Rémy Belmonte and   
               Eun Jung Kim and   
             Michael Lampis and   
               Valia Mitsou and   
                    Yota Otachi   Grundy Distinguishes Treewidth from
                                  Pathwidth  . . . . . . . . . . . . . . . 1761--1787
      Margarita Akhmejanova and   
              Maksim Zhukovskii   EMSO(FO$^2$) $0$--$1$ Law Fails for All
                                  Dense Random Graphs  . . . . . . . . . . 1788--1799
        Arpitha P. Bharathi and   
            Monaldo Mastrolilli   Ideal Membership Problem over
                                  $3$-Element CSPs with Dual Discriminator
                                  Polymorphism . . . . . . . . . . . . . . 1800--1822
                 Mengyu Cao and   
                 Benjian Lv and   
               Kaishun Wang and   
                   Sanming Zhou   Nontrivial t -Intersecting Families for
                                  Vector Spaces  . . . . . . . . . . . . . 1823--1847
              Bruno Jartoux and   
               Chaya Keller and   
        Shakhar Smorodinsky and   
                Yelena Yuditsky   On Multicolor Ramsey Numbers and Subset
                                  Coloring of Hypergraphs  . . . . . . . . 1848--1860
             Maximus Redman and   
                Lauren Rose and   
                 Raphael Walker   A Small Maximal Sidon Set in $ \mathbb
                                  {Z}_2^n $  . . . . . . . . . . . . . . . 1861--1867
Umberto Martínez-Peñas   A General Family of MSRD Codes and PMDS
                                  Codes with Smaller Field Sizes from
                                  Extended Moore Matrices  . . . . . . . . 1868--1886
              Victor Campos and   
                 Raul Lopes and   
         Ana Karolinna Maia and   
                     Ignasi Sau   Adapting the Directed Grid Theorem into
                                  an FPT Algorithm . . . . . . . . . . . . 1887--1917
                Martin Henk and   
            Stefan Kuhlmann and   
              Robert Weismantel   On Lattice Width of Lattice-Free
                                  Polyhedra and Height of Hilbert Bases    1918--1942
            Nicolas Fraiman and   
              Lyuben Lichev and   
                 Dieter Mitsche   On the Power of Choice for Boolean
                                  Functions  . . . . . . . . . . . . . . . 1943--1954
          Eva-Maria C. Hols and   
             Stefan Kratsch and   
                Astrid Pieterse   Elimination Distances, Blocking Sets,
                                  and Kernels for Vertex Cover . . . . . . 1955--1990
                   Jiaao Li and   
                Xueliang Li and   
                   Meiling Wang   The Flow Index of Regular Class I Graphs 1991--2003
              Sepehr Hajebi and   
                  Yanjia Li and   
                  Sophie Spirkl   Complexity Dichotomy for
                                  List-$5$-Coloring with a Forbidden
                                  Induced Subgraph . . . . . . . . . . . . 2004--2027
              Debarun Ghosh and   
           Ervin Györi and   
             Ryan R. Martin and   
              Addisu Paulos and   
                   Chuanqi Xiao   Planar Turán Number of the $6$-Cycle  . . 2028--2050
                James Oxley and   
                  Jagdeep Singh   The Smallest Classes of Binary and
                                  Ternary Matroids Closed under Direct
                                  Sums and Complements . . . . . . . . . . 2051--2072
               Peter Frankl and   
          János Pach and   
Dömötör Pálvölgyi   Exchange Properties of Finite
                                  Set-Systems  . . . . . . . . . . . . . . 2073--2081
              Marthe Bonamy and   
             Cyril Gavoille and   
              Micha\l Pilipczuk   Shorter Labeling Schemes for Planar
                                  Graphs . . . . . . . . . . . . . . . . . 2082--2099
               Peter Nelson and   
                     Zach Walsh   The Extremal Function for Excluding
                                  Geometry Minors over Prime Fields  . . . 2100--2120
              Kazuki Matoya and   
                     Taihei Oki   Pfaffian Pairs and Parities: Counting on
                                  Linear Matroid Intersection and Parity
                                  Problems . . . . . . . . . . . . . . . . 2121--2158
            Andreas Galanis and   
         Leslie A. Goldberg and   
         Andres Herrera-Poyatos   The Complexity of Approximating the
                                  Complex-Valued Ising Model on Bounded
                                  Degree Graphs  . . . . . . . . . . . . . 2159--2204
            Micha\l D\kebsk and   
               Marta Piecyk and   
             Pawe\l Rz\kazewski   Faster $3$-Coloring of Small-Diameter
                                  Graphs . . . . . . . . . . . . . . . . . 2205--2224
                   Neil Fan and   
                      Peter Guo   Poincaré Polynomials of Odd Diagram
                                  Classes  . . . . . . . . . . . . . . . . 2225--2237
               Colin Cooper and   
                    Alan Frieze   Rank of the Vertex-Edge Incidence Matrix
                                  of r-Out Hypergraphs . . . . . . . . . . 2238--2257
                    Yan Cao and   
               Guantao Chen and   
             Guangming Jing and   
                  Songling Shan   The Overfullness of Graphs with Small
                                  Minimum Degree and Large Maximum Degree  2258--2270
François Clément and   
                     Thang Pham   Distribution of Distances in Five
                                  Dimensions and Related Problems  . . . . 2271--2281
           Tobias Friedrich and   
         Andreas Göbel and   
           Martin S. Krejca and   
                  Marcus Pappik   A Spectral Independence View on Hard
                                  Spheres via Block Dynamics . . . . . . . 2282--2322
                Yulin Chang and   
                  Huifen Ge and   
                    Jie Han and   
                  Guanghui Wang   Matching of Given Sizes in Hypergraphs   2323--2338
               Mingyang Guo and   
               Hongliang Lu and   
                    Dingjia Mao   A Stability Result on Matchings in
                                  $3$-Uniform Hypergraphs  . . . . . . . . 2339--2351
                 Jungho Ahn and   
              Kevin Hendrey and   
                Donggyu Kim and   
                    Sang-il Oum   Bounds for the Twin-Width of Graphs  . . 2352--2366
        Tibor Jordán and   
             Shin-ichi Tanigawa   Rigidity of Random Subgraphs and
                                  Eigenvalues of Stiffness Matrices  . . . 2367--2392
             Vojtech Dvorak and   
                     Ohad Klein   Probability Mass of Rademacher Sums
                                  Beyond One Standard Deviation  . . . . . 2393--2410
                Sujoy Bhore and   
           Csaba D. Tóth   Euclidean Steiner Spanners: Light and
                                  Sparse . . . . . . . . . . . . . . . . . 2411--2444
                 Ahmad Abdi and   
Gérard Cornuéjols and   
                 Zuzanna Palion   On Dyadic Fractional Packings of T-Joins 2445--2451

SIAM Journal on Discrete Mathematics
Volume 36, Number 4, 2022

            Giacomo Paesani and   
       Daniël Paulusma and   
                Pawe\l Rzazwski   Feedback Vertex Set and Even Cycle
                                  Transversal for $H$-Free Graphs: Finding
                                  Large Block Graphs . . . . . . . . . . . 2453--2472
        Csaba Király and   
András Mihálykó   Globally Rigid Augmentation of Rigid
                                  Graphs . . . . . . . . . . . . . . . . . 2473--2496
            Pierre Aboulker and   
           Guillaume Aubian and   
                Raphael Steiner   Heroes in Orientations of Chordal Graphs 2497--2505
             M. R. Pournaki and   
             M. Poursoltani and   
                   N. Terai and   
                     S. Yassemi   Simplicial Complexes Satisfying Serre's
                                  Condition versus the Ones Which Are
                                  Cohen--Macaulay in a Fixed Codimension   2506--2522
  Zoltán Füredi and   
                        Yi Zhao   Shadows of $3$-Uniform Hypergraphs under
                                  a Minimum Degree Condition . . . . . . . 2523--2533
             Marin Bougeret and   
    György Dósa and   
              Noam Goldberg and   
                   Michael Poss   Constant-Ratio Approximation for Robust
                                  Bin Packing with Budgeted Uncertainty    2534--2552
            Alice L. L. Gao and   
          Matthew H. Y. Xie and   
              Arthur L. B. Yang   The Equivariant Inverse Kazhdan--Lusztig
                                  Polynomials of Uniform Matroids  . . . . 2553--2569
              Yuanqiu Huang and   
           Zhangdong Ouyang and   
                  Fengming Dong   On the Size of Matchings in $1$-Planar
                                  Graph with High Minimum Degree . . . . . 2570--2584
                Rongxing Xu and   
                     Xuding Zhu   The Strong Fractional Choice Number and
                                  the Strong Fractional Paint Number of
                                  Graphs . . . . . . . . . . . . . . . . . 2585--2601
              Bernd Schulze and   
            Hattie Serocold and   
                   Louis Theran   Frameworks with Coordinated Edge Motions 2602--2618
            Florent Foucaud and   
             Tuomo Lehtilä   Revisiting and Improving Upper Bounds
                                  for Identifying Codes  . . . . . . . . . 2619--2634
              Robert Ganian and   
               Eun Jung Kim and   
                 Stefan Szeider   Algorithmic Applications of Tree-Cut
                                  Width  . . . . . . . . . . . . . . . . . 2635--2666
                   Eng Keat Hng   Minimum Degrees for Powers of Paths and
                                  Cycles . . . . . . . . . . . . . . . . . 2667--2736
             Marin Bougeret and   
          Bart M. P. Jansen and   
                     Ignasi Sau   Bridge-Depth Characterizes which
                                  Minor-Closed Structural
                                  Parameterizations of Vertex Cover Admit
                                  a Polynomial Kernel  . . . . . . . . . . 2737--2773
               Bogdan Alecu and   
            Robert Ferguson and   
Mamadou Moustapha Kanté and   
             Vadim V. Lozin and   
             Vincent Vatter and   
                Victor Zamaraev   Letter Graphs and Geometric Grid Classes
                                  of Permutations  . . . . . . . . . . . . 2774--2797
             Tomohiro Koana and   
      Christian Komusiewicz and   
                   Frank Sommer   Exploiting $c$-Closure in Kernelization
                                  Algorithms for Graph Problems  . . . . . 2798--2821
                James Oxley and   
                     Zach Walsh   Small Cocircuits in Minimally Vertically
                                  $4$-Connected Matroids . . . . . . . . . 2822--2829
        Alexander Göke and   
           Jochen Koenemann and   
             Matthias Mnich and   
                        Hao Sun   Hitting Weighted Even Cycles in Planar
                                  Graphs . . . . . . . . . . . . . . . . . 2830--2862
                Dylan Heuer and   
                Jessica Striker   Partial Permutation and Alternating Sign
                                  Matrix Polytopes . . . . . . . . . . . . 2863--2888
     Andrés Fielbaum and   
            Ignacio Morales and   
           José Verschae   A Water-Filling Primal-Dual Algorithm
                                  for Approximating NonLinear Covering
                                  Problems . . . . . . . . . . . . . . . . 2889--2915
            Daniel McGinnis and   
                   Shira Zerbib   Line Transversals in Families of
                                  Connected Sets in the Plane  . . . . . . 2916--2919
Guillermo Pineda-Villavicencio and   
                     David Yost   The Lower Bound Theorem for
                                  $d$-Polytopes with $ 2 d + 1 $ Vertices  2920--2941
            John Haslegrave and   
                     Jie Hu and   
                Jaehoon Kim and   
                   Hong Liu and   
                Bingyu Luan and   
                  Guanghui Wang   Crux and Long Cycles in Graphs . . . . . 2942--2958
                Marcus Schaefer   Hanani--Tutte and Hierarchical Partial
                                  Planarity  . . . . . . . . . . . . . . . 2959--2974
          Elad Aigner-Horev and   
                 Oran Danon and   
                 Dan Hefetz and   
                 Shoham Letzter   Large Rainbow Cliques in Randomly
                                  Perturbed Dense Graphs . . . . . . . . . 2975--2994
Kristóf Bérczi and   
             Matthias Mnich and   
                  Roland Vincze   A 3/2-Approximation for the Metric
                                  Many-Visits Path TSP . . . . . . . . . . 2995--3030
                John Rhodes and   
                 Anne Schilling   Upper Bounds on Mixing Time of Finite
                                  Markov Chains  . . . . . . . . . . . . . 3031--3057


SIAM Journal on Discrete Mathematics
Volume 37, Number 1, 2023

                   Boris Pittel   Expected Number of Induced Subtrees
                                  Shared by Two Independent Copies of a
                                  Random Tree  . . . . . . . . . . . . . . 1--16
                  Andriy Prymak   A New Bound for Hadwiger's Covering
                                  Problem in $ \mathbb {E}^3 $ . . . . . . 17--24
             Anurag Bishnoi and   
        Simona Boyadzhiyska and   
             Dennis Clemens and   
              Pranshu Gupta and   
         Thomas Lesgourgues and   
                 Anita Liebenau   On the Minimum Degree of Minimal Ramsey
                                  Graphs for Cliques Versus Cycles . . . . 25--50
      Debsoumya Chakraborti and   
             Alan M. Frieze and   
                 Mihir Hasabnis   Colorful Hamilton Cycles in Random
                                  Graphs . . . . . . . . . . . . . . . . . 51--64
            Daniele Bartoli and   
                Martino Borello   Small Strong Blocking Sets by
                                  Concatenation  . . . . . . . . . . . . . 65--82
                Mario Huicochea   A Kneser-Type Theorem for Restricted
                                  Sumsets  . . . . . . . . . . . . . . . . 83--93
              Lochlan Brick and   
                     Pu Gao and   
                Angus Southwell   The Threshold of Symmetry in Random
                                  Graphs with Specified Degree Sequences   94--113
               Patrick Chan and   
         Katherine Johnston and   
                Joseph Lent and   
    Alexander Ruys de Perez and   
                      Anne Shiu   Nondegenerate Neural Codes and
                                  Obstructions to Closed-Convexity . . . . 114--145
                Mihyun Kang and   
              Michael Missethan   The Early Evolution of the Random Graph
                                  Process in Planar Graphs and Related
                                  Classes  . . . . . . . . . . . . . . . . 146--162
                J. Cheriyan and   
                R. Cummings and   
                  J. Dippel and   
                         J. Zhu   An Improved Approximation Algorithm for
                                  the Matching Augmentation Problem  . . . 163--190
             Luis Montejano and   
Jorge L. Ramírez Alfonsín and   
            Iván Rasskin   Self-Dual Maps II: Links and Symmetry    191--220
                  Hong Wang and   
                   Yun Wang and   
                        Jin Yan   Disjoint Cycles in a Digraph with
                                  Partial Degree . . . . . . . . . . . . . 221--232
            Svante Linusson and   
             Petter Restadh and   
                     Liam Solus   Greedy Causal Discovery Is Geometric . . 233--252
                  Siyan Liu and   
               Rong-Xia Hao and   
                   Rong Luo and   
                 Cun-Quan Zhang   $5$-Cycle Double Covers, $4$-Flows, and
                                  Catlin Reduction . . . . . . . . . . . . 253--267
              Varun Sivashankar   Extremal Uniquely Resolvable Multisets   268--278
                Kunal Dutta and   
              C. R. Subramanian   On Induced Paths, Holes, and Trees in
                                  Random Graphs  . . . . . . . . . . . . . 279--303
                Duksang Lee and   
                    Sang-il Oum   Intertwining Connectivities for
                                  Vertex-Minors and Pivot-Minors . . . . . 304--314
                   Sabrina Lato   A Spectral Moore Bound for Bipartite
                                  Semiregular Graphs . . . . . . . . . . . 315--331
           Valentin Bartier and   
           Nicolas Bousquet and   
               Carl Feghali and   
              Marc Heinrich and   
             Benjamin Moore and   
            Théo Pierron   Recoloring Planar Graphs of Girth at
                                  Least Five . . . . . . . . . . . . . . . 332--350
              Hiroshi Hirai and   
                   Motoki Ikeda   Node-Connectivity Terminal Backup,
                                  Separately Capacitated Multiflow, and
                                  Discrete Convexity . . . . . . . . . . . 351--378
                  Noga Alon and   
             Anna Gujgiczer and   
   János Körner and   
         Aleksa Milojevi\'c and   
           Gábor Simonyi   Structured Codes of Graphs . . . . . . . 379--403

SIAM Journal on Discrete Mathematics
Volume 37, Number 2, 2023

        Norbert Peyerimhoff and   
                  Marc Roth and   
           Johannes Schmitt and   
                 Jakob Stix and   
              Alina Vdovina and   
                Philip Wellnitz   Parameterized Counting and Cayley Graph
                                  Expanders  . . . . . . . . . . . . . . . 405--486
           Alessio D'Al\`\i and   
    Martina Juhnke-Kubitzke and   
          Daniel Köhne and   
             Lorenzo Venturello   On the Gamma-Vector of Symmetric Edge
                                  Polytopes  . . . . . . . . . . . . . . . 487--515
Arjun Kodagehalli Ramachandra and   
              Karthik Natarajan   Tight Probability Bounds with Pairwise
                                  Independence . . . . . . . . . . . . . . 516--555
                 Rajesh Chitnis   A Tight Lower Bound for Edge-Disjoint
                                  Paths on Planar DAGs . . . . . . . . . . 556--572
                      Sammy Luo   On Connected Components with Many Edges  573--585
                Dmitriy Kunisky   The Discrepancy of Unsatisfiable
                                  Matrices and a Lower Bound for the Komlós
                                  Conjecture Constant  . . . . . . . . . . 586--603
          Quentin Deschamps and   
               Carl Feghali and   
           Frantisek Kardos and   
Clément Legrand-Duchesne and   
            Théo Pierron   Strengthening a Theorem of Meyniel . . . 604--611
           Mahdi Cheraghchi and   
            João Ribeiro   Simple Codes and Sparse Recovery with
                                  Fast Decoding  . . . . . . . . . . . . . 612--631
             Marianne Akian and   
    Stéphane Gaubert and   
                    Yang Qi and   
                     Omar Saadi   Tropical Linear Regression and Mean
                                  Payoff Games: Or, How to Measure the
                                  Distance to Equilibria . . . . . . . . . 632--674
                      Sam Spiro   On $t$-Intersecting Hypergraphs with
                                  Minimum Positive Codegrees . . . . . . . 675--683
               Sarah Allred and   
                 Guoli Ding and   
               Bogdan Oporowski   Unavoidable Induced Subgraphs of Large
                                  $2$-Connected Graphs . . . . . . . . . . 684--698
       Zdenek Dvorák and   
                    Bojan Mohar   On Density of $ \mathbb {Z}_3
                                  $-Flow-Critical Graphs . . . . . . . . . 699--717
            Valeriya Kirova and   
                Arsenii Sagdeev   Two-Colorings of Normed Spaces without
                                  Long Monochromatic Unit Arithmetic
                                  Progressions . . . . . . . . . . . . . . 718--732
              Qinghong Zhao and   
                   Bing Wei and   
                     Haidong Wu   Bonds Intersecting Long Paths in
                                  $k$-Connected Graphs . . . . . . . . . . 733--747
                 Kuan Cheng and   
       Venkatesan Guruswami and   
          Bernhard Haeupler and   
                         Xin Li   Efficient Linear and Affine Codes for
                                  Correcting Insertions/Deletions  . . . . 748--778
   Panagiotis Kanellopoulos and   
    Alexandros A. Voudouris and   
                  Rongsen Zhang   On Discrete Truthful Heterogeneous
                                  Two-Facility Location  . . . . . . . . . 779--799
            David G. Harris and   
                Hsin-Hao Su and   
                      Hoa T. Vu   On the Locality of Nash--Williams Forest
                                  Decomposition and Star-Forest
                                  Decomposition  . . . . . . . . . . . . . 800--830
       Emilia Blåsten and   
            Hiroshi Isozaki and   
               Matti Lassas and   
                     Jinpeng Lu   Inverse Problems for Discrete Heat
                                  Equations and Random Walks for a Class
                                  of Graphs  . . . . . . . . . . . . . . . 831--863
             Gal Kronenberg and   
                  Adva Mond and   
                      Alon Naor   $H$-Games Played on Vertex Sets of
                                  Random Graphs  . . . . . . . . . . . . . 864--916
                  Naidan Ji and   
                        Dong Ye   The Number of Cliques in Graphs Covered
                                  by Long Cycles . . . . . . . . . . . . . 917--924
               Andrii Arman and   
          Vojtech Rödl and   
            Marcelo Tadeu Sales   Colorful Matchings . . . . . . . . . . . 925--950
                 Boris Bukh and   
                  R. Amzi Jeffs   Planar Convex Codes are Decidable  . . . 951--963
        Pierre Bergé and   
             Wassim Bouaziz and   
               Arpad Rimmel and   
                 Joanna Tomasik   On the Parameterized Complexity of
                                  Counting Small-Sized Minimum $ (S, T)
                                  $-Cuts . . . . . . . . . . . . . . . . . 964--996
         Christoph Hertrich and   
               Amitabh Basu and   
             Marco Di Summa and   
                Martin Skutella   Towards Lower Bounds on the Depth of
                                  ReLU Neural Networks . . . . . . . . . . 997--1029
            Carme \`Alvarez and   
   Arnau Messegué Buisan   On the PoA Conjecture: Trees versus
                                  Biconnected Components . . . . . . . . . 1030--1052
          Chien-Chung Huang and   
                    Justin Ward   FPT-Algorithms for the $ \ell $-Matchoid
                                  Problem with a Coverage Objective  . . . 1053--1078
               Anina Gruica and   
          Alberto Ravagnani and   
               John Sheekey and   
               Ferdinando Zullo   Rank-Metric Codes, Semifields, and the
                                  Average Critical Problem . . . . . . . . 1079--1117
         Vladimir Boskovi'c and   
          Balázs Keszegh   Saturation of Ordered Graphs . . . . . . 1118--1141
              Gregory Gutin and   
                     Anders Yeo   Lower Bounds for Maximum Weighted Cut    1142--1161
                 Linyuan Lu and   
               Andrew Meier and   
                     Zhiyu Wang   Anti-Ramsey Number of Edge-Disjoint
                                  Rainbow Spanning Trees in All Graphs . . 1162--1172
       József Balogh and   
     Felix Christian Clemen and   
     Bernard Lidický and   
               Sergey Norin and   
                      Jan Volec   The Spectrum of Triangle-Free Graphs . . 1173--1179
                      Tao Zhang   Fuglede's Conjecture Holds in $ \mathbb
                                  {Z}_p \times \mathbb {Z}_{p^n} $ . . . . 1180--1197
           Frantisek Kardos and   
           Jonathan Narboni and   
              Reza Naserasr and   
               Zhouningxin Wang   Circular $ (4 - \epsilon)$-Coloring of
                                  Some Classes of Signed Graphs  . . . . . 1198--1211
              Nick Brettell and   
             Charles Semple and   
                     Gerry Toft   Cyclic Matroids  . . . . . . . . . . . . 1212--1236
             Xiao-Chuan Liu and   
                        Xu Yang   On the Turán Number of Generalized Theta
                                  Graphs . . . . . . . . . . . . . . . . . 1237--1251
            Carla Groenland and   
               Tom Johnston and   
             Daniel Korandi and   
          Alexander Roberts and   
                 Alex Scott and   
                       Jane Tan   Decomposing Random Permutations into
                                  Order-Isomorphic Subpermutations . . . . 1252--1261
                       Yan Wang   Balanced Subdivisions of a Large Clique
                                  in Graphs with High Average Degree . . . 1262--1274
         Michael A. Henning and   
  Christian Löwenstein and   
                     Anders Yeo   The Tuza--Vestergaard Theorem  . . . . . 1275--1310
Kristóf Bérczi and   
 Tamás Király and   
           Yutaro Yamaguchi and   
                       Yu Yokoi   Matroid Intersection under Restricted
                                  Oracles  . . . . . . . . . . . . . . . . 1311--1330
          Charlotte Knierim and   
          Anders Martinsson and   
                Raphael Steiner   Hat Guessing Numbers of Strongly
                                  Degenerate Graphs  . . . . . . . . . . . 1331--1347
              Akiyoshi Tsuchiya   Cayley Sums and Minkowski Sums of
                                  Lattice Polytopes  . . . . . . . . . . . 1348--1357

SIAM Journal on Discrete Mathematics
Volume 37, Number 3, 2023

            Yury Demidovich and   
            Arkadiy Skorkin and   
              Maksim Zhukovskii   Cycle Saturation in Random Graphs  . . . 1359--1385
             Marcelo Campos and   
            Matthew Coulson and   
                Oriol Serra and   
         Maximilian Wötzel   The Typical Approximate Structure of
                                  Sets with Bounded Sumset . . . . . . . . 1386--1418
                 Tom Bohman and   
                      Emily Zhu   On Multicolor Ramsey Numbers of Triple
                                  System Paths of Length 3 . . . . . . . . 1419--1435
              Rachel Kirsch and   
                Jamie Radcliffe   Many Cliques in Bounded-Degree
                                  Hypergraphs  . . . . . . . . . . . . . . 1436--1456
             Gergely Ambrus and   
  Imre Bárány and   
        Péter Frankl and   
            Dániel Varga   Piercing the Chessboard  . . . . . . . . 1457--1471
                   Samir Shukla   On Vietoris--Rips Complexes (with Scale
                                  3) of Hypercube Graphs . . . . . . . . . 1472--1495
F. E. Brochero Martínez and   
                   A. Lemos and   
               B. K. Moriya and   
                       S. Ribas   The Main Zero-Sum Constants over $ D_{2
                                  n} \times C_2 $  . . . . . . . . . . . . 1496--1508
              Jean Cardinal and   
              Hung P. Hoang and   
              Arturo Merino and   
               Ondrej Micka and   
             Torsten Mütze   Combinatorial Generation via Permutation
                                  Languages. V. Acyclic Orientations . . . 1509--1547
                   Yulai Ma and   
            Davide Mattiolo and   
            Eckhard Steffen and   
                  Isaak H. Wolf   Pairwise Disjoint Perfect Matchings in
                                  $r$-Edge-Connected $r$-Regular Graphs    1548--1565
            Jesper Nederlof and   
          Micha\l Pilipczuk and   
   Celine M. F. Swennenhuis and   
                Karol Wegrzycki   Hamiltonian Cycle Parameterized by
                                  Treedepth in Single Exponential Time and
                                  Polynomial Space . . . . . . . . . . . . 1566--1586
                 Dung M. Ha and   
                    Hieu T. Ngo   Expanders on Matrices over a Finite
                                  Chain Ring, II . . . . . . . . . . . . . 1587--1609
              Tyler Helmuth and   
                 Holden Lee and   
               Will Perkins and   
         Mohan Ravichandran and   
                       Qiang Wu   Approximation Algorithms for the Random
                                  Field Ising Model  . . . . . . . . . . . 1610--1629
                 Braxton Osting   Extremal Graph Realizations and Graph
                                  Laplacian Eigenvalues  . . . . . . . . . 1630--1644
          Xavier Allamigeon and   
    Stéphane Gaubert and   
 Frédéric Meunier   Tropical Complementarity Problems and
                                  Nash Equilibria  . . . . . . . . . . . . 1645--1665
                    Yan Cao and   
               Guantao Chen and   
                 Guoli Ding and   
             Guangming Jing and   
                     Wenan Zang   On Gupta's Codensity Conjecture  . . . . 1666--1673
           Matthias Bentert and   
   André Nichterlein and   
               Malte Renken and   
               Philipp Zschoche   Using a Geometric Lens to Find
                                  $k$-Disjoint Shortest Paths  . . . . . . 1674--1703
                Ron Aharoni and   
                 Eli Berger and   
           Maria Chudnovsky and   
                     He Guo and   
                   Shira Zerbib   Nonuniform Degrees and Rainbow Versions
                                  of the Caccetta--Häggkvist Conjecture . . 1704--1714
            Joseph E. Bonin and   
                     Kevin Long   The Excluded Minors for Three Classes of
                                  $2$-Polymatroids Having Special Types of
                                  Natural Matroids . . . . . . . . . . . . 1715--1737
                 Yangyan Gu and   
               Yiting Jiang and   
              David R. Wood and   
                     Xuding Zhu   Refined List Version of Hadwiger's
                                  Conjecture . . . . . . . . . . . . . . . 1738--1750
            Joseph E. Bonin and   
               Carolyn Chun and   
                      Tara Fife   The Natural Matroid of an Integer
                                  Polymatroid  . . . . . . . . . . . . . . 1751--1770
Kristóf Bérczi and   
Erika R. Bérczi-Kovács and   
              Evelin Szögi   A Dual Approach for Dynamic Pricing in
                                  Multidemand Markets  . . . . . . . . . . 1771--1787
                    Miao Fu and   
                    Fei Xue and   
                 Chuanming Zong   Lower Bounds on Lattice Covering
                                  Densities of Simplices . . . . . . . . . 1788--1804
                  Tao Jiang and   
                 Sean Longbrake   Tree-Degenerate Graphs and Nested
                                  Dependent Random Choice  . . . . . . . . 1805--1817
              Calum MacRury and   
Tomás Masarík and   
                Leilani Pai and   
Xavier Pérez-Giménez   The Phase Transition of Discrepancy in
                                  Random Hypergraphs . . . . . . . . . . . 1818--1841
             Swee Hong Chan and   
                   Igor Pak and   
                   Greta Panova   Effective Poset Inequalities . . . . . . 1842--1880
  José Aliste-Prieto and   
               Anna de Mier and   
              Rosa Orellana and   
             José Zamora   Marked Graphs and the Chromatic
                                  Symmetric Function . . . . . . . . . . . 1881--1919
                Chong Shangguan   Degenerate Turán Densities of Sparse
                                  Hypergraphs II: A Solution to the
                                  Brown--Erd\Hos--Sós Problem for Every
                                  Uniformity . . . . . . . . . . . . . . . 1920--1929
                     Jie Hu and   
                     Hao Li and   
                   Yue Wang and   
                   Donglei Yang   Graph Tilings in Incompatibility Systems 1930--1951
                  Esme Bajo and   
                  Matthias Beck   Boundary $ H^* $-Polynomials of Rational
                                  Polytopes  . . . . . . . . . . . . . . . 1952--1969
               Mingyang Guo and   
               Hongliang Lu and   
                      Xing Peng   Anti-Ramsey Number of Matchings in
                                  $3$-Uniform Hypergraphs  . . . . . . . . 1970--1987
               Eimear Byrne and   
               Giuseppe Cotardo   Tensor Codes and Their Invariants  . . . 1988--2015
           Michael Skotnica and   
                  Martin Tancer   NP-Hardness of Computing PL Geometric
                                  Category in Dimension 2  . . . . . . . . 2016--2029
                  Jian Wang and   
                        Jie You   Extremal Problem for Matchings and
                                  Rainbow Matchings on Direct Products . . 2030--2048
             Wen-Horng Sheu and   
                Biing-Feng Wang   Parameterized Complexity for Finding a
                                  Perfect Phylogeny from Mixed Tumor
                                  Samples  . . . . . . . . . . . . . . . . 2049--2071
                 Sam Adriaensen   A Note on Small Weight Codewords of
                                  Projective Geometric Codes and on the
                                  Smallest Sets of Even Type . . . . . . . 2072--2087
                Peter Dukes and   
              Jonathan Noel and   
                     Abel Romer   Extremal Bounds for $3$-Neighbor
                                  Bootstrap Percolation in Dimensions Two
                                  and Three  . . . . . . . . . . . . . . . 2088--2125
            Farbod Shokrieh and   
                 Cameron Wright   On Torsor Structures on Spanning Trees   2126--2147
           Aniruddha Biswas and   
                  Palash Sarkar   Influence of a Set of Variables on a
                                  Boolean Function . . . . . . . . . . . . 2148--2171
             David Schaller and   
              Marc Hellmuth and   
               Peter F. Stadler   Orientation of Fitch Graphs and
                                  Reconciliation-Free Inference of
                                  Horizontal Gene Transfer in Gene Trees   2172--2207
               Mario Kummer and   
                Büsra Sert   Matroids on Eight Elements with the
                                  Half-Plane Property and Related Concepts 2208--2227
           Sebastian Cioaba and   
           Dheer Noal Desai and   
                   Michael Tait   A Spectral Erd\Hos--Sós Theorem . . . . . 2228--2239

SIAM Journal on Discrete Mathematics
Volume 37, Number 4, 2023

               Esther Galby and   
            Liana Khazaliya and   
           Fionn Mc Inerney and   
             Roohani Sharma and   
              Prafullkumar Tale   Metric Dimension Parameterized by
                                  Feedback Vertex Set and Other Structural
                                  Parameters . . . . . . . . . . . . . . . 2241--2264
          Dániel Gerbner   The Profile Polytope of Nontrivial
                                  Intersecting Families  . . . . . . . . . 2265--2275
              Matias Korman and   
   André van Renssen and   
          Marcel Roeloffzen and   
                   Frank Staals   Kinetic Geodesic Voronoi Diagrams in a
                                  Simple Polygon . . . . . . . . . . . . . 2276--2311
             Paul Jungeblut and   
               Laura Merker and   
               Torsten Ueckerdt   A Sublinear Bound on the Page Number of
                                  Upward Planar Graphs . . . . . . . . . . 2312--2331
           Petr A. Golovach and   
          Giannos Stamoulis and   
          Dimitrios M. Thilikos   Combing a Linkage in an Annulus  . . . . 2332--2364
              Reza Naserasr and   
                    Weiqiang Yu   Packing Signatures in Signed Graphs  . . 2365--2381
                    Xin Ren and   
                 Kohji Yanagawa   Gröbner Bases of Radical Li--Li Type
                                  Ideals Associated with Partitions  . . . 2382--2396


SIAM Review
Volume 39, Number 4, December, 1997

                   Carla Savage   A survey of combinatorial Gray codes . . 605--629