|
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 new algorithm for the propositional satisfiability problem |
Gallo, G. |
1995 |
60 | 1-3 |
p. 159-179 21 p. |
artikel |
|
| 2 | A new approach to solving three combinatorial enumeration problems on planar graphs |
Colbourn, Charles J. |
1995 |
60 | 1-3 |
p. 119-129 11 p. |
artikel |
|
| 3 | A note on biased and non-biased games |
Lu, Xiaoyun |
1995 |
60 | 1-3 |
p. 285-291 7 p. |
artikel |
|
| 4 | A recognition algorithm for orders of interval dimension two |
Langley, Larry J. |
1995 |
60 | 1-3 |
p. 257-266 10 p. |
artikel |
|
| 5 | Author index volume 60 (1995) |
1995 |
60 | 1-3 |
p. 389-390 2 p. |
artikel |
||
| 6 | Boole's conditions of possible experience and reasoning under uncertainty |
Hansen, Pierre |
1995 |
60 | 1-3 |
p. 181-193 13 p. |
artikel |
|
| 7 | Editorial Board |
1995 |
60 | 1-3 |
p. v-vi nvt p. |
artikel |
||
| 8 | Enumeration of difference graphs |
Peled, Uri N. |
1995 |
60 | 1-3 |
p. 311-318 8 p. |
artikel |
|
| 9 | Explicit construction of graphs with an arbitrary large girth and of large size |
Lazebnik, Felix |
1995 |
60 | 1-3 |
p. 275-284 10 p. |
artikel |
|
| 10 | Extending shelling orders and a hierarchy of functions of unimodal simple polytopes |
Hoke, Kathy |
1995 |
60 | 1-3 |
p. 211-217 7 p. |
artikel |
|
| 11 | Generalized perfect graphs: Characterizations and inversion |
Trenk, Ann N. |
1995 |
60 | 1-3 |
p. 359-387 29 p. |
artikel |
|
| 12 | Interval orders based on weak orders |
Bogart, Kenneth P. |
1995 |
60 | 1-3 |
p. 93-98 6 p. |
artikel |
|
| 13 | Intervertex distances in convex polygons |
Erdös, Paul |
1995 |
60 | 1-3 |
p. 149-158 10 p. |
artikel |
|
| 14 | Irreflexive and reflexive dimension |
Langley, Larry J. |
1995 |
60 | 1-3 |
p. 267-273 7 p. |
artikel |
|
| 15 | Multiplicities of interpoint distances in finite planar sets |
Erdős, Paul |
1995 |
60 | 1-3 |
p. 141-147 7 p. |
artikel |
|
| 16 | New complexity results on scheduling with small communication delays |
Picouleau, C. |
1995 |
60 | 1-3 |
p. 331-342 12 p. |
artikel |
|
| 17 | On component-size bounded Steiner trees |
Du, Ding-Zhu |
1995 |
60 | 1-3 |
p. 131-140 10 p. |
artikel |
|
| 18 | On-line algorithms for ordered sets and comparability graphs |
Penrice, Stephen G. |
1995 |
60 | 1-3 |
p. 319-329 11 p. |
artikel |
|
| 19 | On paving matroids and a generalization of MDS codes |
Rajpal, Sanjay |
1995 |
60 | 1-3 |
p. 343-347 5 p. |
artikel |
|
| 20 | On pseudomodular matroids and adjoints |
Alfter, M. |
1995 |
60 | 1-3 |
p. 3-11 9 p. |
artikel |
|
| 21 | On some new types of greedy chains and greedy linear extensions of partially ordered sets |
Syslo, Maciej M. |
1995 |
60 | 1-3 |
p. 349-358 10 p. |
artikel |
|
| 22 | On the essential test sets of discrete matrices |
Kogan, Alexander |
1995 |
60 | 1-3 |
p. 249-255 7 p. |
artikel |
|
| 23 | On the integral dicycle packings and covers and the linear ordering polytope |
Nutov, Zeev |
1995 |
60 | 1-3 |
p. 293-309 17 p. |
artikel |
|
| 24 | Permuting matrices to avoid forbidden submatrices |
Klinz, Bettina |
1995 |
60 | 1-3 |
p. 223-248 26 p. |
artikel |
|
| 25 | Polynomially solvable cases for the maximum stable set problem |
Hertz, Alain |
1995 |
60 | 1-3 |
p. 195-210 16 p. |
artikel |
|
| 26 | Preface |
Boros, Endre |
1995 |
60 | 1-3 |
p. 1- 1 p. |
artikel |
|
| 27 | Proper and unit tolerance graphs |
Bogart, Kenneth P. |
1995 |
60 | 1-3 |
p. 99-117 19 p. |
artikel |
|
| 28 | 2-satisfiability and diagnosing faulty processors in massively parallel computing systems |
Bagchi, Ansuman |
1995 |
60 | 1-3 |
p. 25-37 13 p. |
artikel |
|
| 29 | The reversing number of a diagraph |
Barthélemy, Jean-Pierre |
1995 |
60 | 1-3 |
p. 39-76 38 p. |
artikel |
|
| 30 | The time complexity of deterministic broadcast radio networks |
Hwang, F.K. |
1995 |
60 | 1-3 |
p. 219-222 4 p. |
artikel |
|
| 31 | Unique satisfiability of Horn sets can be solved in nearly linear time |
Berman, Kenneth A. |
1995 |
60 | 1-3 |
p. 77-91 15 p. |
artikel |
|
| 32 | Work-preserving emulations of shuffle-exchange networks: An analysis of the complex plane diagram |
Annexstein, Fred |
1995 |
60 | 1-3 |
p. 13-23 11 p. |
artikel |
32 gevonden resultaten