Digitale Bibliotheek
Sluiten Bladeren door artikelen uit een tijdschrift
 
   volgende >>
     Tijdschrift beschrijving
       Alle jaargangen van het bijbehorende tijdschrift
         Alle afleveringen van het bijbehorende jaargang
                                       Alle artikelen van de bijbehorende aflevering
 
                             1210 gevonden resultaten
nr titel auteur tijdschrift jaar jaarg. afl. pagina('s) type
1 A 3/2-approximation algorithm for two-machine flow-shop sequencing subject to release dates Kashyrskikh, K.N.
2001
41-50 1-3 p. 255-271
17 p.
artikel
2 A branch and bound algorithm for a single-machine scheduling problem with positive and negative time-lags Brucker, Peter
1999
41-50 1-3 p. 77-99
23 p.
artikel
3 A branch and bound algorithm for the job-shop scheduling problem Brucker, Peter
1994
41-50 1-3 p. 107-127
21 p.
artikel
4 A branch & bound algorithm for the open-shop problem Brucker, Peter
1997
41-50 1-3 p. 43-59
17 p.
artikel
5 A brief survey of perfect Mendelsohn packing and covering designs Bennett, F.E.
1999
41-50 1-3 p. 73-81
9 p.
artikel
6 Absolute reflexive retracts and absolute bipartite retracts Bandelt, Hans-Jürgen
1993
41-50 1-3 p. 9-20
12 p.
artikel
7 A characterization of signed hypergraphs and its applications to VLSI via minimization and logic synthesis Shi, C.-J
1999
41-50 1-3 p. 223-243
21 p.
artikel
8 A characterization of Thompson digraphs Giammarresi, Dora
2004
41-50 1-3 p. 317-337
21 p.
artikel
9 A-classification of idempotent functions of many-valued logic Marchenkov, S.S.
2004
41-50 1-3 p. 183-203
21 p.
artikel
10 A class of greedy algorithms for the generalized assignment problem Romeijn, H.Edwin
2000
41-50 1-3 p. 209-235
27 p.
artikel
11 A-closed classes of idempotent functions of many-valued logic definable by binary relations Marchenkov, S.S.
2001
41-50 1-3 p. 203-225
23 p.
artikel
12 A coloring problem on the n-cube Kim, Dongsoo S.
2000
41-50 1-3 p. 307-311
5 p.
artikel
13 A combinatorial problem in database security Horak, Peter
1999
41-50 1-3 p. 119-126
8 p.
artikel
14 A comparison of Steiner tree relaxations Polzin, Tobias
2001
41-50 1-3 p. 241-261
21 p.
artikel
15 A constructive proof for the induction of M-convex functions through networks Shioura, A.
1998
41-50 1-3 p. 271-278
8 p.
artikel
16 A coordinate ascent approach to tomographic reconstruction of label images from a few projections Liao, Hstau Y.
2005
41-50 1-3 p. 184-197
14 p.
artikel
17 Acyclic colouring of 1-planar graphs Borodin, O.V.
2001
41-50 1-3 p. 29-41
13 p.
artikel
18 Adaptive memory search for Boolean optimization problems Hvattum, Lars M.
2004
41-50 1-3 p. 99-109
11 p.
artikel
19 A decomposability index in logical analysis of data Ono, Hirotaka
2004
41-50 1-3 p. 165-180
16 p.
artikel
20 A decomposition algorithm for network reliability evaluation Carlier, Jacques
1996
41-50 1-3 p. 141-156
16 p.
artikel
21 A digital analogue of the Jordan curve theorem Šlapal, J
2004
41-50 1-3 p. 231-251
21 p.
artikel
22 A distributed algorithm to find k-dominating sets Penso, Lucia D
2004
41-50 1-3 p. 243-253
11 p.
artikel
23 Adjacency on the constrained assignment problem Alfakih, Abdo Y.
1998
41-50 1-3 p. 269-274
6 p.
artikel
24 A 3D 6-subiteration curve thinning algorithm based on P-simple points Lohou, Christophe
2005
41-50 1-3 p. 198-228
31 p.
artikel
25 A 3D 12-subiteration thinning algorithm based on P-simple points Lohou, Christophe
2004
41-50 1-3 p. 171-195
25 p.
artikel
26 A duality based algorithm for multileaf collimator field segmentation with interleaf collision constraint Kalinowski, Thomas
2005
41-50 1-3 p. 52-88
37 p.
artikel
27 A family of restricted subadditive recursions Wallace, Roger J.
2002
41-50 1-3 p. 127-139
13 p.
artikel
28 A fast algorithm for strongly correlated knapsack problems Pisinger, David
1998
41-50 1-3 p. 197-212
16 p.
artikel
29 A fast algorithm for the maximum clique problem Östergård, Patric R.J.
2002
41-50 1-3 p. 197-207
11 p.
artikel
30 A fast and simple Steiner routing heuristic Borah, Manjit
1999
41-50 1-3 p. 51-67
17 p.
artikel
31 A faster 2-approximation algorithm for the minmax p-traveling salesmen problem on a tree Nagamochi, Hiroshi
2004
41-50 1-3 p. 103-114
12 p.
artikel
32 A fast parallel algorithm to recognize P4-sparse graphs Lin, Rong
1998
41-50 1-3 p. 191-215
25 p.
artikel
33 A framework for the greedy algorithm Vince, A.
2002
41-50 1-3 p. 247-260
14 p.
artikel
34 A graph theoretical approach for the yield enhancement of reconfigurable VLSI/WSI arrays Narasimhan, Jagannathan
1999
41-50 1-3 p. 195-221
27 p.
artikel
35 A graph-theoretic result for a model of neural computation Gerbessiotis, Alexandros V.
1998
41-50 1-3 p. 257-262
6 p.
artikel
36 A greedy algorithm for maximizing a linear objective function Shenmaier, V.V.
2004
41-50 1-3 p. 267-279
13 p.
artikel
37 A greedy algorithm for some classes of integer programs Shenmaier, V.V.
2003
41-50 1-3 p. 93-101
9 p.
artikel
38 A group testing problem for graphs with several defective edges Johann, Petra
2002
41-50 1-3 p. 99-108
10 p.
artikel
39 A guide to the graph labeling zoo Gallian, Joseph A.
1994
41-50 1-3 p. 213-229
17 p.
artikel
40 A kinetic approach to the random f-graph process. Paths, cycles and components Balińska, Krystyna T.
1996
41-50 1-3 p. 13-25
13 p.
artikel
41 A large set of non-Hamiltonian graphs Katona, Gyula Y.
2001
41-50 1-3 p. 99-115
17 p.
artikel
42 Algebraic-geometric codes and asymptotic problems Tsfasman, Michael A.
1991
41-50 1-3 p. 241-256
16 p.
artikel
43 Algorithm for recognizing Cartesian graph bundles Zmazek, Blaž
2002
41-50 1-3 p. 275-302
28 p.
artikel
44 Algorithms and obstructions for linear-width and related search parameters Thilikos, Dimitrios M.
2000
41-50 1-3 p. 239-271
33 p.
artikel
45 Algorithms for graphs with small octopus Fomin, Fedor V.
2004
41-50 1-3 p. 105-128
24 p.
artikel
46 Algorithms for on-line bin-packing problems with cardinality constraints Babel, Luitpold
2004
41-50 1-3 p. 238-251
14 p.
artikel
47 Algorithms for sequential generation of combinatorial structures Bergeron, F.
1989
41-50 1-3 p. 29-35
7 p.
artikel
48 Algorithms for the fixed linear crossing number problem Cimikowski, Robert
2002
41-50 1-3 p. 93-115
23 p.
artikel
49 Alignment networks and electrical networks Vingron, Martin
1996
41-50 1-3 p. 297-309
13 p.
artikel
50 A linear algorithm for 2-bend embeddings of planar graphs in the two-dimensional grid Yanpei Liu,
1998
41-50 1-3 p. 69-91
23 p.
artikel
51 A linear algorithm for the group path problem on chordal graphs Arikati, Srinivasa R.
1993
41-50 1-3 p. 185-190
6 p.
artikel
52 A linear time algorithm for minimum fill-in and treewidth for distance hereditary graphs Broersma, H.J.
2000
41-50 1-3 p. 367-400
34 p.
artikel
53 A linear-time algorithm to solve the Sports League Scheduling Problem (prob026 of CSPLib) Hamiez, Jean-Philippe
2004
41-50 1-3 p. 252-265
14 p.
artikel
54 Almost diameter of a house-hole-free graph in linear time via LexBFS Dragan, Feodor F.
1999
41-50 1-3 p. 223-239
17 p.
artikel
55 A localization and reformulation discrete programming approach for the rectilinear distance location-allocation problem Sherali, Hanif D.
1994
41-50 1-3 p. 357-378
22 p.
artikel
56 Alternating 6-cycles in perfect matchings of graphs representing condensed benzenoid hydrocarbons Balaban, Alexandru T.
1988
41-50 1-3 p. 5-16
12 p.
artikel
57 Amenable colorings Mahadev, N.V.R.
1997
41-50 1-3 p. 225-238
14 p.
artikel
58 A minimum broadcast graph on 63 vertices Labahn, Roger
1994
41-50 1-3 p. 247-250
4 p.
artikel
59 A min-max relation for K 3-covers in graphs noncontractible to K 5 e Mahjoub, Ali Ridha
1995
41-50 1-3 p. 209-219
11 p.
artikel
60 A multi-phase constructive heuristic for the vehicle routing problem with multiple trips Petch, R.J
2003
41-50 1-3 p. 69-92
24 p.
artikel
61 An algebraic point of view of the data structures of database systems Simovici, Dan A.
1989
41-50 1-3 p. 247-260
14 p.
artikel
62 An algorithm for 1-bend embeddings of plane graphs in the two-dimensional grid Morgana, Aurora
2004
41-50 1-3 p. 225-241
17 p.
artikel
63 An algorithm for the reconstruction of discrete sets from two projections in presence of absorption Barcucci, Elena
2005
41-50 1-3 p. 21-35
15 p.
artikel
64 Analyzing and visualizing sequence and distance data using SplitsTree Dress, A.
1996
41-50 1-3 p. 95-109
15 p.
artikel
65 An analytic study of the phase transition line in local sequence alignment with gaps Bundschuh, R.
2000
41-50 1-3 p. 113-142
30 p.
artikel
66 An approach for the estimation of the precision of a real object from its digitization Feschet, Fabien
2004
41-50 1-3 p. 51-63
13 p.
artikel
67 An approximation guarantee of the greedy descent algorithm for minimizing a supermodular set function Il'ev, Victor P.
2001
41-50 1-3 p. 131-146
16 p.
artikel
68 An approximation result for a periodic allocation problem Confessore, Giuseppe
2001
41-50 1-3 p. 53-72
20 p.
artikel
69 An approximation result for the interval coloring problem on claw-free chordal graphs Confessore, Giuseppe
2002
41-50 1-3 p. 73-90
18 p.
artikel
70 An approximation scheme for strip packing of rectangles with bounded dimensions de La Vega, W.Fernandez
1998
41-50 1-3 p. 93-101
9 p.
artikel
71 An efficient algorithm for the uncapacitated facility location problem with totally balanced matrix Beresnev, V.L.
2001
41-50 1-3 p. 13-22
10 p.
artikel
72 An efficient preprocessing procedure for the multidimensional 0–1 knapsack problem Freville, Arnaud
1994
41-50 1-3 p. 189-212
24 p.
artikel
73 An elementary algorithm for digital arc segmentation Coeurjolly, D.
2004
41-50 1-3 p. 31-50
20 p.
artikel
74 An elementary digital plane recognition algorithm Gerard, Y.
2005
41-50 1-3 p. 169-183
15 p.
artikel
75 An evolutionary algorithm for discrete tomography Batenburg, K.J.
2005
41-50 1-3 p. 36-54
19 p.
artikel
76 A new algorithm for optimal multileaf collimator field segmentation Engel, Konrad
2005
41-50 1-3 p. 35-51
17 p.
artikel
77 A new algorithm for the propositional satisfiability problem Gallo, G.
1995
41-50 1-3 p. 159-179
21 p.
artikel
78 A new approach to solving three combinatorial enumeration problems on planar graphs Colbourn, Charles J.
1995
41-50 1-3 p. 119-129
11 p.
artikel
79 A new color change to improve the coloring of a graph Berge, C.
1989
41-50 1-3 p. 25-28
4 p.
artikel
80 A new Greedoid: the family of local maximum stable sets of a forest Levit, Vadim E.
2002
41-50 1-3 p. 91-101
11 p.
artikel
81 A new method for solving algebraic systems of positive dimension Lazard, D.
1991
41-50 1-3 p. 147-160
14 p.
artikel
82 A new sufficient condition for a digraph to be Hamiltonian Bang-Jensen, Jorgen
1999
41-50 1-3 p. 61-72
12 p.
artikel
83 A new unifying heuristic algorithm for the undirected minimum cut problems using minimum range cut algorithms Dai, Yang
1996
41-50 1-3 p. 167-190
24 p.
artikel
84 An exact algorithm for the 0–1 collapsing knapsack problem Fayard, Didier
1994
41-50 1-3 p. 175-187
13 p.
artikel
85 An exact method for minimizing the makespan of an application processed on a master slave bus oriented multiprocessor system Boufflet, J.P.
1999
41-50 1-3 p. 51-76
26 p.
artikel
86 A nice class for the vertex packing problem Bertolazzi, Paola
1997
41-50 1-3 p. 3-19
17 p.
artikel
87 An improved algorithm for the k-source maximum eccentricity spanning trees Ye Wu, Bang
2004
41-50 1-3 p. 342-350
9 p.
artikel
88 An improved tabu search approach for solving the job shop scheduling problem with tooling constraints Hertz, Alain
1996
41-50 1-3 p. 319-345
27 p.
artikel
89 An inductive definition of cubic toroidal maps Harmuth, Thomas
2002
41-50 1-3 p. 117-140
24 p.
artikel
90 An infinite sequence of non-realizable weavings Repovš, Dušan
2005
41-50 1-3 p. 256-260
5 p.
artikel
91 An introduction to randomized algorithms Karp, Richard M.
1991
41-50 1-3 p. 165-201
37 p.
artikel
92 Annealed replication: a new heuristic for the maximum clique problem Bomze, Immanuel M.
2002
41-50 1-3 p. 27-49
23 p.
artikel
93 An O(nm)-time algorithm for computing the dual of a regular Boolean function Peled, Uri N.
1994
41-50 1-3 p. 309-323
15 p.
artikel
94 An optimal parallel algorithm for node ranking of cographs Chuan-Ming, Liu
1998
41-50 1-3 p. 187-201
15 p.
artikel
95 An orientation theorem with parity conditions Frank, András
2001
41-50 1-3 p. 37-47
11 p.
artikel
96 A note on biased and non-biased games Lu, Xiaoyun
1995
41-50 1-3 p. 285-291
7 p.
artikel
97 A note on formulations for the A-partition problem on hypergraphs Chopra, Sunil
1999
41-50 1-3 p. 115-133
19 p.
artikel
98 A note on graphs which have upper irredundance equal to independence Jacobson, Michael S.
1993
41-50 1-3 p. 91-97
7 p.
artikel
99 A note on graphs with large girth and small minus domination number Lee, Jaeun
1999
41-50 1-3 p. 299-303
5 p.
artikel
100 A note on minimum degree conditions for supereulerian graphs Broersma, H.J.
2002
41-50 1-3 p. 35-43
9 p.
artikel
101 A note on perfectly orderable graphs Hoàng, Chinh T.
1996
41-50 1-3 p. 379-386
8 p.
artikel
102 A note on reconfiguring tree linkages: trees can lock Biedl, Therese
2002
41-50 1-3 p. 293-297
5 p.
artikel
103 A note on spanning local tournaments in locally semicomplete digraphs Huang, Jing
1998
41-50 1-3 p. 277-279
3 p.
artikel
104 A note on the covering radius of optimum codes Bhandari, M.C.
1991
41-50 1-3 p. 3-9
7 p.
artikel
105 A note on tolerance graph recognition Hayward, Ryan B.
2004
41-50 1-3 p. 307-311
5 p.
artikel
106 A note on transitive orientations with maximum sets of sources and sinks de Figueiredo, Celina M.H.
2002
41-50 1-3 p. 91-95
5 p.
artikel
107 A novel giant-subgraph phase-transition in sparse random k-partite graphs Voll, Ulrich
2005
41-50 1-3 p. 153-181
29 p.
artikel
108 Anti-commutative languages and n-codes Ito, M.
1989
41-50 1-3 p. 187-196
10 p.
artikel
109 Antidirected hamiltonian paths between specified vertices of a tournament Hell, P.
2002
41-50 1-3 p. 87-98
12 p.
artikel
110 Antigenesis: A cascade-theoretical analysis of the size distributions of antigen—antibody complexes Gross, Robert
1988
41-50 1-3 p. 177-194
18 p.
artikel
111 An upper bound for the minimum number of queens covering the n×n chessboard Burger, A.P.
2002
41-50 1-3 p. 51-60
10 p.
artikel
112 An upper bound for the size of the largest antichain in the poset of partitions of an integer Rodney Canfield, E.
1999
41-50 1-3 p. 169-180
12 p.
artikel
113 A parametric critical path problem and an application for cyclic scheduling Levner, Eugene
1998
41-50 1-3 p. 149-158
10 p.
artikel
114 A polyhedral approach for a constrained quadratic 0–1 problem Faye, Alain
2005
41-50 1-3 p. 87-100
14 p.
artikel
115 A polyhedral approach to an integer multicommodity flow problem Brunetta, Lorenzo
2000
41-50 1-3 p. 13-36
24 p.
artikel
116 A polyhedral approach to sequence alignment problems Kececioglu, John D.
2000
41-50 1-3 p. 143-186
44 p.
artikel
117 A polynomial algorithm for the parity path problem on perfectly orientable graphs Arikati, Srinivasa R.
1996
41-50 1-3 p. 5-20
16 p.
artikel
118 A polynomial time algorithm for strong edge coloring of partial k-trees Salavatipour, Mohammad R.
2004
41-50 1-3 p. 285-291
7 p.
artikel
119 A potential reduction approach to the frequency assignment problem Warners, J.P.
1997
41-50 1-3 p. 251-282
32 p.
artikel
120 Applications of combinatorics to statics—rigidity of grids Radics, Norbert
2002
41-50 1-3 p. 473-485
13 p.
artikel
121 Approximate constrained bipartite edge coloring Caragiannis, Ioannis
2004
41-50 1-3 p. 54-61
8 p.
artikel
122 Approximating a generalization of MAX 2SAT and MIN 2SAT Hochbaum, Dorit S.
2000
41-50 1-3 p. 41-59
19 p.
artikel
123 Approximation algorithms for minimum tree partition Guttmann-Beck, Nili
1998
41-50 1-3 p. 117-137
21 p.
artikel
124 Approximation algorithms for min-sum p-clustering Guttmann-Beck, Nili
1998
41-50 1-3 p. 125-142
18 p.
artikel
125 Approximation algorithms for multi-dimensional assignment problems with decomposable costs Bandelt, Hans-Jürgen
1994
41-50 1-3 p. 25-50
26 p.
artikel
126 Approximation algorithms for multi-index transportation problems with decomposable costs Queyranne, M.
1997
41-50 1-3 p. 239-253
15 p.
artikel
127 Approximation algorithms for multiple sequence alignment under a fixed evolutionary tree Ravi, R.
1998
41-50 1-3 p. 355-366
12 p.
artikel
128 Approximation algorithms for partitioning small items in unequal bins to minimize the total size Dell'Olmo, P.
1999
41-50 1-3 p. 181-191
11 p.
artikel
129 Approximation algorithms for the optimal p-source communication spanning tree Wu, Bang Ye
2004
41-50 1-3 p. 31-42
12 p.
artikel
130 Approximation algorithms for the shortest total path length spanning tree problem Wu, Bang Ye
2000
41-50 1-3 p. 273-289
17 p.
artikel
131 A probabilistic analysis of the multi-period single-sourcing problem Romeijn, H.Edwin
2001
41-50 1-3 p. 301-328
28 p.
artikel
132 A recognition algorithm for orders of interval dimension two Langley, Larry J.
1995
41-50 1-3 p. 257-266
10 p.
artikel
133 A relation between the knapsack and group knapsack problems Zhu, Nan
1998
41-50 1-3 p. 255-268
14 p.
artikel
134 A scheme for the synchronization of variable length codes Perkins, S.
2000
41-50 1-3 p. 231-245
15 p.
artikel
135 A semi-systolic decoder for the PDSC-73 error-correcting code Karplus, Kevin
1991
41-50 1-3 p. 109-128
20 p.
artikel
136 A sharp threshold for the renameable-Horn and the q-Horn properties Creignou, Nadia
2005
41-50 1-3 p. 48-57
10 p.
artikel
137 A simple algorithm to find the steps of double-loop networks Chi-Feng Chan, Robin
2002
41-50 1-3 p. 61-72
12 p.
artikel
138 A single-element extension of antimatroids Nakamura, Masataka
2002
41-50 1-3 p. 159-164
6 p.
artikel
139 A special case for subset interconnection designs Ding-Zhu, Du
1997
41-50 1-3 p. 51-60
10 p.
artikel
140 A strongly polynomial algorithm for the inverse shortest arborescence problem Zhiquan, Hu
1998
41-50 1-3 p. 135-154
20 p.
artikel
141 A strongly polynomial algorithm for the uniform balanced network flow problem Scutellá, Maria Grazia
1998
41-50 1-3 p. 123-131
9 p.
artikel
142 A study of maximum unit-circle caterpillars — tools for the study of the shape of adsorption patterns Harary, Frank
1996
41-50 1-3 p. 127-135
9 p.
artikel
143 A sufficient condition for all short cycles Brandt, Stephan
1997
41-50 1-3 p. 63-66
4 p.
artikel
144 A 2 2 3 superstring approximation algorithm Armen, Chris
1998
41-50 1-3 p. 29-57
29 p.
artikel
145 A supertree method for rooted trees Semple, Charles
2000
41-50 1-3 p. 147-158
12 p.
artikel
146 A survey of very large-scale neighborhood search techniques Ahuja, Ravindra K.
2002
41-50 1-3 p. 75-102
28 p.
artikel
147 A survey on maximum distance holey packings Yin, Jianxing
2002
41-50 1-3 p. 279-294
16 p.
artikel
148 Asymptotically large ( Δ , D ) -graphs Canale, Eduardo A.
2005
41-50 1-3 p. 89-108
20 p.
artikel
149 Asymptotic results on suborthogonal G → -decompositions of complete digraphs Hartmann, Sven
1999
41-50 1-3 p. 311-320
10 p.
artikel
150 A technique to find multiple motif occurrences in a biomolecular sequence Moeri, Nicolas
1999
41-50 1-3 p. 297-319
23 p.
artikel
151 AT-free graphs: linear bounds for the oriented diameter Fomin, Fedor V
2004
41-50 1-3 p. 135-148
14 p.
artikel
152 A type-B Tamari poset Sandman, Nirit
2004
41-50 1-3 p. 110-122
13 p.
artikel
153 A unified approach to word occurrence probabilities Régnier, Mireille
2000
41-50 1-3 p. 259-280
22 p.
artikel
154 Author index 2002
41-50 1-3 p. 579-580
2 p.
artikel
155 Author index 2002
41-50 1-3 p. 293-294
2 p.
artikel
156 Author index 2002
41-50 1-3 p. 317-318
2 p.
artikel
157 Author index 2002
41-50 1-3 p. 303-304
2 p.
artikel
158 Author index 2002
41-50 1-3 p. 141-
1 p.
artikel
159 Author index 1995
41-50 1-3 p. 291-292
2 p.
artikel
160 Author index 1998
41-50 1-3 p. 327-328
2 p.
artikel
161 Author index 1998
41-50 1-3 p. 397-398
2 p.
artikel
162 Author index 1998
41-50 1-3 p. 263-
1 p.
artikel
163 Author index 1998
41-50 1-3 p. 279-280
2 p.
artikel
164 Author index 1994
41-50 1-3 p. 337-338
2 p.
artikel
165 Author index 1997
41-50 1-3 p. 303-304
2 p.
artikel
166 Author index 1996
41-50 1-3 p. 229-230
2 p.
artikel
167 Author index 1996
41-50 1-3 p. 367-368
2 p.
artikel
168 Author index 1996
41-50 1-3 p. 441-442
2 p.
artikel
169 Author index 1991
41-50 1-3 p. 289-290
2 p.
artikel
170 Author index 1997
41-50 1-3 p. 255-
1 p.
artikel
171 Author index 1993
41-50 1-3 p. 311-312
2 p.
artikel
172 Author index 1994
41-50 1-3 p. 379-380
2 p.
artikel
173 Author index 1997
41-50 1-3 p. 285-286
2 p.
artikel
174 Author index 1998
41-50 1-3 p. 259-260
2 p.
artikel
175 Author index 1998
41-50 1-3 p. 287-
1 p.
artikel
176 Author index 1999
41-50 1-3 p. 257-
1 p.
artikel
177 Author index 1999
41-50 1-3 p. 337-338
2 p.
artikel
178 Author index 1999
41-50 1-3 p. 313-314
2 p.
artikel
179 Author index 1988
41-50 1-3 p. 415-416
2 p.
artikel
180 Author index 1989
41-50 1-3 p. 261-
1 p.
artikel
181 Author indexory 1998
41-50 1-3 p. 285-286
2 p.
artikel
182 Author index to volume 2003
41-50 1-3 p. 123-
1 p.
artikel
183 Author Index to Volume 117 (2002) 2002
41-50 1-3 p. 299-300
2 p.
artikel
184 Author index to volume 2003
41-50 1-3 p. 217-218
2 p.
artikel
185 Author Index to Volume 112 (2001) 2001
41-50 1-3 p. 329-
1 p.
artikel
186 Author Index to Volume 114 (2001) 2001
41-50 1-3 p. 313-
1 p.
artikel
187 Author index to volume 2004
41-50 1-3 p. 361-362
2 p.
artikel
188 Author index to volume 2004
41-50 1-3 p. 309-
1 p.
artikel
189 Author index to volume 2004
41-50 1-3 p. 307-308
2 p.
artikel
190 Author index to volume 2004
41-50 1-3 p. 207-
1 p.
artikel
191 Author index to volume 2004
41-50 1-3 p. 281-
1 p.
artikel
192 Author index to volume 2004
41-50 1-3 p. 379-380
2 p.
artikel
193 Author index to volume 2004
41-50 1-3 p. 295-296
2 p.
artikel
194 Author index to volume 149 2005
41-50 1-3 p. 219-
1 p.
artikel
195 Author index to volume 150 2005
41-50 1-3 p. 280-281
2 p.
artikel
196 Author index to volume 153 2005
41-50 1-3 p. 182-
1 p.
artikel
197 Author index to volume 151 2005
41-50 1-3 p. 244-245
2 p.
artikel
198 Author index to volume 152 2005
41-50 1-3 p. 273-274
2 p.
artikel
199 Author index volume 60 (1995) 1995
41-50 1-3 p. 389-390
2 p.
artikel
200 Automated estimation of the parameters of Gibbs priors to be used in binary tomography Liao, Hstau Y
2004
41-50 1-3 p. 149-170
22 p.
artikel
201 A variant of the permutation flow shop model with variable processing times Finke, G.
1997
41-50 1-3 p. 123-140
18 p.
artikel
202 Average case complexity for finite Boolean functions Chashkin, A.V.
2001
41-50 1-3 p. 43-59
17 p.
artikel
203 Average sizes of suffix trees and DAWGs Blumer, Anselm
1989
41-50 1-3 p. 37-45
9 p.
artikel
204 Average time of computing Boolean operators Chashkin, A.V.
2004
41-50 1-3 p. 41-54
14 p.
artikel
205 132-avoiding two-stack sortable permutations, Fibonacci numbers, and Pell numbers Egge, Eric S.
2004
41-50 1-3 p. 72-83
12 p.
artikel
206 Balancing problems in acyclic networks Boros, Endre
1994
41-50 1-3 p. 77-93
17 p.
artikel
207 Bandwidth and topological bandwidth of graphs with few P 4's Kloks, Ton
2001
41-50 1-3 p. 117-133
17 p.
artikel
208 Better approximations of non-Hamiltonian graphs Iwama, Kazuo
1998
41-50 1-3 p. 239-261
23 p.
artikel
209 Bichromatic P 4-composition schemes for perfect orderability Hayward, R.B.
2004
41-50 1-3 p. 161-183
23 p.
artikel
210 Biconvex graphs: ordering and algorithms Abbas, Nesrine
2000
41-50 1-3 p. 1-19
19 p.
artikel
211 Bidirected and unidirected capacity installation in telecommunication networks van Hoesel, Stan P.M
2003
41-50 1-3 p. 103-121
19 p.
artikel
212 Binomial-combinatorial properties of clar structures El-Basil, Sherif
1988
41-50 1-3 p. 145-156
12 p.
artikel
213 Bin-packing and matchings in threshold graphs Tinhofer, G.
1995
41-50 1-3 p. 279-289
11 p.
artikel
214 Biography of Martin Farber, 1951–1989 Hell, Pavol
1993
41-50 1-3 p. 5-7
3 p.
artikel
215 Bipartition constrained edge-splitting in directed graphs Gabow, Harold N.
2001
41-50 1-3 p. 49-62
14 p.
artikel
216 Bisection width of transposition graphs Stacho, Ladislav
1998
41-50 1-3 p. 221-235
15 p.
artikel
217 Block coded modulation and concatenated coding schemes for error control on fading channels Vucetic, Branka
1991
41-50 1-3 p. 257-269
13 p.
artikel
218 Block duplicate graphs and a hierarchy of chordal graphs Golumbic, M.C
2002
41-50 1-3 p. 67-71
5 p.
artikel
219 Book announcements 1997
41-50 1-3 p. 299-302
4 p.
artikel
220 Book announcements 2004
41-50 1-3 p. 273-275
3 p.
artikel
221 Book announcements 2005
41-50 1-3 p. 278-279
2 p.
artikel
222 Boole's conditions of possible experience and reasoning under uncertainty Hansen, Pierre
1995
41-50 1-3 p. 181-193
13 p.
artikel
223 Bounded-call broadcasting Farley, Arthur M.
1994
41-50 1-3 p. 37-53
17 p.
artikel
224 Bounded discrete representations of interval orders Isaak, Garth
1993
41-50 1-3 p. 157-183
27 p.
artikel
225 Bounds and fast approximation algorithms for binary quadratic optimization problems with application to MAX 2SAT van Maaren, Hans
2000
41-50 1-3 p. 225-239
15 p.
artikel
226 Bounds for optimal coverings de A. Moreira, Carlos Gustavo T.
2004
41-50 1-3 p. 263-276
14 p.
artikel
227 Bounds for probabilistic integer programming problems Dentcheva, Darinka
2002
41-50 1-3 p. 55-65
11 p.
artikel
228 Branching in graphs and molecules Bertz, Steven H
1988
41-50 1-3 p. 65-83
19 p.
artikel
229 Brick tabloids and the connection matrices between bases of symmetric functions Eg̃eciog̃lu, Ömer
1991
41-50 1-3 p. 107-120
14 p.
artikel
230 Broadcasting and gossiping on de Bruijn, shuffle-exchange and similar networks Perennes, Stéphane
1998
41-50 1-3 p. 247-262
16 p.
artikel
231 Broadcasting in butterfly and deBruijn networks Klasing, Ralf
1994
41-50 1-3 p. 183-197
15 p.
artikel
232 Broadcasting in cycle prefix digraphs Comellas, F.
1998
41-50 1-3 p. 31-39
9 p.
artikel
233 Broadcasting in m-dimensional grid graphs with a given neighborhood template Djelloul, Selma
1994
41-50 1-3 p. 25-36
12 p.
artikel
234 Broadcasting in random graphs Gerbessiotis, Alexandros V.
1994
41-50 1-3 p. 149-170
22 p.
artikel
235 Broadcasting multiple messages in a grid Van Scoy, Frances L.
1994
41-50 1-3 p. 321-336
16 p.
artikel
236 Broadcasting on [0, L] Ravishankar, Krishnamurthi
1994
41-50 1-3 p. 299-319
21 p.
artikel
237 Broadcasting on recursively decomposable Cayley graphs GowriSankaran, Chandra
1994
41-50 1-3 p. 171-182
12 p.
artikel
238 Broadcasting with linearly bounded transmission faults Ga̧sieniec, L.
1998
41-50 1-3 p. 121-133
13 p.
artikel
239 Broadcast time and connectivity Lichiardopol, Nicolas
2004
41-50 1-3 p. 359-363
5 p.
artikel
240 Bundle-based relaxation methods for multicommodity capacitated fixed charge network design Crainic, Teodor Gabriel
2001
41-50 1-3 p. 73-99
27 p.
artikel
241 Bypaths in tournaments Guo, Yubao
1997
41-50 1-3 p. 127-135
9 p.
artikel
242 Call for papers 1999
41-50 1-3 p. ix-
1 p.
artikel
243 Camel sequences and quadratic residues Gurvich, V.A.
2002
41-50 1-3 p. 73-89
17 p.
artikel
244 Cardinality constrained Boolean quadratic polytope Mehrotra, Anuj
1997
41-50 1-3 p. 137-154
18 p.
artikel
245 Cardinality-restricted chains and antichains in partially ordered sets Shum, Henry
1996
41-50 1-3 p. 421-439
19 p.
artikel
246 Cartels via the modiclus Rosenmüller, Joachim
2004
41-50 1-3 p. 263-302
40 p.
artikel
247 Cartesian products of graphs as subgraphs of de Bruijn graphs of dimension at least three Andreae, Thomas
1997
41-50 1-3 p. 3-34
32 p.
artikel
248 Cellular telephone networks and random maps in hypergraphs Halpert, Ariel
2000
41-50 1-3 p. 111-126
16 p.
artikel
249 Centers of sets of pixels Khuller, Samir
2000
41-50 1-3 p. 297-306
10 p.
artikel
250 Characterizations and algorithmic applications of chordal graph embeddings Parra, Andreas
1997
41-50 1-3 p. 171-188
18 p.
artikel
251 Characterizations of closed classes of Boolean functions in terms of forbidden subfunctions and Post classes Zverovich, Igor’ E.
2005
41-50 1-3 p. 200-218
19 p.
artikel
252 Characterizations of some classes of strong sign nonsingular digraphs Shao, Jia-Yu
2000
41-50 1-3 p. 159-172
14 p.
artikel
253 Characterizing and edge-colouring split-indifference graphs Carmen Ortiz, Z.
1998
41-50 1-3 p. 209-217
9 p.
artikel
254 Characterizing convexity of games using marginal vectors van Velzen, Bas
2004
41-50 1-3 p. 298-306
9 p.
artikel
255 Chemical graphs enumeration and chemical reactivity: thermodynamic and kinetic considerations Slanina, Zdeněk
1988
41-50 1-3 p. 349-365
17 p.
artikel
256 Chemistry and discrete mathematics Read, Ronald C.
1996
41-50 1-3 p. 1-4
4 p.
artikel
257 Chordality and 2-factors in tough graphs Bauer, D.
2000
41-50 1-3 p. 323-329
7 p.
artikel
258 Chordal probe graphs Golumbic, Martin Charles
2004
41-50 1-3 p. 221-237
17 p.
artikel
259 Chromatic scheduling and frequency assignment de Werra, D.
1994
41-50 1-3 p. 165-174
10 p.
artikel
260 Circumscribing certain polygonal systems Cyvin, Sven J.
1996
41-50 1-3 p. 67-78
12 p.
artikel
261 Classes of quadratic assignment problem instances: isomorphism and difficulty measure using a statistical approach Maia de Abreu, Nair Maria
2002
41-50 1-3 p. 103-116
14 p.
artikel
262 Class Steiner trees and VLSI-design Ihler, Edmund
1999
41-50 1-3 p. 173-194
22 p.
artikel
263 Clique divergent clockwork graphs and partial orders Larrión, F
2004
41-50 1-3 p. 195-207
13 p.
artikel
264 Clique family inequalities for the stable set polytope of quasi-line graphs Oriolo, G.
2003
41-50 1-3 p. 185-201
17 p.
artikel
265 Cliques and extended triangles. A necessary condition for planar clique graphs Alcón, Liliana
2004
41-50 1-3 p. 3-17
15 p.
artikel
266 Clique tree generalization and new subclasses of chordal graphs Kumar, P.Sreenivasa
2002
41-50 1-3 p. 109-131
23 p.
artikel
267 Clustering bipartite and chordal graphs: Complexity, sequential and parallel algorithms Abbas, Nesrine
1999
41-50 1-3 p. 1-23
23 p.
artikel
268 Cluttered orderings for the complete bipartite graph Müller, Meinard
2005
41-50 1-3 p. 213-228
16 p.
artikel
269 Codes and matrices in studies on designs Hall Jr., Marshall
1989
41-50 1-3 p. 145-152
8 p.
artikel
270 Coding for write-unidirectional memories and conflict resolution Cohen, Gérard
1989
41-50 1-3 p. 103-114
12 p.
artikel
271 Coloring edges of self-complementary graphs Wojda, A.Paweł
1997
41-50 1-3 p. 279-284
6 p.
artikel
272 Coloring permutation graphs in parallel Nikolopoulos, Stavros D.
2002
41-50 1-3 p. 165-195
31 p.
artikel
273 Combination of decoding of error-correcting codes and equalization for channels with intersymbol interference Kohno, Ryuji
1991
41-50 1-3 p. 129-146
18 p.
artikel
274 Combinatoire des mots et étude quantitative de la sérialisabilité: Application à la concurrence d'accès à une base de données Arquès, D.
1989
41-50 1-3 p. 3-23
21 p.
artikel
275 Combinatorial characterization of hexagonal systems Javanovic, Antonije D.
1988
41-50 1-3 p. 259-270
12 p.
artikel
276 Combinatorial problems related to origin–destination matrices Boros, Endre
2001
41-50 1-3 p. 15-36
22 p.
artikel
277 Combinatorial properties of the family of maximum stable sets of a graph Levit, Vadim E.
2002
41-50 1-3 p. 149-161
13 p.
artikel
278 Combinatorics of RNA secondary structures Hofacker, Ivo L.
1998
41-50 1-3 p. 207-237
31 p.
artikel
279 Comparing the sizes of nondeterministic branching read-k-times programs Okol'nishnikova, E.A.
2004
41-50 1-3 p. 205-222
18 p.
artikel
280 Comparison of column generation models for channel assignment in cellular networks Jaumard, Brigitte
2001
41-50 1-3 p. 217-240
24 p.
artikel
281 Comparison of permanental bounds of (0, 1)-matrices Hwang, Suk-Geun
1998
41-50 1-3 p. 133-144
12 p.
artikel
282 Compatible Euler tours of Kn ∗∗ Verrall, H.
1998
41-50 1-3 p. 237-251
15 p.
artikel
283 Compatible Hamilton decompositions of directed wrapped butterfly graphs Verrall, H.
1999
41-50 1-3 p. 265-275
11 p.
artikel
284 Competition hypergraphs Sonntag, Martin
2004
41-50 1-3 p. 324-329
6 p.
artikel
285 Competition numbers of graphs with a small number of triangles Kim, Suh-Ryung
1997
41-50 1-3 p. 153-162
10 p.
artikel
286 Complete decoding of doubly-extended Reed-Solomon codes of minimum distance 5 and 6 Dür, Arne
1991
41-50 1-3 p. 95-107
13 p.
artikel
287 Complete linear descriptions of small asymmetric traveling salesman polytopes Euler, R.
1995
41-50 1-3 p. 193-208
16 p.
artikel
288 Complexity analysis of job-shop scheduling with deteriorating jobs Mosheiov, Gur
2002
41-50 1-3 p. 195-209
15 p.
artikel
289 Complexity and approximation results for scheduling multiprocessor tasks on a ring Confessore, Giuseppe
2003
41-50 1-3 p. 29-44
16 p.
artikel
290 Complexity of finding a join of maximum weight Ageev, A.A.
2001
41-50 1-3 p. 3-7
5 p.
artikel
291 Complexity of finding dense subgraphs Asahiro, Yuichi
2002
41-50 1-3 p. 15-26
12 p.
artikel
292 Complexity of implementing functions of k-valued logic by circuits and formulas in functionally complete bases Orlov, V.A.
2004
41-50 1-3 p. 223-233
11 p.
artikel
293 Complexity of Langton's ant Gajardo, A.
2002
41-50 1-3 p. 41-50
10 p.
artikel
294 Complexity of learning in concept lattices from positive and negative examples Kuznetsov, Sergei O
2004
41-50 1-3 p. 111-125
15 p.
artikel
295 Complexity of list coloring problems with a fixed total number of colors Gravier, Sylvain
2002
41-50 1-3 p. 65-79
15 p.
artikel
296 Complexity of searching an immobile hider in a graph von Stengel, Bernhard
1997
41-50 1-3 p. 235-249
15 p.
artikel
297 Compositions for matroids with the Fulkerson property Chopra, Sunil
1995
41-50 1-3 p. 87-101
15 p.
artikel
298 Computation of Boolean functions by randomized programs Chashkin, A.V.
2004
41-50 1-3 p. 65-82
18 p.
artikel
299 Computation of the expected number of leaves in a tree having a given automorphism, and related topics Bergeron, F.
1991
41-50 1-3 p. 49-66
18 p.
artikel
300 Computing large planar regions in terrains, with an application to fracture surfaces Smid, Michiel
2004
41-50 1-3 p. 253-264
12 p.
artikel
301 Computing optimal rectilinear Steiner trees: A survey and experimental evaluation Ganley, Joseph L
1999
41-50 1-3 p. 161-171
11 p.
artikel
302 Computing residual connectedness reliability for restricted networks Colbourn, Charles J.
1993
41-50 1-3 p. 221-232
12 p.
artikel
303 Computing the conductor of an integral extension Conti, Pasqualina
1991
41-50 1-3 p. 61-72
12 p.
artikel
304 Computing the minimum DNF representation of Boolean functions defined by intervals Schieber, Baruch
2005
41-50 1-3 p. 154-173
20 p.
artikel
305 Concurrency measure in commutation monoids Saheb, N.
1989
41-50 1-3 p. 223-236
14 p.
artikel
306 Congruences concerning Bernoulli numbers and Bernoulli polynomials Sun, Zhi-Hong
2000
41-50 1-3 p. 193-223
31 p.
artikel
307 Connected domination and dominating clique in trapezoid graphs Köhler, Ekkehard
2000
41-50 1-3 p. 91-110
20 p.
artikel
308 Connectivity and fault-tolerance of hyperdigraphs Ferrero, Daniela
2002
41-50 1-3 p. 15-26
12 p.
artikel
309 Conserved synteny as a measure of genomic distance Sankoff, David
1996
41-50 1-3 p. 247-257
11 p.
artikel
310 Construction of a simple elimination scheme for a chordal comparability graph in linear time Borie, Richard B.
1999
41-50 1-3 p. 287-292
6 p.
artikel
311 Construction of discrete structures, especially isomers Grund, R.
1996
41-50 1-3 p. 115-126
12 p.
artikel
312 Constructive complexity Abrahamson, Karl
1991
41-50 1-3 p. 3-16
14 p.
artikel
313 Container ship stowage problem: complexity and connection to the coloring of circle graphs Avriel, Mordecai
2000
41-50 1-3 p. 271-279
9 p.
artikel
314 Contents 2003
41-50 1-3 p. ix-
1 p.
artikel
315 Contents 2003
41-50 1-3 p. ix-x
nvt p.
artikel
316 Contents 2004
41-50 1-3 p. ix-x
nvt p.
artikel
317 Contents 2004
41-50 1-3 p. ix-x
nvt p.
artikel
318 Contents 2004
41-50 1-3 p. xi-xii
nvt p.
artikel
319 Contents 2004
41-50 1-3 p. ix-x
nvt p.
artikel
320 Contents 2004
41-50 1-3 p. viii-ix
nvt p.
artikel
321 Contents 2004
41-50 1-3 p. vii-viii
nvt p.
artikel
322 Contents 2004
41-50 1-3 p. vii-ix
nvt p.
artikel
323 Contents 2005
41-50 1-3 p. viii-ix
nvt p.
artikel
324 Contents 2005
41-50 1-3 p. viii-ix
nvt p.
artikel
325 Contents 2005
41-50 1-3 p. viii-ix
nvt p.
artikel
326 Contents 2005
41-50 1-3 p. viii-ix
nvt p.
artikel
327 Contents 2005
41-50 1-3 p. viii-ix
nvt p.
artikel
328 Continuous bottleneck tree partitioning problems Halman, Nir
2004
41-50 1-3 p. 185-206
22 p.
artikel
329 Counting symmetric configurations v 3 Betten, Anton
2000
41-50 1-3 p. 331-338
8 p.
artikel
330 Covering a rectangle with six and seven circles Melissen, J.B.M.
2000
41-50 1-3 p. 149-156
8 p.
artikel
331 Covering the complete graph with plane cycles Hartman, Alan
1993
41-50 1-3 p. 305-310
6 p.
artikel
332 Covering t-sets with (t+2)-sets Nurmela, Kari J.
1999
41-50 1-3 p. 425-437
13 p.
artikel
333 Criterion of generativeness of sets of rational probabilities by a class of Boolean functions Kolpakov, R.M.
2004
41-50 1-3 p. 125-142
18 p.
artikel
334 Critical edges in perfect line graphs and some polyhedral consequences Wagler, Annegret
1999
41-50 1-3 p. 455-466
12 p.
artikel
335 Crossing-free segments and triangles in point configurations Károlyi, Gyula
2001
41-50 1-3 p. 77-88
12 p.
artikel
336 Cumulative index volumes 1–92 2000
41-50 1-3 p. 177-261
85 p.
artikel
337 Cut invariant d and bond orders of Kekuléan benzenoids Wenchen, He
1996
41-50 1-3 p. 137-147
11 p.
artikel
338 Cutting planes in integer and mixed integer programming Marchand, Hugues
2002
41-50 1-3 p. 397-446
50 p.
artikel
339 Cycles in the cube-connected cycles graph Germa, Anne
1998
41-50 1-3 p. 135-155
21 p.
artikel
340 Cyclic cutwidths of the two-dimensional ordinary and cylindrical meshes Schröder, Heiko
2004
41-50 1-3 p. 123-129
7 p.
artikel
341 Cyclic distance-preserving codes on a constant-weight basis van Zanten, A.J.
2001
41-50 1-3 p. 289-294
6 p.
artikel
342 Cyclic graphs Göbel, F.
2000
41-50 1-3 p. 3-12
10 p.
artikel
343 Data-dependent bounds for the General and the Asymmetric Stacker-Crane problems Righini, Giovanni
1999
41-50 1-3 p. 235-242
8 p.
artikel
344 Deadline scheduling of multiprocessor tasks Blazewicz, J.
1996
41-50 1-3 p. 81-95
15 p.
artikel
345 Decomposability of partially defined Boolean functions Boros, Endre
1995
41-50 1-3 p. 51-75
25 p.
artikel
346 Decomposition of integer matrices and multileaf collimator sequencing Baatar, Davaatseren
2005
41-50 1-3 p. 6-34
29 p.
artikel
347 Decomposition of odd-hole-free graphs by double star cutsets and 2-joins Conforti, Michele
2004
41-50 1-3 p. 41-91
51 p.
artikel
348 Decomposition of wheel-and-parachute-free balanced bipartite graphs Conforti, Michele
1995
41-50 1-3 p. 103-117
15 p.
artikel
349 Decompositions into linear forests and difference labelings of graphs Bloom, Gary S.
1994
41-50 1-3 p. 61-75
15 p.
artikel
350 Dedication Gesù, Vito Di
2005
41-50 1-3 p. 1-
1 p.
artikel
351 Definability of Boolean function classes by linear equations over GF (2) Couceiro, Miguel
2004
41-50 1-3 p. 29-34
6 p.
artikel
352 Determining structural similarity of chemicals using graph-theoretic indices Basak, S.C.
1988
41-50 1-3 p. 17-44
28 p.
artikel
353 Determining the automorphism group of the linear ordering polytope Fiorini, Samuel
2001
41-50 1-3 p. 121-128
8 p.
artikel
354 Digital homotopy with obstacles Ayala, R
2004
41-50 1-3 p. 5-30
26 p.
artikel
355 Digital straightness—a review Klette, Reinhard
2004
41-50 1-3 p. 197-230
34 p.
artikel
356 Directed–ordered whist tournaments and (v,5,1) difference families: existence results and some new classes of Z-cyclic solutions Julian, R.
2004
41-50 1-3 p. 43-53
11 p.
artikel
357 Discrete-continuous scheduling to minimize the makespan for power processing rates of jobs Józefowska, Joanna
1999
41-50 1-3 p. 263-285
23 p.
artikel
358 Discrete facility location and routing of obnoxious activities Cappanera, P.
2003
41-50 1-3 p. 3-28
26 p.
artikel
359 Discrete location problems with push–pull objectives Krarup, Jakob
2002
41-50 1-3 p. 363-378
16 p.
artikel
360 Discrete relaxations of combinatorial programs Borndörfer, Ralf
2001
41-50 1-3 p. 11-26
16 p.
artikel
361 Discrete tomography by convex–concave regularization and D.C. programming Schüle, T.
2005
41-50 1-3 p. 229-243
15 p.
artikel
362 Disjunctive analogues of submodular and supermodular pseudo-Boolean functions Foldes, S
2004
41-50 1-3 p. 53-65
13 p.
artikel
363 Disjunctive and conjunctive normal forms of pseudo-Boolean functions Foldes, Stephan
2000
41-50 1-3 p. 1-26
26 p.
artikel
364 Disjunctive programming: Properties of the convex hull of feasible points Balas, Egon
1998
41-50 1-3 p. 3-44
42 p.
artikel
365 Distances and diameters on iterated clique graphs Pizaña, Miguel A.
2004
41-50 1-3 p. 255-261
7 p.
artikel
366 Distributed algorithm for approximating the maximum matching Czygrinow, A.
2004
41-50 1-3 p. 62-71
10 p.
artikel
367 Distributed processing of divisible jobs with communication startup costs Błażewicz, Jacek
1997
41-50 1-3 p. 21-41
21 p.
artikel
368 Distributive online channel assignment for hexagonal cellular networks with constraints Fitzpatrick, Shannon
2004
41-50 1-3 p. 84-91
8 p.
artikel
369 d-minimal languages Yu, S.S.
1998
41-50 1-3 p. 243-262
20 p.
artikel
370 Dominating the complements of bounded tolerance graphs and the complements of trapezoid graphs Keil, J.Mark
2004
41-50 1-3 p. 73-89
17 p.
artikel
371 Domination and total domination on asteroidal triple-free graphs Kratsch, Dieter
2000
41-50 1-3 p. 111-123
13 p.
artikel
372 Domination number of the cross product of paths Chérifi, Rachid
1999
41-50 1-3 p. 101-139
39 p.
artikel
373 Dual-bounded generating problems: weighted transversals of a hypergraph Boros, E
2004
41-50 1-3 p. 1-15
15 p.
artikel
374 Dyck paths of knight moves Labelle, Jacques
1989
41-50 1-3 p. 213-221
9 p.
artikel
375 Dynamic programming algorithms for RNA secondary structure prediction with pseudoknots Akutsu, Tatsuya
2000
41-50 1-3 p. 45-62
18 p.
artikel
376 Edge and total coloring of interval graphs Bojarshinov, V.A.
2001
41-50 1-3 p. 23-28
6 p.
artikel
377 Edge disjoint Polyp Packing Katona, Gyula Y.
1997
41-50 1-3 p. 133-152
20 p.
artikel
378 Edge-packing planar graphs by cyclic graphs Heath, Lenwood S.
1998
41-50 1-3 p. 169-180
12 p.
artikel
379 Editorial Hammer, Peter L.
1998
41-50 1-3 p. 1-
1 p.
artikel
380 Editorial 2000
41-50 1-3 p. 1-
1 p.
artikel
381 Editorial 1999
41-50 1-3 p. 1-
1 p.
artikel
382 Editorial Board 2003
41-50 1-3 p. v-vii
nvt p.
artikel
383 Editorial Board 2003
41-50 1-3 p. v-vii
nvt p.
artikel
384 Editorial Board 1995
41-50 1-3 p. v-vi
nvt p.
artikel
385 Editorial Board 1995
41-50 1-3 p. iii-iv
nvt p.
artikel
386 Editorial Board 1994
41-50 1-3 p. iii-iv
nvt p.
artikel
387 Editorial Board 1997
41-50 1-3 p. iii-iv
nvt p.
artikel
388 Editorial Board 1997
41-50 1-3 p. iii-iv
nvt p.
artikel
389 Editorial Board 1991
41-50 1-3 p. iii-iv
nvt p.
artikel
390 Editorial Board 1991
41-50 1-3 p. iii-iv
nvt p.
artikel
391 Editorial Board 1993
41-50 1-3 p. iii-iv
nvt p.
artikel
392 Editorial Board 1998
41-50 1-3 p. 1-
1 p.
artikel
393 Editorial Board 2000
41-50 1-3 p. v-vi
nvt p.
artikel
394 Editorial Board 1997
41-50 1-3 p. iii-iv
nvt p.
artikel
395 Editorial Board 1996
41-50 1-3 p. ix-x
nvt p.
artikel
396 Editorial Board 1996
41-50 1-3 p. ix-x
nvt p.
artikel
397 Editorial Board 1996
41-50 1-3 p. iii-iv
nvt p.
artikel
398 Editorial Board 1994
41-50 1-3 p. v-vi
nvt p.
artikel
399 Editorial Board 1998
41-50 1-3 p. v-vi
nvt p.
artikel
400 Editorial Board 1998
41-50 1-3 p. v-vi
nvt p.
artikel
401 Editorial Board 1998
41-50 1-3 p. v-vi
nvt p.
artikel
402 Editorial Board 1998
41-50 1-3 p. iii-iv
nvt p.
artikel
403 Editorial Board 1998
41-50 1-3 p. iii-iv
nvt p.
artikel
404 Editorial Board 1998
41-50 1-3 p. v-vi
nvt p.
artikel
405 Editorial Board 1999
41-50 1-3 p. IFC-
1 p.
artikel
406 Editorial Board 1999
41-50 1-3 p. v-vi
nvt p.
artikel
407 Editorial Board 1999
41-50 1-3 p. v-vi
nvt p.
artikel
408 Editorial Board 1988
41-50 1-3 p. IFC-
1 p.
artikel
409 Editorial Board 1989
41-50 1-3 p. IFC-
1 p.
artikel
410 Editorial Board 2004
41-50 1-3 p. v-vii
nvt p.
artikel
411 Editorial Board 2004
41-50 1-3 p. v-vii
nvt p.
artikel
412 Editorial Board 2004
41-50 1-3 p. v-vi
nvt p.
artikel
413 Editorial Board 2004
41-50 1-3 p. v-vi
nvt p.
artikel
414 Editorial Board 2004
41-50 1-3 p. v-vii
nvt p.
artikel
415 Editorial Board 2004
41-50 1-3 p. v-vii
nvt p.
artikel
416 Editorial Board 2004
41-50 1-3 p. v-vii
nvt p.
artikel
417 Editorial Board 2005
41-50 1-3 p. v-vii
nvt p.
artikel
418 Editorial Board 2005
41-50 1-3 p. v-vii
nvt p.
artikel
419 Editorial Board 2005
41-50 1-3 p. v-vii
nvt p.
artikel
420 Editorial Board 2005
41-50 1-3 p. v-vii
nvt p.
artikel
421 Editorial Board 2005
41-50 1-3 p. v-vii
nvt p.
artikel
422 Editorial Note: DAM Software Section Leonard, C.J
2004
41-50 1-3 p. ix-x
nvt p.
artikel
423 Editors nr. 1 2002
41-50 1-3 p. v-vi
nvt p.
artikel
424 Efficient algorithms for some path partitioning problems Brucker, Peter
1995
41-50 1-3 p. 77-85
9 p.
artikel
425 Efficient broadcasting with linearly bounded faults Ciebiera, Krzysztof
1998
41-50 1-3 p. 99-105
7 p.
artikel
426 Efficient computation of implicit representations of sparse graphs Arikati, Srinivasa R.
1997
41-50 1-3 p. 1-16
16 p.
artikel
427 Efficient generation of graphical partitions Barnes, Tiffany M.
1997
41-50 1-3 p. 17-26
10 p.
artikel
428 Efficient parallel algorithm to compute a doubly perfect elimination ordering of a doubly chordal graph Lee, Mahnhoon
2005
41-50 1-3 p. 266-272
7 p.
artikel
429 Efficient parallel recognition of cographs Nikolopoulos, Stavros D.
2005
41-50 1-3 p. 182-215
34 p.
artikel
430 Efficient q-ary immutable codes Capocelli, Renato M.
1991
41-50 1-3 p. 25-41
17 p.
artikel
431 Efficient sets in graphs Bernhard, P.J.
1993
41-50 1-3 p. 99-108
10 p.
artikel
432 Efficient sets in partial k-trees Telle, Jan Arne
1993
41-50 1-3 p. 109-117
9 p.
artikel
433 Eigenvectors of interval matrices over max–plus algebra Cechlárová, Katarína
2005
41-50 1-3 p. 2-15
14 p.
artikel
434 Ejection chains, reference structures and alternating path methods for traveling salesman problems Glover, Fred
1996
41-50 1-3 p. 223-253
31 p.
artikel
435 Elementary proofs of (relatively) recent characterizations of Eulerian graphs Fleischner, Herbert
1989
41-50 1-3 p. 115-119
5 p.
artikel
436 Elementary sequences, sub-Fibonacci sequences Fishburn, Peter C.
1993
41-50 1-3 p. 261-281
21 p.
artikel
437 Embedding and characterization of quantum chemical reaction graphs on two-dimensional orientable surfaces Harary, Frank
1988
41-50 1-3 p. 205-214
10 p.
artikel
438 Embedding de Bruijn, Kautz and shuffle-exchange networks in books Hasunuma, Toru
1997
41-50 1-3 p. 103-116
14 p.
artikel
439 Embedding ladders and caterpillars into the hypercube Bezrukov, Sergei
1998
41-50 1-3 p. 21-29
9 p.
artikel
440 Enumeration of difference graphs Peled, Uri N.
1995
41-50 1-3 p. 311-318
8 p.
artikel
441 Enumeration of factors in the Thue-Morse word Brlek, Srećko
1989
41-50 1-3 p. 83-96
14 p.
artikel
442 Envelopes and clutters Kashiwabara, Kenji
2000
41-50 1-3 p. 177-185
9 p.
artikel
443 EP theorems and linear complementarity problems Fukuda, Komei
1998
41-50 1-3 p. 107-119
13 p.
artikel
444 Equations for the projective closure and effective Nullstellensatz Caniglia, L.
1991
41-50 1-3 p. 11-23
13 p.
artikel
445 Equistable chordal graphs Peled, Uri N.
2003
41-50 1-3 p. 203-210
8 p.
artikel
446 Equistable series–parallel graphs Korach, Ephraim
2003
41-50 1-3 p. 149-162
14 p.
artikel
447 Erasure-resilient codes from affine spaces Müller, Meinard
2004
41-50 1-3 p. 292-297
6 p.
artikel
448 Euclidean Steiner minimal trees, minimum energy configurations, and the embedding problem of weighted graphs in E 3 Smith, J.MacGregor
1996
41-50 1-3 p. 187-215
29 p.
artikel
449 Euler circuits and DNA sequencing by hybridization Arratia, Richard
2000
41-50 1-3 p. 63-96
34 p.
artikel
450 Eulerian disjoint paths problem in grid graphs is NP-complete Marx, Dániel
2004
41-50 1-3 p. 336-341
6 p.
artikel
451 Even and odd pairs in comparability and in P 4-comparability graphs de Figueiredo, Celina M.H.
1999
41-50 1-3 p. 293-297
5 p.
artikel
452 Exact classification with two-layer neural nets inn dimensions Sweatman, Catherine Z.W. Hassell
1998
41-50 1-3 p. 19-39
21 p.
artikel
453 Exact enumeration of rooted 3-connected triangular maps on the projective plane Gao, Zhicheng
2004
41-50 1-3 p. 149-159
11 p.
artikel
454 Exchange relations, Dyck paths and copolymer adsorption Rechnitzer, A.
2004
41-50 1-3 p. 49-71
23 p.
artikel
455 Excluding induced subgraphs II: extremal graphs Prömel, H.J.
1993
41-50 1-3 p. 283-294
12 p.
artikel
456 Existence of whist tournaments with the three-person property 3PWh(v) Lu, Y.
2000
41-50 1-3 p. 207-219
13 p.
artikel
457 Expected worst-case partial match in random quadtries Devroye, Luc
2004
41-50 1-3 p. 103-117
15 p.
artikel
458 Experimental behavior of an interior point cutting plane algorithm for convex programming: an application to geometric programming Bahn, O.
1994
41-50 1-3 p. 3-23
21 p.
artikel
459 Explicit construction of graphs with an arbitrary large girth and of large size Lazebnik, Felix
1995
41-50 1-3 p. 275-284
10 p.
artikel
460 Explicit expressions for the central characters of the symmetric group Katriel, Jacob
1996
41-50 1-3 p. 149-156
8 p.
artikel
461 Extending shelling orders and a hierarchy of functions of unimodal simple polytopes Hoke, Kathy
1995
41-50 1-3 p. 211-217
7 p.
artikel
462 Extensions de réseaux de connexité donnée Konig, Jean-Claude
1989
41-50 1-3 p. 197-211
15 p.
artikel
463 Extremal graphs domination insensitive to the removal of k edges Haynes, Teresa W.
1993
41-50 1-3 p. 295-304
10 p.
artikel
464 Extremal graphs for the list-coloring version of a theorem of Nordhaus and Gaddum Dantas, Simone
2004
41-50 1-3 p. 93-101
9 p.
artikel
465 Extremal problems for ordered hypergraphs: small patterns and some enumeration Klazar, Martin
2004
41-50 1-3 p. 144-154
11 p.
artikel
466 Facets of the p-cycle polytope Hartmann, Mark
2001
41-50 1-3 p. 147-178
32 p.
artikel
467 Factoring Boolean functions using graph partitioning Mintz, Aviad
2005
41-50 1-3 p. 131-153
23 p.
artikel
468 Factorisations courtes dans un groupe fini Hamidoune, Y.O.
1989
41-50 1-3 p. 153-165
13 p.
artikel
469 Families of non-IRUP instances of the one-dimensional cutting stock problem Rietz, Jürgen
2002
41-50 1-3 p. 229-245
17 p.
artikel
470 Families of optimal codes for strong identification Laihonen, Tero
2002
41-50 1-3 p. 203-213
11 p.
artikel
471 Fast equi-partitioning of rectangular domains using stripe decomposition Martin, Wayne
1998
41-50 1-3 p. 193-207
15 p.
artikel
472 Fast fixed-parameter tractable algorithms for nontrivial generalizations of vertex cover Nishimura, Naomi
2005
41-50 1-3 p. 229-245
17 p.
artikel
473 Fast gossiping with short unreliable messages Chlebus, Bogdan S.
1994
41-50 1-3 p. 15-24
10 p.
artikel
474 Fast multiple alignment of ungapped DNA sequences using information theory and a relaxation method Schneider, Thomas D.
1996
41-50 1-3 p. 259-268
10 p.
artikel
475 Fast scaling algorithms for M-convex function minimization with application to the resource allocation problem Shioura, Akiyoshi
2004
41-50 1-3 p. 303-316
14 p.
artikel
476 Fault-tolerant routings in double fixed-step networks Fabrega, J.
1997
41-50 1-3 p. 61-74
14 p.
artikel
477 Fault-tolerant routings in Kautz and de Bruijn networks Homobono, Nathalie
1989
41-50 1-3 p. 179-186
8 p.
artikel
478 Finding the Pareto-optima for the total and maximum tardiness single machine problem Tadei, R
2002
41-50 1-3 p. 117-126
10 p.
artikel
479 Finite automata for languages of combinatorial interest: An order theoretical point of view Simion, Rodica E.
1989
41-50 1-3 p. 237-246
10 p.
artikel
480 Finitely generated distribution algebras Salimov, F.I.
2004
41-50 1-3 p. 259-265
7 p.
artikel
481 Fixed topology alignment with recombination Wang, Lusheng
2000
41-50 1-3 p. 281-300
20 p.
artikel
482 Fixpoint strategies for deductive databases Guessarian, Irène
1989
41-50 1-3 p. 121-131
11 p.
artikel
483 Foreword Faigle, Ulrich
2002
41-50 1-3 p. 1-
1 p.
artikel
484 Foreword Istrail, Sorin
1998
41-50 1-3 p. 3-6
4 p.
artikel
485 Foreword Istrail, Sorin
2000
41-50 1-3 p. 1-2
2 p.
artikel
486 Foreword Cornuéjols, Gérard
1998
41-50 1-3 p. 1-2
2 p.
artikel
487 Forthcoming Special Issues 2004
41-50 1-3 p. 277-279
3 p.
artikel
488 Forthcoming special issues 2005
41-50 1-3 p. 275-277
3 p.
artikel
489 Fractional dominations and fractional total dominations of graph complements Fisher, David C.
2002
41-50 1-3 p. 283-291
9 p.
artikel
490 Fringe thickness and maximum path length of binary trees Cameron, Helen
1998
41-50 1-3 p. 75-97
23 p.
artikel
491 Fully polynomial approximation schemes for locating a tree-shaped facility: A generalization of the knapsack problem Tamir, Arie
1998
41-50 1-3 p. 229-243
15 p.
artikel
492 Generalized balances in Sturmian words Fagnot, Isabelle
2002
41-50 1-3 p. 83-101
19 p.
artikel
493 Generalized bicycles Berman, Kenneth A.
1997
41-50 1-3 p. 27-40
14 p.
artikel
494 Generalized flags in finite Abelian p-groups Butler, Lynne M.
1991
41-50 1-3 p. 67-81
15 p.
artikel
495 Generalized knight's tours on rectangular chessboards Chia, G.L.
2005
41-50 1-3 p. 80-98
19 p.
artikel
496 Generalized partitions of graphs MacGillivray, Gary
1999
41-50 1-3 p. 143-153
11 p.
artikel
497 Generalized perfect graphs: Characterizations and inversion Trenk, Ann N.
1995
41-50 1-3 p. 359-387
29 p.
artikel
498 General lower bounds on the query complexity within the exact learning model Klasner, Norbert
2000
41-50 1-3 p. 61-81
21 p.
artikel
499 Generation of molecular graphs based on flexible utilization of the available structural information Bangov, Ivan P.
1996
41-50 1-3 p. 27-49
23 p.
artikel
500 Generic axiomatized digital surface-structures Fourey, Sébastien
2004
41-50 1-3 p. 65-93
29 p.
artikel
501 Generic rigidity of molecular graphs via ear decomposition Franzblau, D.S.
2000
41-50 1-3 p. 131-155
25 p.
artikel
502 Genotyping of pooled microsatellite markers by combinatorial optimization techniques Lancia, Giuseppe
1998
41-50 1-3 p. 291-314
24 p.
artikel
503 Graph classes between parity and distance-hereditary graphs Cicerone, Serafino
1999
41-50 1-3 p. 197-216
20 p.
artikel
504 Graph connectivity and its augmentation: applications of MA orderings Nagamochi, Hiroshi
2002
41-50 1-3 p. 447-472
26 p.
artikel
505 Graph embedding in SYNCHEM2, an expert system for organic synthesis discovery Benstock, Joseph D
1988
41-50 1-3 p. 45-63
19 p.
artikel
506 Graphical representation of regular resonance structures and their linear dependence Živković, Tomislav P
1988
41-50 1-3 p. 397-414
18 p.
artikel
507 Graph partitioning applied to the logic testing of combinational circuits Davis-Moradkhan, Madlaine
1995
41-50 1-3 p. 131-165
35 p.
artikel
508 Graphs having distance-n domination number half their order Fischermann, Miranca
2002
41-50 1-3 p. 97-107
11 p.
artikel
509 Graphs that admit 3-to-1 or 2-to-1 maps onto the circle Hilton, A.J.W.
1996
41-50 1-3 p. 347-377
31 p.
artikel
510 Graphs with largest number of minimum cuts Lehel, Jenő
1996
41-50 1-3 p. 387-407
21 p.
artikel
511 Graph theoretical invariants and elementary subgraphs of polyhex and polypent/polyhex systems of chemical relevance Dias, Jerry Ray
1996
41-50 1-3 p. 79-114
36 p.
artikel
512 Graph transformations which preserve the multiplicity of an eigenvalue Yeong-Nan, Yeh
1996
41-50 1-3 p. 221-228
8 p.
artikel
513 Graph traversals, genes and matroids: An efficient case of the travelling salesman problem Gusfield, Dan
1998
41-50 1-3 p. 167-180
14 p.
artikel
514 Gray code for derangements Baril, Jean-Luc
2004
41-50 1-3 p. 207-221
15 p.
artikel
515 Greedy algorithms for tracking mobile users in special mobility graphs Olariu, S.
2002
41-50 1-3 p. 215-227
13 p.
artikel
516 Guest Editors 2005
41-50 1-3 p. 4-
1 p.
artikel
517 Guest editors 2005
41-50 1-3 p. 2-
1 p.
artikel
518 Guide for authors 2003
41-50 1-3 p. 124-127
4 p.
artikel
519 Guide for authors 2003
41-50 1-3 p. I-IV
nvt p.
artikel
520 Guide for authors 2004
41-50 1-3 p. 363-366
4 p.
artikel
521 Guide for authors 2004
41-50 1-3 p. I-IV
nvt p.
artikel
522 Guide for authors 2004
41-50 1-3 p. I-IV
nvt p.
artikel
523 Guide for authors 2004
41-50 1-3 p. I-IV
nvt p.
artikel
524 Guide for authors 2004
41-50 1-3 p. I-IV
nvt p.
artikel
525 Guide for authors 2004
41-50 1-3 p. 310-313
4 p.
artikel
526 Guide for authors 2004
41-50 1-3 p. I-IV
nvt p.
artikel
527 Guide for authors 2005
41-50 1-3 p. I-IV
nvt p.
artikel
528 Guide for authors 2005
41-50 1-3 p. I-V
nvt p.
artikel
529 Guide for authors 2005
41-50 1-3 p. I-IV
nvt p.
artikel
530 Guide for authors 2005
41-50 1-3 p. I-V
nvt p.
artikel
531 Guide for authors 2005
41-50 1-3 p. I-IV
nvt p.
artikel
532 Hamilton circuits in the directed wrapped Butterfly network Bermond, J-C.
1998
41-50 1-3 p. 21-42
22 p.
artikel
533 Hamiltonian completions of sparse random graphs Gamarnik, David
2005
41-50 1-3 p. 139-158
20 p.
artikel
534 Hamiltonicity, diameter, domination, packing, and biclique partitions of Mycielski's graphs Fisher, David C.
1998
41-50 1-3 p. 93-105
13 p.
artikel
535 Hard cases of the multifacility location problem Karzanov, Alexander V.
2004
41-50 1-3 p. 368-373
6 p.
artikel
536 Hardness of identifying the minimum ordered binary decision diagram Takenaga, Yasuhiko
2000
41-50 1-3 p. 191-201
11 p.
artikel
537 Height of minor faces in plane normal maps Borodin, O.V.
2004
41-50 1-3 p. 31-39
9 p.
artikel
538 Hereditary dominating pair graphs Pržulj, Nataša
2004
41-50 1-3 p. 239-261
23 p.
artikel
539 Hereditary systems and greedy-type algorithms Il'ev, Victor
2003
41-50 1-3 p. 137-148
12 p.
artikel
540 Homogeneous bent functions of degree n in 2n variables do not exist for n>3 Xia, Tianbing
2004
41-50 1-3 p. 127-132
6 p.
artikel
541 How good are branching rules in DPLL? Ouyang, Ming
1998
41-50 1-3 p. 281-286
6 p.
artikel
542 How to survive while visiting a graph Arbib, Claudio
2000
41-50 1-3 p. 279-293
15 p.
artikel
543 Hybrid grids and the Homing Robot Rabinoff, Joseph
2004
41-50 1-3 p. 155-168
14 p.
artikel
544 Ideal clutters Cornuéjols, Gérard
2002
41-50 1-3 p. 303-338
36 p.
artikel
545 Improved algorithms for the Steiner problem in networks Polzin, Tobias
2001
41-50 1-3 p. 263-300
38 p.
artikel
546 Improved approximations for max set splitting and max NAE SAT Zhang, Jiawei
2004
41-50 1-3 p. 133-149
17 p.
artikel
547 Improved bounds for harmonic-based bin packing algorithms Richey, Michael B.
1991
41-50 1-3 p. 203-227
25 p.
artikel
548 Improved exact algorithms for MAX-SAT Chen, Jianer
2004
41-50 1-3 p. 17-27
11 p.
artikel
549 Improving local search heuristics for some scheduling problems—I Brucker, Peter
1996
41-50 1-3 p. 97-122
26 p.
artikel
550 Improving the trade-off between storage and communication in broadcast encryption schemes Padró, Carles
2004
41-50 1-3 p. 213-220
8 p.
artikel
551 Increasing digraph arc-connectivity by arc addition, reversal and complement Arkin, Esther M.
2002
41-50 1-3 p. 13-22
10 p.
artikel
552 Independence and domination in polygon graphs Elmallah, Ehab S.
1993
41-50 1-3 p. 65-77
13 p.
artikel
553 Independence and upper irredundance in claw-free graphs Favaron, Odile
2003
41-50 1-3 p. 85-95
11 p.
artikel
554 Independent sets with domination constraints Halldórsson, Magnús M.
2000
41-50 1-3 p. 39-54
16 p.
artikel
555 Index 2000
41-50 1-3 p. 301-
1 p.
artikel
556 Index 2000
41-50 1-3 p. 313-314
2 p.
artikel
557 Index 2000
41-50 1-3 p. 261-
1 p.
artikel
558 Index 2000
41-50 1-3 p. 291-
1 p.
artikel
559 Index 2000
41-50 1-3 p. 455-456
2 p.
artikel
560 Index 1999
41-50 1-3 p. 467-468
2 p.
artikel
561 Index 2000
41-50 1-3 p. 313-314
2 p.
artikel
562 Induced matchings Cameron, Kathie
1989
41-50 1-3 p. 97-102
6 p.
artikel
563 Induced matchings in asteroidal triple-free graphs Chang, Jou-Ming
2003
41-50 1-3 p. 67-78
12 p.
artikel
564 Induced permutation automata and coverings of strongly connected automata Uemura, Kenji
1999
41-50 1-3 p. 243-249
7 p.
artikel
565 Inducing an order on cellular automata by a grouping operation Mazoyer, Jacques
1999
41-50 1-3 p. 177-196
20 p.
artikel
566 Interacting dimers on a sierpinski gasket Seitz, W.A
1988
41-50 1-3 p. 339-348
10 p.
artikel
567 Interchange graphs and the Hamiltonian cycle polytope Sierksma, Gerard
1998
41-50 1-3 p. 217-224
8 p.
artikel
568 Interval orders based on weak orders Bogart, Kenneth P.
1995
41-50 1-3 p. 93-98
6 p.
artikel
569 Intervertex distances in convex polygons Erdös, Paul
1995
41-50 1-3 p. 149-158
10 p.
artikel
570 Introduction 1996
41-50 1-3 p. 1-4
4 p.
artikel
571 Introduction Golumbic, MartinCharles
1993
41-50 1-3 p. 1-3
3 p.
artikel
572 Introductory remarks 1988
41-50 1-3 p. 1-3
3 p.
artikel
573 Inverse inbreeding coefficient problems with an application to linkage analysis of recessive diseases in inbred populations Agarwala, Richa
2000
41-50 1-3 p. 3-44
42 p.
artikel
574 Inversions in k-sorted permutations Dutton, Ronald D.
1998
41-50 1-3 p. 49-56
8 p.
artikel
575 Investigations on autark assignments Kullmann, Oliver
2000
41-50 1-3 p. 99-137
39 p.
artikel
576 Irredundancy in circular arc graphs Golumbic, Martin Charles
1993
41-50 1-3 p. 79-89
11 p.
artikel
577 Irreflexive and reflexive dimension Langley, Larry J.
1995
41-50 1-3 p. 267-273
7 p.
artikel
578 König-Egerváry graphs, 2-bicritical graphs and fractional matchings Bourjolly, Jean-Marie
1989
41-50 1-3 p. 63-82
20 p.
artikel
579 Known and new classes of generalized Horn formulae with polynomial recognition and SAT testing Čepek, Ondřej
2005
41-50 1-3 p. 14-52
39 p.
artikel
580 k-Path partitions in trees Yan, Jing-Ho
1997
41-50 1-3 p. 227-233
7 p.
artikel
581 k-Subdomination in graphs Chang, Gerard J.
2002
41-50 1-3 p. 55-60
6 p.
artikel
582 K-submodular functions and convexity of their Lovász extension Ando, Kazutoshi
2002
41-50 1-3 p. 1-12
12 p.
artikel
583 k-th order symmetric SAC boolean functions and bisecting binomial coefficients Cusick, T.W.
2005
41-50 1-3 p. 73-86
14 p.
artikel
584 Laplacian spectra and spanning trees of threshold graphs Hammer, P.L.
1996
41-50 1-3 p. 255-273
19 p.
artikel
585 La queste del saint Gra(AL): A computational approach to local algebra Mora, Teo
1991
41-50 1-3 p. 161-190
30 p.
artikel
586 Large generalized cycles Gómez, J.
1998
41-50 1-3 p. 107-123
17 p.
artikel
587 Lattice-theoretic properties of MPR-posets in phylogeny Miyakawa, Kampei
2004
41-50 1-3 p. 169-192
24 p.
artikel
588 Learning faster than promised by the Vapnik-Chervonenkis dimension Blumer, Anselm
1989
41-50 1-3 p. 47-53
7 p.
artikel
589 Length-bounded disjoint paths in planar graphs van der Holst, H.
2002
41-50 1-3 p. 251-261
11 p.
artikel
590 Lengths of tours and permutations on a vertex set of a convex polygon Hiro, Ito
2001
41-50 1-3 p. 63-71
9 p.
artikel
591 Lift-and-project for Mixed 0–1 programming: recent progress Balas, Egon
2002
41-50 1-3 p. 129-154
26 p.
artikel
592 Lift and project relaxations for the matching and related polytopes Aguilera, Néstor E.
2004
41-50 1-3 p. 193-212
20 p.
artikel
593 Linear and nonlinear inequalities concerning a certain combinatorial sequence which arises from counting the number of chains of a finite distributive lattice Hibi, Takayuki
1991
41-50 1-3 p. 145-150
6 p.
artikel
594 Linear k-arboricities on trees Chang, Gerard J.
2000
41-50 1-3 p. 281-287
7 p.
artikel
595 Linear segmentation of discrete curves into blurred segments Debled-Rennesson, Isabelle
2005
41-50 1-3 p. 122-137
16 p.
artikel
596 Linear symmetries of Boolean functions Xiao, Wenjun
2005
41-50 1-3 p. 192-199
8 p.
artikel
597 Linear time approximation scheme for the multiprocessor open shop problem Sevastianov, S.V.
2001
41-50 1-3 p. 273-288
16 p.
artikel
598 Line broadcasting in cycles Kane, Jave O.
1998
41-50 1-3 p. 207-228
22 p.
artikel
599 Linking discrete orthogonality with dilation and translation for incomplete sigma-pi neural networks of Hopfield-type Lenze, Burkhard
1998
41-50 1-3 p. 169-180
12 p.
artikel
600 List colorings and reducibility Tuza, Zs.
1997
41-50 1-3 p. 247-256
10 p.
artikel
601 List of referees 2004
41-50 1-3 p. 259-271
13 p.
artikel
602 List of referees 2005
41-50 1-3 p. 268-274
7 p.
artikel
603 List schedules for cyclic scheduling Chrétienne, Philippe
1999
41-50 1-3 p. 141-159
19 p.
artikel
604 Local complexity of Boolean functions Chashkin, A.V.
2004
41-50 1-3 p. 55-64
10 p.
artikel
605 Locally bounded hereditary subclasses of k-colourable graphs Zverovich, I.E.
2001
41-50 1-3 p. 301-311
11 p.
artikel
606 Local maximum stable sets in bipartite graphs with uniquely restricted maximum matchings Levit, Vadim E.
2003
41-50 1-3 p. 163-174
12 p.
artikel
607 Local multiple alignment via subgraph enumeration Zhang, Z.
1996
41-50 1-3 p. 337-365
29 p.
artikel
608 Local optima topology for the k-coloring problem Hertz, Alain
1994
41-50 1-3 p. 257-280
24 p.
artikel
609 Local rule mechanism for selecting icosahedral shell geometry Berger, B.
2000
41-50 1-3 p. 97-111
15 p.
artikel
610 Local search algorithms for a single-machine scheduling problem with positive and negative time-lags Hurink, Johann
2001
41-50 1-3 p. 179-197
19 p.
artikel
611 Local spectra of perfect binary codes Vasil'eva, A.Yu.
2004
41-50 1-3 p. 301-307
7 p.
artikel
612 Local transformations of graphs preserving independence number Alekseev, V.E.
2004
41-50 1-3 p. 17-30
14 p.
artikel
613 Lot-size scheduling of two types of jobs on identical machines Pattloch, Marcus
1996
41-50 1-3 p. 409-419
11 p.
artikel
614 Low density series expansions for backbone properties of percolation clusters Bhatti, F.M.
1988
41-50 1-3 p. 85-112
28 p.
artikel
615 Lower bounds for the complexity of restrictions of Boolean functions Chashkin, A.V.
2001
41-50 1-3 p. 61-93
33 p.
artikel
616 Makespan minimization for flow-shop problems with transportation times and a single robot Hurink, Johann
2001
41-50 1-3 p. 199-216
18 p.
artikel
617 Many-to-many matching: stable polyandrous polygamy (or polygamous polyandry) Baı̈ou, Mourad
2000
41-50 1-3 p. 1-12
12 p.
artikel
618 Master index to volumes 2004
41-50 1-3 p. 283-294
12 p.
artikel
619 Master index to volumes 141-150 2005
41-50 1-3 p. 282-296
15 p.
artikel
620 Matching and multidimensional matching in chordal and strongly chordal graphs Dahlhaus, Elias
1998
41-50 1-3 p. 79-91
13 p.
artikel
621 Matchings and cycle covers in random digraphs Gimbel, John
1991
41-50 1-3 p. 121-128
8 p.
artikel
622 Matchings and ▵-matroids Bouchet, André
1989
41-50 1-3 p. 55-62
8 p.
artikel
623 Matchings in colored bipartite networks Yi, Tongnyoul
2002
41-50 1-3 p. 261-277
17 p.
artikel
624 Matching-star Ramsey sets Mengersen, Ingrid
1999
41-50 1-3 p. 417-424
8 p.
artikel
625 Matrices with maximum exponents in the class of doubly stochastic primitive matrices Zhou, Bo
1999
41-50 1-3 p. 53-66
14 p.
artikel
626 Matrix and combinatorics solutions of Boolean differential equations Yanushkevich, S.N.
2002
41-50 1-3 p. 279-292
14 p.
artikel
627 Matrix period in max-algebra Molnárová, Monika
2000
41-50 1-3 p. 167-175
9 p.
artikel
628 Matrix transpose on meshes with wormhole and XY routing Kuo-Shun, Ding
1998
41-50 1-3 p. 41-59
19 p.
artikel
629 Maximal cubic graphs with diameter 4 Buset, Dominique
2000
41-50 1-3 p. 53-61
9 p.
artikel
630 Maximal independent sets in graphs with at most one cycle Jou, Min-Jen
1997
41-50 1-3 p. 67-73
7 p.
artikel
631 Maximal partial clones determined by the areflexive relations Haddad, Lucien
1989
41-50 1-3 p. 133-143
11 p.
artikel
632 Maximum mean weight cycle in a digraph and minimizing cycle time of a logic chip Albrecht, Christoph
2002
41-50 1-3 p. 103-127
25 p.
artikel
633 Maximum vertex-weighted matching in strongly chordal graphs Campêlo, Manoel B.
1998
41-50 1-3 p. 71-77
7 p.
artikel
634 Möbius inversion on a poset of a graph and its acyclic subgraphs Babić, D.
1996
41-50 1-3 p. 5-11
7 p.
artikel
635 Median hyperplanes in normed spaces — a survey Martini, Horst
1998
41-50 1-3 p. 181-195
15 p.
artikel
636 Medians for weight metrics in the covering graphs of semilattices Leclerc, Bruno
1994
41-50 1-3 p. 281-297
17 p.
artikel
637 2-Medians in trees with pos/neg weights Burkard, Rainer E.
2000
41-50 1-3 p. 51-71
21 p.
artikel
638 Mediated digraphs and quantum nonlocality Gutin, G.
2005
41-50 1-3 p. 41-50
10 p.
artikel
639 Media theory Falmagne, J.-Cl.
2002
41-50 1-3 p. 103-118
16 p.
artikel
640 Methods and problems of communication in usual networks Fraigniaud, Pierre
1994
41-50 1-3 p. 79-133
55 p.
artikel
641 Meyniel weakly triangulated graphs II: A theorem of Dirac Hayward, Ryan B.
1997
41-50 1-3 p. 283-289
7 p.
artikel
642 Minimal connected enclosures on an embedded planar graph Alexopoulos, Christos
1999
41-50 1-3 p. 25-38
14 p.
artikel
643 Minimal enumerations of subsets of a finite set and the middle level problem Evdokimov, A.A.
2001
41-50 1-3 p. 109-114
6 p.
artikel
644 Minimal vertex separators of chordal graphs Kumar, P.Sreenivasa
1998
41-50 1-3 p. 155-168
14 p.
artikel
645 Minimization of an M-convex function Shioura, Akiyoshi
1998
41-50 1-3 p. 215-220
6 p.
artikel
646 Minimizing broadcast costs under edge reductions in tree networks Hambrusch, Susanne E.
1999
41-50 1-3 p. 93-117
25 p.
artikel
647 Minimizing maximum indegree Venkateswaran, V.
2004
41-50 1-3 p. 374-378
5 p.
artikel
648 Minimizing phylogenetic number to find good evolutionary trees Goldberg, Leslie Ann
1996
41-50 1-3 p. 111-136
26 p.
artikel
649 Minimum average distance of strong orientations of graphs Dankelmann, Peter
2004
41-50 1-3 p. 204-212
9 p.
artikel
650 Minimum degree algorithms for stability number Zverovich, Igor É.
2003
41-50 1-3 p. 211-216
6 p.
artikel
651 Minimum k-broadcast graphs König, J.-C.
1994
41-50 1-3 p. 199-209
11 p.
artikel
652 Minimum matrix representation of some key system Tichler, Krisztián
2002
41-50 1-3 p. 267-277
11 p.
artikel
653 Minimum matrix representation of Sperner systems Bennett, F.E.
1998
41-50 1-3 p. 9-17
9 p.
artikel
654 Minimum multiway cuts in trees Erdős, Péter L.
1998
41-50 1-3 p. 67-75
9 p.
artikel
655 Minimum time broadcast in faulty star networks Gargano, Luisa
1998
41-50 1-3 p. 97-119
23 p.
artikel
656 Minimum-time multidrop broadcast Farley, Arthur M.
1998
41-50 1-3 p. 61-77
17 p.
artikel
657 Minimum vertex weighted deficiency of (g,f)-factors: a greedy algorithm Anstee, R.P.
1993
41-50 1-3 p. 247-260
14 p.
artikel
658 Models, relaxations and exact approaches for the capacitated vehicle routing problem Toth, Paolo
2002
41-50 1-3 p. 487-512
26 p.
artikel
659 Monge and feasibility sequences in general flow problems Adler, Ilan
1993
41-50 1-3 p. 21-38
18 p.
artikel
660 Monotone Boolean formulas can approximate monotone linear threshold functions Servedio, Rocco A.
2004
41-50 1-3 p. 181-187
7 p.
artikel
661 Monotonicity and positive invariance of linear systems over dioids Truffet, L.
2005
41-50 1-3 p. 29-39
11 p.
artikel
662 Multi-machine scheduling with variance minimization Cai, Xiaoqiang
1998
41-50 1-3 p. 55-70
16 p.
artikel
663 Multiplicities of interpoint distances in finite planar sets Erdős, Paul
1995
41-50 1-3 p. 141-147
7 p.
artikel
664 Multi-terminal multipath flows: synthesis Chandrasekaran, R.
2004
41-50 1-3 p. 182-193
12 p.
artikel
665 Neighborhood unions and cyclability of graphs Liu, Huiqing
2004
41-50 1-3 p. 91-101
11 p.
artikel
666 NeST graphs Hayward, Ryan B.
2002
41-50 1-3 p. 139-153
15 p.
artikel
667 New approaches to reduced-complexity decoding Coffey, John T.
1991
41-50 1-3 p. 43-60
18 p.
artikel
668 New complexity results on scheduling with small communication delays Picouleau, C.
1995
41-50 1-3 p. 331-342
12 p.
artikel
669 New lower bounds for the three-dimensional finite bin packing problem Boschetti, Marco A.
2004
41-50 1-3 p. 241-258
18 p.
artikel
670 New results on induced matchings Golumbic, Martin Charles
2000
41-50 1-3 p. 157-165
9 p.
artikel
671 New results on the enumeration of non-intersecting random walks Temperley, H.N.V.
1988
41-50 1-3 p. 367-379
13 p.
artikel
672 New upper and lower bounds on the channel capacity of read/write isolated memory Golin, Mordecai J.
2004
41-50 1-3 p. 35-48
14 p.
artikel
673 N-extendible posets, and how to minimize total weighted completion time Peter, Markus
2000
41-50 1-3 p. 157-167
11 p.
artikel
674 Non-adaptive group testing in the presence of errors Knill, E.
1998
41-50 1-3 p. 261-290
30 p.
artikel
675 Non-approximability of precedence-constrained sequencing to minimize setups Tovey, Craig A.
2004
41-50 1-3 p. 351-360
10 p.
artikel
676 Nonoverlapping local alignments (weighted independent sets of axis-parallel rectangles) Bafna, Vineet
1996
41-50 1-3 p. 41-53
13 p.
artikel
677 Non-standard approaches to integer programming Aardal, Karen
2002
41-50 1-3 p. 5-74
70 p.
artikel
678 Note on a helicopter search problem on graphs Fomin, Fedor V.
1999
41-50 1-3 p. 241-249
9 p.
artikel
679 Note on: N.E. Aguilera, M.S. Escalante, G.L. Nasini, “The disjunctive procedure and blocker duality” Leoni, V.
2005
41-50 1-3 p. 251-255
5 p.
artikel
680 Note on the problem of gossiping in multidimensional grids Mahéo, M
1994
41-50 1-3 p. 287-290
4 p.
artikel
681 Not every 2-tough graph is Hamiltonian Bauer, D.
2000
41-50 1-3 p. 317-321
5 p.
artikel
682 On a bidirected relaxation for the MULTIWAY CUT problem Chekuri, Chandra
2005
41-50 1-3 p. 67-79
13 p.
artikel
683 On aggregating two linear Diophantine equations Zhu, Nan
1998
41-50 1-3 p. 231-246
16 p.
artikel
684 On a kind of restricted edge connectivity of graphs Meng, Jixiang
2002
41-50 1-3 p. 183-193
11 p.
artikel
685 On a lower bound on the number of perfect binary codes Malyugin, S.A.
2004
41-50 1-3 p. 157-160
4 p.
artikel
686 On a multiconstrained model for chromatic scheduling de Werra, D.
1999
41-50 1-3 p. 171-180
10 p.
artikel
687 On an infinite sequence of improving Boolean bases Cherukhin, D.U.
2001
41-50 1-3 p. 95-108
14 p.
artikel
688 On an isoperimetric problem for Hamming graphs Harper, L.H.
1999
41-50 1-3 p. 285-309
25 p.
artikel
689 On a scheduling problem in a robotized analytical system Hertz, Alain
1996
41-50 1-3 p. 285-318
34 p.
artikel
690 On a unique tree representation for P 4-extendible graphs Jamison, B.
1991
41-50 1-3 p. 151-164
14 p.
artikel
691 On bandwidth-2 graphs Caprara, Alberto
2002
41-50 1-3 p. 1-13
13 p.
artikel
692 On Bayer's deformation and the associativity formula Spangher, Walter
1991
41-50 1-3 p. 225-233
9 p.
artikel
693 On characteristics of ancestral character-state reconstructions under the accelerated transformation optimization Narushima, Hiroshi
2002
41-50 1-3 p. 195-209
15 p.
artikel
694 On claw-free asteroidal triple-free graphs Hempel, Harald
2002
41-50 1-3 p. 155-180
26 p.
artikel
695 On combinatorial properties of the Arshon sequence Klepinin, A.V.
2001
41-50 1-3 p. 155-169
15 p.
artikel
696 On complexity of minimization and compression problems for models of sequential choice Sholomov, L.A.
2004
41-50 1-3 p. 281-300
20 p.
artikel
697 On complexity, representation and approximation of integral multicommodity flows Srivastav, Anand
2000
41-50 1-3 p. 183-208
26 p.
artikel
698 On component-size bounded Steiner trees Du, Ding-Zhu
1995
41-50 1-3 p. 131-140
10 p.
artikel
699 On connected list colorings of graphs Vizing, V.G.
2001
41-50 1-3 p. 295-300
6 p.
artikel
700 On cyclic 〈m,n〉-enumerations Perezhogin, A.L
2004
41-50 1-3 p. 235-243
9 p.
artikel
701 On (d,2)-dominating numbers of binary undirected de Bruijn graphs Lu, Changhong
2000
41-50 1-3 p. 137-145
9 p.
artikel
702 On decision and optimization (k,l)-graph sandwich problems Dantas, Simone
2004
41-50 1-3 p. 155-165
11 p.
artikel
703 On digital plane preimage structure Coeurjolly, D.
2005
41-50 1-3 p. 78-92
15 p.
artikel
704 On doing Todd-Coxeter coset enumeration in parallel Akl, S.
1991
41-50 1-3 p. 27-35
9 p.
artikel
705 On easy and hard hereditary classes of graphs with respect to the independent set problem Alekseev, Vladimir E.
2003
41-50 1-3 p. 17-26
10 p.
artikel
706 On enumerating all minimal solutions of feedback problems Schwikowski, Benno
2002
41-50 1-3 p. 253-265
13 p.
artikel
707 On enumeration of the perfect binary codes of length 15 Malyugin, S.A.
2004
41-50 1-3 p. 161-181
21 p.
artikel
708 On extendibility of voltage and current regimes from subnetworks Cel, J.
2000
41-50 1-3 p. 87-97
11 p.
artikel
709 On factor graphs of DOL words Frid, A.E.
2001
41-50 1-3 p. 121-130
10 p.
artikel
710 On finding a cyclic tour and a vehicle loading plan yielding maximum profit Gimadi, E.Kh.
2004
41-50 1-3 p. 105-111
7 p.
artikel
711 On finding a maximum spanning tree of bounded radius Serdjukov, A.I
2001
41-50 1-3 p. 249-253
5 p.
artikel
712 On generalized greedy splitting algorithms for multiway partition problems Zhao, Liang
2004
41-50 1-3 p. 130-143
14 p.
artikel
713 On generalized perfect graphs: bounded degree and bounded edge perfection Scheinerman, Edward R.
1993
41-50 1-3 p. 233-245
13 p.
artikel
714 On intervalizing k-colored graphs for DNA physical mapping Bodlaender, Hans L.
1996
41-50 1-3 p. 55-77
23 p.
artikel
715 On kernel-less clique-acyclic orientations of minimally imperfect graphs Sakuma, Tadashi
2001
41-50 1-3 p. 209-219
11 p.
artikel
716 On k nearest points of a finite set in a normed linear space Alvoni, Elisabetta
2004
41-50 1-3 p. 23-30
8 p.
artikel
717 On k-partitioning of Hamming graphs Bezrukov, S.L.
1999
41-50 1-3 p. 127-140
14 p.
artikel
718 On-line algorithms for ordered sets and comparability graphs Penrice, Stephen G.
1995
41-50 1-3 p. 319-329
11 p.
artikel
719 On local and global independence numbers of a graph Faudree, Ralph J.
2003
41-50 1-3 p. 79-84
6 p.
artikel
720 On lower bounds for numbered complete graphs Hansen, Pierre
1999
41-50 1-3 p. 205-225
21 p.
artikel
721 On maximal shadows of members in left-compressed sets Ahlswede, Rudolf
1999
41-50 1-3 p. 3-9
7 p.
artikel
722 On minimal coverings of the Boolean cube by centered antichains Kasim-Zade, O.M.
2001
41-50 1-3 p. 147-153
7 p.
artikel
723 On minimal imperfect graphs without induced P 5 Barré, Vincent
1999
41-50 1-3 p. 9-33
25 p.
artikel
724 On minimum cuts and the linear arrangement problem Horton, S.B.
2000
41-50 1-3 p. 127-139
13 p.
artikel
725 On minimum intersection of two minimum dominating sets of interval graphs Maw-Shang, Chang
1997
41-50 1-3 p. 41-50
10 p.
artikel
726 On (n,k)-sequences Song, Hong-Yeop
2000
41-50 1-3 p. 183-192
10 p.
artikel
727 On nonsystematic perfect binary codes of length 15 Romanov, A.M.
2004
41-50 1-3 p. 255-258
4 p.
artikel
728 On optimal broadcasting in faulty hypercubes Bruck, Jehoshua
1994
41-50 1-3 p. 3-13
11 p.
artikel
729 On paving matroids and a generalization of MDS codes Rajpal, Sanjay
1995
41-50 1-3 p. 343-347
5 p.
artikel
730 On perfect switching classes Hertz, Alain
1998
41-50 1-3 p. 263-267
5 p.
artikel
731 On perfect switching classes Hertz, Alain
1999
41-50 1-3 p. 3-7
5 p.
artikel
732 On Physical Mapping and the consecutive ones property for sparse matrices Atkins, Jonathan E.
1996
41-50 1-3 p. 23-40
18 p.
artikel
733 On polynomial complexity of a stochastic algorithm for mixed zero-one programs Jagannathan, Raj
2004
41-50 1-3 p. 91-103
13 p.
artikel
734 On preemptive scheduling: A general setting for the two-phase method Cochand, M.
1996
41-50 1-3 p. 157-166
10 p.
artikel
735 On probe interval graphs McMorris, F.R.
1998
41-50 1-3 p. 315-324
10 p.
artikel
736 On pseudomodular matroids and adjoints Alfter, M.
1995
41-50 1-3 p. 3-11
9 p.
artikel
737 On 1-rate wide-sense nonblocking for 3-stage Clos networks Fishburn, Peter
1997
41-50 1-3 p. 75-87
13 p.
artikel
738 On shortest three-edge-connected Steiner networks with Euclidean distance Hsu, D.Frank
2000
41-50 1-3 p. 141-152
12 p.
artikel
739 On some algorithmic investigations of star partitions of graphs Cvetković, Dragos̆
1995
41-50 1-3 p. 119-130
12 p.
artikel
740 On some counting polynomials in chemistry Hosoya, Haruo
1988
41-50 1-3 p. 239-257
19 p.
artikel
741 On some infinite series of (r,1)-designs Gropp, Harald
2000
41-50 1-3 p. 13-21
9 p.
artikel
742 On some multicriteria arborescence problems: Complexity and algorithms Dell'Amico, Mauro
1996
41-50 1-3 p. 191-206
16 p.
artikel
743 On some new types of greedy chains and greedy linear extensions of partially ordered sets Syslo, Maciej M.
1995
41-50 1-3 p. 349-358
10 p.
artikel
744 On stable cutsets in graphs Brandstädt, Andreas
2000
41-50 1-3 p. 39-50
12 p.
artikel
745 On strongly context-free languages Ilie, Lucian
2000
41-50 1-3 p. 153-165
13 p.
artikel
746 On subclasses of minimal unsatisfiable formulas Büning, Hans Kleine
2000
41-50 1-3 p. 83-98
16 p.
artikel
747 On testing consecutive-ones property in parallel Annexstein, Fred
1998
41-50 1-3 p. 7-28
22 p.
artikel
748 On the algorithmic complexity of twelve covering and independence parameters of graphs Manlove, David F.
1999
41-50 1-3 p. 155-175
21 p.
artikel
749 On the approximability of the Steiner tree problem in phylogeny Fernández-Baca, David
1998
41-50 1-3 p. 129-145
17 p.
artikel
750 On the asymptotics of the number of binary words with a given length of a maximal series Korshunov, A.D.
2001
41-50 1-3 p. 171-201
31 p.
artikel
751 On the average Hamming distance for binary codes Shutao, Xia
1998
41-50 1-3 p. 269-276
8 p.
artikel
752 On the average Steiner distance of graphs with prescribed properties Dankelmann, Peter
1997
41-50 1-3 p. 91-103
13 p.
artikel
753 On the b-dominating coloring of graphs Hoàng, Chính T.
2005
41-50 1-3 p. 176-186
11 p.
artikel
754 On the binary solitaire cone Avis, David
2001
41-50 1-3 p. 3-14
12 p.
artikel
755 On the bound for anonymous secret sharing schemes Kishimoto, Wataru
2002
41-50 1-3 p. 193-202
10 p.
artikel
756 On the classification of NP-complete problems in terms of their correlation coefficient Angel, Eric
2000
41-50 1-3 p. 261-277
17 p.
artikel
757 On the complexity and approximation of syntenic distance Dasgupta, Bhaskar
1998
41-50 1-3 p. 59-82
24 p.
artikel
758 On the complexity of comparing evolutionary trees Hein, Jotun
1996
41-50 1-3 p. 153-169
17 p.
artikel
759 On the complexity of graph tree partition problems Cordone, Roberto
2004
41-50 1-3 p. 51-65
15 p.
artikel
760 On the complexity of hamiltonian path and cycle problems in certain classes of digraphs Bang-Jensen, Jørgen
1999
41-50 1-3 p. 41-60
20 p.
artikel
761 On the Complexity of Linear Programming in the BSS-model Bär, G.
1999
41-50 1-3 p. 35-40
6 p.
artikel
762 On the complexity of postoptimality analysis of 0 1 programs Van Hoesel, Stan
1999
41-50 1-3 p. 251-263
13 p.
artikel
763 On the complexity of string folding Paterson, Mike
1996
41-50 1-3 p. 217-230
14 p.
artikel
764 On the complexity of the approximation of nonplanarity parameters for cubic graphs Faria, Luerbio
2004
41-50 1-3 p. 119-134
16 p.
artikel
765 On the complexity of unfrozen problems Beacham, Adam
2005
41-50 1-3 p. 3-24
22 p.
artikel
766 On the computational complexity of defining sets Hatami, Hamed
2005
41-50 1-3 p. 101-110
10 p.
artikel
767 On the computational complexity of edge concentration Lin, Xuemin
2000
41-50 1-3 p. 197-205
9 p.
artikel
768 On the computational power of DNA Boneh, Dan
1996
41-50 1-3 p. 79-94
16 p.
artikel
769 On the consecutive ones property Meidanis, João
1998
41-50 1-3 p. 325-354
30 p.
artikel
770 On the construction of most reliable networks Deng, Hanyuan
2004
41-50 1-3 p. 19-33
15 p.
artikel
771 On the covering radius of an unrestricted code as a function of the rate and dual distance Litsyn, Simon
1998
41-50 1-3 p. 177-191
15 p.
artikel
772 On the cut-off point for combinatorial group testing Fischer, Paul
1999
41-50 1-3 p. 83-92
10 p.
artikel
773 On the deficiency of bipartite graphs Giaro, Krzysztof
1999
41-50 1-3 p. 193-203
11 p.
artikel
774 On the definition and the construction of pockets in macromolecules Edelsbrunner, Herbert
1998
41-50 1-3 p. 83-102
20 p.
artikel
775 On the dimension of projected polyhedra Balas, Egon
1998
41-50 1-3 p. 1-9
9 p.
artikel
776 On the disc-structure of perfect graphs I the co-paw-structure Hoàng, Chinh T.
1999
41-50 1-3 p. 247-262
16 p.
artikel
777 On the distance function approach to color image enhancement Szczepanski, M
2004
41-50 1-3 p. 283-305
23 p.
artikel
778 On the dominant of the Steiner 2-edge connected subgraph polytope Baı̈ou, Mourad
2001
41-50 1-3 p. 3-10
8 p.
artikel
779 On the double competition number Füredi, Zoltán
1998
41-50 1-3 p. 251-255
5 p.
artikel
780 On the equivalence between some local and global Chinese postman and traveling salesman graphs Granot, Daniel
2004
41-50 1-3 p. 67-76
10 p.
artikel
781 On the equivalence of two tree mapping measures Eulenstein, O.
1998
41-50 1-3 p. 103-128
26 p.
artikel
782 On the essential test sets of discrete matrices Kogan, Alexander
1995
41-50 1-3 p. 249-255
7 p.
artikel
783 On the extension of bipartite to parity graphs Cicerone, Serafino
1999
41-50 1-3 p. 181-195
15 p.
artikel
784 On the facets of the simple plant location packing polytope Cánovas, Lázaro
2002
41-50 1-3 p. 27-53
27 p.
artikel
785 On the fractal structure of the rescaled evolution set of Carlitz sequences of polynomials von Haeseler, F.
2000
41-50 1-3 p. 89-109
21 p.
artikel
786 On the Frame–Stewart algorithm for the multi-peg Tower of Hanoi problem Klavžar, Sandi
2002
41-50 1-3 p. 141-157
17 p.
artikel
787 On the integral dicycle packings and covers and the linear ordering polytope Nutov, Zeev
1995
41-50 1-3 p. 293-309
17 p.
artikel
788 On the linear relaxation of the 2-node connected subgraph polytope Mahjoub, A.R
1999
41-50 1-3 p. 389-416
28 p.
artikel
789 On the mathematical model of triangulanes Muzychuk, Mikhail E.
1996
41-50 1-3 p. 175-187
13 p.
artikel
790 On the min DSS problem of closed discrete curves Feschet, F.
2005
41-50 1-3 p. 138-153
16 p.
artikel
791 On the nonexistence of extremal self-dual codes Shengyuan, Zhang
1999
41-50 1-3 p. 277-286
10 p.
artikel
792 On the number of Abelian square-free words on four letters Carpi, Arturo
1998
41-50 1-3 p. 155-167
13 p.
artikel
793 On the number of connected sets with the neighborhood of a given size in a graph Sapozhenko, A.A.
2001
41-50 1-3 p. 233-247
15 p.
artikel
794 On the number of vertices belonging to all maximum stable sets of a graph Boros, Endre
2002
41-50 1-3 p. 17-25
9 p.
artikel
795 On the odd cycles of normal graphs De Simone, Caterina
1999
41-50 1-3 p. 161-169
9 p.
artikel
796 On the optimal strongly connected orientations of city street graphs IV: Four east-west avenues or north-south streets Roberts, Fred S.
1994
41-50 1-3 p. 331-356
26 p.
artikel
797 On the PBD-closure of sets containing 3 Grüttmüller, M.
1999
41-50 1-3 p. 251-272
22 p.
artikel
798 On the p-connectedness of graphs – a survey Babel, Luitpold
1999
41-50 1-3 p. 11-33
23 p.
artikel
799 On the power of circular splicing Bonizzoni, P.
2005
41-50 1-3 p. 51-66
16 p.
artikel
800 On the primer selection problem in polymerase chain reaction experiments Pearson, William R.
1996
41-50 1-3 p. 231-246
16 p.
artikel
801 On the quality of local search for the quadratic assignment problem Angel, Eric
1998
41-50 1-3 p. 15-25
11 p.
artikel
802 On the relations between arboricity and independent number or covering number Zhongfu, Zhang
1998
41-50 1-3 p. 279-283
5 p.
artikel
803 On the relations between SAT and CSP enumerative algorithms Génisson, Richard
2000
41-50 1-3 p. 27-40
14 p.
artikel
804 On the robustness of primitive words Păun, Gheorghe
2002
41-50 1-3 p. 239-252
14 p.
artikel
805 On the search of optimal order of variables in the synthesis of switching circuits by cascade technique Grinchuk, M.I.
2004
41-50 1-3 p. 113-123
11 p.
artikel
806 On the size of maximum renamable Horn sub-CNF Kučera, Petr
2005
41-50 1-3 p. 126-130
5 p.
artikel
807 On the SPANNING k-TREE problem Cai, Leizhen
1993
41-50 1-3 p. 139-156
18 p.
artikel
808 On the stability number of claw-free P 5-free and more general graphs Brandstädt, Andreas
1999
41-50 1-3 p. 163-167
5 p.
artikel
809 On the strong chromatic index of cyclic multigraphs Gvozdjak, Pavol
2000
41-50 1-3 p. 23-38
16 p.
artikel
810 On the structure and stability number of P 5- and co-chair-free graphs Brandstädt, Andreas
2003
41-50 1-3 p. 47-65
19 p.
artikel
811 On the structure of connected locally GQ(3,9)-graphs Makhnev, A.A.
2004
41-50 1-3 p. 143-156
14 p.
artikel
812 On the structure of graphs with few P 4 s Babel, Luitpold
1998
41-50 1-3 p. 1-13
13 p.
artikel
813 On the subword complexity of iteratively generated infinite words Frid, A.E.
2001
41-50 1-3 p. 115-120
6 p.
artikel
814 On the typical case complexity of graph optimization Faragó, András
2005
41-50 1-3 p. 73-88
16 p.
artikel
815 On the upper chromatic number of (v 3,b 2)-configurations Arbib, Claudio
2002
41-50 1-3 p. 3-12
10 p.
artikel
816 On the use of Boolean methods for the computation of the stability number Hertz, Alain
1997
41-50 1-3 p. 183-203
21 p.
artikel
817 On trades: an update Khosrovshahi, G.B.
1999
41-50 1-3 p. 361-376
16 p.
artikel
818 On trees and noncrossing partitions Klazar, Martin
1998
41-50 1-3 p. 263-269
7 p.
artikel
819 On uniform k-partition problems Dell’Olmo, Paolo
2005
41-50 1-3 p. 121-139
19 p.
artikel
820 On variations of the subset sum problem Alfonsín, J.L. Ramírez
1998
41-50 1-3 p. 1-7
7 p.
artikel
821 On well-covered triangulations: Part I Finbow, A.
2003
41-50 1-3 p. 97-108
12 p.
artikel
822 On Wiener numbers of polygonal nets Shiu, Wai Chee
2002
41-50 1-3 p. 251-261
11 p.
artikel
823 Open shop problem with zero-one time operations and integer release date/deadline intervals Kubale, Marek
1997
41-50 1-3 p. 213-223
11 p.
artikel
824 Open shop scheduling problems with late work criteria Błażewicz, Jacek
2004
41-50 1-3 p. 1-24
24 p.
artikel
825 Open shop scheduling with maximal machines Kyparisis, George J.
1997
41-50 1-3 p. 175-187
13 p.
artikel
826 Optimal algorithms for dissemination of information in generalized communication modes Feldmann, R.
1994
41-50 1-3 p. 55-78
24 p.
artikel
827 Optimal arrangement of data in a tree directory Luczak, M.J.
2002
41-50 1-3 p. 307-315
9 p.
artikel
828 Optimal binary trees with order constraints Sebö, András
1999
41-50 1-3 p. 305-311
7 p.
artikel
829 Optimal cell flipping to minimize channel density in VLSI design and pseudo-Boolean optimization Boros, Endre
1999
41-50 1-3 p. 69-88
20 p.
artikel
830 Optimal channel allocation for several types of cellular radio networks Niessen, Thomas
1997
41-50 1-3 p. 155-170
16 p.
artikel
831 Optimal communication algorithms for manhattan street networks Varvarigos, Emmanouel A.
1998
41-50 1-3 p. 303-326
24 p.
artikel
832 Optimal communication channel utilization for matrix transposition and related permutations on binary cubes Johnsson, S.Lennart
1994
41-50 1-3 p. 251-274
24 p.
artikel
833 Optimal discovery of repetitions in 2D Apostolico, Alberto
2005
41-50 1-3 p. 5-20
16 p.
artikel
834 Optimal layout of edge-weighted forests Fischer, Michael J
1999
41-50 1-3 p. 135-159
25 p.
artikel
835 Optimal layouts on a chain ATM network Gerstel, Ornan (Ori)
1998
41-50 1-3 p. 157-178
22 p.
artikel
836 Optimal L ( d , 1 ) -labelings of certain direct products of cycles and Cartesian products of cycles Jha, Pranava K.
2005
41-50 1-3 p. 257-265
9 p.
artikel
837 Optimal ordered binary decision diagrams for read-once formulas Sauerhoff, Martin
2000
41-50 1-3 p. 237-258
22 p.
artikel
838 Optimal orientations of products of paths and cycles Koh, K.M.
1997
41-50 1-3 p. 163-174
12 p.
artikel
839 Optimal paths in network games with p players Boliac, R.
2000
41-50 1-3 p. 339-348
10 p.
artikel
840 Optimal wavelength-routed multicasting Beauquier, Bruno
1998
41-50 1-3 p. 15-20
6 p.
artikel
841 Optimization and reconstruction of hv -convex ( 0 , 1 ) -matrices Dahl, Geir
2005
41-50 1-3 p. 93-105
13 p.
artikel
842 Optimization of basis functions for both reconstruction and visualization Garduño, Edgar
2004
41-50 1-3 p. 95-111
17 p.
artikel
843 Optimum partitioning into intersections of ring families Cochand, Maurice
1997
41-50 1-3 p. 81-91
11 p.
artikel
844 Ordered binary decision diagrams and the Shannon effect Gröpl, Clemens
2004
41-50 1-3 p. 67-85
19 p.
artikel
845 Ordering graphs with small index and its application Zhang, Fuji
2002
41-50 1-3 p. 295-306
12 p.
artikel
846 Order-preserving, upward drawing of binary trees using fewer bends Kim, Sung Kwon
2004
41-50 1-3 p. 318-323
6 p.
artikel
847 Orientations of digraphs almost preserving diameter Gutin, Gregory
2002
41-50 1-3 p. 129-138
10 p.
artikel
848 Orthogonal double covers of complete graphs by trees of small diameter Leck, Uwe
1999
41-50 1-3 p. 377-388
12 p.
artikel
849 Outpaths in semicomplete multipartite digraphs Guo, Yubao
1999
41-50 1-3 p. 273-277
5 p.
artikel
850 Overlap-free morphisms and finite test-sets Richomme, G.
2004
41-50 1-3 p. 92-109
18 p.
artikel
851 Packing equal circles in a square: a deterministic global optimization approach Locatelli, Marco
2002
41-50 1-3 p. 139-166
28 p.
artikel
852 Pancyclic orderings of in-tournaments Tewes, Meike
2002
41-50 1-3 p. 239-249
11 p.
artikel
853 Pancyclic out-arcs of a vertex in tournaments Yao, Tianxing
2000
41-50 1-3 p. 245-249
5 p.
artikel
854 Panelling planar graphs Oxley, James
1998
41-50 1-3 p. 109-122
14 p.
artikel
855 Parallel machine scheduling with splitting jobs Xing, Wenxun
2000
41-50 1-3 p. 259-269
11 p.
artikel
856 ℓ -Parametric eigenproblem in max-algebra Plavka, Ján
2005
41-50 1-3 p. 16-28
13 p.
artikel
857 Partial and perfect path covers of cographs Kirkpatrick, D.G.
1998
41-50 1-3 p. 143-153
11 p.
artikel
858 Partial monotonizations of Hamiltonian cycle polytopes: dimensions and diameters Sierksma, Gerard
2000
41-50 1-3 p. 173-182
10 p.
artikel
859 Partitioning a matrix to minimize the maximum cost Mingozzi, Aristide
1995
41-50 1-3 p. 221-248
28 p.
artikel
860 Partitioning chordal graphs into independent sets and cliques Hell, Pavol
2004
41-50 1-3 p. 185-194
10 p.
artikel
861 Partitioning single-molecule maps into multiple populations: algorithms and probabilistic analysis Parida, Laxmi
2000
41-50 1-3 p. 203-227
25 p.
artikel
862 Partitions and network reliability Tittmann, Peter
1999
41-50 1-3 p. 445-453
9 p.
artikel
863 Path covering problems and testing of printed circuits Andreatta, Giovanni
1995
41-50 1-3 p. 5-13
9 p.
artikel
864 Path optimization for graph partitioning problems Berry, Jonathan W
1999
41-50 1-3 p. 27-50
24 p.
artikel
865 Paths with minimum range and ratio of arc lengths Hansen, Pierre
1997
41-50 1-3 p. 89-102
14 p.
artikel
866 P 4-domination in minimal imperfect graphs Rusu, Irena
1999
41-50 1-3 p. 329-336
8 p.
artikel
867 Perfect and almost perfect sequences Jungnickel, Dieter
1999
41-50 1-3 p. 331-359
29 p.
artikel
868 Perfect binary (n,3) codes: the structure of graphs of minimum distances Avgustinovich, S.V.
2001
41-50 1-3 p. 9-11
3 p.
artikel
869 Perfect broadcasting in unlabeled networks Diks, Krzysztof
1998
41-50 1-3 p. 33-47
15 p.
artikel
870 Performance of Coffman-Graham schedules in the presence of unit communication delays Hanen, C.
1998
41-50 1-3 p. 93-108
16 p.
artikel
871 Periodic gossiping on trees Labahn, Roger
1994
41-50 1-3 p. 235-245
11 p.
artikel
872 Permutation polytopes corresponding to strongly supermodular functions Hwang, Frank K
2004
41-50 1-3 p. 87-97
11 p.
artikel
873 Permuting matrices to avoid forbidden submatrices Klinz, Bettina
1995
41-50 1-3 p. 223-248
26 p.
artikel
874 P 5-free augmenting graphs and the maximum stable set problem Gerber, Michael U.
2003
41-50 1-3 p. 109-119
11 p.
artikel
875 Phorma: perfectly hashable order restricted multidimensional arrays Lins, Lauro
2004
41-50 1-3 p. 209-223
15 p.
artikel
876 Phylogeny numbers Roberts, Fred S.
1998
41-50 1-3 p. 213-228
16 p.
artikel
877 Phylogeny numbers for graphs with two triangles Roberts, Fred S.
2000
41-50 1-3 p. 191-207
17 p.
artikel
878 Plane elementary bipartite graphs Zhang, Heping
2000
41-50 1-3 p. 291-311
21 p.
artikel
879 2-Point site Voronoi diagrams Barequet, Gill
2002
41-50 1-3 p. 37-54
18 p.
artikel
880 Polyhedral analysis and decompositions for capacitated plant location-type problems Chena, Bintong
1998
41-50 1-3 p. 79-91
13 p.
artikel
881 Polyhedral characterizations and perfection of line graphs Cao, Dasong
1998
41-50 1-3 p. 141-154
14 p.
artikel
882 Polyhedral graphs with extreme numbers of types of faces Walther, Hansjoachim
2002
41-50 1-3 p. 263-274
12 p.
artikel
883 Polyhedral graphs without hamiltonian cycles Walther, Hansjoachim
1997
41-50 1-3 p. 257-263
7 p.
artikel
884 Polyhedral structure of submodular and posi-modular systems Nagamochi, Hiroshi
2000
41-50 1-3 p. 165-189
25 p.
artikel
885 Polynomial algorithm for finding the largest independent sets in graphs without forks Alekseev, V.E.
2004
41-50 1-3 p. 3-16
14 p.
artikel
886 Polynomial algorithms that prove an NP-Hard hypothesis implies an NP-hard conclusion Bauer, D.
2002
41-50 1-3 p. 13-23
11 p.
artikel
887 Polynomial invariants for trees a statistical mechanics approach Conti, Roberto
1998
41-50 1-3 p. 225-237
13 p.
artikel
888 Polynomially solvable cases for the maximum stable set problem Hertz, Alain
1995
41-50 1-3 p. 195-210
16 p.
artikel
889 Polynomial-time algorithm for computing translocation distance between genomes Hannenhalli, Sridhar
1996
41-50 1-3 p. 137-151
15 p.
artikel
890 Polynomial-time approximation of largest simplices in V-polytopes Packer, Asa
2004
41-50 1-3 p. 213-237
25 p.
artikel
891 Polynomial transformations and data-independent neighborhood functions Armstrong, Derek E.
2004
41-50 1-3 p. 272-284
13 p.
artikel
892 Positive feedback loops and multistationarity Thomas, R.
1988
41-50 1-3 p. 381-396
16 p.
artikel
893 Post classes characterized by functional terms Foldes, Stephan
2004
41-50 1-3 p. 35-51
17 p.
artikel
894 Powers of geometric intersection graphs and dispersion algorithms Agnarsson, Geir
2003
41-50 1-3 p. 3-16
14 p.
artikel
895 Practical experiments of broadcasting algorithms on a configurable parallel computer Michallon, Philippe
1994
41-50 1-3 p. 291-298
8 p.
artikel
896 Preassignment requirements in chromatic scheduling de Werra, D.
1997
41-50 1-3 p. 93-101
9 p.
artikel
897 Preface W. Eglese, Richard
2003
41-50 1-3 p. 1-2
2 p.
artikel
898 Preface Boros, Endre
2002
41-50 1-3 p. 1-4
4 p.
artikel
899 Preface Lucertini, Mario
1995
41-50 1-3 p. 1-3
3 p.
artikel
900 Preface Mattson Jr, H.F.
1991
41-50 1-3 p. 1-2
2 p.
artikel
901 Preface Boros, Endre
1995
41-50 1-3 p. 1-
1 p.
artikel
902 Preface Katoh, Naoki
2001
41-50 1-3 p. 1-
1 p.
artikel
903 Preface 2000
41-50 1-3 p. 1-2
2 p.
artikel
904 Preface Borodin, Oleg
2001
41-50 1-3 p. 1-
1 p.
artikel
905 Preface Labbé, Martine
2001
41-50 1-3 p. 1-
1 p.
artikel
906 Preface Simion, Rodica
1991
41-50 1-3 p. 1-2
2 p.
artikel
907 Preface Hertz, Alain
1996
41-50 1-3 p. 1-3
3 p.
artikel
908 Preface 1997
41-50 1-3 p. 1-2
2 p.
artikel
909 Preface Liestman, Arthur L.
1994
41-50 1-3 p. 1-
1 p.
artikel
910 Preface Faigle, Ulrich
1997
41-50 1-3 p. 1-
1 p.
artikel
911 Preface Hertz, A.
1994
41-50 1-3 p. 1-2
2 p.
artikel
912 Preface 1998
41-50 1-3 p. 1-2
2 p.
artikel
913 Preface Carlier, Jacques
1999
41-50 1-3 p. 1-
1 p.
artikel
914 Preface Hahn, Geňa
1989
41-50 1-3 p. 1-2
2 p.
artikel
915 Preface Fourey, Sébastien
2004
41-50 1-3 p. 1-3
3 p.
artikel
916 Preface Reed, Bruce A
2004
41-50 1-3 p. 1-
1 p.
artikel
917 Preface Borodin, Oleg
2004
41-50 1-3 p. 1-
1 p.
artikel
918 Preface Di Gesù, Vito
2005
41-50 1-3 p. 3-
1 p.
artikel
919 Preface for advanced discrete optimization techniques for VLSI layout problems Hoffman, Alan J
1999
41-50 1-3 p. 1-2
2 p.
artikel
920 Probabilistic estimates for the generalized maximum satisfiability problem Cochand, M.
1994
41-50 1-3 p. 143-163
21 p.
artikel
921 Probe location in the presence of errors: a problem from DNA mapping Mumey, Brendan
2000
41-50 1-3 p. 187-201
15 p.
artikel
922 Production planning problems in printed circuit board assembly Crama, Yves
2002
41-50 1-3 p. 339-361
23 p.
artikel
923 Projective planes and congestion-free networks Colbourn, Charles J.
2002
41-50 1-3 p. 117-126
10 p.
artikel
924 Proper and unit tolerance graphs Bogart, Kenneth P.
1995
41-50 1-3 p. 99-117
19 p.
artikel
925 Properly coloured Hamiltonian paths in edge-coloured complete graphs Bang-Jensen, J.
1998
41-50 1-3 p. 247-250
4 p.
artikel
926 Properties of some ILP formulations of a class of partitioning problems Caprara, Alberto
1998
41-50 1-3 p. 11-23
13 p.
artikel
927 Pruning the search tree in the constructive enumeration of molecular graphs Pospíchal, Jir̆í
1996
41-50 1-3 p. 189-207
19 p.
artikel
928 Pseudo-Boolean optimization Boros, Endre
2002
41-50 1-3 p. 155-225
71 p.
artikel
929 Publisher's announcement 2005
41-50 1-3 p. 1-
1 p.
artikel
930 Pushing vertices in digraphs without long induced cycles Huang, Jing
2002
41-50 1-3 p. 181-192
12 p.
artikel
931 Pyramidal tours with step-backs and the asymmetric traveling salesman problem Enomoto, Hikoe
1998
41-50 1-3 p. 57-65
9 p.
artikel
932 Pyramids and weak hierarchies in the ordinal model for clustering Bertrand, P.
2002
41-50 1-3 p. 55-81
27 p.
artikel
933 q-functional equations and some partition identities Agarwal, A.K.
1991
41-50 1-3 p. 17-26
10 p.
artikel
934 Quasi-median graphs from sets of partitions Bandelt, H.-J.
2002
41-50 1-3 p. 23-35
13 p.
artikel
935 Ramsey numbers r(K 3, G) for connected graphs G of order seven Schelten, Annette
1997
41-50 1-3 p. 189-200
12 p.
artikel
936 Randić ordering of chemical trees Rada, Juan
2005
41-50 1-3 p. 232-250
19 p.
artikel
937 Random Hypergraphs and topological gelation criterion for crosslinked polymer systems Klonowski, Włodzimierz
1988
41-50 1-3 p. 271-288
18 p.
artikel
938 Reading list for the capital city conference on combinatorics and theoretical computer science (George Washington University, Washington, DC, May 22–26, 1989) 1991
41-50 1-3 p. 285-287
3 p.
artikel
939 Real royal road functions—where crossover provably is essential Jansen, Thomas
2005
41-50 1-3 p. 111-125
15 p.
artikel
940 Reasoning with ordered binary decision diagrams Horiyama, Takashi
2004
41-50 1-3 p. 151-163
13 p.
artikel
941 Recent advances on two-dimensional bin packing problems Lodi, Andrea
2002
41-50 1-3 p. 379-396
18 p.
artikel
942 Recognition and isomorphism of tree-like P4 -connected graphs Babel, Luitpold
2000
41-50 1-3 p. 295-315
21 p.
artikel
943 Recognition of tractable satisfiability problems through balanced polynomial representations Warners, Joost P.
2000
41-50 1-3 p. 229-244
16 p.
artikel
944 Recognizing clique graphs of directed and rooted path graphs Prisner, Erich
1999
41-50 1-3 p. 321-328
8 p.
artikel
945 Recognizing graphs of acyclic cubical complexes Imrich, Wilfried
1999
41-50 1-3 p. 321-330
10 p.
artikel
946 Recognizing interval digraphs and interval bigraphs in polynomial time Müller, Haiko
1997
41-50 1-3 p. 189-205
17 p.
artikel
947 Recognizing k-path graphs Prisner, Erich
2000
41-50 1-3 p. 169-181
13 p.
artikel
948 Recognizing the P 4-structure of block graphs Brandstädt, Andreas
2000
41-50 1-3 p. 349-366
18 p.
artikel
949 Reconstructing a Hamiltonian cycle by querying the graph: Application to DNA physical mapping Grebinski, Vladimir
1998
41-50 1-3 p. 147-165
19 p.
artikel
950 Reconstructing a history of recombinations from a set of sequences Kececioglu, John
1998
41-50 1-3 p. 239-260
22 p.
artikel
951 Reconstructing phylogenies from nucleotide pattern probabilities: A survey and some new results Steel, Mike
1998
41-50 1-3 p. 367-396
30 p.
artikel
952 Reconstruction of hv-convex binary matrices from their absorbed projections Kuba, Attila
2004
41-50 1-3 p. 137-148
12 p.
artikel
953 Recurrence relations for the spectrum polynomial of a matroid Kook, W.
2004
41-50 1-3 p. 312-317
6 p.
artikel
954 Redfield's papers and their relevance to counting isomers and isomerizations Lloyd, E.Keith
1988
41-50 1-3 p. 289-304
16 p.
artikel
955 Reduced first-level representations via the reformulation-linearization technique: results, counterexamples, and computations Sherali, Hanif D.
2000
41-50 1-3 p. 247-267
21 p.
artikel
956 Reducible configurations for the cycle double cover conjecture Huck, Andreas
2000
41-50 1-3 p. 71-90
20 p.
artikel
957 Reduction of symmetric configurations n 3 Carstens, H.G.
2000
41-50 1-3 p. 401-411
11 p.
artikel
958 Redundancy estimates for the Lempel–Ziv algorithm of data compression Potapov, V.N.
2004
41-50 1-3 p. 245-254
10 p.
artikel
959 Reference list of indexed articles 2000
41-50 1-3 p. 121-175
55 p.
artikel
960 Reflectiveness and compression of threshold transformations Ueda, Takao
2000
41-50 1-3 p. 215-224
10 p.
artikel
961 Regular affine tilings and regular maps on a flat torus Szucs, J.M.
2000
41-50 1-3 p. 225-237
13 p.
artikel
962 Relationship of M-/L-convex functions with discrete convex functions by Miller and Favati–Tardella Murota, Kazuo
2001
41-50 1-3 p. 151-176
26 p.
artikel
963 Reliability evaluation of large telecommunication networks Carlier, Jacques
1997
41-50 1-3 p. 61-80
20 p.
artikel
964 Reliable broadcasting Gargano, Luisa
1994
41-50 1-3 p. 135-148
14 p.
artikel
965 Reliable broadcasting in product networks Bao, Feng
1998
41-50 1-3 p. 3-20
18 p.
artikel
966 Replacing cliques by stars in quasi-median graphs Huber, Katharina T.
2004
41-50 1-3 p. 194-203
10 p.
artikel
967 Residual reliability of P-threshold graphs Chernyak, A.A.
2004
41-50 1-3 p. 83-95
13 p.
artikel
968 Resolution complexity of random constraint satisfaction problems: Another half of the story Gao, Yong
2005
41-50 1-3 p. 124-140
17 p.
artikel
969 Resolvability in graphs and the metric dimension of a graph Chartrand, Gary
2000
41-50 1-3 p. 99-113
15 p.
artikel
970 Resonance in elemental benzenoids Klein, D.J.
1996
41-50 1-3 p. 157-173
17 p.
artikel
971 Retractions of finite distance functions onto tree metrics Moulton, Vincent
1999
41-50 1-3 p. 215-233
19 p.
artikel
972 Reverse search for enumeration Avis, David
1996
41-50 1-3 p. 21-46
26 p.
artikel
973 Rigidity of multi-story buildings Radics, Norbert
2001
41-50 1-3 p. 187-198
12 p.
artikel
974 Routing a vehicle of capacity greater than one Guan, D.J.
1998
41-50 1-3 p. 41-57
17 p.
artikel
975 Routing multiterminal nets on a hexagonal grid Tan, Xuehou
1999
41-50 1-3 p. 245-255
11 p.
artikel
976 Rutgers University, Department of Management Science and Information Systems and RUTCOR - Rutgers Center for Operations Research 1991
41-50 1-3 p. 271-
1 p.
artikel
977 Salient and reentrant points of discrete sets Daurat, Alain
2005
41-50 1-3 p. 106-121
16 p.
artikel
978 Sampling properties of the discrete radon transform Svalbe, Imants
2004
41-50 1-3 p. 265-281
17 p.
artikel
979 Sandpiles and order structure of integer partitions Goles, Eric
2002
41-50 1-3 p. 51-64
14 p.
artikel
980 SAT distributions with planted assignments and phase transitions between decision and optimization problems Dimitriou, Tassos
2005
41-50 1-3 p. 58-72
15 p.
artikel
981 2-satisfiability and diagnosing faulty processors in massively parallel computing systems Bagchi, Ansuman
1995
41-50 1-3 p. 25-37
13 p.
artikel
982 Scaling properties of generalized Carlitz sequences of polynomials Barbé, A.
2004
41-50 1-3 p. 166-181
16 p.
artikel
983 Scheduling a divisible task in a two-dimensional toroidal mesh Błażewicz, Jacek
1999
41-50 1-3 p. 35-50
16 p.
artikel
984 Scheduling and constraint propagation Brucker, Peter
2002
41-50 1-3 p. 227-256
30 p.
artikel
985 Scheduling equal-length jobs on identical parallel machines Baptiste, Philippe
2000
41-50 1-3 p. 21-32
12 p.
artikel
986 Scheduling groups of tasks with precedence constraints on three dedicated processors Mansini, Renata
2004
41-50 1-3 p. 141-168
28 p.
artikel
987 Scheduling imprecise computation tasks with 0 1 -constraint Ho, Kevin I-J.
1997
41-50 1-3 p. 117-132
16 p.
artikel
988 Scheduling independent tasks with multiple modes Bianco, L.
1995
41-50 1-3 p. 35-50
16 p.
artikel
989 Scheduling one batch processor subject to job release dates Liu, Zhaohui
2000
41-50 1-3 p. 129-136
8 p.
artikel
990 Scheduling problems for parallel dedicated machines under multiple resource constraints Kellerer, H.
2003
41-50 1-3 p. 45-68
24 p.
artikel
991 Scheduling projects with labor constraints Cavalcante, C.C.B.
2001
41-50 1-3 p. 27-52
26 p.
artikel
992 Scheduling tree-like task systems with non-uniform deadlines subject to unit-length communication delays Verriet, Jacques
2000
41-50 1-3 p. 269-289
21 p.
artikel
993 Score certificate numbers of upset tournaments Poet, Jeffrey L.
2000
41-50 1-3 p. 177-189
13 p.
artikel
994 Searching expenditure and interval graphs Fomin, Fedor V.
2004
41-50 1-3 p. 97-104
8 p.
artikel
995 Searching for a counterfeit coin with two unreliable weighings Liu, Wen-An
2005
41-50 1-3 p. 160-181
22 p.
artikel
996 Searching for two counterfeit coins with two-arms balance Liu, Wen An
2005
41-50 1-3 p. 187-212
26 p.
artikel
997 Searching in trees Recker, Frank
2004
41-50 1-3 p. 169-183
15 p.
artikel
998 Selected topics on assignment problems Burkard, Rainer E.
2002
41-50 1-3 p. 257-302
46 p.
artikel
999 Selecting the k largest elements with parity tests Lam, Tak Wah
2000
41-50 1-3 p. 187-196
10 p.
artikel
1000 Self-dual codes and Hadamard matrices Tonchev, Vladimir D.
1991
41-50 1-3 p. 235-240
6 p.
artikel
                             1210 gevonden resultaten
 
   volgende >>
 
 Koninklijke Bibliotheek - Nationale Bibliotheek van Nederland