Digital Library
Close Browse articles from a journal
     Journal description
       All volumes of the corresponding journal
         All issues of the corresponding volume
                                       All articles of the corresponding issues
 
                             26 results found
no title author magazine year volume issue page(s) type
1 Additive edge labelings Dickenstein, Alicia
2010
158 5 p. 444-452
9 p.
article
2 A min–max theorem for plane bipartite graphs Abeledo, Hernán
2010
158 5 p. 375-378
4 p.
article
3 A new approximation algorithm for the multilevel facility location problem Gabor, Adriana F.
2010
158 5 p. 453-460
8 p.
article
4 A note on scheduling identical coupled tasks in logarithmic time Baptiste, Philippe
2010
158 5 p. 583-587
5 p.
article
5 A polyhedral approach to the stability of a family of coalitions Aguilera, Néstor E.
2010
158 5 p. 379-396
18 p.
article
6 A tournament of order 14 with disjoint Banks and Slater sets Östergård, Patric R.J.
2010
158 5 p. 588-591
4 p.
article
7 Backbone colorings of graphs with bounded degree Miškuf, Jozef
2010
158 5 p. 534-542
9 p.
article
8 Bounds for short covering codes and reactive tabu search Mendes, Carlos
2010
158 5 p. 522-533
12 p.
article
9 Complexity of two coloring problems in cubic planar bipartite mixed graphs Ries, B.
2010
158 5 p. 592-596
5 p.
article
10 Contents 2010
158 5 p. vii-viii
nvt p.
article
11 Editorial Board 2010
158 5 p. v-vi
nvt p.
article
12 Forcing matching numbers of fullerene graphs Zhang, Heping
2010
158 5 p. 573-582
10 p.
article
13 Greedy approaches for a class of nonlinear Generalized Assignment Problems Sharkey, Thomas C.
2010
158 5 p. 559-572
14 p.
article
14 Kernels by monochromatic paths in m -colored unions of quasi-transitive digraphs Galeana-Sánchez, Hortensia
2010
158 5 p. 461-466
6 p.
article
15 Maintaining dynamic minimum spanning trees: An experimental study Cattaneo, G.
2010
158 5 p. 404-425
22 p.
article
16 On end-vertices of Lexicographic Breadth First Searches Corneil, Derek G.
2010
158 5 p. 434-443
10 p.
article
17 On the connectivity and superconnected graphs with small diameter Balbuena, C.
2010
158 5 p. 397-403
7 p.
article
18 On the distribution of distances between specified nodes in increasing trees Kuba, Markus
2010
158 5 p. 489-506
18 p.
article
19 Optimal radio labellings of complete m -ary trees Li, Xiangwen
2010
158 5 p. 507-515
9 p.
article
20 Parallel cleaning of a network with brushes Gaspers, Serge
2010
158 5 p. 467-478
12 p.
article
21 Real-time data gathering in sensor networks Revah, Yoram
2010
158 5 p. 543-550
8 p.
article
22 Robust network optimization under polyhedral demand uncertainty is N P -hard Minoux, M.
2010
158 5 p. 597-603
7 p.
article
23 The existence and upper bound for two types of restricted connectivity Liu, Qinghai
2010
158 5 p. 516-521
6 p.
article
24 The independence polynomial of rooted products of graphs Rosenfeld, Vladimir R.
2010
158 5 p. 551-558
8 p.
article
25 The induced path function, monotonicity and betweenness Changat, Manoj
2010
158 5 p. 426-433
8 p.
article
26 The lattice of embedded subsets Grabisch, Michel
2010
158 5 p. 479-488
10 p.
article
                             26 results found
 
 Koninklijke Bibliotheek - National Library of the Netherlands