Остановите войну!
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 25 matches
- 2002
- Charu C. Aggarwal, James B. Orlin:
On multiroute maximum flows in networks. Networks 39(1): 43-52 (2002) - Camino Balbuena, Josep Fàbrega, Xavier Marcote, Ignacio M. Pelayo:
Superconnected digraphs and graphs with small conditional diameters. Networks 39(3): 153-160 (2002) - Sergei Bespamyatnikh, Binay K. Bhattacharya, J. Mark Keil, David G. Kirkpatrick, Michael Segal:
Efficient algorithms for centers and medians in interval and circular-arc graphs. Networks 39(3): 144-152 (2002) - Marcus Brazil, Doreen A. Thomas, Jia F. Weng:
Forbidden subpaths for Steiner minimum networks in uniform orientation metrics. Networks 39(4): 186-202 (2002) - Andrés Cano, Serafín Moral, Antonio Salmerón:
Lazy evaluation in penniless propagation over join trees. Networks 39(4): 175-185 (2002) - Gary Chartrand, Frank Harary, Ping Zhang:
On the geodetic number of a graph. Networks 39(1): 1-6 (2002) - Anders Dessmark, Andrzej Pelc:
Deterministic radio broadcasting at low cost. Networks 39(2): 88-97 (2002) - Nina K. Detlefsen, Stein W. Wallace:
The simplex algorithm for multicommodity networks. Networks 39(1): 15-28 (2002) - Michael J. Dinneen, Geoffrey Pritchard, Mark C. Wilson:
Degree- and time-constrained broadcast networks. Networks 39(3): 121-129 (2002) - Corinne Feremans, Martine Labbé, Gilbert Laporte:
A comparative analysis of several formulations for the generalized minimum spanning tree problem. Networks 39(1): 29-34 (2002) - Daniela Ferrero, Carles Padró:
Partial line directed hypergraphs. Networks 39(2): 61-67 (2002) - Matteo Fischetti, Giuseppe Lancia, Paolo Serafini:
Exact algorithms for minimum routing cost trees. Networks 39(3): 161-173 (2002) - Pierre Fraigniaud, Jean-Claude König, Emmanuel Lazard:
Oriented hypercubes. Networks 39(2): 98-106 (2002) - Richard L. Francis, Timothy J. Lowe, Arie Tamir:
Worst-case incremental analysis for a class of p-facility location problems. Networks 39(3): 139-143 (2002) - Christian Fremuth-Paeger, Dieter Jungnickel:
Balanced network flows. VII. Primal-dual algorithms. Networks 39(1): 35-42 (2002) - Mohammad Ghodsi, Mohammad Taghi Hajiaghayi, Mohammad Mahdian, Vahab S. Mirrokni:
Length-constrained path-matchings in graphs. Networks 39(4): 210-215 (2002) - Yoshiyuki Karuno, Hiroshi Nagamochi, Toshihide Ibaraki:
Better approximation ratios for the single-vehicle scheduling problems on line-shaped networks. Networks 39(4): 203-209 (2002) - Glenn K. Manacher, Terrance A. Mankus:
A simple linear time algorithm for finding a maximum independent set of circular arcs using intervals alone. Networks 39(2): 68-72 (2002) - Paul L. Mariz, Shahriar Shahriari:
Edge-cutsets in the directed hypercube. Networks 39(2): 73-76 (2002) - Paul McAree, Lawrence Bodin, Michael O. Ball:
Models for the design and analysis of a large package sort facility. Networks 39(2): 107-120 (2002) - Mikael Prytz, Anders Forsgren:
Dimensioning multicast-enabled communications networks. Networks 39(4): 216-231 (2002) - V. Venkata Rao, R. Sridharan:
Minimum-weight rooted not-necessarily-spanning arborescence problem. Networks 39(2): 77-87 (2002) - Maiko Shigeno:
Minimax inverse problems of minimum cuts. Networks 39(1): 7-14 (2002) - Justin C. Williams:
A linear-size zero - one programming model for the minimum spanning tree problem in planar graphs. Networks 39(1): 53-60 (2002) - Bang Ye Wu, Kun-Mao Chao, Chuan Yi Tang:
Light graphs with small routing cost. Networks 39(3): 130-138 (2002)
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-05-25 14:13 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