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/networks26.bht:"
download as .bib file
@article{DBLP:journals/networks/BermondFP95,
author = {Jean{-}Claude Bermond and
Pierre Fraigniaud and
Joseph G. Peters},
title = {Antepenultimate broadcasting},
journal = {Networks},
volume = {26},
number = {3},
pages = {125--137},
year = {1995},
url = {https://doi.org/10.1002/net.3230260302},
doi = {10.1002/NET.3230260302},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/networks/BermondFP95.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/networks/BroersmaG95,
author = {Haitze J. Broersma and
F. G{\"{o}}bel},
title = {Bipartite regular graphs with fixed diameter},
journal = {Networks},
volume = {26},
number = {3},
pages = {139--144},
year = {1995},
url = {https://doi.org/10.1002/net.3230260303},
doi = {10.1002/NET.3230260303},
timestamp = {Sat, 05 Sep 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/networks/BroersmaG95.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/networks/ChaoGW95,
author = {I{-}Ming Chao and
Bruce L. Golden and
Edward A. Wasil},
title = {An improved heuristic for the period vehicle routing problem},
journal = {Networks},
volume = {26},
number = {1},
pages = {25--44},
year = {1995},
url = {https://doi.org/10.1002/net.3230260104},
doi = {10.1002/NET.3230260104},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/networks/ChaoGW95.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/networks/CoorgR95,
author = {Satyan R. Coorg and
C. Pandu Rangan},
title = {Feedback vertex set on cocomparability graphs},
journal = {Networks},
volume = {26},
number = {2},
pages = {101--111},
year = {1995},
url = {https://doi.org/10.1002/net.3230260205},
doi = {10.1002/NET.3230260205},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/networks/CoorgR95.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/networks/Erwig95,
author = {Martin Erwig},
title = {Encoding shortest paths in spatial networks},
journal = {Networks},
volume = {26},
number = {4},
pages = {291--303},
year = {1995},
url = {https://doi.org/10.1002/net.3230260412},
doi = {10.1002/NET.3230260412},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/networks/Erwig95.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/networks/Esbensen95,
author = {Henrik Esbensen},
title = {Computing near-optimal solutions to the steiner problem in a graph
using a genetic algorithm},
journal = {Networks},
volume = {26},
number = {4},
pages = {173--185},
year = {1995},
url = {https://doi.org/10.1002/net.3230260403},
doi = {10.1002/NET.3230260403},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/networks/Esbensen95.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/networks/FischettiGT95,
author = {Matteo Fischetti and
Juan Jos{\'{e}} Salazar Gonz{\'{a}}lez and
Paolo Toth},
title = {The symmetric generalized traveling salesman polytope},
journal = {Networks},
volume = {26},
number = {2},
pages = {113--123},
year = {1995},
url = {https://doi.org/10.1002/net.3230260206},
doi = {10.1002/NET.3230260206},
timestamp = {Thu, 08 Jun 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/networks/FischettiGT95.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/networks/GavishS95,
author = {Bezalel Gavish and
Suresh Sridhar},
title = {Computing the 2-median on tree networks in O(n lg n) time},
journal = {Networks},
volume = {26},
number = {4},
pages = {305--317},
year = {1995},
url = {https://doi.org/10.1002/net.3230260413},
doi = {10.1002/NET.3230260413},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/networks/GavishS95.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/networks/GrigoriadisK95,
author = {Michael D. Grigoriadis and
Leonid G. Khachiyan},
title = {An exponential-function reduction method for block-angular convex
programs},
journal = {Networks},
volume = {26},
number = {2},
pages = {59--68},
year = {1995},
url = {https://doi.org/10.1002/net.3230260202},
doi = {10.1002/NET.3230260202},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/networks/GrigoriadisK95.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/networks/KwonC95,
author = {Oh{-}Heum Kwon and
Kyung{-}Yong Chwa},
title = {Multiple message broadcasting in communication networks},
journal = {Networks},
volume = {26},
number = {4},
pages = {253--261},
year = {1995},
url = {https://doi.org/10.1002/net.3230260409},
doi = {10.1002/NET.3230260409},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/networks/KwonC95.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/networks/LiTU95,
author = {Wen{-}Jui Li and
H.{-}S. Jacob Tsao and
Osman Ulular},
title = {The shortest path with at most / nodes in each of the series/parallel
clusters},
journal = {Networks},
volume = {26},
number = {4},
pages = {263--271},
year = {1995},
url = {https://doi.org/10.1002/net.3230260410},
doi = {10.1002/NET.3230260410},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/networks/LiTU95.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/networks/Marin95,
author = {{\'{A}}ngel Mar{\'{\i}}n},
title = {Restricted simplicial decomposition with side constraints},
journal = {Networks},
volume = {26},
number = {4},
pages = {199--215},
year = {1995},
url = {https://doi.org/10.1002/net.3230260405},
doi = {10.1002/NET.3230260405},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/networks/Marin95.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/networks/Mosheiov95,
author = {Gur Mosheiov},
title = {The pickup delivery location problem on networks},
journal = {Networks},
volume = {26},
number = {4},
pages = {243--251},
year = {1995},
url = {https://doi.org/10.1002/net.3230260408},
doi = {10.1002/NET.3230260408},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/networks/Mosheiov95.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/networks/MyungLT95,
author = {Young{-}Soo Myung and
Chang{-}ho Lee and
Dong{-}wan Tcha},
title = {On the generalized minimum spanning tree problem},
journal = {Networks},
volume = {26},
number = {4},
pages = {231--241},
year = {1995},
url = {https://doi.org/10.1002/net.3230260407},
doi = {10.1002/NET.3230260407},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/networks/MyungLT95.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/networks/NagurneyTZ95,
author = {Anna Nagurney and
Takashi Takayama and
Ding Zhang},
title = {Projected dynamical systems modeling and computation of spatial network
equilibria},
journal = {Networks},
volume = {26},
number = {2},
pages = {69--85},
year = {1995},
url = {https://doi.org/10.1002/net.3230260203},
doi = {10.1002/NET.3230260203},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/networks/NagurneyTZ95.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/networks/PaikS95,
author = {Doowon Paik and
Sartaj Sahni},
title = {Network upgrading problems},
journal = {Networks},
volume = {26},
number = {1},
pages = {45--58},
year = {1995},
url = {https://doi.org/10.1002/net.3230260105},
doi = {10.1002/NET.3230260105},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/networks/PaikS95.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/networks/PalmerK95,
author = {Charles C. Palmer and
Aaron Kershenbaum},
title = {An approach to a problem in network design using genetic algorithms},
journal = {Networks},
volume = {26},
number = {3},
pages = {151--163},
year = {1995},
url = {https://doi.org/10.1002/net.3230260305},
doi = {10.1002/NET.3230260305},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/networks/PalmerK95.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/networks/PhilpottC95,
author = {Andrew B. Philpott and
Mark Craddock},
title = {An adaptive discretization algorithm for a class of continuous network
programs},
journal = {Networks},
volume = {26},
number = {1},
pages = {1--11},
year = {1995},
url = {https://doi.org/10.1002/net.3230260102},
doi = {10.1002/NET.3230260102},
timestamp = {Wed, 25 Sep 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/networks/PhilpottC95.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/networks/Roccetti95,
author = {Marco Roccetti},
title = {Reliability analysis of tree-based networks and its application to
fault-tolerant {VLSI} systems},
journal = {Networks},
volume = {26},
number = {4},
pages = {217--230},
year = {1995},
url = {https://doi.org/10.1002/net.3230260406},
doi = {10.1002/NET.3230260406},
timestamp = {Sat, 05 Sep 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/networks/Roccetti95.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/networks/SmithWP95,
author = {J. MacGregor Smith and
Richard S. Weiss and
Minoo Patel},
title = {An O(N\({}^{\mbox{2}}\)) heuristic for steiner minimal trees in E\({}^{\mbox{3}}\)},
journal = {Networks},
volume = {26},
number = {4},
pages = {273--289},
year = {1995},
url = {https://doi.org/10.1002/net.3230260411},
doi = {10.1002/NET.3230260411},
timestamp = {Wed, 18 Dec 2019 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/networks/SmithWP95.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/networks/SomaniT95,
author = {Arun K. Somani and
Sanjay Thatte},
title = {The helical cube network},
journal = {Networks},
volume = {26},
number = {2},
pages = {87--100},
year = {1995},
url = {https://doi.org/10.1002/net.3230260204},
doi = {10.1002/NET.3230260204},
timestamp = {Thu, 08 Jun 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/networks/SomaniT95.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/networks/StivarosS95,
author = {Constantine Stivaros and
Klaus Sutner},
title = {The intractability of the reliable assignment problem in split networks},
journal = {Networks},
volume = {26},
number = {4},
pages = {165--172},
year = {1995},
url = {https://doi.org/10.1002/net.3230260402},
doi = {10.1002/NET.3230260402},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/networks/StivarosS95.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/networks/Topkis95,
author = {Donald M. Topkis},
title = {Repeated uncoordinated information dissemination by flooding},
journal = {Networks},
volume = {26},
number = {1},
pages = {13--23},
year = {1995},
url = {https://doi.org/10.1002/net.3230260103},
doi = {10.1002/NET.3230260103},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/networks/Topkis95.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/networks/Winter95,
author = {Pawel Winter},
title = {Reductions for the rectilinear steiner tree problem},
journal = {Networks},
volume = {26},
number = {4},
pages = {187--198},
year = {1995},
url = {https://doi.org/10.1002/net.3230260404},
doi = {10.1002/NET.3230260404},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/networks/Winter95.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/networks/Wong95,
author = {Stephen A. Wong},
title = {Hamilton cycles and paths in butterfly graphs},
journal = {Networks},
volume = {26},
number = {3},
pages = {145--150},
year = {1995},
url = {https://doi.org/10.1002/net.3230260304},
doi = {10.1002/NET.3230260304},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/networks/Wong95.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 06:48 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:
