Fakultät für Informatik
-
Technische Universität München
Lehrstuhl für Effiziente Algorithmen
Die bibliographische Datenbank LEABib
Suchen
•
Liste der Journale
•
Liste der Serien
•
Liste der Konferenzen
•
Ausgewählte Publikationen
Hilfe
Suche: Journal=Networks AND Volume=56
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Bounding the expected number of rectilinear full Steiner trees
Christian Wulff-Nilsen
Networks
56
(1), 2010, pp. 1-10
Neighborhood conditions for graphs to be super restricted edge connected
Shiying Wang
,
Jing Li
,
Lihong Wu
,
Shangwei Lin
Networks
56
(1), 2010, pp. 11-19
Complexity of some inverse shortest path lengths problems
Tingting Cui
,
Dorit S. Hochbaum
Networks
56
(1), 2010, pp. 20-29
Wavelength assignment in multifiber star networks
Zhengbing Bian
,
Qian-Ping Gu
Networks
56
(1), 2010, pp. 30-38
Probabilistic models for the Steiner Tree problem
Vangelis Th. Paschos
,
Orestis A. Telelis
,
Vassilis Zissimopoulos
Networks
56
(1), 2010, pp. 39-49
Recent results on Arc Routing Problems: An annotated bibliography
Angel Corberán
,
Christian Prins
Networks
56
(1), 2010, pp. 50-69
Insertion heuristics for central cycle problems
John D. Lamb
Networks
56
(1), 2010, pp. 70-80
On the connectivity of semiregular cages
C. Balbuena
,
D. González-Moreno
,
X. Marcote
Networks
56
(1), 2010, pp. 81-88
Simultaneous embeddings of graphs as median and antimedian subgraphs
K. Balakrishnan
,
B. Bres̑ar
,
M. Kovs̑e
,
M. Changat
,
A.R. Subhamathi
,
S. Klavz̑ar
Networks
56
(2), 2010, pp. 90-94
Optical index of fault tolerant routings in WDM networks
Stéphane Bessy
,
Clément Lepelletier
Networks
56
(2), 2010, pp. 95-102
The diameter and connectivity of networks with random dependent faults
Evangelos Kranakis
,
Michel Paquette
,
Andrzej Pelc
Networks
56
(2), 2010, pp. 103-115
Fixed-parameter tractability results for full-degree spanning tree and its dual
Jiong Guo
,
Rolf Niedermeier
,
Sebastian Wernicke
Networks
56
(2), 2010, pp. 116-130
Kernelization and complexity results for connectivity augmentation problems
Jiong Guo
,
Johannes Uhlmann
Networks
56
(2), 2010, pp. 131-142
On superconnectivity of
(4,g)
-cages with even girth
Yuqing Lin
,
Hongliang Lu
,
Yunjian Wu
,
Qinglin Yu
Networks
56
(2), 2010, pp. 143-148
Polynomial time algorithm for constructing vertex-disjoint paths in transposition graphs
Satoshi Fujita
Networks
56
(2), 2010, pp. 149-157
Network flow spanners
Feodor F. Dragan
,
Chenyu Yan
Networks
56
(3), 2010, pp. 159-168
A branch-and-cut-and-price algorithm for vertex-biconnectivity augmentation
Ivana Ljubić
Networks
56
(3), 2010, pp. 169-182
The degree-preserving spanning tree problem in strongly chordal and directed path graphs
Ching-Chi Lin
,
Gerard J. Chang
,
Gen-Huey Chen
Networks
56
(3), 2010, pp. 183-187
An ejection chain algorithm for the quadratic assignment problem
Cesar Rego
,
Tabitha James
,
Fred Glover
Networks
56
(3), 2010, pp. 188-206
Mixed search number and linear-width of interval and split graphs
Fedor V. Fomin
,
Pinar Heggernes
,
Rodica Mihai
Networks
56
(3), 2010, pp. 207-214
A mean-variance model for the minimum cost flow problem with stochastic arc costs
Stephen D. Boyles
,
S. Travis Waller
Networks
56
(3), 2010, pp. 215-227
Exact solutions to the double Travelling Salesman Problem with multiple stacks
Hanne L. Petersen
,
Claudia Archetti
,
M. Grazia Speranza
Networks
56
(4), 2010, pp. 229-243
Approximating minimum Steiner point trees in Minkowski planes
M. Brazil
,
C.J. Ras
,
D.A. Thomas
Networks
56
(4), 2010, pp. 244-254
Ranking measures for radially Moore graphs
Carles Capdevila
,
Josep Conde
,
Geoffrey Exoo
,
Joan Gimbert
,
Nacho López
Networks
56
(4), 2010, pp. 255-262
A new formulation of the resource-unconstrained project scheduling problem with generalized precedence relations to minimize the completion time
Lucio Bianco
,
Massimiliano Caramia
Networks
56
(4), 2010, pp. 263-271
Seiten 1
2
>