- Noga Alon, Tali Kaufman, Michael Krivelevich, Dana Ron. Testing Triangle-Freeness in General Graphs. SIAM J. Discrete Math., 22(2):786-819, 2008.
- Prasad Chebolu, Alan M. Frieze. Hamilton Cycles in Random Lifts of Directed Graphs. SIAM J. Discrete Math., 22(2):520-540, 2008.
- Jeong-Hyun Kang. L(2, 1)-Labeling of Hamiltonian graphs with Maximum Degree 3. SIAM J. Discrete Math., 22(1):213-230, 2008.
- Moshe Dror, James B. Orlin. Combinatorial Optimization with Explicit Delineation of the Ground Set by a Collection of Subsets. SIAM J. Discrete Math., 21(4):1019-1034, 2008.
- Zsolt Tuza. Hereditary Domination in Graphs: Characterization with Forbidden Induced Subgraphs. SIAM J. Discrete Math., 22(3):849-853, 2008.
- Nathan Reading. Chains in the Noncrossing Partition Lattice. SIAM J. Discrete Math., 22(3):875-886, 2008.
- Zdenek Dvorak, Riste Skrekovski, Martin Tancer. List-Coloring Squares of Sparse Subcubic Graphs. SIAM J. Discrete Math., 22(1):139-159, 2008.
- Daniel Král, Matej Stehlík. Coloring of Triangle-Free Graphs on the Double Torus. SIAM J. Discrete Math., 22(2):541-553, 2008.
- Benjamin Lévêque, Frédéric Maffray. Coloring Bull-Free Perfectly Contractile Graphs. SIAM J. Discrete Math., 21(4):999-1018, 2008.
- Marko J. Moisio. On the Duals of Binary Hyper-Kloosterman Codes. SIAM J. Discrete Math., 22(1):273-287, 2008.