|
Tijdschrift beschrijving
Alle jaargangen van het bijbehorende tijdschrift
Alle afleveringen van het bijbehorende jaargang
Alle artikelen van de bijbehorende aflevering
18 gevonden resultaten
| nr | titel | auteur | tijdschrift | jaar | jaarg. | afl. | pagina('s) | type |
| 1 | An empirical study on classification methods for alarms from a bug-finding static C analyzer |
Yi, Kwangkeun |
2007 |
102 | 2-3 |
p. 118-123 6 p. |
artikel |
|
| 2 | An FPTAS for scheduling jobs with piecewise linear decreasing processing times to minimize makespan |
Ji, Min |
2007 |
102 | 2-3 |
p. 41-47 7 p. |
artikel |
|
| 3 | An improved degree based condition for Hamiltonian cycles |
Mehedy, Lenin |
2007 |
102 | 2-3 |
p. 108-112 5 p. |
artikel |
|
| 4 | A note on the characterization of TL [ EF ] |
Wu, Zhilin |
2007 |
102 | 2-3 |
p. 48-54 7 p. |
artikel |
|
| 5 | A note on the size of minimal covers |
Costa, Vaston |
2007 |
102 | 2-3 |
p. 124-126 3 p. |
artikel |
|
| 6 | A short proof of optimality for the MIN cache replacement algorithm |
Van Roy, Benjamin |
2007 |
102 | 2-3 |
p. 72-73 2 p. |
artikel |
|
| 7 | Dynamic programming algorithms for the mosaic longest common subsequence problem |
Huang, Kuo-Si |
2007 |
102 | 2-3 |
p. 99-103 5 p. |
artikel |
|
| 8 | Dynamic Shannon coding |
Gagie, Travis |
2007 |
102 | 2-3 |
p. 113-117 5 p. |
artikel |
|
| 9 | Editorial Board |
2007 |
102 | 2-3 |
p. IFC- 1 p. |
artikel |
||
| 10 | Feedback arc set in bipartite tournaments is NP-complete |
Guo, Jiong |
2007 |
102 | 2-3 |
p. 62-65 4 p. |
artikel |
|
| 11 | Greedy online frequency allocation in cellular networks |
Chan, Joseph Wun-Tat |
2007 |
102 | 2-3 |
p. 55-61 7 p. |
artikel |
|
| 12 | Minimum cost subpartitions in graphs |
Nagamochi, Hiroshi |
2007 |
102 | 2-3 |
p. 79-84 6 p. |
artikel |
|
| 13 | Multi-designated verifiers signatures: anonymity without encryption |
Laguillaumie, Fabien |
2007 |
102 | 2-3 |
p. 127-132 6 p. |
artikel |
|
| 14 | On a new class of identifying codes in graphs |
Honkala, Iiro |
2007 |
102 | 2-3 |
p. 92-98 7 p. |
artikel |
|
| 15 | On the context-freeness of the set of words containing overlaps |
Rampersad, Narad |
2007 |
102 | 2-3 |
p. 74-78 5 p. |
artikel |
|
| 16 | Powering requires threshold depth 3 |
Sherstov, Alexander A. |
2007 |
102 | 2-3 |
p. 104-107 4 p. |
artikel |
|
| 17 | Sweeping simple polygons with the minimum number of chain guards |
Tan, Xuehou |
2007 |
102 | 2-3 |
p. 66-71 6 p. |
artikel |
|
| 18 | The 4-choosability of toroidal graphs without intersecting triangles |
Xiaofang, Luo |
2007 |
102 | 2-3 |
p. 85-91 7 p. |
artikel |
18 gevonden resultaten