![](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 23 matches
- 2001
- Thomas Andreae:
On the traveling salesman problem restricted to inputs satisfying a relaxed triangle inequality. Networks 38(2): 59-67 (2001) - Yash P. Aneja, R. Chandrasekaran, Kunhiraman Nair:
Maximizing residual flow under an arc destruction. Networks 38(4): 194-198 (2001) - Amir Averbuch, Iris Gaber, Yehuda Roditty:
Low-cost minimum-time line-broadcasting schemes in complete binary trees. Networks 38(4): 189-193 (2001) - Ulrich Brenner, Jens Vygen:
Worst-case ratios of networks in the rectilinear plane. Networks 38(3): 126-139 (2001) - Rainer E. Burkard, Helidon Dollani:
Robust location problems with pos/neg weights on a tree. Networks 38(2): 102-113 (2001) - S. A. Canuto, Mauricio G. C. Resende, Celso C. Ribeiro
:
Local search with perturbations for the prize-collecting Steiner tree problem in graphs. Networks 38(1): 50-58 (2001) - Massimiliano Caramia
, Paolo Dell'Olmo:
Solving the minimum-weighted coloring problem. Networks 38(2): 88-101 (2001) - Gary Chartrand, Karen S. Novotny, Steven J. Winters:
The ultracenter and central fringe of a graph. Networks 38(1): 33-38 (2001) - Gianluca Dini
:
Electronic voting in a large-scale distributed system. Networks 38(1): 22-32 (2001) - Shimon Even:
Area efficient layouts of the Batcher sorting networks. Networks 38(4): 199-208 (2001) - Lisa Fleischer:
Universally maximum flow with piecewise-constant capacities. Networks 38(3): 115-125 (2001) - Pierre Fraigniaud, Joseph G. Peters:
Minimum linear gossip graphs and maximal linear (Delta, k)-gossip graphs. Networks 38(3): 150-162 (2001) - Luisa Gargano
, Andrzej Pelc, Stephane Perennes, Ugo Vaccaro:
Efficient communication in unknown networks. Networks 38(1): 39-49 (2001) - Hovhannes A. Harutyunyan, Arthur L. Liestman:
k-Broadcasting in trees. Networks 38(3): 163-168 (2001) - Frank K. Hwang, Chih-Hung Yen:
Characterizing the bit permutation networks obtained from the line digraphs of bit permutation networks. Networks 38(1): 1-5 (2001) - Ananth V. Iyer, Jianming Ye:
A network based model of a promotion-sensitive grocery logistics system. Networks 38(4): 169-18 (2001) - Shiwoo Lee, José A. Ventura:
An algorithm for constructing minimal c-broadcast networks. Networks 38(1): 6-21 (2001) - Richard D. McBride, John W. Mamer:
Solving the undirected multicommodity flow problem using a shortest path-based pricing algorithm. Networks 38(4): 181-188 (2001) - Fred R. McMorris, Fred S. Roberts
, Chi Wang:
The center function on trees. Networks 38(2): 84-87 (2001) - Maarten Oosten, Jeroen H. G. C. Rutten, Frits C. R. Spieksma:
The clique partitioning problem: Facets and patching facets. Networks 38(4): 209-226 (2001) - J. Hyam Rubinstein
, Doreen A. Thomas
, Nicholas C. Wormald:
A polynomial algorithm for a constrained traveling salesman problem. Networks 38(2): 68-75 (2001) - Jeong-dong Ryoo, Shivendra S. Panwar:
File distribution in networks with multimedia storage servers. Networks 38(3): 140-149 (2001) - Martin Zachariasen
:
A catalog of Hanan grid problems. Networks 38(2): 76-83 (2001)
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-11 09:02 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