Search dblp for Publications

export results for "toc:db/journals/networks/networks38.bht:"

 download as .bib file

@article{DBLP:journals/networks/Andreae01,
  author       = {Thomas Andreae},
  title        = {On the traveling salesman problem restricted to inputs satisfying
                  a relaxed triangle inequality},
  journal      = {Networks},
  volume       = {38},
  number       = {2},
  pages        = {59--67},
  year         = {2001},
  url          = {https://doi.org/10.1002/net.1024},
  doi          = {10.1002/NET.1024},
  timestamp    = {Sun, 28 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/networks/Andreae01.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/networks/AnejaCN01,
  author       = {Yash P. Aneja and
                  R. Chandrasekaran and
                  Kunhiraman Nair},
  title        = {Maximizing residual flow under an arc destruction},
  journal      = {Networks},
  volume       = {38},
  number       = {4},
  pages        = {194--198},
  year         = {2001},
  url          = {https://doi.org/10.1002/net.10001},
  doi          = {10.1002/NET.10001},
  timestamp    = {Sun, 28 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/networks/AnejaCN01.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/networks/AverbuchGR01,
  author       = {Amir Averbuch and
                  Iris Gaber and
                  Yehuda Roditty},
  title        = {Low-cost minimum-time line-broadcasting schemes in complete binary
                  trees},
  journal      = {Networks},
  volume       = {38},
  number       = {4},
  pages        = {189--193},
  year         = {2001},
  url          = {https://doi.org/10.1002/net.1036},
  doi          = {10.1002/NET.1036},
  timestamp    = {Sun, 28 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/networks/AverbuchGR01.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/networks/BrennerV01,
  author       = {Ulrich Brenner and
                  Jens Vygen},
  title        = {Worst-case ratios of networks in the rectilinear plane},
  journal      = {Networks},
  volume       = {38},
  number       = {3},
  pages        = {126--139},
  year         = {2001},
  url          = {https://doi.org/10.1002/net.103},
  doi          = {10.1002/NET.103},
  timestamp    = {Sun, 28 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/networks/BrennerV01.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/networks/BurkardD01,
  author       = {Rainer E. Burkard and
                  Helidon Dollani},
  title        = {Robust location problems with pos/neg weights on a tree},
  journal      = {Networks},
  volume       = {38},
  number       = {2},
  pages        = {102--113},
  year         = {2001},
  url          = {https://doi.org/10.1002/net.1029},
  doi          = {10.1002/NET.1029},
  timestamp    = {Sun, 28 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/networks/BurkardD01.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/networks/CanutoRR01,
  author       = {S. A. Canuto and
                  Mauricio G. C. Resende and
                  Celso C. Ribeiro},
  title        = {Local search with perturbations for the prize-collecting Steiner tree
                  problem in graphs},
  journal      = {Networks},
  volume       = {38},
  number       = {1},
  pages        = {50--58},
  year         = {2001},
  url          = {https://doi.org/10.1002/net.1023},
  doi          = {10.1002/NET.1023},
  timestamp    = {Sat, 09 Apr 2022 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/networks/CanutoRR01.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/networks/CaramiaD01,
  author       = {Massimiliano Caramia and
                  Paolo Dell'Olmo},
  title        = {Solving the minimum-weighted coloring problem},
  journal      = {Networks},
  volume       = {38},
  number       = {2},
  pages        = {88--101},
  year         = {2001},
  url          = {https://doi.org/10.1002/net.1028},
  doi          = {10.1002/NET.1028},
  timestamp    = {Thu, 08 Jun 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/networks/CaramiaD01.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/networks/ChartrandNW01,
  author       = {Gary Chartrand and
                  Karen S. Novotny and
                  Steven J. Winters},
  title        = {The ultracenter and central fringe of a graph},
  journal      = {Networks},
  volume       = {38},
  number       = {1},
  pages        = {33--38},
  year         = {2001},
  url          = {https://doi.org/10.1002/net.1021},
  doi          = {10.1002/NET.1021},
  timestamp    = {Sun, 28 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/networks/ChartrandNW01.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/networks/Dini01,
  author       = {Gianluca Dini},
  title        = {Electronic voting in a large-scale distributed system},
  journal      = {Networks},
  volume       = {38},
  number       = {1},
  pages        = {22--32},
  year         = {2001},
  url          = {https://doi.org/10.1002/net.1020},
  doi          = {10.1002/NET.1020},
  timestamp    = {Thu, 08 Jun 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/networks/Dini01.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/networks/Even01,
  author       = {Shimon Even},
  title        = {Area efficient layouts of the Batcher sorting networks},
  journal      = {Networks},
  volume       = {38},
  number       = {4},
  pages        = {199--208},
  year         = {2001},
  url          = {https://doi.org/10.1002/net.10003},
  doi          = {10.1002/NET.10003},
  timestamp    = {Sun, 28 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/networks/Even01.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/networks/Fleischer01,
  author       = {Lisa Fleischer},
  title        = {Universally maximum flow with piecewise-constant capacities},
  journal      = {Networks},
  volume       = {38},
  number       = {3},
  pages        = {115--125},
  year         = {2001},
  url          = {https://doi.org/10.1002/net.1030},
  doi          = {10.1002/NET.1030},
  timestamp    = {Sun, 28 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/networks/Fleischer01.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/networks/FraigniaudP01,
  author       = {Pierre Fraigniaud and
                  Joseph G. Peters},
  title        = {Minimum linear gossip graphs and maximal linear (Delta, k)-gossip
                  graphs},
  journal      = {Networks},
  volume       = {38},
  number       = {3},
  pages        = {150--162},
  year         = {2001},
  url          = {https://doi.org/10.1002/net.1033},
  doi          = {10.1002/NET.1033},
  timestamp    = {Sun, 28 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/networks/FraigniaudP01.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/networks/GarganoPPV01,
  author       = {Luisa Gargano and
                  Andrzej Pelc and
                  Stephane Perennes and
                  Ugo Vaccaro},
  title        = {Efficient communication in unknown networks},
  journal      = {Networks},
  volume       = {38},
  number       = {1},
  pages        = {39--49},
  year         = {2001},
  url          = {https://doi.org/10.1002/net.1022},
  doi          = {10.1002/NET.1022},
  timestamp    = {Fri, 09 Apr 2021 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/networks/GarganoPPV01.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/networks/HarutyunyanL01,
  author       = {Hovhannes A. Harutyunyan and
                  Arthur L. Liestman},
  title        = {k-Broadcasting in trees},
  journal      = {Networks},
  volume       = {38},
  number       = {3},
  pages        = {163--168},
  year         = {2001},
  url          = {https://doi.org/10.1002/net.1034},
  doi          = {10.1002/NET.1034},
  timestamp    = {Sun, 28 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/networks/HarutyunyanL01.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/networks/HwangY01,
  author       = {Frank K. Hwang and
                  Chih{-}Hung Yen},
  title        = {Characterizing the bit permutation networks obtained from the line
                  digraphs of bit permutation networks},
  journal      = {Networks},
  volume       = {38},
  number       = {1},
  pages        = {1--5},
  year         = {2001},
  url          = {https://doi.org/10.1002/net.1018},
  doi          = {10.1002/NET.1018},
  timestamp    = {Sun, 28 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/networks/HwangY01.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/networks/IyerY01,
  author       = {Ananth V. Iyer and
                  Jianming Ye},
  title        = {A network based model of a promotion-sensitive grocery logistics system},
  journal      = {Networks},
  volume       = {38},
  number       = {4},
  pages        = {169--18},
  year         = {2001},
  url          = {https://doi.org/10.1002/net.10005},
  doi          = {10.1002/NET.10005},
  timestamp    = {Sun, 28 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/networks/IyerY01.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/networks/LeeV01,
  author       = {Shiwoo Lee and
                  Jos{\'{e}} A. Ventura},
  title        = {An algorithm for constructing minimal c-broadcast networks},
  journal      = {Networks},
  volume       = {38},
  number       = {1},
  pages        = {6--21},
  year         = {2001},
  url          = {https://doi.org/10.1002/net.1019},
  doi          = {10.1002/NET.1019},
  timestamp    = {Sun, 22 May 2022 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/networks/LeeV01.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/networks/McBrideM01,
  author       = {Richard D. McBride and
                  John W. Mamer},
  title        = {Solving the undirected multicommodity flow problem using a shortest
                  path-based pricing algorithm},
  journal      = {Networks},
  volume       = {38},
  number       = {4},
  pages        = {181--188},
  year         = {2001},
  url          = {https://doi.org/10.1002/net.1035},
  doi          = {10.1002/NET.1035},
  timestamp    = {Sun, 28 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/networks/McBrideM01.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/networks/McMorrisRW01,
  author       = {Fred R. McMorris and
                  Fred S. Roberts and
                  Chi Wang},
  title        = {The center function on trees},
  journal      = {Networks},
  volume       = {38},
  number       = {2},
  pages        = {84--87},
  year         = {2001},
  url          = {https://doi.org/10.1002/net.1027},
  doi          = {10.1002/NET.1027},
  timestamp    = {Mon, 26 Oct 2020 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/networks/McMorrisRW01.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/networks/OostenRS01,
  author       = {Maarten Oosten and
                  Jeroen H. G. C. Rutten and
                  Frits C. R. Spieksma},
  title        = {The clique partitioning problem: Facets and patching facets},
  journal      = {Networks},
  volume       = {38},
  number       = {4},
  pages        = {209--226},
  year         = {2001},
  url          = {https://doi.org/10.1002/net.10004},
  doi          = {10.1002/NET.10004},
  timestamp    = {Sun, 28 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/networks/OostenRS01.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/networks/RubinsteinTW01,
  author       = {J. Hyam Rubinstein and
                  Doreen A. Thomas and
                  Nicholas C. Wormald},
  title        = {A polynomial algorithm for a constrained traveling salesman problem},
  journal      = {Networks},
  volume       = {38},
  number       = {2},
  pages        = {68--75},
  year         = {2001},
  url          = {https://doi.org/10.1002/net.1025},
  doi          = {10.1002/NET.1025},
  timestamp    = {Sat, 09 Apr 2022 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/networks/RubinsteinTW01.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/networks/RyooP01,
  author       = {Jeong{-}dong Ryoo and
                  Shivendra S. Panwar},
  title        = {File distribution in networks with multimedia storage servers},
  journal      = {Networks},
  volume       = {38},
  number       = {3},
  pages        = {140--149},
  year         = {2001},
  url          = {https://doi.org/10.1002/net.1032},
  doi          = {10.1002/NET.1032},
  timestamp    = {Sun, 28 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/networks/RyooP01.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/networks/Zachariasen01,
  author       = {Martin Zachariasen},
  title        = {A catalog of Hanan grid problems},
  journal      = {Networks},
  volume       = {38},
  number       = {2},
  pages        = {76--83},
  year         = {2001},
  url          = {https://doi.org/10.1002/net.1026},
  doi          = {10.1002/NET.1026},
  timestamp    = {Thu, 08 Jun 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/networks/Zachariasen01.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.