| 1 | -- | 11 | Paola Bonizzoni, Riccardo Dondi, Yuri Pirola. Maximum Disjoint Paths on Edge-Colored Graphs: Approximability and Tractability |
| 12 | -- | 28 | Ye Tian, Qingwei Jin, John E. Lavery, Shu-Cherng Fang. 1 MCDA): Foundations in Two Dimensions |
| 29 | -- | 42 | Stefanos A. Nikolidakis, Dionisis Kandris, Dimitrios D. Vergados, Christos Douligeris. Energy Efficient Routing in Wireless Sensor Networks Through Balanced Clustering |
| 43 | -- | 59 | Marjan Marzban, Qian-Ping Gu. Computational Study on a PTAS for Planar Dominating Set Problem |
| 60 | -- | 83 | Ryuhei Uehara. Tractabilities and Intractabilities on Geometric Intersection Graphs |
| 84 | -- | 99 | Jason T. Isaacs, João P. Hespanha. Dubins Traveling Salesman Problem with Neighborhoods: A Graph-Based Approach |
| 100 | -- | 118 | Frank W. Takes, Walter A. Kosters. Computing the Eccentricity Distribution of Large Graphs |
| 119 | -- | 135 | Tatsuya Akutsu, Takeyuki Tamura. A Polynomial-Time Algorithm for Computing the Maximum Common Connected Edge Subgraph of Outerplanar Graphs of Bounded Degree |
| 136 | -- | 160 | Jun Ma. Algorithms for Non-Negatively Constrained Maximum Penalized Likelihood Reconstruction in Tomographic Imaging |
| 161 | -- | 168 | Tamás Király, Júlia Pap. Stable Multicommodity Flows |
| 169 | -- | 196 | David H. Bailey, Marcos López de Prado. An Open-Source Implementation of the Critical-Line Algorithm for Portfolio Optimization |