Digitale Bibliotheek
Sluiten Bladeren door artikelen uit een tijdschrift
 
Zoeken naar met titel:
ABCDEFGHIJKLMNOPQRSTUVWXYZ

     Tijdschrift beschrijving
       Alle jaargangen van het bijbehorende tijdschrift
         Alle afleveringen van het bijbehorende jaargang
                                       Alle artikelen van de bijbehorende aflevering
 
                             37 gevonden resultaten
nr titel auteur tijdschrift jaar jaarg. afl. pagina('s) type
1 A linear algorithm for the Hamiltonian completion number of the line graph of a cactus Meloni, C.
 2001
 8 C p. 26-
1 p.
 artikel
2 A new Algorithm for Accelerating Pair-Wise Computations of Melting Temperature Kaderali, Lars
 2001
 8 C p. 46-49
4 p.
 artikel
3 A Prim-based Heuristic Algorithm for Obstacle Avoiding Rectilinear Steiner Minimal Tree Mohamed, M.M.Ibrahim
 2001
 8 C p. 102-105
4 p.
 artikel
4 A simple dual ascent algorithm for the multilevel facility location problem Dumb, A.F.
 2001
 8 C p. 14-17
4 p.
 artikel
5 BCH codes are good for distance multicolorings with radio frequencies in hypercubes asymptotically Skupień, Zdzislaw
 2001
 8 C p. 94-97
4 p.
 artikel
6 Circular and uniquely colorable mixed hypergraphs Niciilitsa, Angela
 2001
 8 C p. 115-118
4 p.
 artikel
7 Clique Covers in Claw-Free Berge Graphs Oriolo, Gianpaolo
 2001
 8 C p. 68-71
4 p.
 artikel
8 Clique number and ball containment number of unit ball graphs Ceroi, Stephan
 2001
 8 C p. 22-25
4 p.
 artikel
9 3-Colorability ∈ P for p6–;free Graphs Randerath, Bert
 2001
 8 C p. 85-89
5 p.
 artikel
10 Combinatorial Structures of Max-Type Functions characterizing the Optimal Solution of the Equivalence Problem Pickl, S.
 2001
 8 C p. 72-75
4 p.
 artikel
11 Discrete optimal control problems and dynamic games with p players Lozovanu, D.
 2001
 8 C p. 58-61
4 p.
 artikel
12 Edge-Oblique Polyhedral Graphs Schreyer, Jens
 2001
 8 C p. 90-93
4 p.
 artikel
13 Extending Partial Suborders Sándor, P.Fekete
 2001
 8 C p. 34-37
4 p.
 artikel
14 Factorization as a SAT problem Kloock, M.
 2001
 8 C p. 50-53
4 p.
 artikel
15 Hamiltonian Cycles in Quasi-threshold Graphs Nikolopoulus, Stavros D.
 2001
 8 C p. 67-
1 p.
 artikel
16 Impulses from Results of Inverse Problems to Discrete Tomography Weber, Gerhard-Wilhelm
 2001
 8 C p. 124-127
4 p.
 artikel
17 LD-Coloring of Regular Tiling (Extended Abstract) Calamoneri, Tiziana
 2001
 8 C p. 18-21
4 p.
 artikel
18 Making a tournament k-arc-strong by reversing arcs Bang-Jensen, Jørgen
 2001
 8 C p. 2-5
4 p.
 artikel
19 Moplex elimination orderings Berry, Anne
 2001
 8 C p. 6-9
4 p.
 artikel
20 MULTICOLOR DISCREPANCY OF ARITHMETIC PROGRESSIONS -EXTENDED ABSTRACT- Doerr, Benjamin
 2001
 8 C p. 27-30
4 p.
 artikel
21 Nonsymmetric configurations with line size k=4 Gropp, Harald
 2001
 8 C p. 42-45
4 p.
 artikel
22 On Approximability of Linear Ordering and Related NP-optimization Problems on Graphs (Extended Abstract) Mishra, Sounaka
 2001
 8 C p. 63-66
4 p.
 artikel
23 On Covering Z-Grid Points by Rectangles Porschen, Stefan
 2001
 8 C p. 80-83
4 p.
 artikel
24 On the use of Factorized Distribution Algorithms for problems defined on graphs Santana, Roberto
 2001
 8 C p. 84-
1 p.
 artikel
25 On treewidth approximations Bouchitté, Vincent
 2001
 8 C p. 98-101
4 p.
 artikel
26 PATHS AND CYCLES IN COLORED GRAPHS LI, Xueliang
 2001
 8 C p. 128-132
5 p.
 artikel
27 Preface Broersma, Hajo
 2001
 8 C p. 1-
1 p.
 artikel
28 Relaxation methods for the Generalized Minimum Spanning Tree Problem Pop, P.C.
 2001
 8 C p. 76-79
4 p.
 artikel
29 Solving Problems for Maximal Reducible Flowgraphs Vernet, O.
 2001
 8 C p. 111-114
4 p.
 artikel
30 Some New Families of Integral Trees with Diameters 4 and 6 Wang, Ligong
 2001
 8 C p. 119-123
5 p.
 artikel
31 Some Results on a Paint Shop Problem for Words Epping, Th.
 2001
 8 C p. 31-33
3 p.
 artikel
32 Strongly Connected Components can Predict Protein Structure Bolten, Eva
 2001
 8 C p. 10-13
4 p.
 artikel
33 Study of Methods of Nonlinear Optimization Using Computer Means Izhutkin, V.S.
 2001
 8 C p. 106-110
5 p.
 artikel
34 The complexity of the chromatic sum problem on cubic planar graphs and regular graphs Malafiejski, Michal
 2001
 8 C p. 62-
1 p.
 artikel
35 The obnoxious center problem on weighted cactus graphs (Extended Abstract) Zmazek, Blaž
 2001
 8 C p. 133-136
4 p.
 artikel
36 Tree partitioning via vertex deletion Finocchi, Irene
 2001
 8 C p. 38-41
4 p.
 artikel
37 Treewidth: Computational Experiments C.A. Koster, Arie M.
 2001
 8 C p. 54-57
4 p.
 artikel
                             37 gevonden resultaten
 
 Koninklijke Bibliotheek - Nationale Bibliotheek van Nederland