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/networks51.bht:"
download as .bib file
@article{DBLP:journals/networks/ApollonioLRSP08,
author = {Nicola Apollonio and
Isabella Lari and
Federica Ricca and
Bruno Simeone and
Justo Puerto},
title = {Polynomial algorithms for partitioning a tree into single-center subtrees
to minimize flat service costs},
journal = {Networks},
volume = {51},
number = {1},
pages = {78--89},
year = {2008},
url = {https://doi.org/10.1002/net.20197},
doi = {10.1002/NET.20197},
timestamp = {Mon, 16 Sep 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/networks/ApollonioLRSP08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/networks/Baveja08,
author = {Alok Baveja},
title = {The fractional congestion bound for efficient edge disjoint routing},
journal = {Networks},
volume = {51},
number = {3},
pages = {190--199},
year = {2008},
url = {https://doi.org/10.1002/net.20216},
doi = {10.1002/NET.20216},
timestamp = {Thu, 14 Oct 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/networks/Baveja08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/networks/BentzCWPR08,
author = {C{\'{e}}dric Bentz and
Marie{-}Christine Costa and
Dominique de Werra and
Christophe Picouleau and
Bernard Ries},
title = {On a graph coloring problem arising from discrete tomography},
journal = {Networks},
volume = {51},
number = {4},
pages = {256--267},
year = {2008},
url = {https://doi.org/10.1002/net.20218},
doi = {10.1002/NET.20218},
timestamp = {Thu, 15 Jun 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/networks/BentzCWPR08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/networks/BompadreO08,
author = {Agust{\'{\i}}n Bompadre and
James B. Orlin},
title = {A simple method for improving the primal simplex method for the multicommodity
flow problem},
journal = {Networks},
volume = {51},
number = {1},
pages = {63--77},
year = {2008},
url = {https://doi.org/10.1002/net.20196},
doi = {10.1002/NET.20196},
timestamp = {Sun, 02 Jun 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/networks/BompadreO08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/networks/CamiD08,
author = {Aurel Cami and
Narsingh Deo},
title = {Techniques for analyzing dynamic random graph models of web-like networks:
An overview},
journal = {Networks},
volume = {51},
number = {4},
pages = {211--255},
year = {2008},
url = {https://doi.org/10.1002/net.20215},
doi = {10.1002/NET.20215},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/networks/CamiD08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/networks/DuhamelGMS08,
author = {Christophe Duhamel and
Luis Eduardo Neves Gouveia and
Pedro Moura and
Maur{\'{\i}}cio C. de Souza},
title = {Models and heuristics for a minimum arborescence problem},
journal = {Networks},
volume = {51},
number = {1},
pages = {34--47},
year = {2008},
url = {https://doi.org/10.1002/net.20194},
doi = {10.1002/NET.20194},
timestamp = {Thu, 31 Aug 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/networks/DuhamelGMS08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/networks/GalloS08,
author = {Giorgio Gallo and
Maria Grazia Scutell{\`{a}}},
title = {Foreword},
journal = {Networks},
volume = {51},
number = {1},
pages = {1--3},
year = {2008},
url = {https://doi.org/10.1002/net.20191},
doi = {10.1002/NET.20191},
timestamp = {Thu, 08 Jun 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/networks/GalloS08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/networks/GendreauILM08,
author = {Michel Gendreau and
Manuel Iori and
Gilbert Laporte and
Silvano Martello},
title = {A Tabu search heuristic for the vehicle routing problem with two-dimensional
loading constraints},
journal = {Networks},
volume = {51},
number = {1},
pages = {4--18},
year = {2008},
url = {https://doi.org/10.1002/net.20192},
doi = {10.1002/NET.20192},
timestamp = {Thu, 15 Jun 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/networks/GendreauILM08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/networks/GendreauILM08a,
author = {Michel Gendreau and
Manuel Iori and
Gilbert Laporte and
Silvano Martello},
title = {Erratum: {A} Tabu search heuristic for the vehicle routing problem
with two-dimensional loading constraints},
journal = {Networks},
volume = {51},
number = {2},
pages = {153},
year = {2008},
url = {https://doi.org/10.1002/net.20245},
doi = {10.1002/NET.20245},
timestamp = {Thu, 15 Jun 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/networks/GendreauILM08a.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/networks/GoldenS08,
author = {Bruce L. Golden and
Douglas R. Shier},
title = {Editorial: 2006 Glover-Klingman Prize winners},
journal = {Networks},
volume = {51},
number = {2},
pages = {91},
year = {2008},
url = {https://doi.org/10.1002/net.20229},
doi = {10.1002/NET.20229},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/networks/GoldenS08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/networks/HeuvelJ08,
author = {Jan van den Heuvel and
Matthew Johnson},
title = {Transversals of subtree hypergraphs and the source location problem
in digraphs},
journal = {Networks},
volume = {51},
number = {2},
pages = {113--119},
year = {2008},
url = {https://doi.org/10.1002/net.20206},
doi = {10.1002/NET.20206},
timestamp = {Tue, 07 May 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/networks/HeuvelJ08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/networks/Hicks08,
author = {Illya V. Hicks},
title = {New facets for the planar subgraph polytope},
journal = {Networks},
volume = {51},
number = {2},
pages = {120--132},
year = {2008},
url = {https://doi.org/10.1002/net.20207},
doi = {10.1002/NET.20207},
timestamp = {Sat, 09 Apr 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/networks/Hicks08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/networks/Hsieh08,
author = {Sun{-}Yuan Hsieh},
title = {Some edge-fault-tolerant properties of the folded hypercube},
journal = {Networks},
volume = {51},
number = {2},
pages = {92--101},
year = {2008},
url = {https://doi.org/10.1002/net.20204},
doi = {10.1002/NET.20204},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/networks/Hsieh08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/networks/JhaAS08,
author = {Krishna C. Jha and
Ravindra K. Ahuja and
G{\"{u}}ven{\c{c}} Sahin},
title = {New approaches for solving the block-to-train assignment problem},
journal = {Networks},
volume = {51},
number = {1},
pages = {48--62},
year = {2008},
url = {https://doi.org/10.1002/net.20195},
doi = {10.1002/NET.20195},
timestamp = {Sat, 05 Sep 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/networks/JhaAS08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/networks/LabbeY08,
author = {Martine Labb{\'{e}} and
Hande Yaman},
title = {Solving the hub location problem in a star-star network},
journal = {Networks},
volume = {51},
number = {1},
pages = {19--33},
year = {2008},
url = {https://doi.org/10.1002/net.20193},
doi = {10.1002/NET.20193},
timestamp = {Sat, 09 Apr 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/networks/LabbeY08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/networks/LaiC08,
author = {Cheng{-}Nan Lai and
Gen{-}Huey Chen},
title = {\emph{w}-Rabin numbers and strong \emph{w}-Rabin numbers of folded
hypercubes},
journal = {Networks},
volume = {51},
number = {3},
pages = {171--177},
year = {2008},
url = {https://doi.org/10.1002/net.20213},
doi = {10.1002/NET.20213},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/networks/LaiC08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/networks/LevinPW08,
author = {Asaf Levin and
Dani{\"{e}}l Paulusma and
Gerhard J. Woeginger},
title = {The computational complexity of graph contractions {I:} Polynomially
solvable and NP-complete cases},
journal = {Networks},
volume = {51},
number = {3},
pages = {178--189},
year = {2008},
url = {https://doi.org/10.1002/net.20214},
doi = {10.1002/NET.20214},
timestamp = {Sun, 02 Oct 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/networks/LevinPW08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/networks/OnalW08,
author = {Hayri {\"{O}}nal and
Yicheng Wang},
title = {A graph theory approach for designing conservation reserve networks
with minimal fragmentation},
journal = {Networks},
volume = {51},
number = {2},
pages = {142--152},
year = {2008},
url = {https://doi.org/10.1002/net.20211},
doi = {10.1002/NET.20211},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/networks/OnalW08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/networks/RighiniS08,
author = {Giovanni Righini and
Matteo Salani},
title = {New dynamic programming algorithms for the resource constrained elementary
shortest path problem},
journal = {Networks},
volume = {51},
number = {3},
pages = {155--170},
year = {2008},
url = {https://doi.org/10.1002/net.20212},
doi = {10.1002/NET.20212},
timestamp = {Sat, 09 Apr 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/networks/RighiniS08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/networks/Scutella08,
author = {Maria Grazia Scutell{\`{a}}},
title = {The maximum congested cut problem and its robust counterpart: Exact
and approximation algorithms for the single and the multicommodity
case},
journal = {Networks},
volume = {51},
number = {2},
pages = {102--112},
year = {2008},
url = {https://doi.org/10.1002/net.20205},
doi = {10.1002/NET.20205},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/networks/Scutella08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/networks/SouzaMG08,
author = {Maur{\'{\i}}cio C. de Souza and
Philippe Mahey and
Bernard Gendron},
title = {Cycle-based algorithms for multicommodity network flow problems with
separable piecewise convex costs},
journal = {Networks},
volume = {51},
number = {2},
pages = {133--141},
year = {2008},
url = {https://doi.org/10.1002/net.20208},
doi = {10.1002/NET.20208},
timestamp = {Mon, 26 Oct 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/networks/SouzaMG08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/networks/WangL08,
author = {Shiying Wang and
Shangwei Lin},
title = {Sufficient conditions for a graph to be super restricted edge-connected},
journal = {Networks},
volume = {51},
number = {3},
pages = {200--209},
year = {2008},
url = {https://doi.org/10.1002/net.20217},
doi = {10.1002/NET.20217},
timestamp = {Thu, 18 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/networks/WangL08.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-08-26 06:51 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:
