| 1567 | -- | 1580 | Pantelimon Stanica, Subhamoy Maitra. Rotation symmetric Boolean functions - Count and cryptographic properties |
| 1581 | -- | 1597 | Guoli Ding, Robert F. Lax, Jianhua Chen, Peter P. Chen. Formulas for approximating pseudo-Boolean random variables |
| 1598 | -- | 1605 | Daya Ram Gaur, Ramesh Krishnamurti. Self-duality of bounded monotone boolean functions and related problems |
| 1606 | -- | 1622 | Uwe Bubeck, Hans Kleine Büning. Models and quantifier elimination for quantified Horn formulas |
| 1623 | -- | 1632 | Deborah S. Franzblau, George Xenakis. An algorithm for the difference between set covers |
| 1633 | -- | 1636 | Martin Charles Golumbic, Aviad Mintz, Udi Rotics. An improvement on the complexity of factoring read-once Boolean functions |
| 1637 | -- | 1651 | Charles R. Johnson, Joshua A. Link. The extent to which triangular sub-patterns explain minimum rank |
| 1652 | -- | 1660 | Tinaz Ekim, Nadimpalli V. R. Mahadev, Dominique de Werra. Polar cographs |
| 1661 | -- | 1669 | Klavdija Kutnar, Dragan Marusic. On cyclic edge-connectivity of fullerenes |
| 1670 | -- | 1682 | Francesco Belardo, Enzo Maria Li Marzi, Slobodan K. Simic. Ordering graphs with index in the interval (2, sqrt(2+sqrt(5))) |
| 1683 | -- | 1693 | Jean-Philippe Hamiez, Jin-Kao Hao. Using solution properties within an enumerative search to solve a sports league scheduling problem |
| 1694 | -- | 1710 | Yoshiko Ikebe, Akihisa Tamura. On the existence of sports schedules with multiple venues |
| 1711 | -- | 1724 | Andrej Taranenko, Aleksander Vesel. Characterization of reducible hexagons and fast decomposition of elementary benzenoid graphs |
| 1725 | -- | 1735 | Anhua Lin, Rong Luo, Xiaoya Zha. A sharp lower bound of the Randic index of cacti with r pendants |
| 1736 | -- | 1753 | Robert Brijder, Hendrik Jan Hoogeboom, Michael Muskulus. Strategies of loop recombination in ciliates |
| 1754 | -- | 1779 | Hans van Maaren, Linda van Norden, M. J. H. Heule. Sums of squares based approximation algorithms for MAX-SAT |
| 1780 | -- | 1789 | M. H. Khalifeh, H. Yousefi-Azari, A. R. Ashrafi. Vertex and edge PI indices of Cartesian product graphs |
| 1790 | -- | 1801 | Xueliang Li, Chao Wang, Xiaoyan Zhang. The general sigma all-ones problem for trees |
| 1802 | -- | 1808 | Sun-Yuan Hsieh, Tzu-Hsiung Shen. Edge-bipancyclicity of a hypercube with faulty vertices and edges |
| 1809 | -- | 1821 | Shan Zhou, Heping Zhang, Ivan Gutman. Relations between Clar structures, Clar covers, and the sextet-rotation tree of a hexagonal system |
| 1822 | -- | 1837 | Boting Yang, Yi Cao. Digraph searching, directed vertex separation and directed pathwidth |
| 1838 | -- | 1845 | Li-Da Tong, Pei-Lan Yen, Alastair Farrugia. The convexity spectra of graphs |
| 1846 | -- | 1855 | D. Jacob Wildstrom. Cost thresholds for dynamic resource location |
| 1856 | -- | 1864 | Yuejian Peng, Cheng Zhao. Generating non-jumping numbers recursively |
| 1865 | -- | 1874 | Frank Gurski. Graph parameters measuring neighbourhoods in graphs - Bounds and applications |
| 1875 | -- | 1891 | Hadrien Mélot. Facet defining inequalities among graph invariants: The system GraPHedron |
| 1892 | -- | 1907 | Zheng Wenping, Lin Xiaohui, Yang Yuansheng, Deng Chengrui. On the crossing numbers of K::m::square C::n:: and K::m, l::square P::n:: |
| 1908 | -- | 1917 | Cédric Bentz. On the complexity of the multicut problem in bounded tree-width graphs and digraphs |
| 1918 | -- | 1928 | Geir Agnarsson, Ágúst S. Egilsson, Magnús M. Halldórsson. Vertex coloring acyclic digraphs and their corresponding hypergraphs |
| 1929 | -- | 1935 | J. Rietz, S. Dempe. Large gaps in one-dimensional cutting stock problems |
| 1936 | -- | 1947 | Dieter Kratsch, Haiko Müller, Ioan Todinca. Feedback vertex set on AT-free graphs |
| 1948 | -- | 1953 | Zhao Zhang, Jixiang Meng. Super-connected edge transitive graphs |