![](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 22 matches
- 2008
- Nicola Apollonio, Isabella Lari
, Federica Ricca
, Bruno Simeone, Justo Puerto
:
Polynomial algorithms for partitioning a tree into single-center subtrees to minimize flat service costs. Networks 51(1): 78-89 (2008) - Alok Baveja
:
The fractional congestion bound for efficient edge disjoint routing. Networks 51(3): 190-199 (2008) - Cédric Bentz, Marie-Christine Costa, Dominique de Werra, Christophe Picouleau, Bernard Ries
:
On a graph coloring problem arising from discrete tomography. Networks 51(4): 256-267 (2008) - Agustín Bompadre, James B. Orlin
:
A simple method for improving the primal simplex method for the multicommodity flow problem. Networks 51(1): 63-77 (2008) - Aurel Cami, Narsingh Deo:
Techniques for analyzing dynamic random graph models of web-like networks: An overview. Networks 51(4): 211-255 (2008) - Christophe Duhamel
, Luis Eduardo Neves Gouveia
, Pedro Moura
, Maurício C. de Souza
:
Models and heuristics for a minimum arborescence problem. Networks 51(1): 34-47 (2008) - Giorgio Gallo
, Maria Grazia Scutellà:
Foreword. Networks 51(1): 1-3 (2008) - Michel Gendreau, Manuel Iori
, Gilbert Laporte, Silvano Martello:
A Tabu search heuristic for the vehicle routing problem with two-dimensional loading constraints. Networks 51(1): 4-18 (2008) - Michel Gendreau, Manuel Iori
, Gilbert Laporte, Silvano Martello:
Erratum: A Tabu search heuristic for the vehicle routing problem with two-dimensional loading constraints. Networks 51(2): 153 (2008) - Bruce L. Golden, Douglas R. Shier:
Editorial: 2006 Glover-Klingman Prize winners. Networks 51(2): 91 (2008) - Jan van den Heuvel
, Matthew Johnson
:
Transversals of subtree hypergraphs and the source location problem in digraphs. Networks 51(2): 113-119 (2008) - Illya V. Hicks
:
New facets for the planar subgraph polytope. Networks 51(2): 120-132 (2008) - Sun-Yuan Hsieh:
Some edge-fault-tolerant properties of the folded hypercube. Networks 51(2): 92-101 (2008) - Krishna C. Jha, Ravindra K. Ahuja, Güvenç Sahin
:
New approaches for solving the block-to-train assignment problem. Networks 51(1): 48-62 (2008) - Martine Labbé
, Hande Yaman
:
Solving the hub location problem in a star-star network. Networks 51(1): 19-33 (2008) - Cheng-Nan Lai, Gen-Huey Chen:
w-Rabin numbers and strong w-Rabin numbers of folded hypercubes. Networks 51(3): 171-177 (2008) - Asaf Levin
, Daniël Paulusma
, Gerhard J. Woeginger:
The computational complexity of graph contractions I: Polynomially solvable and NP-complete cases. Networks 51(3): 178-189 (2008) - Hayri Önal, Yicheng Wang:
A graph theory approach for designing conservation reserve networks with minimal fragmentation. Networks 51(2): 142-152 (2008) - Giovanni Righini
, Matteo Salani:
New dynamic programming algorithms for the resource constrained elementary shortest path problem. Networks 51(3): 155-170 (2008) - Maria Grazia Scutellà:
The maximum congested cut problem and its robust counterpart: Exact and approximation algorithms for the single and the multicommodity case. Networks 51(2): 102-112 (2008) - Maurício C. de Souza
, Philippe Mahey, Bernard Gendron:
Cycle-based algorithms for multicommodity network flow problems with separable piecewise convex costs. Networks 51(2): 133-141 (2008) - Shiying Wang, Shangwei Lin:
Sufficient conditions for a graph to be super restricted edge-connected. Networks 51(3): 200-209 (2008)
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-23 10:16 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