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 fast algorithm for multiplying min-sum permutations Sakai, Yoshifumi
2011
159 17 p. 2175-2183
9 p.
artikel
2 An axiomatic study of Majority-rule (+ ) and associated consensus functions on hierarchies Dong, Jianrong
2011
159 17 p. 2038-2044
7 p.
artikel
3 Approximation of max independent set, min vertex cover and related problems by moderately exponential algorithms Bourgeois, Nicolas
2011
159 17 p. 1954-1970
17 p.
artikel
4 A sufficient condition for boundedness of tolerance graphs Eisermann, Birk
2011
159 17 p. 2165-2169
5 p.
artikel
5 Claw-free graphs with strongly perfect complements. Fractional and integral version. Part I. Basic graphs Chudnovsky, Maria
2011
159 17 p. 1971-1995
25 p.
artikel
6 Claw-free graphs with strongly perfect complements. Fractional and integral version, Part II: Nontrivial strip-structures Chudnovsky, Maria
2011
159 17 p. 1996-2029
34 p.
artikel
7 Constructive extensions of two results on graphic sequences Garg, Ankit
2011
159 17 p. 2170-2174
5 p.
artikel
8 Contents 2011
159 17 p. v-vi
nvt p.
artikel
9 Embedding hypercubes into cylinders, snakes and caterpillars for minimizing wirelength Manuel, Paul
2011
159 17 p. 2109-2116
8 p.
artikel
10 Enumerating ( 2 + 2 ) -free posets by the number of minimal elements and other statistics Kitaev, Sergey
2011
159 17 p. 2098-2108
11 p.
artikel
11 Exact algorithms for dominating set van Rooij, Johan M.M.
2011
159 17 p. 2147-2164
18 p.
artikel
12 Graph reductions, binary rank, and pivots in gene assembly Pflueger, Nathan
2011
159 17 p. 2117-2134
18 p.
artikel
13 ( k , j ) -coloring of sparse graphs Borodin, O.V.
2011
159 17 p. 1947-1953
7 p.
artikel
14 Nested hierarchies in planar graphs Song, Won-Min
2011
159 17 p. 2135-2146
12 p.
artikel
15 On a group testing problem: Characterization of graphs with 2-complexity c 2 and maximum number of edges Gerzen, Tatjana
2011
159 17 p. 2058-2068
11 p.
artikel
16 On self-duality of branchwidth in graphs of bounded genus Sau, Ignasi
2011
159 17 p. 2184-2186
3 p.
artikel
17 On the first geometric‚Äďarithmetic index of graphs Das, K.Ch.
2011
159 17 p. 2030-2037
8 p.
artikel
18 Permuting operations on strings and their relation to prime numbers Asveld, Peter R.J.
2011
159 17 p. 1915-1932
18 p.
artikel
19 Resistance distances and the Kirchhoff index in Cayley graphs Gao, Xing
2011
159 17 p. 2050-2057
8 p.
artikel
20 Simplifying maximum flow computations: The effect of shrinking and good initial flows Liers, F.
2011
159 17 p. 2187-2203
17 p.
artikel
21 Some properties for a class of interchange graphs Jin, Jingjing
2011
159 17 p. 2069-2077
9 p.
artikel
22 The most vital nodes with respect to independent set and vertex cover Bazgan, Cristina
2011
159 17 p. 1933-1946
14 p.
artikel
23 Thue choosability of trees Fiorenzi, Francesca
2011
159 17 p. 2045-2049
5 p.
artikel
24 Total restrained domination in claw-free graphs with minimum degree at least two Joubert, Ernst J.
2011
159 17 p. 2078-2097
20 p.
artikel
                             24 gevonden resultaten
 
 Koninklijke Bibliotheek - Nationale Bibliotheek van Nederland