- Lucia Draque Penso, Dieter Rautenbach, Jayme Luiz Szwarcfiter. Connectivity and diameter in distance graphs. Networks, 57(4):310-315, 2011.
- Peter Damaschke. Finding hidden hubs and dominating sets in sparse graphs by randomized neighborhood queries. Networks, 57(4):344-350, 2011.
- Corinne Feremans, Martine Labbé, Adam N. Letchford, Juan José Salazar González. Generalized network design polyhedra. Networks, 58(2):125-136, 2011.
- Bernard Fortz, Luce Brotcorne. Editorial: Preface to the Special Issue. Networks, 58(2):81-82, 2011.
- Claudio Arbib, Martine Labbé, Mara Servilio. Scheduling two chains of unit jobs on one machine: A polyhedral study. Networks, 58(2):103-113, 2011.
- Isabella Lari, Federica Ricca, Andrea Scozzari, Ronald I. Becker. Locating median paths on connected outerplanar graphs. Networks, 57(3):294-307, 2011.
- Ravindra K. Ahuja, Christian Liebchen. Special issue of ::::Networks:::: on optimization in scheduled transportation networks. Networks, 57(1):1-2, 2011.
- Daniel Reich, Leo Lopes. The most likely path on series-parallel networks. Networks, 58(1):68-80, 2011.
- Teodor Gabriel Crainic, Xiaorui Fu, Michel Gendreau, Walter Rei, Stein W. Wallace. Progressive hedging-based metaheuristics for stochastic network design. Networks, 58(2):114-124, 2011.
- Luigi Moccia, Jean-François Cordeau, Gilbert Laporte, Stefan Ropke, Maria Pia Valentini. Modeling and solving a multimodal transportation problem with flexible-time and scheduled services. Networks, 57(1):53-68, 2011.