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
 
                             28 gevonden resultaten
nr titel auteur tijdschrift jaar jaarg. afl. pagina('s) type
1 A comment to: Two classes of edge domination in graphs Jahanbekam, S.
2009
157 2 p. 400-401
2 p.
artikel
2 A note on list improper coloring of plane graphs Dong, Wei
2009
157 2 p. 433-436
4 p.
artikel
3 A polynomial algorithm for 2-cyclic robotic scheduling: A non-Euclidean case Kats, Vladimir
2009
157 2 p. 339-355
17 p.
artikel
4 A polynomial-time algorithm for the paired-domination problem on permutation graphs Cheng, T.C.E.
2009
157 2 p. 262-271
10 p.
artikel
5 Contents 2009
157 2 p. vii-viii
nvt p.
artikel
6 Dichotomy for bounded degree H -colouring Siggers, Mark H.
2009
157 2 p. 201-210
10 p.
artikel
7 Editorial Board 2009
157 2 p. v-vi
nvt p.
artikel
8 2-extendability of toroidal polyhexes and Klein-bottle polyhexes Ye, Dong
2009
157 2 p. 292-299
8 p.
artikel
9 Fall colouring of bipartite graphs and cartesian products of graphs Laskar, Renu
2009
157 2 p. 330-338
9 p.
artikel
10 Forwarding and optical indices of a graph Kosowski, Adrian
2009
157 2 p. 321-329
9 p.
artikel
11 Global defensive k -alliances in graphs Rodríguez-Velázquez, J.A.
2009
157 2 p. 211-218
8 p.
artikel
12 Graph structural properties of non-Yutsis graphs allowing fast recognition Aldred, Robert E.L.
2009
157 2 p. 377-386
10 p.
artikel
13 Highly connected random geometric graphs Balister, Paul
2009
157 2 p. 309-320
12 p.
artikel
14 Idle regulation in non-clairvoyant scheduling of parallel jobs Tchernykh, Andrei
2009
157 2 p. 364-376
13 p.
artikel
15 Minimum cycle cover and Chinese postman problems on mixed graphs with bounded tree-width Fernandes, Cristina G.
2009
157 2 p. 272-279
8 p.
artikel
16 Note on non-separating and removable cycles in highly connected graphs Fujita, Shinya
2009
157 2 p. 398-399
2 p.
artikel
17 On a new code, [ 2 n − 1 , n , 2 n − 1 ] Basu, M.
2009
157 2 p. 402-405
4 p.
artikel
18 On extremal unicyclic molecular graphs with maximal Hosoya index Ou, Jianping
2009
157 2 p. 391-397
7 p.
artikel
19 On strong unimodality of multivariate discrete distributions Subasi, Ersoy
2009
157 2 p. 234-246
13 p.
artikel
20 On the combinatorial structure of a class of [ m 2 , m − 1 2 , 3 ] shortened Hamming codes and their dual-codes Esmaeili, M.
2009
157 2 p. 356-363
8 p.
artikel
21 On the global offensive alliance number of a graph Sigarreta, J.M.
2009
157 2 p. 219-226
8 p.
artikel
22 On the weight and nonlinearity of homogeneous rotation symmetric Boolean functions of degree 2 Kim, Hyeonjin
2009
157 2 p. 428-432
5 p.
artikel
23 Order statistics and estimating cardinalities of massive data sets Giroire, Frédéric
2009
157 2 p. 406-427
22 p.
artikel
24 Periodic schedules for linear precedence constraints Hanen, Claire
2009
157 2 p. 280-291
12 p.
artikel
25 Quasi-median hulls in Hamming space are Steiner hulls Bandelt, Hans-Jürgen
2009
157 2 p. 227-233
7 p.
artikel
26 Representation of graphs by OBDDs Nunkesser, Robin
2009
157 2 p. 247-261
15 p.
artikel
27 Transforming a graph into a 1-balanced graph Kannan, Lavanya
2009
157 2 p. 300-308
9 p.
artikel
28 Transforming an error-tolerant separable matrix to an error-tolerant disjunct matrix Chen, Hong-Bin
2009
157 2 p. 387-390
4 p.
artikel
                             28 gevonden resultaten
 
 Koninklijke Bibliotheek - Nationale Bibliotheek van Nederland