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/networks48.bht:"
download as .bib file
@article{DBLP:journals/networks/Araki06,
author = {Toru Araki},
title = {Hyper hamiltonian laceability of Cayley graphs generated by transpositions},
journal = {Networks},
volume = {48},
number = {3},
pages = {121--124},
year = {2006},
url = {https://doi.org/10.1002/net.20126},
doi = {10.1002/NET.20126},
timestamp = {Thu, 08 Jun 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/networks/Araki06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/networks/BalbuenaGM06,
author = {Camino Balbuena and
Pedro Garc{\'{\i}}a{-}V{\'{a}}zquez and
Xavier Marcote},
title = {Reliability of interconnection networks modeled by a product of graphs},
journal = {Networks},
volume = {48},
number = {3},
pages = {114--120},
year = {2006},
url = {https://doi.org/10.1002/net.20124},
doi = {10.1002/NET.20124},
timestamp = {Fri, 30 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/networks/BalbuenaGM06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/networks/Ben-AmeurG06,
author = {Walid Ben{-}Ameur and
Luis Eduardo Neves Gouveia},
title = {Further contributions to network optimization},
journal = {Networks},
volume = {48},
number = {1},
pages = {1--6},
year = {2006},
url = {https://doi.org/10.1002/net.20113},
doi = {10.1002/NET.20113},
timestamp = {Mon, 21 Sep 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/networks/Ben-AmeurG06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/networks/BolkerZ06,
author = {Ethan D. Bolker and
Thomas Zaslavsky},
title = {A simple algorithm that proves half-integrality of bidirected network
programming},
journal = {Networks},
volume = {48},
number = {1},
pages = {36--38},
year = {2006},
url = {https://doi.org/10.1002/net.20117},
doi = {10.1002/NET.20117},
timestamp = {Sat, 16 Sep 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/networks/BolkerZ06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/networks/BruglieriMT06,
author = {Maurizio Bruglieri and
Francesco Maffioli and
Marco Trubian},
title = {Solving minimum K-cardinality cut problems in planar graphs},
journal = {Networks},
volume = {48},
number = {4},
pages = {195--208},
year = {2006},
url = {https://doi.org/10.1002/net.20129},
doi = {10.1002/NET.20129},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/networks/BruglieriMT06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/networks/BurkardGH06,
author = {Rainer E. Burkard and
Elisabeth Gassner and
Johannes Hatzl},
title = {A linear time algorithm for the reverse 1-median problem on a cycle},
journal = {Networks},
volume = {48},
number = {1},
pages = {16--23},
year = {2006},
url = {https://doi.org/10.1002/net.20115},
doi = {10.1002/NET.20115},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/networks/BurkardGH06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/networks/ChavezDKOSU06,
author = {Edgar Ch{\'{a}}vez and
Stefan Dobrev and
Evangelos Kranakis and
Jaroslav Opatrny and
Ladislav Stacho and
Jorge Urrutia},
title = {Route discovery with constant memory in oriented planar geometric
networks},
journal = {Networks},
volume = {48},
number = {1},
pages = {7--15},
year = {2006},
url = {https://doi.org/10.1002/net.20114},
doi = {10.1002/NET.20114},
timestamp = {Fri, 30 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/networks/ChavezDKOSU06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/networks/DalyA06,
author = {Matthew S. Daly and
Christos Alexopoulos},
title = {State-space partition techniques for multiterminal flows in stochastic
networks},
journal = {Networks},
volume = {48},
number = {2},
pages = {90--111},
year = {2006},
url = {https://doi.org/10.1002/net.20123},
doi = {10.1002/NET.20123},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/networks/DalyA06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/networks/DinitzLS06,
author = {Jeffrey H. Dinitz and
Alan C. H. Ling and
Douglas R. Stinson},
title = {Fault-tolerant routings with minimum optical index},
journal = {Networks},
volume = {48},
number = {1},
pages = {47--55},
year = {2006},
url = {https://doi.org/10.1002/net.20119},
doi = {10.1002/NET.20119},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/networks/DinitzLS06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/networks/FraigniaudGKP06,
author = {Pierre Fraigniaud and
Leszek Gasieniec and
Dariusz R. Kowalski and
Andrzej Pelc},
title = {Collective tree exploration},
journal = {Networks},
volume = {48},
number = {3},
pages = {166--177},
year = {2006},
url = {https://doi.org/10.1002/net.20127},
doi = {10.1002/NET.20127},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/networks/FraigniaudGKP06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/networks/GoldenS06,
author = {Bruce L. Golden and
Douglas R. Shier},
title = {Editorial: 2005 Glover-Klingman prize winners},
journal = {Networks},
volume = {48},
number = {3},
pages = {113},
year = {2006},
url = {https://doi.org/10.1002/net.20132},
doi = {10.1002/NET.20132},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/networks/GoldenS06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/networks/GouveiaP06,
author = {Luis Eduardo Neves Gouveia and
Pierre Pesneau},
title = {On extended formulations for the precedence constrained asymmetric
traveling salesman problem},
journal = {Networks},
volume = {48},
number = {2},
pages = {77--89},
year = {2006},
url = {https://doi.org/10.1002/net.20122},
doi = {10.1002/NET.20122},
timestamp = {Mon, 21 Sep 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/networks/GouveiaP06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/networks/KlunderP06,
author = {G. A. Klunder and
H. N. Post},
title = {The shortest path problem on large-scale real-road networks},
journal = {Networks},
volume = {48},
number = {4},
pages = {182--194},
year = {2006},
url = {https://doi.org/10.1002/net.20131},
doi = {10.1002/NET.20131},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/networks/KlunderP06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/networks/LeemisDDMC06,
author = {Lawrence M. Leemis and
Matthew J. Duggan and
John H. Drew and
Jeffrey A. Mallozzi and
Kerry W. Connell},
title = {Algorithms to calculate the distribution of the longest path length
of a stochastic activity network with continuous activity durations},
journal = {Networks},
volume = {48},
number = {3},
pages = {143--165},
year = {2006},
url = {https://doi.org/10.1002/net.20125},
doi = {10.1002/NET.20125},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/networks/LeemisDDMC06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/networks/LinHHH06,
author = {Cheng{-}Kuan Lin and
Hua{-}Min Huang and
D. Frank Hsu and
Lih{-}Hsing Hsu},
title = {On the spanning \emph{w}-wide diameter of the star graph},
journal = {Networks},
volume = {48},
number = {4},
pages = {235--249},
year = {2006},
url = {https://doi.org/10.1002/net.20135},
doi = {10.1002/NET.20135},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/networks/LinHHH06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/networks/MartensS06,
author = {Maren Martens and
Martin Skutella},
title = {Flows on few paths: Algorithms and lower bounds},
journal = {Networks},
volume = {48},
number = {2},
pages = {68--76},
year = {2006},
url = {https://doi.org/10.1002/net.20121},
doi = {10.1002/NET.20121},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/networks/MartensS06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/networks/Reese06,
author = {J. Reese},
title = {Solution methods for the \emph{p}-median problem: An annotated bibliography},
journal = {Networks},
volume = {48},
number = {3},
pages = {125--142},
year = {2006},
url = {https://doi.org/10.1002/net.20128},
doi = {10.1002/NET.20128},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/networks/Reese06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/networks/RomeijnSS06,
author = {H. Edwin Romeijn and
Dushyant Sharma and
Robert L. Smith},
title = {Extreme point characterizations for infinite network flow problems},
journal = {Networks},
volume = {48},
number = {4},
pages = {209--222},
year = {2006},
url = {https://doi.org/10.1002/net.20134},
doi = {10.1002/NET.20134},
timestamp = {Wed, 22 Nov 2017 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/networks/RomeijnSS06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/networks/SchulzM06,
author = {Andreas S. Schulz and
Nicol{\'{a}}s E. Stier Moses},
title = {Efficiency and fairness of system-optimal routing with user constraints},
journal = {Networks},
volume = {48},
number = {4},
pages = {223--234},
year = {2006},
url = {https://doi.org/10.1002/net.20133},
doi = {10.1002/NET.20133},
timestamp = {Mon, 26 Jun 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/networks/SchulzM06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/networks/ShaoCL06,
author = {Jun Shao and
Zhenfu Cao and
Rongxing Lu},
title = {An improved deniable authentication protocol},
journal = {Networks},
volume = {48},
number = {4},
pages = {179--181},
year = {2006},
url = {https://doi.org/10.1002/net.20130},
doi = {10.1002/NET.20130},
timestamp = {Tue, 02 May 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/networks/ShaoCL06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/networks/SheraliJH06,
author = {Hanif D. Sherali and
Chawalit Jeenanunta and
Antoine G. Hobeika},
title = {The approach-dependent, time-dependent, label-constrained shortest
path problem},
journal = {Networks},
volume = {48},
number = {2},
pages = {57--67},
year = {2006},
url = {https://doi.org/10.1002/net.20120},
doi = {10.1002/NET.20120},
timestamp = {Mon, 15 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/networks/SheraliJH06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/networks/ThomasW06,
author = {Doreen A. Thomas and
Jia F. Weng},
title = {Minimum cost flow-dependent communication networks},
journal = {Networks},
volume = {48},
number = {1},
pages = {39--46},
year = {2006},
url = {https://doi.org/10.1002/net.20118},
doi = {10.1002/NET.20118},
timestamp = {Sun, 02 Jun 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/networks/ThomasW06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/networks/WangLX06,
author = {Fan Wang and
Andrew Lim and
Zhou Xu},
title = {The one-commodity pickup and delivery travelling salesman problem
on a path or a tree},
journal = {Networks},
volume = {48},
number = {1},
pages = {24--35},
year = {2006},
url = {https://doi.org/10.1002/net.20116},
doi = {10.1002/NET.20116},
timestamp = {Mon, 26 Oct 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/networks/WangLX06.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 15:45 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:
