The combinatorics of Mancala-type games: Ayo, Tchoukaitlon, and 1/pi
The combinatorics of twisted involutions in Coxeter groups
The compensation approach for walks with small steps in the quarter plane
The competition hypergraphs of doubly partial orders
The competition number of a generalized line graph is at most two
The competition number of a graph and the dimension of its hole space
The competition number of a graph in which any two holes share at most one edge
The competition number of a graph with exactly two holes
The competition numbers of Hamming graphs with diameter at most three
The competition numbers of regular polyhedra
The competition numbers of ternary Hamming graphs
The competition-common enemy graphs of digraphs satisfying Conditions $C(p)$ and $C'(p)$
The complete Generating Function for Gessel Walks is Algebraic
The Complex of Non-Crossing Diagonals of a Polygon
The complexity of approximating PSPACE-Complete problems for hierarchical specifications
The complexity of broadcasting in bounded-degree networks
The complexity of determining the rainbow vertex-connection of graphs
The Complexity of Finding Small Triangulations of Convex 3-Polytopes
The Complexity of Graph Pebbling
The Complexity of Pebbling and Cover Pebbling