![](https://dblp.uni-trier.de/img/logo.ua.320x120.png)
![](https://dblp.uni-trier.de/img/dropdown.dark.16x16.png)
![](https://dblp.uni-trier.de/img/peace.dark.16x16.png)
Остановите войну!
for scientists:
![search dblp search dblp](https://dblp.uni-trier.de/img/search.dark.16x16.png)
![search dblp](https://dblp.uni-trier.de/img/search.dark.16x16.png)
default search action
Search dblp
Full-text search
- > Home
Please enter a search query
- case-insensitive prefix search: default
e.g., sig matches "SIGIR" as well as "signal" - exact word search: append dollar sign ($) to word
e.g., graph$ matches "graph", but not "graphics" - boolean and: separate words by space
e.g., codd model - boolean or: connect words by pipe symbol (|)
e.g., graph|network
Update May 7, 2017: Please note that we had to disable the phrase search operator (.) and the boolean not operator (-) due to technical problems. For the time being, phrase search queries will yield regular prefix search result, and search terms preceded by a minus will be interpreted as regular (positive) search terms.
Author search results
no matches
Venue search results
no matches
Refine list
refine by author
- no options
- temporarily not available
refine by venue
- no options
- temporarily not available
refine by type
- no options
- temporarily not available
refine by access
- no options
- temporarily not available
refine by year
- no options
- temporarily not available
Publication search results
found 26 matches
- 1997
- Hosam M. F. AboElFotoh:
Algorithms for computing message delay for wireless networks. Networks 29(2): 117-124 (1997) - Esther M. Arkin, Refael Hassin, Limor Klein:
Restricted delivery problems on a network. Networks 29(4): 205-216 (1997) - Takao Asano:
Constructing a bipartite graph of maximum connectivity with prescribed degrees. Networks 29(4): 245-263 (1997) - Amotz Bar-Noy, Shlomo Kipnis:
Multiple message broadcasting in the postal model. Networks 29(1): 1-10 (1997) - X. Cai, Ton Kloks, C. K. Wong:
Time-varying shortest path problems with constraints. Networks 29(3): 141-150 (1997) - Chin-Chen Chang, Wen-Bin Wu:
A secure voting system on a public network. Networks 29(2): 81-87 (1997) - Zhi-Long Chen, Warren B. Powell:
A note on Bertsekas' small-label-first strategy. Networks 29(2): 111-116 (1997) - Dilip Chhajed:
Edge coloring a k-tree into two smaller trees. Networks 29(4): 191-194 (1997) - Collette R. Coullard, L. Leslie Gardner, Donald K. Wagner:
Minimum-weight cycles in 3-separable graphs. Networks 29(3): 151-160 (1997) - Cees Duin, Stefan Voß:
Efficient path and vertex exchange in steiner tree algorithms. Networks 29(2): 89-105 (1997) - Shimon Even, Ami Litman:
Layered cross product - A technique to construct interconnection networks. Networks 29(4): 219-223 (1997) - Matteo Fischetti, Daniele Vigo:
A branch-and-cut algorithm for the resource-constrained minimum-weight arborescence problem. Networks 29(1): 55-67 (1997) - Daniel Gagliardi, Marty Lewinter:
An infinite class of reach-preservable graphs. Networks 29(4): 217-218 (1997) - Toru Hasunuma, Yukio Shibata:
Counting small cycles in generalized de Bruijn digraphs. Networks 29(1): 39-47 (1997) - Konstantinos Kalpakis, Yaacov Yesha:
On the bisection width of the transposition network. Networks 29(1): 69-76 (1997) - De-Ron Liang, Rong-Hong Jan, Satish K. Tripathi:
Reliability analysis of replicated and-or graphs. Networks 29(4): 195-203 (1997) - Yixun Lin:
Minimum bandwidth problem for embedding graphs in cycles. Networks 29(3): 135-140 (1997) - Shin-Yeu Lin, Ch'i-Hsin Lin:
A computationally efficient method for nonlinear multicommodity network flow problems. Networks 29(4): 225-244 (1997) - Ariel Orda, Raphael Rom:
Optimal packet fragmentation and routing in computer networks. Networks 29(1): 11-28 (1997) - Stefano Pallottino, Maria Grazia Scutellà:
Dual algorithms for the shortest path tree problem. Networks 29(2): 125-133 (1997) - Stephen G. Penrice:
Balanced graphs and network flows. Networks 29(2): 77-80 (1997) - Mauricio G. C. Resende, Celso C. Ribeiro:
A GRASP for graph planarization. Networks 29(3): 173-189 (1997) - Ramesh S. Sankaranarayana:
Tracking the P-NP boundary for well-covered graphs. Networks 29(1): 29-37 (1997) - Yazid M. Sharaiha, Michel Gendreau, Gilbert Laporte, Ibrahim H. Osman:
A tabu search algorithm for the Capacitated Shortest Spanning Tree Problem. Networks 29(3): 161-171 (1997) - Akiyoshi Shioura, Maiko Shigeno:
The tree center problems and the relationship with the bottleneck knapsack problems. Networks 29(2): 107-110 (1997) - Savio S. H. Tse, Francis C. M. Lau:
A lower bound for interval routing in general networks. Networks 29(1): 49-53 (1997)
loading more results
failed to load more results, please try again later
![](https://dblp.uni-trier.de/img/cog.dark.24x24.png)
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.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
retrieved on 2024-07-24 01:47 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