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=54
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Panconnectivity and edge-pancyclicity of
k
-ary
n
-cubes
Sun-Yuan Hsieh
,
Tsong-Jie Lin
Networks
54
(1), 2009, pp. 1-11
On the complexity of distributed graph coloring with local minimality constraints
Cyril Gavoille
,
Ralf Klasing
,
Adrian Kosowski
,
Łukasz Kuszner
,
Alfredo Navarra
Networks
54
(1), 2009, pp. 12-19
A note on the
k
-degree Cayley graph
Yuuki Tanaka
,
Yukio Shibata
Networks
54
(1), 2009, pp. 20-22
Approximability of unsplittable shortest path routing problems
Andreas Bley
Networks
54
(1), 2009, pp. 23-46
On the cycle polytope of a directed graph and its relaxations
Egon Balas
,
Rüdiger Stephan
Networks
54
(1), 2009, pp. 47-55
A branch-and-cut algorithm for the undirected prize collecting Traveling Salesman problem
Jean-François Bérubé
,
Michel Gendreau
,
Jean-Yves Potvin
Networks
54
(1), 2009, pp. 56-67
A eulogy for Frank Boesch
Charles Suffel
Networks
54
(2), 2009, pp. 69-69
Liar's domination
Peter J. Slater
Networks
54
(2), 2009, pp. 70-74
The rainbow connectivity of a graph
Gary Chartrand
,
Garry L. Johns
,
Kathleen A. McKeon
,
Ping Zhang
Networks
54
(2), 2009, pp. 75-81
A generalization of an edge-connectivity theorem of Chartrand
Frank Boesch
,
Daniel Gross
,
John T. Saccoman
,
L. William Kazmierczak
,
Charles Suffel
,
Antonius Suhartomo
Networks
54
(2), 2009, pp. 82-89
Packing the Steiner trees of a graph
L. Petingi
,
M. Talafha
Networks
54
(2), 2009, pp. 90-94
Sufficient degree conditions for
k
-edge-connectedness of a graph
D. Bauer
,
S.L. Hakimi
,
N. Kahl
,
E. Schmeichel
Networks
54
(2), 2009, pp. 95-98
A survey of some network reliability analysis and synthesis results
F.T. Boesch
,
A. Satyanarayana
,
C.L. Suffel
Networks
54
(2), 2009, pp. 99-107
On the roots of strongly connected reliability polynomials
J.I. Brown
,
K. Dilcher
Networks
54
(2), 2009, pp. 108-116
Minimax flow tree problems
Hui Chen
,
Ann Campbell
,
Barrett Thomas
,
Arie Tamir
Networks
54
(3), 2009, pp. 117-129
Edge intersection graphs of single bend paths on a grid
Martin Charles Golumbic
,
Marina Lipshteyn
,
Michal Stern
Networks
54
(3), 2009, pp. 130-138
Polyhedral structure of the 4-node network design problem
Yogesh K. Agarwal
Networks
54
(3), 2009, pp. 139-149
Improper coloring of unit disk graphs
Frédéric Havet
,
Ross J. Kang
,
Jean-Sébastien Sereni
Networks
54
(3), 2009, pp. 150-164
ROUTE 2007: Recent advances in vehicle routing optimization
Alan L. Erera
,
Martin W.P. Savelsbergh
Networks
54
(4), 2009, pp. 165-166
A robust branch-cut-and-price algorithm for the heterogeneous fleet vehicle routing problem
Artur Pessoa
,
Eduardo Uchoa
,
Marcus Poggi de Aragão
Networks
54
(4), 2009, pp. 167-177
Valid inequalities for the fleet size and mix vehicle routing problem with fixed costs
Roberto Baldacci
,
Maria Battarra
,
Daniele Vigo
Networks
54
(4), 2009, pp. 178-189
A branch-and-price-based large neighborhood search algorithm for the vehicle routing problem with time windows
Eric Prescott-Gagnon
,
Guy Desaulniers
,
Louis-Martin Rousseau
Networks
54
(4), 2009, pp. 190-204
Edge assembly-based memetic algorithm for the capacitated vehicle routing problem
Yuichi Nagata
,
Olli Bräysy
Networks
54
(4), 2009, pp. 205-215
Min-Max
k
-vehicles windy rural postman problem
Enrique Benavent
,
Angel Corberán
,
Isaac Plana
,
José M. Sanchis
Networks
54
(4), 2009, pp. 216-226
A heuristic two-phase solution approach for the multi-objective dial-a-ride problem
Sophie N. Parragh
,
Karl F. Doerner
,
Richard F. Hartl
,
Xavier Gandibleux
Networks
54
(4), 2009, pp. 227-242
Seiten 1
2
>