Digitale Bibliotheek
Sluiten Bladeren door artikelen uit een tijdschrift
     Tijdschrift beschrijving
       Alle jaargangen van het bijbehorende tijdschrift
         Alle afleveringen van het bijbehorende jaargang
                                       Alle artikelen van de bijbehorende aflevering
 
                             336 gevonden resultaten
nr titel auteur tijdschrift jaar jaarg. afl. pagina('s) type
1 Acknowledgement Hammer, PeterL.
1991
81-90 2-3 p. 99-
1 p.
artikel
2 A class of generalized greedy algorithms for the multi-knapsack problem Rinnooy Kan, A.H.G.
1993
81-90 2-3 p. 279-290
12 p.
artikel
3 A cycle augmentation algorithm for minimum cost multicommodity flows on a ring Shepherd, Bruce
2001
81-90 2-3 p. 301-315
15 p.
artikel
4 A decomposition algorithm for multi-terminal networks flows Shing, M.T
1986
81-90 2-3 p. 165-181
17 p.
artikel
5 A decomposition of the matroids with the max-flow min-cut property Tseng, F.T.
1986
81-90 2-3 p. 329-364
36 p.
artikel
6 A degree condition of 2-factors in bipartite graphs Li, Xiangwen
2001
81-90 2-3 p. 311-318
8 p.
artikel
7 A deletion game on hypergraphs Fraenkel, Aviezri S.
1991
81-90 2-3 p. 155-162
8 p.
artikel
8 Adjacency on combinatorial polyhedra Matsuia, Tomomi
1995
81-90 2-3 p. 311-321
11 p.
artikel
9 A doubly cyclic channel assignment problem McDiarmid, Colin
1997
81-90 2-3 p. 263-268
6 p.
artikel
10 Advances in Discrete Geometry and Topology: Special issue devoted to the 11th International Conference on Discrete Geometry for Computer Imagery (DGCI 2003) Naples, Italy 19–21 November 2003 Nyström, Ingela
2005
81-90 2-3 p. 147-148
2 p.
artikel
11 A family of Cayley graphs on the hexavalent grid Désérable, Dominique
1999
81-90 2-3 p. 169-189
21 p.
artikel
12 A fast algorithm for finding an edge-maximal subgraph with a TR-formative coloring Balas, Egon
1986
81-90 2-3 p. 123-134
12 p.
artikel
13 A fast randomized algorithm for partitioning a graph into paths of fixed length Stougie, Leen
1993
81-90 2-3 p. 291-303
13 p.
artikel
14 A fully dynamic algorithm for modular decomposition and recognition of cographs Shamir, Ron
2004
81-90 2-3 p. 329-340
12 p.
artikel
15 A generalization of the zero–one principle for sorting algorithms Wagner, Dorothea
1991
81-90 2-3 p. 265-273
9 p.
artikel
16 A General Label Search to investigate classical graph search algorithms Krueger, R.
2011
81-90 2-3 p. 128-142
15 p.
artikel
17 A heuristic for the two-machine open-shop scheduling problem with transportation times Strusevich, V.A.
1999
81-90 2-3 p. 287-304
18 p.
artikel
18 Algorithms for minimizing maximum lateness with unit length tasks and resource constraints Błazewicz, J.
1993
81-90 2-3 p. 123-138
16 p.
artikel
19 Algorithms for polyominoes based on the discrete Green theorem Brlek, S.
2005
81-90 2-3 p. 187-205
19 p.
artikel
20 A linear algorithm for finding a minimum dominating set in a cactus Hedetniemi, S.T
1986
81-90 2-3 p. 287-292
6 p.
artikel
21 A linear algorithm for the Hamiltonian completion number of the line graph of a cactus Detti, Paolo
2004
81-90 2-3 p. 197-215
19 p.
artikel
22 A linear-programming approach to the generalized Randić index Fischermann, Miranca
2003
81-90 2-3 p. 375-385
11 p.
artikel
23 Allowable processing orders in the accelerated cascade algorithm Goldman, A.J
1986
81-90 2-3 p. 213-221
9 p.
artikel
24 All-to-all personalized communication on multistage interconnection networks Massini, Annalisa
2003
81-90 2-3 p. 435-446
12 p.
artikel
25 A lower bound for the job insertion problem Kis, Tamás
2003
81-90 2-3 p. 395-419
25 p.
artikel
26 A lower bound of the expected maximum number of edge-disjoint s-t paths on probabilistic graphs Cheng, Peng
1995
81-90 2-3 p. 137-155
19 p.
artikel
27 Alternating paths in edge-colored complete graphs Manoussakis, Y.
1995
81-90 2-3 p. 297-309
13 p.
artikel
28 A map from the lower-half of the n-cube onto the (n−1)-cube which preserves intersecting antichains Miyakawa, Masahiro
1999
81-90 2-3 p. 223-228
6 p.
artikel
29 A more efficient algorithm for MPR problems in phylogeny Narushima, Hiroshi
1997
81-90 2-3 p. 231-238
8 p.
artikel
30 An algorithm for fractional assignment problems Shigeno, Maiko
1995
81-90 2-3 p. 333-343
11 p.
artikel
31 An 0.828-approximation algorithm for the uncapacitated facility location problem Ageev, A.A.
1999
81-90 2-3 p. 149-156
8 p.
artikel
32 A new variant of the partitioning shortest path algorithm Phillips, Nancy V.
1986
81-90 2-3 p. 207-212
6 p.
artikel
33 Announcement 1995
81-90 2-3 p. 271-272
2 p.
artikel
34 A non-ambiguous decomposition of regular languages and factorizing codes Anselmo, Marcella
2003
81-90 2-3 p. 129-165
37 p.
artikel
35 A note about games-composition dimension Freixas, J.
2001
81-90 2-3 p. 265-273
9 p.
artikel
36 A note on compact graphs Tinhofer, G.
1991
81-90 2-3 p. 253-264
12 p.
artikel
37 A note on greedy algorithms for the maximum weighted independent set problem Sakai, Shuichi
2003
81-90 2-3 p. 313-322
10 p.
artikel
38 A note on line digraphs and the directed max-cut problem Chvátal, V.
1990
81-90 2-3 p. 165-170
6 p.
artikel
39 A perspective on certain polynomial-time solvable classes of satisfiability Franco, John
2003
81-90 2-3 p. 177-214
38 p.
artikel
40 A polynomial algorithm for finding T-span of generalized cacti Giaro, Krzysztof
2003
81-90 2-3 p. 371-382
12 p.
artikel
41 A polynomial approximation scheme for the subset sum problem Soma, Nei Yoshihiro
1995
81-90 2-3 p. 243-253
11 p.
artikel
42 Approximating covering integer programs with multiplicity constraints Kolliopoulos, Stavros G
2003
81-90 2-3 p. 461-473
13 p.
artikel
43 Approximating minimum size {1,2}-connected networks Krysta, Piotr
2003
81-90 2-3 p. 267-288
22 p.
artikel
44 Approximating the weight of shallow Steiner trees Kortsarz, Guy
1999
81-90 2-3 p. 265-285
21 p.
artikel
45 2-Approximation algorithms for the multi-vehicle scheduling problem on a path with release and handling times Karuno, Yoshiyuki
2003
81-90 2-3 p. 433-447
15 p.
artikel
46 Approximation algorithms for the watchman route and zookeeper's problems Tan, Xuehou
2004
81-90 2-3 p. 363-376
14 p.
artikel
47 A predetermined algorithm for detecting a counterfeit coin with a multi-arms balance De Bonis, Annalisa
1998
81-90 2-3 p. 181-200
20 p.
artikel
48 A primal–dual approximation algorithm for the survivable network design problem in hypergraphs Zhao, Liang
2003
81-90 2-3 p. 275-289
15 p.
artikel
49 A recurrence template for several parameters in series–parallel graphs Grinstead, Dana L.
1994
81-90 2-3 p. 151-168
18 p.
artikel
50 A short proof of a conjecture on the T r -choice number of even cycles Sitters, R.A.
1999
81-90 2-3 p. 243-246
4 p.
artikel
51 A simple minimum T-cut algorithm Rizzi, Romeo
2003
81-90 2-3 p. 539-544
6 p.
artikel
52 A software package of algorithms and heuristics for disjoint paths in Planar Networks Brandes, Ulrik
1999
81-90 2-3 p. 91-110
20 p.
artikel
53 A strongly polynomial time algorithm for a constrained submodular optimization problem Hartvigsen, David
2001
81-90 2-3 p. 183-194
12 p.
artikel
54 A study of the cyclic scheduling problem on parallel processors Hanen, Claire
1995
81-90 2-3 p. 167-192
26 p.
artikel
55 A survey of algorithms for the single machine total weighted tardiness scheduling problem Abdul-Razaq, T.S.
1990
81-90 2-3 p. 235-253
19 p.
artikel
56 A survey of results for sequencing problems with controllable processing times Nowicki, Eugeniusz
1990
81-90 2-3 p. 271-287
17 p.
artikel
57 Asymptotic estimation of the average number of terminal states in DAWGs Raffinot, Mathieu
1999
81-90 2-3 p. 193-203
11 p.
artikel
58 A unified approximation algorithm for node-deletion problems Fujito, Toshihiro
1998
81-90 2-3 p. 213-231
19 p.
artikel
59 Author index 2003
81-90 2-3 p. I-II
nvt p.
artikel
60 Author Index 2003
81-90 2-3 p. 319-
1 p.
artikel
61 Author index 1998
81-90 2-3 p. 275-276
2 p.
artikel
62 Author index 1995
81-90 2-3 p. 273-274
2 p.
artikel
63 Author index 1995
81-90 2-3 p. 347-348
2 p.
artikel
64 Author Index 2001
81-90 2-3 p. 327-328
2 p.
artikel
65 Author index 1993
81-90 2-3 p. 305-306
2 p.
artikel
66 Author index 1994
81-90 2-3 p. 291-
1 p.
artikel
67 Author index 1997
81-90 2-3 p. 269-270
2 p.
artikel
68 Author index 1990
81-90 2-3 p. 301-302
2 p.
artikel
69 Author index 1991
81-90 2-3 p. 279-280
2 p.
artikel
70 Author index 1990
81-90 2-3 p. 263-264
2 p.
artikel
71 Author index (last vol./issue) 2003
81-90 2-3 p. 573-575
3 p.
artikel
72 Author index to volume 129 2003
81-90 2-3 p. 549-551
3 p.
artikel
73 Author Index to Volume 113 (2001) 2001
81-90 2-3 p. 343-344
2 p.
artikel
74 Author index to volume 2004
81-90 2-3 p. 387-388
2 p.
artikel
75 Author index to volume 2005
81-90 2-3 p. 363-364
2 p.
artikel
76 Author index Volume 13 (1986) 1986
81-90 2-3 p. 293-294
2 p.
artikel
77 Author index volume 15 (1986) 1986
81-90 2-3 p. 377-378
2 p.
artikel
78 A variable-dimension homotopy on networks for computing linear spatial equilibria Jones, Philip C.
1986
81-90 2-3 p. 131-156
26 p.
artikel
79 Batch scheduling and common due date assignment problem: An NP-hard case Kovalyov, Mikhail Y.
1997
81-90 2-3 p. 251-254
4 p.
artikel
80 Bipartite embeddings of trees in the plane Abellanas, M.
1999
81-90 2-3 p. 141-148
8 p.
artikel
81 Bipolar orientations revisited de Fraysseix, Hubert
1995
81-90 2-3 p. 157-179
23 p.
artikel
82 Book announcements 1991
81-90 2-3 p. 275-278
4 p.
artikel
83 Bounds for isoperimetric constants of infinite plane graphs Lawrencenko, Serge
2001
81-90 2-3 p. 237-241
5 p.
artikel
84 Bounds on the average connectivity of a graph Dankelmann, Peter
2003
81-90 2-3 p. 305-318
14 p.
artikel
85 Broadcast and gossip in line-communication mode Laforest, C.
1997
81-90 2-3 p. 161-176
16 p.
artikel
86 Call for papers 1995
81-90 2-3 p. 345-
1 p.
artikel
87 Characterizing the flow equivalent trees of a network Hartvigsen, David
2003
81-90 2-3 p. 387-394
8 p.
artikel
88 Classification of a class of distance-regular graphs via completely regular codes Rifà, Josep
1990
81-90 2-3 p. 289-300
12 p.
artikel
89 Classification of whist tournaments with up to 12 players Haanpää, Harri
2003
81-90 2-3 p. 399-407
9 p.
artikel
90 Cliques that are tolerance digraphs Shull, Randy
1997
81-90 2-3 p. 119-134
16 p.
artikel
91 3-Colorability ∈P for P 6-free graphs Randerath, Bert
2004
81-90 2-3 p. 299-313
15 p.
artikel
92 Combinatorial algorithms on a class of graphs Korneyenko, N.M.
1994
81-90 2-3 p. 215-217
3 p.
artikel
93 Combinatorial optimisation algorithms for a CAD workstation Price, W.L.
1990
81-90 2-3 p. 219-233
15 p.
artikel
94 Compatible eulerian circuits in Kn ∗∗ Barth, D.
1995
81-90 2-3 p. 127-136
10 p.
artikel
95 Complexity of minimum biclique cover and minimum biclique decomposition for bipartite domino-free graphs Amilhastre, J
1998
81-90 2-3 p. 125-144
20 p.
artikel
96 Complexity results on a paint shop problem Epping, Th.
2004
81-90 2-3 p. 217-226
10 p.
artikel
97 Compound constructions of broadcast networks Dinneen, Michael J.
1999
81-90 2-3 p. 205-232
28 p.
artikel
98 Computational analysis of counter-based schemes for VLSI test pattern generation Kagaris, Dimitri
2001
81-90 2-3 p. 227-250
24 p.
artikel
99 Computational experience with a polynomial-time dual simplex algorithm for the transportation problem Ikura, Yoshiro
1986
81-90 2-3 p. 239-248
10 p.
artikel
100 Computing graph invariants on rotagraphs using dynamic algorithm approach: the case of (2,1)-colorings and independence numbers Klavžar, Sandi
2003
81-90 2-3 p. 449-460
12 p.
artikel
101 Computing the throughput of a network with dedicated lines Papadimitriou, Christos H.
1993
81-90 2-3 p. 271-278
8 p.
artikel
102 Configurations induced by discrete rotations: periodicity and quasi-periodicity properties Nouvel, Bertrand
2005
81-90 2-3 p. 325-343
19 p.
artikel
103 Connectivity of generalized prisms over G Piazza, B.L.
1991
81-90 2-3 p. 229-233
5 p.
artikel
104 Connectivity of iterated line graphs Knor, Martin
2003
81-90 2-3 p. 255-266
12 p.
artikel
105 Constrained weighted matchings and edge coverings in graphs Plesnı́k, Ján
1999
81-90 2-3 p. 229-241
13 p.
artikel
106 Contents 2003
81-90 2-3 p. v-vii
nvt p.
artikel
107 Contents 2003
81-90 2-3 p. iv-
1 p.
artikel
108 Contents 2011
81-90 2-3 p. v-
1 p.
artikel
109 Contents 2004
81-90 2-3 p. ix-x
nvt p.
artikel
110 Contents 2005
81-90 2-3 p. ix-x
nvt p.
artikel
111 Contents all nrs. if necessary 2003
81-90 2-3 p. iv-v
nvt p.
artikel
112 Correlation functions of a family of generalized geometric sequences Wei, Sun
1997
81-90 2-3 p. 193-201
9 p.
artikel
113 Cut, paste and filter Sullivan, Peggy
2003
81-90 2-3 p. 465-485
21 p.
artikel
114 Cut-threshold graphs Hammer, Peter L.
1991
81-90 2-3 p. 163-179
17 p.
artikel
115 Cycle regular graphs need not be transitive Fouquet, Jean-Luc
2001
81-90 2-3 p. 261-264
4 p.
artikel
116 Cycles identifying vertices and edges in binary hypercubes and 2-dimensional tori Honkala, Iiro
2003
81-90 2-3 p. 409-419
11 p.
artikel
117 Cycles of length 1 modulo 3 in graph Mei, LU
2001
81-90 2-3 p. 329-336
8 p.
artikel
118 Deadlocks and traps in Petri nets as Horn-satisfiability solutions and some related polynomially solvable problems Minoux, M.
1990
81-90 2-3 p. 195-210
16 p.
artikel
119 Degeneracy in transportation problems Hung, M.S.
1986
81-90 2-3 p. 223-237
15 p.
artikel
120 Delay-related secondary objectives for rectilinear Steiner minimum trees Peyer, Sven
2004
81-90 2-3 p. 271-298
28 p.
artikel
121 Derived neighborhoods and frontier orders Daragon, Xavier
2005
81-90 2-3 p. 227-243
17 p.
artikel
122 Determination of the star valency of a graph Dong, Jinquan
2003
81-90 2-3 p. 291-296
6 p.
artikel
123 Deterministic inverse zero-patterns Johnson, Charles R.
2001
81-90 2-3 p. 211-236
26 p.
artikel
124 Diameter determination on restricted graph families Corneil, Derek G.
2001
81-90 2-3 p. 143-166
24 p.
artikel
125 Directed hypergraphs and applications Gallo, Giorgio
1993
81-90 2-3 p. 177-201
25 p.
artikel
126 Divider-based algorithms for hierarchical tree partitioning Finocchi, Irene
2004
81-90 2-3 p. 227-247
21 p.
artikel
127 Domination analysis of combinatorial optimization problems Gutin, Gregory
2003
81-90 2-3 p. 513-520
8 p.
artikel
128 Domination graphs: examples and counterexamples Rusu, Irena
2001
81-90 2-3 p. 289-300
12 p.
artikel
129 Duality for balanced submodular flows Zimmermann, Uwe
1986
81-90 2-3 p. 365-376
12 p.
artikel
130 Easy cases of the D0L sequence equivalence problem Honkala, Juha
2001
81-90 2-3 p. 285-290
6 p.
artikel
131 Edge colorings of the complete graph K 149 and the lower bounds of three Ramsey numbers Guiqing, Li
2003
81-90 2-3 p. 167-179
13 p.
artikel
132 Edge dominating set and colorings on graphs with fixed clique-width Kobler, Daniel
2003
81-90 2-3 p. 197-221
25 p.
artikel
133 Edge-forwarding index of star graphs and other Cayley graphs Gauyacq, Ginette
1997
81-90 2-3 p. 149-160
12 p.
artikel
134 Edge-oblique polyhedral graphs Schreyer, Jens
2004
81-90 2-3 p. 315-327
13 p.
artikel
135 Editorial Board 2004
81-90 2-3 p. v-vii
nvt p.
artikel
136 Editorial Board 2005
81-90 2-3 p. v-vii
nvt p.
artikel
137 Efficient algorithms and partial k-trees 1994
81-90 2-3 p. 97-99
3 p.
artikel
138 Efficient algorithms on distributive lattices Habib, Michel
2001
81-90 2-3 p. 169-187
19 p.
artikel
139 Efficient dominating sets in Cayley graphs Dejter, Italo J.
2003
81-90 2-3 p. 319-328
10 p.
artikel
140 Efficient dualization of O(log n)-term monotone disjunctive normal forms Makino, Kazuhisa
2003
81-90 2-3 p. 305-312
8 p.
artikel
141 Efficient line broadcasting in a d-dimensional grid Averbuch, A.
2001
81-90 2-3 p. 129-141
13 p.
artikel
142 Efficient reformulation for 0–1 programs — methods and computational results Dietrich, B.L.
1993
81-90 2-3 p. 147-175
29 p.
artikel
143 Embedding complete trees into the hypercube Bezrukov, Sergei L.
2001
81-90 2-3 p. 101-119
19 p.
artikel
144 Enumerating near-4-regular maps on the sphere and the torus Ren, Han
2001
81-90 2-3 p. 273-288
16 p.
artikel
145 Error-correcting nonadaptive group testing with d e -disjunct matrices Macula, Anthony J.
1997
81-90 2-3 p. 217-222
6 p.
artikel
146 Exchange properties of combinatorial closure spaces Faigle, Ulrich
1986
81-90 2-3 p. 249-260
12 p.
artikel
147 Excluded-minor characterizations of antimatroids arisen from posets and graph searches Nakamura, M.
2003
81-90 2-3 p. 487-498
12 p.
artikel
148 Expanding selfsimilar solutions of a crystalline flow with applications to contour figure analysis Hontani, Hidekata
2005
81-90 2-3 p. 265-285
21 p.
artikel
149 Expected complexity of graph partitioning problems Kučera, Luděk
1995
81-90 2-3 p. 193-212
20 p.
artikel
150 Expected value expansions in rooted graphs Bailey, Alison
2003
81-90 2-3 p. 555-571
17 p.
artikel
151 Extension of hereditary classes with substitutions Zverovich, Igor
2003
81-90 2-3 p. 487-509
23 p.
artikel
152 Families of integral trees with diameters 4, 6, and 8 Wang, Ligong
2004
81-90 2-3 p. 349-362
14 p.
artikel
153 Finding all common bases in two matroids Fukuda, Komei
1995
81-90 2-3 p. 231-243
13 p.
artikel
154 Finding paths in graphs avoiding forbidden transitions Szeider, Stefan
2003
81-90 2-3 p. 261-273
13 p.
artikel
155 Finding the k most vital edges with respect to minimum spanning trees for fixed k Liang, Weifa
2001
81-90 2-3 p. 319-327
9 p.
artikel
156 Formulating the single machine sequencing problem with release dates as a mixed integer program Dyer, Martin E.
1990
81-90 2-3 p. 255-270
16 p.
artikel
157 Generalized neighbourhoods and a class of perfectly orderable graphs Cochand, M.
1986
81-90 2-3 p. 213-220
8 p.
artikel
158 Generating most parsimonious reconstructions on a tree: A generalization of the Farris-Swofford-Maddison method Hanazawa, Masazumi
1995
81-90 2-3 p. 245-265
21 p.
artikel
159 Generating r-regular graphs Ding, Guoli
2003
81-90 2-3 p. 329-343
15 p.
artikel
160 Greedy concepts for network flow problems Bein, Wolfgang W.
1986
81-90 2-3 p. 135-144
10 p.
artikel
161 Gridline graphs: a review in two dimensions and an extension to higher dimensions Peterson, Dale
2003
81-90 2-3 p. 223-239
17 p.
artikel
162 Guide for authors 2004
81-90 2-3 p. I-IV
nvt p.
artikel
163 Guide for authors 2005
81-90 2-3 p. I-IV
nvt p.
artikel
164 Guide to authors 2003
81-90 2-3 p. I-IV
nvt p.
artikel
165 Half-integral flows in a planar graph with four holes Karzanov, Alexander V.
1995
81-90 2-3 p. 267-295
29 p.
artikel
166 Holes in random graphs Łuczak, Tomasz
1991
81-90 2-3 p. 213-219
7 p.
artikel
167 Homomorphisms and Ramsey properties of antimatroids Korte, Bernhard
1986
81-90 2-3 p. 283-290
8 p.
artikel
168 Hypercube embedding of generalized bipartite metrics Deza, Michel
1995
81-90 2-3 p. 215-230
16 p.
artikel
169 IFC (Editorial Board) 2003
81-90 2-3 p. IFC-
1 p.
artikel
170 IFC (non-1st issue/vol) 2003
81-90 2-3 p. IFC-
1 p.
artikel
171 Improved self-reduction algorithms for graphs with bounded treewidth Bodlaender, Hans L.
1994
81-90 2-3 p. 101-115
15 p.
artikel
172 Independent spanning trees with small depths in iterated line digraphs Hasunuma, Toru
2001
81-90 2-3 p. 189-211
23 p.
artikel
173 Index 1999
81-90 2-3 p. 305-306
2 p.
artikel
174 Index 1999
81-90 2-3 p. 253-254
2 p.
artikel
175 In memoriam Paolo M. Camerini Maffioli, Francesco
1993
81-90 2-3 p. 121-122
2 p.
artikel
176 Interval degree and bandwidth of a graph Fomin, Fedor V
2003
81-90 2-3 p. 345-359
15 p.
artikel
177 Irreducible disjoint covering systems (with an application to boolean algebra) Berger, Marc A.
1990
81-90 2-3 p. 143-164
22 p.
artikel
178 k-NLC graphs and polynomial algorithms Wanke, Egon
1994
81-90 2-3 p. 251-266
16 p.
artikel
179 Lagrangean methods for 0–1 quadratic problems Michelon, Philippe
1993
81-90 2-3 p. 257-269
13 p.
artikel
180 Language-theoretic complexity of disjunctive sequences Calude, Cristian
1997
81-90 2-3 p. 203-209
7 p.
artikel
181 Lattice bandwidth of random graphs McDiarmid, Colin
1991
81-90 2-3 p. 221-227
7 p.
artikel
182 Learning with queries corrupted by classification noise Jackson, Jeffrey
1999
81-90 2-3 p. 157-175
19 p.
artikel
183 Local search algorithms for the k-cardinality tree problem Blum, Christian
2003
81-90 2-3 p. 511-540
30 p.
artikel
184 Lopsided Lovász Local Lemma and Latin transversals Erdős, Paul
1991
81-90 2-3 p. 151-154
4 p.
artikel
185 Lower bounds for computing geometric spanners and approximate shortest paths Chen, Danny Z.
2001
81-90 2-3 p. 151-167
17 p.
artikel
186 Lower bounds for the number of edge-crossings over the spine in a topological book embedding of a graph Enomoto, Hikoe
1999
81-90 2-3 p. 149-155
7 p.
artikel
187 Lower bounds for the symmetric travelling salesman problem from Lagrangean relaxations Smith, T.H.C.
1990
81-90 2-3 p. 209-217
9 p.
artikel
188 Lower bounds on the independence number of certain graphs of odd girth at least seven Pedersen, Anders Sune
2011
81-90 2-3 p. 143-151
9 p.
artikel
189 L-polytopes and equiangular lines Deza, M.
1995
81-90 2-3 p. 181-214
34 p.
artikel
190 Making a tournament k-arc-strong by reversing or deorienting arcs Bang-Jensen, Jørgen
2004
81-90 2-3 p. 161-171
11 p.
artikel
191 Maximal outerplanar graphs with perfect face-independent vertex covers Winter, Pawel
1994
81-90 2-3 p. 267-280
14 p.
artikel
192 Maximum cut on line and total graphs Guruswami, Venkatesan
1999
81-90 2-3 p. 217-221
5 p.
artikel
193 Meaningfulness of conclusions from combinatorial optimization Roberts, Fred S.
1990
81-90 2-3 p. 221-241
21 p.
artikel
194 Microcomputer-based algorithms for large scale shortest path problems Klingman, Darwin D.
1986
81-90 2-3 p. 183-206
24 p.
artikel
195 Minimizing a submodular function arising from a concave function Fujishige, Satoru
1999
81-90 2-3 p. 211-215
5 p.
artikel
196 Minimum 3-geodetically connected graphs Bosı́ková, Martina
2003
81-90 2-3 p. 263-283
21 p.
artikel
197 Monge sequences and a simple assignment algorithm Derigs, U.
1986
81-90 2-3 p. 241-248
8 p.
artikel
198 Morphisms and almost-periodicity Maes, Arnaud
1998
81-90 2-3 p. 233-248
16 p.
artikel
199 Most and least uniform spanning trees Camerini, Paolo M.
1986
81-90 2-3 p. 181-197
17 p.
artikel
200 Most uniform path partitioning and its use in image processing Lucertini, Mario
1993
81-90 2-3 p. 227-256
30 p.
artikel
201 Multi-terminal maximum flows in node-capacitated networks Granot, Frieda
1986
81-90 2-3 p. 157-163
7 p.
artikel
202 Nearly on line scheduling of preemptive independent tasks Sanlaville, Eric
1995
81-90 2-3 p. 229-241
13 p.
artikel
203 New classes of perfect graphs Berge, Claude
1986
81-90 2-3 p. 145-154
10 p.
artikel
204 Note Charon, Irène
1997
81-90 2-3 p. 211-215
5 p.
artikel
205 Note on combinatorial optimization with max-linear objective functions Chung, Sung-Jin
1993
81-90 2-3 p. 139-145
7 p.
artikel
206 Object and image indexing based on region connection calculus and oriented matroid theory Staffetti, Ernesto
2005
81-90 2-3 p. 345-361
17 p.
artikel
207 Obstruction set isolation for the gate matrix layout problem Kinnersley, Nancy G.
1994
81-90 2-3 p. 169-213
45 p.
artikel
208 On a graph-theoretical model for cyclic register allocation de Werra, D.
1999
81-90 2-3 p. 191-203
13 p.
artikel
209 On an estimate of the size of the maximum matching for a family of disjoint compact convex sets in the plane Hosono, Kiyoshi
2001
81-90 2-3 p. 291-298
8 p.
artikel
210 On an optimization problem with nested constraints Dyer, M.E.
1990
81-90 2-3 p. 159-173
15 p.
artikel
211 On approximability of linear ordering and related NP-optimization problems on graphs Mishra, Sounaka
2004
81-90 2-3 p. 249-269
21 p.
artikel
212 On approximation intractability of the path–distance–width problem Yamazaki, Koichi
2001
81-90 2-3 p. 317-325
9 p.
artikel
213 On BF-orderable graphs Mehlhorn, Kurt
1986
81-90 2-3 p. 315-327
13 p.
artikel
214 On chains of 3-connected matroids Bixby, Robert E.
1986
81-90 2-3 p. 155-166
12 p.
artikel
215 On completing latin squares Easton, T.
2001
81-90 2-3 p. 167-181
15 p.
artikel
216 On domination numbers of Cartesian product of paths Gravier, Sylvain
1997
81-90 2-3 p. 247-250
4 p.
artikel
217 On KΔ Chung, Sung-Jin
1986
81-90 2-3 p. 199-211
13 p.
artikel
218 On linear and circular structure of (claw, net)-free graphs Brandstädt, Andreas
2003
81-90 2-3 p. 285-303
19 p.
artikel
219 On-line scheduling of small open shops Chen, Bo
2001
81-90 2-3 p. 133-150
18 p.
artikel
220 On mixing of certain random walks, cutoff phenomenon and sharp threshold of random matroid processes Pak, Igor
2001
81-90 2-3 p. 251-272
22 p.
artikel
221 On storage of topological information Kopperman, Ralph
2005
81-90 2-3 p. 287-300
14 p.
artikel
222 On strong Menger-connectivity of star graphs Oh, Eunseuk
2003
81-90 2-3 p. 499-511
13 p.
artikel
223 On the cohomology of 3D digital images González-Díaz, Rocío
2005
81-90 2-3 p. 245-263
19 p.
artikel
224 On the computational complexity of the order polynomial Faigle, Ulrich
1986
81-90 2-3 p. 261-269
9 p.
artikel
225 On the dynamic coloring of graphs Alishahi, Meysam
2011
81-90 2-3 p. 152-156
5 p.
artikel
226 On the equitable chromatic number of complete n-partite graphs Lam, Peter Che Bor
2001
81-90 2-3 p. 307-310
4 p.
artikel
227 On the equivalence of paved-duality and standard linearization in nonlinear 0–1 optimization Hansen, P.
1990
81-90 2-3 p. 187-193
7 p.
artikel
228 On the minimum local-vertex-connectivity augmentation in graphs Nagamochi, Hiroshi
2003
81-90 2-3 p. 475-486
12 p.
artikel
229 On the regularity of languages generated by context-free evolutionary grammars Dassow, Jürgen
1999
81-90 2-3 p. 205-209
5 p.
artikel
230 On the stable set problem in special P 5-free graphs Gerber, Michael U
2003
81-90 2-3 p. 215-224
10 p.
artikel
231 On the two-connected planar spanning subgraph polytope De Simone, Caterina
1997
81-90 2-3 p. 223-229
7 p.
artikel
232 On the use of augmenting chains in chain packings de Werra, D.
1991
81-90 2-3 p. 137-149
13 p.
artikel
233 On the visibility graph of convex translates Hosono, Kiyoshi
2001
81-90 2-3 p. 195-210
16 p.
artikel
234 On treewidth approximations Bouchitté, V
2004
81-90 2-3 p. 183-196
14 p.
artikel
235 On variations of P 4-sparse graphs Brandstädt, Andreas
2003
81-90 2-3 p. 521-532
12 p.
artikel
236 Opacity of a finite automaton, method of calculation and the Ising chain Yao, Jia-Yan
2003
81-90 2-3 p. 289-318
30 p.
artikel
237 Optimal arrangement of data in a tree directory Luczak, M.J.
2001
81-90 2-3 p. 243-253
11 p.
artikel
238 Optimal match-up strategies in stochastic scheduling Birge, John R.
1995
81-90 2-3 p. 105-120
16 p.
artikel
239 Optimal point-to-point broadcast algorithms via lopsided trees Golin, Mordecai
1999
81-90 2-3 p. 233-263
31 p.
artikel
240 Optimal quantitative group testing on cycles and paths Hwang, F.K.
2001
81-90 2-3 p. 299-302
4 p.
artikel
241 Optimal schedules for periodically recurring events Burkard, Rainer E.
1986
81-90 2-3 p. 167-180
14 p.
artikel
242 Optimal sequential gossiping by short messages Bermond, Jean-Claude
1998
81-90 2-3 p. 145-155
11 p.
artikel
243 Packing 3-vertex paths in claw-free graphs and related topics Kelmans, Alexander
2011
81-90 2-3 p. 112-127
16 p.
artikel
244 Pairs of graphs with site and bond percolation critical probabilities in opposite orders Wierman, John C.
2003
81-90 2-3 p. 545-548
4 p.
artikel
245 Periodicity vectors for labelled trees Restivo, Antonio
2003
81-90 2-3 p. 241-260
20 p.
artikel
246 Persistency in combinatorial optimization problems on matroids Cechlárová, Katarı́na
2001
81-90 2-3 p. 121-132
12 p.
artikel
247 Planar k-cycle resonant graphs with k=1,2 Guo, Xiaofeng
2003
81-90 2-3 p. 383-397
15 p.
artikel
248 Plane digitization and related combinatorial problems Brimkov, Valentin E.
2005
81-90 2-3 p. 169-186
18 p.
artikel
249 Polymatroidal flows with lower bounds Lawler, E.L.
1986
81-90 2-3 p. 291-313
23 p.
artikel
250 Polynomial invariants of graphs with state models Negami, Seiya
1995
81-90 2-3 p. 323-331
9 p.
artikel
251 Précis 1986
81-90 2-3 p. 107-108
2 p.
artikel
252 Preface Fukuda, Komei
1995
81-90 2-3 p. 99-100
2 p.
artikel
253 Preface Galbiati, Giulia
1993
81-90 2-3 p. 119-
1 p.
artikel
254 Preface McDiarmid, Colin
1995
81-90 2-3 p. 91-
1 p.
artikel
255 Preface 1990
81-90 2-3 p. 135-
1 p.
artikel
256 Preface 1986
81-90 2-3 p. 121-
1 p.
artikel
257 Preface Hansen, P.
1990
81-90 2-3 p. 129-
1 p.
artikel
258 Preface Faigle, Ulrich
2004
81-90 2-3 p. 159-160
2 p.
artikel
259 Probing the arrangement of hyperplanes Aoki, Yasukazu
1995
81-90 2-3 p. 101-125
25 p.
artikel
260 Pushdown–reduce: an algorithm for connectivity augmentation and poset covering problems Benczúr, András A.
2003
81-90 2-3 p. 233-262
30 p.
artikel
261 Randić structure of a graph Rada, Juan
2003
81-90 2-3 p. 447-463
17 p.
artikel
262 Recognition of a class of unimodular functions Simeone, B.
1990
81-90 2-3 p. 243-250
8 p.
artikel
263 Recognition of quasi-Meyniel graphs de Figueiredo, Celina M.H.
2001
81-90 2-3 p. 255-260
6 p.
artikel
264 Recognition of some perfectly orderable graph classes M. Eschen, Elaine
2003
81-90 2-3 p. 355-373
19 p.
artikel
265 Recognizing clique graphs of directed edge path graphs Gutierrez, Marisa
2003
81-90 2-3 p. 297-304
8 p.
artikel
266 Recognizing the P 4-structure of bipartite graphs Babel, Luitpold
1999
81-90 2-3 p. 157-168
12 p.
artikel
267 Reconstruction of 8-connected but not 4-connected hv -convex discrete sets Balázs, Péter
2005
81-90 2-3 p. 149-168
20 p.
artikel
268 References 1994
81-90 2-3 p. 281-290
10 p.
artikel
269 Regularity and locality in k-terminal graphs Mahajan, Sanjeev
1994
81-90 2-3 p. 229-250
22 p.
artikel
270 Regularity of matrices in min-algebra and its time- complexity Butkovič, P.
1995
81-90 2-3 p. 121-132
12 p.
artikel
271 Relative completeness with respect to two unary functions Pantović, Jovanka
2001
81-90 2-3 p. 337-342
6 p.
artikel
272 Resource constrained assignment problems Aboudi, Ronny
1990
81-90 2-3 p. 175-191
17 p.
artikel
273 Rigidity of octahedral-tetrahedral trusses Palmer, Damien
1998
81-90 2-3 p. 249-262
14 p.
artikel
274 Rooted routing in the plane Reed, Bruce
1995
81-90 2-3 p. 213-227
15 p.
artikel
275 Scheduling with unexpected machine breakdowns Albers, Susanne
2001
81-90 2-3 p. 85-99
15 p.
artikel
276 Searching for a minimal solution subgraph in explicit AND/OR graphs Hvalica, Dušan
2001
81-90 2-3 p. 213-225
13 p.
artikel
277 Sensitivity analysis for knapsack problems: another negative result Woeginger, Gerhard J.
1999
81-90 2-3 p. 247-251
5 p.
artikel
278 Sensitivity analysis for minimum Hamiltonian path and traveling salesman problems Libura, Marek
1991
81-90 2-3 p. 197-211
15 p.
artikel
279 Separating lifted odd-hole inequalities to solve the index selection problem Caprara, Alberto
1999
81-90 2-3 p. 111-134
24 p.
artikel
280 Sequential and parallel local search for the time-constrained traveling salesman problem Kindervater, Gerard
1993
81-90 2-3 p. 211-225
15 p.
artikel
281 Size bounds for dynamic monopolies Peleg, D.
1998
81-90 2-3 p. 263-273
11 p.
artikel
282 Smallest independent dominating sets in Kronecker products of cycles Jha, Pranava K.
2001
81-90 2-3 p. 303-306
4 p.
artikel
283 Solving problems for maximal reducible flowgraphs Vernet, O
2004
81-90 2-3 p. 341-348
8 p.
artikel
284 Some problems on factorizations with constraints in bipartite graphs Liu, Guizhen
2003
81-90 2-3 p. 421-434
14 p.
artikel
285 Some recent results on niche graphs Bowser, Stephen
1991
81-90 2-3 p. 101-108
8 p.
artikel
286 Sparsest cuts and concurrent flows in product graphs Bonsma, Paul
2004
81-90 2-3 p. 173-182
10 p.
artikel
287 Spatial market equilibrium problems as network models Barros, Oscar
1986
81-90 2-3 p. 109-130
22 p.
artikel
288 Stability in Discrete Tomography: some positive results Brunetti, Sara
2005
81-90 2-3 p. 207-226
20 p.
artikel
289 Stable sets in certain P 6-free graphs Mosca, Raffaele
1999
81-90 2-3 p. 177-191
15 p.
artikel
290 Stochastic scheduling and forwards induction Glazebrook, K.D.
1995
81-90 2-3 p. 145-165
21 p.
artikel
291 Strong unimodularity for matrices and hypergraphs Crama, Yves
1986
81-90 2-3 p. 221-239
19 p.
artikel
292 Subgraphs decomposable into two trees and k-edge-connected subgraphs Hassin, Refael
2003
81-90 2-3 p. 181-195
15 p.
artikel
293 Superconnectivity of graphs with odd girth g and even girth h Balbuena, C.
2011
81-90 2-3 p. 91-99
9 p.
artikel
294 Superdominance order and distance of trees with bounded maximum degree Jelen, F.
2003
81-90 2-3 p. 225-233
9 p.
artikel
295 Symmetry properties of chordal rings of degree 3 Barrière, Lali
2003
81-90 2-3 p. 211-232
22 p.
artikel
296 Testing the theory of evolution: A novel application of comibinatorial optimization Foulds, L.R.
1986
81-90 2-3 p. 271-282
12 p.
artikel
297 The asymmetric M-travelling salesmen problem: A duality based branch-and-bound algorithm Iqbal Ali, A
1986
81-90 2-3 p. 259-276
18 p.
artikel
298 The base-matroid and inverse combinatorial optimization problems Dell'Amico, Mauro
2003
81-90 2-3 p. 337-353
17 p.
artikel
299 The basic algorithm for pseudo-Boolean programming revisited Crama, Yves
1990
81-90 2-3 p. 171-185
15 p.
artikel
300 The basic cyclic scheduling problem with deadlines Chretienne, Philippe
1991
81-90 2-3 p. 109-123
15 p.
artikel
301 The combinations of resistances Macmahon, P.A.
1994
81-90 2-3 p. 225-228
4 p.
artikel
302 The complexities of the coefficients of the Tutte polynomial Annan, J.D.
1995
81-90 2-3 p. 93-103
11 p.
artikel
303 The complexity of compressing subsegments of images described by finite automata Karhumäki, Juhani
2003
81-90 2-3 p. 235-254
20 p.
artikel
304 The complexity of harmonious colouring for trees Edwards, Keith
1995
81-90 2-3 p. 133-144
12 p.
artikel
305 The complexity of the T-coloring problem for graphs with small degree Giaro, Krzysztof
2003
81-90 2-3 p. 361-369
9 p.
artikel
306 The construction of cubic and quartic planar maps with prescribed face degrees Brinkmann, Gunnar
2003
81-90 2-3 p. 541-554
14 p.
artikel
307 The continuous center set of a network Hansen, Pierre
1991
81-90 2-3 p. 181-195
15 p.
artikel
308 The edge versus path incidence matrix of series-parallel graphs and greedy packing Hoffman, Alan J.
2001
81-90 2-3 p. 275-284
10 p.
artikel
309 The exponent of the primitive Cayley digraphs on finite Abelian groups Jian-Zhong, Wang
1997
81-90 2-3 p. 177-191
15 p.
artikel
310 The family constrained network problem Mote, John
1986
81-90 2-3 p. 249-257
9 p.
artikel
311 The forwarding diameter of graphs De La Vega, W.Fernandez
1998
81-90 2-3 p. 201-211
11 p.
artikel
312 The k-ball l-path branch weight centroid Reid, K.B.
1997
81-90 2-3 p. 239-246
8 p.
artikel
313 The monadic second order logic of graphs VI: on several representations of graphs by relational structures Courcelle, Bruno
1994
81-90 2-3 p. 117-149
33 p.
artikel
314 The nonexistence of reduction rules giving an embedding into a k-tree Lagergren, Jens
1994
81-90 2-3 p. 219-223
5 p.
artikel
315 The obnoxious center problem on weighted cactus graphs Zmazek, Blaž
2004
81-90 2-3 p. 377-386
10 p.
artikel
316 The 2-quasi-greedy algorithm for cardinality constrained matroid bases Glover, Fred
1986
81-90 2-3 p. 277-286
10 p.
artikel
317 The relationship between the threshold dimension of split graphs and various dimensional parameters Cozzens, Margaret B.
1991
81-90 2-3 p. 125-135
11 p.
artikel
318 The selective travelling salesman problem Laporte, Gilbert
1990
81-90 2-3 p. 193-207
15 p.
artikel
319 The ( 1 , 2 ) -step competition graph of a tournament Factor, Kim A.S.
2011
81-90 2-3 p. 100-103
4 p.
artikel
320 The worst-case analysis of the MULTIFIT algorithm for scheduling nonsimultaneous parallel machines Chang, Soo Y.
1999
81-90 2-3 p. 135-147
13 p.
artikel
321 Threshold spectra via the Ehrenfeucht game Spencer, Joel
1991
81-90 2-3 p. 235-252
18 p.
artikel
322 Time-stamped graphs and their associated influence digraphs Cheng, Eddie
2003
81-90 2-3 p. 317-335
19 p.
artikel
323 Total coloring of planar graphs without 6-cycles Hou, Jianfeng
2011
81-90 2-3 p. 157-163
7 p.
artikel
324 Total domination dot-critical graphs Henning, Michael A.
2011
81-90 2-3 p. 104-111
8 p.
artikel
325 Trees, congruences and varieties of finite semigroups Blanchet-Sadri, F.
1998
81-90 2-3 p. 157-179
23 p.
artikel
326 Two mixed integer programming formulations arising in manufacturing management Jeroslow, Robert G.
1990
81-90 2-3 p. 137-157
21 p.
artikel
327 Unconstrained 0–1 optimization and Lagrangean relaxation Adams, Warren E.
1990
81-90 2-3 p. 131-142
12 p.
artikel
328 Upper bounds on ATSP neighborhood size Gutin, Gregory
2003
81-90 2-3 p. 533-538
6 p.
artikel
329 Using transforming matrices to generate DNA clone grids Huang, Hua-Min
2003
81-90 2-3 p. 421-431
11 p.
artikel
330 Valid inequalities for 0–1 knapsacks and mips with generalised upper bound constraints Wolsey, Laurence A.
1990
81-90 2-3 p. 251-261
11 p.
artikel
331 Vicinal orders of trees Peled, Uri N.
1990
81-90 2-3 p. 211-219
9 p.
artikel
332 Watersheds, mosaics, and the emergence paradigm Najman, Laurent
2005
81-90 2-3 p. 301-324
24 p.
artikel
333 Weighted domination of cocomparability graphs Maw-Shang, Chang
1997
81-90 2-3 p. 135-148
14 p.
artikel
334 Weighted fractional and integral k-matching in hypergraphs Srivastav, Anand
1995
81-90 2-3 p. 255-269
15 p.
artikel
335 Weighted parameters in (P5, P5 )-free graphs Giakoumakis, Vassilis
1997
81-90 2-3 p. 255-261
7 p.
artikel
336 Why should biconnected components be identified first Hochbaum, Dorit S.
1993
81-90 2-3 p. 203-210
8 p.
artikel
                             336 gevonden resultaten
 
 Koninklijke Bibliotheek - Nationale Bibliotheek van Nederland