| Atif Abueida*, Christian Hampson, Multidecomposition of the Complete Graph into
Graph Pairs of Order 5 with Various Leaves |
| Glenn Acree*, Stephen Campbell, On the bounds for the crossing number of the generalized Petersen graph GP(nh,n) |
| Tomoko Adachi, Cluttered orderings for the complete tripartite graph K3t,3t,3t |
| Geir Agnarsson, On Coin Graphs and Other Contact Graphs |
| Soumen Maity, Chrisil Arackaparambil*, Kezhasono Meyase, Construction of Cryptographically Significant Boolean Functions |
| Ziya Arnavut, Investigation of Permutations codes Burrows-Wheeler Transformed Data |
| Maria Axenovich*, Jozsef Balogh, Graphs having small number of sizes on induced k- subgraphs |
| Roxanne Baker*, Dean Hoffman, K4-e Design on Complete Graphs with Holes |
| Hemant Balakrishnan*, Narsingh Deo, Evolution in Web Graphs |
| József Balogh*, Béla Bollobás, Robert Morris, Hereditary properties of partitions |
| Amir Barghi, Chromatic Polynomial of Some Chains of Graphs and Some Infinite Graphs |
| LeRoy B. Beasley*, David E. Brown, Preservers of Regular Tournaments |
| Robert A. Beeler*, Robert E. Jamison, Decompositions of Graphs |
| Jürgen Bierbrauer, A direct approach to linear programming bounds |
| Thomas Böhme*, Tobias Gerlach, and Michael Stiebitz, Ordered and linked chordal graphs |
| David E. Brown* , Larry Langley, Probe Interval Orders, and Unit Probe Interval Graphs |
| LaKeisha Brown* and Robert Gardner, Restricted and Unrestricted Hexagon Coverings of the Complete Bipartite Graph |
| Arthur H. Busch, On the minimum number of hamiltonian paths in a strong tournament |
| Shanzhen Gao, Cafer Caliskan*, Some Sets Based on Lucas’s Theorem and a Recent paper of George Andrews |
| Patrick Callahan*, Phyllis Chinn, Silvia Heubach, Tiling rectangles with polyominoes and structures of associated graphs |
| Neil P. Carnes, A Class of Antiautomorphisms of Directed Triple Systems |
| Yuqing Chen, Twisted Kronecker product of cocyclic generalized Hadamard matrices |
| Eddie Cheng*, Meelap Shah, Structural Properties of Hyper-Stars |
| Dharam V. Chopra, On Some Combinatorial Arrays |
| Ping-Tsai Chung*, Sin-Min Lee, On Super Edge-Graceful Labelings of Even Trees |
| Nancy E. Clarke*, Emma L. Connon, Cops, Robber, and Alarms |
| Stephen Curran, The Number of Hamilton Paths in Cayley Digraphs |
| Peter Dankelmann*, Gert Sabadussi, Embedding graphs as isometric medians |
| Sean Daugherty*, Wendy Myrvold, A Fast Exponential Algorithm for Computing the Closed-Shell Independence Number of Fullerenes |
| Chris Rodger, Chandra Dinavahi*, Maximum packings of a complete graph with copies of paths off length 3 which contain no proper subsystems |
| Maria Patricia Dobson*, Marisa Gutierrez , Jayme L Szwarcfiter, Treelike Comparability Graphs |
| Mary Ann Coleman, Nathan Drake*, Gretchen L. Matthews, Parameters of codes from quotients of Hermitian curves |
| Matthieu Dufour*, Jean M. Turgeon, Nim-like games played on the edges of a graph |
| Ronald Dutton, Secure Set Algorithms and Complexity |
| Roger B. Eggleton, Taxonomy of Graphs of Order 10 |
| Joanna Ellis-Monaghan*, Irasema Sarmiento, Pendant Duplicate Graphs and the Interlace Polynomial |
| M. R. Emamy-K., The cut number and cut-complex characterization of the 5-cube: A computer free approach |
| Jay S. Bagga, John W. Emert*, J. Michael McGrew, Frank W. Owens, On Avoiding a Clash of Arms at a Round Table |
| Alexander Engau, Playing the Taxman means Paying the Taxman |
| Henry E. Escuadro, Distinguishing Vertices Through Edge Coloring |
| Gilbert Eyabi*, Renu Laskar, Holes in L(2,1) Colorings on Certain Classes of Graphs |
| James D. Factor, Using Weighted Graphs to Produce Geometric Curves |
| Jason M. Darby, Kim A. S. Factor*, Rebecca M. Kohler, Local Out-Tournaments Constructed with Upset Tournaments, and Related Matrix Ranks of {0,1}-Matrices |
| Mike Ferrara*, Mike Jacobson, Mark Siggers, Potentially H-Bigraphic Sequences |
| Norman J. Finizio, Primitive Polynomials over Composite Galois Fields |
| Mike Fisher, The Jump Number of a Split Graph |
| Patrick Fowler*, Daniel Horspool, Wendy Myrvold, Naming and counting fullerenes: vertex and face spirals |
| Dalibor Froncek, Cheesecake Factory Design |
| Yuichiro Fujiwara, Sparseness of Steiner triple systems and group actions |
| Daniel Gagliardi*, Aloysius Helminck, Algorithms for computing characters of symmetric spaces |
| Shanzhen Gao*, Zhonghua Tan, Some Enumerative Problems Of (0, 1)−Matrices |
| Michael L. Gargano, Consensus of Expert Phylogenic Trees Using Genetic Algorithms |
| Ralucca Gera*, Craig Rasmussen, Steve Horton, Dominator Colorings and Safe Clique Partitions |
| Mike Ferrara, Jesse Gilbert*, Mike Jacobson,Thor Whalen On the Irregularity Strength of Digraphs |
| Lucia Gionfriddo, On Hexagon Systems |
| Gary Gordon, Matroid automorphisms and the icosahedron |
| Ralph P. Grimaldi, Sums of k-th Summands in Compositions |
| Vince Grolmusz, Sixtors and Mod 6 Computations |
| Hans-Dietrich O.F. Gronau, A new Fisher type inequality for super–simple designs |
| Daniel Gross*, Frank Boesch, L. William Kazmierczak, Charles Suffel, Antonius Suhartomo, Some Generalizations of Graph Connectivity Parameters |
| Robert Gardner, Chrysanthus Gwellem*, Janice Lewenczuk, Maximal Cyclic 4-Cycle Packings and Minimal Cyclic 4-Cycle Coverings of the Complete Graph |
| Ruth Haas* , Aloysius G. Helminck, The Computational Efficiency of Permutation Notation for Weyl Groups |
| Heiko Harborth, Independent bishops on hexagon and triangle boards |
| Bert Hartnell, On graphs with t different sizes of maximal independent sets |
| Richard Harvey *, Michael L. Gargano, Minimal Ordered Spanning Trees Solved By Using a Self-Adapting Genetic Algorithm With Multiple Genomic Representations |
| Silvia Heubach*, Toufik Mansour, Staircase Tilings and Lattice Paths |
| A.J.W. Hilton, (r,r+1)-factorizations of simple graphs with different numbers of factors |
| Amy Hlavacek*, Garry Johns, J. P. Huneke, 9-Vertex Irreducible Graphs for the Torus |
| Andreas Brandstädt, Chinh Hoáng*, Maximum Induced Matchings for Chordal Graphs in Linear Time |
| Robert Hochberg, A Program for Proving that a Given Graph is not a Unit-Distance Graph |
| D.G. Hoffman, A Covering Conjecture |
| John Holliday*, Peter Johnson, The Shields-Harary Numbers of the complete bipartite graph Km,n for Continuous Concave Cost Functions Vanishing at One |
| Sally A. Clark, John E. Holliday, Sarah H. Holliday*, Peter D. Johnson, Jr, Janet E. Trimm, Robert R. Rubalcaba, Matt P. Walsh, Notes on the Villainy of a Graph |
| Tracy L. Holt*, Jeff E. Worley, Anant Godbole, Domination Cover Pebbling Numbers of Certain Graphs |
| Jenny Buontempo, Brian Hopkins*, Tableaux Cycling and Catalan Numbers |
| Margaret Francel, Spencer Hurd*, Nested Ternary Designs, Bhaskar Rao Designs and Skolem Sequences |
| Terri Buchanan, Kevin Hutson*, Douglas Shier, A “Loop-free” Extension of the Distributed Bellman-Ford Algorithm |
| Arthur H. Busch and Garth Isaak*, Recognizing Bipartite Tolerance Graphs |
| Wayne Goddard, Jobby Jacob*, Renu Laskar, On the Upper dominator partition number of certain graphs |
| Robert E. Jamison, A Unified Lattice Cryptomorphy for Matroids and Antimatroids |
| Mahendra Jani*, Melkamu Zeleke, Motzkin Numbers and k-Trees |
| Susan Janiszewski*, Amin Y. Teymorian, Hao Wang, Vladimir D. Tonchev, Optimal Conflict-Avoiding Codes for Limited Number of Active Users |
| Susan Janiszewski, Masakazu Jimbo*, Miwako Mishima, Amin Y. Teymorian, Vladimir Tonchev, An optimal conflict-avoiding code of length n = 4m for three active users |
| Jerrold R. Griggs, Xiaohua Teresa Jin*, Real Number Radio Channel Assignment for the Lattices |
| Dean Hoffman, Pete Johnson*, Rob Rubalcaba, Matt Walsh, Minimum pth Power Domination in Graphs |
| Dawn M. Jones*, Richard Low, A-magic labelings of Cartesian Products of Trees and Regular Graphs |
| Arthur Busch, Michael Ferrara, Nathan Kahl*, Generalizing D-Graphs |
| Yoshihiro Kaneko*, Yuya Sasaki, Betweenness of Tournaments |
| Arnfried Kemnitz, Coloring the Line |
| Jefferey Boats, Lazaros Kikas*, John Oleksik, An Algorithm for Finding Disjoint Paths in the Alternating Group Graph |
| Edward C. Carr, Joseph B. Klerlein*, More on Hamiltonian Cycles in Cn X Cm –Sk |
| Christian Krattenthaler, Plane partitions, alternating sign matrices, six vertex model, fully
packed loop configurations, dense O(1) loop model, and more |
| Mike Ferrara, Mike Jacobson, Nathan Kurtz*, Vertices of the Same Degree in Tournaments |
| Dharam Chopra, Harris Kwong*, Sin-Min Lee, On Edge-Magic (p, 3p − 1)-Graphs |
| Peter Che Bor Lam*, Guohua Gu, Wai Chee Shiu, Graphs with convex labelings |
| Rebecca Lambert, Bicolored Pebbling of Graphs |
| David Benko, Claus Ernst, Dominic Lanphier*, Integrity of Planar Graphs |
| Robert Jamison, Renu Laskar*, Beth Novick, On vertex Ordering of Graphs |
| Reinhard Laue*, Alfred Wassermann, Large sets of t-designs from t-homogeneous groups |
| Andrew C. Lee, Discovering Preferences via Queries |
| Hanno Lefmann, On the Independence Number of Non-uniform Linear Hypergraphs |
| Vadim E. Levit*, Eugen Mandrescu, Partial unimodality of the independence polynomial for König-Egerváry graphs |
| Robert E. Jamison, J. Bowman Light*, On an Edge-Intersection Problem of Mendelsohn |
| Drew J. Lipman*, Marc J. Lipman, Induced Cycles in the Influence Digraph of a Time-Stamped Graph |
| Marc J. Lipman, Induced Paths in the Influence Digraph of a Time-Stamped Graph |
| Eddie Cheng, László Lipták*, Investigating structural properties on Cayley graphs generated by transpositions |
| Nicholas Loehr, The Exogenesis of the hans.math.upenn.edu-Warrington-Loehr “TEN to the Power N” Conjecture |
| Sasha L. Logan*, Thomas R. Whitt III, 4-Cycle Decompositions of λK2m − F |
| Lucas van der Merwe, Marc Loizeaux*, 4-Critical Graphs with Diameter Two |
| Wai Chee Shiu, Richard M. Low*, The entire edge–graceful spectra of cycles with one chord |
| Michael L. Gargano, Lorraine Lurie*, A Hybrid Approach to Solving the Archaeological Seriation Problem |
| Jeremy Lyle*, Renu Laskar, On Fall Colorings of Chordal Graphs |
| Mohammad Mahdian, Random popular matchings |
| A. A. Khanban, M. Mahdian, Ebad S. Mahmoodian*, A linear algebraic approach to orthogonal arrays and latin squares |
| Yasuko Matsui, An Algorithm for Enumerating All Tree Matchings for Ordered Trees |
| Robert E. Jamison, Gretchen L. Matthews*, Distance two colorings and their relatives on products of trees and cycles |
| Renu Laskar, Bonnie McAdoo*, Varieties of Centers in Trees |
| L. McCauley*, C.A.Rodger, Hamilton Cycle Rich 2-Factorizations of Complete Multipartite Graphs |
| Terry A. McKee, Chordless Cycles in Line Graphs |
| Kathleen A. McKeon, Sum-Saturating Labelings of Trees |
| J. Bratz, P. Cahn, N. Haber, Elizabeth McMahon*, S. Tekansik, More Results on Color-Preserving Automorphisms of Cayley Graphs |
| Dan McQuillan*, Katy Smith, Vertex-magic total labeling of multiple complete graphs |
| Lucas van der Merwe*, Marc Loizeaux, γt-Critical Graphs with Endvertices |
| Mariusz Meszka*, Zdzislaw Skupien, Decompositions of Complete Multidigraphs into Paths |
| Aaron Meyerowitz, Tutte Polynomials for Grids |
| P. Micikevicius*, S. Caminiti, N. Deo, Linear-time Algorithms for Encoding Trees as Sequences of Node Labels |
| David Mittiga, Properties of Zig-Zag Products |
| Elizabeth Moseman, Combinatorial Worms |
| Melissa Berg, Ron Mullin*, Non-existence of a PBD of Drake and Larson |
| Wendy Myrvold*, Patrick Fowler, Fast Enumeration of All Independent Sets of a Graph |
| Sanjeeb Nanda*, Narsingh Deo, Methods for Placing Data and Parity to Tolerate Two Disk Failures in Disk Arrays Using Complete Bipartite Graphs |
| Asamoah Nkwanta, Counting Non-contiguous simple sequence repeats in DNA sequences |
| Futaba Okamoto*, Ping Zhang, Measures of Traceability in Graphs |
| Naoki Tsushima, Masakazu Jimbo, Kazuhiro Ozawa*, Constructions of optimal designs for diallel cross experiments |
| Sibel Ozkan*, Chris A. Rodger, Partial Hamilton decompositions of complete graphs with no 2-factor in the leave |
| I.F.Blake, E.C.Park*, Repeated Steiner Systems |
| Atif A. Abueida, Mike Daven, Wiebke S. Diestelkamp, Stephanie P. Edwards, Darren B. Parker*, Multidesigns for Graph-Triples of Order 6 |
| Carl S. Pettis, The Δ- Intersection Problem for Hexagon Triple Systems |
| Robert E. Jamison, Ben Phillips*, Confinement and Graph Substitution |
| J. H. Hattingh, E. Jonck, E. J. Joubert, A. R. Plummer*, Total Restrained Domination in Trees |
| George B. Purdy, A Collision-free Cryptographic Hash Function Based on Factorization |
| Yulan Qing*, John Watkins, Knight's Tour on Surfaces and in 3-Dimension |
| Ke Qiu, Optimal Broadcasting Algorithm for Multiple Messages on the Star and Pancake Graphs Using Minimal Dominating Sets |
| Neil J. Calkin, Kevin James, Shannon Purvis, Shaina Race*, Keith Schneider, Matthew Yancey, Counting Kings: As Easy As λ1, λ2, λ3 . . . |
| Mary Radcliffe*, Ping Zhang, Irregular Colorings of Graphs |
| Stanislaw P. Radziszowski, Progress on Hendry’s Tables of Ramsey Numbers |
| Ralucca Gera, Craig Rasmussen*, Pantelimon Stanica, Steve Horton, Preliminary Results on the Minimum Sum Vertex Cover Problem |
| Adam Drake, Timothy A. Redl*, On the Enumeration of a Class of Non-Graceful Graphs |
| Robert W. Robinson, Counting Feynman Diagrams for Direct and Indirect Interactions |
| Jason Rosenhouse, Group Actions on Arithmetic Riemann Surfaces |
| Robert R. Rubalcaba*, Peter J. Slater, Efficient multiple domination |
| S. Bleiler, J.T. Saccoman*, A surgery reducing the number of spanning trees for certain threshold graphs |
| Louis Shapiro, Lifoma Salaam*, Bijections involving the sequence 1,6,29,130… |
| Ebrahim Salehi*, Sin-Min Lee, On Friendly Index Sets of Trees |
| Ingo Schiermeyer, A new upper bound for the chromatic number of a graph |
| Hans-Dietrich Gronau, Markus Schmidmeier*, Orthogonal Double Covers by Graphs of Group Automorphisms |
| Robert R. Rubalcaba, Andrew Schneider*, On graphs which satisfy ρ(G) = γ(G) |
| Neil J. Calkin, Kevin James, Shannon Purvis, Shaina Race, Keith Schneider*, Matthew Yancey, Counting Kings: Estimating Eigenvalues Of Recursive Matrices |
| Mary Scott*, Glenn Acree, An upper bound for the crossing number of Kr,s x Cn |
| Suk Jai Seo*, Peter J. Slater, The Competition Number of Directed Cycles in a Graph |
| Patric R. J. Östergård, Esa A. Seuranen*, New Lower Bounds for Asymmetric Covering Codes |
| Louis W. Shapiro, Hill Runs |
| W.C. Shiu*, P.C.B. Lam, P.K. Sun, Incidence Coloring and Edge Coloring on Regular Graphs |
| Anne Sinko*, Peter J. Slater, Efficient Domination for Knights Graphs |
| Peter Slater, Permuted, Deranged, Summarily Deranged (An Autobiography?) |
| David R. Berman and Douglas D. Smith*, Brother – Avoiding Round Robin Doubles Tournaments (BARRDTs) |
| Alexander Soifer, New Results on Covering Triangles & Squares |
| Shelley K. Speiss*, Darren A. Narayan, Holey Knight’s Tours |
| Robert E. Jamison, Alan P. Sprague*, Sum-Product Graphs and Other Rank Tolerance Classes |
| N. Jonoska, G. L. McColm, A. Staninska*, The Graph of a Pot with DNA molecules |
| A. Gregory Starling*, Brian C. Mashburn, Gordon Beavers, Merging in Mixed Radix Sorting Networks |
| Jens-Matthias Bohli, Benjamin Glas, Rainer Steinwandt*, Combinatorial Group Theory and Side Channel Attacks: Normal Form Computation in Braid Groups and DPA |
| Kenjiro Takazawa, A Weighted Even Factor Algorithm |
| Isak Taksa, Using a matrix space model for text categorization |
| H. Tapia-Recillas, The Simplex Code over Z2s and
Ramanujan Sums |
| Barry Tesman, Distinct Total T-Colorings of Graphs |
| Hoa Tran, Stochastic Security Risk Computing |
| P. C. Li, D. R. Stinson, G. H. J. van Rees*, R. Wei, On {123,124,134}-free Hypergraphs |
| Ping-Tsai Chung, Richard Van Slyke*, Free Steering Update Schemes for Distributed Flow Control |
| Patric R. J. Östergård, Vesa Vaskelainen*, Algorithms for the Combinatorial Best Barbeque Problem |
| P.D. Vestergaard*, Anders Sune Pedersen, On the Number of Independent Sets in Unicyclic Graphs |
| M. Gionfriddo, L. Milazzo, V.Voloshin*, Upper chromatic index of a multigraph and related problems |
| Ermelinda DeLaViña, Ryan Pepper, Bill Waller*, Computer Generated Sufficient Conditions for Hamiltonian Paths |
| W. D. Wallis, Graphs with a unique champion |
| Atif Abueida, Robert Rubalcaba, Matthew Walsh*, (a, b)-domination: a framework for some domination parameters |
| Tran van Trung, Spyros Magliveras, Wandi Wei*, On primitive sets of a lattice |
| Robert E. Jamison, Joseph H. White*, Graphs Representable by a Packing of Matchings |
| William D. May, John C. Wierman*, Algorithms for Non-Crossing Partitions |
| Linda Eroh, John Koker, Hosien Moghadam, Steven J. Winters*, Edge-Deleted Eccentricities of Graphs |
| Matt Gordon, G Gordon Worley III*, Reducing the Problem of Finding Security Number |
| Neil J. Calkin, Kevin James, Shannon Purvis, Shaina Race, Keith Schneider, Matthew Yancey*, Counting Kings: Higher Dimensions |
| Melkamu Zeleke*, Mahendra Jani, Ordered Trees and q-Catalan Numbers |
