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 31 matches
- 2015
- Mohammed Liakat Ali, Pin-Han Ho, János Tapolcai:
SRLG failure localization using nested m-trails and their application to adaptive probing. Networks 66(4): 347-363 (2015) - Ashwin Arulselvan, Martin Groß, Martin Skutella:
Graph orientation and flows over time. Networks 66(3): 196-209 (2015) - Burak Büke, J. Cole Smith, Sadie Thomas:
On a Random Walk Survivability problem with arc failures and memory. Networks 66(1): 67-86 (2015) - Tobia Calogiuri, Gianpaolo Ghiani, Emanuela Guerriero:
The time-dependent quickest path problem: Properties and bounds. Networks 66(2): 112-117 (2015) - Eduardo Alberto Canale, Héctor Cancela, Franco Robledo, Pablo Romero, Pablo Sartor:
Diameter constrained reliability: Complexity, distinguished topologies and asymptotic behavior. Networks 66(4): 296-305 (2015) - Alberto Caprara:
Timetabling and assignment problems in railway planning and integer multicommodity flow. Networks 66(1): 1-10 (2015) - Jakarin Chawachat, Jittat Fakcharoenphol:
A simpler load-balancing algorithm for range-partitioned data in peer-to-peer systems. Networks 66(3): 235-249 (2015) - Yufei Cheng, Deep Medhi, James P. G. Sterbenz:
Geodiverse routing with path delay and skew requirement under area-based challenges. Networks 66(4): 335-346 (2015) - Bogdan S. Chlebus, Vicent Cholvi, Dariusz R. Kowalski:
Stability of adversarial routing with feedback. Networks 66(2): 88-97 (2015) - Mitre Costa Dourado, Dirk Meierling, Lucia Draque Penso, Dieter Rautenbach, Fábio Protti, Aline Ribeiro de Almeida:
Robust recoverable perfect matchings. Networks 66(3): 210-213 (2015) - Birgit Engels, Rainer Schrader:
Freight car dispatching with generalized flows. Networks 66(1): 33-39 (2015) - Holger Flier, Matús Mihalák, Peter Widmayer, Anna Zych, Yusuke Kobayashi, Anita Schöbel:
Selecting vertex disjoint paths in plane graphs. Networks 66(2): 136-144 (2015) - Yoann Fouquet, Dritan Nace, Michal Pióro, Michael Poss, Mateusz Zotkiewicz:
Generalized elastic flow rerouting scheme. Networks 66(4): 267-281 (2015) - Bernard Gendron, Paul-Virak Khuong, Frédéric Semet:
Multilayer variable neighborhood search for two-level uncapacitated facility location problems with single assignment. Networks 66(3): 214-234 (2015) - Noam Goldberg, Sven Leyffer, Ilya Safro:
Optimal response to epidemics and cyber attacks in networks. Networks 66(2): 145-158 (2015) - Bruce L. Golden, Douglas R. Shier:
Editorial: 2013 Glover-Klingman Prize winners. Networks 66(2): 87 (2015) - Bruce L. Golden, Douglas R. Shier:
Editorial: 2014 Glover-Klingman Prize winners. Networks 66(3): 169 (2015) - Faiz Hamid, Yogesh Kumar Agarwal:
Solving the two-facility network design problem with 3-partition facets. Networks 66(1): 11-32 (2015) - Rein Houthooft, Sahel Sahhaf, Wouter Tavernier, Filip De Turck, Didier Colle, Mario Pickavet:
Optimizing robustness in geometric routing via embedding redundancy and regeneration. Networks 66(4): 320-334 (2015) - Michal Kucharzak, Krzysztof Walkowiak, Pawel Kopec, Damian Bulira, Andrzej Kasprzak:
Integer programming, Constraint programming, and metaheuristic approaches for static optimization of anycast flows in elastic optical networks. Networks 66(4): 253-266 (2015) - Sébastien Lannez, Christian Artigues, Jean Damay, Michel Gendreau:
A railroad maintenance problem solved with a cut and column generation matheuristic. Networks 66(1): 40-56 (2015) - Sara Mattia:
The cut property under demand uncertainty. Networks 66(2): 159-168 (2015) - Gábor Németh, Gábor Rétvári:
Rate-adaptive multipath routing: Distributed, centralized, and hybrid architectures. Networks 66(2): 118-135 (2015) - Dimitri Papadimitriou, Bernard Fortz:
A Rolling Horizon Heuristic for the Multiperiod Network Design and Routing Problem. Networks 66(4): 364-379 (2015) - Artur Alves Pessoa, Luigi Di Puglia Pugliese, Francesca Guerriero, Michael Poss:
Robust constrained shortest path problems under budgeted uncertainty. Networks 66(2): 98-111 (2015) - Jacek Rak, James P. G. Sterbenz:
Preface: Optimization issues in resilient network design and modeling. Networks 66(4): 251-252 (2015) - Arunabha Sen, Anisha Mazumder, Sujogya Banerjee, Arun Das, Chenyang Zhou, Shahrzad Shirazipourazad:
Region-based fault-tolerant distributed file storage system design in networks. Networks 66(4): 380-395 (2015) - Jaime Silva, Teresa Gomes, David Tipper, Lúcia Martins, Velin Kounev:
An effective algorithm for computing all-terminal reliability bounds. Networks 66(4): 282-295 (2015) - Alexander Veremyev, Oleg A. Prokopyev, Eduardo L. Pasiliao:
Critical nodes for distance-based connectivity and related problems in graphs. Networks 66(3): 170-195 (2015) - Thomas L. Werth, Sabine Büttner, Sven Oliver Krumke:
Robust bottleneck routing games. Networks 66(1): 57-66 (2015)
skipping 1 more match
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-09-27 05:15 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