default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDSearch dblp for Publications
export results for "toc:db/journals/networks/networks37.bht:"
download as .bib file
@article{DBLP:journals/networks/CaccettaH01,
author = {Lou Caccetta and
Stephen P. Hill},
title = {A branch and cut method for the degree-constrained minimum spanning
tree problem},
journal = {Networks},
volume = {37},
number = {2},
pages = {74--83},
year = {2001},
url = {https://doi.org/10.1002/1097-0037(200103)37:2\<74::AID-NET2\>3.0.CO;2-E},
doi = {10.1002/1097-0037(200103)37:2\<74::AID-NET2\>3.0.CO;2-E},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/networks/CaccettaH01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/networks/ColbournW01,
author = {Charles J. Colbourn and
Peng{-}Jun Wan},
title = {Minimizing drop cost for {SONET/WDM} networks with wavelength requirements},
journal = {Networks},
volume = {37},
number = {2},
pages = {107--116},
year = {2001},
url = {https://doi.org/10.1002/1097-0037(200103)37:2\<107::AID-NET6\>3.0.CO;2-A},
doi = {10.1002/1097-0037(200103)37:2\<107::AID-NET6\>3.0.CO;2-A},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/networks/ColbournW01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/networks/FlamminiGNT01,
author = {Michele Flammini and
Giorgio Gambosi and
Umberto Nanni and
Richard B. Tan},
title = {Characterization results of all shortest paths interval routing schemes},
journal = {Networks},
volume = {37},
number = {4},
pages = {225--232},
year = {2001},
url = {https://doi.org/10.1002/net.1017},
doi = {10.1002/NET.1017},
timestamp = {Fri, 27 Dec 2019 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/networks/FlamminiGNT01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/networks/Fremuth-PaegerJ01,
author = {Christian Fremuth{-}Paeger and
Dieter Jungnickel},
title = {Balanced network flows. {IV.} Duality and structure theory},
journal = {Networks},
volume = {37},
number = {4},
pages = {194--201},
year = {2001},
url = {https://doi.org/10.1002/net.1013},
doi = {10.1002/NET.1013},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/networks/Fremuth-PaegerJ01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/networks/Fremuth-PaegerJ01a,
author = {Christian Fremuth{-}Paeger and
Dieter Jungnickel},
title = {Balanced network flows. V. Cycle-canceling algorithms},
journal = {Networks},
volume = {37},
number = {4},
pages = {202--209},
year = {2001},
url = {https://doi.org/10.1002/net.1014},
doi = {10.1002/NET.1014},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/networks/Fremuth-PaegerJ01a.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/networks/Fremuth-PaegerJ01b,
author = {Christian Fremuth{-}Paeger and
Dieter Jungnickel},
title = {Balanced network flows. {VI.} Polyhedral descriptions},
journal = {Networks},
volume = {37},
number = {4},
pages = {210--218},
year = {2001},
url = {https://doi.org/10.1002/net.1015},
doi = {10.1002/NET.1015},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/networks/Fremuth-PaegerJ01b.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/networks/Frisch01,
author = {Ivan T. Frisch},
title = {The early days of Networks},
journal = {Networks},
volume = {37},
number = {1},
pages = {1--7},
year = {2001},
url = {https://doi.org/10.1002/1097-0037(200101)37:1\<1::AID-NET1\>3.0.CO;2-E},
doi = {10.1002/1097-0037(200101)37:1\<1::AID-NET1\>3.0.CO;2-E},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/networks/Frisch01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/networks/GhianiIL01,
author = {Gianpaolo Ghiani and
Gennaro Improta and
Gilbert Laporte},
title = {The capacitated arc routing problem with intermediate facilities},
journal = {Networks},
volume = {37},
number = {3},
pages = {134--143},
year = {2001},
url = {https://doi.org/10.1002/net.3},
doi = {10.1002/NET.3},
timestamp = {Thu, 08 Jun 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/networks/GhianiIL01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/networks/Goel01,
author = {Ashish Goel},
title = {Stability of networks and protocols in the adversarial queueing model
for packet routing},
journal = {Networks},
volume = {37},
number = {4},
pages = {219--224},
year = {2001},
url = {https://doi.org/10.1002/net.1016},
doi = {10.1002/NET.1016},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/networks/Goel01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/networks/HarutyunyanL01a,
author = {Hovhannes A. Harutyunyan and
Arthur L. Liestman},
title = {Improved upper and lower bounds for k-broadcasting},
journal = {Networks},
volume = {37},
number = {2},
pages = {94--101},
year = {2001},
url = {https://doi.org/10.1002/1097-0037(200103)37:2\<94::AID-NET4\>3.0.CO;2-6},
doi = {10.1002/1097-0037(200103)37:2\<94::AID-NET4\>3.0.CO;2-6},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/networks/HarutyunyanL01a.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/networks/HelvigRZ01,
author = {Christopher S. Helvig and
Gabriel Robins and
Alexander Zelikovsky},
title = {An improved approximation scheme for the Group Steiner Problem},
journal = {Networks},
volume = {37},
number = {1},
pages = {8--20},
year = {2001},
url = {https://doi.org/10.1002/1097-0037(200101)37:1\<8::AID-NET2\>3.0.CO;2-R},
doi = {10.1002/1097-0037(200101)37:1\<8::AID-NET2\>3.0.CO;2-R},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/networks/HelvigRZ01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/networks/Hochbaum01,
author = {Dorit S. Hochbaum},
title = {A new - old algorithm for minimum-cut and maximum-flow in closure
graphs},
journal = {Networks},
volume = {37},
number = {4},
pages = {171--193},
year = {2001},
url = {https://doi.org/10.1002/net.1012},
doi = {10.1002/NET.1012},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/networks/Hochbaum01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/networks/HungHS01,
author = {Chun{-}Nan Hung and
Lih{-}Hsing Hsu and
Ting{-}Yi Sung},
title = {On the construction of combined k-fault-tolerant Hamiltonian graphs},
journal = {Networks},
volume = {37},
number = {3},
pages = {165--170},
year = {2001},
url = {https://doi.org/10.1002/net.6},
doi = {10.1002/NET.6},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/networks/HungHS01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/networks/HwangC01,
author = {Shien{-}Ching Hwang and
Gen{-}Huey Chen},
title = {Minimum spanners of butterfly graphs},
journal = {Networks},
volume = {37},
number = {3},
pages = {156--164},
year = {2001},
url = {https://doi.org/10.1002/net.5},
doi = {10.1002/NET.5},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/networks/HwangC01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/networks/IshiiNI01,
author = {Toshimasa Ishii and
Hiroshi Nagamochi and
Toshihide Ibaraki},
title = {Multigraph augmentation under biconnectivity and general edge-connectivity
requirements},
journal = {Networks},
volume = {37},
number = {3},
pages = {144--155},
year = {2001},
url = {https://doi.org/10.1002/net.4},
doi = {10.1002/NET.4},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/networks/IshiiNI01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/networks/LoC01,
author = {Ray{-}Shang Lo and
Gen{-}Huey Chen},
title = {Embedding longest fault-free paths in arrangement graphs with faulty
vertices},
journal = {Networks},
volume = {37},
number = {2},
pages = {84--93},
year = {2001},
url = {https://doi.org/10.1002/1097-0037(200103)37:2\<84::AID-NET3\>3.0.CO;2-A},
doi = {10.1002/1097-0037(200103)37:2\<84::AID-NET3\>3.0.CO;2-A},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/networks/LoC01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/networks/LoncPW01,
author = {Zbigniew Lonc and
Krzysztof Parol and
Jacek Wojciechowski},
title = {On the number of spanning trees in directed circulant graphs},
journal = {Networks},
volume = {37},
number = {3},
pages = {129--133},
year = {2001},
url = {https://doi.org/10.1002/net.2},
doi = {10.1002/NET.2},
timestamp = {Mon, 26 Oct 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/networks/LoncPW01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/networks/Miller-Hooks01,
author = {Elise Miller{-}Hooks},
title = {Adaptive least-expected time paths in stochastic, time-varying transportation
and data networks},
journal = {Networks},
volume = {37},
number = {1},
pages = {35--52},
year = {2001},
url = {https://doi.org/10.1002/1097-0037(200101)37:1\<35::AID-NET4\>3.0.CO;2-G},
doi = {10.1002/1097-0037(200101)37:1\<35::AID-NET4\>3.0.CO;2-G},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/networks/Miller-Hooks01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/networks/NicolaiS01,
author = {Falk Nicolai and
Thomas Szymczak},
title = {Homogeneous sets and domination: {A} linear time algorithm for distance
- hereditary graphs},
journal = {Networks},
volume = {37},
number = {3},
pages = {117--128},
year = {2001},
url = {https://doi.org/10.1002/net.1},
doi = {10.1002/NET.1},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/networks/NicolaiS01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/networks/RobertsS01,
author = {Fred S. Roberts and
Li Sheng},
title = {How hard is it to determine if a graph has a 2-role assignment?},
journal = {Networks},
volume = {37},
number = {2},
pages = {67--73},
year = {2001},
url = {https://doi.org/10.1002/1097-0037(200103)37:2\<67::AID-NET1\>3.0.CO;2-9},
doi = {10.1002/1097-0037(200103)37:2\<67::AID-NET1\>3.0.CO;2-9},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/networks/RobertsS01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/networks/SchirmerD01,
author = {Andreas Schirmer and
Andreas Drexl},
title = {Allocation of partially renewable resources: Concept, capabilities,
and applications},
journal = {Networks},
volume = {37},
number = {1},
pages = {21--34},
year = {2001},
url = {https://doi.org/10.1002/1097-0037(200101)37:1\<21::AID-NET3\>3.0.CO;2-W},
doi = {10.1002/1097-0037(200101)37:1\<21::AID-NET3\>3.0.CO;2-W},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/networks/SchirmerD01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/networks/Xiang01,
author = {Yang Xiang},
title = {Cooperative triangulation in MSBNs without revealing subnet structures},
journal = {Networks},
volume = {37},
number = {1},
pages = {53--65},
year = {2001},
url = {https://doi.org/10.1002/1097-0037(200101)37:1\<53::AID-NET5\>3.0.CO;2-H},
doi = {10.1002/1097-0037(200101)37:1\<53::AID-NET5\>3.0.CO;2-H},
timestamp = {Sun, 11 Mar 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/networks/Xiang01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/networks/ZhangW01,
author = {Shenggui Zhang and
Ziguo Wang},
title = {Scattering number in graphs},
journal = {Networks},
volume = {37},
number = {2},
pages = {102--106},
year = {2001},
url = {https://doi.org/10.1002/1097-0037(200103)37:2\<102::AID-NET5\>3.0.CO;2-S},
doi = {10.1002/1097-0037(200103)37:2\<102::AID-NET5\>3.0.CO;2-S},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/networks/ZhangW01.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.
retrieved on 2024-10-06 12:30 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:
