Остановите войну!
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 37 matches
- 2021
- Niels A. H. Agatz, Mike Hewitt, Barrett W. Thomas:
"Make no little plans": Impactful research to solve the next generation of transportation problems. Networks 77(2): 269-286 (2021) - Mariia Anapolska, Christina Büsing, Martin Comis, Tabea Krabs:
Minimum color-degree perfect b-matchings. Networks 77(4): 477-494 (2021) - Claudia Archetti, Luca Bertazzi:
Recent challenges in Routing and Inventory Routing: E-commerce and last-mile delivery. Networks 77(2): 255-268 (2021) - Kathleen D. Barnetson, Andrea C. Burgess, Jessica A. Enright, Jared Howell, David A. Pike, Brady Ryan:
The firebreak problem. Networks 77(3): 372-382 (2021) - Richard S. Barr, Fred W. Glover, Toby Huskinson, Gary A. Kochenberger:
An extreme-point tabu-search algorithm for fixed-charge network problems. Networks 77(2): 322-340 (2021) - Jason I. Brown, Charles J. Colbourn, Danielle Cox, Christina Graves, Lucas Mol:
Network reliability: Heading out on the highway. Networks 77(1): 146-160 (2021) - Adrien Cambier, Matthieu Chardy, Rosa Figueiredo, Adam Ouorou, Michael Poss:
Optimizing the investments in mobile networks and subscriber migrations for a telecommunication operator. Networks 77(4): 495-519 (2021) - Ángel Corberán, Richard Eglese, Geir Hasle, Isaac Plana, José María Sanchis:
Arc routing problems: A review of the past, present, and future. Networks 77(1): 88-115 (2021) - Guillaume Ducoffe, Feodor F. Dragan:
A story of diameter, radius, and (almost) Helly property. Networks 77(3): 435-453 (2021) - Bernard Fortz, Luis Gouveia, Christina Büsing, Markus Leitner:
Preface: Special issue on network analytics and optimization. Networks 77(4): 475-476 (2021) - Ilia Fridman, Mikhail Y. Kovalyov, Erwin Pesch, Andrew Ryzhikov:
Fixed interval scheduling with third-party machines. Networks 77(3): 361-371 (2021) - Ivan T. Frisch:
The Early Days of Networks. Networks 77(1): 14-20 (2021) - Bruce L. Golden, Douglas R. Shier:
Twenty-one years in the life of Networks (2000 to 2020). Networks 77(1): 5-13 (2021) - Naga Venkata C. Gudapati, Enrico Malaguti, Michele Monaci:
In search of dense subgraphs: How good is greedy peeling? Networks 77(4): 572-586 (2021) - Mohd. Hafiz Hasan, Pascal Van Hentenryck:
Large-scale zone-based evacuation planning - Part I: Models and algorithms. Networks 77(1): 127-145 (2021) - Mohd. Hafiz Hasan, Pascal Van Hentenryck:
Large-scale zone-based evacuation planning, Part II: Macroscopic and microscopic evaluations. Networks 77(2): 341-358 (2021) - Illya V. Hicks, Boris Brimkov:
Tangle bases: Revisited. Networks 77(1): 161-172 (2021) - Dorit S. Hochbaum:
Applications and efficient algorithms for integer programming problems on monotone constraints. Networks 77(1): 21-49 (2021) - Martin Hoefer, Lisa Wilhelmi:
Packing returning secretaries. Networks 77(3): 454-471 (2021) - Pietro Lenarda, Giorgio Gnecco, Massimo Riccaboni:
Parameter estimation in a 3-parameter p-star random graph model. Networks 77(3): 403-420 (2021) - Ivana Ljubic:
Solving Steiner trees: Recent advances, challenges, and perspectives. Networks 77(2): 177-204 (2021) - Carlos E. Marciano, Gladstone M. Arantes Jr., Abilio Lucena, Luidi Gelabert Simonetti, Luérbio Faria, Felipe M. G. França:
Optimizing concurrency under Scheduling by Edge Reversal. Networks 77(4): 520-537 (2021) - Alexsander Andrade de Melo, Celina M. H. de Figueiredo, Uéverton dos Santos Souza:
On undirected two-commodity integral flow, disjoint paths and strict terminal connection problems. Networks 77(4): 559-571 (2021) - Anna Nagurney:
Networks in economics and finance in Networks and beyond: A half century retrospective. Networks 77(1): 50-65 (2021) - Jérémy Omer, Michael Poss:
A polynomial algorithm for minimizing travel time in consistent time-dependent networks with waits. Networks 77(3): 421-434 (2021) - James B. Orlin, Xiao-Yue Gong:
A fast maximum flow algorithm. Networks 77(2): 287-321 (2021) - Aissa Oudjit, Matthias F. Stallmann:
Efficient algorithms for finding 2-medians of a tree. Networks 77(3): 383-402 (2021) - Stefan Poikonen, James F. Campbell:
Future directions in drone routing research. Networks 77(1): 116-126 (2021) - S. Raghavan, J. Cole Smith:
Preface. Networks 77(1): 3-4 (2021) - S. Raghavan, J. Cole Smith:
Preface. Networks 77(2): 175-176 (2021)
skipping 7 more matches
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-02 17:57 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