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=45
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Solving the undirected minimum cost flow problem with arbitrary costs
A. Sedeño-Noda
,
C. González-Martín
,
S. Alonso
Networks
45
(1), 2005, pp. 1-3
Strict nonblockingness of reduced shuffle-exchange networks
F.K. Hwang
,
Binwu Zhang
Networks
45
(1), 2005, pp. 4-8
Parallel scheduling problems in next generation wireless networks
L. Becchetti
,
S. Leonardi
,
A. Marchetti-Spaccamela
,
A. Vitaletti
,
S. Diggavi
,
S. Muthukrishnan
,
T. Nandagopal
Networks
45
(1), 2005, pp. 9-22
Adversarial models for priority-based networks
C. Àlvarez
,
M. Blesa
,
J. Díaz
,
M. Serna
,
A. Fernández
Networks
45
(1), 2005, pp. 23-35
A network flow algorithm to minimize beam-on time for unconstrained multileaf collimator problems in cancer radiation therapy
Ravindra K. Ahuja
,
Horst W. Hamacher
Networks
45
(1), 2005, pp. 36-41
On the minimum number of wavelengths in multicast trees in WDM networks
Yingyu Wan
,
Weifa Liang
Networks
45
(1), 2005, pp. 42-48
Diameter vulnerability of iterated line digraphs in terms of the girth
C. Balbuena
,
X. Marcote
,
D. Ferrero
Networks
45
(2), 2005, pp. 49-54
Graphs, branchwidth, and tangles! Oh my!
Illya V. Hicks
Networks
45
(2), 2005, pp. 55-60
Strong formulations for network design problems with connectivity requirements
Thomas L. Magnanti
,
S. Raghavan
Networks
45
(2), 2005, pp. 61-79
Connectedness of digraphs and graphs under constraints on the conditional diameter
X. Marcote
,
C. Balbuena
,
J. Fàbrega
Networks
45
(2), 2005, pp. 80-87
On the fault-tolerant diameter and wide diameter of
\omega
-connected graphs
Jian-Hua Yin
,
Jiong-Sheng Li
,
Guo-Liang Chen
,
Cheng Zhong
Networks
45
(2), 2005, pp. 88-94
All-port line broadcasting in highly connected graphs
Iris Gaber
,
Michal Parnas
Networks
45
(2), 2005, pp. 95-103
Balanced paths in acyclic networks: Tractable cases and related approaches
Paola Cappanera
,
Maria Grazia Scutellà
Networks
45
(2), 2005, pp. 104-111
On restricted connectivities of permutation graphs
C. Balbuena
,
X. Marcote
,
P. García-Vázquez
Networks
45
(3), 2005, pp. 113-118
Constructions of sparse asymmetric connectors with number theoretic methods
Andreas Baltz
,
Gerold Jäger
,
Anand Srivastav
Networks
45
(3), 2005, pp. 119-124
A branch-and-price algorithm for the capacitated
p
-median problem
Alberto Ceselli
,
Giovanni Righini
Networks
45
(3), 2005, pp. 125-142
The sequential sum problem and performance bounds on the greedy algorithm for the on-line Steiner problem
Zevi Miller
,
Dan Pritikin
,
Manley Perkel
,
I.H. Sudborough
Networks
45
(3), 2005, pp. 143-164
The strongly connected reliability of complete digraphs
J.I. Brown
,
Xiaohu Li
Networks
45
(3), 2005, pp. 165-168
Leader election in oriented star graphs
Wei Shi
,
A. Bouabdallah
,
Pradip K. Srimani
Networks
45
(3), 2005, pp. 169-179
Exact solution of the centralized network design problem on directed graphs
Fatma Gzara
,
Jean-Louis Goffin
Networks
45
(4), 2005, pp. 181-192
A simple protocol for deniable authentication based on EIGamal cryptography
Yingjie Wang
,
Jianhua Li
,
Ling Tie
Networks
45
(4), 2005, pp. 193-194
Efficient neighborhood search for the probabilistic pickup and delivery Travelling Salesman problem
Patrizia Beraldi
,
Gianpaolo Ghiani
,
Gilbert Laporte
,
Roberto Musmanno
Networks
45
(4), 2005, pp. 195-198
Minimizing the cost of placing and sizing wavelength division multiplexing and optical crossconnect equipment in a telecommunications network
Belén Melián
,
Manuel Laguna
,
José A. Moreno-Pérez
Networks
45
(4), 2005, pp. 199-209
Matchings in 3-vertex-critical graphs: The even case
Nawarat Ananchuen
,
Michael D. Plummer
Networks
45
(4), 2005, pp. 210-213
Greedy approximation algorithms for directed multicuts
Yana Kortsarts
,
Guy Kortsarz
,
Zeev Nutov
Networks
45
(4), 2005, pp. 214-217
Seiten 1
2
>