Остановите войну!
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 26 matches
- 2013
- Bernardo M. Ábrego, Ruy Fabila Monroy, Silvia Fernández-Merchant, David Flores-Peñaloza, Ferran Hurtado, Henk Meijer, Vera Sacristán, Maria Saumell:
Proximity graphs inside large weighted graphs. Networks 61(1): 29-39 (2013) - Mustaq Ahmed, Anna Lubiw:
Shortest paths avoiding forbidden subpaths. Networks 61(4): 322-334 (2013) - Matthew Andrews, Antonio Fernández Anta, Lisa Zhang, Wenbo Zhao:
Routing and scheduling for energy and delay minimization in the powerdown model. Networks 61(3): 226-237 (2013) - Camino Balbuena, Pedro García-Vázquez, Adriana Hansberg, Luis Pedro Montejano:
On the super-restricted arc-connectivity of s -geodetic digraphs. Networks 61(1): 20-28 (2013) - Walid Ben-Ameur, Makhlouf Hadji, Adam Ouorou:
Minimum-weight subgraphs with unicyclic components and a lower-bounded girth. Networks 61(4): 335-355 (2013) - Francesco Carrabs, Raffaele Cerulli, Maria Grazia Speranza:
A branch-and-bound algorithm for the double travelling salesman problem with two stacks. Networks 61(1): 58-75 (2013) - Paula Carroll, Bernard Fortz, Martine Labbé, Seán McGarraghy:
A branch-and-cut algorithm for the ring spur assignment problem. Networks 61(2): 89-103 (2013) - Eddie Cheng, László Lipták, Allen Yuan:
Linearly many faults in arrangement graphs. Networks 61(4): 281-289 (2013) - Sofie Coene, Carlo Filippi, Frits C. R. Spieksma, Elisa Stevanato:
Balancing profits and costs on trees. Networks 61(3): 200-211 (2013) - Günes Erdogan, Gilbert Laporte:
The orienteering problem with variable profits. Networks 61(2): 104-116 (2013) - Mette Gamst, David Pisinger:
Integrated job scheduling and network routing. Networks 61(3): 248-262 (2013) - Bruce L. Golden, Douglas R. Shier:
Editorial: 2011 Glover-Klingman Prize Winners. Networks 61(3): 199 (2013) - Luis Eduardo Neves Gouveia, Jorge Riera-Ledesma, Juan José Salazar González:
Reverse multistar inequalities and vehicle routing problems with a lower bound on the number of customers per route. Networks 61(4): 309-321 (2013) - Luis Eduardo Neves Gouveia, Stefan Voß:
Editorial. Networks 61(2): 87-88 (2013) - Katherine C. Hastings, Douglas R. Shier:
Algebraic methods applied to shortest path and maximum flow problems in stochastic networks. Networks 61(2): 117-127 (2013) - Dorit S. Hochbaum, James B. Orlin:
Simplifications and speedups of the pseudoflow algorithm. Networks 61(1): 40-57 (2013) - Ville Junnila, Tero Laihonen, Aline Parreau:
Tolerant identification with Euclidean balls. Networks 61(3): 212-225 (2013) - Arie M. C. A. Koster, Manuel Kutschka, Christian Raack:
Robust network design: Formulations, valid inequalities, and computations. Networks 61(2): 128-149 (2013) - Markus Leitner, Mario Ruthmair, Günther R. Raidl:
Stabilizing branch-and-price for constrained tree problems. Networks 61(2): 150-170 (2013) - Maria Cruz López de los Mozos Martin, Justo Puerto, Antonio M. Rodríguez-Chía:
Robust mean absolute deviation problems on networks with linear vertex weights. Networks 61(1): 76-85 (2013) - Ali Ridha Mahjoub, Luidi Simonetti, Eduardo Uchoa:
Hop-level flow formulation for the survivable network design with hop constraints problem. Networks 61(2): 171-179 (2013) - Aref Meddeb:
On building multiple spanning trees and VLAN assignment in metro ethernet networks. Networks 61(3): 263-280 (2013) - John Penuel, J. Cole Smith, Siqian Shen:
Integer programming models and algorithms for the graph decontamination problem with mobile agents. Networks 61(1): 1-19 (2013) - Michael Poss, Christian Raack:
Affine recourse for the robust network design problem: Between static and dynamic routing. Networks 61(2): 180-198 (2013) - Anupam Seth, Diego Klabjan, Placid M. Ferreira:
Analyses of advanced iterated tour partitioning heuristics for generalized vehicle routing problems. Networks 61(4): 290-308 (2013) - M. G. Volz, Marcus Brazil, Charl J. Ras, Konrad J. Swanepoel, Doreen A. Thomas:
The Gilbert arborescence problem. Networks 61(3): 238-247 (2013)
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-28 22: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