![](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 42 matches
- 1992
- Umit Akinc, Kizhanatham Srikanth:
Optimal routing and process scheduling for a mobile service facility. Networks 22(2): 163-183 (1992) - Shoshana Anily, Refael Hassin:
The swapping problem. Networks 22(4): 419-433 (1992) - Anindo Bagchi, Edward F. Schmeichel, S. Louis Hakimi:
Sequential information dissemination by packets. Networks 22(4): 317-333 (1992) - Ron Ben-Natan, Amnon Barak:
Parallel contractions of grids for task assignment to processor networks. Networks 22(6): 539-562 (1992) - Enrique Benavent, Vicente Campos, Angel Corberán
, Enrique Mota:
The Capacitated Arc Routing Problem: Lower bounds. Networks 22(7): 669-690 (1992) - E. Andrew Boyd:
A pseudopolynomial network flow formulation for exact knapsack separation. Networks 22(5): 503-514 (1992) - Chung-Kuan Cheng:
The optimal partitioning of networks. Networks 22(3): 297-315 (1992) - Hyeong-Ah Choi, Abdol-Hossein Esfahanian:
A message-routing strategy for multicomputer systems. Networks 22(7): 627-646 (1992) - Edward G. Coffman Jr., Edgar N. Gilbert:
Paths through a maze of rectangles. Networks 22(4): 349-367 (1992) - László Csaba, Ralph J. Faudree, András Gyárfás, Jenö Lehel, Richard H. Schelp:
Networks communicating for each pairing of terminals. Networks 22(7): 615-626 (1992) - Horst A. Eiselt, Michel Gendreau, Gilbert Laporte:
Location of facilities on a network subject to a single-edge failure. Networks 22(3): 231-246 (1992) - Ehab S. Elmallah:
Algorithms for K-terminal reliability problems with node failures. Networks 22(4): 369-384 (1992) - Ehab S. Elmallah, Charles J. Colbourn:
Series-parallel subgraphs of planar graphs. Networks 22(6): 607-614 (1992) - Erhan Erkut, Richard L. Francis, Arie Tamir:
Distance-constrained multifacility minimax location problems on tree networks. Networks 22(1): 37-54 (1992) - Tuvi Etzion, Israel Bar-David:
An explicit construction of Euler circuits in shuffle nets and related networks. Networks 22(6): 523-529 (1992) - Komei Fukuda, Tomomi Matsui
:
Finding all minimum-cost perfect matchings in Bipartite graphs. Networks 22(5): 461-468 (1992) - Luisa Gargano
:
Tighter time bounds on fault-tolerant broadcasting and gossiping. Networks 22(5): 469-486 (1992) - Peter Hamburger, Raymond E. Pippert, William Douglas Weakley:
On a leverage problem in the hypercube. Networks 22(5): 435-439 (1992) - Xiao-Dong Hu, Frank Kwang-Ming Hwang:
Reliabilities of chordal rings. Networks 22(5): 487-501 (1992) - Frank K. Hwang, Dana S. Richards:
Steiner tree problems. Networks 22(1): 55-89 (1992) - Patrick Jaillet:
Shortest path problems with node failures. Networks 22(6): 589-605 (1992) - James P. Kelly, Bruce L. Golden, Arjang A. Assad:
Cell suppression: Disclosure protection for sensitive tabular data. Networks 22(4): 397-417 (1992) - Chung-Lun Li
, S. Thomas McCormick, David Simchi-Levi:
Finding disjoint paths with different path-costs: Complexity and algorithms. Networks 22(7): 653-667 (1992) - Zevi Miller, Manley Perkel:
The steiner problem in the hypercube. Networks 22(1): 1-19 (1992) - Wendy J. Myrvold
:
Counting k-component forests of a graph. Networks 22(7): 647-652 (1992) - Anna Nagurney, Merritt Hughes:
Financial flow of funds networks. Networks 22(2): 145-161 (1992) - Andrzej Pelc:
Reliable communication in networks with Byzantine link failures. Networks 22(5): 441-459 (1992) - George G. Polak:
On a parametric shortest path problem from primal - dual multicommodity network optimization. Networks 22(3): 283-295 (1992) - Erich Prisner
:
Two algorithms for the subset interconnection design problem. Networks 22(4): 385-395 (1992) - Ramon Rabinovitch, Arie Tamir:
On a tree-shaped facility location problem of Minieka. Networks 22(6): 515-522 (1992)
skipping 12 more matches
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-03 07:14 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