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
 
                             24 gevonden resultaten
nr titel auteur tijdschrift jaar jaarg. afl. pagina('s) type
1 A generalization of Sperner’s theorem and an application to graph orientations Qian, Jianguo
2009
157 9 p. 2170-2176
7 p.
artikel
2 Algorithmic aspects of a general modular decomposition theory Bui-Xuan, B.-M.
2009
157 9 p. 1993-2009
17 p.
artikel
3 An analysis of the size of the minimum dominating sets in random recursive trees, using the Cockayne–Goodman–Hedetniemi algorithm Cooper, Colin
2009
157 9 p. 2010-2014
5 p.
artikel
4 An approximation algorithm for multidimensional assignment problems minimizing the sum of squared errors Kuroki, Yusuke
2009
157 9 p. 2124-2135
12 p.
artikel
5 Approximation algorithms for the 2-peripatetic salesman problem with edge weights 1 and 2 Baburin, A.E.
2009
157 9 p. 1988-1992
5 p.
artikel
6 Approximation algorithms for the single allocation problem in hub-and-spoke networks and related metric labeling problems Iwasa, Masaru
2009
157 9 p. 2078-2088
11 p.
artikel
7 Calculating the extremal number ex ( v ; { C 3 , C 4 , … , C n } ) Tang, Jianmin
2009
157 9 p. 2198-2206
9 p.
artikel
8 Construction of binary and ternary self-orthogonal linear codes Kohnert, Axel
2009
157 9 p. 2118-2123
6 p.
artikel
9 Contents 2009
157 9 p. v-vi
nvt p.
artikel
10 Dynamically maintaining split graphs Heggernes, Pinar
2009
157 9 p. 2057-2069
13 p.
artikel
11 Integral point sets over Z n m Kohnert, Axel
2009
157 9 p. 2105-2117
13 p.
artikel
12 Intersection models of weakly chordal graphs Golumbic, Martin Charles
2009
157 9 p. 2031-2047
17 p.
artikel
13 Merging covering arrays and compressing multiple sequence alignments Ronneseth, Andreas H.
2009
157 9 p. 2177-2190
14 p.
artikel
14 Numerical characterization of n -cube subset partitioning Sahakyan, H.
2009
157 9 p. 2191-2197
7 p.
artikel
15 Online scheduling with general machine cost functions Imreh, Cs.
2009
157 9 p. 2070-2077
8 p.
artikel
16 On some algorithmic problems regarding the hairpin completion Manea, Florin
2009
157 9 p. 2143-2152
10 p.
artikel
17 Optimal matrix-segmentation by rectangles Engel, Konrad
2009
157 9 p. 2015-2030
16 p.
artikel
18 Orthogonal covers by multiplication graphs Gronau, Hans-Dietrich O.F.
2009
157 9 p. 2048-2056
9 p.
artikel
19 Preface Brandstädt, Andreas
2009
157 9 p. 1979-
1 p.
artikel
20 Relaxation procedures on graphs Wegert, Elias
2009
157 9 p. 2207-2216
10 p.
artikel
21 The complexity of minimizing the number of shape matrices subject to minimal beam-on time in multileaf collimator field decomposition with bounded fluence Kalinowski, Thomas
2009
157 9 p. 2089-2104
16 p.
artikel
22 The incidence game chromatic number Andres, Stephan Dominique
2009
157 9 p. 1980-1987
8 p.
artikel
23 Tree 3-spanners in 2-sep directed path graphs: Characterization, recognition, and construction Panda, B.S.
2009
157 9 p. 2153-2169
17 p.
artikel
24 t -wise balanced designs Laue, Reinhard
2009
157 9 p. 2136-2142
7 p.
artikel
                             24 gevonden resultaten
 
 Koninklijke Bibliotheek - Nationale Bibliotheek van Nederland