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
 
                             286 gevonden resultaten
nr titel auteur tijdschrift jaar jaarg. afl. pagina('s) type
1 A constructive enumeration of nanotube caps Brinkmann, G.
 2002
 81-90 1-2 p. 55-71
17 p.
 artikel
2 A convolutional-like approach to p-adic codes Lagorce, N.
 2001
 81-90 1-2 p. 139-155
17 p.
 artikel
3 Acyclic molecules with greatest HOMO–LUMO separation Zhang, Fuji
 1999
 81-90 1-2 p. 165-171
7 p.
 artikel
4 A decomposition theory based on a dominance relation and composite jobs Sekiguchi, Yasuki
 1987
 81-90 1-2 p. 187-211
25 p.
 artikel
5 A fair and efficient solution to the socialist millionaires’ problem Boudot, Fabrice
 2001
 81-90 1-2 p. 23-36
14 p.
 artikel
6 A family of Hadamard matrices of dihedral group type Shinoda, Koichi
 2000
 81-90 1-2 p. 141-150
10 p.
 artikel
7 A group testing method for finding patterns in data Macula, Anthony J.
 2004
 81-90 1-2 p. 149-157
9 p.
 artikel
8 A heuristic with worst-case analysis for minimax routing of two travelling salesmen on a tree Averbakh, Igor
 1996
 81-90 1-2 p. 17-32
16 p.
 artikel
9 A laminarity property of the polyhedron described by a weakly posi-modular set function Fujishige, Satoru
 2000
 81-90 1-2 p. 123-126
4 p.
 artikel
10 Algebraic approach to fasciagraphs and rotagraphs Klavžar, Sandi
 1996
 81-90 1-2 p. 93-100
8 p.
 artikel
11 Algebraic structure of quasicyclic codes Lally, Kristine
 2001
 81-90 1-2 p. 157-175
19 p.
 artikel
12 Algorithmic characterizations of interval ordered hypergraphs and applications Quilliot, A.
 1994
 81-90 1-2 p. 159-170
12 p.
 artikel
13 Algorithms and codes for dense assignment problems: the state of the art Dell'Amico, Mauro
 2000
 81-90 1-2 p. 17-48
32 p.
 artikel
14 Algorithms for high dimensional stabbing problems Avis, David
 1990
 81-90 1-2 p. 39-48
10 p.
 artikel
15 Algorithms for interval catch digraphs Prisner, Erich
 1994
 81-90 1-2 p. 147-157
11 p.
 artikel
16 Algorithms for minclique scheduling problems Jurisch, Bernd
 1997
 81-90 1-2 p. 115-139
25 p.
 artikel
17 All-pairs-shortest-length on strongly chordal graphs Balachandhran, V.
 1996
 81-90 1-2 p. 169-182
14 p.
 artikel
18 Almost resolvable perfect Mendelsohn designs with block size five Abel, R.J.R.
 2002
 81-90 1-2 p. 1-15
15 p.
 artikel
19 A lower bound for the non-oriented two-dimensional bin packing problem Dell'Amico, Mauro
 2002
 81-90 1-2 p. 13-24
12 p.
 artikel
20 A lower bound for the shortness coefficient of a class of graphs Harant, J.
 1994
 81-90 1-2 p. 103-105
3 p.
 artikel
21 A method for cutting squares into distinct squares Gambini, Ian
 1999
 81-90 1-2 p. 65-80
16 p.
 artikel
22 An algorithm to find two distance domination parameters in a graph Fricke, Gerd H.
 1996
 81-90 1-2 p. 85-91
7 p.
 artikel
23 An approximation algorithm with performance guarantees for the maximum traveling salesman problem on special matrices Blokh, David
 2002
 81-90 1-2 p. 139-148
10 p.
 artikel
24 A new complete language for DSPACE(log n) Chen, Jian-er
 1989
 81-90 1-2 p. 19-26
8 p.
 artikel
25 An introduction to cocyclic generalised Hadamard matrices Horadam, K.J.
 2000
 81-90 1-2 p. 115-131
17 p.
 artikel
26 An optimal time algorithm for the k-vertex-connectivity unweighted augmentation problem for rooted directed trees Masuzawa, Toshimitsu
 1987
 81-90 1-2 p. 67-105
39 p.
 artikel
27 A note on “parallel machine scheduling with non-simultaneous machine available time” Lee, Chung-Yee
 2000
 81-90 1-2 p. 133-135
3 p.
 artikel
28 A note on the generalized steiner tree polytope Salazar, Juan José
 2000
 81-90 1-2 p. 137-144
8 p.
 artikel
29 A note on the half-integral multiflow-problem restricted to minor-closed classes of graphs Pfeiffer, Frank
 1994
 81-90 1-2 p. 127-135
9 p.
 artikel
30 An out-of-kilter method for submodular flows Fujishige, Satoru
 1987
 81-90 1-2 p. 3-16
14 p.
 artikel
31 A parallel algorithm for computing Steiner trees in strongly chordal graphs Dahlhaus, Elias
 1994
 81-90 1-2 p. 47-61
15 p.
 artikel
32 A parametric characterization and an ε-approximation scheme for the minimization of a quasiconcave program Katoh, Naoki
 1987
 81-90 1-2 p. 39-66
28 p.
 artikel
33 Applications of generalized matrix searching to geometric algorithms Aggarwal, Alok
 1990
 81-90 1-2 p. 3-23
21 p.
 artikel
34 Approximation algorithms for multi-parameter graph optimization problems Basov, Ivan
 2002
 81-90 1-2 p. 129-138
10 p.
 artikel
35 A randomized parallel algorithm for Voronoi diagrams based on symmetric convex distance functions Kühn, Ulrich
 2001
 81-90 1-2 p. 177-196
20 p.
 artikel
36 Arboricity: An acyclic hypergraph decomposition problem motivated by database theory Chee, Yeow Meng
 2012
 81-90 1-2 p. 100-107
8 p.
 artikel
37 A shortest path-based approach to the multileaf collimator sequencing problem Cambazard, Hadrien
 2012
 81-90 1-2 p. 81-99
19 p.
 artikel
38 A simple branching scheme for vertex coloring problems Gualandi, Stefano
 2012
 81-90 1-2 p. 192-196
5 p.
 artikel
39 Asymptotically optimal erasure-resilient codes for large disk arrays Chee, Yeow Meng
 2000
 81-90 1-2 p. 3-36
34 p.
 artikel
40 A tabu search algorithm for scheduling a single robot in a job-shop environment Hurink, Johann
 2002
 81-90 1-2 p. 181-203
23 p.
 artikel
41 A Tutte polynomial for signed graphs Kauffman, Louis H.
 1989
 81-90 1-2 p. 105-127
23 p.
 artikel
42 Augmentations of consistent partial orders for the one-machine total tardiness problem Yu, Wenci
 1996
 81-90 1-2 p. 189-202
14 p.
 artikel
43 Augmenting trees so that every three vertices lie on a cycle Dankelmann, Peter
 2002
 81-90 1-2 p. 145-159
15 p.
 artikel
44 Average distance and independence number Dankelmann, P.
 1994
 81-90 1-2 p. 75-83
9 p.
 artikel
45 A very personal reminiscence on the problem of computational complexity Iri, Masao
 1987
 81-90 1-2 p. 17-27
11 p.
 artikel
46 b9000A 1 4 approximate algorithm for P2/tree/Cmax Gallo, Giorgio
 1997
 81-90 1-2 p. 85-98
14 p.
 artikel
47 b -coloring of Kneser graphs Balakrishnan, R.
 2012
 81-90 1-2 p. 9-14
6 p.
 artikel
48 BDDs—design, analysis, complexity, and applications Wegener, Ingo
 2004
 81-90 1-2 p. 229-251
23 p.
 artikel
49 Book announcement 1979
 81-90 1-2 p. 145-153
9 p.
 artikel
50 Bounds on the crossing resolution of complete geometric graphs Di Giacomo, Emilio
 2012
 81-90 1-2 p. 132-139
8 p.
 artikel
51 Bus interconnection networks Bermond, Jean-Claude
 1996
 81-90 1-2 p. 1-15
15 p.
 artikel
52 Characterization of test-sets for overlap-free morphisms Richomme, G
 1999
 81-90 1-2 p. 151-157
7 p.
 artikel
53 Chromatic number of prime distance graphs Voigt, M.
 1994
 81-90 1-2 p. 197-209
13 p.
 artikel
54 Cluster graph modification problems Shamir, Ron
 2004
 81-90 1-2 p. 173-182
10 p.
 artikel
55 Cocyclic Hadamard matrices and difference sets de Launey, Warwick
 2000
 81-90 1-2 p. 47-61
15 p.
 artikel
56 Coding, Cryptography, and Computer Security Colbourn, Charles J
 2000
 81-90 1-2 p. 1-
1 p.
 artikel
57 Coherent algebras and the graph isomorphism problem Friedland, Shmuel
 1989
 81-90 1-2 p. 73-98
26 p.
 artikel
58 Color groups Senechal, Marjorie
 1979
 81-90 1-2 p. 51-73
23 p.
 artikel
59 Comparability graph augmentation for some multiprocessor scheduling problems Dell'Olmo, P.
 1997
 81-90 1-2 p. 71-84
14 p.
 artikel
60 Completely separable graphs Hammer, Peter L.
 1990
 81-90 1-2 p. 85-99
15 p.
 artikel
61 Complete weight enumerators of generalized Kerdock code and related linear codes over Galois ring Kuzmin, Aleksey
 2001
 81-90 1-2 p. 117-137
21 p.
 artikel
62 Completing partial latin squares with prescribed diagonals Grüttmüller, Martin
 2004
 81-90 1-2 p. 89-97
9 p.
 artikel
63 Complexity of problems in games, graphs and algebraic equations Fraenkel, A.S.
 1979
 81-90 1-2 p. 15-30
16 p.
 artikel
64 Computing orbit period in max–min algebra Gavalec, Martin
 2000
 81-90 1-2 p. 49-65
17 p.
 artikel
65 Computing the jump number on semi-orders is polynomial von Arnim, A.
 1994
 81-90 1-2 p. 219-232
14 p.
 artikel
66 Configurations between geometry and combinatorics Gropp, Harald
 2004
 81-90 1-2 p. 79-88
10 p.
 artikel
67 Constructing colorings for diagrams Felsner, Stefan
 1994
 81-90 1-2 p. 85-93
9 p.
 artikel
68 Constructing integral uniform flows in symmetric networks with application to the edge-forwarding index problem Shahrokhi, Farhad
 2001
 81-90 1-2 p. 175-191
17 p.
 artikel
69 Construction properties of combinatorial deltahedra Foulds, L.R.
 1979
 81-90 1-2 p. 75-87
13 p.
 artikel
70 Containment relations in split graphs Golovach, Petr A.
 2012
 81-90 1-2 p. 155-163
9 p.
 artikel
71 Contents 2012
 81-90 1-2 p. v-vi
nvt p.
 artikel
72 Contents 2004
 81-90 1-2 p. vii-viii
nvt p.
 artikel
73 Contents 2004
 81-90 1-2 p. viii-ix
nvt p.
 artikel
74 Convexity in oriented graphs Chartrand, Gary
 2002
 81-90 1-2 p. 115-126
12 p.
 artikel
75 Correlation theorems in cryptanalysis Nyberg, Kaisa
 2001
 81-90 1-2 p. 177-188
12 p.
 artikel
76 Counter-intuitive answers to some questions concerning minimal-palindromic extensions of binary words Bašić, Bojan
 2012
 81-90 1-2 p. 181-186
6 p.
 artikel
77 Counting humps in Motzkin paths Ding, Yun
 2012
 81-90 1-2 p. 187-191
5 p.
 artikel
78 Degree-constrained spanners for multidimensional grids Liestman, Arthur L.
 1996
 81-90 1-2 p. 119-144
26 p.
 artikel
79 Detecting leftmost maximal periodicities Main, Michael G.
 1989
 81-90 1-2 p. 145-153
9 p.
 artikel
80 Detection and recognition of a binary linear code Valembois, Antoine
 2001
 81-90 1-2 p. 199-218
20 p.
 artikel
81 Discrete function expansions in integer powers Thayse, A.
 1979
 81-90 1-2 p. 127-136
10 p.
 artikel
82 Discrete models for data imputation Bruni, Renato
 2004
 81-90 1-2 p. 59-69
11 p.
 artikel
83 Distinguished representatives for equivalent labelled stratified graphs and applications Ţăndăreanu, Nicolae
 2004
 81-90 1-2 p. 183-208
26 p.
 artikel
84 Domination analysis of some heuristics for the traveling salesman problem Punnen, Abraham
 2002
 81-90 1-2 p. 117-128
12 p.
 artikel
85 Domination in distance-hereditary graphs Chang, Maw-Shang
 2002
 81-90 1-2 p. 103-113
11 p.
 artikel
86 Earliness and tardiness scheduling problems on a batch processor Qi, Xiangtong
 1999
 81-90 1-2 p. 131-145
15 p.
 artikel
87 Edge-disjoint paths in a grid bounded by two nested rectangles Suzuki, Hitoshi
 1990
 81-90 1-2 p. 157-178
22 p.
 artikel
88 Editorial Board 1997
 81-90 1-2 p. iii-iv
nvt p.
 artikel
89 Editorial Board 1996
 81-90 1-2 p. v-vi
nvt p.
 artikel
90 Editorial Board 1996
 81-90 1-2 p. iii-iv
nvt p.
 artikel
91 Editorial board 1994
 81-90 1-2 p. ix-x
nvt p.
 artikel
92 Editorial Board 1989
 81-90 1-2 p. ii-
1 p.
 artikel
93 Editorial Board 1990
 81-90 1-2 p. iii-iv
nvt p.
 artikel
94 Editorial board 1987
 81-90 1-2 p. ii-
1 p.
 artikel
95 Editorial Board 1979
 81-90 1-2 p. ii-
1 p.
 artikel
96 Editorial Board 2004
 81-90 1-2 p. v-vi
nvt p.
 artikel
97 Editorial Board 2004
 81-90 1-2 p. v-vii
nvt p.
 artikel
98 Efficient embeddings of grids into grids Röttger, M.
 2001
 81-90 1-2 p. 143-173
31 p.
 artikel
99 Efficient generation of rotating workforce schedules Musliu, Nysret
 2002
 81-90 1-2 p. 85-98
14 p.
 artikel
100 Embedding graphs of small size Woźniak, Mariusz
 1994
 81-90 1-2 p. 233-241
9 p.
 artikel
101 Embedding trees in recursive circulants Lim, Hyeong-Seok
 1996
 81-90 1-2 p. 83-99
17 p.
 artikel
102 Enumeration of balanced ternary designs Kaski, Petteri
 2004
 81-90 1-2 p. 133-141
9 p.
 artikel
103 Epidemiography with various growth functions Fraenkel, Aviezri S.
 1989
 81-90 1-2 p. 53-71
19 p.
 artikel
104 Equivalent constraints for discrete sets Meyer, R.R
 1979
 81-90 1-2 p. 31-50
20 p.
 artikel
105 Estimating satisfiability Boufkhad, Yacine
 2012
 81-90 1-2 p. 61-80
20 p.
 artikel
106 Exact and approximate discrete optimization algorithms for finding useful disjunctions of categorical predicates in data analysis Boros, Endre
 2004
 81-90 1-2 p. 43-58
16 p.
 artikel
107 Facets of the generalized permutahedron of a poset von Arnim, Annelie
 1997
 81-90 1-2 p. 179-192
14 p.
 artikel
108 Finding a homotopy base for directed paths in an acyclic graph Murota, Kazuo
 1987
 81-90 1-2 p. 157-162
6 p.
 artikel
109 Finding the ℓ-core of a tree Becker, Ronald I.
 2002
 81-90 1-2 p. 25-42
18 p.
 artikel
110 Foreword Hurtado, Ferran
 2001
 81-90 1-2 p. 1-
1 p.
 artikel
111 Foreword Carlet, C
 2001
 81-90 1-2 p. 1-
1 p.
 artikel
112 Fortran subroutines for computing approximate solutions of weighted MAX-SAT problems using GRASP Resende, Mauricio G.C.
 2000
 81-90 1-2 p. 95-113
19 p.
 artikel
113 From weight enumerators to zeta functions Duursma, Iwan
 2001
 81-90 1-2 p. 55-73
19 p.
 artikel
114 Further results on the eccentric distance sum Hua, Hongbo
 2012
 81-90 1-2 p. 170-180
11 p.
 artikel
115 Gap strings and spanning forests for bridge graphs of biconnected graphs Stephens, Peter W.
 1996
 81-90 1-2 p. 125-145
21 p.
 artikel
116 Generalized latin squares I Shen, Xiaojun
 1989
 81-90 1-2 p. 155-178
24 p.
 artikel
117 Generalized self-approaching curves Aichholzer, Oswin
 2001
 81-90 1-2 p. 3-24
22 p.
 artikel
118 Generation of lower bounds for minimum span frequency assignment Allen, S.M.
 2002
 81-90 1-2 p. 59-78
20 p.
 artikel
119 Graphs with bounded induced distance Cicerone, Serafino
 2001
 81-90 1-2 p. 3-21
19 p.
 artikel
120 Guide for authors 2004
 81-90 1-2 p. I-IV
nvt p.
 artikel
121 Guide for authors 2004
 81-90 1-2 p. I-IV
nvt p.
 artikel
122 Hamiltonicity of a type of interchange graphs Li, Xueliang
 1994
 81-90 1-2 p. 107-111
5 p.
 artikel
123 Hamiltonicity of bipartite biclaw-free graphs Flandrin, E.
 1994
 81-90 1-2 p. 95-102
8 p.
 artikel
124 Hard problems in similarity searching Moan, Christophe
 2004
 81-90 1-2 p. 213-227
15 p.
 artikel
125 Hard-to-color graphs for connected sequential colorings Babel, Luitpold
 1994
 81-90 1-2 p. 3-25
23 p.
 artikel
126 Homogeneous bent functions Qu, Chengxin
 2000
 81-90 1-2 p. 133-139
7 p.
 artikel
127 Homotopy base of acyclic graphs — a combinatorial analysis of commutative diagrams by means of preordered matroid Murota, Kazuo
 1987
 81-90 1-2 p. 135-155
21 p.
 artikel
128 How to find overfull subgraphs in graphs with large maximum degree Niessen, Thomas
 1994
 81-90 1-2 p. 117-125
9 p.
 artikel
129 Illuminating labyrinths Tóth, Csaba D
 2004
 81-90 1-2 p. 215-228
14 p.
 artikel
130 Improving local search heuristics for some scheduling problems. Part II Brucker, Peter
 1997
 81-90 1-2 p. 47-69
23 p.
 artikel
131 Inclusion relations between some congruences related to the dot-depth hierarchy Blanchet-Sadri, F.
 1996
 81-90 1-2 p. 33-71
39 p.
 artikel
132 Independent tree spanners: fault-tolerant spanning trees with constant distance guarantees Handke, Dagmar
 2001
 81-90 1-2 p. 105-127
23 p.
 artikel
133 Inequalities for minimal covering sets in set systems of given rank Tuza, Zsolt
 1994
 81-90 1-2 p. 187-195
9 p.
 artikel
134 Interval arithmetic yields efficient dynamic filters for computational geometry Brönnimann, Hervé
 2001
 81-90 1-2 p. 25-47
23 p.
 artikel
135 Introduction to special volume of Discrete Applied Mathematics Anthony, Martin
 2004
 81-90 1-2 p. 1-
1 p.
 artikel
136 Inverse radiation therapy planning — a multiple objective optimization approach Hamacher, H.W.
 2002
 81-90 1-2 p. 145-161
17 p.
 artikel
137 Ladder orderings of pairs and RAID performance Cohen, Myra B
 2004
 81-90 1-2 p. 35-46
12 p.
 artikel
138 Lexicographic permutations with restrictions Knuth, Donald E
 1979
 81-90 1-2 p. 117-125
9 p.
 artikel
139 Linear algorithms for preemptive scheduling of multiprocessor tasks subject to minimal lateness Bianco, L.
 1997
 81-90 1-2 p. 25-46
22 p.
 artikel
140 Local symmetries in the period-doubling sequence Damanik, David
 2000
 81-90 1-2 p. 115-121
7 p.
 artikel
141 Maximum packing for biconnected outerplanar graphs Kovacs, Tomas
 2000
 81-90 1-2 p. 85-94
10 p.
 artikel
142 Mean distance in a tree Winkler, Peter
 1990
 81-90 1-2 p. 179-185
7 p.
 artikel
143 Measures on Boolean polynomials and their applications in data mining Jaroszewicz, Szymon
 2004
 81-90 1-2 p. 123-139
17 p.
 artikel
144 Measures on monotone properties of graphs Balogh, Jòzsef
 2002
 81-90 1-2 p. 17-36
20 p.
 artikel
145 Menger-decomposition of a graph and its application to the structural analysis of a large-scale system of equations Murota, Kazuo
 1987
 81-90 1-2 p. 107-134
28 p.
 artikel
146 Minimal elimination ordering for graphs of bounded degree Dahlhaus, Elias
 2002
 81-90 1-2 p. 127-143
17 p.
 artikel
147 Minimizing the number of tardy jobs with precedence constraints and agreeable due dates Steiner, George
 1997
 81-90 1-2 p. 167-177
11 p.
 artikel
148 Minimum convex partition of a constrained point set Fevens, Thomas
 2001
 81-90 1-2 p. 95-107
13 p.
 artikel
149 Minus domination in small-degree graphs Damaschke, Peter
 2001
 81-90 1-2 p. 53-64
12 p.
 artikel
150 Monotone concepts for formal concept analysis Deogun, Jitender S.
 2004
 81-90 1-2 p. 70-78
9 p.
 artikel
151 More broadcast graphs Harutyunyan, Hovhannes A
 1999
 81-90 1-2 p. 81-102
22 p.
 artikel
152 Multicommodity flows in certain planar directed networks Nagamochi, Hiroshi
 1990
 81-90 1-2 p. 125-145
21 p.
 artikel
153 Multiple criteria decision making 1979
 81-90 1-2 p. 143-
1 p.
 artikel
154 Naturally submodular digraphs and forbidden digraph configurations Granot, D.
 2000
 81-90 1-2 p. 67-84
18 p.
 artikel
155 Negative cycles in complete signed graphs Popescu, Dragos Radu
 1996
 81-90 1-2 p. 145-152
8 p.
 artikel
156 New polynomially solvable classes and a new heuristic for the traveling salesman problem and its generalization Kabadi, Santosh N.
 2002
 81-90 1-2 p. 149-167
19 p.
 artikel
157 New type of coding problem motivated by database theory Katona, Gyula O.H.
 2004
 81-90 1-2 p. 140-148
9 p.
 artikel
158 Nonlinear functions in abelian groups and relative difference sets Pott, Alexander
 2004
 81-90 1-2 p. 177-193
17 p.
 artikel
159 [No title] Gutin, Gregory
 2002
 81-90 1-2 p. 1-2
2 p.
 artikel
160 On a conjecture of Graham and Lovász about distance matrices Collins, Karen L.
 1989
 81-90 1-2 p. 27-35
9 p.
 artikel
161 On bipartite graphs of defect at most 4 Feria-Purón, Ramiro
 2012
 81-90 1-2 p. 140-154
15 p.
 artikel
162 On bisectors for different distance functions Icking, Christian
 2001
 81-90 1-2 p. 139-161
23 p.
 artikel
163 On Bounded-Degree Vertex Deletion parameterized by treewidth Betzler, Nadja
 2012
 81-90 1-2 p. 53-60
8 p.
 artikel
164 On cocyclic weighing matrices and the regular group actions of certain paley matrices de Launey, Warwick
 2000
 81-90 1-2 p. 63-101
39 p.
 artikel
165 On data classification by iterative linear partitioning Anthony, Martin
 2004
 81-90 1-2 p. 2-16
15 p.
 artikel
166 On edge-hamiltonian Cayley graphs Baumann, Ulrike
 1994
 81-90 1-2 p. 27-37
11 p.
 artikel
167 On exclusion regions for optimal triangulations (Scot) Drysdale, R.L.
 2001
 81-90 1-2 p. 49-65
17 p.
 artikel
168 On graphs with equal domination and covering numbers Volkmann, Lutz
 1994
 81-90 1-2 p. 211-217
7 p.
 artikel
169 On-line scheduling with precedence constraints Azar, Yossi
 2002
 81-90 1-2 p. 169-180
12 p.
 artikel
170 On optimal orientations of cartesian products with a bipartite graph Koh, K.M.
 1999
 81-90 1-2 p. 103-120
18 p.
 artikel
171 On ordered graphs and graph orderings Nešetřil, Jaroslav
 1994
 81-90 1-2 p. 113-116
4 p.
 artikel
172 On reliable graphs with static routing plans Poguntke, Werner
 1994
 81-90 1-2 p. 137-146
10 p.
 artikel
173 On simplicial and co-simplicial vertices in graphs Hoàng, Chı́nh T
 2004
 81-90 1-2 p. 117-132
16 p.
 artikel
174 On some difficult linear programs coming from set partitioning Barahona, Francisco
 2002
 81-90 1-2 p. 3-11
9 p.
 artikel
175 On some properties of DNA graphs Blazewicz, J
 1999
 81-90 1-2 p. 1-19
19 p.
 artikel
176 On the approximation of the Minimum Disturbance p-Facility Location Problem Galbiati, Giulia
 2002
 81-90 1-2 p. 73-83
11 p.
 artikel
177 On the asymptotic existence of partial complex Hadamard matrices and related combinatorial objects de Launey, Warwick
 2000
 81-90 1-2 p. 37-45
9 p.
 artikel
178 On the Chvátal rank of polytopes in the 0/1 cube Bockmayr, Alexander
 1999
 81-90 1-2 p. 21-27
7 p.
 artikel
179 On the classification of extremal even formally self-dual codes of lengths 20 and 22 Fields, J.E.
 2001
 81-90 1-2 p. 75-86
12 p.
 artikel
180 On the complexity of coupled-task scheduling Orman, A.J.
 1997
 81-90 1-2 p. 141-154
14 p.
 artikel
181 On the complexity of isoperimetric problems on trees Daneshgar, Amir
 2012
 81-90 1-2 p. 116-131
16 p.
 artikel
182 On the complexity of minimizing the number of late jobs in unit time open shop Kravchenko, Svetlana A.
 2000
 81-90 1-2 p. 127-132
6 p.
 artikel
183 On the convergence of generalized hill climbing algorithms Johnson, A.W.
 2002
 81-90 1-2 p. 37-57
21 p.
 artikel
184 On the equivalence problem of context-free and DT0L languages Honkala, Juha
 1999
 81-90 1-2 p. 147-149
3 p.
 artikel
185 On the fixed interval due-date scheduling problem Lee, Chung-yee
 1996
 81-90 1-2 p. 101-117
17 p.
 artikel
186 On the fixed parameter complexity of graph enumeration problems definable in monadic second-order logic Courcelle, B.
 2001
 81-90 1-2 p. 23-52
30 p.
 artikel
187 On the hardness of the minimum height decision tree problem Laber, Eduardo S.
 2004
 81-90 1-2 p. 209-212
4 p.
 artikel
188 On the log-concavity of sequences arising from integer bases Pitteloud, Philippe
 2004
 81-90 1-2 p. 153-175
23 p.
 artikel
189 On the orthogonal designs of order 24 Holzmann, W.H.
 2000
 81-90 1-2 p. 103-114
12 p.
 artikel
190 On the structure of Skipjack Knudsen, Lars
 2001
 81-90 1-2 p. 103-116
14 p.
 artikel
191 On the variance of the external path length in a symmetric digital trie Kirschenhofer, Peter
 1989
 81-90 1-2 p. 129-143
15 p.
 artikel
192 On the vertex ranking problem for trapezoid, circular-arc and other graphs Deogun, Jitender S
 1999
 81-90 1-2 p. 39-63
25 p.
 artikel
193 On the Zagreb indices equality Abdo, Hosam
 2012
 81-90 1-2 p. 1-8
8 p.
 artikel
194 Optimal embeddings of odd ladders into a hypercube Caha, R.
 2002
 81-90 1-2 p. 73-102
30 p.
 artikel
195 Optimally balancing assembly lines with different workstations Nicosia, Gaia
 2002
 81-90 1-2 p. 99-113
15 p.
 artikel
196 Optimal multiple message broadcasting in telephone-like communication systems Bar-Noy, Amotz
 2000
 81-90 1-2 p. 1-15
15 p.
 artikel
197 Optimal strategies for a fair betting game Klawe, Maria M.
 1979
 81-90 1-2 p. 105-115
11 p.
 artikel
198 Orthogonal double covers of general graphs Hartmann, Sven
 2004
 81-90 1-2 p. 107-116
10 p.
 artikel
199 Orthogonal double covers of K n,n by small graphs El-Shanawany, Ramadan
 2004
 81-90 1-2 p. 47-63
17 p.
 artikel
200 Page cuts for integer interval linear programming Armstrong, R.
 1979
 81-90 1-2 p. 1-14
14 p.
 artikel
201 Parallel algorithms for fractional and maximal independent sets in planar graphs Dadoun, N.
 1990
 81-90 1-2 p. 69-83
15 p.
 artikel
202 Parallel complexity of partitioning a planar graph into vertex-induced forests Zhi-Zhong, Chen
 1996
 81-90 1-2 p. 183-198
16 p.
 artikel
203 Parallel selection Azar, Yossi
 1990
 81-90 1-2 p. 49-58
10 p.
 artikel
204 Pareto-optimal patterns in logical analysis of data Hammer, Peter L.
 2004
 81-90 1-2 p. 79-102
24 p.
 artikel
205 Pattern minimisation in cutting stock problems McDiarmid, Colin
 1999
 81-90 1-2 p. 121-130
10 p.
 artikel
206 (P 5,diamond)-free graphs revisited: structure and linear time optimization Brandstädt, Andreas
 2004
 81-90 1-2 p. 13-27
15 p.
 artikel
207 Periodic network optimization with different arc frequencies Nachtigall, K.
 1996
 81-90 1-2 p. 1-17
17 p.
 artikel
208 Pfaffian orientations, 0–1 permanents, and even cycles in directed graphs Vazirani, Vijay V.
 1989
 81-90 1-2 p. 179-190
12 p.
 artikel
209 PLA folding in special graph classes Damaschke, Peter
 1994
 81-90 1-2 p. 63-74
12 p.
 artikel
210 Polyadic codes Brualdi, Richard A.
 1989
 81-90 1-2 p. 3-17
15 p.
 artikel
211 Polynomial approximation algorithms for the TSP and the QAP with a factorial domination number Gutin, Gregory
 2002
 81-90 1-2 p. 107-116
10 p.
 artikel
212 Polynomial approximation schemes and exact algorithms for optimum curve segmentation problems Minoux, M.
 2004
 81-90 1-2 p. 158-172
15 p.
 artikel
213 Precedence constrained scheduling to minimize sum of weighted completion times on a single machine Chekuri, Chandra
 1999
 81-90 1-2 p. 29-38
10 p.
 artikel
214 Preface Malucelli, Federico
 2002
 81-90 1-2 p. 1-2
2 p.
 artikel
215 Preface Hromkovič, Juraj
 2001
 81-90 1-2 p. 1-2
2 p.
 artikel
216 Preface Faigle, Ulrich
 1994
 81-90 1-2 p. 1-
1 p.
 artikel
217 Preface Ibaraki, T.
 1987
 81-90 1-2 p. 1-2
2 p.
 artikel
218 Preface Hell, Pavol
 1990
 81-90 1-2 p. 1-
1 p.
 artikel
219 Preface 1979
 81-90 1-2 p. v-
1 p.
 artikel
220 Preface Peled, Uri N.
 1989
 81-90 1-2 p. 1-
1 p.
 artikel
221 Preface Brandstädt, Andreas
 2004
 81-90 1-2 p. 1-
1 p.
 artikel
222 Probabilistic single processor scheduling Harms, Janelie J.
 1990
 81-90 1-2 p. 101-112
12 p.
 artikel
223 Radon transforms and packings Boguslavsky, Michael I.
 2001
 81-90 1-2 p. 3-22
20 p.
 artikel
224 Ramsey-remainder for convex sets and the Erdős–Szekeres theorem Károlyi, Gyula
 2001
 81-90 1-2 p. 163-175
13 p.
 artikel
225 Ramsey-type theorems Erdös, P.
 1989
 81-90 1-2 p. 37-52
16 p.
 artikel
226 Ranking the vertices of a complete multipartite paired comparison digraph Gutin, Gregory
 1996
 81-90 1-2 p. 75-82
8 p.
 artikel
227 Rearrangement of DNA fragments: a branch-and-cut algorithm Ferreira, C.E.
 2002
 81-90 1-2 p. 161-177
17 p.
 artikel
228 Recognizing quasi-triangulated graphs Spinrad, Jeremy P
 2004
 81-90 1-2 p. 203-213
11 p.
 artikel
229 Reconstruction of rooted trees from subtrees Ng, Meei Pyng
 1996
 81-90 1-2 p. 19-31
13 p.
 artikel
230 Regularity of splicing languages Pixton, Dennis
 1996
 81-90 1-2 p. 101-124
24 p.
 artikel
231 Remark on the dimer problem Sachs, Horst
 1994
 81-90 1-2 p. 171-179
9 p.
 artikel
232 Remarks on Hamiltonian properties of powers of digraphs Schaar, Günter
 1994
 81-90 1-2 p. 181-186
6 p.
 artikel
233 Representation theory and invariant neural networks Wood, Jeffrey
 1996
 81-90 1-2 p. 33-60
28 p.
 artikel
234 Representing a concept lattice by a graph Berry, Anne
 2004
 81-90 1-2 p. 27-42
16 p.
 artikel
235 Representing graphs implicitly using almost optimal space Talamo, Maurizio
 2001
 81-90 1-2 p. 193-210
18 p.
 artikel
236 Representing orders on the plane by translating points and lines Nowakowski, Richard
 1990
 81-90 1-2 p. 147-156
10 p.
 artikel
237 Restrictions and preassignments in preemptive open shop scheduling De Werra, D.
 1996
 81-90 1-2 p. 169-188
20 p.
 artikel
238 Saturated systems of homogeneous boxes and the logical analysis of numerical data Hammer, P.L.
 2004
 81-90 1-2 p. 103-109
7 p.
 artikel
239 Scheduling an unbounded batching machine with job processing time compatibilities Bellanger, A.
 2012
 81-90 1-2 p. 15-23
9 p.
 artikel
240 Scheduling at Villa Vigoni Möhring, Rolf H.
 1997
 81-90 1-2 p. 1-3
3 p.
 artikel
241 Scheduling with batching: two job types Hochbaum, Dorit S.
 1997
 81-90 1-2 p. 99-114
16 p.
 artikel
242 Scheduling with forbidden sets Schäffter, Markus W.
 1997
 81-90 1-2 p. 155-166
12 p.
 artikel
243 Separability by two lines and by nearly straight polygonal chains Hurtado, Ferran
 2004
 81-90 1-2 p. 110-122
13 p.
 artikel
244 Separating objects in the plane by wedges and strips Hurtado, Ferran
 2001
 81-90 1-2 p. 109-138
30 p.
 artikel
245 Sets in ℤ n with distinct sums of pairs Haanpää, Harri
 2004
 81-90 1-2 p. 99-106
8 p.
 artikel
246 Short trees in polygons Winter, Pawel
 2002
 81-90 1-2 p. 55-72
18 p.
 artikel
247 Simplified existence theorems for (g,f)-factors Anstee, R.P.
 1990
 81-90 1-2 p. 29-38
10 p.
 artikel
248 Some Cayley graphs for simple groups Kantor, W.M.
 1989
 81-90 1-2 p. 99-104
6 p.
 artikel
249 Some connections between learning and optimization Anthony, Martin
 2004
 81-90 1-2 p. 17-26
10 p.
 artikel
250 Some extremal properties of the degree distance of a graph Tomescu, Ioan
 1999
 81-90 1-2 p. 159-163
5 p.
 artikel
251 Some models for scheduling parallel programs with communication delays Bampis, Evripidis
 1997
 81-90 1-2 p. 5-24
20 p.
 artikel
252 Some results about normal forms for functional dependency in the relational datamodel Demetrovics, János
 1996
 81-90 1-2 p. 61-74
14 p.
 artikel
253 Sparsest cuts and bottlenecks in graphs Matula, David W.
 1990
 81-90 1-2 p. 113-123
11 p.
 artikel
254 splitting number is NP-complete Faria, L.
 2001
 81-90 1-2 p. 65-83
19 p.
 artikel
255 Stable matchings with couples Aldershof, Brian
 1996
 81-90 1-2 p. 203-207
5 p.
 artikel
256 Strengthened semidefinite relaxations via a second lifting for the Max-Cut problem Anjos, Miguel F.
 2002
 81-90 1-2 p. 79-106
28 p.
 artikel
257 Structure of i-components of perfect binary codes Solov'eva, F.I.
 2001
 81-90 1-2 p. 189-197
9 p.
 artikel
258 Subgraphs, closures and hamiltonicity Broersma, H.J.
 1994
 81-90 1-2 p. 39-46
8 p.
 artikel
259 Super-simple (v,5,2)-designs O.F. Gronau, Hans-Dietrich
 2004
 81-90 1-2 p. 65-77
13 p.
 artikel
260 Sweeps, arrangements and signotopes Felsner, Stefan
 2001
 81-90 1-2 p. 67-94
28 p.
 artikel
261 Tabu search and finite convergence Glover, Fred
 2002
 81-90 1-2 p. 3-36
34 p.
 artikel
262 The algebraic representation of partial functions Wesselkamper, T.C.
 1979
 81-90 1-2 p. 137-142
6 p.
 artikel
263 The algorithmic complexity of minus domination in graphs Dunbar, Jean
 1996
 81-90 1-2 p. 73-84
12 p.
 artikel
264 The bisection width and the isoperimetric number of arrays Cemil Azizoğlu, M
 2004
 81-90 1-2 p. 3-12
10 p.
 artikel
265 The Clar covering polynomial of hexagonal systems I Zhang, Heping
 1996
 81-90 1-2 p. 147-167
21 p.
 artikel
266 The complexity of regular subgraph recognition Cheah, F.
 1990
 81-90 1-2 p. 59-68
10 p.
 artikel
267 The degree of functions and weights in linear codes Guritman, Sugi
 2001
 81-90 1-2 p. 87-102
16 p.
 artikel
268 The Kirchhoff indices of join networks Bendito, Enrique
 2012
 81-90 1-2 p. 24-37
14 p.
 artikel
269 The MIN PFS problem and piecewise linear model estimation Amaldi, Edoardo
 2002
 81-90 1-2 p. 115-143
29 p.
 artikel
270 The mixed postman problem Kappauf, Charles H.
 1979
 81-90 1-2 p. 89-103
15 p.
 artikel
271 The number of independent sets of unicyclic graphs with given matching number Chen, Gong
 2012
 81-90 1-2 p. 108-115
8 p.
 artikel
272 The principal partition of a pair of graphs and its applications Ozawa, Takao
 1987
 81-90 1-2 p. 163-186
24 p.
 artikel
273 The Steiner ratio of high-dimensional Banach–Minkowski spaces Cieslik, Dietmar
 2004
 81-90 1-2 p. 29-34
6 p.
 artikel
274 Three value TSP and linkages with the three value linear spanning 2-forests Benvenuti, Daniel K.
 2012
 81-90 1-2 p. 38-52
15 p.
 artikel
275 Tighter representations for set partitioning problems Sherali, Hanif D.
 1996
 81-90 1-2 p. 153-167
15 p.
 artikel
276 Total domination in inflated graphs Henning, Michael A.
 2012
 81-90 1-2 p. 164-169
6 p.
 artikel
277 Tree spanners in planar graphs Fekete, Sándor P.
 2001
 81-90 1-2 p. 85-103
19 p.
 artikel
278 Two classes of ternary codes and their weight distributions Ding, Cunsheng
 2001
 81-90 1-2 p. 37-53
17 p.
 artikel
279 Two machine mixed shop scheduling problem with controllable machine speeds Ishii, Hiroaki
 1987
 81-90 1-2 p. 29-38
10 p.
 artikel
280 Uniform emulations of Cartesian-product and Cayley graphs Barth, D.
 2002
 81-90 1-2 p. 37-54
18 p.
 artikel
281 Unital designs in planes of order 16 Stoichev, Stoicho D.
 2000
 81-90 1-2 p. 151-158
8 p.
 artikel
282 Universal sequences for complete graphs Alon, N.
 1990
 81-90 1-2 p. 25-28
4 p.
 artikel
283 Upgrading bottleneck constrained forests Krumke, S.O.
 2001
 81-90 1-2 p. 129-142
14 p.
 artikel
284 Upper bounds for covering arrays by tabu search Nurmela, Kari J.
 2004
 81-90 1-2 p. 143-152
10 p.
 artikel
285 Variable neighborhood search for the degree-constrained minimum spanning tree problem Ribeiro, Celso C.
 2002
 81-90 1-2 p. 43-54
12 p.
 artikel
286 Vertex-symmetric generalized Moore graphs Sampels, Michael
 2004
 81-90 1-2 p. 195-202
8 p.
 artikel
                             286 gevonden resultaten
 
 Koninklijke Bibliotheek - Nationale Bibliotheek van Nederland