- J.M. Byskov, Maker-maker and maked-breaker games are PSPACE-complete
- B. Doerr, European tenure games
- D. Hefetz, M. Krivelevich, T. Szabó, Hamilton cycles in highly connected graphs
- N. Alon, M. Krivelevich, J. Spencer, T. Szabó, Discrepancy games
- I. Benjamin, G. Kozma, L. Lovász, D. Romik, G. Tardos, Waiting for a bat to fly by (in polynomialtime)
- E. Berger, I.B. Hartman, Proof of Bergés Strong path partition conjecture for k=2
- I.B. Hartman, A new proof of Bergés strong path partition conjecture for acyclic graphs
- L.S. Chandran, T. Kavitha, The carvingwidth of hypercubes
- T. Feder, C. Subi, Disks on a tree: analysis of a combinatorial game
- P. Pitteloud, Chromatic polynomials and the symmetric group
- C.C. Yang, Perfectness of the complements of circular complete graphs
- S. Felsner, Orthogonal structures in directed graphs
- R. Pinachi, M. Sharir, On graphs that do not contain the cube and related problems
- A. Gyárfás, G. Simonyi, Edge colorings of complete graphs without tricolored triangles
- G. Fan, Path decomposition and Gallai 's conjecture
- M. Copper, A. Gyárfás, J. Lehel, Hall ratio of the Mycielski graphs
- Y. Chen, Z. Füredi, Hamiltonian Kneser graphs
- S. Brandt, M. Wozniak, On cyclic packing of a tree
- N. Linial, M. Saks, D. Statter, The non-crossing graph
- N. Alon, E. Lubetzky, Graph powers, Delsarte, Hoffman, Ramsey and Shannon
- M.J. Pelsmajer, M. Schaefer, D. Stefankovic, Removing even crossings
- E. Biermele, J.A. Bondy, B.A. Reed, The Erdős-Pósa property for long circuits
- C. Thomassen, Exponentially many 5-list-colorings of planar graphs
- M. Chudnovsky, P. Seymour, The roots of the independende polynomial of a clawfree graph
- O. Aichholzer, J. Garcia, D. Orden, P. Ramos, New lower bounds for the number of ( < k+1)-edges and rectilinear crossing number of K_n
- K.C. Garrett, K. Hummel, A combinatorial proof of the sum of q-cubes
- Y. Suzuki, Graphs that triangulate a given surface and quadrangulate another surface
- J. Pach, R. Radoicic, G. Tardos, G. Toth, Improving the crossing lemma by finding more crossings in sparse graphs
- N. Alon, E. Lubetzky, Codes and xor graph products