External Links

    Journal: Networks

    Volume 36, Issue 4

    203 -- 209Randeep Bhatia, Samir Khuller, Robert Pless, Yoram J. Sussmann. The full-degree spanning tree problem
    210 -- 224Steven Chamberland, Brunilde Sansò. Topological expansion of multiple-ring metropolitan area networks
    225 -- 232Sun-Yuan Hsieh, Gen-Huey Chen, Chin-Wen Ho. Hamiltonian-laceability of star graphs
    233 -- 241Peiwu Zhao, Rajan Batta. An aggregation approach to solving the network p-median problem with link demands

    Volume 36, Issue 3

    147 -- 155Esther M. Arkin, Refael Hassin. Minimum-diameter covering problems
    156 -- 163Martin Erwig. The graph Voronoi diagram with applications
    164 -- 171José Gómez, Eduardo A. Canale, Xavier Muñoz. On the unilateral (Delta, D*)-problem
    172 -- 179Zeev Nutov. Approximating multiroot 3-outconnected subgraphs
    180 -- 190Lali Barrière, Josep Fàbrega, Ester Simó, Marisa Zaragozá. Fault-tolerant routings in chordal ring networks
    191 -- 201Serafino Cicerone, Gabriele Di Stefano, Michele Flammini. Low-congested interval routing schemes for hypercubelike networks

    Volume 36, Issue 2

    69 -- 79Norbert Ascheuer, Matteo Fischetti, Martin Grötschel. A polyhedral study of the asymmetric traveling salesman problem with time windows
    80 -- 90Mark E. T. Horn. Efficient modeling of travel in networks with time-varying link speeds
    91 -- 95Guy Even, Shimon Even. Embedding interconnection networks in grids via the layered cross product
    96 -- 103Petrisor Panaite, Andrzej Pelc. Impact of topographic information on graph exploration efficiency
    104 -- 113Konrad J. Swanepoel. The local Steiner problem in normed planes
    114 -- 117Colin McDiarmid, Bruce A. Reed. Channel assignment and weighted coloring
    126 -- 137Guillaume Fertin, Roger Labahn. Compounding of gossip graphs
    138 -- 146Celso C. Ribeiro, Maurício C. Souza. Tabu search for the Steiner problem in graphs

    Volume 36, Issue 1

    1 -- 8Geir Dahl, Bjørnar Realfsen. The cardinality-constrained shortest path problem in 2-graphs
    9 -- 16S. Trilochan Sastry. A characterization of the two-commodity network design problem
    17 -- 33Walid Ben-Ameur. Constrained length connectivity and survivable networks
    34 -- 46Egon Balas, Maarten Oosten. On the cycle polytope of a directed graph
    47 -- 52Jerzy Kamburowski, David J. Michael, Matthias F. M. Stallmann. Minimizing the complexity of an activity network
    53 -- 63P. T. Sokkalingam, Ravindra K. Ahuja, James B. Orlin. New polynomial-time cycle-canceling algorithms for minimum-cost flows
    64 -- 67D. DiMarco. Realizability of p-point, q-line graphs with prescribed maximum degree and line connectivity or minimum degree
    runs on