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
 
                             11 results found
no title author magazine year volume issue page(s) type
1 An implicit representation of chordal comparability graphs in linear time Curtis, Andrew R.
2010
158 8 p. 869-875
7 p.
article
2 A note on the hardness of Skolem-type sequences Nordh, Gustav
2010
158 8 p. 964-966
3 p.
article
3 A tight bound on the number of mobile servers to guarantee transferability among dominating configurations Fujita, Satoshi
2010
158 8 p. 913-920
8 p.
article
4 Combinatorial constructions of fault-tolerant routings with levelled minimum optical indices Zhang, Xiande
2010
158 8 p. 951-963
13 p.
article
5 Contents 2010
158 8 p. v-
1 p.
article
6 Finding large cycles in Hamiltonian graphs Feder, Tomás
2010
158 8 p. 882-893
12 p.
article
7 Improved algorithms for the continuous tree edge-partition problems and a note on ratio and sorted matrices searches Lin, Jyh-Jye
2010
158 8 p. 932-942
11 p.
article
8 Independence polynomials of k-tree related graphs Song, Lanzhen
2010
158 8 p. 943-950
8 p.
article
9 Integrated production and delivery scheduling with disjoint windows Huo, Yumei
2010
158 8 p. 921-931
11 p.
article
10 On well-covered triangulations: Part III Finbow, Arthur S.
2010
158 8 p. 894-912
19 p.
article
11 Szeged index, edge Szeged index, and semi-star trees Dolati, Ardeshir
2010
158 8 p. 876-881
6 p.
article
                             11 results found
 
 Koninklijke Bibliotheek - National Library of the Netherlands