Остановите войну!
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 40 matches
- 1981
- Jin Akiyama, Frank Boesch, Hiroshi Era, Frank Harary, Ralph Tindell:
The cohesiveness of a point of a graph. Networks 11(1): 65-68 (1981) - Jin Akiyama, Geoffrey Exoo, Frank Harary:
Covering and packing in graphs IV: Linear arboricity. Networks 11(1): 69-72 (1981) - Edward J. Anderson:
Mazes: Search games on unknown networks. Networks 11(4): 393-397 (1981) - Michael O. Ball, Michael J. Magazine:
The design and analysis of heuristics. Networks 11(2): 215-219 (1981) - Lawrence Bodin, Bruce L. Golden:
Classification in vehicle routing and scheduling. Networks 11(2): 97-108 (1981) - Frank Boesch:
Editorial. Networks 11(2): 93 (1981) - Frank Boesch, Frank Harary, Jerald A. Kabell:
Graphs as models of communication network vulnerability: Connectivity and persistence. Networks 11(1): 57-63 (1981) - Nicos Christofides, Aristide Mingozzi, Paolo Toth:
State-space relaxation procedures for the computation of bounds to routing problems. Networks 11(2): 145-164 (1981) - Charles J. Colbourn:
On testing isomorphism of permutation graphs. Networks 11(1): 13-21 (1981) - Frank H. Cullen, John J. Jarvis, H. Donald Ratliff:
Set partitioning based heuristics for interactive routing. Networks 11(2): 125-143 (1981) - Ulrich Derigs:
A shortest augmenting path method for solving minimal perfect matching problems. Networks 11(4): 379-390 (1981) - Joseph H. Discenza:
A more compact formulation of the symmetric multiple traveling salesman problem with fixed charges. Networks 11(1): 73-75 (1981) - Arthur M. Farley:
Networks immune to isolated failures. Networks 11(3): 255-268 (1981) - Marshall L. Fisher, Ramchandran Jaikumar:
A generalized assignment heuristic for vehicle routing. Networks 11(2): 109-124 (1981) - Michael Florian, Sang Nguyen, Stefano Pallottino:
A dual simplex algorithm for finding all shortest paths. Networks 11(4): 367-378 (1981) - Satoru Fujishige:
A note on the problem of updating shortest paths. Networks 11(3): 317-319 (1981) - Bruce L. Golden, Lawrence D. Bodin:
Preface. Networks 11(2): 95-96 (1981) - Bruce L. Golden, Richard T. Wong:
Capacitated arc routing problems. Networks 11(3): 305-315 (1981) - Refael Hassin:
Generalizations of Hoffman's existence theorem for circulations. Networks 11(3): 243-254 (1981) - Aaron Kershenbaum:
A note on finding shortest path trees. Networks 11(4): 399-400 (1981) - Roger H. Lamprey, Bruce H. Barnes:
A new concept of primeness in graphs. Networks 11(3): 279-284 (1981) - Richard C. Larson, Victor O. K. Li:
Finding minimum rectilinear distance paths in the presence of barriers. Networks 11(3): 285-304 (1981) - Jan Karel Lenstra, A. H. G. Rinnooy Kan:
Complexity of vehicle routing and scheduling problems. Networks 11(2): 221-227 (1981) - Thomas L. Magnanti:
Combinatorial optimization and vehicle fleet planning: Perspectives and prospects. Networks 11(2): 179-213 (1981) - Roy E. Marsten, Fred Shepardson:
Exact solution of crew scheduling problems using the set partitioning model: Recent successful applications. Networks 11(2): 165-177 (1981) - Edward Minieka:
A polynomial time algorithm for finding the absolute center of a network. Networks 11(4): 351-355 (1981) - Clyde L. Monma:
Operations Research Support Methodology, Albert G. Holzman, Ed., Marcel Dekker, New York, 1979, 648 pp. Price $39.75. Networks 11(3): 321-322 (1981) - Franklin H. Moss, Philip M. Merlin:
Some theoretical results in multiple path definition in networks. Networks 11(4): 401-411 (1981) - Yehoshua Perl, Yaacov Yesha:
Mean flow scheduling and optimal construction of a treelike communication network. Networks 11(1): 87-92 (1981) - Ján Plesník:
The complexity of designing a network with minimum diameter. Networks 11(1): 77-85 (1981)
skipping 10 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-07-10 18:38 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