| Ghidewon Abay-Asmerom*, Richard H. Hammack, Dewey T. Taylor, A Variation of the Lexicographic Product of Graphs |
| Josh Abbott*, Trevor McGuire*, Using Graphs and Games to generate Cap Set Bounds |
| Julian Allagan*, Peter Johnson, The Choice Number of K(4,2,...,2) |
| Matthew Alpert*, Elie Feder*, Heiko Harborth, The Maximum of the Maximum Rectilinear Crossing Numbers of d-regular
Graphs of Order n |
| Richard Anstee*, Farzin Barekat, Some Non-simple Forbidden Configurations and Design Theory |
| Hemant Balakrishan*, Narsingh Deo, Extracting communities in large real-world networks |
| Miklos Bartha, Deciding the flexibility of matchings in open graphs |
| LeRoy B. Beasley*, David E. Brown, K. Brooks Reid, Extending Partial Tournaments |
| Gordon Beavers*, A. Gregory Starling, The Structure of Row-Column Sorting Networks |
| Ashley Bechel*, Britni LaBounty-Lay, Universal Cycles of Functions |
| Robert A. Beeler*, Trina M. Wooten, Open Labellings on Graphs |
| Fabricio Siqueira Benevides*, Jozef Skokan, The 3-colored Ramsey Number of Even Cycles |
| Jeffrey J. Beyerl*, Robert E. Jamison, Interval Graphs Where No Interval Contains Two Others |
| Ramesh Bhandari, The Sliding Shortest Path Algorithm with Finite Weight Changes |
| Jeffery Boats*, Lazaros Kikas, John Oleksik, Finding Disjoint Paths in the General Nova Graph |
| B.B. Bobga*, P.D. Johnson Jr., More Sporadic Evidence for the Affirmative, in Cropper's Problem
|
| Vladimir Božović*, Daniel Socek and Shanzhen Gao, Bipartite Graphs With No Isolated Vertices And k-Tuples Of Discrete Intervals |
| David E. Brown*, Arthur H. Busch, Garth Isaak, Recognition Algorithms and Structural Characterizations for Bipartite Toleranceand Bipartite Probe Interval Graphs |
| Zac Buelow*, Kim A. S. Factor and Alicia Crow, Local Out-Tournaments with Upset Tournament Strong Components: Real and Nonnegative Integer Ranks of Adjacency Matrices |
| Vincent Castellana*, Dean Hoffman, On the Spectrum of Minimal Covers By Triples |
| Pinglong You, Wai Chee Shiu, Wai Hong Chan*, An Chang, The Interchanging graphs associated with sorting by transpositions |
| Andrew Chen, Yet Another Formula for The Number of Spanning Trees of A Graph |
| D.V. Chopra*, Richard M. Low, R. Dios, On Some Combinatorial Arrays |
| Sylwia Cichacz, 2-splittable and cordial graphs |
| Diana Combe, Generalised Bhaskar Rao designs with block size k = 3 |
| Ermelinda DeLaVina*, Ryan Pepper, Bill Waller, On Some Conjectures About the Maximum Order of Induced Bipartite Subgraphs |
| A. Delgado*, M.L. Gargano, M. Lewinter, L.V. Quintas,
On the properties of k-long numbers |
| Mahmoud El-Hashash*, Heidi Burgiel, On the Hamiltonicity of the Permutahedron |
| John W. Emert*, Roger B. Nelson, Frank W. Owens*, Multiple Towers of Hanoi with a Directed Cycle Transition Graph |
| Rosa I. Enciso*, Ronald D. Dutton, Parameterized Complexity of the Secure Sets Problem |
| Anthony B. Evans, Orthogonal latin squares based on nonabelian groups |
| Kim A. S. Factor*, Larry J. Langley, Digraphs with Isomorphic Underlying and Domination Graphs: Pairs of Paths |
| Joshua Fallon*, Shanzhen Gao, Shaun Sullivan, Elements of Sn of order dividing a given number |
| Daniela Ferrero, Connectivity of Walk Graphs |
| Arthur Finbow*, Allen Frendrup, Preben Dahl Vestergaard, Total Well-Dominated Trees |
| Stephen Finbow, Seepage in directed acyclic graphs |
| D. Berman, N. Finizio*, D. Smith, Splittable Whist Designs |
| Shannon Fitzpatrick, Copwin Edge Critical Graphs |
| R. Flack*, S. Houghten, Generation of Good Edit Codes from Classical Hamming Distance Codes |
| Patrick W. Fowler*, Barry T. Pickup, Tsanka Z. Todorova, Single-molecule conductors: a new use for old characteristic polynomials |
| A. Delgado, D. Gagliardi*, M.L. Gargano, M. Lewinter, W. Widulski, Subcubes of the hypercube Qn |
| Shanzhen Gao*, Kenneth Matheis, Enumeration of (0,1,2)-Matrices |
| Leslie Gardner*, Octavian Nicolio*, A Maximum Flow Algorithm to Locate Non-attacking Queens on an NxN Chessboard |
| Edgar G. DuCasse,
Michael L. Gargano*, Louis V. Quintas, The Edge-Weight Sums of a Graph mod n |
| Robert M. Gargano*,
Michael L. Gargano,
Edgar G. DuCasse, Louis V. Quintas, Optimal Eulerian Cycles Using Immune System Genetic Algorithms |
| John P. Georges*, David Mauro, Yan Wang*, Some results on λx-invertible graphs |
| Joseph Fox, Ralucca Gera*, Pantelimon Stanica, The Independence Number for the Generalized Petersen Graphs |
| Mark Ginn, Differentials on Paths and Grids |
| Henry Glover*, Klavdija Kutnar, Dragan Marušič, Hamiltonian cycles in finite cubic Cayley graphs: the < 2, 4k, 3 > case |
| Eric Gottlieb, Posets from Fair Division |
| Ralph P. Grimaldi, The Distribution of 0’s and 1’s in Jacobsthal Strings |
| Vince Grolmusz*, Gábor Iván, Zoltán Szabadka, Broken Symmetry in Proteins |
| Sul-young Choi, Puhua Guan*, On critical square-free subgraphs of hypercubes |
| D. S. Gunderson*, K. R. Johannson, On bounds for the van der Waerden number W(3; r) |
| Heiko Harborth, Turán Numbers for Chessboard Graphs |
| Elizabeth Harris*, Joshua Berry, Sierpiński Square Graphs |
| Arthur Finbow, Bert Hartnell*, Heather Pickup, Equi-2-matchable Graphs |
| Stephen Hedetniemi*, Sandra Hedetniemi, Secondary Domination in Graphs |
| Brandy Hicks*, Robert E. Jamison, Decompositions of Prisms into Matchings |
| Yiu Yu Ho*, Ronald D. Dutton, A Dynamic Programming Model for k-packing and Other Invariants on Trees |
| Markus Hohenwarter, GeoGebra - free software for dynamic geometry, algebra and calculus |
| Brad Bailey, John Holliday*, Dianna Spence, Cutting Numbers of Cycles and Edge Cut Cycles |
| L.H. Clark, S. Holliday*, J.P. McSorley, T.D. Porter, Enumerating Labelled Graphs with Certain Neighborhood Properties |
| Robert Gardner, Tracy Holt*, Decompositions of the Complete Symmetric Digraph into Orientations of the 4-Cycle with a Pendant Edge |
| Eddie Cheng, Oakland University, Philip Hu*, Roger Jia, Connectivity Properties of Directed Hyperstars |
| Suhkjin Hur, The Kuratowski covering conjecture for graphs of order ≤ 9 |
| Garth Isaak*, Lehigh University, Darren Narayan, On line rankings and the arank number |
| Jobby Jacob*, Wayne Goddard, Generalized Dominator Partitions of Graphs |
| David P. Jacobs*, Catia M. S. Machado, Elaine C. Pereira,Vilmar Trevisan, Computing the Inverse of a Tree’s Incidence Matrix |
| Alan C. Jamieson, Some Graph Classes and the Wimer Edge Variant |
| Lindsay H. Jamieson, Alliances in Generalized Series Parallel Graphs |
| Robert E. Jamison, A General Theory of Graph Representations |
| Janine E. Janoski*, Neil Calkin, Matrices of Row and Column Sum 2 |
| Pallavi Jayawant*, Peter Wong, Combinatorial Analog of Dyson’s Theorem |
| Darin Johnson*, Lane Clark, On the Independent Domination Number of a Random Graph |
| Adam Gouge, Dean Hoffman, Peter Johnson*, Laura Nunley, Luke Paben, Edge-colorings of cliques that forbid rainbow cycles |
| Arnfried Kemnitz*, Jens-Peter Bode, Andrea Hackmann, Rebecca Klages, Circular Total Colorings of Graphs |
| Melissa Keranen*, Donald Kreher, Artem Zhuravlev, Small Group Divisible Steiner Quadruple Systems |
| Mrinal Khanvilkar*, Dionysios Kountanis, Ala Al-Fuqaha, Dynamic routing for a static physical network through embedding |
| R. Sternfeld, C. Roberts, D. Koster, L. Taylor, R. Killgrove*, Latin Squares Of Orders 5, 8 & More |
| Edward C. Carr, Joseph B. Klerlein*, Hamiltonicity in Cn X Cm after a single push |
| Anja Kohl, On the Minimal Order of k−chromatic Kr+1−free Graphs |
| Emre Kolotoğlu*,
Emine Şule Yazıcı, On minimal defining sets of self-complementary designs |
| Mark Korenblit*, Vadim E. Levit, Minimal Cuts in Two-Terminal Directed Acyclic Graphs |
| Mellisa Keranen, William Kocay, Donald L. Kreher*, Ben Li, The hypergraph degree sequence problem |
| Josh Laison*, John Watkins, Luc Wilson, Dual Unfoldings of Polyhedra |
| David E. Brown, Larry J. Langley*, A Characterization of Bipartite Unit Probe Interval Graphs |
| Martin Grüttmüller, Thomas Kalinowski, Sven Hartmann, Uwe Leck*, Ian Roberts, Maximal flat antichains of minimum weight |
| Hanno Lefmann, Distributions of Points and Small Point Sets with Large Area |
| Vadim E. Levit*, Eugen Mandrescu, Graph Operations and Partial Unimodality of Independence Polynomials |
| A. Delgado, M.L. Gargano, M. Lewinter*, L.V. Quintas, Spanning-tree-center vertices of a graph |
| Robert E. Jamison, J. Bowman Light*, Chromatic Spectrum of 2-matching Decompositions of K5,n |
| Drew J. Lipman*, Marc J. Lipman, An algorithm for finding the influence digraph of a Time-Stamped Graph |
| Marc J. Lipman, Complete sphere-of-influence graphs of point-sets with large second distance |
| Eddie Cheng, Lászlo Lipták*, Lih-Hsing Hsu, Cheng-Kuan Lin, Jimmy J. M. Tan, A Tree Labelling Problem |
| Marc Loizeaux*, Lucas van der Merwe, Edge Critical Graphs with Endvertices |
| Richard M. Low*, W.C. Shiu, The Group-magic Labeling Problem: Theorems, Counter-examples, and Open Problems |
| Lorraine L. Lurie*,
Michael L. Gargano,
Marty Lewinter,
Robert M. Gargano, Anthony Delgado, Coalition Theory in Teaching Proof, Combinatorics & Set Concepts |
| Jeremy Lyle*, Wayne Goddard, Ore-type conditions for homomorphisms of dense Kr-free graphs |
| Michael L. Gargano,
Marty Lewinter, Joseph F. Malerba*, Degree Symmetric Bipartite Graphs and Equivalent Representations |
| Kenneth Matheis*, Shanzhen Gao, Enumeration of (-1,0,1)-Matrices |
| Gregory McColm, Thresholds and Achlioptas Games |
| Terry A. McKee, When Fundamental Cycles Span Cliques |
| Kathleen A. McKeon, The Generalized Chromatic Number of Graphs |
| Elizabeth McMahon, Color-Permuting Automorphisms of Cayley Graphs |
| Lucas van der Merwe*, Marc Loizeaux, Francesco Barioli, A Family of 4-Critical Graphs with Diameter Three |
| Piotr Blass, Amy Mihnea*, Clustering Protocols and Algorithms |
| Asamoah Nkwanta, Lattice Paths, RNA Matrices, and RNA Secondary Structures |
| Gary Chartrand, Stephen T. Hedetniemi, Futaba Okamoto*, Ping Zhang, A Four Colorings Theorem |
| Shilpa Das Gupta, J. Richard Lundgren, Elena Ortega*, A Class of Interval Digraphs |
| Sibel Ozkan*, Chris A. Rodger, Generalization of the Erdős-Gallai Inequality |
| N. Carnes, A. Dye, S. Parkerson*, K. Stewart, Concerning sufficient conditions for 1,M,N-antiautomorphisms of Directed Triple Systems |
| Paul Peart*, Wenjin Woan, Barbara Tenkersley, Weighted Increasing Trees, Exponential Riordan Matrices and Moments |
| Vera Pless, Self-dual and Formally Self-dual Codes |
| Peter Johnson, David Prier*, Matthew Walsh, Variants of a prize problem of Steve Hedetniemi |
| Pinar Heggernes, Daniel Meister,
Andrzej Proskurowski*, Minimum Distortion Embeddings into a Line |
| David Rivshin, Stanisław Radziszowski*, Reconstruction Numbers of Small Graphs |
| Geoffrey Exoo, Ville Junnila, Tero Laihonen, Sanna Ranto*, Locating vertices using an identifying code |
| Ago-Erik Riet*, Fabricio S. Benevides, Jeffrey P. Wheeler, Jonathan Hulgan, Nathan Lemons, Cory Palmer, A generalization of Sidon sets to two sets of natural numbers |
| Miranda L. Roden*, Peter J. Slater, The Domination Continuum on Trees |
| Robert R. Rubalcaba, If Vizing had lived in the Roman Empire |
| Sushmita Ruj*, Bimal Roy, Traitor Tracing Schemes To Identify All Traitors Using Combinatorial Designs |
| Laura Helbing, John T. Saccoman*, Spanning Trees of Ideal Non-Proper Split graphs |
| Joe Sawada*, Roy Li, A Gray Code for Reflectible Languages |
| James M. Scanlon*, Narsingh Deo, Network Communities Based on Maximizing Average Degree |
| Arnfried Kemnitz, Jochen Harant, Akira Saito, Ingo Schiermeyer*, Closures, cycles and paths |
| Doug Bauer, Nathan Kahl, Ed Schmeichel*, Strongest Monotone Degree Conditions |
| Hamilton Scott*, Jennifer Woodell, Anant Godbole, Happiness Levels in Random Matchings |
| C. A. Rodger, Nidhi Sehgal*, 4–cycle decompositions of the line graphs of complete multipartite graphs |
| Suk Jai Seo*, Peter J. Slater, Open neighborhood locating-dominating sets |
| Lou Shapiro, Six Catalan Identities in Search of Good Proofs |
| Eddie Cheng, Nart Shawash*, The (n, k)-Bubble Sort Graphs |
| ZhiZhang Shen*, Ke Qiu, An Explicit Formula of the Suarface Area for the Star Graph and Its Correctness Proof |
| Wai Chee Shiu, Invariant Factors of Cartesian Product and One Point Unions of Graphs |
| Ramesh Bhandari, Daniel Short*, A Constrained Minimum Cost Cut-Set Problem |
| Italo Simonelli, Optimal graphs for chromatic polynomials |
| Miranda L. Roden, Peter J. Slater*, The Domination Continuum |
| Gary E. Stevens, Watching Star Wars Every Way Possible: The Shortest String Containing All Permutations |
| N. Carnes, A. Dye, S. Parkerson, K. Stewart*, Concerning Bicyclic Antiautomorphisms of Mendelsohn Triple Systems |
| Sin-Min Lee, Hsin-Hao Su*, Yung-Chin Wang, On the Integer-Magic Spectra of Honeycomb Graphs |
| Daniel Gross, John Saccoman, L. William Kazmierczak, Charles Suffel*, Antonius Suhartomo, On Component Order Edge Connectivity of a Complete Bipartite Graph |
| Shaun Sullivan*, Shanzhen Gao, Joshua Fallon, Minimal Sizes of Binary Linear Forms |
| Isak Taksa, Improving efficiency of a query formulation method |
| H. Tapia-Recillas*, J.C. Ku, Almost-Bent Functions and Secret Sharing Schemes |
| Ghidewon Abay-Asmerom, Richard H. Hammack, Dewey T. Taylor*, Total Perfect Codes in Tensor Products of Graphs |
| Greg Tener*, Narsingh Deo, Efficient Isomorphism for Miyazaki Graphs |
| Koen Thas, p-Modular Cohomology Algebras of Extra-Special Groups, and Symplectic Forms, Prime Power Conjectures, Automorphisms and Buildings of Rank 2 |
| Peter Johnson, Michael Tiemeyer*, Coloring the Rational Points in Space to Forbid Two Distances |
| Peter Tittmann, Counting Connected Vertex Partitions |
| Hoa Tran, Network Security Risk: an approach to Computing Model |
| Mahadevan Vasudevan*, Narsingh Deo, Efficient Intrusion-Detection using Programmable Agents based on Attack Graph Patterns |
| Peter Hamburger, Attila Por, Matt Walsh*, Kneser representations of graphs |
| Mark Ellingham, Adam Weaver*, Constructing all minimum genus embeddings of K3,n |
| S. Lee, H. Sun, I. Wen, W. Wei*, P. Yiu, Lower Bounds for the Numbers of SEG Labellings of Some Tree Families |
| Erik Westlund*, Donald Kreher, Hamilton Decompositions of Cayley Graphs on Finite Abelian Groups |
| A. Delgado, D. Gagliardi, M.L. Gargano, M. Lewinter, W. Widulski*, Even-Pancyclic Subgraphs of Meshes |
| Robert A. Beeler, Trina M. Wooten*, Edge-Induced and Vertex-Induced Cycles Within Circulant Graphs |
| Nick Wormald, Methods and results for random regular graphs |
| Nick Wormald, Properties of graphs of large girth |
| Joshua Yarmish, Gavriel Yarmish*, Arithmetic with Very Large Integers Using Parallel Processing |
| Carl Yerger*, Luke Postle, Noah Streib, Pebbling graphs of diameter three |
| Hilmi Yildirim*, M. S. Krishnamoorthy, Narsingh Deo, A Study of the Sudoku Graph Family |
| Jing Zhang*, Dionysios Kountanis, Ala Al-Fuqaha, Resource Conservation Cluster Routing in Wireless Mobile Ad Hoc Networks |
| Gary Chartrand, Ladislav Nebeský, Ping Zhang*, Hamiltonian Colorings of Graphs |
