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
 
                             153 gevonden resultaten
nr titel auteur tijdschrift jaar jaarg. afl. pagina('s) type
1 A Bound and Bound algorithm for the zero-one multiple knapsack problem Martello, Silvano
1981
1-10 4 p. 275-288
14 p.
artikel
2 A characterization of cycle-free unit probe interval graphs Brown, David E.
2009
1-10 4 p. 762-767
6 p.
artikel
3 A class of combinatorial identities Clark, Dean S.
1982
1-10 4 p. 325-327
3 p.
artikel
4 A competitive algorithm in searching for many edges in a hypergraph Chen, Ting
2007
1-10 4 p. 566-571
6 p.
artikel
5 Algorithms: Their Complexity and Efficiency 1982
1-10 4 p. 341-343
3 p.
artikel
6 An algebra for piecewise-linear minimax problems Cuninghame-Green, R.A.
1980
1-10 4 p. 267-294
28 p.
artikel
7 An algorithm for algebraic assignment problems Frieze, A.M.
1979
1-10 4 p. 253-259
7 p.
artikel
8 An algorithm for stochastic programs with first-order dominance constraints induced by linear recourse Drapkin, Dimitri
2010
1-10 4 p. 291-297
7 p.
artikel
9 An approximation algorithm for dissecting a rectangle into rectangles with specified areas Nagamochi, Hiroshi
2007
1-10 4 p. 523-537
15 p.
artikel
10 A note on Reed-Muller codes Dass, Bal Kishan
1980
1-10 4 p. 345-348
4 p.
artikel
11 A note on the complexity of flow-shop scheduling with deteriorating jobs Thörnblad, Karin
2011
1-10 4 p. 251-253
3 p.
artikel
12 A note on the lower bound of centralized radio broadcasting for planar reachability graphs Galčík, F.
2009
1-10 4 p. 853-857
5 p.
artikel
13 A polynomial time algorithm for solving a quality control station configuration problem Penn, Michal
2008
1-10 4 p. 412-419
8 p.
artikel
14 Approximation algorithms for the weighted independent set problem in sparse graphs Kako, Akihisa
2009
1-10 4 p. 617-626
10 p.
artikel
15 Asymptotics of the convex hull of spherically symmetric samples Hashorva, Enkelejd
2011
1-10 4 p. 201-211
11 p.
artikel
16 Author index 1982
1-10 4 p. 345-346
2 p.
artikel
17 Author index 1980
1-10 4 p. 365-366
2 p.
artikel
18 Author index 1979
1-10 4 p. 313-314
2 p.
artikel
19 Automorphisms and blocking in simple games Carreras, Francesc
2007
1-10 4 p. 496-505
10 p.
artikel
20 Average-case analysis of incremental topological ordering Ajwani, Deepak
2010
1-10 4 p. 240-250
11 p.
artikel
21 Balancing signed graphs Akiyama, J.
1981
1-10 4 p. 227-233
7 p.
artikel
22 Basic formulas and languages Part I. The theory Ehrenfeucht, A.
1981
1-10 4 p. 235-255
21 p.
artikel
23 Bernoulli polynomials and Pascal matrices in the context of Clifford analysis Malonek, H.R.
2009
1-10 4 p. 838-847
10 p.
artikel
24 Bipartite density of triangle-free subcubic graphs Zhu, Xuding
2009
1-10 4 p. 710-714
5 p.
artikel
25 Book announcements 1981
1-10 4 p. 323-327
5 p.
artikel
26 Bounds on the index of the signless Laplacian of a graph Oliveira, Carla Silva
2010
1-10 4 p. 355-360
6 p.
artikel
27 Characterization and recognition of P 4 -sparse graphs partitionable into k independent sets and ℓ cliques Bravo, Raquel S.F.
2011
1-10 4 p. 165-173
9 p.
artikel
28 Characterization of Optimal Strategies in Dynamic Games 1982
1-10 4 p. 343-
1 p.
artikel
29 Cologne/Twente workshop on graphs and combinatorial optimization CTW 2007 Faigle, Ulrich
2010
1-10 4 p. 239-
1 p.
artikel
30 Coloring mixed hypertrees Král’, Daniel
2006
1-10 4 p. 660-672
13 p.
artikel
31 Complexity of representation of graphs by set systems Poljak, Svatopluk
1981
1-10 4 p. 301-312
12 p.
artikel
32 Condorcet proportions and Kelly's conjectures Fishburn, Peter C.
1979
1-10 4 p. 229-252
24 p.
artikel
33 Contents 2009
1-10 4 p. vii-viii
nvt p.
artikel
34 Contents 2010
1-10 4 p. vii-viii
nvt p.
artikel
35 Contents 2011
1-10 4 p. v-
1 p.
artikel
36 Contents 2008
1-10 4 p. v-vi
nvt p.
artikel
37 Contents 2006
1-10 4 p. vii-
1 p.
artikel
38 Contents 2007
1-10 4 p. vii-viii
nvt p.
artikel
39 Continued fractions and explicit solutions of a particular discrete optimization problem Giannessi, F.
1979
1-10 4 p. 261-275
15 p.
artikel
40 Counting truth assignments of formulas of bounded tree-width or clique-width Fischer, E.
2008
1-10 4 p. 511-529
19 p.
artikel
41 Cryptography, A Primer 1982
1-10 4 p. 339-340
2 p.
artikel
42 Decidability and density in two-symbol grammar forms Maurer, H.A.
1981
1-10 4 p. 289-299
11 p.
artikel
43 Degree conditions on distance 2 vertices that imply k -ordered Hamiltonian Li, Ruijuan
2010
1-10 4 p. 331-339
9 p.
artikel
44 Dense sets and embedding binary trees into hypercubes Dvořák, Tomáš
2007
1-10 4 p. 506-514
9 p.
artikel
45 Designing PTASs for MIN-SUM scheduling problems Afrati, F.
2006
1-10 4 p. 622-639
18 p.
artikel
46 Digital Image Processing Systems 1982
1-10 4 p. 343-
1 p.
artikel
47 Digital planarity—A review Brimkov, Valentin
2007
1-10 4 p. 468-495
28 p.
artikel
48 Directed defective asymmetric graph coloring games Andres, Stephan Dominique
2010
1-10 4 p. 251-260
10 p.
artikel
49 Discrete Optimization, I and II 1979
1-10 4 p. 311-312
2 p.
artikel
50 Discrete Structures of Computer Science 1982
1-10 4 p. 339-
1 p.
artikel
51 Distances based on neighbourhood sequences in non-standard three-dimensional grids Strand, Robin
2007
1-10 4 p. 548-557
10 p.
artikel
52 Distances between trees Margush, T.
1982
1-10 4 p. 281-290
10 p.
artikel
53 Editorial Ben-Arroyo Hartman, Irith
2008
1-10 4 p. 410-411
2 p.
artikel
54 Editorial Board 2009
1-10 4 p. v-vi
nvt p.
artikel
55 Editorial Board 2010
1-10 4 p. v-vi
nvt p.
artikel
56 Editorial Board 2006
1-10 4 p. v-vi
nvt p.
artikel
57 Editorial Board 2007
1-10 4 p. v-vi
nvt p.
artikel
58 Equistable distance-hereditary graphs Korach, Ephraim
2008
1-10 4 p. 462-477
16 p.
artikel
59 Equitable total coloring of C m □ C n Tong, Chunling
2009
1-10 4 p. 596-601
6 p.
artikel
60 Eulerian detachments with local edge-connectivity Fukunaga, Takuro
2009
1-10 4 p. 691-698
8 p.
artikel
61 Extended cooperative networks games Quilliot, Alain
2009
1-10 4 p. 728-737
10 p.
artikel
62 Fast approximation algorithm for job sequencing with deadlines Gens, G.V.
1981
1-10 4 p. 313-318
6 p.
artikel
63 Fibonacci numbers and Lucas numbers in graphs Startek, Mariusz
2009
1-10 4 p. 864-868
5 p.
artikel
64 Flow trees for vertex-capacitated networks Hassin, Refael
2007
1-10 4 p. 572-578
7 p.
artikel
65 Four new sums of graphs and their Wiener indices Eliasi, Mehdi
2009
1-10 4 p. 794-803
10 p.
artikel
66 Games played by Boole and Galois Fraenkel, Aviezri S.
2008
1-10 4 p. 420-427
8 p.
artikel
67 Game Theory: Mathematical Models of Conflict 1982
1-10 4 p. 341-
1 p.
artikel
68 Geography, games and graphs de Werra, D.
1980
1-10 4 p. 327-337
11 p.
artikel
69 Graph operations characterizing rank-width Courcelle, Bruno
2009
1-10 4 p. 627-640
14 p.
artikel
70 Groups with the same non-commuting graph Darafsheh, M.R.
2009
1-10 4 p. 833-837
5 p.
artikel
71 Guest editors 2006
1-10 4 p. 610-
1 p.
artikel
72 Guest Editors for : Third Haifa Workshop on Interdisciplinary Applications of Graph Theroy, Combinatorics & Algorithms 2008
1-10 4 p. 409-
1 p.
artikel
73 Guide for authors 2006
1-10 4 p. I-IV
nvt p.
artikel
74 Hamiltonian index is NP-complete Ryjáček, Zdeněk
2011
1-10 4 p. 246-250
5 p.
artikel
75 Homogeneous and strictly homogeneous criteria for partial structures Romov, Boris A.
2009
1-10 4 p. 699-709
11 p.
artikel
76 Hybrid rounding techniques for knapsack problems Mastrolilli, Monaldo
2006
1-10 4 p. 640-649
10 p.
artikel
77 Improper C-colorings of graphs Bujtás, Csilla
2011
1-10 4 p. 174-186
13 p.
artikel
78 Improvements on the Johnson bound for Reed–Solomon codes Muralidhara, V.N.
2009
1-10 4 p. 812-818
7 p.
artikel
79 Injective coloring of planar graphs Bu, Yuehua
2009
1-10 4 p. 663-672
10 p.
artikel
80 Introduction Bampis, Evripidis
2006
1-10 4 p. 609-
1 p.
artikel
81 List-coloring graphs without K 4 , k -minors Kawarabayashi, Ken-ichi
2009
1-10 4 p. 659-662
4 p.
artikel
82 Maximization of input conductances of an infinite network Yamasaki, Maretsugu
1979
1-10 4 p. 301-309
9 p.
artikel
83 Maximum transversal in partial Latin squares and rainbow matchings Zaker, Manouchehr
2007
1-10 4 p. 558-565
8 p.
artikel
84 MILP approach to pattern generation in logical analysis of data Ryoo, Hong Seo
2009
1-10 4 p. 749-761
13 p.
artikel
85 Minimally 3-restricted edge connected graphs Liu, Qinghai
2009
1-10 4 p. 685-690
6 p.
artikel
86 Minimization on submodular flows Zimmermann, U.
1982
1-10 4 p. 303-323
21 p.
artikel
87 Minimum cut bases in undirected networks Bunke, Florentine
2010
1-10 4 p. 277-290
14 p.
artikel
88 minimum dominating set of queens: A trivial programming exercise? Fernau, Henning
2010
1-10 4 p. 308-318
11 p.
artikel
89 Most balanced minimum cuts Bonsma, Paul
2010
1-10 4 p. 261-276
16 p.
artikel
90 Network theory and transversal matroids Recski, András
1980
1-10 4 p. 311-326
16 p.
artikel
91 Non-independent randomized rounding and coloring Doerr, Benjamin
2006
1-10 4 p. 650-659
10 p.
artikel
92 NP-completeness of some type of p-center problem Kikuno, Tohru
1980
1-10 4 p. 361-363
3 p.
artikel
93 Numerical Optimization of Computer Models 1982
1-10 4 p. 340-341
2 p.
artikel
94 On a classification of independence systems Euler, Reinhardt
1980
1-10 4 p. 357-360
4 p.
artikel
95 On an extremal problem related to a theorem of Whitney Singh, Mohit
2007
1-10 4 p. 579-583
5 p.
artikel
96 On a parallel machine scheduling problem with equal processing times Kravchenko, Svetlana A.
2009
1-10 4 p. 848-852
5 p.
artikel
97 On a problem of cyclic permutations of integers Dvornicich, Roberto
1980
1-10 4 p. 353-355
3 p.
artikel
98 On bipartite graphs with minimal energy Li, Xueliang
2009
1-10 4 p. 869-873
5 p.
artikel
99 On computable isomorphisms in efficient asymmetric pairing-based systems Smart, N.P.
2007
1-10 4 p. 538-547
10 p.
artikel
100 On pseudo 2-factors Bekkai, Siham
2009
1-10 4 p. 774-779
6 p.
artikel
101 On spectral theory in discrete programming Gabovich, E.Ya.
1982
1-10 4 p. 269-280
12 p.
artikel
102 On the approximability of the minimum strictly fundamental cycle basis problem Galbiati, Giulia
2011
1-10 4 p. 187-200
14 p.
artikel
103 On the characteristic polynomial of the adjacency matrix of the subdivision graph of a graph Shinoda, Shoji
1980
1-10 4 p. 349-351
3 p.
artikel
104 On the complexity of constructing Golomb Rulers Meyer, Christophe
2009
1-10 4 p. 738-748
11 p.
artikel
105 On the domination number of the cartesian product of the cycle of length n and any graph El-Zahar, M.H.
2007
1-10 4 p. 515-522
8 p.
artikel
106 On the roots of independence polynomials of almost all very well-covered graphs Levit, Vadim E.
2008
1-10 4 p. 478-491
14 p.
artikel
107 On the solution of discrete bottleneck problems Tamir, Arie
1982
1-10 4 p. 299-302
4 p.
artikel
108 Optimal on-line flow time with resource augmentation Epstein, Leah
2006
1-10 4 p. 611-621
11 p.
artikel
109 Paintshop, odd cycles and necklace splitting Meunier, Frédéric
2009
1-10 4 p. 780-793
14 p.
artikel
110 Panconnectivity and edge-pancyclicity of k -ary n -cubes with faulty elements Lin, Shangwei
2011
1-10 4 p. 212-223
12 p.
artikel
111 Partitioning a graph into offensive k -alliances Sigarreta, José M.
2011
1-10 4 p. 224-231
8 p.
artikel
112 Path problems in generalized stars, complete graphs, and brick wall graphs Erlebach, Thomas
2006
1-10 4 p. 673-683
11 p.
artikel
113 Planar graphs without cycles of length 4, 7, 8, or 9 are 3-choosable Wang, Yingqian
2011
1-10 4 p. 232-239
8 p.
artikel
114 Planar kernel and grundy with d≤3, d out ≤2, d in ≤2 are NP-complete Fraenkel, Aviezri S.
1981
1-10 4 p. 257-262
6 p.
artikel
115 Premature sets of 1-factors or how not to schedule round robin tournaments Rosa, Alexander
1982
1-10 4 p. 291-297
7 p.
artikel
116 Probabilistic analysis of some euclidean clustering problems Frieze, A.M.
1980
1-10 4 p. 295-309
15 p.
artikel
117 Probabilistic analysis of the subset-sum problem D'Atri, Gianfranco
1982
1-10 4 p. 329-334
6 p.
artikel
118 Projective DNF formulae and their revision Sloan, Robert H.
2008
1-10 4 p. 530-544
15 p.
artikel
119 Quasi-concave functions on meet-semilattices Kempner, Yulia
2008
1-10 4 p. 492-499
8 p.
artikel
120 Quasiharmonic classification of infinite networks Yamasaki, Maretsugu
1980
1-10 4 p. 339-344
6 p.
artikel
121 Recognizing and representing proper interval graphs in parallel using merging and sorting Bang-Jensen, Jørgen
2007
1-10 4 p. 442-456
15 p.
artikel
122 Relaxed voting and competitive location under monotonous gain functions on trees Spoerhase, J.
2010
1-10 4 p. 361-373
13 p.
artikel
123 Restricted k -ary words and functional equations Firro, Ghassan
2009
1-10 4 p. 602-616
15 p.
artikel
124 Selecting the top three elements Aigner, Martin
1982
1-10 4 p. 247-267
21 p.
artikel
125 Sharp bounds of the zeroth-order general Randić index of bicyclic graphs with given pendent vertices Pan, Xiang-Feng
2011
1-10 4 p. 240-245
6 p.
artikel
126 Shortest paths in linear time on minor-closed graph classes, with an application to Steiner tree approximation Tazari, Siamak
2009
1-10 4 p. 673-684
12 p.
artikel
127 Solving a multicoloring problem with overlaps using integer programming Méndez-Díaz, Isabel
2010
1-10 4 p. 349-354
6 p.
artikel
128 Stochastic spanning tree problem Ishii, Hiroaki
1981
1-10 4 p. 263-273
11 p.
artikel
129 Structure and dimension of the eigenspace of a concave Monge matrix Gavalec, Martin
2009
1-10 4 p. 768-773
6 p.
artikel
130 Super-connected arc-transitive digraphs Meng, Jixiang
2009
1-10 4 p. 653-658
6 p.
artikel
131 Table systems with unconditional transfer Rozenberg, Grzegorz
1981
1-10 4 p. 319-322
4 p.
artikel
132 Tangent circle graphs and ‘orders’ Abbas, Moncef
2007
1-10 4 p. 429-441
13 p.
artikel
133 25th Anniversary Econometric Institute, Rotterdam 1981
1-10 4 p. 328-
1 p.
artikel
134 The bank safe problem Von Randow, R.
1982
1-10 4 p. 335-337
3 p.
artikel
135 The circuit polynomial of the restricted rooted product G ( Γ ) of graphs with a bipartite core G Rosenfeld, Vladimir R.
2008
1-10 4 p. 500-510
11 p.
artikel
136 The complete optimal stars-clustering-tree problem Korach, Ephraim
2008
1-10 4 p. 444-450
7 p.
artikel
137 The complexity of maximum matroid–greedoid intersection and weighted greedoid maximization Mielikäinen, Taneli
2006
1-10 4 p. 684-691
8 p.
artikel
138 The complexity of the minimum cost homomorphism problem for semicomplete digraphs with possible loops Gutin, Gregory
2010
1-10 4 p. 319-330
12 p.
artikel
139 The first and second Zagreb indices of some graph operations Khalifeh, M.H.
2009
1-10 4 p. 804-811
8 p.
artikel
140 The k -edge intersection graphs of paths in a tree Golumbic, Martin Charles
2008
1-10 4 p. 451-461
11 p.
artikel
141 The max-flow problem with parametric capacities Somers, Janet
1979
1-10 4 p. 287-300
14 p.
artikel
142 The NLC-width and clique-width for powers of graphs of bounded tree-width Gurski, Frank
2009
1-10 4 p. 583-595
13 p.
artikel
143 The parameterized complexity of the induced matching problem Moser, Hannes
2009
1-10 4 p. 715-727
13 p.
artikel
144 The partition bargaining problem Rothblum, Uriel G.
2008
1-10 4 p. 428-443
16 p.
artikel
145 The Third Haifa Workshop on Interdisciplinary Applications of Graph Theory, Combinatorics, and Algorithms Ben-Arroyo Hartman, Irith
2008
1-10 4 p. 407-408
2 p.
artikel
146 The Transitive Minimum Manhattan Subnetwork Problem in 3 dimensions Engels, Birgit
2010
1-10 4 p. 298-307
10 p.
artikel
147 8th international colloquium on automata, languages and programming (ICALP 81) 1980
1-10 4 p. 364-
1 p.
artikel
148 Three supplements to Reid’s theorem in multipartite tournaments Li, Shengjia
2010
1-10 4 p. 340-348
9 p.
artikel
149 Upper bounds of degree 3 for the probability of the union of events via linear programming Veneziani, Pierangela
2009
1-10 4 p. 858-863
6 p.
artikel
150 Weighted coloring on planar, bipartite and split graphs: Complexity and approximation de Werra, D.
2009
1-10 4 p. 819-832
14 p.
artikel
151 Weighted distances based on neighborhood sequences for point-lattices Strand, Robin
2009
1-10 4 p. 641-652
12 p.
artikel
152 Wiener indices of balanced binary trees Bereg, Sergey
2007
1-10 4 p. 457-467
11 p.
artikel
153 Worst case behavior of the steepest edge simplex method Goldfarb, Donald
1979
1-10 4 p. 277-285
9 p.
artikel
                             153 gevonden resultaten
 
 Koninklijke Bibliotheek - Nationale Bibliotheek van Nederland