|
Tijdschrift beschrijving
Alle jaargangen van het bijbehorende tijdschrift
Alle afleveringen van het bijbehorende jaargang
Alle artikelen van de bijbehorende aflevering
32 gevonden resultaten
| nr | titel | auteur | tijdschrift | jaar | jaarg. | afl. | pagina('s) | type |
| 1 | A linear time algorithm for minimum fill-in and treewidth for distance hereditary graphs |
Broersma, H.J. |
2000 |
99 | 1-3 |
p. 367-400 34 p. |
artikel |
|
| 2 | Chordality and 2-factors in tough graphs |
Bauer, D. |
2000 |
99 | 1-3 |
p. 323-329 7 p. |
artikel |
|
| 3 | Connected domination and dominating clique in trapezoid graphs |
Köhler, Ekkehard |
2000 |
99 | 1-3 |
p. 91-110 20 p. |
artikel |
|
| 4 | Counting symmetric configurations v 3 |
Betten, Anton |
2000 |
99 | 1-3 |
p. 331-338 8 p. |
artikel |
|
| 5 | Covering a rectangle with six and seven circles |
Melissen, J.B.M. |
2000 |
99 | 1-3 |
p. 149-156 8 p. |
artikel |
|
| 6 | Cyclic graphs |
Göbel, F. |
2000 |
99 | 1-3 |
p. 3-12 10 p. |
artikel |
|
| 7 | Domination and total domination on asteroidal triple-free graphs |
Kratsch, Dieter |
2000 |
99 | 1-3 |
p. 111-123 13 p. |
artikel |
|
| 8 | Editorial |
2000 |
99 | 1-3 |
p. 1- 1 p. |
artikel |
||
| 9 | How to survive while visiting a graph |
Arbib, Claudio |
2000 |
99 | 1-3 |
p. 279-293 15 p. |
artikel |
|
| 10 | Independent sets with domination constraints |
Halldórsson, Magnús M. |
2000 |
99 | 1-3 |
p. 39-54 16 p. |
artikel |
|
| 11 | Index |
2000 |
99 | 1-3 |
p. 455-456 2 p. |
artikel |
||
| 12 | N-extendible posets, and how to minimize total weighted completion time |
Peter, Markus |
2000 |
99 | 1-3 |
p. 157-167 11 p. |
artikel |
|
| 13 | Not every 2-tough graph is Hamiltonian |
Bauer, D. |
2000 |
99 | 1-3 |
p. 317-321 5 p. |
artikel |
|
| 14 | On complexity, representation and approximation of integral multicommodity flows |
Srivastav, Anand |
2000 |
99 | 1-3 |
p. 183-208 26 p. |
artikel |
|
| 15 | On some infinite series of (r,1)-designs |
Gropp, Harald |
2000 |
99 | 1-3 |
p. 13-21 9 p. |
artikel |
|
| 16 | On the classification of NP-complete problems in terms of their correlation coefficient |
Angel, Eric |
2000 |
99 | 1-3 |
p. 261-277 17 p. |
artikel |
|
| 17 | On the strong chromatic index of cyclic multigraphs |
Gvozdjak, Pavol |
2000 |
99 | 1-3 |
p. 23-38 16 p. |
artikel |
|
| 18 | Optimal paths in network games with p players |
Boliac, R. |
2000 |
99 | 1-3 |
p. 339-348 10 p. |
artikel |
|
| 19 | Pancyclic out-arcs of a vertex in tournaments |
Yao, Tianxing |
2000 |
99 | 1-3 |
p. 245-249 5 p. |
artikel |
|
| 20 | Recognition and isomorphism of tree-like P4 -connected graphs |
Babel, Luitpold |
2000 |
99 | 1-3 |
p. 295-315 21 p. |
artikel |
|
| 21 | Recognition of tractable satisfiability problems through balanced polynomial representations |
Warners, Joost P. |
2000 |
99 | 1-3 |
p. 229-244 16 p. |
artikel |
|
| 22 | Recognizing k-path graphs |
Prisner, Erich |
2000 |
99 | 1-3 |
p. 169-181 13 p. |
artikel |
|
| 23 | Recognizing the P 4-structure of block graphs |
Brandstädt, Andreas |
2000 |
99 | 1-3 |
p. 349-366 18 p. |
artikel |
|
| 24 | Reducible configurations for the cycle double cover conjecture |
Huck, Andreas |
2000 |
99 | 1-3 |
p. 71-90 20 p. |
artikel |
|
| 25 | Reduction of symmetric configurations n 3 |
Carstens, H.G. |
2000 |
99 | 1-3 |
p. 401-411 11 p. |
artikel |
|
| 26 | Strongly orderable graphs A common generalization of strongly chordal and chordal bipartite graphs |
Dragan, Feodor F. |
2000 |
99 | 1-3 |
p. 427-442 16 p. |
artikel |
|
| 27 | Structural aspects of ordered polymatroids |
Krüger, Ulrich |
2000 |
99 | 1-3 |
p. 125-148 24 p. |
artikel |
|
| 28 | Subtrees of bipartite digraphs — the minimum degree condition |
Zioł o, Irmina A. |
2000 |
99 | 1-3 |
p. 251-259 9 p. |
artikel |
|
| 29 | The Maximum Travelling Salesman Problem on symmetric Demidenko matrices |
Deı̆neko, Vladimir G. |
2000 |
99 | 1-3 |
p. 413-425 13 p. |
artikel |
|
| 30 | Tree partitioning under constraints — clustering for vehicle routing problems |
Hamacher, Anja |
2000 |
99 | 1-3 |
p. 55-69 15 p. |
artikel |
|
| 31 | Two results on the bit extraction problem |
Friedl, Katalin |
2000 |
99 | 1-3 |
p. 443-454 12 p. |
artikel |
|
| 32 | Uncolorable mixed hypergraphs |
Tuza, Zsolt |
2000 |
99 | 1-3 |
p. 209-227 19 p. |
artikel |
32 gevonden resultaten