Search dblp for Publications

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

 download as .bib file

@article{DBLP:journals/networks/AllybokusPLMG18,
  author       = {Zaid Allybokus and
                  Nancy Perrot and
                  J{\'{e}}r{\'{e}}mie Leguay and
                  Lorenzo Maggi and
                  Eric Gourdin},
  title        = {Virtual function placement for service chaining with partial orders
                  and anti-affinity rules},
  journal      = {Networks},
  volume       = {71},
  number       = {2},
  pages        = {97--106},
  year         = {2018},
  url          = {https://doi.org/10.1002/net.21768},
  doi          = {10.1002/NET.21768},
  timestamp    = {Fri, 30 Nov 2018 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/networks/AllybokusPLMG18.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/networks/AtamturkB18,
  author       = {Alper Atamt{\"{u}}rk and
                  Avinash Bhardwaj},
  title        = {Network design with probabilistic capacities},
  journal      = {Networks},
  volume       = {71},
  number       = {1},
  pages        = {16--30},
  year         = {2018},
  url          = {https://doi.org/10.1002/net.21769},
  doi          = {10.1002/NET.21769},
  timestamp    = {Mon, 26 Oct 2020 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/networks/AtamturkB18.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/networks/BaiouB18,
  author       = {Mourad Ba{\"{\i}}ou and
                  Francisco Barahona},
  title        = {On the p-median polytope and the odd directed cycle inequalities:
                  Oriented graphs},
  journal      = {Networks},
  volume       = {71},
  number       = {4},
  pages        = {326--345},
  year         = {2018},
  url          = {https://doi.org/10.1002/net.21813},
  doi          = {10.1002/NET.21813},
  timestamp    = {Fri, 30 Nov 2018 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/networks/BaiouB18.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/networks/BapatFLMMST18,
  author       = {Ravindra B. Bapat and
                  Shinya Fujita and
                  Sylvain Legay and
                  Yannis Manoussakis and
                  Yasuko Matsui and
                  Tadashi Sakuma and
                  Zsolt Tuza},
  title        = {Safe sets, network majority on weighted trees},
  journal      = {Networks},
  volume       = {71},
  number       = {1},
  pages        = {81--92},
  year         = {2018},
  url          = {https://doi.org/10.1002/net.21794},
  doi          = {10.1002/NET.21794},
  timestamp    = {Mon, 26 Oct 2020 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/networks/BapatFLMMST18.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/networks/Berczi-KovacsK18,
  author       = {Erika R. B{\'{e}}rczi{-}Kov{\'{a}}cs and
                  Zolt{\'{a}}n Kir{\'{a}}ly},
  title        = {Optimal and heuristic network coding algorithms for multi-layered
                  video broadcast},
  journal      = {Networks},
  volume       = {71},
  number       = {1},
  pages        = {51--59},
  year         = {2018},
  url          = {https://doi.org/10.1002/net.21788},
  doi          = {10.1002/NET.21788},
  timestamp    = {Fri, 30 Nov 2018 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/networks/Berczi-KovacsK18.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/networks/CarrabsCG18,
  author       = {Francesco Carrabs and
                  Raffaele Cerulli and
                  Monica Gentili},
  title        = {Preface: Theoretical and algorithmic contributions to network optimization
                  problems},
  journal      = {Networks},
  volume       = {71},
  number       = {4},
  pages        = {325},
  year         = {2018},
  url          = {https://doi.org/10.1002/net.21816},
  doi          = {10.1002/NET.21816},
  timestamp    = {Fri, 30 Nov 2018 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/networks/CarrabsCG18.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/networks/ChoK18,
  author       = {Yongkyu Cho and
                  Young Myoung Ko},
  title        = {Energy efficiency of data center operating practices: Server clustering,
                  powering on/off, and bang-bang control},
  journal      = {Networks},
  volume       = {71},
  number       = {2},
  pages        = {107--119},
  year         = {2018},
  url          = {https://doi.org/10.1002/net.21752},
  doi          = {10.1002/NET.21752},
  timestamp    = {Thu, 14 Oct 2021 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/networks/ChoK18.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/networks/CordascoGRV18,
  author       = {Gennaro Cordasco and
                  Luisa Gargano and
                  Adele Anna Rescigno and
                  Ugo Vaccaro},
  title        = {Evangelism in social networks: Algorithms and complexity},
  journal      = {Networks},
  volume       = {71},
  number       = {4},
  pages        = {346--357},
  year         = {2018},
  url          = {https://doi.org/10.1002/net.21756},
  doi          = {10.1002/NET.21756},
  timestamp    = {Fri, 09 Apr 2021 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/networks/CordascoGRV18.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/networks/DinlerT18,
  author       = {Derya Dinler and
                  Mustafa Kemal Tural},
  title        = {Faster computation of successive bounds on the group betweenness centrality},
  journal      = {Networks},
  volume       = {71},
  number       = {4},
  pages        = {358--380},
  year         = {2018},
  url          = {https://doi.org/10.1002/net.21817},
  doi          = {10.1002/NET.21817},
  timestamp    = {Thu, 25 Apr 2024 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/networks/DinlerT18.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/networks/FortzPR18,
  author       = {Bernard Fortz and
                  Dimitri Papadimitriou and
                  Mauricio G. C. Resende},
  title        = {Preface: Recent advances in telecommunications networks planning and
                  operation},
  journal      = {Networks},
  volume       = {71},
  number       = {2},
  pages        = {95--96},
  year         = {2018},
  url          = {https://doi.org/10.1002/net.21795},
  doi          = {10.1002/NET.21795},
  timestamp    = {Wed, 25 Sep 2019 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/networks/FortzPR18.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/networks/GillenVPP18,
  author       = {Colin P. Gillen and
                  Alexander Veremyev and
                  Oleg A. Prokopyev and
                  Eduardo L. Pasiliao},
  title        = {Critical arcs detection in influence networks},
  journal      = {Networks},
  volume       = {71},
  number       = {4},
  pages        = {412--431},
  year         = {2018},
  url          = {https://doi.org/10.1002/net.21761},
  doi          = {10.1002/NET.21761},
  timestamp    = {Fri, 27 Mar 2020 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/networks/GillenVPP18.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/networks/GloverR18,
  author       = {Fred W. Glover and
                  C{\'{e}}sar Rego},
  title        = {New assignment-based neighborhoods for traveling salesman and routing
                  problems},
  journal      = {Networks},
  volume       = {71},
  number       = {3},
  pages        = {170--187},
  year         = {2018},
  url          = {https://doi.org/10.1002/net.21801},
  doi          = {10.1002/NET.21801},
  timestamp    = {Tue, 04 Jun 2019 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/networks/GloverR18.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/networks/GoldenS18,
  author       = {Bruce L. Golden and
                  Douglas R. Shier},
  title        = {Editorial},
  journal      = {Networks},
  volume       = {71},
  number       = {3},
  pages        = {169},
  year         = {2018},
  url          = {https://doi.org/10.1002/net.21814},
  doi          = {10.1002/NET.21814},
  timestamp    = {Mon, 07 May 2018 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/networks/GoldenS18.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/networks/GouveiaPRS18,
  author       = {Luis Gouveia and
                  Pierre Pesneau and
                  Mario Ruthmair and
                  Daniel Santos},
  title        = {Combining and projecting flow models for the (precedence constrained)
                  asymmetric traveling salesman problem},
  journal      = {Networks},
  volume       = {71},
  number       = {4},
  pages        = {451--465},
  year         = {2018},
  url          = {https://doi.org/10.1002/net.21765},
  doi          = {10.1002/NET.21765},
  timestamp    = {Tue, 07 May 2024 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/networks/GouveiaPRS18.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/networks/HwangJ18,
  author       = {Dawsen Hwang and
                  Patrick Jaillet},
  title        = {Online scheduling with multi-state machines},
  journal      = {Networks},
  volume       = {71},
  number       = {3},
  pages        = {209--251},
  year         = {2018},
  url          = {https://doi.org/10.1002/net.21799},
  doi          = {10.1002/NET.21799},
  timestamp    = {Tue, 15 May 2018 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/networks/HwangJ18.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/networks/KovalyovPR18,
  author       = {Mikhail Y. Kovalyov and
                  Erwin Pesch and
                  Andrew Ryzhikov},
  title        = {A note on scheduling container storage operations of two non-passing
                  stacking cranes},
  journal      = {Networks},
  volume       = {71},
  number       = {3},
  pages        = {271--280},
  year         = {2018},
  url          = {https://doi.org/10.1002/net.21803},
  doi          = {10.1002/NET.21803},
  timestamp    = {Mon, 26 Oct 2020 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/networks/KovalyovPR18.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/networks/LiH18,
  author       = {Songtao Li and
                  Simin Huang},
  title        = {Multiple searchers searching for a randomly distributed immobile target
                  on a unit network},
  journal      = {Networks},
  volume       = {71},
  number       = {1},
  pages        = {60--80},
  year         = {2018},
  url          = {https://doi.org/10.1002/net.21793},
  doi          = {10.1002/NET.21793},
  timestamp    = {Fri, 30 Nov 2018 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/networks/LiH18.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/networks/LiuD18,
  author       = {Jiaxin Liu and
                  Stanko Dimitrov},
  title        = {Open shortest path first routing under random early detection},
  journal      = {Networks},
  volume       = {71},
  number       = {2},
  pages        = {120--135},
  year         = {2018},
  url          = {https://doi.org/10.1002/net.21792},
  doi          = {10.1002/NET.21792},
  timestamp    = {Mon, 26 Oct 2020 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/networks/LiuD18.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/networks/MaggiLCM18,
  author       = {Lorenzo Maggi and
                  J{\'{e}}r{\'{e}}mie Leguay and
                  Johanne Cohen and
                  Paolo Medagliani},
  title        = {Domain clustering for inter-domain path computation speed-up},
  journal      = {Networks},
  volume       = {71},
  number       = {3},
  pages        = {252--270},
  year         = {2018},
  url          = {https://doi.org/10.1002/net.21800},
  doi          = {10.1002/NET.21800},
  timestamp    = {Fri, 30 Nov 2018 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/networks/MaggiLCM18.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/networks/Mattia18,
  author       = {Sara Mattia},
  title        = {The capacity formulation of the capacitated edge activation problem},
  journal      = {Networks},
  volume       = {71},
  number       = {4},
  pages        = {381--402},
  year         = {2018},
  url          = {https://doi.org/10.1002/net.21797},
  doi          = {10.1002/NET.21797},
  timestamp    = {Tue, 10 Jul 2018 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/networks/Mattia18.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/networks/MouraGB18,
  author       = {Leonardo F. S. Moura and
                  Luciano Paschoal Gaspary and
                  Luciana S. Buriol},
  title        = {A branch-and-price algorithm for the single-path virtual network embedding
                  problem},
  journal      = {Networks},
  volume       = {71},
  number       = {3},
  pages        = {188--208},
  year         = {2018},
  url          = {https://doi.org/10.1002/net.21798},
  doi          = {10.1002/NET.21798},
  timestamp    = {Tue, 15 May 2018 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/networks/MouraGB18.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/networks/PastukhovVBP18,
  author       = {Grigory Pastukhov and
                  Alexander Veremyev and
                  Vladimir Boginski and
                  Oleg A. Prokopyev},
  title        = {On maximum degree-based {\(\gamma\)}-quasi-clique problem: Complexity
                  and exact approaches},
  journal      = {Networks},
  volume       = {71},
  number       = {2},
  pages        = {136--152},
  year         = {2018},
  url          = {https://doi.org/10.1002/net.21791},
  doi          = {10.1002/NET.21791},
  timestamp    = {Fri, 27 Mar 2020 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/networks/PastukhovVBP18.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/networks/PereiraC18,
  author       = {Dilson Lucas Pereira and
                  Alexandre Salles da Cunha},
  title        = {Polyhedral results, branch-and-cut and Lagrangian relaxation algorithms
                  for the adjacent only quadratic minimum spanning tree problem},
  journal      = {Networks},
  volume       = {71},
  number       = {1},
  pages        = {31--50},
  year         = {2018},
  url          = {https://doi.org/10.1002/net.21787},
  doi          = {10.1002/NET.21787},
  timestamp    = {Fri, 05 Jan 2018 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/networks/PereiraC18.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/networks/RochaS18,
  author       = {Leonardo S. Rocha and
                  Diana Sasaki},
  title        = {The Backbone Packet Radio Network coloring for Time Division Multiple
                  Access link scheduling in Wireless Multihop Networks},
  journal      = {Networks},
  volume       = {71},
  number       = {4},
  pages        = {403--411},
  year         = {2018},
  url          = {https://doi.org/10.1002/net.21767},
  doi          = {10.1002/NET.21767},
  timestamp    = {Fri, 06 May 2022 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/networks/RochaS18.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/networks/SundarCNB18,
  author       = {Kaarthik Sundar and
                  Carleton Coffrin and
                  Harsha Nagarajan and
                  Russell Bent},
  title        = {Probabilistic N-k failure-identification for power systems},
  journal      = {Networks},
  volume       = {71},
  number       = {3},
  pages        = {302--321},
  year         = {2018},
  url          = {https://doi.org/10.1002/net.21806},
  doi          = {10.1002/NET.21806},
  timestamp    = {Sun, 06 Oct 2024 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/networks/SundarCNB18.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/networks/VaismanK18,
  author       = {Radislav Vaisman and
                  Dirk P. Kroese},
  title        = {On the analysis of independent sets via multilevel splitting},
  journal      = {Networks},
  volume       = {71},
  number       = {3},
  pages        = {281--301},
  year         = {2018},
  url          = {https://doi.org/10.1002/net.21805},
  doi          = {10.1002/NET.21805},
  timestamp    = {Tue, 15 May 2018 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/networks/VaismanK18.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/networks/VogiatzisW18,
  author       = {Chrysafis Vogiatzis and
                  Jose L. Walteros},
  title        = {Integer programming models for detecting graph bipartitions with structural
                  requirements},
  journal      = {Networks},
  volume       = {71},
  number       = {4},
  pages        = {432--450},
  year         = {2018},
  url          = {https://doi.org/10.1002/net.21786},
  doi          = {10.1002/NET.21786},
  timestamp    = {Sun, 02 Oct 2022 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/networks/VogiatzisW18.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/networks/YanagisawaH18,
  author       = {Hiroki Yanagisawa and
                  Satoshi Hara},
  title        = {Discounted average degree density metric and new algorithms for the
                  densest subgraph problem},
  journal      = {Networks},
  volume       = {71},
  number       = {1},
  pages        = {3--15},
  year         = {2018},
  url          = {https://doi.org/10.1002/net.21764},
  doi          = {10.1002/NET.21764},
  timestamp    = {Tue, 13 Jul 2021 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/networks/YanagisawaH18.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/networks/Zotkiewicz18,
  author       = {Mateusz Zotkiewicz},
  title        = {Uncertainty in {FTTH} splitter installation},
  journal      = {Networks},
  volume       = {71},
  number       = {2},
  pages        = {153--165},
  year         = {2018},
  url          = {https://doi.org/10.1002/net.21783},
  doi          = {10.1002/NET.21783},
  timestamp    = {Tue, 06 Mar 2018 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/networks/Zotkiewicz18.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.