no |
title |
author |
magazine |
year |
volume |
issue |
page(s) |
type |
1 |
A convoy scheduling problem
|
Bovet, J. |
|
1991 |
30 |
1 |
p. 1-14 14 p. |
article |
2 |
A difficulty in particular Shannon-like games
|
Yamasaki, Yōhei |
|
1991 |
30 |
1 |
p. 87-90 4 p. |
article |
3 |
A note on isomorphic simulation of automata by networks of two-state automata
|
Ésik, Zoltán |
|
1991 |
30 |
1 |
p. 77-82 6 p. |
article |
4 |
Approximation algorithms for hitting objects with straight lines
|
Hassin, Refael |
|
1991 |
30 |
1 |
p. 29-42 14 p. |
article |
5 |
Binary vectors with exactly k nonoverlapping m-tuples of consecutive ones
|
Hwang, F.K. |
|
1991 |
30 |
1 |
p. 83-86 4 p. |
article |
6 |
Book announcements
|
|
|
1991 |
30 |
1 |
p. 93-97 5 p. |
article |
7 |
Corrigendum
|
Mahmoud, Hosam M. |
|
1991 |
30 |
1 |
p. 91- 1 p. |
article |
8 |
Editorial board
|
|
|
1991 |
30 |
1 |
p. ii-iii nvt p. |
article |
9 |
NP-completeness of edge-colouring some restricted graphs
|
Cai, Leizhen |
|
1991 |
30 |
1 |
p. 15-27 13 p. |
article |
10 |
On an edge ranking problem of trees and graphs
|
Iyer, Ananth.V. |
|
1991 |
30 |
1 |
p. 43-52 10 p. |
article |
11 |
Parallel machines scheduling with nonsimultaneous machine available time
|
Lee, Chung-Yee |
|
1991 |
30 |
1 |
p. 53-61 9 p. |
article |
12 |
When each hexagon of a hexagonal system covers it
|
Zhang, Fu-ji |
|
1991 |
30 |
1 |
p. 63-75 13 p. |
article |