Остановите войну!
for scientists:
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 21 matches
- 1979
- V. Balachandran:
Generalized transportation networks with stochastic demands: An operator theoretic approach. Networks 9(2): 169-184 (1979) - Paolo M. Camerini, Luigi Fratta, Francesco Maffioli:
A note on finding optimum branchings. Networks 9(4): 309-312 (1979) - F. R. K. Chung, Frank K. Hwang:
The largest minimal rectilinear steiner trees for a set of n points enclosed in a rectangle with given perimeter. Networks 9(1): 19-36 (1979) - R. Dial, Fred W. Glover, David Karney, Darwin Klingman:
A computational analysis of alternative algorithms and labeling techniques for finding shortest path trees. Networks 9(3): 215-248 (1979) - R. Dionne, Michael Florian:
Exact and approximate algorithms for optimal network design. Networks 9(1): 37-59 (1979) - Asthur M. Farley:
Minimal broadcast networks. Networks 9(4): 313-332 (1979) - G. Gallo, C. Sodini:
Adjacent extreme flows and application to min concave cost flow problems. Networks 9(2): 95-121 (1979) - Bruce L. Golden:
Topics in Combinatorial Optimization. Edited By S. Rinaldi, Springer-Verlag New York, New York, 1975, $15.20, 186 Pages. Networks 9(1): 89-90 (1979) - Bruce L. Golden, Arjang A. Assad:
Optimization Algorithms for Networks and Graphs. By Edward Minieka, Marcel Dekker, Inc. New York, New York, 1978, $19.75, 356 Pages. Networks 9(1): 91-93 (1979) - Jonathan Halpern:
A generalized dynamic flows problem. Networks 9(2): 133-167 (1979) - Frank K. Hwang, Shen Lin:
On the construction of balanced switching networks. Networks 9(4): 283-307 (1979) - T. A. Jenkyns:
The greedy travelling salesman's problem. Networks 9(4): 363-373 (1979) - Mukkai S. Krishnamoorthy, Narsingh Deo:
Complexity of the minimum-dummy-activities problem in a pert network. Networks 9(3): 189-194 (1979) - Charles J. McCallum Jr.:
Linear and combinatorial programming. By Katta G. Murty, John Wiley &Sons, Inc., New York, N.Y. 1976, $21.00, 567 pages. Networks 9(2): 185-186 (1979) - K. Onaga, Wataru Mayeda:
A boolean theory of network flows and metrics and its applications to particle transmission and clustering. Networks 9(3): 249-281 (1979) - R. Russell, W. Igo:
An assignment routing problem. Networks 9(1): 1-17 (1979) - Stephen D. Shapiro:
A stochastic petri net with applications to modelling occupancy times for concurrent task systems. Networks 9(4): 375-379 (1979) - Douglas R. Shier:
On algorithms for finding the k shortest paths in a network. Networks 9(3): 195-214 (1979) - R. L. Smith:
Deferral strategies for a dynamic communications network. Networks 9(1): 61-87 (1979) - Donald F. Stanat, Gyula A. Magó:
Minimizing maximum flows in linear graphs. Networks 9(4): 333-361 (1979) - Maciej M. Syslo:
On cycle bases of a graph. Networks 9(2): 123-132 (1979)
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-07-27 13:43 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