Author index for Volumes 1-10

A

B

C

D

E

F

G

H

I

J

K

L

M

N

O

P

Q

R

S

T

U

V

W

X

Y

Z

• Abdel-Aziz, A. A. (with Alun Morris), Schur Q-functions and spin characters of symmetric groups I
• Achlioptas, Dimitris (with Michael Molloy), Almost all graphs with 2.522 n edges are not 3-colorable
• Adler, Allan, Magic N-Cubes Form a Free Monoid
• Agievich, Sergey, Two-Stage Allocations and the Double Q-Function
• Aguiló, F. (with E. Simó, M. Zaragozá), Optimal Double-Loop Networks with Non-Unit Steps
• Ahlgren, Scott (with Shalosh B. Ekhad, Ken Ono, Doron Zeilberger), A Binomial Coefficient Identity Associated to a Conjecture of Beukers
• Albert, M. H. (with M. D. Atkinson, C. C. Handley, D. A. Holton, W. Stromquist), On Packing Densities of Permutations
• Albert, M.H. (with M.D. Atkinson), Sorting with a Forklift
• Albert, Michael (with Alan Frieze, Bruce Reed), Multicoloured Hamilton Cycles
• Albert, Michael H. (with Richard J. Nowakowski), The Game of End-Nim
• Albertson, Michael O. (with Joan P. Hutchinson), Graph Color Extensions: When Hadwiger's Conjecture and Embeddings Help
• Albertson, Michael O. (with Karen L. Collins), Symmetry Breaking in Graphs
• Aleksanyan, Ara (with Mihran Papikian), On Coset Coverings of Solutions of Homogeneous Cubic Equations over Finite Fields
• Ali, Asad Ali (with William Staton), On Extremal Graphs With No Long Paths
• Allen, E. E., Bitableaux Bases for some Garsia-Haiman Modules and Other Related Modules
• Allouche, Jean-Paul (with James Currie, Jeffrey Shallit), Extremal Infinite Overlap-Free Binary Words
• Alon, N. (with D. J. Kleitman), A purely combinatorial proof of the Hadwiger Debrunner (p,q) Conjecture
• Alon, Noga (with Miklós Ruszinkó), Short Certificates for Tournaments
• Alon, Noga (with Vojtech Rödl, Andrzej Rucinski), Perfect Matchings in $\epsilon$-regular Graphs
• Alon, Noga, Explicit Ramsey graphs and orthonormal labelings.
• Alonso, Laurent (with Raphaël Cerf), The Three Dimensional Polyominoes of Minimal Area
• Alvarez, Jenny (with Miguel Amadis, George Boros, Dagan Karp), An Extension of a Criterion for Unimodality
• Amadis, Miguel (with Jenny Alvarez, George Boros, Dagan Karp), An Extension of a Criterion for Unimodality
• Amdeberhan, Tewodros (with Doron Zeilberger), Hypergeometric series acceleration via the WZ method
• Amdeberhan, Tewodros, Faster and Faster Convergent Series for zeta(3)
• Amdeberhan, Tewodros, A Determinant of the Chudnovskys Generalizing the Elliptic Frobenius-Stickelberger-Cauchy Determinantal Identity
• Andrews, G. E. (with R. Roy), Ramanujan's method in q-series congruences
• Andrews, George E., Pfaff's method (III): Comparison with the WZ method
• Anstee, Richard (with Ron Ferguson, Attila Sali), Small Forbidden Configurations II
• Arratia, Richard, On the Stanley-Wilf Conjecture for the Number of Permutations Avoiding a Given Pattern
• Arthur, David, The Restricted Arc-Width of a Graph
• Assmus, E. F., On 2-ranks of Steiner triple systems
• Athanasiadis, Christos A., On Noncrossing and Nonnesting Partitions for Classical Reflection Groups
• Atkinson, M. D. (with M. H. Albert, C. C. Handley, D. A. Holton, W. Stromquist), On Packing Densities of Permutations
• Atkinson, M. D. (with S. A. Linton, L. A. Walker), Priority Queues and Multisets
• Atkinson, M.D. (with M.H. Albert), Sorting with a Forklift
• Atkinson, M.D., Permutations which are the Union of an Increasing and a Decreasing Subsequence
• Avidon, Michael, On Primitive 3-smooth Partitions of n
• Axenovich, Maria, A Note on Graph Coloring Extensions and List-Colorings

B

• Babai, L. (with P. J. Cameron), Automorphisms and Enumeration of Switching Classes of Tournaments
• Balasubramanian, R. (with K. Soundararajan), Maximal Sets of Integers with Distinct Divisors
• Banakh, T. (with O. Verbitsky, Ya. Vorobets), A Ramsey Treatment of Symmetry
• Bandlow, Jason (with Kendra Killpatrick), An Area-to-Inv Bijection Between Dyck Paths and 312-avoiding Permutations
• Barbeau, Ed (with Steve Tanny), On a Strange Recursion of Golomb
• Barbeau, Edward J. (with John Chew, Stephen Tanny), A Matrix Dynamics Approach to Golomb's Recursion
• Barcelo, Helene (with Robert Maule, Sheila Sundaram), On Counting Permutations by Pairs of Congruence Classes of Major Index
• Barnes, Tiffany M. (with Carla D. Savage), A Recurrence for Counting Graphical Partitions
• Barsky, Daniel (with Michel Carpentier), Polynômes de Jacobi généralisés et intégrales de Selberg
• Barát, János (with Péter Hajnal), The Arc-Width of a Graph
• Beck, Matthias (with Ira M. Gessel, Takao Komatsu), The Polynomial Part of a Restricted Partition Function Related to the Frobenius Problem
• Beck, Matthias, A Closer Look at Lattice Points in Rational Simplices
• Beissinger, Janet S. (with Uri N. Peled), A note on major sequences and external activity in trees
• Bell, Jason P. (with Edward A. Bender, Peter J. Cameron, L. Bruce Richmond), Asymptotics for the Probability of Connectedness and the Distribution of Number of Components
• Bell, Jason P., When Structures Are Almost Surely Connected
• Bender, Edward A. (with E. Rodney Canfield), The Fraction of Subspaces of GF(q)ⁿ with a Specified Number of Minimal Weight Vectors is Asymptotically Poisson
• Bender, Edward A. (with E. Rodney Canfield), Intersections of Randomly Embedded Sparse Graphs are Poisson
• Bender, Edward A. (with Jason P. Bell, Peter J. Cameron, L. Bruce Richmond), Asymptotics for the Probability of Connectedness and the Distribution of Number of Components
• Bender, Edward A. (with L. Bruce Richmond), Admissible Functions and Asymptotics for Labelled Structures by Number of Components
• Bender, Edward A. (with L. Bruce Richmond), A Multivariate Lagrange Inversion Formula for Asymptotic Calculations
• Bender, Edward A. (with L. Bruce Richmond), Multivariate Asymptotics for Products of Large Powers with Applications to Lagrange Inversion
• Bender, Edward A. (with S. Gill Williamson), Periodic Sorting Using Minimum Delay, Recursively Constructed Merging Networks
• Bender, Edward A. (with Zhicheng Gao, Nicholas C. Wormald), The Number of Labeled 2-Connected Planar Graphs
• Bender, Edward A. (with E. Rodney Canfield, L. Bruce Richmond, Herbert S. Wilf), A Discontinuity in the Distribution of Fixed Point Sums
• Bender, Edward A. (with William J. Helton, L. Bruce Richmond), Asymptotics of Permutations with Nearly Periodic Patterns of Rises and Falls
• Bending, T. D. (with D. Fon-Der-Flaass), Crooked Functions, Bent Functions, and Distance Regular Graphs
• Benjamin, Arthur T. (with Matthew T. Fluet, Mark L. Huber), Optimal Token Allocations in Solitaire Knock 'm Down
• Bhat, Girish S. (with Carla D. Savage), Balanced Gray Codes
• Biane, P., Parking Functions of Types A and B
• Biggs, Norman, Constructions for Cubic Graphs with Large Girth
• Björner, Anders (with Francesco Brenti), Affine permutations of type A
• Björner, Anders (with Francesco Brenti), An Improved Tableau Criterion for Bruhat Order
• Blass, Andreas, Homotopy and Homology of Finite Lattices
• Bohman, Tom (with Alan Frieze, Miklós Ruszinkó, Lubos Thoma), Note on Sparse Random Graphs and Cover Graphs
• Bohman, Tom (with Colin Cooper, Alan Frieze), Min-Wise Independent Linear Permutations
• Bohman, Tom (with Ron Holzman, Dan Kleitman), Six Lonely Runners
• Bohman, Tom, A Construction for Sets of Integers with Distinct Subset Sums
• Bohman, Tom (with Colin Cooper, Alan Frieze, Ryan Martin, Miklós Ruszinkó), On Randomly Generated Intersecting Hypergraphs
• Böhme, Thomas (with Bojan Mohar), Domination, Packing and Excluded Minors
• Boll, David W. (with Jerry Donovan, Ronald L. Graham, Boris D. Lubachevsky), Improving Dense Packings of Equal Disks in a Square
• Bollobás, Béla (with Oliver Riordan), Constrained Graph Processes
• Bóna, Miklós (with Daniel A. Spielman), An Infinite Antichain of Permutations
• Bóna, Miklós, The Permutation Classes Equinumerous to the Smooth Class
• Bóna, Miklós, A Survey of Stack-Sorting Disciplines
• Bonato, Anthony (with W. H. Holzmann, Hadi Kharaghani), Hadamard Matrices and Strongly Regular Graphs with the 3-e.c. Adjacency Property
• Borodin, Alexei (with Grigori Olshanski), Harmonic Functions on Multiplicative Graphs and Interpolation Polynomials
• Borodin, Alexei, Longest Increasing Subsequences of Random Colored Permutations
• Boros, George (with Jenny Alvarez, Miguel Amadis, Dagan Karp), An Extension of a Criterion for Unimodality
• Boros, George (with Victor H. Moll), A Criterion for Unimodality
• Borwein, J. M. (with D. M. Bradley, D. J. Broadhurst), Evaluations of k-fold Euler/Zagier sums: a compendium of results for arbitrary k
• Borwein, Jonathan M. (with David M. Bradley, David J. Broadhurst, Petr Lisonek), Combinatorial Aspects of Multiple Zeta Values
• Borwein, Jonathan M. (with Roland Girgensohn), Evaluation of Triple Euler Sums
• Bouchet, André (with Bill Jackson), Parity Systems and the Delta-Matroid Intersection Problem
• Bouchet, André, Multimatroids II. Orthogonality, minors and connectivity
• Bousquet-Mélou, Mireille, Multi-statistic enumeration of two-stack sortable permutations
• Bousquet-Mélou, Mireille, Four Classes of Pattern-Avoiding Permutations Under One Roof: Generating Trees with Two Labels
• Bradley, D. M. (with J. M. Borwein, D. J. Broadhurst), Evaluations of k-fold Euler/Zagier sums: a compendium of results for arbitrary k
• Bradley, David M. (with Jonathan M. Borwein, David J. Broadhurst, Petr Lisonek), Combinatorial Aspects of Multiple Zeta Values
• Brak, R. (with J. W. Essam), Bicoloured Dyck Paths and the Contact Polynomial for n Non-Intersecting Paths in a Half-Plane Lattice
• Brandt, Stephan (with Gunnar Brinkmann, Thomas Harmuth), All Ramsey Numbers $r(K_3,G)$ For Connected Graphs of Order 9
• Brandt, Stephan (with Tomaz Pisanski), Another Infinite Sequence of Dense Triangle-Free Graphs
• Brankovic, Ljiljana (with Mirka Miller, Ján Plesník, Joe Ryan, Jozef Sirán), A Note on Constructing Large Cayley Graphs of Given Degree and Diameter by Voltage Assignments
• Brankovic, Ljiljana (with Paulette Lieby, Mirka Miller), Flattening Antichains with Respect to the Volume
• Brenti, Francesco (with Anders Björner), Affine permutations of type A
• Brenti, Francesco (with Anders Björner), An Improved Tableau Criterion for Bruhat Order
• Bresar, Bostjan (with Sandi Klavzar, Riste Skrekovski), The Cube Polynomial and its Derivatives: the Case of Median Graphs
• Bressoud, David A., The Borwein conjecture and partitions with prescribed hook differences
• Briggs, Karen S. (with Jeffrey B. Remmel), A p,q-analogue of a Formula of Frobenius
• Brinkmann, Gunnar (with Stephan Brandt, Thomas Harmuth), All Ramsey Numbers $r(K_3,G)$ For Connected Graphs of Order 9
• Britz, Thomas, MacWilliams Identities and Matroid Polynomials
• Broadhurst, D. J. (with J. M. Borwein, D. M. Bradley), Evaluations of k-fold Euler/Zagier sums: a compendium of results for arbitrary k
• Broadhurst, David J. (with Jonathan M. Borwein, David M. Bradley, Petr Lisonek), Combinatorial Aspects of Multiple Zeta Values
• Brodsky, Alex (with Stephane Durocher, Ellen Gethner), The Rectilinear Crossing Number of K₁₀ is 62
• Brualdi, R. A. (with J. Shen), Discrepancy of Matrices of Zeros and Ones
• Brualdi, Richard A. (with Stephen Mellendorf), Two Extremal Problems in Graph Theory
• Bryant, Darryn (with Heather Gavlas, Alan C. H. Ling), Skolem-type Difference Sets for Cycle Systems
• Bultena, Bette (with Frank Ruskey), Transition Restricted Gray Codes
• Bultena, Bette (with Frank Ruskey), Venn Diagrams with Few Vertices
• Burman, Yurii (with Michael Shapiro), Coding Parking Functions by Pairs of Permutations
• Burstein, Alexander (with Toufik Mansour), Words Restricted by Patterns with at Most 2 Distinct Letters
• Burstein, Alexander (with Peter Hästö, Toufik Mansour), Packing Patterns into Words
• Bussel, Frank Van, Relaxed Graceful Labellings of Trees

C

• Caen, D. de, Large Equiangular Sets of Lines in Euclidean Space
• Caen, D. de, A Note on the Ranks of Set-Inclusion Matrices
• Cairns, Grant, Queens on Non-square Tori
• Calkin, N. (with C. Merino, S. Noble, M. Noy), Improved Bounds for the Number of Forests and Acyclic Orientations in the Square Lattice
• Cameron, P. J. (with L. Babai), Automorphisms and Enumeration of Switching Classes of Tournaments
• Cameron, Peter J. (with Dudley Stark), A Prolific Construction of Strongly Regular Graphs with the n-e.c. Property
• Cameron, Peter J. (with Jason P. Bell, Edward A. Bender, L. Bruce Richmond), Asymptotics for the Probability of Connectedness and the Distribution of Number of Components
• Cameron, Peter J., Counting Two-graphs Related to Trees
• Cameron, Peter J., Cycle Index, Weight Enumerator, and Tutte Polynomial
• Cameron, Peter J., Homogeneous Permutations
• Camina, Alan R. (with Susanne Mischke), Line-transitive Automorphism Groups of Linear Spaces
• Campbell, A.E. (with C.H.C. Little), Evolutionary Familes of Sets
• Canfield, E. R., From recursions to asymptotics: on Szekeres' formula for the number of partitions
• Canfield, E. Rodney (with Edward A. Bender), The Fraction of Subspaces of GF(q)ⁿ with a Specified Number of Minimal Weight Vectors is Asymptotically Poisson
• Canfield, E. Rodney (with Edward A. Bender), Intersections of Randomly Embedded Sparse Graphs are Poisson
• Canfield, E. Rodney (with Sylvie Corteel, Carla D. Savage), Durfee Polynomials
• Canfield, E. Rodney, Meet and Join within the Lattice of Set Partitions
• Canfield, E. Rodney (with Edward A. Bender, L. Bruce Richmond, Herbert S. Wilf), A Discontinuity in the Distribution of Fixed Point Sums
• Caragiu, Mihai, On a Class of Constant Weight Codes
• Cariolaro, David (with Gianfranco Cariolaro), Colouring the Petals of a Graph
• Cariolaro, Gianfranco (with David Cariolaro), Colouring the Petals of a Graph
• Caro, Yair (with Cecil Rousseau), Asymptotic Bounds for Bipartite Ramsey Numbers
• Caro, Yair (with Raphael Yuster), Packing Graphs: The packing problem solved
• Caro, Yair (with Raphael Yuster), Efficient Covering Designs of the Complete Graph
• Caro, Yair (with Raphael Yuster), Orthogonal Colorings of Graphs
• Caro, Yair (with Raphael Yuster), A Turan Type Problem Concerning the Powers of the Degrees of a Graph
• Caro, Yair (with Raphael Yuster), The Order of Monochromatic Subgraphs with a Given Minimum Degree
• Carpentier, Michel (with Daniel Barsky), Polynômes de Jacobi généralisés et intégrales de Selberg
• Casselman, Bill, Computation in Coxeter Groups-I. Multiplication
• Caughman, John S. (with Bruce E. Sagan), The Multiplicities of a Dual-thin Q-polynomial Association Scheme
• Cerf, Raphaël (with Laurent Alonso), The Three Dimensional Polyominoes of Minimal Area
• Chapman, Robin, Franklin's Argument Proves an Identity of Zagier
• Charon, Irčne (with Iiro Honkala, Olivier Hudry, Antoine Lobstein), General Bounds for Identifying Codes in Some Infinite Regular Graphs
• Charon, Irčne (with Olivier Hudry, Antoine Lobstein), Identifying Codes with Small Radius in Some Infinite Regular Graphs
• Chassaing, Philippe (with Jean-François Marckert), Parking Functions, Empirical Processes, and the Width of Rooted Labeled Trees
• Chen, William Y. C. (with Yu-Ping Deng, Laura L. M. Yang), Motzkin Paths and Reduced Decompositions for Permutations with Forbidden Patterns
• Chew, John (with Edward J. Barbeau, Stephen Tanny), A Matrix Dynamics Approach to Golomb's Recursion
• Chow, Timothy, A Short Proof of the Rook Reciprocity Theorem
• Chung, F. R. K. (with R. L. Graham), Random walks on generating sets for finite groups
• Chung, Fan (with Ronald Graham, Tom Leighton), Guessing Secrets
• Chung, Fan (with S.-T. Yau), Coverings, Heat Kernels and Spanning Trees
• Chung, Fan R. K. (with John L. Goldwasser), Maximum subsets of (0,1] with no solutions to x+y = kz
• Cigler, Johann, A New Class of q-Fibonacci Polynomials
• Clark, Lane, An Asymptotic Expansion for the Number of Permutations with a Certain Number of Inversions
• Clark, W. Edwin (with Larry A. Dunning), Tight Upper Bounds for the Domination Numbers of Graphs With Given Order and Minimum Degree
• Clark, W. Edwin (with Larry A. Dunning, Stephen Suen), Tight Upper Bounds for the Domination Numbers of Graphs with Given Order and Minimum Degree, II
• Clark, W. Edwin (with Stephen Suen), Inequality Related to Vizing's Conjecture
• Cohen, Gérard (with Iiro Honkala, Antoine Lobstein, Gilles Zémor), New Bounds for Codes Identifying Vertices in Graphs
• Cohen, G. L. (with E. Tonkes), Dartboard Arrangements
• Cohn, Henry (with Robin Pemantle, James Propp), Generating a Random Sink-free Orientation in Quadratic Time
• Cohn, Henry, 2-adic Behavior of Numbers of Domino Tilings
• Colbourn, Charles J. (with Jeffrey H. Dinitz, Alexander Rosa), Bicoloring Steiner Triple Systems
• Collins, Karen L. (with Michael O. Albertson), Symmetry Breaking in Graphs
• Comellas, Francesc (with J. Luis A. Yebra), New Lower Bounds for Heilbronn Numbers
• Compton, Kevin J., A van der Waerden Variant
• Cook, Matthew (with Michael Kleber), Tournament Sequences and Meeussen Sequences
• Cooper, Colin (with Alan Frieze), Multicoloured Hamilton cycles in random graphs; an anti-Ramsey threshold
• Cooper, Colin (with Tom Bohman, Alan Frieze), Min-Wise Independent Linear Permutations
• Cooper, Colin (with Tom Bohman, Alan Frieze, Ryan Martin, Miklós Ruszinkó), On Randomly Generated Intersecting Hypergraphs
• Coppersmith, Don (with James B. Shearer), New Bounds for Union-free Families of Sets
• Corteel, Sylvie (with E. Rodney Canfield, Carla D. Savage), Durfee Polynomials
• Courcelle, B. (with V. Dussaux), Map Genus, Forbidden Maps, and Monadic Second-Order Logic
• Crochemore, Maxime (with Costas S. Iliopoulos, Yoan J. Pinzon), Computing Evolutionary Chains in Musical Sequences
• Cummings, L. J. (with M. Mays), A One-Sided Zimin Construction
• Currie, James (with Jean-Paul Allouche, Jeffrey Shallit), Extremal Infinite Overlap-Free Binary Words
• Currie, James D. (with Jamie Simpson), Non-Repetitive Tilings
• Currie, James D., A Note on Antichains of Words
• Currie, James D., There Are Ternary Circular Square-Free Words of Length n for n >= 18.
• Cusick, Thomas W., Finite Vector Spaces and Certain Lattices
• Czygrinow, Andrzej (with Genghua Fan, Glenn Hurlbert, H. A. Kierstead, William T. Trotter), Spanning Trees of Bounded Degree
• Czygrinow, A. (with B. Nagle), Matrix-Free Proof of a Regularity Characterization

D

• Dalal, Avinash (with Eric Schmutz), Compositions of Random Functions on a Finite Set
• Davenport, Dennis (with Neil Hindman, Dona Strauss), Triangle Free Sets and Arithmetic Progressions - Two Pisier Type Problems
• Davis, Dan, On a tiling scheme from M. C. Escher
• DeLaVina, Ermelinda (with Siemion Fajtlowicz), Ramseyan Properties of Graphs
• Deng, Yu-Ping (with William Y. C. Chen, Laura L. M. Yang), Motzkin Paths and Reduced Decompositions for Permutations with Forbidden Patterns
• Denley, Tristan, The Independence Number of Graphs with Large Odd Girth
• Denham, Graham, Short Generating Functions for some Semigroup Algebras
• Deutsch, Emeric (with A. J. Hildebrand, Herbert S. Wilf), Longest Increasing Subsequences in Pattern-Restricted Permutations
• Develin, Mike, A Complete Categorization of When Generalized Tribonacci Sequences Can Be Avoided by Additive Partitions
• Dinitz, Jeffrey H. (with Charles J. Colbourn, Alexander Rosa), Bicoloring Steiner Triple Systems
• Dinitz, Jeffrey H. (with Douglas R. Stinson, L. Zhu), On the Spectra of Certain Classes of Room Frames
• Dobrynin, V. Y., On the Function "Sandwiched" between and
• Dobson, Edward (with Joy Morris), Toida's Conjecture is True
• Dobson, Edward, Some Non-Normal Cayley Digraphs of the Generalized Quaternion Group of Certain Orders
• Dodunekov, Stefan (with Juriaan Simonis), Codes and Projective Multisets
• Doerr, Benjamin, Linear Discrepancy of Basic Totally Unimodular Matrices
• Dohmen, Klaus, Inclusion-Exclusion and Network Reliability
• Dohmen, Klaus, On Sums Over Partially Ordered Sets
• Domshlak, Carmel, On Recursively Directed Hypercubes
• Donadelli, Jair (with Yoshiharu Kohayakawa), A Density Result for Random Sparse Oriented Graphs and its Relation to a Conjecture of Woodall
• Dong, Xun (with Michelle L. Wachs), Combinatorial Laplacian of the Matching Complex
• Donovan, Jerry (with David W. Boll, Ronald L. Graham, Boris D. Lubachevsky), Improving Dense Packings of Equal Disks in a Square
• Doran, William F., A Plethysm Formula for
• Drisko, Arthur A., Proof of the Alon-Tarsi Conjecture for n=2^rp
• Droms, Carl (with Brigitte Servatius, Herman Servatius), The Structure of Locally Finite Two-Connected Graphs
• Drudge, Keldon, On the Orbits of Singer Groups and Their Subgroups
• Duckworth, W., Minimum Connected Dominating Sets of Random Cubic Graphs
• Dumitriu, Ioana (with Etienne Rassart), Path Counting and Random Matrix Theory
• Dumont, Dominique (with Armand Ramamonjisoa), Grammaire de Ramanujan et arbres de Cayley
• Dunning, Larry A. (with W. Edwin Clark), Tight Upper Bounds for the Domination Numbers of Graphs With Given Order and Minimum Degree
• Dunning, Larry A. (with W. Edwin Clark, Stephen Suen), Tight Upper Bounds for the Domination Numbers of Graphs with Given Order and Minimum Degree, II
• Durocher, Stephane (with Alex Brodsky, Ellen Gethner), The Rectilinear Crossing Number of K₁₀ is 62
• Dussaux, V. (with B. Courcelle), Map Genus, Forbidden Maps, and Monadic Second-Order Logic
• Duval, Art M., Algebraic Shifting and Sequentially Cohen-Macaulay Simplicial Complexes
• Dvorák, Zdenek (with Daniel Král'), On Planar Mixed Hypergraphs

E

• Edel, Yves (with E. M. Rains, N. J. A. Sloane), On Kissing Numbers in Dimensions 32 to 128
• Egecioglu, Ömer (with Timothy Redmond, Charles Ryavec), From a Polynomial Riemann Hypothesis to Alternating Sign Matrices
• Egge, Eric S. (with Toufik Mansour), Permutations Which Avoid 1243 and 2143, Continued Fractions, and Chebyshev Polynomials
• Egge, E. S. (with J. Haglund, K. Killpatrick, D. Kremer), A Schröder Generalization of Haglund's Statistic on Catalan Paths
• Eggleton, Roger B., The Well-Rounded Linear Function
• Ehrenborg, Richard (with Einar Steingrímsson), Playing Nim on a Simplicial Complex
• Eisenkölbl, Theresia, Rhombus Tilings of a Hexagon with Two Triangles Missing on the Symmetry Axis
• Ekhad, Shalosh B. (with Doron Zeilberger), The Number of Solutions of X^2=0 in Triangular Matrices Over GF(q)
• Ekhad, Shalosh B. (with J. E. Majewicz), A short WZ-style proof of Abel's identity (1 p)
• Ekhad, Shalosh B. (with Scott Ahlgren, Ken Ono, Doron Zeilberger), A Binomial Coefficient Identity Associated to a Conjecture of Beukers
• Enomoto, Hikoe (with Gyula O.H. Katona), Pairs of Disjoint q-element Subsets Far from Each Other
• Erdös, Paul (with Gabor N. Sarkozy), On cycles in the coprime graph of integers
• Erdös, Péter L. (with Péter Sziklai, David C. Torney), A Finite Word Poset
• Eriksen, Niklas (with Henrik Eriksson, Kimmo Eriksson), Diagonal Checker-jumping and Eulerian Numbers for Color-signed Permutations
• Eriksson, Henrik (with Kimmo Eriksson), Affine Weyl Groups as Infinite Permutations
• Eriksson, Henrik (with Niklas Eriksen, Kimmo Eriksson), Diagonal Checker-jumping and Eulerian Numbers for Color-signed Permutations
• Eriksson, Henrik, Pebblings
• Eriksson, Kimmo (with Henrik Eriksson), Affine Weyl Groups as Infinite Permutations
• Eriksson, Kimmo (with Niklas Eriksen, Henrik Eriksson), Diagonal Checker-jumping and Eulerian Numbers for Color-signed Permutations
• Eriksson, Kimmo (with Svante Linusson), The size of Fulton's essential set
• Erné, Marcel (with Jobst Heitzig, Jürgen Reinhold), On the Number of Distributive Lattices
• Essam, J. W. (with R. Brak), Bicoloured Dyck Paths and the Contact Polynomial for n Non-Intersecting Paths in a Half-Plane Lattice
• Evdokimov, Sergei (with Ilia Ponomarenko), On Highly Closed Cellular Algebras and Highly Closed Isomorphisms
• Evdokimov, Sergei (with Ilia Ponomarenko), Separability Number and Schurity Number of Coherent Configurations
• Exoo, Geoffrey, A Lower Bound for Schur Numbers and Multicolor Ramsey Numbers
• Exoo, Geoffrey, A Simple Method for Constructing Small Cubic Graphs of Girths 14, 15, and 16
• Exoo, Geoffrey, Some New Ramsey Colorings
• Exoo, Geoffrey, A Small Trivalent Graph of Girth 14

F

• Fajtlowicz, Siemion (with Ermelinda DeLaVina), Ramseyan Properties of Graphs
• Fan, Genghua (with Andrzej Czygrinow, Glenn Hurlbert, H. A. Kierstead, William T. Trotter), Spanning Trees of Bounded Degree
• Farmer, David W., Counting distinct zeros of the Riemann zeta-function.
• Faro, Giovanni Lo (with Lorenzo Milazzo, Antoinette Tripodi), On the Upper and Lower Chromatic Numbers of BSQSs(16)
• Faudree, Jill R. (with Ronald J. Gould, Florian Pfender, Allison Wolf), On k-Ordered Bipartite Graphs
• Fedou, Jean-Marc (with Don Rawlings), More Statistics on Permutation Pairs
• Felsner, Stefan, The Skeleton of a Reduced Word and a Correspondence of Edelman and Greene
• Ferguson, Ron (with Richard Anstee, Attila Sali), Small Forbidden Configurations II
• Ferguson, Thomas S., Another Form of Matrix Nim
• Fiol, M. A., An Eigenvalue Characterization of Antipodal Distance Regular Graphs
• Fiol, M.A., Some Applications of the Proper and Adjacency Polynomials in the Theory of Graph Spectra
• Fiol, M.A., Quasi-Spectral Characterization of Strongly Distance-Regular Graphs
• Fischer, Eldar, Induced Complete h-partite Graphs in Dense Clique-less Graphs
• Fischer, Ilse (with C.H.C. Little), Even Circuits of Prescribed Clockwise Parity
• Flammenkamp, Achim (with Arthur Holshouser, Harold Reiter), Dynamic One-Pile Blocking Nim
• Fleischner, Herbert (with Robert R. Molina, Ken W. Smith, Douglas B. West), A Proof of the Two-path Conjecture
• Fluet, Matthew T. (with Arthur T. Benjamin, Mark L. Huber), Optimal Token Allocations in Solitaire Knock 'm Down
• Foata, Dominique (with Doron Zeilberger), Combinatorial Proofs of Capelli's and Turnbull's identities from Classical Invariant Theory
• Foata, Dominique (with Guo-Niu Han), Calcul basique des permutations signčes, II
• Fon-Der-Flaass, D. (with T. D. Bending), Crooked Functions, Bent Functions, and Distance Regular Graphs
• Fon-Der-Flaass, D., Local equivalence of transversals in matroids
• Fraenkel, Aviezri S. (with R. Jamie Simpson), How Many Squares Must a Binary Sequence Contain?
• Fraenkel, Aviezri S. (with Tamar Seeman, Jamie Simpson), The Subword Complexity of a Two-Parameter Family of Sequences
• Fraenkel, Aviezri S., Combinatorial game theory foundations applied to digraph kernels
• Fraenkel, Aviezri, Even Kernels
• Fredricksen, Harold (with Melvin M. Sweet), Symmetric Sum-Free Partitions and Lower Bounds for Schur Numbers
• Frieze, Alan (with Colin Cooper), Multicoloured Hamilton cycles in random graphs; an anti-Ramsey threshold
• Frieze, Alan (with Michael Albert, Bruce Reed), Multicoloured Hamilton Cycles
• Frieze, Alan (with Miklós Ruszinkó, Lubos Thoma), A Note on Random Minimum Length Spanning Trees
• Frieze, Alan (with Ravi Kannan), A Simple Algorithm for Constructing Szemerédi's Regularity Partition
• Frieze, Alan (with Tom Bohman, Colin Cooper), Min-Wise Independent Linear Permutations
• Frieze, Alan (with Tom Bohman, Miklós Ruszinkó, Lubos Thoma), Note on Sparse Random Graphs and Cover Graphs
• Frieze, Alan, On the Number of Perfect Matchings and Hamilton Cycles in
• Frieze, Alan (with Tom Bohman, Colin Cooper, Ryan Martin, Miklós Ruszinkó), On Randomly Generated Intersecting Hypergraphs
• Fuchs, Aimé (with Giorgio Letta), Le problème du premier chiffre décimal pour les nombres premiers
• Fulmek, Markus (with Michael Kleber), Bijective Proofs for Schur Function Identities which Imply Dodgson's Condensation
• Füredi, Zoltán (with Oleg Pikhurko, Miklós Simonovits), The Turán Density of the Hypergraph {abc,ade,bde,cde}

G

• Galluccio, Anna (with Martin Loebl), On the Theory of Pfaffian Orientations. I. Perfect Matchings and Permanents
• Galluccio, Anna (with Martin Loebl), On the Theory of Pfaffian Orientations. II. T-joins, k-cuts, and Duality of Enumeration.
• Gao, Zhicheng (with Edward A. Bender, Nicholas C. Wormald), The Number of Labeled 2-Connected Planar Graphs
• Garsia, A. M. (with M. Haiman), Some natural bigraded S_n-modules
• Gassko, Irene, Stapled Sequences and Stapling Coverings of Natural Numbers
• Gavlas, Heather (with Darryn Bryant, Alan C. H. Ling), Skolem-type Difference Sets for Cycle Systems
• Gessel, Ira (with Jonathan Weinstein, Herbert S. Wilf), Lattice Walks in Z^d and Permutations with No Long Ascending Subsequences
• Gessel, Ira M. (with Bruce E. Sagan), The Tutte polynomial of a graph, depth-first search, and simplicial complex partitions
• Gessel, Ira M. (with Harald A. Helfgott), Tilings of Diamonds and Hexagons with Defects
• Gessel, Ira M. (with Matthias Beck, Takao Komatsu), The Polynomial Part of a Restricted Partition Function Related to the Frobenius Problem
• Gessel, Ira M., Counting forests by descents and leaves
• Gessel, Ira M., Generating functions and generalized Dedekind sums.
• Gethner, Ellen (with Alex Brodsky, Stephane Durocher), The Rectilinear Crossing Number of K₁₀ is 62
• Gill, Robert, The Action of the Symmetric Group on a Generalized Partition Semilattice
• Girgensohn, Roland (with Jonathan M. Borwein), Evaluation of Triple Euler Sums
• Glaab, Holger (with Alexander Pott), The Hamiltonian p-Median Problem
• Gleiss, Petra M. (with Josef Leydold, Peter F. Stadler), Interchangeability of Relevant Cycles in Graphs
• Godbole, Anant P. (with Ben Lamorte, Erik Jonathan Sandquist), Threshold Functions for the Bipartite Turán property
• Godbole, Anant P. (with Ben Wieland), On the Domination Number of a Random Graph
• Goddyn, Luis (with Pavol Gvozdjak), Binary Gray Codes with Long Bit Runs
• Godsil, C. D., Problems in Algebraic Combinatorics
• Godsil, C. D., Algebraic Matching Theory
• Goldwasser, John L. (with Fan R. K. Chung), Maximum subsets of (0,1] with no solutions to x+y = kz
• Gordon, Daniel M., The Prime Power Conjecture is True for n < 2,000,000
• Gordon, Gary, A beta Invariant for Greedoids and Antimatroids
• Gould, Ronald J. (with Jill R. Faudree, Florian Pfender, Allison Wolf), On k-Ordered Bipartite Graphs
• Grable, David A., On Random Greedy Triangle Packing
• Graham, R. L. (with B. D. Lubachevsky), Dense Packings of Equal Disks in an Equilateral Triangle: from 22 to 34 and Beyond.
• Graham, R. L. (with B. D. Lubachevsky), Repeated Patterns of Dense Packings of Equal Disks in a Square
• Graham, R. L. (with F. R. K. Chung), Random walks on generating sets for finite groups
• Graham, Ronald (with Fan Chung, Tom Leighton), Guessing Secrets
• Graham, Ronald L. (with David W. Boll, Jerry Donovan, Boris D. Lubachevsky), Improving Dense Packings of Equal Disks in a Square
• Granville, Andrew (with J.L. Selfridge), Product of Integers in an Interval, Modulo Squares
• Greig, Malcolm, Some Pairwise Balanced Designs
• Grolmusz, Vince, Low Rank Co-Diagonal Matrices and Ramsey Graphs
• Grolmusz, Vince, Set-Systems with Restricted Multiple Intersections
• Grood, Cheryl, A Specht Module Analog for the Rook Monoid
• Gryshko, Yuliya, Monochrome Symmetric Subsets in 2-Colorings of Groups
• Grytczuk, Jaroslaw, Thue-like Sequences and Rainbow Arithmetic Progressions
• Guo, Victor J. W., The q-Binomial Theorem and two Symmetric q-Identities
• Gvozdjak, Pavol (with Luis Goddyn), Binary Gray Codes with Long Bit Runs
• Gyárfás, András, Fruit Salad

H

• Habsieger, Laurent, Some new lower bounds for ternary covering codes
• Haemers, Willem H., Disconnected Vertex Sets and Equidistant Code Pairs
• Haglund, J. (with E. S. Egge, K. Killpatrick, D. Kremer), A Schröder Generalization of Haglund's Statistic on Catalan Paths
• Hagos, Elias M., The Characteristic Polynomial of a Graph is Reconstructible from the Characteristic Polynomials of its Vertex-Deleted Subgraphs and Their Complements
• Haiman, M. (with A. M. Garsia), Some natural bigraded S_n-modules
• Hajnal, Péter (with János Barát), The Arc-Width of a Graph
• Halldórsson, Magnús M., Online Coloring Known Graphs
• Han, Guo-Niu (with Dominique Foata), Calcul basique des permutations signčes, II
• Han, Guo-Niu, Ordres bipartitionnaires et statistiques sur les mots
• Handley, C. C. (with M. H. Albert, M. D. Atkinson, D. A. Holton, W. Stromquist), On Packing Densities of Permutations
• Hanlon, Phil, A random walk on the rook placements on a Ferrers board
• Harmuth, Thomas (with Stephan Brandt, Gunnar Brinkmann), All Ramsey Numbers $r(K_3,G)$ For Connected Graphs of Order 9
• Hartke, Stephen G. (with Aparna W. Higgins), Maximum Degree Growth of the Iterated Line Graph
• Hästö, Peter A., On Descents in Standard Young Tableaux
• Hästö, Peter A., The Packing Density of Other Layered Permutations
• Hästö, Peter (with Alexander Burstein, Toufik Mansour), Packing Patterns into Words
• Haynes, Teresa W. (with Stephen T. Hedetniemi, Michael A. Henning), Global Defensive Alliances in Graphs
• Hedetniemi, Stephen T. (with Teresa W. Haynes, Michael A. Henning), Global Defensive Alliances in Graphs
• Heitzig, Jobst (with Marcel Erné, Jürgen Reinhold), On the Number of Distributive Lattices
• Helfgott, Harald A. (with Ira M. Gessel), Tilings of Diamonds and Hexagons with Defects
• Helton, William J. (with Edward A. Bender, L. Bruce Richmond), Asymptotics of Permutations with Nearly Periodic Patterns of Rises and Falls
• Henning, Michael A. (with Teresa W. Haynes, Stephen T. Hedetniemi), Global Defensive Alliances in Graphs
• Hersh, Patricia, Deformation of Chains via a Local Symmetric Group Action
• Higgins, Aparna W. (with Stephen G. Hartke), Maximum Degree Growth of the Iterated Line Graph
• Hildebrand, A. J. (with Emeric Deutsch, Herbert S. Wilf), Longest Increasing Subsequences in Pattern-Restricted Permutations
• Hindman, Neil (with Dennis Davenport, Dona Strauss), Triangle Free Sets and Arithmetic Progressions - Two Pisier Type Problems
• Hirschhorn, Michael D. (with James A. Sellers), Two congruences involving 4-cores
• Hlinený, Petr, On the Excluded Minors for Matroids of Branch-Width Three
• Hoffman, Michael E., Derivative Polynomials, Euler Polynomials, and Associated Integer Sequences
• Hoffman, Michael E., An Analogue of Covering Space Theory for Ranked Posets
• Holshouser, Arthur (with Achim Flammenkamp, Harold Reiter), Dynamic One-Pile Blocking Nim
• Holshouser, Arthur (with Harold Reiter), One Pile Nim with Arbitrary Move Function
• Holton, D. A. (with M. H. Albert, M. D. Atkinson, C. C. Handley, W. Stromquist), On Packing Densities of Permutations
• Holzman, Ron (with Tom Bohman, Dan Kleitman), Six Lonely Runners
• Holzmann, W. H. (with Anthony Bonato, Hadi Kharaghani), Hadamard Matrices and Strongly Regular Graphs with the 3-e.c. Adjacency Property
• Honkala, Iiro (with Gérard Cohen, Antoine Lobstein, Gilles Zémor), New Bounds for Codes Identifying Vertices in Graphs
• Honkala, Iiro (with Irčne Charon, Olivier Hudry, Antoine Lobstein), General Bounds for Identifying Codes in Some Infinite Regular Graphs
• Honold, Thomas (with Ivan Landjev), Linear Codes over Finite Chain Rings
• Hough, David S., Descents in Noncrossing Trees
• Howard, Ralph (with Gyula Károlyi, László A. Székely), Towards a Katona Type Proof for the 2-intersecting Erdos-Ko-Rado Theorem
• Hozo, Iztok, The eigenvalues of the Laplacian for the homology of the Lie algebra corresponding to a poset
• Huber, Mark L. (with Arthur T. Benjamin, Matthew T. Fluet), Optimal Token Allocations in Solitaire Knock 'm Down
• Hudry, Olivier (with Irčne Charon, Antoine Lobstein), Identifying Codes with Small Radius in Some Infinite Regular Graphs
• Hudry, Olivier (with Irčne Charon, Iiro Honkala, Antoine Lobstein), General Bounds for Identifying Codes in Some Infinite Regular Graphs
• Hurlbert, Glenn (with Andrzej Czygrinow, Genghua Fan, H. A. Kierstead, William T. Trotter), Spanning Trees of Bounded Degree
• Hutchinson, Joan P. (with Michael O. Albertson), Graph Color Extensions: When Hadwiger's Conjecture and Embeddings Help

I

• Iliopoulos, Costas S. (with Maxime Crochemore, Yoan J. Pinzon), Computing Evolutionary Chains in Musical Sequences
• Ionin, Yury J., New Symmetric Designs from Regular Hadamard Matrices
• Ionin, Yury J., Applying Balanced Generalized Weighing Matrices to Construct Block Designs
• Isaak, Garth, Tournaments as Feedback Arc Sets
• Isaak, Garth, Sum List Coloring 2×n Arrays
• Ito, Hisashi (with Akiko Kato, Zsigmond Nagy, Kenneth Zeger), Zero Capacity Region of Multidimensional Run Length Constraints

J

• Jackson, Bill (with André Bouchet), Parity Systems and the Delta-Matroid Intersection Problem
• Jaggard, Aaron D., Prefix Exchanging and Pattern Avoidance by Involutions
• Jani, Mahendra (with Robert G. Rieper), Continued Fractions and Catalan Problems
• Janson, Svante (with Wojciech Szpankowski), Analysis of an Asymmetric Leader Election Algorithm
• Janson, Svante, Hook Lengths in a Skew Young Diagram
• John, Katherine St. (with Joel H. Spencer), The Tenacity of Zero-One Laws
• John, Katherine St., Limit Probabilities for Random Sparse Bit Strings
• Jones, Albin L., A Short Proof of a Partition Relation for Triples
• Jørgensen, L. K. (with M. Klin), Switching of Edges in Strongly Regular Graphs I: A Family of Partial Difference Sets on 100 Vertices
• Jouanolou, Jean-Pierre, Résultant anisotrope, compléments et applications
• Juvan, Martin (with Bojan Mohar, Robin Thomas), List Edge-Colorings of Series-Parallel Graphs

K

• Kahane, Joseph (with Alexander J. Ryba), The Hexad Game
• Kaiser, Tomas (with Martin Klazar), On Growth Rates of Closed Permutation Classes
• Kannan, Ravi (with Alan Frieze), A Simple Algorithm for Constructing Szemerédi's Regularity Partition
• Kano, Mikio (with Cai Mao-cheng, Yanjun Li), A [k,k+1]-Factor Containing A Given Hamiltonian Cycle
• Kaporis, Alexis C. (with Lefteris M. Kirousis, Yannis C. Stamatiou), A Note on the Non-Colorability Threshold of a Random Graph
• Károlyi, Gyula (with Ralph Howard, László A. Székely), Towards a Katona Type Proof for the 2-intersecting Erdos-Ko-Rado Theorem
• Karp, Dagan (with Jenny Alvarez, Miguel Amadis, George Boros), An Extension of a Criterion for Unimodality
• Kato, Akiko (with Hisashi Ito, Zsigmond Nagy, Kenneth Zeger), Zero Capacity Region of Multidimensional Run Length Constraints
• Katona, Gyula O.H. (with Hikoe Enomoto), Pairs of Disjoint q-element Subsets Far from Each Other
• Kearney, Michael J (with Peter Shiu), Efficient Packing of Unit Squares in a Square
• Keating, Kevin (with J. L. King), Shape tiling
• Kelmans, Alexander (with Dhruv Mubayi, Benny Sudakov), Asymptotically Optimal Tree-Packings in Regular Graphs
• Kempner, Yulia (with Vadim E. Levit), Correspondence between two Antimatroid Algorithmic Characterizations
• Kenyon, Richard W. (with James G. Propp, David B. Wilson), Trees and Matchings
• Kharaghani, H., On the Twin Designs with the Ionin-type Parameters
• Kharaghani, Hadi (with Anthony Bonato, W. H. Holzmann), Hadamard Matrices and Strongly Regular Graphs with the 3-e.c. Adjacency Property
• Kierstead, H. A. (with Andrzej Czygrinow, Genghua Fan, Glenn Hurlbert, William T. Trotter), Spanning Trees of Bounded Degree
• Kierstead, H. A. (with W. T. Trotter), Competitive Colorings of Oriented Graphs
• Killpatrick, Kendra (with Jason Bandlow), An Area-to-Inv Bijection Between Dyck Paths and 312-avoiding Permutations
• Killpatrick, K. (with E. S. Egge, J. Haglund, D. Kremer), A Schröder Generalization of Haglund's Statistic on Catalan Paths
• King, J. L. (with Kevin Keating), Shape tiling
• King, Oliver D., Bounds for DNA Codes with Constant GC-Content
• Kirousis, Lefteris M. (with Alexis C. Kaporis, Yannis C. Stamatiou), A Note on the Non-Colorability Threshold of a Random Graph
• Kirschenhofer, Peter, A note on alternating sums
• Klavzar, Sandi (with Bostjan Bresar, Riste Skrekovski), The Cube Polynomial and its Derivatives: the Case of Median Graphs
• Klazar, Martin, Counting Pattern-free Set Partitions II: Noncrossing and Other Hypergraphs
• Klazar, Martin (with Tomas Kaiser), On Growth Rates of Closed Permutation Classes
• Kleber, Michael (with Markus Fulmek), Bijective Proofs for Schur Function Identities which Imply Dodgson's Condensation
• Kleber, Michael (with Matthew Cook), Tournament Sequences and Meeussen Sequences
• Kleber, Michael, Linearly Independent Products of Rectangularly Complementary Schur Functions
• Kleitman, D. J. (with N. Alon), A purely combinatorial proof of the Hadwiger Debrunner (p,q) Conjecture
• Kleitman, Dan (with Tom Bohman, Ron Holzman), Six Lonely Runners
• Klin, M. (with L. K. Jørgensen), Switching of Edges in Strongly Regular Graphs I: A Family of Partial Difference Sets on 100 Vertices
• Knessl, Charles (with Wojciech Szpankowski), A Note on the Asymptotic Behavior of the Heights in b-Tries for b Large
• Knopfmacher, A. (with A. M. Odlyzko, B. Pittel, L. B. Richmond, D. Stark, G. Szekeres, N. C. Wormald), The Asymptotic Number of Set Partitions with Unequal Block Sizes
• Knopfmacher, Arnold (with Helmut Prodinger), A Simple Card Guessing Game Revisited
• Knuth, Donald E., The Sandwich Theorem
• Knuth, Donald E., Overlapping Pfaffians
• Kobler, Daniel (with André Kündgen), Gaps in the Chromatic Spectrum of Face-Constrained Plane Graphs
• Kohayakawa, Yoshiharu (with Jair Donadelli), A Density Result for Random Sparse Oriented Graphs and its Relation to a Conjecture of Woodall
• Kolountzakis, Mihail, Lattice Tilings by Cubes: Whole, Notched and Extended
• Kolountzakis, Mihail N., Translational Tilings of the Integers with Long Periods
• Komatsu, Takao (with Matthias Beck, Ira M. Gessel), The Polynomial Part of a Restricted Partition Function Related to the Frobenius Problem
• Kostochka, Alexandr, On a Theorem of Erdos, Rubin, and Taylor on Choosability of Complete Bipartite Graphs
• Král', Daniel (with Zdenek Dvorák), On Planar Mixed Hypergraphs
• Krattenhaler, C., Determinant Identities and a Generalization of the Number of Totally Symmetric Self-complementary Plane Partitions
• Krattenthaler, C., Bijective proofs of the hook formulas for the number of standard Young tableaux, ordinary and shifted
• Krattenthaler, C., Bijections for Hook Pair Identities
• Krattenthaler, Christian, A bijective proof of the hook-content formula for super Schur functions and a modified jeu de taquin
• Kremer, D. (with E. S. Egge, J. Haglund, K. Killpatrick), A Schröder Generalization of Haglund's Statistic on Catalan Paths
• Krivelevich, Michael, An Improved Bound on the Minimal Number of Edges in Color-Critical Graphs
• Krivelevich, Michael, Sparse Graphs Usually Have Exponentially Many Optimal Colorings
• Kucherov, Gregory (with Pascal Ochem, Michael Rao), How Many Square Occurrences Must a Binary Sequence Contain?
• Kündgen, André (with Daniel Kobler), Gaps in the Chromatic Spectrum of Face-Constrained Plane Graphs
• Kündgen, André (with Eric Mendelsohn, Vitaly Voloshin), Colouring Planar Mixed Hypergraphs
• Kuperberg, Greg, An Exploration of the Permanent-Determinant Method
• Kuperberg, Greg, Kasteleyn Cokernels

L

• Labelle, Gilbert (with Pierre Leroux), An extension of the exponential formula in enumerative combinatorics
• Laflamme, Claude (with István Szalkai), Counting Simplexes in R³
• Lai, Chunhui, A Lower Bound for the Number of Edges in a Graph Containing No Two Cycles of the Same Length
• Lamorte, Ben (with Anant P. Godbole, Erik Jonathan Sandquist), Threshold Functions for the Bipartite Turán property
• Landjev, Ivan (with Thomas Honold), Linear Codes over Finite Chain Rings
• Lapointe, Luc (with A. Lascoux, J. Morse), Determinantal Expression and Recursion for Jack Polynomials
• Larsen, Michael, The Problem of Kings
• Lascoux, A. (with Luc Lapointe, J. Morse), Determinantal Expression and Recursion for Jack Polynomials
• Lascoux, Alain (with Marcel-Paul Schützenberger), Treillis et bases des groupes de Coxeter
• Lascoux, Alain, About Division by 1
• Lazebnik, F. (with V. A. Ustimenko, A. J. Woldar), New upper bounds on the order of cages
• Lazebnik, Felix (with Jacques Verstraëte), On Hypergraphs of Girth Five
• Leclerc, Bernard (with Jean-Yves Thibon), The Robinson-Schensted correspondence, crystal bases, and the quantum straightening at $q=0$
• Leeuwen, Marc A. A. van, Some Bijective Correspondences Involving Domino Tableaux
• Leeuwen, Marc van, The Robinson-Schensted and Schützenberger algorithms, an elementary approach
• Leighton, Tom (with Fan Chung, Ronald Graham), Guessing Secrets
• Leroux, Pierre (with Gilbert Labelle), An extension of the exponential formula in enumerative combinatorics
• Letta, Giorgio (with Aimé Fuchs), Le problème du premier chiffre décimal pour les nombres premiers
• Lev, Vsevolod F., Restricted set addition in groups, II. A generalization of the Erdös-Heilbronn conjecture
• Levit, Vadim E. (with Yulia Kempner), Correspondence between two Antimatroid Algorithmic Characterizations
• Leydold, Josef (with Peter F. Stadler), Minimal Cycle Bases of Outerplanar Graphs
• Leydold, Josef (with Petra M. Gleiss, Peter F. Stadler), Interchangeability of Relevant Cycles in Graphs
• Li, Yanjun (with Cai Mao-cheng, Mikio Kano), A [k,k+1]-Factor Containing A Given Hamiltonian Cycle
• Lieby, Paulette (with Ljiljana Brankovic, Mirka Miller), Flattening Antichains with Respect to the Volume
• Ling, Alan C. H. (with Darryn Bryant, Heather Gavlas), Skolem-type Difference Sets for Cycle Systems
• Linton, S. A. (with M. D. Atkinson, L. A. Walker), Priority Queues and Multisets
• Linusson, Svante (with Kimmo Eriksson), The size of Fulton's essential set
• Lisonek, Petr (with Jonathan M. Borwein, David M. Bradley, David J. Broadhurst), Combinatorial Aspects of Multiple Zeta Values
• Little, C.H.C. (with A.E. Campbell), Evolutionary Familes of Sets
• Little, C.H.C. (with Ilse Fischer), Even Circuits of Prescribed Clockwise Parity
• Lobstein, Antoine (with Gérard Cohen, Iiro Honkala, Gilles Zémor), New Bounds for Codes Identifying Vertices in Graphs
• Lobstein, Antoine (with Irčne Charon, Iiro Honkala, Olivier Hudry), General Bounds for Identifying Codes in Some Infinite Regular Graphs
• Lobstein, Antoine (with Irčne Charon, Olivier Hudry), Identifying Codes with Small Radius in Some Infinite Regular Graphs
• Loebbing, Martin (with Ingo Wegener), The Number of Knight's Tours Equals 33,439,123,484,294 --- Counting with Binary Decision Diagrams
• Loebl, Martin (with Anna Galluccio), On the Theory of Pfaffian Orientations. I. Perfect Matchings and Permanents
• Loebl, Martin (with Anna Galluccio), On the Theory of Pfaffian Orientations. II. T-joins, k-cuts, and Duality of Enumeration.
• Loebl, Martin, On the Dimer Problem and the Ising Problem in Finite 3-dimensional Lattices
• Lovasz, Laszlo (with Peter Winkler), Exact Mixing in an Unknown Markov Chain
• Lubachevsky, B. D. (with R. L. Graham), Dense Packings of Equal Disks in an Equilateral Triangle: from 22 to 34 and Beyond.
• Lubachevsky, B. D. (with R. L. Graham), Repeated Patterns of Dense Packings of Equal Disks in a Square
• Lubachevsky, Boris D. (with David W. Boll, Jerry Donovan, Ronald L. Graham), Improving Dense Packings of Equal Disks in a Square
• Luczak, Tomasz, On Ramsey Minimal Graphs

M

• Mackenzie-Fleming, K., An infinite Family of Non-embeddable Hadamard Designs
• Maire, Frederic, On the Shadow of Squashed Families of k-sets
• Majewicz, J. E. (with Shalosh B. Ekhad), A short WZ-style proof of Abel's identity (1 p)
• Mansour, Toufik (with Alek Vainshtein), Restricted Permutations, Continued Fractions, and Chebyshev Polynomials
• Mansour, Toufik (with Alexander Burstein), Words Restricted by Patterns with at Most 2 Distinct Letters
• Mansour, Toufik (with Eric S. Egge), Permutations Which Avoid 1243 and 2143, Continued Fractions, and Chebyshev Polynomials
• Mansour, Toufik (with Zvezdelina Stankova), 321-Polygon-Avoiding Permutations and Chebyshev Polynomials
• Mansour, Toufik (with Alexander Burstein, Peter Hästö), Packing Patterns into Words
• Mao-cheng, Cai (with Yanjun Li, Mikio Kano), A [k,k+1]-Factor Containing A Given Hamiltonian Cycle
• Marckert, Jean-François (with Philippe Chassaing), Parking Functions, Empirical Processes, and the Width of Rooted Labeled Trees
• Marinov, Darko (with Rados Radoicic), Counting 1324-Avoiding Permutations
• Martin, Nigel (with Richard Stong), Permutation Separations and Complete Bipartite Factorisations of K_{n,n}
• Martin, Ryan (with Tom Bohman, Colin Cooper, Alan Frieze, Miklós Ruszinkó), On Randomly Generated Intersecting Hypergraphs
• Martinez, Conrado (with Alois Panholzer, Helmut Prodinger), On the Number of Descendants and Ascendants in Random Search Trees
• Maule, Robert (with Helene Barcelo, Sheila Sundaram), On Counting Permutations by Pairs of Congruence Classes of Major Index
• Mavron, V. C., A Construction Method for Complete Sets of Mutually Orthogonal Frequency Squares
• Mavron, V. C., Frequency Squares and Affine Designs
• Mays, M. (with L. J. Cummings), A One-Sided Zimin Construction
• McCutcheon, Randall, Two New Extensions of the Hales-Jewett Theorem
• McKay, B. D. (with I. M. Wanless), Maximising the Permanent of (0,1)-Matrices and the Number of Extensions of Latin Rectangles
• McKay, Brendan D. (with Eric Rogoyski), Latin Squares of Order 10
• McKee, Terry A., The Neighborhood Characteristic Parameter for Graphs
• McKerihan, Mark D., Matrices connected with Brauer's centralizer algebras
• McShine, Lisa, Random Sampling of Labeled Tournaments
• Melissen, J. B. M. (with P. C. Schuur), Improved Coverings of a Square with Six and Eight Equal Circles
• Mellendorf, Stephen (with Richard A. Brualdi), Two Extremal Problems in Graph Theory
• Mendelsohn, E. (with G. Quattrocchi), Resolving Triple Systems into Regular Configurations
• Mendelsohn, Eric (with André Kündgen, Vitaly Voloshin), Colouring Planar Mixed Hypergraphs
• Merino, C. (with N. Calkin, S. Noble, M. Noy), Improved Bounds for the Number of Forests and Acyclic Orientations in the Square Lattice
• Milazzo, Lorenzo (with Giovanni Lo Faro, Antoinette Tripodi), On the Upper and Lower Chromatic Numbers of BSQSs(16)
• Miller, Mirka (with Ljiljana Brankovic, Ján Plesník, Joe Ryan, Jozef Sirán), A Note on Constructing Large Cayley Graphs of Given Degree and Diameter by Voltage Assignments
• Miller, Mirka (with Ljiljana Brankovic, Paulette Lieby), Flattening Antichains with Respect to the Volume
• Milson, R., Composition Sum Identities Related to the Distribution of Coordinate Values in a Discrete Simplex.
• Mischke, Susanne (with Alan R. Camina), Line-transitive Automorphism Groups of Linear Spaces
• Mohar, Bojan (with Martin Juvan, Robin Thomas), List Edge-Colorings of Series-Parallel Graphs
• Mohar, Bojan (with Riste Skrekovski), The Grötzsch Theorem for the Hypergraph of Maximal Cliques
• Mohar, Bojan (with Riste Skrekovski), Nowhere-zero k-flows of Supergraphs
• Mohar, Bojan (with Thomas Böhme), Domination, Packing and Excluded Minors
• Molina, Robert R. (with Herbert Fleischner, Ken W. Smith, Douglas B. West), A Proof of the Two-path Conjecture
• Moll, Victor H. (with George Boros), A Criterion for Unimodality
• Molloy, Michael (with Bruce Reed), Critical Subgraphs of a Random Graph
• Molloy, Michael (with Dimitris Achlioptas), Almost all graphs with 2.522 n edges are not 3-colorable
• Morris, Alun (with A. A. Abdel-Aziz), Schur Q-functions and spin characters of symmetric groups I
• Morris, Ifor (with Christopher D. Wensley), Enumeration by Stabilizer Class of Patterns with Local Restrictions
• Morris, Joy (with Edward Dobson), Toida's Conjecture is True
• Morse, J. (with Luc Lapointe, A. Lascoux), Determinantal Expression and Recursion for Jack Polynomials
• Mubayi, Dhruv (with Alexander Kelmans, Benny Sudakov), Asymptotically Optimal Tree-Packings in Regular Graphs
• Mubayi, Dhruv, Generalizing the Ramsey Problem through Diameter
• Mubayi, Dhruv (with Yi Zhao), On a Two-Sided Turan Problem
• Mubayi, Dhruv, On Hypergraphs with Every Four Points Spanning at Most Two Triples
• Murphy, Maximillian M. (with Vincent R. Vatter), Profile Classes and Partial Well-Order for Permutations
• Muzychuk, Mikhail E. (with Gottfried Tinhofer), Recognizing Circulant Graphs of Prime Order in Polynomial Time
• Muzychuk, Mikhail E. (with Gottfried Tinhofer), Recognizing Circulant Graphs in Polynomial Time: An Application of Association Schemes
• Myers, Joseph Samuel, The Minimum Number of Monotone Subsequences

N

• Nagle, B. (with A. Czygrinow), Matrix-Free Proof of a Regularity Characterization
• Nagy, Zsigmond (with Hisashi Ito, Akiko Kato, Kenneth Zeger), Zero Capacity Region of Multidimensional Run Length Constraints
• Nahas, Nagi H., On the Crossing Number of K_{m,n}
• Nedialkov, Evgeni (with Nedyalko Nenov), Computation of the Vertex Folkman Numbers F(2,2,2,4;6) and F(2,3,4;6)
• Nenov, Nedyalko (with Evgeni Nedialkov), Computation of the Vertex Folkman Numbers F(2,2,2,4;6) and F(2,3,4;6)
• Nesetril, J. (with E. Sopena), On the Oriented Game Chromatic Number
• Nicol, John W., A Fibonacci-like Sequence of Composite Numbers
• Niederhausen, Heinrich, Lattice Paths Between Diagonal Boundaries
• Niederhausen, Heinrich, Catalan Traffic at the Beach
• Niessen, Thomas, How to Find Overfull Subgraphs in Graphs with Large Maximum Degree, II
• Noble, S. (with N. Calkin, C. Merino, M. Noy), Improved Bounds for the Number of Forests and Acyclic Orientations in the Square Lattice
• Nowakowski, Richard J. (with Michael H. Albert), The Game of End-Nim
• Noy, M. (with N. Calkin, C. Merino, S. Noble), Improved Bounds for the Number of Forests and Acyclic Orientations in the Square Lattice

O

• Ochem, Pascal (with Gregory Kucherov, Michael Rao), How Many Square Occurrences Must a Binary Sequence Contain?
• Odlyzko, A. M. (with A. Knopfmacher, B. Pittel, L. B. Richmond, D. Stark, G. Szekeres, N. C. Wormald), The Asymptotic Number of Set Partitions with Unequal Block Sizes
• Odlyzko, A. M. (with J. B. Shearer, R. Siders), Monotonic subsequences in dimensions higher than one
• Olshanski, Grigori (with Alexei Borodin), Harmonic Functions on Multiplicative Graphs and Interpolation Polynomials
• Olsson, Jørn B., Regular Character Tables of Symmetric Groups
• Ono, Ken (with Scott Ahlgren, Shalosh B. Ekhad, Doron Zeilberger), A Binomial Coefficient Identity Associated to a Conjecture of Beukers
• Östergĺrd, Patric R. J. (with Mattias Svanström), Ternary Constant Weight Codes
• Östergĺrd, Patric R. J. (with William D. Weakley), Values of Domination Numbers of the Queen's Graph

P

• Pachter, Lior, Combinatorial Approaches and Conjectures for 2-Divisibility Problems Concerning Domino Tilings of Polyominoes
• Panholzer, Alois (with Conrado Martinez, Helmut Prodinger), On the Number of Descendants and Ascendants in Random Search Trees
• Papi, Paolo, Affine Permutations and Inversion Multigraphs
• Papikian, Mihran (with Ara Aleksanyan), On Coset Coverings of Solutions of Homogeneous Cubic Equations over Finite Fields
• Parekh, Ojas, Forestation in Hypergraphs: Linear k-Trees
• Paule, Peter, Short and Easy Computer Proofs of the Rogers-Ramanujan Identities and of Identities of Similar Type
• Peled, Uri N. (with Janet S. Beissinger), A note on major sequences and external activity in trees
• Peled, Uri N. (with Julin Wu), For Which Graphs Does Every Edge Belong to Exactly Two Chordless Cycles?
• Pemantle, Robin (with Henry Cohn, James Propp), Generating a Random Sink-free Orientation in Quadratic Time
• Peng, Yuejian (with Vojtech Rodl, Andrzej Rucinski), Holes in Graphs
• Pergola, E. (with R. Pinzani), A Combinatorial Interpretation of the Area of Schröder Paths
• Petkovsek, Marko (with Herbert S. Wilf), A high-tech proof of the Mills-Robbins-Rumsey determinant formula
• Petkovsek, Marko (with Herbert S. Wilf), When can the sum of (1/p)th of the binomial coefficients have closed form?
• Pfender, Florian (with Jill R. Faudree, Ronald J. Gould, Allison Wolf), On k-Ordered Bipartite Graphs
• Pikhurko, Oleg (with Zoltán Füredi, Miklós Simonovits), The Turán Density of the Hypergraph {abc,ade,bde,cde}
• Pinzani, R. (with E. Pergola), A Combinatorial Interpretation of the Area of Schröder Paths
• Pinzon, Yoan J. (with Maxime Crochemore, Costas S. Iliopoulos), Computing Evolutionary Chains in Musical Sequences
• Pisanski, Tomaz (with Stephan Brandt), Another Infinite Sequence of Dense Triangle-Free Graphs
• Pitman, Jane, Sumsets of Finite Beatty Sequences
• Pittel, B. (with A. Knopfmacher, A. M. Odlyzko, L. B. Richmond, D. Stark, G. Szekeres, N. C. Wormald), The Asymptotic Number of Set Partitions with Unequal Block Sizes
• Pittel, Boris, Where the Typical Set Partitions Meet and Join.
• Piwakowski, Konrad, Applying Tabu Search to Determine New Ramsey Graphs
• Plantholt, Michael J. (with Shailesh K. Tipnis), All Regular Multigraphs of Even Order and High Degree Are 1-factorable
• Plesník, Ján (with Ljiljana Brankovic, Mirka Miller, Joe Ryan, Jozef Sirán), A Note on Constructing Large Cayley Graphs of Given Degree and Diameter by Voltage Assignments
• Plummer, Michael D. (with Xiaoya Zha), On the Connectivity of Graphs Embedded in Surfaces II
• Poet, Jeffrey L. (with Bryan L. Shader), Short Score Certificates for Upset Tournaments
• Pönitz, André (with Peter Tittman), Improved Upper Bounds for Self-Avoiding Walks in Z^d
• Ponomarenko, Ilia (with Sergei Evdokimov), On Highly Closed Cellular Algebras and Highly Closed Isomorphisms
• Ponomarenko, Ilia (with Sergei Evdokimov), Separability Number and Schurity Number of Coherent Configurations
• Pott, Alexander (with Holger Glaab), The Hamiltonian p-Median Problem
• Pouyanne, Nicolas, On the Number of Permutations Admitting an m-th Root
• Prodinger, Helmut (with Arnold Knopfmacher), A Simple Card Guessing Game Revisited
• Prodinger, Helmut (with Conrado Martinez, Alois Panholzer), On the Number of Descendants and Ascendants in Random Search Trees
• Prodinger, Helmut, Descendants in Heap Ordered Trees or a Triumph of Computer Algebra
• Propp, James (with Henry Cohn, Robin Pemantle), Generating a Random Sink-free Orientation in Quadratic Time
• Propp, James G. (with Richard W. Kenyon, David B. Wilson), Trees and Matchings
• Propp, James, Generating random elements of finite distributive lattices
• Propp, James, A Reciprocity Theorem for Domino Tilings
• Pruesse, Gara (with Frank Ruskey), The Prism of the Acyclic Orientation Graph is Hamiltonian

Q

• Qian, Jin (with Dijen K. Ray-Chaudhuri), Frankl-Füredi Type Inequalities for Polynomial Semi-lattices
• Quattrocchi, G. (with E. Mendelsohn), Resolving Triple Systems into Regular Configurations
• Quattrocchi, Gaetano, Colouring 4-cycle Systems with Specified Block Colour Patterns: the Case of Embedding P₃-designs
• Quistorff, Jörn, Some Remarks on the Plotkin Bound

R

• Radcliffe, A. J. (with A. D. Scott), Reconstructing Subsets of Reals
• Radoicic, Rados (with Darko Marinov), Counting 1324-Avoiding Permutations
• Rains, E. M. (with Yves Edel, N. J. A. Sloane), On Kissing Numbers in Dimensions 32 to 128
• Rains, E. M., Increasing Subsequences and the Classical Groups
• Ramamonjisoa, Armand (with Dominique Dumont), Grammaire de Ramanujan et arbres de Cayley
• Randrianarivony, Arthur (with Jiang Zeng), Some equidistributioned statistics on Genocchi permutations
• Rao, Michael (with Gregory Kucherov, Pascal Ochem), How Many Square Occurrences Must a Binary Sequence Contain?
• Rassart, Etienne (with Ioana Dumitriu), Path Counting and Random Matrix Theory
• Rawlings, Don (with Jean-Marc Fedou), More Statistics on Permutation Pairs
• Ray-Chaudhuri, Dijen K. (with Jin Qian), Frankl-Füredi Type Inequalities for Polynomial Semi-lattices
• Reading, Nathan, Nim-Regularity of Graphs
• Rechnitzer, A. (with E.J. Janse van Rensburg), Exchange Symmetries in Motzkin Path and Bargraph Models of Copolymer Adsorption
• Redmond, Timothy (with Ömer Egecioglu, Charles Ryavec), From a Polynomial Riemann Hypothesis to Alternating Sign Matrices
• Reed, Bruce (with Michael Albert, Alan Frieze), Multicoloured Hamilton Cycles
• Reed, Bruce (with Michael Molloy), Critical Subgraphs of a Random Graph
• Regev, Amitai (with Anatoly Vershik), Asymptotics of Young Diagrams and Hook Numbers
• Regev, Amitai, Asymptotics of the Number of k-words With An l-descent
• Reifegerste, Astrid, On the Diagram of Schröder Permutations
• Reifegerste, Astrid, A Generalization of Simion-Schmidt's Bijection for Restricted Permutations
• Reiner, Victor, The distribution of descents and length in a Coxeter group
• Reinhold, Jürgen (with Marcel Erné, Jobst Heitzig), On the Number of Distributive Lattices
• Reiter, Harold (with Achim Flammenkamp, Arthur Holshouser), Dynamic One-Pile Blocking Nim
• Reiter, Harold (with Arthur Holshouser), One Pile Nim with Arbitrary Move Function
• Remmel, Jeffery B. (with S. Gill Williamson), Spanning Trees and Function Classes
• Remmel, Jeffrey B. (with Karen S. Briggs), A p,q-analogue of a Formula of Frobenius
• Rensburg, E.J. Janse van (with A. Rechnitzer), Exchange Symmetries in Motzkin Path and Bargraph Models of Copolymer Adsorption
• Richmond, L. B. (with A. Knopfmacher, A. M. Odlyzko, B. Pittel, D. Stark, G. Szekeres, N. C. Wormald), The Asymptotic Number of Set Partitions with Unequal Block Sizes
• Richmond, L. Bruce (with Edward A. Bender), Admissible Functions and Asymptotics for Labelled Structures by Number of Components
• Richmond, L. Bruce (with Edward A. Bender), A Multivariate Lagrange Inversion Formula for Asymptotic Calculations
• Richmond, L. Bruce (with Edward A. Bender), Multivariate Asymptotics for Products of Large Powers with Applications to Lagrange Inversion
• Richmond, L. Bruce (with Jason P. Bell, Edward A. Bender, Peter J. Cameron), Asymptotics for the Probability of Connectedness and the Distribution of Number of Components
• Richmond, L. Bruce (with Edward A. Bender, E. Rodney Canfield, Herbert S. Wilf), A Discontinuity in the Distribution of Fixed Point Sums
• Richmond, L. Bruce (with Edward A. Bender, William J. Helton), Asymptotics of Permutations with Nearly Periodic Patterns of Rises and Falls
• Rieper, Robert G. (with Mahendra Jani), Continued Fractions and Catalan Problems
• Riese, Axel, A Generalization of Gosper's Algorithm to Bibasic Hypergeometric Summation
• Riordan, Oliver (with Béla Bollobás), Constrained Graph Processes
• Roberts, Leigh, A Unified View of Determinantal Expansions for Jack Polynomials
• Robertson, Aaron (with Doron Zeilberger), A 2-Coloring of [1,N] Can Have (1/22)N²+O(N) Monochromatic Schur Triples, But Not less!
• Robertson, Aaron (with Herbert S. Wilf, Doron Zeilberger), Permutation Patterns and Continued Fractions
• Robertson, Aaron, New Lower Bounds for Some Multicolored Ramsey Numbers
• Robertson, Aaron, New Lower Bound Formulas for Multicolored Ramsey Numbers
• Rödl, Vojtech (with Yuejian Peng, Andrzej Rucinski), Holes in Graphs
• Rödl, Vojtech (with Noga Alon, Andrzej Rucinski), Perfect Matchings in $\epsilon$-regular Graphs
• Rogoyski, Eric (with Brendan D. McKay), Latin Squares of Order 10
• Rosa, Alexander (with Charles J. Colbourn, Jeffrey H. Dinitz), Bicoloring Steiner Triple Systems
• Rosendahl, Petri, On the Identification of Vertices Using Cycles
• Rosta, Vera, Note on Gy. Elekes's Conjectures Concerning Unavoidable Patterns in Proper Colorings
• Rousseau, Cecil (with Yair Caro), Asymptotic Bounds for Bipartite Ramsey Numbers
• Roy, R. (with G. E. Andrews), Ramanujan's method in q-series congruences
• Royle, Gordon F., The Rank of a Cograph
• Rubey, Martin, A `Nice' Bijection for a Content Formula for Skew Semistandard Young Tableaux
• Rucinski, Andrzej (with Noga Alon, Vojtech Rödl), Perfect Matchings in $\epsilon$-regular Graphs
• Rucinski, Andrzej (with Yuejian Peng, Vojtech Rodl), Holes in Graphs
• Ruskey, F. (with Joe Sawada), Bent Hamilton Cycles in d-Dimensional Grid Graphs
• Ruskey, Frank (with Bette Bultena), Transition Restricted Gray Codes
• Ruskey, Frank (with Bette Bultena), Venn Diagrams with Few Vertices
• Ruskey, Frank (with Gara Pruesse), The Prism of the Acyclic Orientation Graph is Hamiltonian
• Russell, Alexander (with Ravi Sundaram), A Note on the Asymptotics and Computational Complexity of Graph Distinguishability
• Ruszinkó, Miklós (with Alan Frieze, Lubos Thoma), A Note on Random Minimum Length Spanning Trees
• Ruszinkó, Miklós (with Noga Alon), Short Certificates for Tournaments
• Ruszinkó, Miklós (with Tom Bohman, Alan Frieze, Lubos Thoma), Note on Sparse Random Graphs and Cover Graphs
• Ruszinkó, Miklós (with Tom Bohman, Colin Cooper, Alan Frieze, Ryan Martin), On Randomly Generated Intersecting Hypergraphs
• Ryan, Joe (with Ljiljana Brankovic, Mirka Miller, Ján Plesník, Jozef Sirán), A Note on Constructing Large Cayley Graphs of Given Degree and Diameter by Voltage Assignments
• Ryavec, Charles (with Ömer Egecioglu, Timothy Redmond), From a Polynomial Riemann Hypothesis to Alternating Sign Matrices
• Ryba, Alexander J. (with Joseph Kahane), The Hexad Game

S

• Sagan, Bruce E. (with Ira M. Gessel), The Tutte polynomial of a graph, depth-first search, and simplicial complex partitions
• Sagan, Bruce E. (with John S. Caughman), The Multiplicities of a Dual-thin Q-polynomial Association Scheme
• Sali, Attila (with Richard Anstee, Ron Ferguson), Small Forbidden Configurations II
• Sandquist, Erik Jonathan (with Anant P. Godbole, Ben Lamorte), Threshold Functions for the Bipartite Turán property
• Sárközy, Gábor N. (with Stanley Selkow), On Edge Colorings with at Least q Colors in Every Subset of p Vertices
• Sárközy, Gábor N. (with Paul Erdös), On cycles in the coprime graph of integers
• Savage, Carla D. (with E. Rodney Canfield, Sylvie Corteel), Durfee Polynomials
• Savage, Carla D. (with Girish S. Bhat), Balanced Gray Codes
• Savage, Carla D. (with Tiffany M. Barnes), A Recurrence for Counting Graphical Partitions
• Savitt, David (with Richard P. Stanley), A Note on the Symmetric Powers of the Standard Representation of S
• Sawada, Joe (with F. Ruskey), Bent Hamilton Cycles in d-Dimensional Grid Graphs
• Schützenberger, Marcel-Paul (with Alain Lascoux), Treillis et bases des groupes de Coxeter
• Schaeffer, Gilles, Bijective Census and Random Generation of Eulerian Planar Maps With Prescribed Degrees
• Schanz, Holger (with Uzy Smilansky), Combinatorial Identities from the Spectral Theory of Quantum Graphs
• Schattschneider, Doris, Escher's combinatorial patterns
• Schlosser, Michael, Inversion of Bilateral Basic Hypergeometric Series
• Schmidt, Frank (with Rodica Simion), Some geometric probability problems involving the Eulerian numbers
• Schmutz, Eric (with Avinash Dalal), Compositions of Random Functions on a Finite Set
• Schoen, Tomasz, A Note on the Number of (k,l)-Sum-Free Sets
• Schuur, P. C. (with J. B. M. Melissen), Improved Coverings of a Square with Six and Eight Equal Circles
• Scobee, Matt, On a Conjecture Concerning Dyadic Oriented Matroids
• Scott, A. D. (with A. J. Radcliffe), Reconstructing Subsets of Reals
• Seeman, Tamar (with Aviezri S. Fraenkel, Jamie Simpson), The Subword Complexity of a Two-Parameter Family of Sequences
• Selfridge, J.L. (with Andrew Granville), Product of Integers in an Interval, Modulo Squares
• Selkow, Stanley (with Gábor N. Sárközy), On Edge Colorings with at Least q Colors in Every Subset of p Vertices
• Sellers, James A. (with Michael D. Hirschhorn), Two congruences involving 4-cores
• Servatius, Brigitte (with Carl Droms, Herman Servatius), The Structure of Locally Finite Two-Connected Graphs
• Servatius, Herman (with Carl Droms, Brigitte Servatius), The Structure of Locally Finite Two-Connected Graphs
• Shader, Bryan L. (with Jeffrey L. Poet), Short Score Certificates for Upset Tournaments
• Shallit, Jeffrey (with Jean-Paul Allouche, James Currie), Extremal Infinite Overlap-Free Binary Words
• Shallit, Jeffrey (with Ming-wei Wang), On Minimal Words With Given Subword Complexity
• Shallit, Jeffrey (with Ming-wei Wang), Weakly Self-Avoiding Words and a Construction of Friedman
• Shapira, Andrew, An Exact Performance Bound for an O(m+n) Greedy Matching Procedure
• Shapiro, Michael (with Yurii Burman), Coding Parking Functions by Pairs of Permutations
• Shearer, J. B. (with A. M. Odlyzko, R. Siders), Monotonic subsequences in dimensions higher than one
• Shearer, James B. (with Don Coppersmith), New Bounds for Union-free Families of Sets
• Shearer, James B., The Independence Number of Dense Graphs with Large Odd Girth
• Shearer, James B., Some New Optimum Golomb Rectangles
• Shearer, James B., A New Construction for Cancellative Families of Sets
• Shearer, James B., Improved LP Lower Bounds for Difference Triangle Sets
• Shen, J. (with R. A. Brualdi), Discrepancy of Matrices of Zeros and Ones
• Shen, Jian (with Raphael Yuster), A Note on the Number of Edges Guaranteeing a C₄ in Eulerian Bipartite Digraphs
• Shen, Jian, Short Cycles in Digraphs with Local Average Outdegree at Least Two
• Shimozono, Mark (with Dennis E. White), A Color-to-Spin Domino Schensted Algorithm
• Shiu, Peter (with Michael J Kearney), Efficient Packing of Unit Squares in a Square
• Shur, Walter, The Last Digit of and
• Siders, R. (with A. M. Odlyzko, J. B. Shearer), Monotonic subsequences in dimensions higher than one
• Sills, Andrew V., Finite Rogers-Ramanujan Type Identities
• Simion, Rodica (with Frank Schmidt), Some geometric probability problems involving the Eulerian numbers
• Simion, Rodica, Combinatorial statistics on type-B analogues of noncrossing partitions and restricted permutations
• Simonis, Juriaan (with Stefan Dodunekov), Codes and Projective Multisets
• Simonovits, Miklós (with Zoltán Füredi, Oleg Pikhurko), The Turán Density of the Hypergraph {abc,ade,bde,cde}
• Simpson, Jamie (with Aviezri S. Fraenkel, Tamar Seeman), The Subword Complexity of a Two-Parameter Family of Sequences
• Simpson, Jamie (with James D. Currie), Non-Repetitive Tilings
• Simpson, R. Jamie (with Aviezri S. Fraenkel), How Many Squares Must a Binary Sequence Contain?
• Simpson, Todd, Three generalizations of Weyl's denominator formula
• Simó, E. (with F. Aguiló, M. Zaragozá), Optimal Double-Loop Networks with Non-Unit Steps
• Singer, Dan W., A Bijective Proof of Garsia's q-Lagrange Inversion Theorem
• Singer, Dan, On Catalan Trees and the Jacobian Conjecture
• Sirán, Jozef (with Ljiljana Brankovic, Mirka Miller, Ján Plesník, Joe Ryan), A Note on Constructing Large Cayley Graphs of Given Degree and Diameter by Voltage Assignments
• Skandera, Mark, Dumont's Statistic on Words
• Skrekovski, Riste (with Bojan Mohar), The Grötzsch Theorem for the Hypergraph of Maximal Cliques
• Skrekovski, Riste (with Bojan Mohar), Nowhere-zero k-flows of Supergraphs
• Skrekovski, Riste (with Bostjan Bresar, Sandi Klavzar), The Cube Polynomial and its Derivatives: the Case of Median Graphs
• Sloane, N. J. A., The On-Line Encyclopedia of Integer Sequences
• Sloane, N. J. A. (with Yves Edel, E. M. Rains), On Kissing Numbers in Dimensions 32 to 128
• Smilansky, Uzy (with Holger Schanz), Combinatorial Identities from the Spectral Theory of Quantum Graphs
• Smith, Ken W. (with Herbert Fleischner, Robert R. Molina, Douglas B. West), A Proof of the Two-path Conjecture
• Soicher, Leonard H., Yet Another Distance-Regular Graph Related to a Golay Code
• Soicher, Leonard H., On the Structure and Classification of SOMAs: Generalizations of Mutually Orthogonal Latin Squares
• Solé, Patrick, Codes, Lattices, and Steiner Systems
• Sopena, E. (with J. Nesetril), On the Oriented Game Chromatic Number
• Soundararajan, K. (with R. Balasubramanian), Maximal Sets of Integers with Distinct Divisors
• Spence, E., The Strongly Regular (40,12,2,4) Graphs
• Spencer, Joel H. (with Katherine St. John), The Tenacity of Zero-One Laws
• Spencer, Joel, Real time asymptotic packing
• Spielman, Daniel A. (with Miklós Bóna), An Infinite Antichain of Permutations
• Squire, Matthew B., Gray Codes for A-Free Strings
• Stadler, Peter F. (with Josef Leydold), Minimal Cycle Bases of Outerplanar Graphs
• Stadler, Peter F. (with Petra M. Gleiss, Josef Leydold), Interchangeability of Relevant Cycles in Graphs
• Stamatiou, Yannis C. (with Alexis C. Kaporis, Lefteris M. Kirousis), A Note on the Non-Colorability Threshold of a Random Graph
• Stankova, Zvezdelina (with Toufik Mansour), 321-Polygon-Avoiding Permutations and Chebyshev Polynomials
• Stanley, Richard P. (with David Savitt), A Note on the Symmetric Powers of the Standard Representation of S
• Stanley, Richard P., Flag-symmetric and locally rank-symmetric partially ordered sets
• Stanley, Richard P., Parking functions and noncrossing partitions
• Stark, D. (with A. Knopfmacher, A. M. Odlyzko, B. Pittel, L. B. Richmond, G. Szekeres, N. C. Wormald), The Asymptotic Number of Set Partitions with Unequal Block Sizes
• Stark, Dudley (with Peter J. Cameron), A Prolific Construction of Strongly Regular Graphs with the n-e.c. Property
• Staton, William (with Asad Ali Ali), On Extremal Graphs With No Long Paths
• Steingrímsson, Einar (with Richard Ehrenborg), Playing Nim on a Simplicial Complex
• Stembridge, John R., A Concise Proof of the Littlewood-Richardson Rule
• Stevens, Brett, The Directed Anti-Oberwolfach Solution: Pancyclic 2-Factorizations of Complete Directed Graphs of Odd Order
• Stinson, Douglas R. (with Jeffrey H. Dinitz, L. Zhu), On the Spectra of Certain Classes of Room Frames
• Stong, Richard, The Average Order of a Permutation
• Stong, Richard (with Nigel Martin), Permutation Separations and Complete Bipartite Factorisations of K_{n,n}
• Strahov, E., Moments of Characteristic Polynomials Enumerate Two-Rowed Lexicographic Arrays
• Strauss, Dona (with Dennis Davenport, Neil Hindman), Triangle Free Sets and Arithmetic Progressions - Two Pisier Type Problems
• Stromquist, W. (with M. H. Albert, M. D. Atkinson, C. C. Handley, D. A. Holton), On Packing Densities of Permutations
• Stromquist, Walter, Packing 10 or 11 Unit Squares in a Square
• Subramanian, C.R., Finding Induced Acyclic Subgraphs in Random Digraphs
• Sudakov, Benny (with Alexander Kelmans, Dhruv Mubayi), Asymptotically Optimal Tree-Packings in Regular Graphs
• Sudakov, Benny, A Note on Odd Cycle-Complete Graph Ramsey Numbers
• Suen, Stephen (with W. Edwin Clark), Inequality Related to Vizing's Conjecture
• Suen, Stephen (with W. Edwin Clark, Larry A. Dunning), Tight Upper Bounds for the Domination Numbers of Graphs with Given Order and Minimum Degree, II
• Sulanke, Robert A., Bijective Recurrences concerning Schröder Paths
• Sulanke, Robert A., Counting Lattice Paths by Narayana Polynomials
• Sundaram, Ravi (with Alexander Russell), A Note on the Asymptotics and Computational Complexity of Graph Distinguishability
• Sundaram, Sheila (with Helene Barcelo, Robert Maule), On Counting Permutations by Pairs of Congruence Classes of Major Index
• Sunik, Zoran, Self-Describing Sequences and the Catalan Family Tree
• Svanström, Mattias (with Patric R. J. Östergĺrd), Ternary Constant Weight Codes
• Sweet, Melvin M. (with Harold Fredricksen), Symmetric Sum-Free Partitions and Lower Bounds for Schur Numbers
• Szalkai, István (with Claude Laflamme), Counting Simplexes in R³
• Szekeres, G. (with A. Knopfmacher, A. M. Odlyzko, B. Pittel, L. B. Richmond, D. Stark, N. C. Wormald), The Asymptotic Number of Set Partitions with Unequal Block Sizes
• Sziklai, Péter (with Péter L. Erdös, David C. Torney), A Finite Word Poset
• Szpankowski, Wojciech (with Charles Knessl), A Note on the Asymptotic Behavior of the Heights in b-Tries for b Large
• Szpankowski, Wojciech (with Svante Janson), Analysis of an Asymmetric Leader Election Algorithm
• Székely, László A. (with Ralph Howard, Gyula Károlyi), Towards a Katona Type Proof for the 2-intersecting Erdos-Ko-Rado Theorem

T

• Tamm, Ulrich, Some Aspects of Hankel Matrices in Coding Theory and Combinatorics
• Tanenbaum, Paul J., Bound Graph Polysemy
• Tanny, Stephen (with Edward J. Barbeau, John Chew), A Matrix Dynamics Approach to Golomb's Recursion
• Tanny, Steve (with Ed Barbeau), On a Strange Recursion of Golomb
• Tefera, Akalu, A Multiple Integral Evaluation Inspired by the Multi-WZ Method
• Thibon, Jean-Yves (with Bernard Leclerc), The Robinson-Schensted correspondence, crystal bases, and the quantum straightening at $q=0$
• Thoma, Lubos (with Alan Frieze, Miklós Ruszinkó), A Note on Random Minimum Length Spanning Trees
• Thoma, Lubos (with Tom Bohman, Alan Frieze, Miklós Ruszinkó), Note on Sparse Random Graphs and Cover Graphs
• Thomas, Robin (with Martin Juvan, Bojan Mohar), List Edge-Colorings of Series-Parallel Graphs
• Tinhofer, Gottfried (with Mikhail E. Muzychuk), Recognizing Circulant Graphs of Prime Order in Polynomial Time
• Tinhofer, Gottfried (with Mikhail E. Muzychuk), Recognizing Circulant Graphs in Polynomial Time: An Application of Association Schemes
• Tipnis, Shailesh K. (with Michael J. Plantholt), All Regular Multigraphs of Even Order and High Degree Are 1-factorable
• Tittman, Peter (with André Pönitz), Improved Upper Bounds for Self-Avoiding Walks in Z^d
• Tomescu, Ioan, Irreducible Coverings by Cliques and Sperner's Theorem
• Tonkes, E. (with G. L. Cohen), Dartboard Arrangements
• Torney, David C. (with Péter L. Erdös, Péter Sziklai), A Finite Word Poset
• Tripodi, Antoinette (with Giovanni Lo Faro, Lorenzo Milazzo), On the Upper and Lower Chromatic Numbers of BSQSs(16)
• Trotter, W. T. (with H. A. Kierstead), Competitive Colorings of Oriented Graphs
• Trotter, William T. (with Andrzej Czygrinow, Genghua Fan, Glenn Hurlbert, H. A. Kierstead), Spanning Trees of Bounded Degree

U

• Ustimenko, V. A. (with F. Lazebnik, A. J. Woldar), New upper bounds on the order of cages

V

• Vainshtein, Alek (with Toufik Mansour), Restricted Permutations, Continued Fractions, and Chebyshev Polynomials
• Vallejo, Ernesto, Stability of Kronecker Products of Irreducible Characters of the Symmetric Group
• Vatter, Vincent R., Permutations Avoiding Two Patterns of Length Three
• Vatter, Vincent R. (with Maximillian M. Murphy), Profile Classes and Partial Well-Order for Permutations
• Vella, Antoine, Pattern Avoidance in Permutations: Linear and Cyclic Orders
• Verbitsky, O. (with T. Banakh, Ya. Vorobets), A Ramsey Treatment of Symmetry
• Vershik, Anatoly (with Amitai Regev), Asymptotics of Young Diagrams and Hook Numbers
• Verstraëte, Jacques (with Felix Lazebnik), On Hypergraphs of Girth Five
• Vigoda, Eric, A Note on the Glauber Dynamics for Sampling Independent Sets
• Vismara, Philippe, Union of all the Minimum Cycle Bases of a Graph
• Voloshin, Vitaly (with André Kündgen, Eric Mendelsohn), Colouring Planar Mixed Hypergraphs
• Vorobets, Ya. (with T. Banakh, O. Verbitsky), A Ramsey Treatment of Symmetry

W

• Wachs, Michelle L. (with Xun Dong), Combinatorial Laplacian of the Matching Complex
• Wagon, Stan (with Herbert S. Wilf), When are subset sums equidistributed modulo m?
• Walker, L. A. (with M. D. Atkinson, S. A. Linton), Priority Queues and Multisets
• Wang, Jianfang (with Ping Wang, Baoguang Xu), A Note on the Edge-Connectivity of Cages
• Wang, Ming-wei (with Jeffrey Shallit), On Minimal Words With Given Subword Complexity
• Wang, Ming-wei (with Jeffrey Shallit), Weakly Self-Avoiding Words and a Construction of Friedman
• Wang, Ping (with Baoguang Xu, Jianfang Wang), A Note on the Edge-Connectivity of Cages
• Wanless, I. M. (with B. D. McKay), Maximising the Permanent of (0,1)-Matrices and the Number of Extensions of Latin Rectangles
• Wanless, I. M., Perfect Factorisations of Bipartite Graphs and Latin Squares Without Proper Subrectangles
• Wanless, Ian M., A Generalisation of Transversals for Latin Squares
• Weakley, William D. (with Patric R. J. Östergĺrd), Values of Domination Numbers of the Queen's Graph
• Wegener, Ingo (with Martin Loebbing), The Number of Knight's Tours Equals 33,439,123,484,294 --- Counting with Binary Decision Diagrams
• Weinstein