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/networks29.bht:"
download as .bib file
@article{DBLP:journals/networks/AboElFotoh97,
author = {Hosam M. F. AboElFotoh},
title = {Algorithms for computing message delay for wireless networks},
journal = {Networks},
volume = {29},
number = {2},
pages = {117--124},
year = {1997},
url = {https://doi.org/10.1002/(SICI)1097-0037(199703)29:2\<117::AID-NET6\>3.0.CO;2-M},
doi = {10.1002/(SICI)1097-0037(199703)29:2\<117::AID-NET6\>3.0.CO;2-M},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/networks/AboElFotoh97.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/networks/ArkinHK97,
author = {Esther M. Arkin and
Refael Hassin and
Limor Klein},
title = {Restricted delivery problems on a network},
journal = {Networks},
volume = {29},
number = {4},
pages = {205--216},
year = {1997},
url = {https://doi.org/10.1002/(SICI)1097-0037(199707)29:4\<205::AID-NET3\>3.0.CO;2-J},
doi = {10.1002/(SICI)1097-0037(199707)29:4\<205::AID-NET3\>3.0.CO;2-J},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/networks/ArkinHK97.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/networks/Asano97,
author = {Takao Asano},
title = {Constructing a bipartite graph of maximum connectivity with prescribed
degrees},
journal = {Networks},
volume = {29},
number = {4},
pages = {245--263},
year = {1997},
url = {https://doi.org/10.1002/(SICI)1097-0037(199707)29:4\<245::AID-NET7\>3.0.CO;2-F},
doi = {10.1002/(SICI)1097-0037(199707)29:4\<245::AID-NET7\>3.0.CO;2-F},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/networks/Asano97.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/networks/Bar-NoyK97,
author = {Amotz Bar{-}Noy and
Shlomo Kipnis},
title = {Multiple message broadcasting in the postal model},
journal = {Networks},
volume = {29},
number = {1},
pages = {1--10},
year = {1997},
url = {https://doi.org/10.1002/(SICI)1097-0037(199701)29:1\<1::AID-NET1\>3.0.CO;2-P},
doi = {10.1002/(SICI)1097-0037(199701)29:1\<1::AID-NET1\>3.0.CO;2-P},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/networks/Bar-NoyK97.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/networks/CaiKW97,
author = {X. Cai and
Ton Kloks and
C. K. Wong},
title = {Time-varying shortest path problems with constraints},
journal = {Networks},
volume = {29},
number = {3},
pages = {141--150},
year = {1997},
url = {https://doi.org/10.1002/(SICI)1097-0037(199705)29:3\<141::AID-NET2\>3.0.CO;2-H},
doi = {10.1002/(SICI)1097-0037(199705)29:3\<141::AID-NET2\>3.0.CO;2-H},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/networks/CaiKW97.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/networks/ChangW97,
author = {Chin{-}Chen Chang and
Wen{-}Bin Wu},
title = {A secure voting system on a public network},
journal = {Networks},
volume = {29},
number = {2},
pages = {81--87},
year = {1997},
url = {https://doi.org/10.1002/(SICI)1097-0037(199703)29:2\<81::AID-NET2\>3.0.CO;2-7},
doi = {10.1002/(SICI)1097-0037(199703)29:2\<81::AID-NET2\>3.0.CO;2-7},
timestamp = {Tue, 23 Jan 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/networks/ChangW97.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/networks/ChenP97,
author = {Zhi{-}Long Chen and
Warren B. Powell},
title = {A note on Bertsekas' small-label-first strategy},
journal = {Networks},
volume = {29},
number = {2},
pages = {111--116},
year = {1997},
url = {https://doi.org/10.1002/(SICI)1097-0037(199703)29:2\<111::AID-NET5\>3.0.CO;2-M},
doi = {10.1002/(SICI)1097-0037(199703)29:2\<111::AID-NET5\>3.0.CO;2-M},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/networks/ChenP97.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/networks/Chhajed97,
author = {Dilip Chhajed},
title = {Edge coloring a k-tree into two smaller trees},
journal = {Networks},
volume = {29},
number = {4},
pages = {191--194},
year = {1997},
url = {https://doi.org/10.1002/(SICI)1097-0037(199707)29:4\<191::AID-NET1\>3.0.CO;2-A},
doi = {10.1002/(SICI)1097-0037(199707)29:4\<191::AID-NET1\>3.0.CO;2-A},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/networks/Chhajed97.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/networks/CoullardGW97,
author = {Collette R. Coullard and
L. Leslie Gardner and
Donald K. Wagner},
title = {Minimum-weight cycles in 3-separable graphs},
journal = {Networks},
volume = {29},
number = {3},
pages = {151--160},
year = {1997},
url = {https://doi.org/10.1002/(SICI)1097-0037(199705)29:3\<151::AID-NET3\>3.0.CO;2-G},
doi = {10.1002/(SICI)1097-0037(199705)29:3\<151::AID-NET3\>3.0.CO;2-G},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/networks/CoullardGW97.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/networks/DuinV97,
author = {Cees Duin and
Stefan Vo{\ss}},
title = {Efficient path and vertex exchange in steiner tree algorithms},
journal = {Networks},
volume = {29},
number = {2},
pages = {89--105},
year = {1997},
url = {https://doi.org/10.1002/(SICI)1097-0037(199703)29:2\<89::AID-NET3\>3.0.CO;2-7},
doi = {10.1002/(SICI)1097-0037(199703)29:2\<89::AID-NET3\>3.0.CO;2-7},
timestamp = {Fri, 01 Mar 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/networks/DuinV97.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/networks/EvenL97,
author = {Shimon Even and
Ami Litman},
title = {Layered cross product - {A} technique to construct interconnection
networks},
journal = {Networks},
volume = {29},
number = {4},
pages = {219--223},
year = {1997},
url = {https://doi.org/10.1002/(SICI)1097-0037(199707)29:4\<219::AID-NET5\>3.0.CO;2-I},
doi = {10.1002/(SICI)1097-0037(199707)29:4\<219::AID-NET5\>3.0.CO;2-I},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/networks/EvenL97.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/networks/FischettiV97,
author = {Matteo Fischetti and
Daniele Vigo},
title = {A branch-and-cut algorithm for the resource-constrained minimum-weight
arborescence problem},
journal = {Networks},
volume = {29},
number = {1},
pages = {55--67},
year = {1997},
url = {https://doi.org/10.1002/(SICI)1097-0037(199701)29:1\<55::AID-NET6\>3.0.CO;2-B},
doi = {10.1002/(SICI)1097-0037(199701)29:1\<55::AID-NET6\>3.0.CO;2-B},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/networks/FischettiV97.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/networks/GagliardiL97,
author = {Daniel Gagliardi and
Marty Lewinter},
title = {An infinite class of reach-preservable graphs},
journal = {Networks},
volume = {29},
number = {4},
pages = {217--218},
year = {1997},
url = {https://doi.org/10.1002/(SICI)1097-0037(199707)29:4\<217::AID-NET4\>3.0.CO;2-I},
doi = {10.1002/(SICI)1097-0037(199707)29:4\<217::AID-NET4\>3.0.CO;2-I},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/networks/GagliardiL97.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/networks/HasunumaS97,
author = {Toru Hasunuma and
Yukio Shibata},
title = {Counting small cycles in generalized de Bruijn digraphs},
journal = {Networks},
volume = {29},
number = {1},
pages = {39--47},
year = {1997},
url = {https://doi.org/10.1002/(SICI)1097-0037(199701)29:1\<39::AID-NET4\>3.0.CO;2-D},
doi = {10.1002/(SICI)1097-0037(199701)29:1\<39::AID-NET4\>3.0.CO;2-D},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/networks/HasunumaS97.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/networks/KalpakisY97,
author = {Konstantinos Kalpakis and
Yaacov Yesha},
title = {On the bisection width of the transposition network},
journal = {Networks},
volume = {29},
number = {1},
pages = {69--76},
year = {1997},
url = {https://doi.org/10.1002/(SICI)1097-0037(199701)29:1\<69::AID-NET7\>3.0.CO;2-A},
doi = {10.1002/(SICI)1097-0037(199701)29:1\<69::AID-NET7\>3.0.CO;2-A},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/networks/KalpakisY97.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/networks/LiangJT97,
author = {De{-}Ron Liang and
Rong{-}Hong Jan and
Satish K. Tripathi},
title = {Reliability analysis of replicated and-or graphs},
journal = {Networks},
volume = {29},
number = {4},
pages = {195--203},
year = {1997},
url = {https://doi.org/10.1002/(SICI)1097-0037(199707)29:4\<195::AID-NET2\>3.0.CO;2-A},
doi = {10.1002/(SICI)1097-0037(199707)29:4\<195::AID-NET2\>3.0.CO;2-A},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/networks/LiangJT97.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/networks/Lin97,
author = {Yixun Lin},
title = {Minimum bandwidth problem for embedding graphs in cycles},
journal = {Networks},
volume = {29},
number = {3},
pages = {135--140},
year = {1997},
url = {https://doi.org/10.1002/(SICI)1097-0037(199705)29:3\<135::AID-NET1\>3.0.CO;2-I},
doi = {10.1002/(SICI)1097-0037(199705)29:3\<135::AID-NET1\>3.0.CO;2-I},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/networks/Lin97.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/networks/LinL97,
author = {Shin{-}Yeu Lin and
Ch'i{-}Hsin Lin},
title = {A computationally efficient method for nonlinear multicommodity network
flow problems},
journal = {Networks},
volume = {29},
number = {4},
pages = {225--244},
year = {1997},
url = {https://doi.org/10.1002/(SICI)1097-0037(199707)29:4\<225::AID-NET6\>3.0.CO;2-H},
doi = {10.1002/(SICI)1097-0037(199707)29:4\<225::AID-NET6\>3.0.CO;2-H},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/networks/LinL97.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/networks/OrdaR97,
author = {Ariel Orda and
Raphael Rom},
title = {Optimal packet fragmentation and routing in computer networks},
journal = {Networks},
volume = {29},
number = {1},
pages = {11--28},
year = {1997},
url = {https://doi.org/10.1002/(SICI)1097-0037(199701)29:1\<11::AID-NET2\>3.0.CO;2-F},
doi = {10.1002/(SICI)1097-0037(199701)29:1\<11::AID-NET2\>3.0.CO;2-F},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/networks/OrdaR97.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/networks/PallottinoS97,
author = {Stefano Pallottino and
Maria Grazia Scutell{\`{a}}},
title = {Dual algorithms for the shortest path tree problem},
journal = {Networks},
volume = {29},
number = {2},
pages = {125--133},
year = {1997},
url = {https://doi.org/10.1002/(SICI)1097-0037(199703)29:2\<125::AID-NET7\>3.0.CO;2-L},
doi = {10.1002/(SICI)1097-0037(199703)29:2\<125::AID-NET7\>3.0.CO;2-L},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/networks/PallottinoS97.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/networks/Penrice97,
author = {Stephen G. Penrice},
title = {Balanced graphs and network flows},
journal = {Networks},
volume = {29},
number = {2},
pages = {77--80},
year = {1997},
url = {https://doi.org/10.1002/(SICI)1097-0037(199703)29:2\<77::AID-NET1\>3.0.CO;2-8},
doi = {10.1002/(SICI)1097-0037(199703)29:2\<77::AID-NET1\>3.0.CO;2-8},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/networks/Penrice97.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/networks/ResendeR97,
author = {Mauricio G. C. Resende and
Celso C. Ribeiro},
title = {A {GRASP} for graph planarization},
journal = {Networks},
volume = {29},
number = {3},
pages = {173--189},
year = {1997},
url = {https://doi.org/10.1002/(SICI)1097-0037(199705)29:3\<173::AID-NET5\>3.0.CO;2-E},
doi = {10.1002/(SICI)1097-0037(199705)29:3\<173::AID-NET5\>3.0.CO;2-E},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/networks/ResendeR97.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/networks/Sankaranarayana97,
author = {Ramesh S. Sankaranarayana},
title = {Tracking the {P-NP} boundary for well-covered graphs},
journal = {Networks},
volume = {29},
number = {1},
pages = {29--37},
year = {1997},
url = {https://doi.org/10.1002/(SICI)1097-0037(199701)29:1\<29::AID-NET3\>3.0.CO;2-E},
doi = {10.1002/(SICI)1097-0037(199701)29:1\<29::AID-NET3\>3.0.CO;2-E},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/networks/Sankaranarayana97.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/networks/SharaihaGLO97,
author = {Yazid M. Sharaiha and
Michel Gendreau and
Gilbert Laporte and
Ibrahim H. Osman},
title = {A tabu search algorithm for the Capacitated Shortest Spanning Tree
Problem},
journal = {Networks},
volume = {29},
number = {3},
pages = {161--171},
year = {1997},
url = {https://doi.org/10.1002/(SICI)1097-0037(199705)29:3\<161::AID-NET4\>3.0.CO;2-F},
doi = {10.1002/(SICI)1097-0037(199705)29:3\<161::AID-NET4\>3.0.CO;2-F},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/networks/SharaihaGLO97.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/networks/ShiouraS97,
author = {Akiyoshi Shioura and
Maiko Shigeno},
title = {The tree center problems and the relationship with the bottleneck
knapsack problems},
journal = {Networks},
volume = {29},
number = {2},
pages = {107--110},
year = {1997},
url = {https://doi.org/10.1002/(SICI)1097-0037(199703)29:2\<107::AID-NET4\>3.0.CO;2-N},
doi = {10.1002/(SICI)1097-0037(199703)29:2\<107::AID-NET4\>3.0.CO;2-N},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/networks/ShiouraS97.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/networks/TseL97,
author = {Savio S. H. Tse and
Francis C. M. Lau},
title = {A lower bound for interval routing in general networks},
journal = {Networks},
volume = {29},
number = {1},
pages = {49--53},
year = {1997},
url = {https://doi.org/10.1002/(SICI)1097-0037(199701)29:1\<49::AID-NET5\>3.0.CO;2-C},
doi = {10.1002/(SICI)1097-0037(199701)29:1\<49::AID-NET5\>3.0.CO;2-C},
timestamp = {Mon, 21 Aug 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/networks/TseL97.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-05-23 21:06 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:
