Остановите войну!
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 34 matches
- 2008
- Steve Alpern:
Hide-and-seek games on a tree to which Eulerian networks are attached. Networks 52(3): 162-166 (2008) - Matthew D. Bailey, Robert L. Smith, Jeffrey M. Alden:
A Reach and Bound algorithm for acyclic dynamic-programming networks. Networks 52(1): 1-7 (2008) - Mourad Baïou, Francisco Barahona:
A linear programming approach to increasing the weight of all minimum spanning trees. Networks 52(4): 227-234 (2008) - Camino Balbuena, Pedro García-Vázquez, Xavier Marcote, Juan Carlos Valenzuela:
Conditional diameter saturated graphs. Networks 52(4): 196-201 (2008) - Jørgen Bang-Jensen, Tibor Jordán:
On persistent directed graphs. Networks 52(4): 271-276 (2008) - Joanna Bauer, Dag Haugland, Di Yuan:
Analysis and computational study of several integer programming formulations for minimum-energy multicasting in wireless ad hoc networks. Networks 52(2): 57-68 (2008) - Halil Bayrak, Matthew D. Bailey:
Shortest path network interdiction with asymmetric information. Networks 52(3): 133-140 (2008) - Walid Ben-Ameur, José Neto:
Spectral bounds for the maximum cut problem. Networks 52(1): 8-13 (2008) - Peter Broström, Kaj Holmberg:
Valid cycles: A source of infeasibility in open shortest path first routing. Networks 52(4): 206-215 (2008) - Ioannis Caragiannis, Christos Kaklamanis, Evi Papaioannou:
Competitive algorithms and lower bounds for online randomized call control in cellular networks. Networks 52(4): 235-251 (2008) - W. Matthew Carlyle, Johannes O. Royset, R. Kevin Wood:
Lagrangian relaxation and enumeration for solving constrained shortest-path problems. Networks 52(4): 256-270 (2008) - Julie Christophe, Sophie Dewez, Jean-Paul Doignon, Gilles Fasbender, Philippe Grégoire, David Huygens, Martine Labbé, Sourour Elloumi, Hadrien Mélot, Hande Yaman:
Linear inequalities among graph invariants: Using GraPHedron to uncover optimal relationships. Networks 52(4): 287-298 (2008) - Charles J. Colbourn, Gaetano Quattrocchi, Violet R. Syrotiuk:
Lower bounds for two-period grooming via linear programming duality. Networks 52(4): 299-306 (2008) - Charles J. Colbourn, Gaetano Quattrocchi, Violet R. Syrotiuk:
Grooming for two-period optical networks. Networks 52(4): 307-324 (2008) - Gennaro Cordasco, Luisa Gargano, Alberto Negro, Vittorio Scarano, Mikael Hammar:
F-Chord: Improved uniform routing on Chord. Networks 52(4): 325-332 (2008) - Arnon Dagan, Shmuel Gal:
Network search games, with arbitrary searcher starting point. Networks 52(3): 156-161 (2008) - Paola Flocchini, Miao Jun Huang, Flaminia L. Luccio:
Decontamination of hypercubes by mobile agents. Networks 52(3): 167-178 (2008) - Bernhard Fuchs:
On the hardness of range assignment problems. Networks 52(4): 183-195 (2008) - Bruce L. Golden, Douglas R. Shier:
Editorial: 2007 Glover-Klingman Prize winners. Networks 52(4): 179 (2008) - Udom Janjarassuk, Jeff T. Linderoth:
Reformulation and sampling to solve a stochastic network interdiction problem. Networks 52(3): 120-132 (2008) - Ralf Klasing, Euripides Markou, Tomasz Radzik, Fabiano Sarracco:
Approximation bounds for Black Hole Search problems. Networks 52(4): 216-226 (2008) - Jyhmin Kuo, Hung-Lin Fu:
On the diameter of the generalized undirected de Bruijn graphs UGB(n, m), n2 < m <= n3. Networks 52(4): 180-182 (2008) - Asaf Levin, Daniël Paulusma, Gerhard J. Woeginger:
The computational complexity of graph contractions II: Two tough polynomially solvable cases. Networks 52(1): 32-56 (2008) - Bey-Chi Lin, Chin-Tau Lea:
Multirate nonblocking multicast Log2(N, m, p) networks. Networks 52(4): 277-286 (2008) - Min Lü, Chao Wu, Guo-Liang Chen, Cheng Lv:
On super connectivity of Cartesian product graphs. Networks 52(2): 78-87 (2008) - Asuman E. Ozdaglar:
Price competition with elastic traffic. Networks 52(3): 141-155 (2008) - Feng Pan, David P. Morton:
Minimizing a stochastic maximum-reliability path. Networks 52(3): 111-119 (2008) - Dieter Rautenbach, Lutz Volkmann:
Cyclic sums, network sharing, and restricted edge cuts in graphs with long cycles. Networks 52(4): 252-255 (2008) - Hadas Shachnai, Lisa Zhang, Tomomi Matsui:
Exact algorithms for the master ring problem. Networks 52(2): 98-107 (2008) - Thomas C. Sharkey, H. Edwin Romeijn:
A simplex algorithm for minimum-cost network-flow problems in infinite networks. Networks 52(1): 14-31 (2008)
skipping 4 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-25 02:03 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