Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDNetworks, Volume 71
Volume 71, Number 1, January 2018
- Hiroki Yanagisawa
, Satoshi Hara:
Discounted average degree density metric and new algorithms for the densest subgraph problem. 3-15 - Alper Atamtürk, Avinash Bhardwaj:
Network design with probabilistic capacities. 16-30 - Dilson Lucas Pereira, Alexandre Salles da Cunha:
Polyhedral results, branch-and-cut and Lagrangian relaxation algorithms for the adjacent only quadratic minimum spanning tree problem. 31-50 - Erika R. Bérczi-Kovács, Zoltán Király:
Optimal and heuristic network coding algorithms for multi-layered video broadcast. 51-59 - Songtao Li, Simin Huang:
Multiple searchers searching for a randomly distributed immobile target on a unit network. 60-80 - Ravindra B. Bapat, Shinya Fujita, Sylvain Legay, Yannis Manoussakis, Yasuko Matsui, Tadashi Sakuma, Zsolt Tuza:
Safe sets, network majority on weighted trees. 81-92
Volume 71, Number 2, March 2018
Editorial
- Bernard Fortz, Dimitri Papadimitriou, Mauricio G. C. Resende:
Preface: Recent advances in telecommunications networks planning and operation. 95-96
- Zaid Allybokus, Nancy Perrot, Jérémie Leguay, Lorenzo Maggi, Eric Gourdin:
Virtual function placement for service chaining with partial orders and anti-affinity rules. 97-106 - Yongkyu Cho, Young Myoung Ko:
Energy efficiency of data center operating practices: Server clustering, powering on/off, and bang-bang control. 107-119 - Jiaxin Liu, Stanko Dimitrov:
Open shortest path first routing under random early detection. 120-135 - Grigory Pastukhov, Alexander Veremyev, Vladimir Boginski, Oleg A. Prokopyev:
On maximum degree-based γ-quasi-clique problem: Complexity and exact approaches. 136-152 - Mateusz Zotkiewicz:
Uncertainty in FTTH splitter installation. 153-165
Volume 71, Number 3, April 2018
- Bruce L. Golden, Douglas R. Shier:
Editorial. 169
- Fred W. Glover, César Rego:
New assignment-based neighborhoods for traveling salesman and routing problems. 170-187 - Leonardo F. S. Moura, Luciano Paschoal Gaspary, Luciana S. Buriol:
A branch-and-price algorithm for the single-path virtual network embedding problem. 188-208 - Dawsen Hwang, Patrick Jaillet:
Online scheduling with multi-state machines. 209-251 - Lorenzo Maggi, Jérémie Leguay, Johanne Cohen, Paolo Medagliani:
Domain clustering for inter-domain path computation speed-up. 252-270 - Mikhail Y. Kovalyov, Erwin Pesch, Andrew Ryzhikov:
A note on scheduling container storage operations of two non-passing stacking cranes. 271-280 - Radislav Vaisman, Dirk P. Kroese:
On the analysis of independent sets via multilevel splitting. 281-301 - Kaarthik Sundar, Carleton Coffrin, Harsha Nagarajan, Russell Bent:
Probabilistic N-k failure-identification for power systems. 302-321
Volume 71, Number 4, June 2018
Preface
- Francesco Carrabs, Raffaele Cerulli, Monica Gentili:
Preface: Theoretical and algorithmic contributions to network optimization problems. 325
- Mourad Baïou, Francisco Barahona:
On the p-median polytope and the odd directed cycle inequalities: Oriented graphs. 326-345 - Gennaro Cordasco, Luisa Gargano, Adele Anna Rescigno, Ugo Vaccaro:
Evangelism in social networks: Algorithms and complexity. 346-357 - Derya Dinler, Mustafa Kemal Tural:
Faster computation of successive bounds on the group betweenness centrality. 358-380 - Sara Mattia:
The capacity formulation of the capacitated edge activation problem. 381-402 - Leonardo S. Rocha, Diana Sasaki:
The Backbone Packet Radio Network coloring for Time Division Multiple Access link scheduling in Wireless Multihop Networks. 403-411 - Colin P. Gillen, Alexander Veremyev, Oleg A. Prokopyev, Eduardo L. Pasiliao:
Critical arcs detection in influence networks. 412-431 - Chrysafis Vogiatzis, Jose L. Walteros:
Integer programming models for detecting graph bipartitions with structural requirements. 432-450 - Luis Gouveia, Pierre Pesneau, Mario Ruthmair, Daniel Santos:
Combining and projecting flow models for the (precedence constrained) asymmetric traveling salesman problem. 451-465
a service of 
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.
last updated on 2024-04-22 20:02 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
