|
Journal description
All volumes of the corresponding journal
All issues of the corresponding volume
All articles of the corresponding issues
10 results found
| no | title | author | magazine | year | volume | issue | page(s) | type |
| 1 | A 2.5-factor approximation algorithm for the k-MST problem |
Arya, Sunil |
1998 |
65 | 3 |
p. 117-118 2 p. |
article |
|
| 2 | Agreement under faulty interfaces |
Dasgupta, Pallab |
1998 |
65 | 3 |
p. 125-129 5 p. |
article |
|
| 3 | An improved fixed-parameter algorithm for vertex cover |
Balasubramanian, R. |
1998 |
65 | 3 |
p. 163-168 6 p. |
article |
|
| 4 | ANSV problem on BSRs |
Xiang, Limin |
1998 |
65 | 3 |
p. 135-138 4 p. |
article |
|
| 5 | Approximate Max k-Cut with subgraph guarantee |
Kann, Viggo |
1998 |
65 | 3 |
p. 145-150 6 p. |
article |
|
| 6 | Global avalanche characteristics and nonlinearity of balanced Boolean functions |
Son, Jung Je |
1998 |
65 | 3 |
p. 139-144 6 p. |
article |
|
| 7 | Optimal 1-hamiltonian graphs |
Jeng-Jung, Wang |
1998 |
65 | 3 |
p. 157-161 5 p. |
article |
|
| 8 | Recognizing when greed can approximate maximum independent sets is complete for parallel access to NP |
Hemaspaandra, Edith |
1998 |
65 | 3 |
p. 151-156 6 p. |
article |
|
| 9 | The NPO-completeness of the longest Hamiltonian cycle problem |
Wu, Q.S. |
1998 |
65 | 3 |
p. 119-123 5 p. |
article |
|
| 10 | The p-neighbor k-center problem |
Chaudhuri, Shiva |
1998 |
65 | 3 |
p. 131-134 4 p. |
article |
10 results found