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 YEAR=2011
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Optimal online ring routing
Jessen T. Havill
,
Kevin R. Hutson
Networks
57
(2), 2011, pp. 187-197
Optimal power control in OFDMA cellular networks
Paolo Detti
,
Gaia Nicosia
,
Andrea Pacifici
,
Mara Servilio
Networks
57
(3), 2011, pp. 200-211
Exact algorithms for the vertex separator problem in graphs
Cid C. de Souza
,
Victor F. Cavalcante
Networks
57
(3), 2011, pp. 212-230
A multistart heuristic for the equality generalized Traveling Salesman Problem
Valentina Cacchiani
,
Albert Einstein Fernandes Muritiba
,
Marcos Negreiros
,
Paolo Toth
Networks
57
(3), 2011, pp. 231-239
On the cardinality constrained matroid polytope
Jean François Maurras
,
Rüdiger Stephan
Networks
57
(3), 2011, pp. 240-246
On LP relaxations for the pattern minimization problem
Alessandro Aloisio
,
Claudio Arbib
,
Fabrizio Marinelli
Networks
57
(3), 2011, pp. 247-253
On minimum reload cost paths, tours, and flows
Edoardo Amaldi
,
Giulia Galbiati
,
Francesco Maffioli
Networks
57
(3), 2011, pp. 254-260
A decomposition for total-coloring partial-grids and list-total-coloring outerplanar graphs
Raphael C.S. Machado
,
Celina M.H. de Figueiredo
Networks
57
(3), 2011, pp. 261-269
Uncertainty feature optimization: An implicit paradigm for problems with noisy data
Niklaus Eggenberg
,
Matteo Salani
,
Michel Bierlaire
Networks
57
(3), 2011, pp. 270-284
An experimental study of maximum profit wavelength assignment in WDM rings
Evangelos Bampas
,
Aris Pagourtzis
,
Katerina Potika
Networks
57
(3), 2011, pp. 285-293
Locating median paths on connected outerplanar graphs
Isabella Lari
,
Federica Ricca
,
Andrea Scozzari
,
Ronald I. Becker
Networks
57
(3), 2011, pp. 294-307
Connectivity and diameter in distance graphs
Lucia Draque Penso
,
Dieter Rautenbach
,
Jayme Luiz Szwarcfiter
Networks
57
(4), 2011, pp. 310-315
On large
(\Delta, D, D, 1)
-graphs
J. Gómez
,
J. Fàbrega
,
J.L.A. Yebra
Networks
57
(4), 2011, pp. 316-327
Least central subtrees, center, and centroid of a tree
Martti Hamina
,
Matti Peltola
Networks
57
(4), 2011, pp. 328-332
Nonblocking multirate
\log_2(N,m,p)
switching networks with multicast connections
Wojciech Kabaciński
,
Tomasz Wichary
Networks
57
(4), 2011, pp. 333-343
Finding hidden hubs and dominating sets in sparse graphs by randomized neighborhood queries
Peter Damaschke
Networks
57
(4), 2011, pp. 344-350
Balancing two spanning trees
Matthias Kriesell
Networks
57
(4), 2011, pp. 351-353
Optimum Steiner ratio for gradient-constrained networks connecting three points in 3-space, part II: The gradient-constraint
1\leq m \leq \sqrt{3}
Doreen Thomas
,
Kevin Prendergast
,
Jia Weng
Networks
57
(4), 2011, pp. 354-361
Finding integer efficient solutions for multiple objective network programming problems
Minghe Sun
Networks
57
(4), 2011, pp. 362-375
High-confidence estimation of small
s-t
reliabilities in directed acyclic networks
Rico Zenklusen
,
Marco Laumanns
Networks
57
(4), 2011, pp. 376-388
Seiten
<
1
2
3