| 379 | -- | 393 | J. Ian Munro, Gonzalo Navarro, Jesper Sindahl Nielsen, Rahul Shah, Sharma V. Thankachan. Top-k Term-Proximity in Succinct Space |
| 394 | -- | 424 | Paola Bonizzoni, Gianluca Della Vedova, Yuri Pirola, Marco Previtali, Raffaella Rizzi. An External-Memory Algorithm for String Graph Construction |
| 425 | -- | 452 | Allan Borodin, Mark Braverman, Brendan Lucier, Joel Oren. Strategyproof Mechanisms for Competitive Influence in Networks |
| 453 | -- | 491 | Timothy M. Chan, Meng He 0001, J. Ian Munro, Gelin Zhou. Succinct Indices for Path Minimum, with Applications |
| 492 | -- | 520 | Susanne Albers, Matthias Hellwig. Online Makespan Minimization with Parallel Schedules |
| 521 | -- | 557 | Jelena Marasevic, Clifford Stein, Gil Zussman. Max-min Fair Rate Allocation and Routing in Energy Harvesting Networks: Algorithmic Analysis |
| 558 | -- | 560 | Carola Doerr, Francisco Chicano. Preface to the Special Issue on Theory of Genetic and Evolutionary Computation |
| 561 | -- | 586 | Benjamin Doerr, Frank Neumann, Andrew M. Sutton. Time Complexity Analysis of Evolutionary Algorithms on Random Satisfiable k-CNF Formulas |
| 587 | -- | 609 | Christian Gießen, Carsten Witt. The Interplay of Population Size and Mutation Probability in the (1 + λ) EA on OneMax |
| 610 | -- | 640 | Carola Doerr, Johannes Lengler. OneMax in Black-Box Models with Several Restrictions |
| 641 | -- | 659 | Andrei Lissovoi, Carsten Witt. A Runtime Analysis of Parallel Evolutionary Algorithms in Dynamic Optimization |
| 660 | -- | 680 | Duc-Cuong Dang, Thomas Jansen 0001, Per Kristian Lehre. Populations Can Be Essential in Tracking Dynamic Optima |
| 681 | -- | 713 | Tiago Paixão, Jorge Pérez Heredia, Dirk Sudholt, Barbora Trubenová. Towards a Runtime Comparison of Natural and Artificial Evolution |
| 714 | -- | 740 | Dogan Corus, Jun He, Thomas Jansen 0001, Pietro Simone Oliveto, Dirk Sudholt, Christine Zarges. On Easiest Functions for Mutation Operators in Bio-Inspired Optimisation |