|
Journal description
All volumes of the corresponding journal
All issues of the corresponding volume
All articles of the corresponding issues
15 results found
| no | title | author | magazine | year | volume | issue | page(s) | type |
| 1 | An algorithmic characterization of antimatroids |
Boyd, E.Andrew |
1990 |
28 | 3 |
p. 197-205 9 p. |
article |
|
| 2 | Announcement |
1990 |
28 | 3 |
p. 317- 1 p. |
article |
||
| 3 | Author index |
1990 |
28 | 3 |
p. 319-320 2 p. |
article |
||
| 4 | Book announcements |
1990 |
28 | 3 |
p. 313-316 4 p. |
article |
||
| 5 | Canonical equation sets for classes of concordant polytopes |
Lee, Jon |
1990 |
28 | 3 |
p. 207-221 15 p. |
article |
|
| 6 | Classification of three-valued logical functions preserving 0 |
Miyakawa, Masahiro |
1990 |
28 | 3 |
p. 231-249 19 p. |
article |
|
| 7 | Communication in m-connected graphs |
Idzik, Adam |
1990 |
28 | 3 |
p. 297-301 5 p. |
article |
|
| 8 | Factorization of symmetric circulant matrices in finite fields |
Weinberger, Marcelo J. |
1990 |
28 | 3 |
p. 271-285 15 p. |
article |
|
| 9 | Local medians in chordal graphs |
Wittenberg, Heiko |
1990 |
28 | 3 |
p. 287-296 10 p. |
article |
|
| 10 | Low complexity normal bases for F 2 mn |
Séguin, Gérald E. |
1990 |
28 | 3 |
p. 309-312 4 p. |
article |
|
| 11 | On the growth of random knapsacks |
Mamer, John W. |
1990 |
28 | 3 |
p. 223-230 8 p. |
article |
|
| 12 | Recognizing tough graphs is NP-hard |
Bauer, D. |
1990 |
28 | 3 |
p. 191-195 5 p. |
article |
|
| 13 | Succinct representation of general unlabeled graphs |
Naor, Moni |
1990 |
28 | 3 |
p. 303-307 5 p. |
article |
|
| 14 | The double competition number of some triangle-free graphs |
Seager, Suzanne M. |
1990 |
28 | 3 |
p. 265-269 5 p. |
article |
|
| 15 | The structure of an integral monoid and integer programming feasibility |
Ryan, Jennifer |
1990 |
28 | 3 |
p. 251-263 13 p. |
article |
15 results found