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
- Lou Caccetta, Stephen P. Hill:
A branch and cut method for the degree-constrained minimum spanning tree problem. Networks 37(2): 74-83 (2001) - Charles J. Colbourn, Peng-Jun Wan:
Minimizing drop cost for SONET/WDM networks with wavelength requirements. Networks 37(2): 107-116 (2001) - Michele Flammini, Giorgio Gambosi, Umberto Nanni, Richard B. Tan:
Characterization results of all shortest paths interval routing schemes. Networks 37(4): 225-232 (2001) - Christian Fremuth-Paeger, Dieter Jungnickel:
Balanced network flows. IV. Duality and structure theory. Networks 37(4): 194-201 (2001) - Christian Fremuth-Paeger, Dieter Jungnickel:
Balanced network flows. V. Cycle-canceling algorithms. Networks 37(4): 202-209 (2001) - Christian Fremuth-Paeger, Dieter Jungnickel:
Balanced network flows. VI. Polyhedral descriptions. Networks 37(4): 210-218 (2001) - Ivan T. Frisch:
The early days of Networks. Networks 37(1): 1-7 (2001) - Gianpaolo Ghiani, Gennaro Improta, Gilbert Laporte:
The capacitated arc routing problem with intermediate facilities. Networks 37(3): 134-143 (2001) - Ashish Goel:
Stability of networks and protocols in the adversarial queueing model for packet routing. Networks 37(4): 219-224 (2001) - Hovhannes A. Harutyunyan, Arthur L. Liestman:
Improved upper and lower bounds for k-broadcasting. Networks 37(2): 94-101 (2001) - Christopher S. Helvig, Gabriel Robins, Alexander Zelikovsky:
An improved approximation scheme for the Group Steiner Problem. Networks 37(1): 8-20 (2001) - Dorit S. Hochbaum:
A new - old algorithm for minimum-cut and maximum-flow in closure graphs. Networks 37(4): 171-193 (2001) - Chun-Nan Hung, Lih-Hsing Hsu, Ting-Yi Sung:
On the construction of combined k-fault-tolerant Hamiltonian graphs. Networks 37(3): 165-170 (2001) - Shien-Ching Hwang, Gen-Huey Chen:
Minimum spanners of butterfly graphs. Networks 37(3): 156-164 (2001) - Toshimasa Ishii, Hiroshi Nagamochi, Toshihide Ibaraki:
Multigraph augmentation under biconnectivity and general edge-connectivity requirements. Networks 37(3): 144-155 (2001) - Ray-Shang Lo, Gen-Huey Chen:
Embedding longest fault-free paths in arrangement graphs with faulty vertices. Networks 37(2): 84-93 (2001) - Zbigniew Lonc, Krzysztof Parol, Jacek Wojciechowski:
On the number of spanning trees in directed circulant graphs. Networks 37(3): 129-133 (2001) - Elise Miller-Hooks:
Adaptive least-expected time paths in stochastic, time-varying transportation and data networks. Networks 37(1): 35-52 (2001) - Falk Nicolai, Thomas Szymczak:
Homogeneous sets and domination: A linear time algorithm for distance - hereditary graphs. Networks 37(3): 117-128 (2001) - Fred S. Roberts, Li Sheng:
How hard is it to determine if a graph has a 2-role assignment? Networks 37(2): 67-73 (2001) - Andreas Schirmer, Andreas Drexl:
Allocation of partially renewable resources: Concept, capabilities, and applications. Networks 37(1): 21-34 (2001) - Yang Xiang:
Cooperative triangulation in MSBNs without revealing subnet structures. Networks 37(1): 53-65 (2001) - Shenggui Zhang, Ziguo Wang:
Scattering number in graphs. Networks 37(2): 102-106 (2001)
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-10-06 10:44 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