Volume 12,
Numbers 1-2,
September 2006
Special Issue on Communication Networks and Internet Applications
- Mohit Lad, Daniel Massey, Adam Meyerson, Akash Nanavati, Lixia Zhang:
Minimum failure explanations for path vector routing changes.
5-16
Electronic Edition (link) BibTeX
- Yigal Bejerano, Joseph Naor, Alexander Sprintson:
Efficient algorithms for shared backup allocation in networks with partial information.
17-34
Electronic Edition (link) BibTeX
- Qunwei Zheng, Sibabrata Ray, Xiaoyan Hong:
Resource allocation for restoration of compromised systems.
35-56
Electronic Edition (link) BibTeX
- Anders Hansson, Gabriel Istrate, Shiva Prasad Kasiviswanathan:
Combinatorics of TCP reordering.
57-70
Electronic Edition (link) BibTeX
- Yuan Cao, Oliver Yu:
Optimization of loss-balanced multicast in all-optical WDM networks.
71-82
Electronic Edition (link) BibTeX
- Randeep Bhatia, Murali S. Kodialam, T. V. Lakshman:
Finding disjoint paths with related path costs.
83-96
Electronic Edition (link) BibTeX
- Shekhar Srivastava, Deep Medhi:
Traffic engineering of tunnel-based networks with class specific diversity requirements.
97-125
Electronic Edition (link) BibTeX
- Weijia Jia, Hanxing Wang, Wanqing Tu, Wei Zhao:
A New delay control method for real-time flows.
127-149
Electronic Edition (link) BibTeX
- Chonggang Wang, Yu Lin, Kazem Sohraby, Bo Li:
An adaptive algorithm for active queue management.
151-162
Electronic Edition (link) BibTeX
Volume 12,
Number 3,
November 2006
- Jinchang Wang, Thomas Kämpke:
The fastest itinerary in time-dependent decentralized travel information systems.
167-185
Electronic Edition (link) BibTeX
- Eranda Çela, Bettina Klinz, Christophe Meyer:
Polynomially solvable cases of the constant rank unconstrained quadratic 0-1 programming problem.
187-215
Electronic Edition (link) BibTeX
- Chia-Mao Huang, Bang Ye Wu, Chang-Biau Yang:
Tree edge decomposition with an application to minimum ultrametric tree approximation.
217-230
Electronic Edition (link) BibTeX
- Enock Chisonge Mofya, Jonathan Cole Smith:
Exact and heuristic algorithms for solving the generalized minimum filter placement problem.
231-256
Electronic Edition (link) BibTeX
- Rashika Gupta, Manju Agarwal:
Penalty guided genetic search for redundancy optimization in multi-state series-parallel power system.
257-277
Electronic Edition (link) BibTeX
- Mikhail Y. Kovalyov, Marie-Claude Portmann, Ammar Oulamara:
Optimal testing and repairing a failed series system.
279-295
Electronic Edition (link) BibTeX
- Hong Gao, Frank K. Hwang, My T. Thai, Weili Wu, Taieb Znati:
Construction of d(H)-disjunct matrix for group testing in hypergraphs.
297-301
Electronic Edition (link) BibTeX
- Wayne J. Pullan:
Phased local search for the maximum clique problem.
303-323
Electronic Edition (link) BibTeX
Volume 12,
Number 4,
December 2006
Special Issue In Memoriam:
Yong He (1969-2005); Guest Editors:
Guohui Lin and Zhiyi Tan
- Guohui Lin, Zhiyi Tan:
Editorial: In memoriam: Yong He (1969-2005).
325-326
Electronic Edition (link) BibTeX
- Guangting Chen, Gu Zhang, Rainer E. Burkard:
The web proxy location problem in general tree of rings networks.
327-336
Electronic Edition (link) BibTeX
- György Dósa, Yong He:
Scheduling with machine cost and rejection.
337-350
Electronic Edition (link) BibTeX
- Binwu Zhang, Jianzhong Zhang, Liqun Qi:
The shortest path improvement problems under Hamming distance.
351-361
Electronic Edition (link) BibTeX
- Leah Epstein, Lene M. Favrholdt, Jens S. Kohrt:
Separating online scheduling algorithms with the relative worst order ratio.
363-386
Electronic Edition (link) BibTeX
- C. T. Ng, T. C. Edwin Cheng, J. J. Yuan:
A note on the complexity of the problem of two-agent scheduling on a single machine.
387-394
Electronic Edition (link) BibTeX
- Longcheng Liu, Jianzhong Zhang:
Inverse maximum flow problems under the weighted Hamming distance.
395-408
Electronic Edition (link) BibTeX
- Haiyan Lu, Weiqi Chen:
Dynamic-objective particle swarm optimization for constrained optimization problems.
409-419
Electronic Edition (link) BibTeX
- Chen Ting, H. E. Yong:
Optimal algorithms for uncovering synteny problem.
421-432
Electronic Edition (link) BibTeX
Copyright © Sun May 17 00:07:54 2009
by Michael Ley (ley@uni-trier.de)