@article{Jacobson-Kezdy-Lehel/98,
AUTHOR = {Jacobson, Michael S. and K{\'{e}}zdy, Andr{\'{e}} E. and Lehel, Jen{\H{o}}},
TITLE = {Recognizing triangle-free graphs with induced path-cycle double covers is $NP$-complete},
JOURNAL = {Networks},
VOLUME = {31},
NUMBER = {1},
PAGES = {1-10},
YEAR = {1998},
PUBLISHER = {John Wiley \& Sons},
ADDRESS = {New York-Chichester-Weinheim-Brisbane-Singapore-Toronto},
}
@article{Engevall-Gothe-Lundgren-Varbrand/98,
AUTHOR = {Engevall, Stefan and G{\"o}the-Lundgren, Maud and V{\"a}rbrand, Peter},
TITLE = {A strong lower bound for the node weighted Steiner tree problem},
JOURNAL = {Networks},
VOLUME = {31},
NUMBER = {1},
PAGES = {11-17},
YEAR = {1998},
PUBLISHER = {John Wiley \& Sons},
ADDRESS = {New York-Chichester-Weinheim-Brisbane-Singapore-Toronto},
}
@article{Ganapathy-Nair/98,
AUTHOR = {Ganapathy, L. and Nair, K.P.K.},
TITLE = {On capacitated stochastic chain problems in a network},
JOURNAL = {Networks},
VOLUME = {31},
NUMBER = {1},
PAGES = {19-27},
YEAR = {1998},
PUBLISHER = {John Wiley \& Sons},
ADDRESS = {New York-Chichester-Weinheim-Brisbane-Singapore-Toronto},
}
@article{Chen-Jacobson-Kezdy-Lehel/98,
AUTHOR = {Chen, Guantao and Jacobson, Michael S. and K{\'{e}}zdy, Andr{\'{e}} E. and Lehel, Jen{\H{o}}},
TITLE = {Tough enough chordal graphs are Hamiltonian},
JOURNAL = {Networks},
VOLUME = {31},
NUMBER = {1},
PAGES = {29-38},
YEAR = {1998},
PUBLISHER = {John Wiley \& Sons},
ADDRESS = {New York-Chichester-Weinheim-Brisbane-Singapore-Toronto},
}
@article{Lucena-Beasley/98,
AUTHOR = {Lucena, A. and Beasley, J.E.},
TITLE = {A branch and cut algorithm for the Steiner Problem in graphs},
JOURNAL = {Networks},
VOLUME = {31},
NUMBER = {1},
PAGES = {39-59},
YEAR = {1998},
PUBLISHER = {John Wiley \& Sons},
ADDRESS = {New York-Chichester-Weinheim-Brisbane-Singapore-Toronto},
}
@article{Li-Li/98,
AUTHOR = {Li, Qiaoliang and Li, Qiao},
TITLE = {Reliability analysis of circulant graphs},
JOURNAL = {Networks},
VOLUME = {31},
NUMBER = {2},
PAGES = {61-65},
YEAR = {1998},
PUBLISHER = {John Wiley \& Sons},
ADDRESS = {New York-Chichester-Weinheim-Brisbane-Singapore-Toronto},
}
@article{Gargano-Rescigno/98,
AUTHOR = {Gargano, Luisa and Rescigno, Adele A.},
TITLE = {Fast collective communication by packets in the postal model},
JOURNAL = {Networks},
VOLUME = {31},
NUMBER = {2},
PAGES = {67-79},
YEAR = {1998},
PUBLISHER = {John Wiley \& Sons},
ADDRESS = {New York-Chichester-Weinheim-Brisbane-Singapore-Toronto},
}
@article{Averbakh-Berman/98,
AUTHOR = {Averbakh, Igor and Berman, Oded},
TITLE = {Location problems with grouped structure of demand: Complexity and algorithms},
JOURNAL = {Networks},
VOLUME = {31},
NUMBER = {2},
PAGES = {81-92},
YEAR = {1998},
PUBLISHER = {John Wiley \& Sons},
ADDRESS = {New York-Chichester-Weinheim-Brisbane-Singapore-Toronto},
}
@article{Chen-Lin/98,
AUTHOR = {Chen, Bintong and Lin, Chin-Shien},
TITLE = {Minmax-regret robust 1-median location on a tree},
JOURNAL = {Networks},
VOLUME = {31},
NUMBER = {2},
PAGES = {93-103},
YEAR = {1998},
PUBLISHER = {John Wiley \& Sons},
ADDRESS = {New York-Chichester-Weinheim-Brisbane-Singapore-Toronto},
}
@article{Huang-Chen/98,
AUTHOR = {Huang, Hui-Ling and Chen, Gen-Huey},
TITLE = {Topological properties and algorithms for two-level hypernet networks},
JOURNAL = {Networks},
VOLUME = {31},
NUMBER = {2},
PAGES = {105-118},
YEAR = {1998},
PUBLISHER = {John Wiley \& Sons},
ADDRESS = {New York-Chichester-Weinheim-Brisbane-Singapore-Toronto},
}
@article{Friedler-Fan-Imreh/98,
AUTHOR = {Friedler, F. and Fan, L.T. and Imreh, B.},
TITLE = {Process network synthesis: Problem definition},
JOURNAL = {Networks},
VOLUME = {31},
NUMBER = {2},
PAGES = {119-124},
YEAR = {1998},
PUBLISHER = {John Wiley \& Sons},
ADDRESS = {New York-Chichester-Weinheim-Brisbane-Singapore-Toronto},
}
@article{Delorme-Ordaz-Quiroz/98,
AUTHOR = {Delorme, C. and Ordaz, O. and Quiroz, D.},
TITLE = {Tools for studying paths and cycles in digraphs},
JOURNAL = {Networks},
VOLUME = {31},
NUMBER = {2},
PAGES = {125-148},
YEAR = {1998},
PUBLISHER = {John Wiley \& Sons},
ADDRESS = {New York-Chichester-Weinheim-Brisbane-Singapore-Toronto},
}
@article{Cox/98,
AUTHOR = {Cox, Christopher L.},
TITLE = {Flow-dependent networks: Existence and behavior at Steiner points},
JOURNAL = {Networks},
VOLUME = {31},
NUMBER = {3},
PAGES = {149-156},
YEAR = {1998},
PUBLISHER = {John Wiley \& Sons},
ADDRESS = {New York-Chichester-Weinheim-Brisbane-Singapore-Toronto},
}
@article{Ito-Yokoyama/98a,
AUTHOR = {Ito, Hiro and Yokoyama, Mitsuo},
TITLE = {Edge connectivity between nodes and node-subsets},
JOURNAL = {Networks},
VOLUME = {31},
NUMBER = {3},
PAGES = {157-163},
YEAR = {1998},
PUBLISHER = {John Wiley \& Sons},
ADDRESS = {New York-Chichester-Weinheim-Brisbane-Singapore-Toronto},
}
@article{Dye-Tomasgard-Wallace/98,
AUTHOR = {Dye, Shane and Tomasgard, Asgeir and Wallace, Stein W.},
TITLE = {Feasibility in transportation networks with supply eating arcs},
JOURNAL = {Networks},
VOLUME = {31},
NUMBER = {3},
PAGES = {165-176},
YEAR = {1998},
PUBLISHER = {John Wiley \& Sons},
ADDRESS = {New York-Chichester-Weinheim-Brisbane-Singapore-Toronto},
}
@article{Brandstadt-Dragan/98,
AUTHOR = {Brandst{\"a}dt, Andreas and Dragan, Feodor F.},
TITLE = {A linear-time algorithm for connected $r$-domination and Steiner tree on distance-hereditary graphs},
JOURNAL = {Networks},
VOLUME = {31},
NUMBER = {3},
PAGES = {177-182},
YEAR = {1998},
PUBLISHER = {John Wiley \& Sons},
ADDRESS = {New York-Chichester-Weinheim-Brisbane-Singapore-Toronto},
}
@article{Xiang/98,
AUTHOR = {Xiang, Y.},
TITLE = {Verification of DAG structures in cooperative belief network-based multiagent systems},
JOURNAL = {Networks},
VOLUME = {31},
NUMBER = {3},
PAGES = {183-191},
YEAR = {1998},
PUBLISHER = {John Wiley \& Sons},
ADDRESS = {New York-Chichester-Weinheim-Brisbane-Singapore-Toronto},
}
@article{Ioachim-Gelinas-Soumis-Desrosiers/98,
AUTHOR = {Ioachim, Irina and G{\'{e}}linas, Sylvie and Soumis, Fran{\c{c}}ois and Desrosiers, Jacques},
TITLE = {A dynamic programming algorithm for the shortest path problem with time windows and linear node costs},
JOURNAL = {Networks},
VOLUME = {31},
NUMBER = {3},
PAGES = {193-204},
YEAR = {1998},
PUBLISHER = {John Wiley \& Sons},
ADDRESS = {New York-Chichester-Weinheim-Brisbane-Singapore-Toronto},
}
@article{Shaw-Cho/98,
AUTHOR = {Shaw, Dong X. and Cho, Geon},
TITLE = {The critical-item, upper bounds, and a branch-and-bound algorithm for the tree knapsack problem},
JOURNAL = {Networks},
VOLUME = {31},
NUMBER = {3},
PAGES = {205-216},
YEAR = {1998},
PUBLISHER = {John Wiley \& Sons},
ADDRESS = {New York-Chichester-Weinheim-Brisbane-Singapore-Toronto},
}
@article{Gross-Saccoman/98,
AUTHOR = {Gross, D. and Saccoman, J.T.},
TITLE = {Uniformly optimally reliable graphs},
JOURNAL = {Networks},
VOLUME = {31},
NUMBER = {3},
PAGES = {217-225},
YEAR = {1998},
PUBLISHER = {John Wiley \& Sons},
ADDRESS = {New York-Chichester-Weinheim-Brisbane-Singapore-Toronto},
}
@article{Mahey-Ouorou-LeBlanc-Chifflet/98,
AUTHOR = {Mahey, P. and Ouorou, A. and LeBlanc, L. and Chifflet, J.},
TITLE = {A new proximal decomposition algorithm for routing in telecommunication networks},
JOURNAL = {Networks},
VOLUME = {31},
NUMBER = {4},
PAGES = {227-238},
YEAR = {1998},
PUBLISHER = {John Wiley \& Sons},
ADDRESS = {New York-Chichester-Weinheim-Brisbane-Singapore-Toronto},
}
@article{Barth-Panaite/98a,
AUTHOR = {Barth, Dominique and Panaite, Petri{\c{s}}or},
TITLE = {Undirected graphs rearrangeable by 2-length walks},
JOURNAL = {Networks},
VOLUME = {31},
NUMBER = {4},
PAGES = {239-247},
YEAR = {1998},
PUBLISHER = {John Wiley \& Sons},
ADDRESS = {New York-Chichester-Weinheim-Brisbane-Singapore-Toronto},
}
@article{Chen-Lee-Sridhar-Sekharan/98,
AUTHOR = {Chen, Danny Z. and Lee, D.T. and Sridhar, R. and Sekharan, Chandra N.},
TITLE = {Solving the all-pair shortest path query problem on interval and circular-arc graphs},
JOURNAL = {Networks},
VOLUME = {31},
NUMBER = {4},
PAGES = {249-257},
YEAR = {1998},
PUBLISHER = {John Wiley \& Sons},
ADDRESS = {New York-Chichester-Weinheim-Brisbane-Singapore-Toronto},
}
@article{Sherali-Ozbay-Subramanian/98,
AUTHOR = {Sherali, Hanif D. and Ozbay, Kaan and Subramanian, Shrivaram},
TITLE = {The time-dependent shortest pair of disjoint paths problem: Complexity, models, and algorithms},
JOURNAL = {Networks},
VOLUME = {31},
NUMBER = {4},
PAGES = {259-272},
YEAR = {1998},
PUBLISHER = {John Wiley \& Sons},
ADDRESS = {New York-Chichester-Weinheim-Brisbane-Singapore-Toronto},
}
@article{Suhl-Hilbert/98,
AUTHOR = {Suhl, Uwe H. and Hilbert, Heinrich},
TITLE = {A branch-and-cut algorithm for solving generalized multiperiod Steiner problems in graphs},
JOURNAL = {Networks},
VOLUME = {31},
NUMBER = {4},
PAGES = {273-282},
YEAR = {1998},
PUBLISHER = {John Wiley \& Sons},
ADDRESS = {New York-Chichester-Weinheim-Brisbane-Singapore-Toronto},
}
@article{Halldorsson-Ueno-Nakao-Kajitani/98,
AUTHOR = {Halld{\'{o}}rsson, Magn{\'u}s M. and Ueno, Shuichi and Nakao, Horoshi and Kajitani, Yoji},
TITLE = {Approximating Steiner trees in graphs with restricted weights},
JOURNAL = {Networks},
VOLUME = {31},
NUMBER = {4},
PAGES = {283-292},
YEAR = {1998},
PUBLISHER = {John Wiley \& Sons},
ADDRESS = {New York-Chichester-Weinheim-Brisbane-Singapore-Toronto},
}
@article{Skorin-Kapov/98,
AUTHOR = {Skorin-Kapov, Darko},
TITLE = {Hub network games},
JOURNAL = {Networks},
VOLUME = {31},
NUMBER = {4},
PAGES = {293-302},
YEAR = {1998},
PUBLISHER = {John Wiley \& Sons},
ADDRESS = {New York-Chichester-Weinheim-Brisbane-Singapore-Toronto},
}