@article{Bailey-Smith-Alden/08,
AUTHOR = {Bailey, Matthew D. and Smith, Robert L. and Alden, Jeffrey M.},
TITLE = {A reach and bound algorithm for acyclic dynamic-programming networks},
JOURNAL = {Networks},
VOLUME = {52},
NUMBER = {1},
PAGES = {1-7},
YEAR = {2008},
EDITOR = {Golden, Bruce L. and Shier, Douglas R.},
URL = {http://dx.doi.org/10.1002/net.20219},
PUBLISHER = {John Wiley \& Sons},
ADDRESS = {Hoboken},
}
@article{Ben-Ameur-Neto/08,
AUTHOR = {Ben-Ameur, Walid and Neto, Jos{\'{e}}},
TITLE = {Spectral bounds for the maximum cut problem},
JOURNAL = {Networks},
VOLUME = {52},
NUMBER = {1},
PAGES = {8-13},
YEAR = {2008},
EDITOR = {Golden, Bruce L. and Shier, Douglas R.},
URL = {http://dx.doi.org/10.1002/net.20220},
PUBLISHER = {John Wiley \& Sons},
ADDRESS = {Hoboken},
}
@article{Sharkey-Romeijn/08,
AUTHOR = {Sharkey, Thomas C. and Romeijn, H. Edwin},
TITLE = {A simplex algorithm for minimum-cost network-flow problems in infinite networks},
JOURNAL = {Networks},
VOLUME = {52},
NUMBER = {1},
PAGES = {14-31},
YEAR = {2008},
EDITOR = {Golden, Bruce L. and Shier, Douglas R.},
URL = {http://dx.doi.org/10.1002/net.20221},
PUBLISHER = {John Wiley \& Sons},
ADDRESS = {Hoboken},
}
@article{Levin-Paulusma-Woeginger/08a,
AUTHOR = {Levin, Asaf and Paulusma, Daniel and Woeginger, Gerhard J.},
TITLE = {The computational complexity of graph contractions II: Two tough polynomially solvable cases},
JOURNAL = {Networks},
VOLUME = {52},
NUMBER = {1},
PAGES = {32-56},
YEAR = {2008},
EDITOR = {Golden, Bruce L. and Shier, Douglas R.},
URL = {http://dx.doi.org/10.1002/net.20249},
PUBLISHER = {John Wiley \& Sons},
ADDRESS = {Hoboken},
}
@article{Bauer-Haugland-Yuan/08,
AUTHOR = {Bauer, Joanna and Haugland, Dag and Yuan, Di},
TITLE = {Analysis and computational study of several integer programming formulations for minimum-energy multicasting in wireless ad hoc networks},
JOURNAL = {Networks},
VOLUME = {52},
NUMBER = {2},
PAGES = {57-68},
YEAR = {2008},
EDITOR = {Golden, Bruce L. and Shier, Douglas R.},
URL = {http://dx.doi.org/10.1002/net.20222},
PUBLISHER = {John Wiley \& Sons},
ADDRESS = {Hoboken},
}
@article{Yong-Zhang-Golin/08,
AUTHOR = {Yong, Xuerong and Zhang, Yuanping and Golin, Mordecai J.},
TITLE = {The number of spanning trees in a class of double fixed-step loop networks},
JOURNAL = {Networks},
VOLUME = {52},
NUMBER = {2},
PAGES = {69-77},
YEAR = {2008},
EDITOR = {Golden, Bruce L. and Shier, Douglas R.},
URL = {http://dx.doi.org/10.1002/net.20223},
PUBLISHER = {John Wiley \& Sons},
ADDRESS = {Hoboken},
}
@article{Lu-Wu-Chen-Lv/08,
AUTHOR = {L{\"{u}}, Min and Wu, Chao and Chen, Guo-Liang and Lv, Cheng},
TITLE = {On super connectivity of Cartesian product graphs},
JOURNAL = {Networks},
VOLUME = {52},
NUMBER = {2},
PAGES = {78-87},
YEAR = {2008},
EDITOR = {Golden, Bruce L. and Shier, Douglas R.},
URL = {http://dx.doi.org/10.1002/net.20224},
PUBLISHER = {John Wiley \& Sons},
ADDRESS = {Hoboken},
}
@article{Shirabe/08,
AUTHOR = {Shirabe, Takeshi},
TITLE = {Minimum work paths in elevated networks},
JOURNAL = {Networks},
VOLUME = {52},
NUMBER = {2},
PAGES = {88-97},
YEAR = {2008},
EDITOR = {Golden, Bruce L. and Shier, Douglas R.},
URL = {http://dx.doi.org/10.1002/net.20225},
PUBLISHER = {John Wiley \& Sons},
ADDRESS = {Hoboken},
}
@article{Shachnai-Zhang-Matsui/08,
AUTHOR = {Shachnai, Hadas and Zhang, Lisa and Matsui, Tomomi},
TITLE = {Exact algorithms for the master ring problem},
JOURNAL = {Networks},
VOLUME = {52},
NUMBER = {2},
PAGES = {98-107},
YEAR = {2008},
EDITOR = {Golden, Bruce L. and Shier, Douglas R.},
URL = {http://dx.doi.org/10.1002/net.20226},
PUBLISHER = {John Wiley \& Sons},
ADDRESS = {Hoboken},
}
@article{Pan-Morton/08,
AUTHOR = {Pan, Feng and Morton, David P.},
TITLE = {Minimizing a stochastic maximum-reliability path},
JOURNAL = {Networks},
VOLUME = {52},
NUMBER = {3},
PAGES = {111-119},
YEAR = {2008},
EDITOR = {Golden, Bruce L. and Shier, Douglas R.},
URL = {http://dx.doi.org/10.1002/net.20238},
PUBLISHER = {John Wiley \& Sons},
ADDRESS = {Hoboken},
}
@article{Janjarassuk-Linderoth/08,
AUTHOR = {Janjarassuk, Udom and Linderoth, Jeff},
TITLE = {Reformulation and sampling to solve a stochastic network interdiction problem},
JOURNAL = {Networks},
VOLUME = {52},
NUMBER = {3},
PAGES = {120-132},
YEAR = {2008},
EDITOR = {Golden, Bruce L. and Shier, Douglas R.},
URL = {http://dx.doi.org/10.1002/net.20237},
PUBLISHER = {John Wiley \& Sons},
ADDRESS = {Hoboken},
}
@article{Bayrak-Bailey/08,
AUTHOR = {Bayrak, Halil and Bailey, Matthew D.},
TITLE = {Shortest path network interdiction with asymmetric information},
JOURNAL = {Networks},
VOLUME = {52},
NUMBER = {3},
PAGES = {133-140},
YEAR = {2008},
EDITOR = {Golden, Bruce L. and Shier, Douglas R.},
URL = {http://dx.doi.org/10.1002/net.20236},
PUBLISHER = {John Wiley \& Sons},
ADDRESS = {Hoboken},
}
@article{Ozdaglar/08,
AUTHOR = {Ozdaglar, Asuman},
TITLE = {Price competition with elastic traffic},
JOURNAL = {Networks},
VOLUME = {52},
NUMBER = {3},
PAGES = {141-155},
YEAR = {2008},
EDITOR = {Golden, Bruce L. and Shier, Douglas R.},
URL = {http://dx.doi.org/10.1002/net.20239},
PUBLISHER = {John Wiley \& Sons},
ADDRESS = {Hoboken},
}
@article{Dagan-Gal/08,
AUTHOR = {Dagan, Arnon and Gal, Shmuel},
TITLE = {Network search games, with arbitrary searcher starting point},
JOURNAL = {Networks},
VOLUME = {52},
NUMBER = {3},
PAGES = {156-161},
YEAR = {2008},
EDITOR = {Golden, Bruce L. and Shier, Douglas R.},
URL = {http://dx.doi.org/10.1002/net.20241},
PUBLISHER = {John Wiley \& Sons},
ADDRESS = {Hoboken},
}
@article{Alpern/08,
AUTHOR = {Alpern, Steve},
TITLE = {Hide-and-seek games on a tree to which Eulerian networks are attached},
JOURNAL = {Networks},
VOLUME = {52},
NUMBER = {3},
PAGES = {162-166},
YEAR = {2008},
EDITOR = {Golden, Bruce L. and Shier, Douglas R.},
URL = {http://dx.doi.org/10.1002/net.20235},
PUBLISHER = {John Wiley \& Sons},
ADDRESS = {Hoboken},
}
@article{Flocchini-Huang-Luccio/08,
AUTHOR = {Flocchini, Paola and Huang, Miao Jun and Luccio, Flaminia L.},
TITLE = {Decontamination of hypercubes by mobile agents},
JOURNAL = {Networks},
VOLUME = {52},
NUMBER = {3},
PAGES = {167-178},
YEAR = {2008},
EDITOR = {Golden, Bruce L. and Shier, Douglas R.},
URL = {http://dx.doi.org/10.1002/net.20240},
PUBLISHER = {John Wiley \& Sons},
ADDRESS = {Hoboken},
}
@article{Kuo-Fu/08,
AUTHOR = {Kuo, Jyhmin and Fu, Hung-Lin},
TITLE = {On the diameter of the generalized undirected de Bruiin graphs $UG_B(n,m),n^2,<m\leq n^3$},
JOURNAL = {Networks},
VOLUME = {52},
NUMBER = {4},
PAGES = {180-182},
YEAR = {2008},
EDITOR = {Golden, Bruce L. and Shier, Douglas R.},
URL = {http://dx.doi.org/10.1002/net.20273},
PUBLISHER = {John Wiley \& Sons},
ADDRESS = {Hoboken},
}
@article{Fuchs/08,
AUTHOR = {Fuchs, Bernhard},
TITLE = {On the hardness of range assignment problems},
JOURNAL = {Networks},
VOLUME = {52},
NUMBER = {4},
PAGES = {183-195},
YEAR = {2008},
EDITOR = {Golden, Bruce L. and Shier, Douglas R.},
URL = {http://dx.doi.org/10.1002/net.20227},
PUBLISHER = {John Wiley \& Sons},
ADDRESS = {Hoboken},
}
@article{Balbuena-Garcia-Vazquez-Marcote-Valenzuela/08,
AUTHOR = {Balbuena, C. and Garc{\'{i}}a-V{\'{a}}zquez, P. and Marcote, X. and Valenzuela, J.C.},
TITLE = {Conditional diameter saturated graphs},
JOURNAL = {Networks},
VOLUME = {52},
NUMBER = {4},
PAGES = {196-201},
YEAR = {2008},
EDITOR = {Golden, Bruce L. and Shier, Douglas R.},
URL = {http://dx.doi.org/10.1002/net.20230},
PUBLISHER = {John Wiley \& Sons},
ADDRESS = {Hoboken},
}
@article{Yang-Xu/08,
AUTHOR = {Yang, Chao and Xu, Jun-Ming},
TITLE = {Reliability of interconnection networks modeled by Cartesian product digraphs},
JOURNAL = {Networks},
VOLUME = {52},
NUMBER = {4},
PAGES = {202-205},
YEAR = {2008},
EDITOR = {Golden, Bruce L. and Shier, Douglas R.},
URL = {http://dx.doi.org/10.1002/net.20231},
PUBLISHER = {John Wiley \& Sons},
ADDRESS = {Hoboken},
}
@article{Brostrom-Holmberg/08,
AUTHOR = {Brostr{\"{o}}m, Peter and Holmberg, Kaj},
TITLE = {Valid cycles: A source of infeasibility in open shortest path first routing},
JOURNAL = {Networks},
VOLUME = {52},
NUMBER = {4},
PAGES = {206-215},
YEAR = {2008},
EDITOR = {Golden, Bruce L. and Shier, Douglas R.},
URL = {http://dx.doi.org/10.1002/net.20232},
PUBLISHER = {John Wiley \& Sons},
ADDRESS = {Hoboken},
}
@article{Klasing-Markou-Radzik-Sarracco/08,
AUTHOR = {Klasing, Ralf and Markou, Euripides and Radzik, Tomasz and Sarracco, Fabiano},
TITLE = {Approximation bounds for Black Hole Search problems},
JOURNAL = {Networks},
VOLUME = {52},
NUMBER = {4},
PAGES = {216-226},
YEAR = {2008},
EDITOR = {Golden, Bruce L. and Shier, Douglas R.},
URL = {http://dx.doi.org/10.1002/net.20233},
PUBLISHER = {John Wiley \& Sons},
ADDRESS = {Hoboken},
}
@article{Baiou-Barahona/08,
AUTHOR = {Ba{\"{i}}ou, Mourad and Barahona, Francisco},
TITLE = {A linear programming approach to increasing the weight of all minimum spanning trees},
JOURNAL = {Networks},
VOLUME = {52},
NUMBER = {4},
PAGES = {227-234},
YEAR = {2008},
EDITOR = {Golden, Bruce L. and Shier, Douglas R.},
URL = {http://dx.doi.org/10.1002/net.20242},
PUBLISHER = {John Wiley \& Sons},
ADDRESS = {Hoboken},
}
@article{Caragiannis-Kaklamanis-Papaioannou/08,
AUTHOR = {Caragiannis, Ioannis and Kaklamanis, Christos and Papaioannou, Evi},
TITLE = {Competitive algorithms and lower bounds for online randomized call control in cellular networks},
JOURNAL = {Networks},
VOLUME = {52},
NUMBER = {4},
PAGES = {235-251},
YEAR = {2008},
EDITOR = {Golden, Bruce L. and Shier, Douglas R.},
URL = {http://dx.doi.org/10.1002/net.20244},
PUBLISHER = {John Wiley \& Sons},
ADDRESS = {Hoboken},
}
@article{Rautenbach-Volkmann/08,
AUTHOR = {Rautenbach, Dieter and Volkmann, Lutz},
TITLE = {Cyclic sums, network sharing, and restricted edge cuts in graphs with long cycles},
JOURNAL = {Networks},
VOLUME = {52},
NUMBER = {4},
PAGES = {252-255},
YEAR = {2008},
EDITOR = {Golden, Bruce L. and Shier, Douglas R.},
URL = {http://dx.doi.org/10.1002/net.20243},
PUBLISHER = {John Wiley \& Sons},
ADDRESS = {Hoboken},
}
@article{Carlyle-Royset-Wood/08,
AUTHOR = {Carlyle, W. Matthew and Royset, Johannes O. and Wood, R. Kevin},
TITLE = {Lagrangian relaxation and enumeration for solving constrained shortest-path problems},
JOURNAL = {Networks},
VOLUME = {52},
NUMBER = {4},
PAGES = {256-270},
YEAR = {2008},
EDITOR = {Golden, Bruce L. and Shier, Douglas R.},
URL = {http://dx.doi.org/10.1002/net.20247},
PUBLISHER = {John Wiley \& Sons},
ADDRESS = {Hoboken},
}
@article{Bang-Jensen-Jordan/08,
AUTHOR = {Bang-Jensen, Jorgen and Jord{\'{a}}n, Tibor},
TITLE = {On persistent directed graphs},
JOURNAL = {Networks},
VOLUME = {52},
NUMBER = {4},
PAGES = {271-276},
YEAR = {2008},
EDITOR = {Golden, Bruce L. and Shier, Douglas R.},
URL = {http://dx.doi.org/10.1002/net.20248},
PUBLISHER = {John Wiley \& Sons},
ADDRESS = {Hoboken},
}
@article{Lin-Lea/08,
AUTHOR = {Lin, Bey-Chi and Lea, Chin-Tau},
TITLE = {Multiratae nonblocking multicast $\log_2(N, m, p)$ networks},
JOURNAL = {Networks},
VOLUME = {52},
NUMBER = {4},
PAGES = {277-286},
YEAR = {2008},
EDITOR = {Golden, Bruce L. and Shier, Douglas R.},
PUBLISHER = {John Wiley \& Sons},
ADDRESS = {Hoboken},
}
@article{Christophe-Dewez-Doignon-Fasbender-Gregoire-Huygens-Labbe-Elloumi-Melot-Yaman/08,
AUTHOR = {Christophe, Julie and Dewez, Sophie and Doignon, Jean-Paul and Fasbender, Gilles and Gr{\'{e}}goire, Philippe and Huygens, David and Labb{\'{e}}, Martine and Elloumi, Sourour and M{\'{e}}lot, Hadrien and Yaman, Hande},
TITLE = {Linear inequalities among graph invariants: Using GraPHedron to uncover optimal relationships},
JOURNAL = {Networks},
VOLUME = {52},
NUMBER = {4},
PAGES = {287-298},
YEAR = {2008},
EDITOR = {Golden, Bruce L. and Shier, Douglas R.},
URL = {http://dx.doi.org/10.1002/net.20250},
PUBLISHER = {John Wiley \& Sons},
ADDRESS = {Hoboken},
}
@article{Colbourn-Quattrocchi-Syrotiuk/08,
AUTHOR = {Colbourn, Charles J. and Quattrocchi, Gaetano and Syrotiuk, Violet R.},
TITLE = {Lower bounds for two-period grooming via linear programming duality},
JOURNAL = {Networks},
VOLUME = {52},
NUMBER = {4},
PAGES = {299-306},
YEAR = {2008},
EDITOR = {Golden, Bruce L. and Shier, Douglas R.},
URL = {http://dx.doi.org/10.1002/net.20251},
PUBLISHER = {John Wiley \& Sons},
ADDRESS = {Hoboken},
}
@article{Colbourn-Quattrocchi-Syrotiuk/08a,
AUTHOR = {Colbourn, Charles J. and Quattrocchi, Gaetano and Syrotiuk, Violet R.},
TITLE = {Grooming for two-period optical networks},
JOURNAL = {Networks},
VOLUME = {52},
NUMBER = {4},
PAGES = {307-324},
YEAR = {2008},
EDITOR = {Golden, Bruce L. and Shier, Douglas R.},
URL = {http://dx.doi.org/10.1002/net.20252},
PUBLISHER = {John Wiley \& Sons},
ADDRESS = {Hoboken},
}
@article{Cordasco-Gargano-Negro-Scarano-Hammar/08,
AUTHOR = {Cordasco, G. and Gargano, L. and Negro, A. and Scarano, V. and Hammar, M.},
TITLE = {F-chord: Improved uniform routing on Chord},
JOURNAL = {Networks},
VOLUME = {52},
NUMBER = {4},
PAGES = {325-332},
YEAR = {2008},
EDITOR = {Golden, Bruce L. and Shier, Douglas R.},
URL = {http://dx.doi.org/10.1002/net.20253},
PUBLISHER = {John Wiley \& Sons},
ADDRESS = {Hoboken},
}
@article{Gendreau-Iori-Laporte-Martello/08,
AUTHOR = {Gendreau, Michel and Iori, Manuel and Laporte, Gilbert and Martello, Silvaro},
TITLE = {A tabu search heuristic for the vehicle routing problem with two-dimensional loading constraints},
JOURNAL = {Networks},
VOLUME = {51},
NUMBER = {1},
PAGES = {4-18},
YEAR = {2008},
EDITOR = {Gallo, Giorgio and Scuttel{\`a}, Maria Grazia},
URL = {http://dx.doi.org/10.1002/net.20192},
PUBLISHER = {John Wiley \& Sons},
ADDRESS = {Hoboken},
NOTE = {see Erratum in Networks, Vol. 51, 2008, No. 2, 153-153},
}
@article{Labbe-Yaman/08,
AUTHOR = {Labb{\'{e}}, Martine and Yaman, Hande},
TITLE = {Solving the hub location problem in a star-star network},
JOURNAL = {Networks},
VOLUME = {51},
NUMBER = {1},
PAGES = {19-33},
YEAR = {2008},
EDITOR = {Gallo, Giorgio and Scuttel{\`a}, Maria Grazia},
URL = {http://dx.doi.org/10.1002/net.20193},
PUBLISHER = {John Wiley \& Sons},
ADDRESS = {Hoboken},
}
@article{Duhamel-Gouveia-Moura-Souza/08,
AUTHOR = {Duhamel, Christophe and Gouveia, Luis and Moura, Pedro and Souza, Mauricio},
TITLE = {Models and heuristics for a minimum arborescence problem},
JOURNAL = {Networks},
VOLUME = {51},
NUMBER = {1},
PAGES = {34-47},
YEAR = {2008},
EDITOR = {Gallo, Giorgio and Scuttel{\`a}, Maria Grazia},
URL = {http://dx.doi.org/10.1002/net.20194},
PUBLISHER = {John Wiley \& Sons},
ADDRESS = {Hoboken},
}
@article{Jha-Ahuja-Sahin/08,
AUTHOR = {Jha, Krishna C. and Ahuja, Ravindra K. and {\c{S}}ahin, G{\"{u}}ven{\c{c}}},
TITLE = {New approaches for solving the block-to-train assignment problem},
JOURNAL = {Networks},
VOLUME = {51},
NUMBER = {1},
PAGES = {48-62},
YEAR = {2008},
EDITOR = {Gallo, Giorgio and Scuttel{\`a}, Maria Grazia},
URL = {http://dx.doi.org/10.1002/net.20195},
PUBLISHER = {John Wiley \& Sons},
ADDRESS = {Hoboken},
}
@article{Bompadre-Orlin/08,
AUTHOR = {Bompadre, Agust{\'{i}}n and Orlin, James B.},
TITLE = {A simple method for improving the primal simplex method for the multicommodity flow problem},
JOURNAL = {Networks},
VOLUME = {51},
NUMBER = {1},
PAGES = {63-77},
YEAR = {2008},
EDITOR = {Gallo, Giorgio and Scuttel{\`a}, Maria Grazia},
URL = {http://dx.doi.org/10.1002/net.20196},
PUBLISHER = {John Wiley \& Sons},
ADDRESS = {Hoboken},
}
@article{Apollonio-Lari-Ricca-Simeone-Puerto/08,
AUTHOR = {Apollonio, N. and Lari, I. and Ricca, F. and Simeone, B. and Puerto, J.},
TITLE = {Polynomial algorithms for partitioning a tree into single-center subtrees to minimize flat service costs},
JOURNAL = {Networks},
VOLUME = {51},
NUMBER = {1},
PAGES = {78-89},
YEAR = {2008},
EDITOR = {Gallo, Giorgio and Scuttel{\`a}, Maria Grazia},
URL = {http://dx.doi.org/10.1002/net.20197},
PUBLISHER = {John Wiley \& Sons},
ADDRESS = {Hoboken},
}
@article{Hsieh/08a,
AUTHOR = {Hsieh, Sun-Yuan},
TITLE = {Some edge-fault-tolerant properties of the folded hypercube},
JOURNAL = {Networks},
VOLUME = {51},
NUMBER = {2},
PAGES = {92-101},
YEAR = {2008},
EDITOR = {Gallo, Giorgio and Scuttel{\`a}, Maria Grazia},
URL = {http://dx.doi.org/10.1002/net.20204},
PUBLISHER = {John Wiley \& Sons},
ADDRESS = {Hoboken},
}
@article{Scutella/08,
AUTHOR = {Scutell{\`{a}}, Maria G.},
TITLE = {The maximum congested cut problem and its robust counterpart: Exact and approximation algorithms for the single and the multicommodity case},
JOURNAL = {Networks},
VOLUME = {51},
NUMBER = {2},
PAGES = {102-112},
YEAR = {2008},
EDITOR = {Gallo, Giorgio and Scuttel{\`a}, Maria Grazia},
URL = {http://dx.doi.org/10.1002/net.20205},
PUBLISHER = {John Wiley \& Sons},
ADDRESS = {Hoboken},
}
@article{van_den_Heuvel-Johnson/08,
AUTHOR = {van den Heuvel, Jan and Johnson, Matthew},
TITLE = {Transversals of subtree hypergraphs and the source location problem in digraphs},
JOURNAL = {Networks},
VOLUME = {51},
NUMBER = {2},
PAGES = {113-119},
YEAR = {2008},
EDITOR = {Gallo, Giorgio and Scuttel{\`a}, Maria Grazia},
URL = {http://dx.doi.org/10.1002/net.20206},
PUBLISHER = {John Wiley \& Sons},
ADDRESS = {Hoboken},
}
@article{Hicks/08,
AUTHOR = {Hicks, Illya V.},
TITLE = {New facets for the planar subgraph polytope},
JOURNAL = {Networks},
VOLUME = {51},
NUMBER = {2},
PAGES = {120-132},
YEAR = {2008},
EDITOR = {Gallo, Giorgio and Scuttel{\`a}, Maria Grazia},
URL = {http://dx.doi.org/10.1002/net.20207},
PUBLISHER = {John Wiley \& Sons},
ADDRESS = {Hoboken},
}
@article{de_Souza-Mahey-Gendron/08,
AUTHOR = {de Souza, Mauricio C. and Mahey, Philippe and Gendron, Bernard},
TITLE = {Cycle-based algorithms for multicommodity network flow problems with separable piecewise convex costs},
JOURNAL = {Networks},
VOLUME = {51},
NUMBER = {2},
PAGES = {133-141},
YEAR = {2008},
EDITOR = {Gallo, Giorgio and Scuttel{\`a}, Maria Grazia},
URL = {http://dx.doi.org/10.1002/net.20208},
PUBLISHER = {John Wiley \& Sons},
ADDRESS = {Hoboken},
}
@article{Onal-Wang/08,
AUTHOR = {{\"{O}}nal, Hayri and Wang, Yicheng},
TITLE = {A graph theory approach for designing conservation reserve networks with minimal fragmentation},
JOURNAL = {Networks},
VOLUME = {51},
NUMBER = {2},
PAGES = {142-152},
YEAR = {2008},
EDITOR = {Gallo, Giorgio and Scuttel{\`a}, Maria Grazia},
URL = {http://dx.doi.org/10.1002/net.20211},
PUBLISHER = {John Wiley \& Sons},
ADDRESS = {Hoboken},
}
@article{Gendreau-Iori-Laporte-Martello/08a,
AUTHOR = {Gendreau, Michel and Iori, Manuel and Laporte, Gilbert and Martello, Silvano},
TITLE = {Erratum to ``A tabu search heuristic for the vehicle routing problem with two-dimensional loading constraints''},
JOURNAL = {Networks},
VOLUME = {51},
NUMBER = {2},
PAGES = {153-153},
YEAR = {2008},
EDITOR = {Gallo, Giorgio and Scuttel{\`a}, Maria Grazia},
URL = {http://dx.doi.org/10.1002/net.20245},
PUBLISHER = {John Wiley \& Sons},
ADDRESS = {Hoboken},
NOTE = {Originally in Networks, Vol. 51, 2008, No. 1, 4-18},
}
@article{Righini-Salani/08,
AUTHOR = {Righini, Giovanni and Salani, Matteo},
TITLE = {New dynamic programming algorithms for the resource constrained elementary shortest path problem},
JOURNAL = {Networks},
VOLUME = {51},
NUMBER = {3},
PAGES = {155-170},
YEAR = {2008},
EDITOR = {Gallo, Giorgio and Scuttel{\`a}, Maria Grazia},
URL = {http://dx.doi.org/10.1002/net.20212},
PUBLISHER = {John Wiley \& Sons},
ADDRESS = {Hoboken},
}
@article{Lai-Chen/08,
AUTHOR = {Lai, Cheng-Nan and Chen, Gen-Huey},
TITLE = {$w$-Rabin numbers and strong $w$-Rabin numbers of folded hypercubes},
JOURNAL = {Networks},
VOLUME = {51},
NUMBER = {3},
PAGES = {171-177},
YEAR = {2008},
EDITOR = {Gallo, Giorgio and Scuttel{\`a}, Maria Grazia},
URL = {http://dx.doi.org/10.1002/net.20213},
PUBLISHER = {John Wiley \& Sons},
ADDRESS = {Hoboken},
}
@article{Levin-Paulusma-Woeginger/08,
AUTHOR = {Levin, Asaf and Paulusma, Daniel and Woeginger, Gerhard J.},
TITLE = {The computational complexity of graph contractions I: Polynomially solvable and $NP$-complete cases},
JOURNAL = {Networks},
VOLUME = {51},
NUMBER = {3},
PAGES = {178-189},
YEAR = {2008},
EDITOR = {Gallo, Giorgio and Scuttel{\`a}, Maria Grazia},
URL = {http://dx.doi.org/10.1002/net.20214},
PUBLISHER = {John Wiley \& Sons},
ADDRESS = {Hoboken},
}
@article{Baveja/08,
AUTHOR = {Baveja, Alok},
TITLE = {The fractional congestion bound for efficient edge disjoint routing},
JOURNAL = {Networks},
VOLUME = {51},
NUMBER = {3},
PAGES = {190-199},
YEAR = {2008},
EDITOR = {Gallo, Giorgio and Scuttel{\`a}, Maria Grazia},
URL = {http://dx.doi.org/10.1002/net.20216},
PUBLISHER = {John Wiley \& Sons},
ADDRESS = {Hoboken},
}
@article{Wang-Lin/08a,
AUTHOR = {Wang, Shiying and Lin, Shangwei},
TITLE = {Sufficient conditions for a graph to be super restricted edge-connected},
JOURNAL = {Networks},
VOLUME = {51},
NUMBER = {3},
PAGES = {200-209},
YEAR = {2008},
EDITOR = {Gallo, Giorgio and Scuttel{\`a}, Maria Grazia},
URL = {http://dx.doi.org/10.1002/net.20217},
PUBLISHER = {John Wiley \& Sons},
ADDRESS = {Hoboken},
}
@article{Cami-Deo/08,
AUTHOR = {Cami, Aurel and Deo, Narsingh},
TITLE = {Techniques for analyzing dynamic random graph models of web-like networks: An overview},
JOURNAL = {Networks},
VOLUME = {51},
NUMBER = {4},
PAGES = {211-255},
YEAR = {2008},
EDITOR = {Gallo, Giorgio and Scuttel{\`a}, Maria Grazia},
URL = {http://dx.doi.org/10.1002/net.20215},
PUBLISHER = {John Wiley \& Sons},
ADDRESS = {Hoboken},
}
@article{Bentz-Costa-de_Werra-Picouleau-Ries/08,
AUTHOR = {Bentz, C. and Costa, M.C. and de Werra, D. and Picouleau, C. and Ries, B.},
TITLE = {On a graph coloring problem arising from discrete tomography},
JOURNAL = {Networks},
VOLUME = {51},
NUMBER = {4},
PAGES = {256-267},
YEAR = {2008},
EDITOR = {Gallo, Giorgio and Scuttel{\`a}, Maria Grazia},
URL = {http://dx.doi.org/10.1002/net.20218},
PUBLISHER = {John Wiley \& Sons},
ADDRESS = {Hoboken},
}