Volume 150,
Numbers 1-3,
1 September 2005
Special Section on Max-Algebra,
Guest Edited by Peter Butkovic;
Communications
Contributions
- Paola Bonizzoni, Clelia de Felice, Giancarlo Mauri, Rosalba Zizza:
On the power of circular splicing.
51-66
- Chandra Chekuri, Anupam Gupta, Amit Kumar:
On a bidirected relaxation for the MULTIWAY CUT problem.
67-79
- G. L. Chia, Siew-Hui Ong:
Generalized knight's tours on rectangular chessboards.
80-98
- Serafino Cicerone, Gabriele Di Stefano, Dagmar Handke:
Self-spanner graphs.
99-120
- Paolo Dell'Olmo, Pierre Hansen, Stefano Pallottino, Giovanni Storchi:
On uniform k-partition problems.
121-139
- Yong He, György Dósa:
Semi-online scheduling jobs with tightly-grouped processing times on three identical machines.
140-159
- Wen An Liu, Qi-Min Zhang, Zan Kan Nie:
Searching for a counterfeit coin with two unreliable weighings.
160-181
- Stavros D. Nikolopoulos, Leonidas Palios:
Efficient parallel recognition of cographs.
182-215
- Natasa Przulj, Derek G. Corneil:
2-Tree probe interval graphs have a large obstruction set.
216-231
- Juan Rada, Carlos Uzcátegui:
Randic ordering of chemical trees.
232-250
Notes
Copyright © Mon Dec 7 20:15:03 2009
by Michael Ley (ley@uni-trier.de)
