Search dblp for Publications

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

 download as .bib file

@article{DBLP:journals/networks/Alpern08,
  author       = {Steve Alpern},
  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},
  url          = {https://doi.org/10.1002/net.20235},
  doi          = {10.1002/NET.20235},
  timestamp    = {Sun, 28 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/networks/Alpern08.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/networks/BaileySA08,
  author       = {Matthew D. Bailey and
                  Robert L. Smith and
                  Jeffrey M. Alden},
  title        = {A Reach and Bound algorithm for acyclic dynamic-programming networks},
  journal      = {Networks},
  volume       = {52},
  number       = {1},
  pages        = {1--7},
  year         = {2008},
  url          = {https://doi.org/10.1002/net.20219},
  doi          = {10.1002/NET.20219},
  timestamp    = {Wed, 22 Nov 2017 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/networks/BaileySA08.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/networks/BaiouB08,
  author       = {Mourad Ba{\"{\i}}ou and
                  Francisco Barahona},
  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},
  url          = {https://doi.org/10.1002/net.20242},
  doi          = {10.1002/NET.20242},
  timestamp    = {Sun, 28 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/networks/BaiouB08.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/networks/BalbuenaGMV08,
  author       = {Camino Balbuena and
                  Pedro Garc{\'{\i}}a{-}V{\'{a}}zquez and
                  Xavier Marcote and
                  Juan Carlos Valenzuela},
  title        = {Conditional diameter saturated graphs},
  journal      = {Networks},
  volume       = {52},
  number       = {4},
  pages        = {196--201},
  year         = {2008},
  url          = {https://doi.org/10.1002/net.20230},
  doi          = {10.1002/NET.20230},
  timestamp    = {Fri, 30 Nov 2018 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/networks/BalbuenaGMV08.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/networks/Bang-JensenJ08,
  author       = {J{\o}rgen Bang{-}Jensen and
                  Tibor Jord{\'{a}}n},
  title        = {On persistent directed graphs},
  journal      = {Networks},
  volume       = {52},
  number       = {4},
  pages        = {271--276},
  year         = {2008},
  url          = {https://doi.org/10.1002/net.20248},
  doi          = {10.1002/NET.20248},
  timestamp    = {Mon, 16 Sep 2019 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/networks/Bang-JensenJ08.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/networks/BauerHY08,
  author       = {Joanna Bauer and
                  Dag Haugland and
                  Di Yuan},
  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},
  url          = {https://doi.org/10.1002/net.20222},
  doi          = {10.1002/NET.20222},
  timestamp    = {Sat, 05 Sep 2020 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/networks/BauerHY08.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/networks/BayrakB08,
  author       = {Halil Bayrak and
                  Matthew D. Bailey},
  title        = {Shortest path network interdiction with asymmetric information},
  journal      = {Networks},
  volume       = {52},
  number       = {3},
  pages        = {133--140},
  year         = {2008},
  url          = {https://doi.org/10.1002/net.20236},
  doi          = {10.1002/NET.20236},
  timestamp    = {Sun, 28 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/networks/BayrakB08.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/networks/Ben-AmeurN08,
  author       = {Walid Ben{-}Ameur and
                  Jos{\'{e}} Neto},
  title        = {Spectral bounds for the maximum cut problem},
  journal      = {Networks},
  volume       = {52},
  number       = {1},
  pages        = {8--13},
  year         = {2008},
  url          = {https://doi.org/10.1002/net.20220},
  doi          = {10.1002/NET.20220},
  timestamp    = {Sun, 28 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/networks/Ben-AmeurN08.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/networks/BrostromH08,
  author       = {Peter Brostr{\"{o}}m and
                  Kaj Holmberg},
  title        = {Valid cycles: {A} source of infeasibility in open shortest path first
                  routing},
  journal      = {Networks},
  volume       = {52},
  number       = {4},
  pages        = {206--215},
  year         = {2008},
  url          = {https://doi.org/10.1002/net.20232},
  doi          = {10.1002/NET.20232},
  timestamp    = {Mon, 28 Aug 2023 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/networks/BrostromH08.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/networks/CaragiannisKP08,
  author       = {Ioannis Caragiannis and
                  Christos Kaklamanis and
                  Evi Papaioannou},
  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},
  url          = {https://doi.org/10.1002/net.20244},
  doi          = {10.1002/NET.20244},
  timestamp    = {Thu, 08 Jun 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/networks/CaragiannisKP08.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/networks/CarlyleRW08,
  author       = {W. Matthew Carlyle and
                  Johannes O. Royset and
                  R. Kevin Wood},
  title        = {Lagrangian relaxation and enumeration for solving constrained shortest-path
                  problems},
  journal      = {Networks},
  volume       = {52},
  number       = {4},
  pages        = {256--270},
  year         = {2008},
  url          = {https://doi.org/10.1002/net.20247},
  doi          = {10.1002/NET.20247},
  timestamp    = {Thu, 08 Jun 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/networks/CarlyleRW08.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/networks/ChristopheDDFGHLEMY08,
  author       = {Julie Christophe and
                  Sophie Dewez and
                  Jean{-}Paul Doignon and
                  Gilles Fasbender and
                  Philippe Gr{\'{e}}goire and
                  David Huygens and
                  Martine Labb{\'{e}} and
                  Sourour Elloumi and
                  Hadrien M{\'{e}}lot and
                  Hande Yaman},
  title        = {Linear inequalities among graph invariants: Using \emph{GraPHedron}
                  to uncover optimal relationships},
  journal      = {Networks},
  volume       = {52},
  number       = {4},
  pages        = {287--298},
  year         = {2008},
  url          = {https://doi.org/10.1002/net.20250},
  doi          = {10.1002/NET.20250},
  timestamp    = {Sat, 09 Apr 2022 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/networks/ChristopheDDFGHLEMY08.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/networks/ColbournQS08,
  author       = {Charles J. Colbourn and
                  Gaetano Quattrocchi and
                  Violet R. Syrotiuk},
  title        = {Lower bounds for two-period grooming via linear programming duality},
  journal      = {Networks},
  volume       = {52},
  number       = {4},
  pages        = {299--306},
  year         = {2008},
  url          = {https://doi.org/10.1002/net.20251},
  doi          = {10.1002/NET.20251},
  timestamp    = {Sun, 28 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/networks/ColbournQS08.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/networks/ColbournQS08a,
  author       = {Charles J. Colbourn and
                  Gaetano Quattrocchi and
                  Violet R. Syrotiuk},
  title        = {Grooming for two-period optical networks},
  journal      = {Networks},
  volume       = {52},
  number       = {4},
  pages        = {307--324},
  year         = {2008},
  url          = {https://doi.org/10.1002/net.20252},
  doi          = {10.1002/NET.20252},
  timestamp    = {Sun, 28 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/networks/ColbournQS08a.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/networks/CordascoGNSH08,
  author       = {Gennaro Cordasco and
                  Luisa Gargano and
                  Alberto Negro and
                  Vittorio Scarano and
                  Mikael Hammar},
  title        = {F-Chord: Improved uniform routing on Chord},
  journal      = {Networks},
  volume       = {52},
  number       = {4},
  pages        = {325--332},
  year         = {2008},
  url          = {https://doi.org/10.1002/net.20253},
  doi          = {10.1002/NET.20253},
  timestamp    = {Thu, 14 Oct 2021 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/networks/CordascoGNSH08.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/networks/DaganG08,
  author       = {Arnon Dagan and
                  Shmuel Gal},
  title        = {Network search games, with arbitrary searcher starting point},
  journal      = {Networks},
  volume       = {52},
  number       = {3},
  pages        = {156--161},
  year         = {2008},
  url          = {https://doi.org/10.1002/net.20241},
  doi          = {10.1002/NET.20241},
  timestamp    = {Sun, 28 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/networks/DaganG08.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/networks/FlocchiniHL08,
  author       = {Paola Flocchini and
                  Miao Jun Huang and
                  Flaminia L. Luccio},
  title        = {Decontamination of hypercubes by mobile agents},
  journal      = {Networks},
  volume       = {52},
  number       = {3},
  pages        = {167--178},
  year         = {2008},
  url          = {https://doi.org/10.1002/net.20240},
  doi          = {10.1002/NET.20240},
  timestamp    = {Wed, 14 Nov 2018 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/networks/FlocchiniHL08.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/networks/Fuchs08,
  author       = {Bernhard Fuchs},
  title        = {On the hardness of range assignment problems},
  journal      = {Networks},
  volume       = {52},
  number       = {4},
  pages        = {183--195},
  year         = {2008},
  url          = {https://doi.org/10.1002/net.20227},
  doi          = {10.1002/NET.20227},
  timestamp    = {Sun, 28 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/networks/Fuchs08.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/networks/GoldenS08a,
  author       = {Bruce L. Golden and
                  Douglas R. Shier},
  title        = {Editorial: 2007 Glover-Klingman Prize winners},
  journal      = {Networks},
  volume       = {52},
  number       = {4},
  pages        = {179},
  year         = {2008},
  url          = {https://doi.org/10.1002/net.20273},
  doi          = {10.1002/NET.20273},
  timestamp    = {Sun, 28 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/networks/GoldenS08a.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/networks/JanjarassukL08,
  author       = {Udom Janjarassuk and
                  Jeff T. Linderoth},
  title        = {Reformulation and sampling to solve a stochastic network interdiction
                  problem},
  journal      = {Networks},
  volume       = {52},
  number       = {3},
  pages        = {120--132},
  year         = {2008},
  url          = {https://doi.org/10.1002/net.20237},
  doi          = {10.1002/NET.20237},
  timestamp    = {Thu, 24 Oct 2019 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/networks/JanjarassukL08.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/networks/KlasingMRS08,
  author       = {Ralf Klasing and
                  Euripides Markou and
                  Tomasz Radzik and
                  Fabiano Sarracco},
  title        = {Approximation bounds for Black Hole Search problems},
  journal      = {Networks},
  volume       = {52},
  number       = {4},
  pages        = {216--226},
  year         = {2008},
  url          = {https://doi.org/10.1002/net.20233},
  doi          = {10.1002/NET.20233},
  timestamp    = {Thu, 15 Jun 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/networks/KlasingMRS08.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/networks/KuoF08,
  author       = {Jyhmin Kuo and
                  Hung{-}Lin Fu},
  title        = {On the diameter of the generalized undirected de Bruijn graphs \emph{UG}\({}_{\mbox{\emph{B}}}\)(\emph{n},
                  \emph{m}), \emph{n}\({}^{\mbox{2}}\) {\textless} \emph{m} {\textless}=
                  \emph{n}\({}^{\mbox{3}}\)},
  journal      = {Networks},
  volume       = {52},
  number       = {4},
  pages        = {180--182},
  year         = {2008},
  url          = {https://doi.org/10.1002/net.20228},
  doi          = {10.1002/NET.20228},
  timestamp    = {Sun, 28 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/networks/KuoF08.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/networks/LevinPW08a,
  author       = {Asaf Levin and
                  Dani{\"{e}}l Paulusma and
                  Gerhard J. Woeginger},
  title        = {The computational complexity of graph contractions {II:} Two tough
                  polynomially solvable cases},
  journal      = {Networks},
  volume       = {52},
  number       = {1},
  pages        = {32--56},
  year         = {2008},
  url          = {https://doi.org/10.1002/net.20249},
  doi          = {10.1002/NET.20249},
  timestamp    = {Sun, 02 Oct 2022 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/networks/LevinPW08a.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/networks/LinL08,
  author       = {Bey{-}Chi Lin and
                  Chin{-}Tau Lea},
  title        = {Multirate nonblocking multicast Log\({}_{\mbox{2}}\)(\emph{N, m, p})
                  networks},
  journal      = {Networks},
  volume       = {52},
  number       = {4},
  pages        = {277--286},
  year         = {2008},
  url          = {https://doi.org/10.1002/net.20246},
  doi          = {10.1002/NET.20246},
  timestamp    = {Thu, 15 Jun 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/networks/LinL08.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/networks/LuWCL08,
  author       = {Min L{\"{u}} and
                  Chao Wu and
                  Guo{-}Liang Chen and
                  Cheng Lv},
  title        = {On super connectivity of Cartesian product graphs},
  journal      = {Networks},
  volume       = {52},
  number       = {2},
  pages        = {78--87},
  year         = {2008},
  url          = {https://doi.org/10.1002/net.20224},
  doi          = {10.1002/NET.20224},
  timestamp    = {Mon, 22 Mar 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/networks/LuWCL08.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/networks/Ozdaglar08,
  author       = {Asuman E. Ozdaglar},
  title        = {Price competition with elastic traffic},
  journal      = {Networks},
  volume       = {52},
  number       = {3},
  pages        = {141--155},
  year         = {2008},
  url          = {https://doi.org/10.1002/net.20239},
  doi          = {10.1002/NET.20239},
  timestamp    = {Sun, 28 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/networks/Ozdaglar08.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/networks/PanM08,
  author       = {Feng Pan and
                  David P. Morton},
  title        = {Minimizing a stochastic maximum-reliability path},
  journal      = {Networks},
  volume       = {52},
  number       = {3},
  pages        = {111--119},
  year         = {2008},
  url          = {https://doi.org/10.1002/net.20238},
  doi          = {10.1002/NET.20238},
  timestamp    = {Tue, 19 Sep 2023 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/networks/PanM08.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/networks/RautenbachV08,
  author       = {Dieter Rautenbach and
                  Lutz Volkmann},
  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},
  url          = {https://doi.org/10.1002/net.20243},
  doi          = {10.1002/NET.20243},
  timestamp    = {Sun, 28 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/networks/RautenbachV08.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/networks/ShachnaiZM08,
  author       = {Hadas Shachnai and
                  Lisa Zhang and
                  Tomomi Matsui},
  title        = {Exact algorithms for the master ring problem},
  journal      = {Networks},
  volume       = {52},
  number       = {2},
  pages        = {98--107},
  year         = {2008},
  url          = {https://doi.org/10.1002/net.20226},
  doi          = {10.1002/NET.20226},
  timestamp    = {Sat, 19 Oct 2019 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/networks/ShachnaiZM08.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/networks/SharkeyR08,
  author       = {Thomas C. Sharkey and
                  H. Edwin Romeijn},
  title        = {A simplex algorithm for minimum-cost network-flow problems in infinite
                  networks},
  journal      = {Networks},
  volume       = {52},
  number       = {1},
  pages        = {14--31},
  year         = {2008},
  url          = {https://doi.org/10.1002/net.20221},
  doi          = {10.1002/NET.20221},
  timestamp    = {Fri, 09 Apr 2021 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/networks/SharkeyR08.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/networks/Shirabe08,
  author       = {Takeshi Shirabe},
  title        = {Minimum work paths in elevated networks},
  journal      = {Networks},
  volume       = {52},
  number       = {2},
  pages        = {88--97},
  year         = {2008},
  url          = {https://doi.org/10.1002/net.20225},
  doi          = {10.1002/NET.20225},
  timestamp    = {Sun, 28 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/networks/Shirabe08.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/networks/Smith08,
  author       = {J. Cole Smith},
  title        = {Preface},
  journal      = {Networks},
  volume       = {52},
  number       = {3},
  pages        = {109--110},
  year         = {2008},
  url          = {https://doi.org/10.1002/net.20234},
  doi          = {10.1002/NET.20234},
  timestamp    = {Thu, 14 Oct 2021 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/networks/Smith08.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/networks/YangX08,
  author       = {Chao Yang and
                  Jun{-}Ming Xu},
  title        = {Reliability of interconnection networks modeled by Cartesian product
                  digraphs},
  journal      = {Networks},
  volume       = {52},
  number       = {4},
  pages        = {202--205},
  year         = {2008},
  url          = {https://doi.org/10.1002/net.20231},
  doi          = {10.1002/NET.20231},
  timestamp    = {Wed, 27 Nov 2019 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/networks/YangX08.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/networks/YongZG08,
  author       = {Xuerong Yong and
                  Yuanping Zhang and
                  Mordecai J. Golin},
  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},
  url          = {https://doi.org/10.1002/net.20223},
  doi          = {10.1002/NET.20223},
  timestamp    = {Thu, 08 Jun 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/networks/YongZG08.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
a service of  Schloss Dagstuhl - Leibniz Center for Informatics

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.