| 0 | -- | 0 | Robert J. MacG. Dawson, Blair Doyle. Tilings of the Sphere with Right Triangles II: The (1, 3, 2), (0, 2, n) Subfamily |
| 0 | -- | 0 | Mark Lipson. Completion of the Wilf-Classification of 3-5 Pairs Using Generating Trees |
| 0 | -- | 0 | Joshua N. Cooper. A Permutation Regularity Lemma |
| 0 | -- | 0 | Peter Keevash, Po-Shen Loh, Benny Sudakov. Bounding the Number of Edges in Permutation Graphs |
| 0 | -- | 0 | Ira M. Gessel, Guoce Xin. The Generating Function of Ternary Trees and Continued Fractions |
| 0 | -- | 0 | Andrius Kulikauskas, Jeffrey B. Remmel. Lyndon Words and Transition Matrices between Elementary, Homogeneous and Monomial Symmetric Functions |
| 0 | -- | 0 | Ronald J. Gould, Tomasz Luczak, John R. Schmitt. Constructive Upper Bounds for Cycle-Saturated Graphs of Minimum Size |
| 0 | -- | 0 | John S. Caughman IV, J. J. P. Veerman. Kernels of Directed Graph Laplacians |
| 0 | -- | 0 | Michael Hardy. Combinatorics of Partial Derivatives |
| 0 | -- | 0 | Robert J. MacG. Dawson, Blair Doyle. Tilings of the Sphere with Right Triangles I: The Asymptotically Right Families |
| 0 | -- | 0 | Guantao Chen, Joan P. Hutchinson, Ken Keating, Jian Shen. Characterization of [1, k]-Bar Visibility Trees |
| 0 | -- | 0 | William Y. C. Chen, Toufik Mansour, Sherry H. F. Yan. Matchings Avoiding Partial Patterns |
| 0 | -- | 0 | Catalin Zara. Chains, Subwords, and Fillings: Strong Equivalence of Three Definitions of the Bruhat Order |
| 0 | -- | 0 | Leah Wrenn Berman. Some Results on Odd Astral Configurations |
| 0 | -- | 0 | Debra L. Boutin. Identifying Graph Automorphisms Using Determining Sets |
| 0 | -- | 0 | Melody Chan. The Maximum Distinguishing Number of a Group |
| 0 | -- | 0 | David R. Wood. Drawing a Graph in a Hypercube |
| 0 | -- | 0 | Laura Ciobanu, Sasa Radomirovic. Restricted Walks in Regular Trees |
| 0 | -- | 0 | Derek H. Smith, L. A. Hughes, Stephanie Perkins. A New Table of Constant Weight Codes of Length Greater than 28 |
| 0 | -- | 0 | N. Kolev, N. Nenov. New Upper Bound for a Class of Vertex Folkman Numbers |
| 0 | -- | 0 | Manuel Kauers. Shift Equivalence of P-finite Sequences |
| 0 | -- | 0 | Christine T. Cheng. On Computing the Distinguishing Numbers of Trees and Forests |
| 0 | -- | 0 | Daniel Goldstein, Richard Stong. On the Number of Possible Row and Column Sums of 0, 1-Matrices |
| 0 | -- | 0 | David J. Galvin. Bounding the Partition Function of Spin-Systems |
| 0 | -- | 0 | Amitava Bhattacharya, S. Sivasubramanian, Murali K. Srinivasan. The Polytope of Degree Partitions |
| 0 | -- | 0 | Jason P. Bell, Stanley Burris, Karen A. Yeats. Counting Rooted Trees: The Universal Law t(n)~C ?-n n-3/2 |
| 0 | -- | 0 | David L. Neel, Michael E. Orrison. The Linear Complexity of a Graph |
| 0 | -- | 0 | Sergey Kitaev, Jeffrey B. Remmel. Classifying Descents According to Equivalence mod k |
| 0 | -- | 0 | Arthur H. Busch. A Note on the Number of Hamiltonian Paths in Strong Tournaments |
| 0 | -- | 0 | Murray Elder. Permutations Generated by a Stack of Depth 2 and an Infinite Stack in Series |
| 0 | -- | 0 | Philippe Flajolet, Éric Fusy, Xavier Gourdon, Daniel Panario, Nicolas Pouyanne. A Hybrid of Darboux s Method and Singularity Analysis in Combinatorial Asymptotics |
| 0 | -- | 0 | Steven Sivek. Some Plethysm Results related to Foulkes' Conjecture |
| 0 | -- | 0 | Tomasz Dzido, Marek Kubale, Konrad Piwakowski. On Some Ramsey and Turan-Type Numbers for Paths and Cycles |
| 0 | -- | 0 | Miklós Bóna. On a Balanced Property of Derangements |
| 0 | -- | 0 | Paul Zinn-Justin. Proof of the Razumov-Stroganov Conjecture for some Infinite Families of Link Patterns |
| 0 | -- | 0 | Anna de Mier. On the Symmetry of the Distribution of k-Crossings and k-Nestings in Graphs |
| 0 | -- | 0 | Anisse Kasraoui, Jiang Zeng. Distribution of Crossings, Nestings and Alignments of Two Edges in Matchings and Partitions |
| 0 | -- | 0 | Nantel Bergeron, Christophe Hohlweg, Mercedes Rosas, Mike Zabrocki. Grothendieck Bialgebras, Partition Lattices, and Symmetric Functions in Noncommutative Variables |
| 0 | -- | 0 | James D. Currie, Narad Rampersad, Jeffrey Shallit. Binary Words Containing Infinitely Many Overlaps |
| 0 | -- | 0 | Timothy J. Hetherington, Douglas R. Woodall. Edge and Total Choosability of Near-Outerplanar Graphs |
| 0 | -- | 0 | Uwe Schauz. Colorings and Orientations of Matrices and Graphs |
| 0 | -- | 0 | Maurice Pouzet, Norbert Sauer. From Well-Quasi-Ordered Sets to Better-Quasi-Ordered Sets |
| 0 | -- | 0 | Marcelo Aguiar, Walter Moreira. Combinatorics of the Free Baxter Algebra |
| 0 | -- | 0 | Éric Fusy. Counting d-Polytopes with d+3 Vertices |
| 0 | -- | 0 | Sarang Aravamuthan, Sachin Lodha. Covering Codes for Hats-on-a-line |
| 0 | -- | 0 | Marc A. A. van Leeuwen. Double Crystals of Binary and Integral Matrices |
| 0 | -- | 0 | Jörn Quistorff. A Survey on Packing and Covering Problems in the Hamming Permutation Space |
| 0 | -- | 0 | C. Little, A. Vince. Parity Versions of 2-Connectedness |
| 0 | -- | 0 | Benjamin Doerr, Michael Gnewuch, Nils Hebbinghaus. Discrepancy of Symmetric Products of Hypergraphs |
| 0 | -- | 0 | Vít Jelínek, Nelson Y. Li, Toufik Mansour, Sherry H. F. Yan. Matchings Avoiding Partial Patterns and Lattice Paths |
| 0 | -- | 0 | Brian Hopkins, Michael A. Jones. Shift-Induced Dynamical Systems on Partitions and Compositions |
| 0 | -- | 0 | Richard Brak, Sylvie Corteel, John W. Essam, Robert Parviainen, Andrew Rechnitzer. A Combinatorial Derivation of the PASEP Stationary State |
| 0 | -- | 0 | Winston C. Yang. Adding Layers to Bumped-Body Polyforms with Minimum Perimeter Preserves Minimum Perimeter |
| 0 | -- | 0 | Kris Coolsaet, Jan Degraer, Edward Spence. The Strongly Regular (45, 12, 3, 3) Graphs |
| 0 | -- | 0 | Benjamin Braun. An Ehrhart Series Formula For Reflexive Polytopes |
| 0 | -- | 0 | Simon Bliudze, Daniel Krob. A Combinatorial Approach to Evaluation of Reliability of the Receiver Output for BPSK Modulation with Spatial Diversity |
| 0 | -- | 0 | Karen L. Collins, Ann N. Trenk. The Distinguishing Chromatic Number |
| 0 | -- | 0 | Jonathan Cutler, Lars-Daniel Ohman. Latin Squares with Forbidden Entries |
| 0 | -- | 0 | Jakob Jonsson. Hard Squares with Negative Activity and Rhombus Tilings of the Plane |
| 0 | -- | 0 | Peter J. Cameron, G. R. Omidi, Behruz Tayfeh-Rezaie. 3-Designs from PGL(2, q) |
| 0 | -- | 0 | Christopher R. H. Hanusa. A Gessel-Viennot-Type Method for Cycle Systems in a Directed Graph |
| 0 | -- | 0 | Peter McNamara. Factorial Grothendieck Polynomials |
| 0 | -- | 0 | Julie Cain, Nicholas C. Wormald. Encores on Cores |
| 0 | -- | 0 | Peter J. Cameron, Thomas Prellberg, Dudley Stark. Asymptotics for Incidence Matrix Classes |
| 0 | -- | 0 | L. Wyatt Alverson II, Robert G. Donnelly, Scott J. Lewis, Robert Pervine. Constructions of Representations of Rank Two Semisimple Lie Algebras with Distributive Lattices |
| 0 | -- | 0 | Aaron N. Siegel. Reduced Canonical Forms of Stoppers |
| 0 | -- | 0 | Catherine S. Greenhill, Andrzej Rucinski. Neighbour-Distinguishing Edge Colourings of Random Regular Graphs |
| 0 | -- | 0 | Douglas R. Woodall. Total 4-Choosability of Series-Parallel Graphs |
| 0 | -- | 0 | Werner Krauth, Martin Loebl. Jamming and Geometric Representations of Graphs |
| 0 | -- | 0 | Anthony Henderson. Plethysm for Wreath Products and Homology of Sub-Posets of Dowling Lattices |
| 0 | -- | 0 | David Emms, Edwin R. Hancock, Simone Severini, Richard C. Wilson. A Matrix Representation of Graphs and its Spectrum as a Graph Invariant |
| 0 | -- | 0 | Richard A. Brualdi, Martin Loebl, Ondrej Pangrác. Perfect Matching Preservers |
| 0 | -- | 0 | François Bergeron, Riccardo Biagioli. Tensorial Square of the Hyperoctahedral Group Coinvariant Space |
| 0 | -- | 0 | Terence Tao. A Quantitative Ergodic Theory Proof of Szemerédi s Theorem |
| 0 | -- | 0 | Markus Kuba, Alois Panholzer. Descendants in Increasing Trees |
| 0 | -- | 0 | T. R. Riley, William P. Thurston. The Absence of Efficient Dual Pairs of Spanning Trees in Planar Graphs |
| 0 | -- | 0 | Christopher K. Storm. The Zeta Function of a Hypergraph |
| 0 | -- | 0 | X. Ma. Two Finite Forms of Watson s Quintuple Product Identity and Matrix Inversion |
| 0 | -- | 0 | Harold Widom. On the Limiting Distribution for the Length of the Longest Alternating Sequence in a Random Permutation |
| 0 | -- | 0 | Ghassan Firro, Toufik Mansour. Three-Letter-Pattern-Avoiding Permutations and Functional Equations |
| 0 | -- | 0 | Dillon Mayhew. Equitable Matroids |
| 0 | -- | 0 | Caihuan Zhang. Parameter Augmentation for Two Formulas |
| 0 | -- | 0 | Robert Parviainen. Permutations, Cycles, the Pattern 2-13 |
| 0 | -- | 0 | Mohammad Ghebleh, Daniel Král, Serguei Norine, Robin Thomas. The Circular Chromatic Index of Flower Snarks |
| 0 | -- | 0 | William Y. C. Chen, Sherry H. F. Yan. Noncrossing Trees and Noncrossing Graphs |
| 0 | -- | 0 | Alexandre Pinlou. On Oriented Arc-Coloring of Subcubic Graphs |
| 0 | -- | 0 | Naiomi Cameron, Kendra Killpatrick. Domino Fibonacci Tableaux |
| 0 | -- | 0 | Hui-Qin Cao. An Addition Theorem on the Cyclic Group Zpa qß |
| 0 | -- | 0 | Anka Golemac, Josko Mandic, Tanja Vucicic. New Regular Partial Difference Sets and Strongly Regular Graphs with Parameters (96, 20, 4, 4) and (96, 19, 2, 4) |
| 0 | -- | 0 | Ales Prívetivý. Discrepancy of Sums of Three Arithmetic Progressions |
| 0 | -- | 0 | É. Janvresse, T. de la Rue, Y. Velenik. A Note on Domino Shuffling |
| 0 | -- | 0 | Rebecca Smith. Permutation Reconstruction |
| 0 | -- | 0 | Mark A. Shattuck, Carl G. Wagner. A New Statistic on Linear and Circular r-Mino Arrangements |
| 0 | -- | 0 | Andrew Granville. Cycle Lengths in a Permutation are Typically Poisson |
| 0 | -- | 0 | Leah Wrenn Berman. Movable (n4) Configurations |
| 0 | -- | 0 | Ahmed Ainouche. Relaxations of Ore s Condition on Cycles |
| 0 | -- | 0 | Maria Axenovich. On Subgraphs Induced by Transversals in Vertex-Partitions of Graphs |
| 0 | -- | 0 | William Y. C. Chen, Kathy Q. Ji, Herbert S. Wilf. BG-Ranks and 2-Cores |
| 0 | -- | 0 | Brad Jackson, Frank Ruskey. Meta-Fibonacci Sequences, Binary Trees and Extremal Compact Codes |
| 0 | -- | 0 | Iwao Sato. Weighted Zeta Functions of Graph Coverings |
| 0 | -- | 0 | Daniel Felix. Optimal Penney Ante Strategy via Correlation Polynomial Identities |
| 0 | -- | 0 | Kejun Chen, Ruizhong Wei. A Few More Cyclic Steiner 2-Designs |
| 0 | -- | 0 | Srecko Brlek, Andrea Frosini, Simone Rinaldi, Laurent Vuillon. Tilings by Translation: Enumeration by a Rational Language Approach |
| 0 | -- | 0 | Piotr Sniady. Generalized Cauchy identities, trees and multidimensional Brownian motions. Part I: bijective proof of generalized Cauchy identities |
| 0 | -- | 0 | Craig A. Sloss. The Induced Subgraph Order on Unlabelled Graphs |
| 0 | -- | 0 | Pawel Zylinski. Orthogonal Art Galleries with Holes: A Coloring Proof of Aggarwal s Theorem |
| 0 | -- | 0 | Yaming Yu. More Forbidden Minors for Wye-Delta-Wye Reducibility |
| 0 | -- | 0 | Noga Alon, Benny Sudakov. H-Free Graphs of Large Minimum Degree |
| 0 | -- | 0 | Nick Gill. Nilpotent Singer Groups |
| 0 | -- | 0 | Raphael Yuster. Rainbow H-factors |
| 0 | -- | 0 | Magnus Bordewich, Charles Semple, Mike A. Steel. Identifying X-Trees with Few Characters |
| 0 | -- | 0 | David J. Grynkiewicz, Rasheed Sabar. Monochromatic and Zero-Sum Sets of Nondecreasing Modified Diameter |
| 0 | -- | 0 | Michael A. Henning, Anders Yeo. Total Domination and Matching Numbers in Claw-Free Graphs |
| 0 | -- | 0 | János Barát, Jirí Matousek, David R. Wood. Bounded-Degree Graphs have Arbitrarily Large Geometric Thickness |
| 0 | -- | 0 | Mariana Raykova. Permutation Reconstruction from Minors |
| 0 | -- | 0 | Bernhard Gittenberger, Johannes Mandlburger. Hayman Admissible Functions in Several Variables |
| 0 | -- | 0 | Sophie Huczynska, Vincent Vatter. Grid Classes and the Fibonacci Dichotomy for Restricted Permutations |
| 0 | -- | 0 | Boris Alexeev. On Lengths of Rainbow Cycles |
| 0 | -- | 0 | Stephan G. Wagner. On an Identity for the Cycle Indices of Rooted Tree Automorphism Groups |
| 0 | -- | 0 | Bart De Bruyn, Pieter Vandecasteele. The Valuations of the Near Octagon I4 |
| 0 | -- | 0 | Chris Jones, Angela Matney, Harold N. Ward. Optimal Four-Dimensional Codes over GF(8) |
| 0 | -- | 0 | Boris Bukh. A Point in Many Triangles |
| 0 | -- | 0 | János Pach, Dömötör Pálvölgyi. Bounded-Degree Graphs can have Arbitrarily Large Slope Numbers |
| 0 | -- | 0 | Nicholas J. Cavenagh, Diana Combe, Adrian M. Nelson. Edge-Magic Group Labellings of Countable Graphs |
| 0 | -- | 0 | Irit Dinur, Ehud Friedgut. Proof of an Intersection Theorem via Graph Homomorphisms |
| 0 | -- | 0 | Nathan Linial, Michael E. Saks, David Statter. The Non-Crossing Graph |
| 0 | -- | 0 | Ariane M. Masuda, Daniel Panario, Qiang Wang. The Number of Permutation Binomials over F4p+1 where p and 4p+1 are Primes |
| 0 | -- | 0 | Fan R. K. Chung. The Diameter and Laplacian Eigenvalues of Directed Graphs |
| 0 | -- | 0 | David Eppstein. Cubic Partial Cubes from Simplicial Arrangements |
| 0 | -- | 0 | David Bevan. Sets of Points Determining Only Acute Angles and Some Related Colouring Problems |
| 0 | -- | 0 | Edward Dobson. On the Proof of a Theorem of Pálfy |
| 0 | -- | 0 | Jack Huizenga. The minimum size of complete caps in (Z/nZ)2 |
| 0 | -- | 0 | Arthur Holshouser, Harold Reiter. Dynamic Single-Pile Nim Using Multiple Bases |
| 0 | -- | 0 | Sankaran Viswanath. A Note on Exponents vs Root Heights for Complex Simple Lie Algebras |