|
Tijdschrift beschrijving
Alle jaargangen van het bijbehorende tijdschrift
Alle afleveringen van het bijbehorende jaargang
Alle artikelen van de bijbehorende aflevering
21 gevonden resultaten
| nr | titel | auteur | tijdschrift | jaar | jaarg. | afl. | pagina('s) | type |
| 1 | A correct proof of the McMorris–Powers’ theorem on the consensus of phylogenies |
Thatte, Bhalchandra D. |
2007 |
155 | 3 |
p. 423-427 5 p. |
artikel |
|
| 2 | A note on the computational complexity of graph vertex partition |
Huang, Yuanqiu |
2007 |
155 | 3 |
p. 405-409 5 p. |
artikel |
|
| 3 | A note on the precedence-constrained class sequencing problem |
Correa, José R. |
2007 |
155 | 3 |
p. 257-259 3 p. |
artikel |
|
| 4 | A note on worst-case performance of heuristics for maintenance scheduling problems |
Qi, Xiangtong |
2007 |
155 | 3 |
p. 416-422 7 p. |
artikel |
|
| 5 | Approximating reversal distance for strings with bounded number of duplicates |
Kolman, Petr |
2007 |
155 | 3 |
p. 327-336 10 p. |
artikel |
|
| 6 | Binary trees with the largest number of subtrees |
Székely, L.A. |
2007 |
155 | 3 |
p. 374-385 12 p. |
artikel |
|
| 7 | Classes of cycle bases |
Liebchen, Christian |
2007 |
155 | 3 |
p. 337-355 19 p. |
artikel |
|
| 8 | Connecting colored point sets |
Aichholzer, Oswin |
2007 |
155 | 3 |
p. 271-278 8 p. |
artikel |
|
| 9 | Containment properties of product and power graphs |
Fernández, Antonio |
2007 |
155 | 3 |
p. 300-311 12 p. |
artikel |
|
| 10 | Contents |
2007 |
155 | 3 |
p. vii-viii nvt p. |
artikel |
||
| 11 | Decomposition of bipartite graphs into special subgraphs |
Chen, Guantao |
2007 |
155 | 3 |
p. 400-404 5 p. |
artikel |
|
| 12 | Decompositions of graphs of functions and fast iterations of lookup tables |
Tsaban, Boaz |
2007 |
155 | 3 |
p. 386-393 8 p. |
artikel |
|
| 13 | Editorial Board |
2007 |
155 | 3 |
p. v-vi nvt p. |
artikel |
||
| 14 | Formulas for cube roots in F 3 m |
Ahmadi, Omran |
2007 |
155 | 3 |
p. 260-270 11 p. |
artikel |
|
| 15 | Making the components of a graph k -connected |
Nikiforov, V. |
2007 |
155 | 3 |
p. 410-415 6 p. |
artikel |
|
| 16 | On the ranks of O’N and Ly |
Ali, Faryad |
2007 |
155 | 3 |
p. 394-399 6 p. |
artikel |
|
| 17 | O ( 1 ) query time algorithm for all pairs shortest distances on permutation graphs |
Sprague, Alan P. |
2007 |
155 | 3 |
p. 365-373 9 p. |
artikel |
|
| 18 | Overlaps help: Improved bounds for group testing with interval queries |
Cicalese, Ferdinando |
2007 |
155 | 3 |
p. 288-299 12 p. |
artikel |
|
| 19 | Solution techniques for the Large Set Covering Problem |
Galinier, Philippe |
2007 |
155 | 3 |
p. 312-326 15 p. |
artikel |
|
| 20 | Testing primitivity on partial words |
Blanchet-Sadri, F. |
2007 |
155 | 3 |
p. 279-287 9 p. |
artikel |
|
| 21 | The strong metric dimension of graphs and digraphs |
Oellermann, Ortrud R. |
2007 |
155 | 3 |
p. 356-364 9 p. |
artikel |
21 gevonden resultaten