| 1 | -- | 6 | Fedor V. Fomin, Serge Gaspers, Saket Saurabh, Stéphan Thomassé. A linear vertex kernel for maximum internal spanning tree |
| 7 | -- | 22 | Florin Manea, Catalin Tiseanu. The hardness of counting full words compatible with partial words |
| 23 | -- | 38 | Stéphane Demri, Marcin Jurdzinski, Oded Lachish, Ranko Lazic. The covering and boundedness problems for branching vector addition systems |
| 39 | -- | 49 | Klaus Jansen, Stefan Kratsch, Dániel Marx, Ildikó Schlotter. Bin packing with fixed number of bins revisited |
| 50 | -- | 67 | Bhaskar DasGupta, Devendra Desai. On the complexity of Newman's community finding approach for biological and social networks |
| 68 | -- | 78 | Leslie Ann Goldberg, Mark Jerrum. Approximating the Tutte polynomial of a binary matroid and other related combinatorial polynomials |
| 79 | -- | 100 | Manuel Bodirsky, Víctor Dalmau. Datalog and constraint satisfaction with infinite templates |
| 101 | -- | 110 | Juha Honkala. The sequence equivalence problem for primitive D0L systems |
| 111 | -- | 121 | Alexander Kesselman, Kirill Kogan, Sergey Nemzer, Michael Segal. Space and speed tradeoffs in TCAM hierarchical packet classification |
| 122 | -- | 130 | Longyan Gong, Jingxin Pan, Beibei Liu, Shengmei Zhao. A novel one-time password mutual authentication scheme on sharing renewed finite random sub-passwords |
| 131 | -- | 143 | Peide Liu. Some generalized dependent aggregation operators with intuitionistic linguistic numbers and their application to group decision making |
| 144 | -- | 151 | Dániel Marx. Completely inapproximable monotone and antimonotone parameterized problems |
| 152 | -- | 172 | Yongzhi Cao, Lirong Xia, Mingsheng Ying. Probabilistic automata for computing with words |