| 0 | -- | 0 | Xun-Tuan Su, Yi Wang. On Unimodality Problems in Pascal's Triangle |
| 0 | -- | 0 | Alex Iosevich, Steven Senger. Orthogonal Systems in Vector Spaces over Finite Fields |
| 0 | -- | 0 | Gábor Simonyi. Necklace Bisection with One Cut Less than Needed |
| 0 | -- | 0 | József Balogh, Ryan Martin. Edit Distance and its Computation |
| 0 | -- | 0 | Paz Carmi, Vida Dujmovic, Pat Morin, David R. Wood. Distinct Distances in Graph Drawings |
| 0 | -- | 0 | Stefanie Gerke, Omer Giménez, Marc Noy, Andreas Weißl. 3, 3 as a Minor |
| 0 | -- | 0 | Matthew H. J. Fiset, Alexander M. Kasprzyk. A Note on Palindromic delta-Vectors for Certain Rational Polytopes |
| 0 | -- | 0 | Ron M. Adin, Jeffrey B. Remmel, Yuval Roichman. The Combinatorics of the Garsia-Haiman Modules for Hook Shapes |
| 0 | -- | 0 | Andreas N. Lagerås, Mathias Lindholm. A Note on the Component Structure in Random Intersection Graphs with Tunable Clustering |
| 0 | -- | 0 | Türker Bíyíkoglu, Josef Leydold. Graphs with Given Degree Sequence and Maximal Spectral Radius |
| 0 | -- | 0 | Walter Stromquist. Envy-Free Cake Divisions Cannot be Found by Finite Protocols |
| 0 | -- | 0 | Amin Coja-Oghlan, Alan M. Frieze. Random k-SAT: The Limiting Probability for Satisfiability for Moderately Growing k |
| 0 | -- | 0 | Sylvain Gravier, Julien Moncel, Ahmed Semri. Identifying Codes of Cartesian Product of Two Cliques of the Same Size |
| 0 | -- | 0 | Kris Coolsaet, Jan Degraer. Using Algebraic Properties of Minimal Idempotents for Exhaustive Computer Generation of Association Schemes |
| 0 | -- | 0 | Hilarion L. M. Faliharimalala, Jiang Zeng. n |
| 0 | -- | 0 | Matthew Fayers. Regularisation and the Mullineux Map |
| 0 | -- | 0 | Paul Heideman, Emilie Hogan. A New Family of Somos-like Recurrences |
| 0 | -- | 0 | Denis Chebikin. Variations on Descents and Inversions in Permutations |
| 0 | -- | 0 | Ömer Egecioglu, Timothy Redmond, Charles Ryavec. Almost Product Evaluation of Hankel Determinants |
| 0 | -- | 0 | David Auger. Induced Paths in Twin-Free Graphs |
| 0 | -- | 0 | Kevin Purbhoo. Compression of Root Systems and the E-Sequence |
| 0 | -- | 0 | Song Guo. A Counterexample to a Conjecture of Erdös, Graham and Spencer |
| 0 | -- | 0 | Matthias Köppe, Sven Verdoolaege. Computing Parametric Rational Generating Functions with a Primal Barvinok Algorithm |
| 0 | -- | 0 | Andrew Suk. k, k-Cross Free Families |
| 0 | -- | 0 | János Barát, David R. Wood. Notes on Nonrepetitive Graph Colouring |
| 0 | -- | 0 | Edwin R. van Dam. The Spectral Excess Theorem for Distance-Regular Graphs: A Global (Over)view |
| 0 | -- | 0 | Qi Liu, Douglas B. West. Tree-Thickness and Caterpillar-Thickness under Girth Constraints |
| 0 | -- | 0 | Edward A. Bender, E. Rodney Canfield, L. Bruce Richmond. Coefficients of Functional Compositions Often Grow Smoothly |
| 0 | -- | 0 | Stefan Grünewald, Peter J. Humphries, Charles Semple. Quartet Compatibility and the Quartet Graph |
| 0 | -- | 0 | Kathy Qing Ji. A Combinatorial Proof of Andrews' Smallest Parts Partition Function |
| 0 | -- | 0 | Joanne L. Hall. Graphs Associated with Codes of Covering Radius 1 and Minimum Distance 2 |
| 0 | -- | 0 | M. Parvathi, B. Sivakumar. n and Klein-4 Diagram Algebras |
| 0 | -- | 0 | Vít Jelínek, Toufik Mansour. On Pattern-Avoiding Partitions |
| 0 | -- | 0 | Joanna Polcyn. Large Holes in Quasi-Random Graphs |
| 0 | -- | 0 | Manuel Kauers, Carsten Schneider. Automated Proofs for Some Stirling Number Identities |
| 0 | -- | 0 | Stefaan De Winter, Felix Lazebnik, Jacques Verstraëte. An Extremal Characterization of Projective Planes |
| 0 | -- | 0 | Shi-Mei Ma, Yi Wang. q-Eulerian Polynomials and Polynomials with Only Real Zeros |
| 0 | -- | 0 | Steve Kirkland. Laplacian Integral Graphs with Maximum Degree 3 |
| 0 | -- | 0 | Domingos Dellamonica Jr., Yoshiharu Kohayakawa. An Algorithmic Friedman-Pippenger Theorem on Tree Embeddings and Applications |
| 0 | -- | 0 | Catarina P. Avelino, Altino F. Santos. Spherical F-Tilings by Triangles and r-Sided Regular Polygons, r >= 5 |
| 0 | -- | 0 | Martin Klazar. On Growth Rates of Permutations, Set Partitions, Ordered Graphs and Other Objects |
| 0 | -- | 0 | Michael Gnewuch. Construction of Minimal Bracketing Covers for Rectangles |
| 0 | -- | 0 | Adrian Dumitrescu, Minghui Jiang. On a Covering Problem for Equilateral Triangles |
| 0 | -- | 0 | Klay Kruczek, Eric Sundberg. A Pairing Strategy for Tic-Tac-Toe on the Integer Lattice with Numerous Directions |
| 0 | -- | 0 | Himmet Can. n |
| 0 | -- | 0 | Dhruv Mubayi, John M. Talbot. Extremal Problems for t-Partite and t-Colorable Hypergraphs |
| 0 | -- | 0 | Vladimir Nikiforov. Graphs with Many Copies of a Given Subgraph |
| 0 | -- | 0 | Lenore J. Cowen, Robert Cowen, Arthur Steinberg. Totally Greedy Coin Sets and Greedy Obstructions |
| 0 | -- | 0 | Artem A. Zhuravlev, Melissa S. Keranen, Donald L. Kreher. Small Group Divisible Steiner Quadruple Systems |
| 0 | -- | 0 | Vincent Vatter. A Sharp Bound for the Reconstruction of Partitions |
| 0 | -- | 0 | Sujith Vijay. On the Discrepancy of Quasi-Progressions |
| 0 | -- | 0 | Daan Krammer. Generalisations of the Tits Representation |
| 0 | -- | 0 | Michael Krivelevich, Tibor Szabó. Biased Positional Games and Small Hypergraphs with Large Covers |
| 0 | -- | 0 | Oliver T. Dasbach. A Natural Series for the Natural Logarithm |
| 0 | -- | 0 | Katharina T. Huber, Jacobus H. Koolen, Vincent Moulton, Andreas Spillner 0001. Characterizing Cell-Decomposable Metrics |
| 0 | -- | 0 | Wolfgang Haas. On the Failing Cases of the Johnson Bound for Error-Correcting Codes |
| 0 | -- | 0 | Dibyendu De, Ram Krishna Paul. Universally Image Partition Regularity |
| 0 | -- | 0 | Victor Kreiman. Products of Factorial Schur Functions |
| 0 | -- | 0 | Pawel Pralat. R(3, 4)=17 |
| 0 | -- | 0 | Glenn Tesler. Distribution of Segment Lengths in Genome Rearrangements |
| 0 | -- | 0 | Terry A. McKee. Uniquely Hamiltonian Characterizations of Distance-Hereditary and Parity Graphs |
| 0 | -- | 0 | Jakub Przybylo. Irregularity Strength of Regular Graphs |
| 0 | -- | 0 | Le Anh Vinh. On the Number of Orthogonal Systems in Vector Spaces over Finite Fields |
| 0 | -- | 0 | Ermelinda DeLaViña, Bill Waller. Spanning Trees with Many Leaves and Average Distance |
| 0 | -- | 0 | A. M. d'Azevedo Breda, Patrícia S. Ribeiro, Altino F. Santos. Dihedral f-Tilings of the Sphere by Equilateral and Scalene Triangles - III |
| 0 | -- | 0 | Friedrich Eisenbrand, János Pach, Thomas Rothvoß, Nir B. Sopher. Convexly Independent Subsets of the Minkowski Sum of Planar Point Sets |
| 0 | -- | 0 | Peter Borg. Intersecting and Cross-Intersecting Families of Labeled Sets |
| 0 | -- | 0 | Marc Fortin. The MacNeille Completion of the Poset of Partial Injective Functions |
| 0 | -- | 0 | Jeremy F. Alm, Roger D. Maddux, Jacob Manske. Chromatic Graphs, Ramsey Numbers and the Flexible Atom Conjecture |
| 0 | -- | 0 | Caroline J. Klivans, Victor Reiner. Shifted Set Families, Degree Sequences, and Plethysm |
| 0 | -- | 0 | Hamed Shirazi, Jacques Verstraëte. A Note on Polynomials and f-Factors of Graphs |
| 0 | -- | 0 | Christian Haase, Benjamin Nill, Andreas Paffenholz, Francisco Santos. Lattice Points in Minkowski Sums |
| 0 | -- | 0 | Harm Derksen, Theodore Owen. New Graphs of Finite Mutation Type |
| 0 | -- | 0 | Peter Adams, Darryn E. Bryant, Melinda Buchanan. Completing Partial Latin Squares with Two Filled Rows and Two Filled Columns |
| 0 | -- | 0 | Le Anh Vinh. Explicit Ramsey Graphs and Erdös Distance Problems over Finite Euclidean and Non-Euclidean Spaces |
| 0 | -- | 0 | Karl Dilcher. Determinant Expressions for q-Harmonic Congruences and Degenerate Bernoulli Numbers |
| 0 | -- | 0 | Stephen Howe. Dominating Sets of Random 2-in 2-out Directed Graphs |
| 0 | -- | 0 | Brian K. Miceli, Jeffrey B. Remmel. Augmented Rook Boards and General Product Formulas |
| 0 | -- | 0 | Cathleen Battiste Presutti. Determining Lower Bounds for Packing Densities of Non-layered Patterns Using Weighted Templates |
| 0 | -- | 0 | T. L. Alderson, Aiden A. Bruen. Codes from Cubic Curves and their Extensions |
| 0 | -- | 0 | M. Z. Garaev. p for Subsets of Incomparable Sizes |
| 0 | -- | 0 | Javier Barajas, Oriol Serra. The Lonely Runner with Seven Runners |
| 0 | -- | 0 | Shuhei Kamioka. A Combinatorial Derivation with Schroder Paths of a Determinant Representation of Laurent Biorthogonal Polynomials |
| 0 | -- | 0 | William Y. C. Chen, Jing Qin, Christian M. Reidys. Crossings and Nestings in Tangled Diagrams |
| 0 | -- | 0 | Mohammad Ghebleh. Circular Chromatic Index of Generalized Blanusa Snarks |
| 0 | -- | 0 | Maria Axenovich, Ryan Martin. Avoiding Rainbow Induced Subgraphs in Vertex-Colorings |
| 0 | -- | 0 | Olivier Bernardi. Tutte Polynomial, Subgraphs, Orientations and Sandpile Model: New Connections via Embeddings |
| 0 | -- | 0 | Yuqin Zhang, Ren Ding. A Note about Bezdek's Conjecture on Covering an Annulus by Strips |
| 0 | -- | 0 | Tiago Fonseca, Paul Zinn-Justin. On the Doubly Refined Enumeration of Alternating Sign Matrices and Totally Symmetric Self-Complementary Plane Partitions |
| 0 | -- | 0 | Lun Lv, Guoce Xin, Yue Zhou. Two Coefficients of the Dyson Product |
| 0 | -- | 0 | Andrew Frohmader. More Constructions for Turan's (3, 4)-Conjecture |
| 0 | -- | 0 | Jakub Przybylo. A Note on Neighbour-Distinguishing Regular Graphs Total-Weighting |
| 0 | -- | 0 | Leah Wrenn Berman. Symmetric Simplicial Pseudoline Arrangements |
| 0 | -- | 0 | Craig Timmons. Star Coloring High Girth Planar Graphs |
| 0 | -- | 0 | Andrzej Dudek, Vojtech Rödl. On the Turán Properties of Infinite Graphs |
| 0 | -- | 0 | Alan M. Frieze, Dhruv Mubayi. On the Chromatic Number of Simple Triangle-Free Triple Systems |
| 0 | -- | 0 | Marcelo H. de Carvalho, C. H. C. Little. Vector Spaces and the Petersen Graph |
| 0 | -- | 0 | Chirashree Bhattacharya, Ken W. Smith. Factoring (16, 6, 2) Hadamard Difference Sets |
| 0 | -- | 0 | Christoph Richard, Iwan Jensen, Anthony J. Guttmann. Area Distribution and Scaling Function for Punctured Polygons |
| 0 | -- | 0 | András Gyárfás, Gábor N. Sárközy, Endre Szemerédi. The Ramsey Number of Diamond-Matchings and Loose Cycles in Hypergraphs |
| 0 | -- | 0 | Alan M. Frieze, Michael Krivelevich. On Rainbow Trees and Cycles |
| 0 | -- | 0 | Pierangela Veneziani. Graph-Based Upper Bounds for the Probability of the Union of Events |
| 0 | -- | 0 | Jan Kyncl, Martin Tancer. The Maximum Piercing Number for some Classes of Convex Sets with the (4, 3)-property |
| 0 | -- | 0 | Romain Boulet, Bertrand Jouve. The Lollipop Graph is Determined by its Spectrum |
| 0 | -- | 0 | Jamie Simpson, Simon J. Puglisi. Words with Simple Burrows-Wheeler Transforms |
| 0 | -- | 0 | Ronald Brown, Ifor Morris, J. Shrimpton, Christopher D. Wensley. Graphs of Morphisms of Graphs |
| 0 | -- | 0 | John B. Polhill. Generalizations of Partial Difference Sets from Cyclotomy to Nonelementary Abelian p-Groups |
| 0 | -- | 0 | Guantao Chen, Ralph J. Faudree, Ronald J. Gould. Saturation Numbers of Books |
| 0 | -- | 0 | M. Farrokhi D. G.. An Identity Generator: Basic Commutators |
| 0 | -- | 0 | Josep Conde, Joan Gimbert, Josep González, Josep M. Miret, Ramiro Moreno. Nonexistence of Almost Moore Digraphs of Diameter Three |
| 0 | -- | 0 | A. M. d'Azevedo Breda, Patrícia S. Ribeiro, Altino F. Santos. Dihedral F-Tilings of the Sphere by Equilateral and Scalene Triangles - II |
| 0 | -- | 0 | Andries E. Brouwer. Small Integral Trees |
| 0 | -- | 0 | Robert Shwartz, Ron M. Adin, Yuval Roichman. Major Indices and Perfect Bases for Complex Reflection Groups |
| 0 | -- | 0 | Noga Alon, Shmuel Friedland. The Maximum Number of Perfect Matchings in Graphs with a Given Degree Sequence |
| 0 | -- | 0 | Chris Berg, Monica Vazirani. (l, 0)-Carter Partitions, their Crystal-Theoretic Behavior and Generating Function |
| 0 | -- | 0 | Sherry H. F. Yan. Bijective Proofs of Identities from Colored Binary Trees |
| 0 | -- | 0 | John D. Dixon. Generating Random Elements in Finite Groups |
| 0 | -- | 0 | Iiro S. Honkala, Tero Laihonen. On Identifying Codes in the King Grid that are Robust Against Edge Deletions |
| 0 | -- | 0 | Weidong Gao 0001, Yuanlin Li, Jiangtao Peng, Fang Sun. On Subsequence Sums of a Zero-sum Free Sequence II |
| 0 | -- | 0 | Michael Reid. Asymptotically Optimal Box Packing Theorems |
| 0 | -- | 0 | C. Merino. The Number of 0-1-2 Increasing Trees as Two Different Evaluations of the Tutte Polynomial of a Complete Graph |
| 0 | -- | 0 | Ralucca Gera, Jian Shen. Extension of Strongly Regular Graphs |
| 0 | -- | 0 | Jaume Martí-Farré, Carles Padró, Leonor Vázquez. On the Diameter of Matroid Ports |
| 0 | -- | 0 | Russell May. Coupon Collecting with Quotas |
| 0 | -- | 0 | Chak-On Chow. On the Eulerian Enumeration of Involutions |
| 0 | -- | 0 | Avi Berman, Shmuel Friedland, Leslie Hogben, Uriel G. Rothblum, Bryan L. Shader. Minimum Rank of Matrices Described by a Graph or Pattern over the Rational, Real and Complex Numbers |
| 0 | -- | 0 | Attila Bernáth, Henning Bruhn. Degree Constrained Orientations in Countable Graphs |
| 0 | -- | 0 | Peter J. Cameron, Daniel Johannsen, Thomas Prellberg, Pascal Schweitzer. Counting Defective Parking Functions |
| 0 | -- | 0 | Hirobumi Mizuno, Iwao Sato. The Scattering Matrix of a Graph |
| 0 | -- | 0 | Xiang-dong Hou. Hurwitz Equivalence in Tuples of Generalized Quaternion Groups and Dihedral Groups |
| 0 | -- | 0 | Isidoro Gitler, Petr Hlinený, Jesús Leaños, Gelasio Salazar. The Crossing Number of a Projective Graph is Quadratic in the Face-Width |
| 0 | -- | 0 | Guo-Niu Han. Discovering Hook Length Formulas by an Expansion Technique |
| 0 | -- | 0 | Marietjie Frick, Susan A. van Aardt, Jean E. Dunbar, Morten Hegner Nielsen, Ortrud R. Oellermann. A Traceability Conjecture for Oriented Graphs |
| 0 | -- | 0 | Marcelo H. de Carvalho, C. H. C. Little. Ear Decompositions in Combed Graphs |
| 0 | -- | 0 | Joseph E. Bonin. Transversal Lattices |
| 0 | -- | 0 | Shelley L. Rasmussen. On 3-Harness Weaving: Cataloging Designs Generated by Fundamental Blocks Having Distinct Rows and Columns |
| 0 | -- | 0 | Daniel M. Kane, Steven Sivek. n-Modules Generated by Partitions of a Given Shape |
| 0 | -- | 0 | Sho Matsumoto. Jack Deformations of Plancherel Measures and Traceless Gaussian Random Matrices |
| 0 | -- | 0 | Matjaz Konvalinka. An Inverse Matrix Formula in the Right-Quantum Algebra |
| 0 | -- | 0 | B. Y. Stodolsky. On Domination in 2-Connected Cubic Graphs |
| 0 | -- | 0 | Drew Armstrong, Sen-Peng Eu. Nonhomogeneous Parking Functions and Noncrossing Partitions |
| 0 | -- | 0 | Marcos A. Kiwi, Martin Loebl. Towards the Distribution of the Size of a Largest Planar Matching and Largest Planar Subgraph in Random Bipartite Graphs |
| 0 | -- | 0 | Khodabakhsh Hessami Pilehrood, Tatiana Hessami Pilehrood. Generating Function Identities for ζ(2n+2), ζ(2n+3) via the WZ Method |
| 0 | -- | 0 | Frank Bullock, Marietjie Frick, Joy Singleton, Susan A. van Aardt, Christina M. Mynhardt. Maximal Nontraceable Graphs with Toughness less than One |
| 0 | -- | 0 | Mario Marietti, Damiano Testa. A Uniform Approach to Complexes arising from Forests |
| 0 | -- | 0 | Guillaume Chapuy, Éric Fusy, Mihyun Kang, Bilyana Shoilekova. A Complete Grammar for Decomposing a Family of Graphs into 3-Connected Components |
| 0 | -- | 0 | Chun-Yen Shen. Quantitative Sum Product Estimates on Different Sets |
| 0 | -- | 0 | Xueliang Li, Fengxia Liu. Partitioning 3-Edge-Colored Complete Equi-Bipartite Graphs by Monochromatic Trees under a Color Degree Condition |
| 0 | -- | 0 | Yair Caro, Arieh Lev, Yehuda Roditty, Zsolt Tuza, Raphael Yuster. On Rainbow Connection |
| 0 | -- | 0 | Michael E. Picollelli. An Anti-Ramsey Condition on Trees |
| 0 | -- | 0 | Yaming Yu. Evaluation of a Multiple Integral of Tefera via Properties of the Exponential Distribution |
| 0 | -- | 0 | Arthur T. Benjamin, Alex K. Eustis, Sean S. Plott. The 99th Fibonacci Identity |
| 0 | -- | 0 | Serguei Norine, Xuding Zhu. Circular Degree Choosability |
| 0 | -- | 0 | Chin-Lin Shiue, Hung-Lin Fu. The IC-Indices of Complete Bipartite Graphs |
| 0 | -- | 0 | Bruno Courcelle. A Multivariate Interlace Polynomial and its Computation for Graphs of Bounded Clique-Width |
| 0 | -- | 0 | Weidong Gao 0001, Yuanlin Li, Jiangtao Peng, Fang Sun. Subsums of a Zero-sum Free Subset of an Abelian Group |
| 0 | -- | 0 | Evangelos Georgiadis, David Callan, Qing-Hu Hou. Circular Digraph Walks, k-Balanced Strings, Lattice Paths and Chebychev Polynomials |
| 0 | -- | 0 | Shmuel Friedland, E. Krop, Klas Markström. On the Number of Matchings in Regular Graphs |
| 0 | -- | 0 | James D. Currie, Narad Rampersad. For each α > 2 there is an Infinite Binary Word with Critical Exponent α |
| 0 | -- | 0 | Ailian Chen, Fuji Zhang, Hao Li. Rainbow H-Factors of Complete s-Uniform r-Partite Hypergraphs |
| 0 | -- | 0 | Uwe Schauz. Algebraically Solvable Problems: Describing Polynomials as Equivalent to Explicit Solutions |
| 0 | -- | 0 | Jirí Matousek, Robert Sámal. Induced Trees in Triangle-Free Graphs |
| 0 | -- | 0 | Petr Hlinený. New Infinite Families of Almost-Planar Crossing-Critical Graphs |
| 0 | -- | 0 | Ron Aharoni, Eli Berger, Agelos Georgakopoulos, Philipp Sprüssel. Strongly Maximal Matchings in Infinite Graphs |
| 0 | -- | 0 | Alexander Raichev, Mark C. Wilson. Asymptotics of Coefficients of Multivariate Generating Functions: Improvements for Smooth Points |
| 0 | -- | 0 | Stefan Felsner, Florian Zickfeld. On the Number of Planar Orientations with Prescribed Degrees |
| 0 | -- | 0 | Michael E. Hoffman. A Character on the Quasi-Symmetric Functions coming from Multiple Zeta Values |
| 0 | -- | 0 | Christian Gutschwager. On Base Partitions and Cover Partitions of Skew Characters |
| 0 | -- | 0 | Amitava Bhattacharya, Shmuel Friedland, Uri N. Peled. On the First Eigenvalue of Bipartite Graphs |
| 0 | -- | 0 | Domingos Dellamonica Jr., Yoshiharu Kohayakawa, Martin Marciniszyn, Angelika Steger. On the Resilience of Long Cycles in Random Graphs |
| 0 | -- | 0 | Alice M. Dean, Joanna A. Ellis-Monaghan, Sarah Hamilton, Greta Pangborn. Unit Rectangle Visibility Graphs |
| 0 | -- | 0 | Jujuan Zhuang. Unextendible Sequences in Finite Abelian Groups |
| 0 | -- | 0 | Roger E. Behrend. Osculating Paths and Oscillating Tableaux |
| 0 | -- | 0 | Tomasz Bartnicki, Bostjan Bresar, Jaroslaw Grytczuk, Matjaz Kovse, Zofia Miechowicz, Iztok Peterin. Game Chromatic Number of Cartesian Product Graphs |
| 0 | -- | 0 | Jason Bandlow. An Elementary Proof of the Hook Formula |
| 0 | -- | 0 | Xueliang Li, Yan Liu. 3-graphs |
| 0 | -- | 0 | Edward A. Bender, Zhicheng Gao, L. Bruce Richmond. g |
| 0 | -- | 0 | Angela Aguglia, Luca Giuzzi. 2h |
| 0 | -- | 0 | Ricky X. F. Chen. A Refinement of the Formula for k-ary Trees and the Gould-Vandermonde's Convolution |
| 0 | -- | 0 | V. Anuradha, Chinmay Jain, Jack Snoeyink, Tibor Szabó. How Long Can a Graph be Kept Planar? |
| 0 | -- | 0 | Torsten Sander. On Certain Eigenspaces of Cographs |
| 0 | -- | 0 | Ralf Schiffler. n case) |
| 0 | -- | 0 | Masaaki Harada. An Extremal Doubly Even Self-Dual Code of Length 112 |
| 0 | -- | 0 | Ligong Wang, Cornelis Hoede. Constructing Fifteen Infinite Classes of Nonregular Bipartite Integral Graphs |
| 0 | -- | 0 | Tero Harju, Dirk Nowotka. Bordered Conjugates of Words over Large Alphabets |
| 0 | -- | 0 | Diana Piguet, Maya Jakobine Stein. The Loebl-Komlós-Sós Conjecture for Trees of Diameter 5 and for Certain Caterpillars |
| 0 | -- | 0 | Guanghui Wang, Hao Li. Heterochromatic Matchings in Edge-Colored Graphs |
| 0 | -- | 0 | Ivica Bosnjak, Petar Markovic. The 11-element case of Frankl's conjecture |
| 0 | -- | 0 | Alexandr V. Kostochka, Michael Stiebitz. Partitions and Edge Colourings of Multigraphs |
| 0 | -- | 0 | Odile Favaron. Global Alliances and Independent Domination in Some Classes of Graphs |
| 0 | -- | 0 | Uwe Schauz. On the Dispersions of the Polynomial Maps over Finite Fields |
| 0 | -- | 0 | Miklós Bóna. Generalized Descents and Normality |
| 0 | -- | 0 | Drago Bokal, Gasper Fijavz, David R. Wood. The Minor Crossing Number of Graphs with an Excluded Minor |
| 0 | -- | 0 | Mary Flahive. Balancing Cyclic R-ary Gray Codes II |
| 0 | -- | 0 | Leonid Gurvits. Van der Waerden/Schrijver-Valiant like Conjectures and Stable (aka Hyperbolic) Homogeneous Polynomials: One Theorem for all |