| 1 | -- | 8 | Helmut Prodinger. Digital search trees with m trees: Level polynomials and insertion costs |
| 9 | -- | 16 | Xin Zhang 0017, Jianliang Wu, Guizhen Liu. New Upper Bounds for the Heights of Some Light Subgraphs in 1-Planar Graphs with High Minimum Degree |
| 17 | -- | 20 | David Wood. On the number of maximal independent sets in a graph |
| 21 | -- | 38 | Ramin Kazemi, Mohammad Vahidi-Asl. The Variance of The Profile in Digital Search Trees |
| 39 | -- | 44 | David R. Wood, Vida Dujmovic. On the Book Thickness of k-Trees |
| 45 | -- | 50 | Andrzej Dudek, David Wajc. On the complexity of vertex-coloring edge-weightings |
| 51 | -- | 66 | Petr Ambroz, Anna E. Frid, Zuzana Masáková, Edita Pelantová. On the number of factors in codings of three interval exchange |
| 67 | -- | 74 | Monika Pilsniak, Mariusz Wozniak. On packing of two copies of a hypergraph |
| 75 | -- | 86 | Yidong Sun, Yanjie Xu. The largest singletons in weighted set partitions and its applications |
| 87 | -- | 96 | Michael A. Henning, Ernst J. Joubert, Justin Southey. Nordhaus-Gaddum Type Results for Total Domination |
| 97 | -- | 110 | Min Chen, André Raspaud, Weifan Wang. 8-star-choosability of a graph with maximum average degree less than 3 |