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 37 matches
- 1986
- J. Yael Assous:
First-and second-order bounds on terminal reliability. Networks 16(3): 319-329 (1986) - Baruch Awerbuch, Shilmon Event:
Reliable broadcast protocols in unreliable networks. Networks 16(4): 381-396 (1986) - Amnon Barak, Zvi Drezner, Yuri Gurevich:
On the number of active nodes in a multicomputer system. Networks 16(3): 275-282 (1986) - Oded Berman, David Simchi-Levi:
Minisum location of a traveling salesman. Networks 16(3): 239-254 (1986) - Daniel Blenstock:
An algorithm for reliability analysis of planar graphs. Networks 16(4): 411-422 (1986) - Timothy B. Brecht, Charles J. Colbourn:
Improving reliability bounds in computer networks. Networks 16(4): 369-380 (1986) - Stefan Chanas, Waldemar Kolodziejczyk:
Integer flows in network with fuzzy capacity constraints. Networks 16(1): 17-31 (1986) - Elarbi Choukhmane, John Franco:
An approximation algorithm for the maximum independent set problem in cubic planar graphs. Networks 16(4): 349-356 (1986) - John R. Current:
Discrete computational structures, second edition, By Robert R. Korfhage, Academic Press, Inc., Orlando, FI, 1984, 360 pp. Price $35.00. Networks 16(4): 444-445 (1986) - Carlos F. Daganzo, Gordon F. Newell:
Configuration of physical distribution networks. Networks 16(2): 113-132 (1986) - Ulrich Derigs:
Solving large-scale matching problems efficiently: A new primal matching approach. Networks 16(1): 1-16 (1986) - Ding-Zhu Du, Frank K. Hwang:
On a conjecture of trietsch and handler on the flow-dependent steiner ratio. Networks 16(1): 47-50 (1986) - Trefor Evans, Derek Smith:
Optimally reliable graphs for both edge and vertex failures. Networks 16(2): 199-204 (1986) - Okitsugu Fujiwara:
Decision making, models and algorithms: A first course, by Saul I. Gass, John Wiley & Sons, New York, 1985, 412 pp. Networks 16(4): 439-440 (1986) - Pierre Hansen, Jacques-François Thisse, Richard E. Wendell:
Efficient points on a network. Networks 16(4): 357-368 (1986) - Harry Heffes, Akhil Kumar:
Incorporating dependent node damage in deterministic connectivity analysis and synthesis of networks. Networks 16(1): 51-65 (1986) - Eric Howe, Charles R. Johnson, James Lawrence:
The structure of distances in networks. Networks 16(1): 87-106 (1986) - Alfred Iwainsky, Enrico S. Canuto, Oleg G. Taraszow, Agostino Villa:
Network decomposition for the optimization of connection structures. Networks 16(2): 205-235 (1986) - Rubin Johnson:
Introductory combinatorics, by K. P. Bogart, Pitman, Boston, 1983, 388 pp. Price: $26.95. Networks 16(2): 237 (1986) - Yoji Kajitani, Shuichi Ueno:
The minimum augmentation of a directed tree to a k-edge-connected directed graph. Networks 16(2): 181-197 (1986) - James H. King:
Or on the micro, by David Whitaker, John Wiley and Sons, New York, 1984, 197 pp. Price $19.95. Networks 16(4): 440-441 (1986) - Vidyadhar G. Kulkarni:
Shortest paths in networks with exponentially distributed arc lengths. Networks 16(3): 255-274 (1986) - Gilbert Laporte, Hélène Mercure, Yves Nobert:
An exact algorithm for the asymmetrical capacitated vehicle routing problem. Networks 16(1): 33-46 (1986) - Warren H. Lieberman:
Optimization models for planning and allocation: Text and cases in mathematical programming, by Roy D. Shapiro, John Wiley & Sons, New York, 1984, 650 pp. Price $40.95. Networks 16(4): 443-444 (1986) - Terry A. McKee:
Underlying properties of oriented graphs. Networks 16(2): 175-180 (1986) - Aarni Perko:
Implementation of algorithms for K shortest loopless paths. Networks 16(2): 149-160 (1986) - Helmut Prodinger:
The average height of the d-th highest leaf of a planted plane tree. Networks 16(1): 67-75 (1986) - Karen W. Pullen:
A random network model of message transmission. Networks 16(4): 397-409 (1986) - Victor J. Rayward-Smith, A. Clare:
On finding steiner vertices. Networks 16(3): 283-294 (1986) - Michael B. Richey, R. Gary Parker:
On multiple steiner subgraph problems. Networks 16(4): 423-438 (1986)
skipping 7 more matches
loading more results
failed to load more results, please try again later
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-10-02 23:24 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