default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDNetworks, Volume 56
Volume 56, Number 1, August 2010
- Christian Wulff-Nilsen:
Bounding the expected number of rectilinear full Steiner trees. 1-10 - Shiying Wang, Jing Li, Lihong Wu, Shangwei Lin:
Neighborhood conditions for graphs to be super restricted edge connected. 11-19 - Tingting Cui, Dorit S. Hochbaum:
Complexity of some inverse shortest path lengths problems. 20-29 - Zhengbing Bian, Qian-Ping Gu:
Wavelength assignment in multifiber star networks. 30-38 - Vangelis Th. Paschos, Orestis Telelis, Vassilis Zissimopoulos:
Probabilistic models for the Steiner Tree problem. 39-49 - Angel Corberán
, Christian Prins:
Recent results on Arc Routing Problems: An annotated bibliography. 50-69 - John D. Lamb:
Insertion heuristics for central cycle problems. 70-80 - Camino Balbuena, Diego González-Moreno, Xavier Marcote:
On the connectivity of semiregular cages. 81-88
Volume 56, Number 2, September 2010
- Bruce L. Golden, Douglas R. Shier:
Editorial: 2008 Glover-Klingman prize winners. 89 - Kannan Balakrishnan, Bostjan Bresar, Matjaz Kovse, Manoj Changat, Ajitha R. Subhamathi, Sandi Klavzar:
Simultaneous embeddings of graphs as median and antimedian subgraphs. 90-94 - Stéphane Bessy, Clément Lepelletier:
Optical index of fault tolerant routings in WDM networks. 95-102 - Evangelos Kranakis, Michel Paquette, Andrzej Pelc:
The diameter and connectivity of networks with random dependent faults. 103-115 - Jiong Guo, Rolf Niedermeier, Sebastian Wernicke:
Fixed-parameter tractability results for full-degree spanning tree and its dual. 116-130 - Jiong Guo, Johannes Uhlmann:
Kernelization and complexity results for connectivity augmentation problems. 131-142 - Yuqing Lin, Hongliang Lu, Yunjian Wu, Qinglin Yu:
On superconnectivity of (4, g)-cages with even girth. 143-148 - Satoshi Fujita:
Polynomial time algorithm for constructing vertex-disjoint paths in transposition graphs. 149-157
Volume 56, Number 3, October 2010
- Feodor F. Dragan, Chenyu Yan:
Network flow spanners. 159-168 - Ivana Ljubic:
A branch-and-cut-and-price algorithm for vertex-biconnectivity augmentation. 169-182 - Ching-Chi Lin, Gerard J. Chang, Gen-Huey Chen:
The degree-preserving spanning tree problem in strongly chordal and directed path graphs. 183-187 - César Rego, Tabitha L. James, Fred W. Glover:
An ejection chain algorithm for the quadratic assignment problem. 188-206 - Fedor V. Fomin, Pinar Heggernes, Rodica Mihai:
Mixed search number and linear-width of interval and split graphs. 207-214 - Stephen D. Boyles, S. Travis Waller:
A mean-variance model for the minimum cost flow problem with stochastic arc costs. 215-227
Volume 56, Number 4, December 2010
- Hanne L. Petersen, Claudia Archetti, Maria Grazia Speranza:
Exact solutions to the double travelling salesman problem with multiple stacks. 229-243 - Marcus Brazil, Charl J. Ras, Doreen A. Thomas:
Approximating minimum Steiner point trees in Minkowski planes. 244-254 - Carles Capdevila, Josep Conde, Geoffrey Exoo, Joan Gimbert, Nacho López:
Ranking measures for radially Moore graphs. 255-262 - Lucio Bianco, Massimiliano Caramia:
A new formulation of the resource-unconstrained project scheduling problem with generalized precedence relations to minimize the completion time. 263-271 - Jinn-Shyong Yang, Jou-Ming Chang:
Independent spanning trees on folded hyper-stars. 272-281
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 2025-02-20 00:34 CET 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:
