![](https://dblp1.uni-trier.de/img/logo.ua.320x120.png)
![](https://dblp1.uni-trier.de/img/dropdown.dark.16x16.png)
![](https://dblp1.uni-trier.de/img/peace.dark.16x16.png)
Остановите войну!
for scientists:
![search dblp search dblp](https://dblp1.uni-trier.de/img/search.dark.16x16.png)
![search dblp](https://dblp1.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 42 matches
- 1982
- Mokhtar S. Bazaraa, Hanif D. Sherali:
A property regarding degenerate pivots for linear assignment networks. Networks 12(4): 469-474 (1982) - Oded Berman, Amedeo R. Odoni:
Locating mobile servers on a network with markovian properties. Networks 12(1): 73-86 (1982) - Francis T. Boesch, Charles L. Suffel:
Realizability of p-point, q-line graphs with prescribed point connectivity, line connectivity, or minimum degree. Networks 12(3): 341-350 (1982) - Chih-Kang Eric Chen, Robert S. Garfinkel:
The generalized diameter of a graph. Networks 12(3): 335-340 (1982) - M. Cutler, Z. Riesel:
Minimum width 2-layer layout of a multichanneled system. Networks 12(2): 173-189 (1982) - Stella Dafermos:
The general multimodal network equilibrium problem with elastic demand. Networks 12(1): 57-72 (1982) - Ranel E. Erickson:
Generalizations of planar graphs. Networks 12(2): 127-140 (1982) - Geoffrey Exoo:
On a measure of communication network vulnerability. Networks 12(4): 405-409 (1982) - Arthur M. Farley, Andrzej Proskurowski:
Networks immune to isolated line failures. Networks 12(4): 393-403 (1982) - Ove Frank, Wolfgang Gaul:
On reliability in stochastic graphs. Networks 12(2): 119-126 (1982) - Alan M. Frieze
, Giulia Galbiati, Francesco Maffioli:
On the worst-case performance of some algorithms for the asymmetric traveling salesman problem. Networks 12(1): 23-39 (1982) - Bezalel Gavish:
Topological design of centralized computer networks - formulations and algorithms. Networks 12(4): 355-377 (1982) - Jerrold R. Griggs:
Applied combinatorics, by Alan Tucker, Wiley, New York, 1980, 385 pp. Price: $23.95. Networks 12(4): 507-508 (1982) - Udaiprakash I. Gupta, D. T. Lee, Joseph Y.-T. Leung:
Efficient algorithms for interval graphs and circular-arc graphs. Networks 12(4): 459-467 (1982) - Horst W. Hamacher:
Determining minimal cuts with a minimal number of arcs. Networks 12(4): 493-504 (1982) - Frank Harary, Bernt Lindström, Hans-olov Zetterström:
On balance in group graphs. Networks 12(3): 317-321 (1982) - Refael Hassin:
Minimum cost flow with set-constraints. Networks 12(1): 1-21 (1982) - Alon Itai, Yehoshua Perl, Yossi Shiloach:
The complexity of finding maximum disjoint paths with length constraints. Networks 12(3): 277-286 (1982) - John J. Jarvis, Süleyman Tüfekci:
A decomposition algorithm for locating a shortest path between two nodes in a network. Networks 12(2): 161-172 (1982) - Naoki Katoh, Toshihide Ibaraki, Hisashi Mine:
An efficient algorithm for K shortest simple paths. Networks 12(4): 411-427 (1982) - Ronald Kaufman:
Communications network analysis, by Howard Cravis, Lexington Books, Lexington, MA, 1981, 144pp. Price not given. Networks 12(4): 505 (1982) - John G. Klincewicz:
Algorithms for Network Programming, by J. L. Kennington and R. V. Helgason, Wiley, New York, 1980, 291 pp. Price: $25.00. Networks 12(1): 87-88 (1982) - C. L. Kwan, S. Toida:
An optimal 2-FT realization of binary symmetric hierarchical tree systems. Networks 12(3): 231-239 (1982) - Silvano Martello, Paolo Toth:
Finding a minimum equivalent graph of a digraph. Networks 12(2): 89-100 (1982) - Clyde L. Monma:
Network flow programming, by P. A. Jensen and J. W. Barnes, John Wiley and Sons, Inc., New York, 1980, 408 pp. Price: $28.95. Networks 12(3): 351 (1982) - Katta G. Murty, Clovis Perin:
A 1-matching blossom-type algorithm for edge covering problems. Networks 12(4): 379-391 (1982) - Jean-Claude Picard, Maurice Queyranne:
A network flow solution to some nonlinear 0-1 programming problems, with applications to graph theory. Networks 12(2): 141-159 (1982) - Eric Rosenberg:
Optimization: Theory and applications, by S . S . Rao, Wiley Eastern Limited, New Delhi, 1979, 711 pp. Price: $21.95. Networks 12(3): 352-353 (1982) - Doron Rotem, Jorge Urrutia:
Circular permutation graphs. Networks 12(4): 429-437 (1982) - Harrison E. Rowe, Wanda L. Mammel:
Counting formulas for tree growth plans. Networks 12(1): 41-56 (1982)
skipping 12 more matches
loading more results
failed to load more results, please try again later
![](https://dblp1.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-02 12:01 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