Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDSearch dblp for Publications
export results for "toc:db/journals/networks/networks53.bht:"
download as .bib file
@article{DBLP:journals/networks/AkcaliCU09,
author = {Elif Ak{\c{c}}ali and
Sila {\c{C}}etinkaya and
Halit {\"{U}}ster},
title = {Network design for reverse and closed-loop supply chains: An annotated
bibliography of models and solution approaches},
journal = {Networks},
volume = {53},
number = {3},
pages = {231--248},
year = {2009},
url = {https://doi.org/10.1002/net.20267},
doi = {10.1002/NET.20267},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/networks/AkcaliCU09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/networks/AlpernBG09,
author = {Steve Alpern and
Vic Baston and
Shmuel Gal},
title = {Searching symmetric networks with Utilitarian-Postman paths},
journal = {Networks},
volume = {53},
number = {4},
pages = {392--402},
year = {2009},
url = {https://doi.org/10.1002/net.20314},
doi = {10.1002/NET.20314},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/networks/AlpernBG09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/networks/AndreasS09,
author = {April K. Andreas and
J. Cole Smith},
title = {Decomposition algorithms for the design of a nonsimultaneous capacitated
evacuation tree network},
journal = {Networks},
volume = {53},
number = {2},
pages = {91--103},
year = {2009},
url = {https://doi.org/10.1002/net.20278},
doi = {10.1002/NET.20278},
timestamp = {Thu, 14 Oct 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/networks/AndreasS09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/networks/BallDV09,
author = {Michael O. Ball and
Geir Dahl and
Thomas Vossen},
title = {Matchings in connection with ground delay program planning},
journal = {Networks},
volume = {53},
number = {3},
pages = {293--306},
year = {2009},
url = {https://doi.org/10.1002/net.20272},
doi = {10.1002/NET.20272},
timestamp = {Fri, 27 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/networks/BallDV09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/networks/BenkocziBT09,
author = {Robert Benkoczi and
Binay K. Bhattacharya and
Arie Tamir},
title = {Collection depots facility location problems in trees},
journal = {Networks},
volume = {53},
number = {1},
pages = {50--62},
year = {2009},
url = {https://doi.org/10.1002/net.20258},
doi = {10.1002/NET.20258},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/networks/BenkocziBT09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/networks/BloznelisJR09,
author = {Mindaugas Bloznelis and
Jerzy Jaworski and
Katarzyna Rybarczyk},
title = {Component evolution in a secure wireless sensor network},
journal = {Networks},
volume = {53},
number = {1},
pages = {19--26},
year = {2009},
url = {https://doi.org/10.1002/net.20256},
doi = {10.1002/NET.20256},
timestamp = {Sat, 19 Oct 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/networks/BloznelisJR09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/networks/BrazilTNWWZ09,
author = {Marcus Brazil and
Doreen A. Thomas and
Benny K. Nielsen and
Pawel Winter and
Christian Wulff{-}Nilsen and
Martin Zachariasen},
title = {A novel approach to phylogenetic trees: \emph{d}-Dimensional geometric
Steiner trees},
journal = {Networks},
volume = {53},
number = {2},
pages = {104--111},
year = {2009},
url = {https://doi.org/10.1002/net.20279},
doi = {10.1002/NET.20279},
timestamp = {Sun, 02 Jun 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/networks/BrazilTNWWZ09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/networks/CalamoneriCPO09,
author = {Tiziana Calamoneri and
Saverio Caminiti and
Rossella Petreschi and
Stephan Olariu},
title = {On the \emph{L}(\emph{h}, \emph{k})-labeling of co-comparability graphs
and circular-arc graphs},
journal = {Networks},
volume = {53},
number = {1},
pages = {27--34},
year = {2009},
url = {https://doi.org/10.1002/net.20257},
doi = {10.1002/NET.20257},
timestamp = {Fri, 30 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/networks/CalamoneriCPO09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/networks/Caliskan09,
author = {Cenk {\c{C}}aliskan},
title = {On a capacity scaling algorithm for the constrained maximum flow problem},
journal = {Networks},
volume = {53},
number = {3},
pages = {229--230},
year = {2009},
url = {https://doi.org/10.1002/net.20263},
doi = {10.1002/NET.20263},
timestamp = {Mon, 26 Oct 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/networks/Caliskan09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/networks/Catanzaro09,
author = {Daniele Catanzaro},
title = {The minimum evolution problem: Overview and classification},
journal = {Networks},
volume = {53},
number = {2},
pages = {112--125},
year = {2009},
url = {https://doi.org/10.1002/net.20280},
doi = {10.1002/NET.20280},
timestamp = {Thu, 08 Jun 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/networks/Catanzaro09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/networks/CatanzaroLPG09,
author = {Daniele Catanzaro and
Martine Labb{\'{e}} and
Raffaele Pesenti and
Juan Jos{\'{e}} Salazar Gonz{\'{a}}lez},
title = {Mathematical models to reconstruct phylogenetic trees under the minimum
evolution criterion},
journal = {Networks},
volume = {53},
number = {2},
pages = {126--140},
year = {2009},
url = {https://doi.org/10.1002/net.20281},
doi = {10.1002/NET.20281},
timestamp = {Sat, 19 Oct 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/networks/CatanzaroLPG09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/networks/ChenC09,
author = {Xujin Chen and
Bo Chen},
title = {Cost-effective designs of fault-tolerant access networks in communication
systems},
journal = {Networks},
volume = {53},
number = {4},
pages = {382--391},
year = {2009},
url = {https://doi.org/10.1002/net.20306},
doi = {10.1002/NET.20306},
timestamp = {Wed, 21 Mar 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/networks/ChenC09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/networks/CostaCL09,
author = {Alysson M. Costa and
Jean{-}Fran{\c{c}}ois Cordeau and
Gilbert Laporte},
title = {Models and branch-and-cut algorithms for the Steiner tree problem
with revenues, budget and hop constraints},
journal = {Networks},
volume = {53},
number = {2},
pages = {141--159},
year = {2009},
url = {https://doi.org/10.1002/net.20274},
doi = {10.1002/NET.20274},
timestamp = {Thu, 08 Jun 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/networks/CostaCL09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/networks/DabneyDH09,
author = {John Dabney and
Brian C. Dean and
Stephen T. Hedetniemi},
title = {A linear-time algorithm for broadcast domination in a tree},
journal = {Networks},
volume = {53},
number = {2},
pages = {160--169},
year = {2009},
url = {https://doi.org/10.1002/net.20275},
doi = {10.1002/NET.20275},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/networks/DabneyDH09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/networks/DrummondSU09,
author = {L{\'{u}}cia M. A. Drummond and
Marcelo C. P. Santos and
Eduardo Uchoa},
title = {A distributed dual ascent algorithm for Steiner problems in multicast
routing},
journal = {Networks},
volume = {53},
number = {2},
pages = {170--183},
year = {2009},
url = {https://doi.org/10.1002/net.20276},
doi = {10.1002/NET.20276},
timestamp = {Sat, 09 Apr 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/networks/DrummondSU09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/networks/GabowGTW09,
author = {Harold N. Gabow and
Michel X. Goemans and
{\'{E}}va Tardos and
David P. Williamson},
title = {Approximating the smallest \emph{k}-edge connected spanning subgraph
by LP-rounding},
journal = {Networks},
volume = {53},
number = {4},
pages = {345--357},
year = {2009},
url = {https://doi.org/10.1002/net.20289},
doi = {10.1002/NET.20289},
timestamp = {Fri, 25 Dec 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/networks/GabowGTW09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/networks/GhateS09,
author = {Archis Ghate and
Robert L. Smith},
title = {A Hit-and-Run approach for generating scale invariant Small World
networks},
journal = {Networks},
volume = {53},
number = {1},
pages = {67--78},
year = {2009},
url = {https://doi.org/10.1002/net.20262},
doi = {10.1002/NET.20262},
timestamp = {Wed, 22 Nov 2017 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/networks/GhateS09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/networks/GoddardH09,
author = {Wayne Goddard and
Stephen T. Hedetniemi},
title = {A note on trees, tables, and algorithms},
journal = {Networks},
volume = {53},
number = {2},
pages = {184--190},
year = {2009},
url = {https://doi.org/10.1002/net.20282},
doi = {10.1002/NET.20282},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/networks/GoddardH09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/networks/Gomez09,
author = {Jos{\'{e}} G{\'{o}}mez},
title = {Some new large (delta, 3)-graphs},
journal = {Networks},
volume = {53},
number = {1},
pages = {1--5},
year = {2009},
url = {https://doi.org/10.1002/net.20254},
doi = {10.1002/NET.20254},
timestamp = {Thu, 16 Dec 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/networks/Gomez09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/networks/Gouveia09,
author = {Luis Eduardo Neves Gouveia},
title = {Preface},
journal = {Networks},
volume = {53},
number = {2},
pages = {89--90},
year = {2009},
url = {https://doi.org/10.1002/net.20277},
doi = {10.1002/NET.20277},
timestamp = {Mon, 21 Sep 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/networks/Gouveia09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/networks/GrigorievLSU09,
author = {Alexander Grigoriev and
Joyce van Loon and
Ren{\'{e}} Sitters and
Marc Uetz},
title = {Optimal pricing of capacitated networks},
journal = {Networks},
volume = {53},
number = {1},
pages = {79--87},
year = {2009},
url = {https://doi.org/10.1002/net.20260},
doi = {10.1002/NET.20260},
timestamp = {Wed, 14 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/networks/GrigorievLSU09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/networks/HarutyunyanLS09,
author = {Hovhannes A. Harutyunyan and
Arthur L. Liestman and
Bin Shao},
title = {A linear algorithm for finding the \emph{k}-broadcast center of a
tree},
journal = {Networks},
volume = {53},
number = {3},
pages = {287--292},
year = {2009},
url = {https://doi.org/10.1002/net.20270},
doi = {10.1002/NET.20270},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/networks/HarutyunyanLS09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/networks/HochbaumL09,
author = {Dorit S. Hochbaum and
Asaf Levin},
title = {The multi-integer set cover and the facility terminal cover problem},
journal = {Networks},
volume = {53},
number = {1},
pages = {63--66},
year = {2009},
url = {https://doi.org/10.1002/net.20265},
doi = {10.1002/NET.20265},
timestamp = {Sun, 02 Oct 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/networks/HochbaumL09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/networks/HouS09,
author = {Zhe Hou and
Maiko Shigeno},
title = {New bounds on the minimum number of calls in failure-tolerant gossiping},
journal = {Networks},
volume = {53},
number = {1},
pages = {35--38},
year = {2009},
url = {https://doi.org/10.1002/net.20259},
doi = {10.1002/NET.20259},
timestamp = {Mon, 26 Jun 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/networks/HouS09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/networks/HouXX09,
author = {Xinmin Hou and
Jun{-}Ming Xu and
Min Xu},
title = {The forwarding indices of wrapped butterfly networks},
journal = {Networks},
volume = {53},
number = {4},
pages = {329--333},
year = {2009},
url = {https://doi.org/10.1002/net.20271},
doi = {10.1002/NET.20271},
timestamp = {Sun, 02 Oct 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/networks/HouXX09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/networks/KlasingKN09,
author = {Ralf Klasing and
Adrian Kosowski and
Alfredo Navarra},
title = {Cost minimization in wireless networks with a bounded and unbounded
number of interfaces},
journal = {Networks},
volume = {53},
number = {3},
pages = {266--275},
year = {2009},
url = {https://doi.org/10.1002/net.20266},
doi = {10.1002/NET.20266},
timestamp = {Fri, 27 Dec 2019 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/networks/KlasingKN09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/networks/KohlerLWR09,
author = {Ekkehard K{\"{o}}hler and
Christian Liebchen and
Gregor W{\"{u}}nsch and
Romeo Rizzi},
title = {Lower bounds for strictly fundamental cycle bases in grid graphs},
journal = {Networks},
volume = {53},
number = {2},
pages = {191--205},
year = {2009},
url = {https://doi.org/10.1002/net.20283},
doi = {10.1002/NET.20283},
timestamp = {Thu, 08 Jun 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/networks/KohlerLWR09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/networks/LaskarMNV09,
author = {Renu C. Laskar and
Gretchen L. Matthews and
Beth Novick and
John Villalpando},
title = {On irreducible no-hole \emph{L}(2, 1)-coloring of trees},
journal = {Networks},
volume = {53},
number = {2},
pages = {206--211},
year = {2009},
url = {https://doi.org/10.1002/net.20286},
doi = {10.1002/NET.20286},
timestamp = {Sat, 05 Sep 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/networks/LaskarMNV09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/networks/Lewis09,
author = {Mark W. Lewis},
title = {On the use of guided design search for discovering significant decision
variables in the fixed-charge capacitated multicommodity network design
problem},
journal = {Networks},
volume = {53},
number = {1},
pages = {6--18},
year = {2009},
url = {https://doi.org/10.1002/net.20255},
doi = {10.1002/NET.20255},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/networks/Lewis09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/networks/MuhandiramgeB09,
author = {Ranga Muhandiramge and
Natashia Boland},
title = {Simultaneous solution of Lagrangean dual problems interleaved with
preprocessing for the weight constrained shortest path problem},
journal = {Networks},
volume = {53},
number = {4},
pages = {358--381},
year = {2009},
url = {https://doi.org/10.1002/net.20292},
doi = {10.1002/NET.20292},
timestamp = {Thu, 15 Jun 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/networks/MuhandiramgeB09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/networks/Pineda-VillavicencioGMP09,
author = {Guillermo Pineda{-}Villavicencio and
Jos{\'{e}} G{\'{o}}mez and
Mirka Miller and
Hebert P{\'{e}}rez{-}Ros{\'{e}}s},
title = {New largest known graphs of diameter 6},
journal = {Networks},
volume = {53},
number = {4},
pages = {315--328},
year = {2009},
url = {https://doi.org/10.1002/net.20269},
doi = {10.1002/NET.20269},
timestamp = {Thu, 15 Jun 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/networks/Pineda-VillavicencioGMP09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/networks/PrendergastTW09,
author = {Kevin Prendergast and
Doreen A. Thomas and
Jia F. Weng},
title = {Optimum Steiner ratio for gradient-constrained networks connecting
three points in 3-space, part {I}},
journal = {Networks},
volume = {53},
number = {2},
pages = {212--220},
year = {2009},
url = {https://doi.org/10.1002/net.20285},
doi = {10.1002/NET.20285},
timestamp = {Sun, 02 Jun 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/networks/PrendergastTW09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/networks/PuertoRS09,
author = {Justo Puerto and
Federica Ricca and
Andrea Scozzari},
title = {The continuous and discrete path-variance problems on trees},
journal = {Networks},
volume = {53},
number = {2},
pages = {221--228},
year = {2009},
url = {https://doi.org/10.1002/net.20284},
doi = {10.1002/NET.20284},
timestamp = {Wed, 14 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/networks/PuertoRS09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/networks/SahinA09,
author = {G{\"{u}}ven{\c{c}} Sahin and
Ravindra K. Ahuja},
title = {Lower bounding techniques for the degree-constrained network design
problem},
journal = {Networks},
volume = {53},
number = {4},
pages = {334--344},
year = {2009},
url = {https://doi.org/10.1002/net.20287},
doi = {10.1002/NET.20287},
timestamp = {Sat, 05 Sep 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/networks/SahinA09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/networks/SheraliG09,
author = {Hanif D. Sherali and
Ahmed Ghoniem},
title = {Joint vehicle assembly-routing problems: An integrated modeling and
optimization approach},
journal = {Networks},
volume = {53},
number = {3},
pages = {249--265},
year = {2009},
url = {https://doi.org/10.1002/net.20268},
doi = {10.1002/NET.20268},
timestamp = {Thu, 08 Jun 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/networks/SheraliG09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/networks/TsaiCF09,
author = {Ping{-}Ying Tsai and
Gen{-}Huey Chen and
Jung{-}Sheng Fu},
title = {Edge-fault-tolerant pancyclicity of alternating group graphs},
journal = {Networks},
volume = {53},
number = {3},
pages = {307--313},
year = {2009},
url = {https://doi.org/10.1002/net.20291},
doi = {10.1002/NET.20291},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/networks/TsaiCF09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/networks/WangG09,
author = {Yong Wang and
Qian{-}Ping Gu},
title = {Minimizing {SONET} Add-Drop Multiplexers in optical {UPSR} networks
using the minimum number of wavelengths},
journal = {Networks},
volume = {53},
number = {3},
pages = {276--286},
year = {2009},
url = {https://doi.org/10.1002/net.20264},
doi = {10.1002/NET.20264},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/networks/WangG09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/networks/WangWC09,
author = {Hung{-}Lung Wang and
Bang Ye Wu and
Kun{-}Mao Chao},
title = {The backup 2-center and backup 2-median problems on trees},
journal = {Networks},
volume = {53},
number = {1},
pages = {39--49},
year = {2009},
url = {https://doi.org/10.1002/net.20261},
doi = {10.1002/NET.20261},
timestamp = {Thu, 08 Jun 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/networks/WangWC09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
a service of 
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.
retrieved on 2024-04-25 16:05 CEST from data curated by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
