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.
Matching preclusion and conditional matching preclusion for bipartite interconnection networks I: Sufficient conditions
Eddie Cheng
,
Philip Hu
,
Roger Jia
,
László Lipták
Networks
59
(4), 2012, pp. 349-356
Matching preclusion and conditional matching preclusion for bipartite interconnection networks II: Cayley graphs generated by transposition trees and hyper-stars
Eddie Cheng
,
Philip Hu
,
Roger Jia
,
László Lipták
Networks
59
(4), 2012, pp. 357-364
Reload cost trees and network design
Ioannis Gamvros
,
Luis Gouveia
,
S. Raghavan
Networks
59
(4), 2012, pp. 365-379
Computing approximate Nash equilibria in network congestion games
Andreas Emil Feldmann
,
Heiko Röglin
,
Berthold Vöcking
Networks
59
(4), 2012, pp. 380-386
A branch-and-cut algorithm for the preemptive swapping problem
Charles Bordenave
,
Michel Gendreau
,
G. Laporte
Networks
59
(4), 2012, pp. 387-399
Big segment small segment global optimization algorithm on networks
Oded Berman
,
Zvi Drezner
,
Dmitry Krass
Networks
58
(1), 2011, pp. 1-11
Approximation of a batch consolidation problem
Junho Chang
,
Soo Y. Chang
,
Sung-Pil Hong
,
Yun-Hong Min
,
Myoung-Ju Park
Networks
58
(1), 2011, pp. 12-19
Traffic grooming in bidirectional WDM ring networks
Jean-Claude Bermond
,
Xavier Muñoz
,
Ignasi Sau
Networks
58
(1), 2011, pp. 20-35
Compression and expansion in graphs using overlays
Bilal Khan
,
Kiran R. Bhutani
Networks
58
(1), 2011, pp. 36-42
Power domination in cylinders, tori, and generalized Petersen graphs
Roberto Barrera
,
Daniela Ferrero
Networks
58
(1), 2011, pp. 43-49
Resource allocation by means of project networks: Dominance results
Roel Leus
Networks
58
(1), 2011, pp. 50-58
Resource allocation by means of project networks: Complexity results
R. Roel Leus
Networks
58
(1), 2011, pp. 59-67
The most likely path on series-parallel networks
Daniel Reich
,
Leo Lopes
Networks
58
(1), 2011, pp. 68-80
The preemptive swapping problem on a tree
Shoshana Anily
,
Michel Gendreau
,
Gilbert Laporte
Networks
58
(2), 2011, pp. 83-94
Proximity and remoteness in graphs: Results and conjectures
Mustapha Aouchiche
,
Pierre Hansen
Networks
58
(2), 2011, pp. 95-102
Scheduling two chains of unit jobs on one machine: A polyhedral study
Claudio Arbib
,
Martine Labbé
,
Mara Servilio
Networks
58
(2), 2011, pp. 103-113
Progressive hedging-based metaheuristics for stochastic network design
Teodor Gabriel Crainic
,
Xiaorui Fu
,
Michel Gendreau
,
Walter Rei
,
Stein W. Wallace
Networks
58
(2), 2011, pp. 114-124
Generalized network design polyhedra
Corinne Feremans
,
Martine Labbé
,
Adam N. Letchford
,
Juan-José Salazar-González
Networks
58
(2), 2011, pp. 125-136
Online Traveling Salesman Problems with service flexibility
Patrick Jaillet
,
Xin Lu
Networks
58
(2), 2011, pp. 137-146
Minimax regret path location on trees
Justo Puerto
,
Federica Ricca
,
Andrea Scozzari
Networks
58
(2), 2011, pp. 147-158
A mathematical analysis of the R-MAT random graph generator
Chris Groër
,
Blair D. Sullivan
,
Steve Poole
Networks
58
(3), 2011, pp. 159-170
GRASP with path relinking heuristics for the antibandwidth problem
A. Duarte
,
R. Martí
,
M.G.C. Resende
,
R.M.A. Silva
Networks
58
(3), 2011, pp. 171-189
Combinatorial algorithms for inverse absolute and vertex 1-center location problems on trees
Behrooz Alizadeh
,
R.E. Burkard
Networks
58
(3), 2011, pp. 190-200
Edge-superconnectivity of semiregular cages with odd girth
C. Balbuena
,
D. González-moreno
,
J. Salas
Networks
58
(3), 2011, pp. 201-206
Graph labelings derived from models in distributed computing: A complete complexity classification
Jérémie Chalopin
,
Daniël Paulusma
Networks
58
(3), 2011, pp. 207-231
Seiten 1
2
3
>