@article{Chang-Peng-Liaw/99,
AUTHOR = {Chang, Maw-Shang and Peng, Sheng-Lung and Liaw, Jenn-Liang},
TITLE = {Deferrred-query: An efficient approach for some problems on interval graphs},
JOURNAL = {Networks},
VOLUME = {34},
NUMBER = {1},
PAGES = {1-10},
YEAR = {1999},
PUBLISHER = {John Wiley \& Sons},
ADDRESS = {New York-Chichester-Weinheim-Brisbane-Singapore-Toronto},
}
@article{Shabtay-Segall/99,
AUTHOR = {Shabtay, Lior and Segall, Adrian},
TITLE = {On the memory overhead of distributed snapshots},
JOURNAL = {Networks},
VOLUME = {34},
NUMBER = {1},
PAGES = {11-17},
YEAR = {1999},
PUBLISHER = {John Wiley \& Sons},
ADDRESS = {New York-Chichester-Weinheim-Brisbane-Singapore-Toronto},
}
@article{Tayi-Rosenkrantz-Ravi/99,
AUTHOR = {Tayi, Giri K. and Rosenkrantz, Daniel J. and Ravi, S.S.},
TITLE = {Path problems in networks with vector-valued edge weights},
JOURNAL = {Networks},
VOLUME = {34},
NUMBER = {1},
PAGES = {19-35},
YEAR = {1999},
PUBLISHER = {John Wiley \& Sons},
ADDRESS = {New York-Chichester-Weinheim-Brisbane-Singapore-Toronto},
}
@article{Eilam-Moran-Zaks/99,
AUTHOR = {Eilam, T. and Moran, S. and Zaks, S.},
TITLE = {Lower bounds for linear interval routing},
JOURNAL = {Networks},
VOLUME = {34},
NUMBER = {1},
PAGES = {37-46},
YEAR = {1999},
PUBLISHER = {John Wiley \& Sons},
ADDRESS = {New York-Chichester-Weinheim-Brisbane-Singapore-Toronto},
}
@article{Flammini/99,
AUTHOR = {Flammini, Michele},
TITLE = {Deadlock-free interval routing schemes},
JOURNAL = {Networks},
VOLUME = {34},
NUMBER = {1},
PAGES = {47-60},
YEAR = {1999},
PUBLISHER = {John Wiley \& Sons},
ADDRESS = {New York-Chichester-Weinheim-Brisbane-Singapore-Toronto},
}
@article{Gomez-Escudero/99,
AUTHOR = {G{\'{o}}mez, J. and Escudero, M.},
TITLE = {Optimal edge coloring of large graphs},
JOURNAL = {Networks},
VOLUME = {34},
NUMBER = {1},
PAGES = {61-65},
YEAR = {1999},
PUBLISHER = {John Wiley \& Sons},
ADDRESS = {New York-Chichester-Weinheim-Brisbane-Singapore-Toronto},
}
@article{Kulasinghe-Bettayeb/99,
AUTHOR = {Kulasinghe, Priyalal and Bettayeb, Sa{\"i}d},
TITLE = {An optimal algorithm for layered wheel floorplan designs},
JOURNAL = {Networks},
VOLUME = {34},
NUMBER = {1},
PAGES = {67-72},
YEAR = {1999},
PUBLISHER = {John Wiley \& Sons},
ADDRESS = {New York-Chichester-Weinheim-Brisbane-Singapore-Toronto},
}
@article{Dolev-Kate-Welch/99,
AUTHOR = {Dolev, Shlomi and Kate, Michael and Welch, Jennifer L.},
TITLE = {A competitive analysis for retransmission timeout},
JOURNAL = {Networks},
VOLUME = {34},
NUMBER = {1},
PAGES = {73-80},
YEAR = {1999},
PUBLISHER = {John Wiley \& Sons},
ADDRESS = {New York-Chichester-Weinheim-Brisbane-Singapore-Toronto},
}
@article{Le-Le/99,
AUTHOR = {Le, Ho{\`{a}}ng-Oanh and Le, Van Bang},
TITLE = {Optimal tree 3-spanners in directed path graphs},
JOURNAL = {Networks},
VOLUME = {34},
NUMBER = {2},
PAGES = {81-87},
YEAR = {1999},
PUBLISHER = {John Wiley \& Sons},
ADDRESS = {New York-Chichester-Weinheim-Brisbane-Singapore-Toronto},
}
@article{Hadjiconstantinou-Christofides/99,
AUTHOR = {Hadjiconstantinou, E. and Christofides, N.},
TITLE = {An efficient implementation of an algorithm for finding $K$ shortest simple paths},
JOURNAL = {Networks},
VOLUME = {34},
NUMBER = {2},
PAGES = {88-101},
YEAR = {1999},
PUBLISHER = {John Wiley \& Sons},
ADDRESS = {New York-Chichester-Weinheim-Brisbane-Singapore-Toronto},
}
@article{Bertsimas-Teo-Vohra/99,
AUTHOR = {Bertsimas, Dimitris and Teo, Chung-Piaw and Vohra, Rakesh},
TITLE = {Analysis of $LP$ relaxations for multiway and multicut problems},
JOURNAL = {Networks},
VOLUME = {34},
NUMBER = {2},
PAGES = {102-114},
YEAR = {1999},
PUBLISHER = {John Wiley \& Sons},
ADDRESS = {New York-Chichester-Weinheim-Brisbane-Singapore-Toronto},
}
@article{Chartrand-Gu-Schultz-Winters/99,
AUTHOR = {Chartrand, Gary and Gu, Weizhen and Schultz, Michelle and Winters, Steven J.},
TITLE = {Eccentric graphs},
JOURNAL = {Networks},
VOLUME = {34},
NUMBER = {2},
PAGES = {115-121},
YEAR = {1999},
PUBLISHER = {John Wiley \& Sons},
ADDRESS = {New York-Chichester-Weinheim-Brisbane-Singapore-Toronto},
}
@article{Anazawa-Kodera-Jimbo/99,
AUTHOR = {Anazawa, Tsutomu and Kodera, Takayuki and Jimbo, Masakazu},
TITLE = {Optimum requirement spanning trees and reliability of tree networks},
JOURNAL = {Networks},
VOLUME = {34},
NUMBER = {2},
PAGES = {122-131},
YEAR = {1999},
PUBLISHER = {John Wiley \& Sons},
ADDRESS = {New York-Chichester-Weinheim-Brisbane-Singapore-Toronto},
}
@article{Anazawa/99,
AUTHOR = {Anazawa, Tsutomu},
TITLE = {On a condition for obtaining an explicit solution of optimum requirement spanning tree},
JOURNAL = {Networks},
VOLUME = {34},
NUMBER = {2},
PAGES = {132-135},
YEAR = {1999},
PUBLISHER = {John Wiley \& Sons},
ADDRESS = {New York-Chichester-Weinheim-Brisbane-Singapore-Toronto},
}
@article{Havill-Mao/99,
AUTHOR = {Havill, Jessen T. and Mao, Weizhen},
TITLE = {Greedy online algorithms for routing permanent virtual circuits},
JOURNAL = {Networks},
VOLUME = {34},
NUMBER = {2},
PAGES = {136-153},
YEAR = {1999},
PUBLISHER = {John Wiley \& Sons},
ADDRESS = {New York-Chichester-Weinheim-Brisbane-Singapore-Toronto},
}
@article{Gomez-Pelayo-Balbuena/99,
AUTHOR = {G{\'{o}}mez, J. and Pelayo, I. and Balbuena, C.},
TITLE = {New large graphs with given degree and diameter six},
JOURNAL = {Networks},
VOLUME = {34},
NUMBER = {2},
PAGES = {154-161},
YEAR = {1999},
PUBLISHER = {John Wiley \& Sons},
ADDRESS = {New York-Chichester-Weinheim-Brisbane-Singapore-Toronto},
}
@article{Gendreau-Larochelle-Sanso/99,
AUTHOR = {Gendreau, Michel and Larochelle, Jean-Francois and Sans{\`{o}}, Brunilde},
TITLE = {A tabu search heuristic for the Steiner tree problem},
JOURNAL = {Networks},
VOLUME = {34},
NUMBER = {2},
PAGES = {162-172},
YEAR = {1999},
PUBLISHER = {John Wiley \& Sons},
ADDRESS = {New York-Chichester-Weinheim-Brisbane-Singapore-Toronto},
}
@article{Garfinkel-Webb/99,
AUTHOR = {Garfinkel, Robert S. and Webb, Ian R.},
TITLE = {On crossings, the Crossing Postman problem, and the Rural Postman problem},
JOURNAL = {Networks},
VOLUME = {34},
NUMBER = {3},
PAGES = {173-180},
YEAR = {1999},
PUBLISHER = {John Wiley \& Sons},
ADDRESS = {New York-Chichester-Weinheim-Brisbane-Singapore-Toronto},
}
@article{Duin-Voss/99,
AUTHOR = {Duin, Cees and Vo{\"ss}, Stefan},
TITLE = {The pilot method: A strategy for heuristic repetition with application to the Steiner problem in graphs},
JOURNAL = {Networks},
VOLUME = {34},
NUMBER = {3},
PAGES = {181-191},
YEAR = {1999},
PUBLISHER = {John Wiley \& Sons},
ADDRESS = {New York-Chichester-Weinheim-Brisbane-Singapore-Toronto},
}
@article{Choudum-Priya/99,
AUTHOR = {Choudum, S.A. and Priya, N.},
TITLE = {Tenacity of complete graph products and grids},
JOURNAL = {Networks},
VOLUME = {34},
NUMBER = {3},
PAGES = {192-196},
YEAR = {1999},
PUBLISHER = {John Wiley \& Sons},
ADDRESS = {New York-Chichester-Weinheim-Brisbane-Singapore-Toronto},
}
@article{Carmona-Fabrega/99,
AUTHOR = {Carmona, A. and F{\`{a}}brega, J.},
TITLE = {On the superconnectivity and the conditional diameter of graphs and digraphs},
JOURNAL = {Networks},
VOLUME = {34},
NUMBER = {3},
PAGES = {197-205},
YEAR = {1999},
PUBLISHER = {John Wiley \& Sons},
ADDRESS = {New York-Chichester-Weinheim-Brisbane-Singapore-Toronto},
}
@article{Kranakis-Pelc-Spatharis/99,
AUTHOR = {Kranakis, Evangelos and Pelc, Andrzej and Spatharis, Anthony},
TITLE = {Optimal adaptive fault diagnosis for simple multiprocessor systems},
JOURNAL = {Networks},
VOLUME = {34},
NUMBER = {3},
PAGES = {206-214},
YEAR = {1999},
PUBLISHER = {John Wiley \& Sons},
ADDRESS = {New York-Chichester-Weinheim-Brisbane-Singapore-Toronto},
}
@article{Easley-Hartvigsen/99,
AUTHOR = {Easley, Robert F. and Hartvigsen, David},
TITLE = {Crossing properties of multiterminal cuts},
JOURNAL = {Networks},
VOLUME = {34},
NUMBER = {3},
PAGES = {215-220},
YEAR = {1999},
PUBLISHER = {John Wiley \& Sons},
ADDRESS = {New York-Chichester-Weinheim-Brisbane-Singapore-Toronto},
}
@article{Yamashita-Kameda/99,
AUTHOR = {Yamashita, Masafumi and Kameda, Tsunehiko (Tiko)},
TITLE = {Modeling $K$-coteries by well-covered graphs},
JOURNAL = {Networks},
VOLUME = {34},
NUMBER = {3},
PAGES = {221-228},
YEAR = {1999},
PUBLISHER = {John Wiley \& Sons},
ADDRESS = {New York-Chichester-Weinheim-Brisbane-Singapore-Toronto},
}
@article{Ernst-Krishnamoorthy-Storer/99,
AUTHOR = {Ernst, Andreas T. and Krishnamoorthy, Mohan and Storer, Robert H.},
TITLE = {Heuristic and exact algorithms for scheduling aircraft landings},
JOURNAL = {Networks},
VOLUME = {34},
NUMBER = {3},
PAGES = {229-241},
YEAR = {1999},
PUBLISHER = {John Wiley \& Sons},
ADDRESS = {New York-Chichester-Weinheim-Brisbane-Singapore-Toronto},
}
@article{Slater/99,
AUTHOR = {Slater, Peter J.},
TITLE = {A survey of sequences of central subgraphs},
JOURNAL = {Networks},
VOLUME = {34},
NUMBER = {4},
PAGES = {244-249},
YEAR = {1999},
PUBLISHER = {John Wiley \& Sons},
ADDRESS = {New York-Chichester-Weinheim-Brisbane-Singapore-Toronto},
}
@article{Hakimi-Labbe-Schmeichel/99,
AUTHOR = {Hakimi, S.L. and Labb{\'{e}}, Martine and Schmeichel, E.F.},
TITLE = {Locations on time-varying networks},
JOURNAL = {Networks},
VOLUME = {34},
NUMBER = {4},
PAGES = {250-257},
YEAR = {1999},
PUBLISHER = {John Wiley \& Sons},
ADDRESS = {New York-Chichester-Weinheim-Brisbane-Singapore-Toronto},
}
@article{Oellermann/99,
AUTHOR = {Oellermann, Ortrud R.},
TITLE = {On Steiner centers and Steiner medians of graphs},
JOURNAL = {Networks},
VOLUME = {34},
NUMBER = {4},
PAGES = {258-263},
YEAR = {1999},
PUBLISHER = {John Wiley \& Sons},
ADDRESS = {New York-Chichester-Weinheim-Brisbane-Singapore-Toronto},
}
@article{Reid/99,
AUTHOR = {Reid, K.B.},
TITLE = {Balance vertices in trees},
JOURNAL = {Networks},
VOLUME = {34},
NUMBER = {4},
PAGES = {264-271},
YEAR = {1999},
PUBLISHER = {John Wiley \& Sons},
ADDRESS = {New York-Chichester-Weinheim-Brisbane-Singapore-Toronto},
}
@article{Nieminen-Peltola/99,
AUTHOR = {Nieminen, Juhani and Peltola, Matti},
TITLE = {The subtree center of a tree},
JOURNAL = {Networks},
VOLUME = {34},
NUMBER = {4},
PAGES = {272-278},
YEAR = {1999},
PUBLISHER = {John Wiley \& Sons},
ADDRESS = {New York-Chichester-Weinheim-Brisbane-Singapore-Toronto},
}
@article{Klemm-Winters/99,
AUTHOR = {Klemm, Karen and Winters, Steven J.},
TITLE = {Properties of edge-deleted distance stable graphs},
JOURNAL = {Networks},
VOLUME = {34},
NUMBER = {4},
PAGES = {279-282},
YEAR = {1999},
PUBLISHER = {John Wiley \& Sons},
ADDRESS = {New York-Chichester-Weinheim-Brisbane-Singapore-Toronto},
}
@article{Nickel-Puerto/99,
AUTHOR = {Nickel, Stefan and Puerto, Justo},
TITLE = {A unified approach to network location problems},
JOURNAL = {Networks},
VOLUME = {34},
NUMBER = {4},
PAGES = {283-290},
YEAR = {1999},
PUBLISHER = {John Wiley \& Sons},
ADDRESS = {New York-Chichester-Weinheim-Brisbane-Singapore-Toronto},
}
@article{Ghiani-Laporte/99,
AUTHOR = {Ghiani, Gianpaolo and Laporte, Gilbert},
TITLE = {Eulerian location problems},
JOURNAL = {Networks},
VOLUME = {34},
NUMBER = {4},
PAGES = {291-302},
YEAR = {1999},
PUBLISHER = {John Wiley \& Sons},
ADDRESS = {New York-Chichester-Weinheim-Brisbane-Singapore-Toronto},
}
@article{Smart-Slater/99,
AUTHOR = {Smart, Christian and Slater, Peter J.},
TITLE = {Center, median, and centroid subgraphs},
JOURNAL = {Networks},
VOLUME = {34},
NUMBER = {4},
PAGES = {303-311},
YEAR = {1999},
PUBLISHER = {John Wiley \& Sons},
ADDRESS = {New York-Chichester-Weinheim-Brisbane-Singapore-Toronto},
}
@article{Dankelmann-Goddard-Henning-Swart/99,
AUTHOR = {Dankelmann, Peter and Goddard, Wayne and Henning, Michael A. and Swart, Henda C.},
TITLE = {Generalized eccentricity, radius, and diameter in graphs},
JOURNAL = {Networks},
VOLUME = {34},
NUMBER = {4},
PAGES = {312-319},
YEAR = {1999},
PUBLISHER = {John Wiley \& Sons},
ADDRESS = {New York-Chichester-Weinheim-Brisbane-Singapore-Toronto},
}
@article{Fremuth-Paeger-Jungnickel/99,
AUTHOR = {Fremuth-Paeger, Christian and Jungnickel, Dieter},
TITLE = {Balanced network flows --- I. A unifying framework for design and analysis of matching algorithms},
JOURNAL = {Networks},
VOLUME = {33},
NUMBER = {1},
PAGES = {1-28},
YEAR = {1999},
PUBLISHER = {John Wiley \& Sons},
ADDRESS = {New York-Chichester-Weinheim-Brisbane-Singapore-Toronto},
}
@article{Fremuth-Paeger-Jungnickel/99a,
AUTHOR = {Fremuth-Paeger, Christian and Jungnickel, Dieter},
TITLE = {Balanced network flows --- II. Simple augmentation algorithms},
JOURNAL = {Networks},
VOLUME = {33},
NUMBER = {1},
PAGES = {29-41},
YEAR = {1999},
PUBLISHER = {John Wiley \& Sons},
ADDRESS = {New York-Chichester-Weinheim-Brisbane-Singapore-Toronto},
}
@article{Fremuth-Paeger-Jungnickel/99b,
AUTHOR = {Fremuth-Paeger, Christian and Jungnickel, Dieter},
TITLE = {Balanced network flows --- III. Strongly polynomial augmentation algorithms},
JOURNAL = {Networks},
VOLUME = {33},
NUMBER = {1},
PAGES = {43-56},
YEAR = {1999},
PUBLISHER = {John Wiley \& Sons},
ADDRESS = {New York-Chichester-Weinheim-Brisbane-Singapore-Toronto},
}
@article{Burkard-Feldbacher-Klinz-Woeginger/99,
AUTHOR = {Burkard, Rainer E. and Feldbacher, Karin and Klinz, Bettina and Woeginger, Gerhard J.},
TITLE = {Minimum-cost strong network orientation problems: Classification, complexity, and algorithms},
JOURNAL = {Networks},
VOLUME = {33},
NUMBER = {1},
PAGES = {57-70},
YEAR = {1999},
PUBLISHER = {John Wiley \& Sons},
ADDRESS = {New York-Chichester-Weinheim-Brisbane-Singapore-Toronto},
}
@article{Matsubayashi-Ueno/99,
AUTHOR = {Matsubayashi, Akira and Ueno, Shuichi},
TITLE = {Small congestion embedding of graphs into hypercubes},
JOURNAL = {Networks},
VOLUME = {33},
NUMBER = {1},
PAGES = {71-77},
YEAR = {1999},
PUBLISHER = {John Wiley \& Sons},
ADDRESS = {New York-Chichester-Weinheim-Brisbane-Singapore-Toronto},
}
@article{Hamacher-Labbe-Nickel/99,
AUTHOR = {Hamacher, Horst W. and Labb{\'{e}}, Martine and Nickel, Stefan},
TITLE = {Multicriteria network location problems with sum objectives},
JOURNAL = {Networks},
VOLUME = {33},
NUMBER = {2},
PAGES = {79-92},
YEAR = {1999},
PUBLISHER = {John Wiley \& Sons},
ADDRESS = {New York-Chichester-Weinheim-Brisbane-Singapore-Toronto},
}
@article{Nagurney-Siokos/99,
AUTHOR = {Nagurney, Anna and Siokos, Stavros},
TITLE = {Dynamic multi-sector, multi-instrument financial networks with futures: Modeling and computation},
JOURNAL = {Networks},
VOLUME = {33},
NUMBER = {2},
PAGES = {93-108},
YEAR = {1999},
PUBLISHER = {John Wiley \& Sons},
ADDRESS = {New York-Chichester-Weinheim-Brisbane-Singapore-Toronto},
}
@article{Murthy-Seo/99,
AUTHOR = {Murthy, Ishwar and Seo, Phil K.},
TITLE = {A dual-ascent procedure for the file allocation and join site selection problem on a telecommunications network},
JOURNAL = {Networks},
VOLUME = {33},
NUMBER = {2},
PAGES = {109-124},
YEAR = {1999},
PUBLISHER = {John Wiley \& Sons},
ADDRESS = {New York-Chichester-Weinheim-Brisbane-Singapore-Toronto},
}
@article{Zachariasen/99,
AUTHOR = {Zachariasen, Martin},
TITLE = {Rectilinear full Steiner tree generation},
JOURNAL = {Networks},
VOLUME = {33},
NUMBER = {2},
PAGES = {125-143},
YEAR = {1999},
PUBLISHER = {John Wiley \& Sons},
ADDRESS = {New York-Chichester-Weinheim-Brisbane-Singapore-Toronto},
}
@article{Brazil-Thomas-Weng/99,
AUTHOR = {Brazil, M. and Thomas, D.A. and Weng, J.F.},
TITLE = {A polynomial time algorithm for rectilinear Steiner trees with terminals constrained to curves},
JOURNAL = {Networks},
VOLUME = {33},
NUMBER = {2},
PAGES = {145-155},
YEAR = {1999},
PUBLISHER = {John Wiley \& Sons},
ADDRESS = {New York-Chichester-Weinheim-Brisbane-Singapore-Toronto},
}
@article{Li-Li/99,
AUTHOR = {Li, Qiaoliang and Li, Qiao},
TITLE = {Super edge connectivity properties of connected edge symmetric graphs},
JOURNAL = {Networks},
VOLUME = {33},
NUMBER = {2},
PAGES = {157-159},
YEAR = {1999},
PUBLISHER = {John Wiley \& Sons},
ADDRESS = {New York-Chichester-Weinheim-Brisbane-Singapore-Toronto},
}
@article{Gu/99a,
AUTHOR = {Gu, Weizhen},
TITLE = {On diameter of permutation graphs},
JOURNAL = {Networks},
VOLUME = {33},
NUMBER = {3},
PAGES = {161-166},
YEAR = {1999},
PUBLISHER = {John Wiley \& Sons},
ADDRESS = {New York-Chichester-Weinheim-Brisbane-Singapore-Toronto},
}
@article{Kagaris-Pantziou-Tragoudas-Zaroliagis/99,
AUTHOR = {Kagaris, Dimitrios and Pantziou, Grammati E. and Tragoudas, Spyros and Zaroliagis, Christos D.},
TITLE = {Transmissions in a network with capacities and delays},
JOURNAL = {Networks},
VOLUME = {33},
NUMBER = {3},
PAGES = {167-174},
YEAR = {1999},
PUBLISHER = {John Wiley \& Sons},
ADDRESS = {New York-Chichester-Weinheim-Brisbane-Singapore-Toronto},
}
@article{Trietsch-Weng/99,
AUTHOR = {Trietsch, D. and Weng, J.F.},
TITLE = {Pseudo-Gilbert-Steiner trees},
JOURNAL = {Networks},
VOLUME = {33},
NUMBER = {3},
PAGES = {175-178},
YEAR = {1999},
PUBLISHER = {John Wiley \& Sons},
ADDRESS = {New York-Chichester-Weinheim-Brisbane-Singapore-Toronto},
}
@article{Beauquier/99,
AUTHOR = {Beauquier, Bruno},
TITLE = {All-to-all communication for some wavelength-routed all-optical networks},
JOURNAL = {Networks},
VOLUME = {33},
NUMBER = {3},
PAGES = {179-187},
YEAR = {1999},
PUBLISHER = {John Wiley \& Sons},
ADDRESS = {New York-Chichester-Weinheim-Brisbane-Singapore-Toronto},
}
@article{Klinz-Woeginger/99,
AUTHOR = {Klinz, Bettina and Woeginger, Gerhard J.},
TITLE = {A note on the bottleneck graph partition problem},
JOURNAL = {Networks},
VOLUME = {33},
NUMBER = {3},
PAGES = {189-191},
YEAR = {1999},
PUBLISHER = {John Wiley \& Sons},
ADDRESS = {New York-Chichester-Weinheim-Brisbane-Singapore-Toronto},
}
@article{Castillo-Hadi-Jubete-Solares/99,
AUTHOR = {Castillo, E. and Hadi, A.S. and Jubete, F. and Solares, C.},
TITLE = {An expert system for coherent assessment of probabilities in multigraph models},
JOURNAL = {Networks},
VOLUME = {33},
NUMBER = {3},
PAGES = {193-206},
YEAR = {1999},
PUBLISHER = {John Wiley \& Sons},
ADDRESS = {New York-Chichester-Weinheim-Brisbane-Singapore-Toronto},
}
@article{Murat-Paschos/99,
AUTHOR = {Murat, C{\'{e}}cile and Paschos, Vangelis Th.},
TITLE = {The probabilistic longest path problem},
JOURNAL = {Networks},
VOLUME = {33},
NUMBER = {3},
PAGES = {207-219},
YEAR = {1999},
PUBLISHER = {John Wiley \& Sons},
ADDRESS = {New York-Chichester-Weinheim-Brisbane-Singapore-Toronto},
}
@article{Tseng-Chen-Juang-Chang/99,
AUTHOR = {Tseng, Yu-Chee and Chen, Yuh-Shyan and Juang, Tong-Ying and Chang, Chiou-Jyu},
TITLE = {Congestion-free, dilation-2 embedding of complete binary trees into star graphs},
JOURNAL = {Networks},
VOLUME = {33},
NUMBER = {3},
PAGES = {221-231},
YEAR = {1999},
PUBLISHER = {John Wiley \& Sons},
ADDRESS = {New York-Chichester-Weinheim-Brisbane-Singapore-Toronto},
}
@article{Broersma-Engbers-Trommel/99,
AUTHOR = {Broersma, Hajo and Engbers, Erik and Trommel, Huib},
TITLE = {Various results on the toughness of graphs},
JOURNAL = {Networks},
VOLUME = {33},
NUMBER = {3},
PAGES = {233-238},
YEAR = {1999},
PUBLISHER = {John Wiley \& Sons},
ADDRESS = {New York-Chichester-Weinheim-Brisbane-Singapore-Toronto},
}
@article{Tripathy-Sural-Gerchak/99,
AUTHOR = {Tripathy, Ashish and S{\"u}ral, Haldun and Gerchak, Yigal},
TITLE = {Multidimensional assortment problem with an application},
JOURNAL = {Networks},
VOLUME = {33},
NUMBER = {3},
PAGES = {239-245},
YEAR = {1999},
PUBLISHER = {John Wiley \& Sons},
ADDRESS = {New York-Chichester-Weinheim-Brisbane-Singapore-Toronto},
}
@article{Pippenger/99,
AUTHOR = {Pippenger, Nicholas},
TITLE = {Upper and lower bounds for the average-case complexity of path-search},
JOURNAL = {Networks},
VOLUME = {33},
NUMBER = {4},
PAGES = {249-259},
YEAR = {1999},
PUBLISHER = {John Wiley \& Sons},
ADDRESS = {New York-Chichester-Weinheim-Brisbane-Singapore-Toronto},
}
@article{Chang-Hwang-Tong/99a,
AUTHOR = {Chang, Gerard J. and Hwang, Frank K. and Tong, Li-Da},
TITLE = {Characterizing bit permutation networks},
JOURNAL = {Networks},
VOLUME = {33},
NUMBER = {4},
PAGES = {261-267},
YEAR = {1999},
PUBLISHER = {John Wiley \& Sons},
ADDRESS = {New York-Chichester-Weinheim-Brisbane-Singapore-Toronto},
}
@article{Richards-Hwang/99,
AUTHOR = {Richards, G.W. and Hwang, F.K.},
TITLE = {Extended generalized shuffle networks: Sufficient conditions for strictly nonblocking operation},
JOURNAL = {Networks},
VOLUME = {33},
NUMBER = {4},
PAGES = {269-291},
YEAR = {1999},
PUBLISHER = {John Wiley \& Sons},
ADDRESS = {New York-Chichester-Weinheim-Brisbane-Singapore-Toronto},
}
@article{Du-Masson/99,
AUTHOR = {Du, Yi and Masson, Gerald M.},
TITLE = {Strictly nonblocking conference networks using high-dimensional meshes},
JOURNAL = {Networks},
VOLUME = {33},
NUMBER = {4},
PAGES = {293-308},
YEAR = {1999},
PUBLISHER = {John Wiley \& Sons},
ADDRESS = {New York-Chichester-Weinheim-Brisbane-Singapore-Toronto},
}