nr |
titel |
auteur |
tijdschrift |
jaar |
jaarg. |
afl. |
pagina('s) |
type |
1 |
A min-max relation for K 3-covers in graphs noncontractible to K 5 e
|
Mahjoub, Ali Ridha |
|
1995 |
62 |
1-3 |
p. 209-219 11 p. |
artikel |
2 |
Author index
|
|
|
1995 |
62 |
1-3 |
p. 291-292 2 p. |
artikel |
3 |
Bin-packing and matchings in threshold graphs
|
Tinhofer, G. |
|
1995 |
62 |
1-3 |
p. 279-289 11 p. |
artikel |
4 |
Complete linear descriptions of small asymmetric traveling salesman polytopes
|
Euler, R. |
|
1995 |
62 |
1-3 |
p. 193-208 16 p. |
artikel |
5 |
Compositions for matroids with the Fulkerson property
|
Chopra, Sunil |
|
1995 |
62 |
1-3 |
p. 87-101 15 p. |
artikel |
6 |
Decomposability of partially defined Boolean functions
|
Boros, Endre |
|
1995 |
62 |
1-3 |
p. 51-75 25 p. |
artikel |
7 |
Decomposition of wheel-and-parachute-free balanced bipartite graphs
|
Conforti, Michele |
|
1995 |
62 |
1-3 |
p. 103-117 15 p. |
artikel |
8 |
Editorial Board
|
|
|
1995 |
62 |
1-3 |
p. iii-iv nvt p. |
artikel |
9 |
Efficient algorithms for some path partitioning problems
|
Brucker, Peter |
|
1995 |
62 |
1-3 |
p. 77-85 9 p. |
artikel |
10 |
Graph partitioning applied to the logic testing of combinational circuits
|
Davis-Moradkhan, Madlaine |
|
1995 |
62 |
1-3 |
p. 131-165 35 p. |
artikel |
11 |
On some algorithmic investigations of star partitions of graphs
|
Cvetković, Dragos̆ |
|
1995 |
62 |
1-3 |
p. 119-130 12 p. |
artikel |
12 |
Partitioning a matrix to minimize the maximum cost
|
Mingozzi, Aristide |
|
1995 |
62 |
1-3 |
p. 221-248 28 p. |
artikel |
13 |
Path covering problems and testing of printed circuits
|
Andreatta, Giovanni |
|
1995 |
62 |
1-3 |
p. 5-13 9 p. |
artikel |
14 |
Preface
|
Lucertini, Mario |
|
1995 |
62 |
1-3 |
p. 1-3 3 p. |
artikel |
15 |
Scheduling independent tasks with multiple modes
|
Bianco, L. |
|
1995 |
62 |
1-3 |
p. 35-50 16 p. |
artikel |
16 |
Solving the max-cut problem using eigenvalues
|
Poljak, Svatopluk |
|
1995 |
62 |
1-3 |
p. 249-278 30 p. |
artikel |
17 |
Some new classes of facets for the equicut polytope
|
de Souza, C.C. |
|
1995 |
62 |
1-3 |
p. 167-191 25 p. |
artikel |
18 |
The shifting algorithm technique for the partitioning of trees
|
Becker, Ronald I. |
|
1995 |
62 |
1-3 |
p. 15-34 20 p. |
artikel |