nr |
titel |
auteur |
tijdschrift |
jaar |
jaarg. |
afl. |
pagina('s) |
type |
1 |
An implicit representation of chordal comparability graphs in linear time
|
Curtis, Andrew R. |
|
2010 |
158 |
8 |
p. 869-875 7 p. |
artikel |
2 |
A note on the hardness of Skolem-type sequences
|
Nordh, Gustav |
|
2010 |
158 |
8 |
p. 964-966 3 p. |
artikel |
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. |
artikel |
4 |
Combinatorial constructions of fault-tolerant routings with levelled minimum optical indices
|
Zhang, Xiande |
|
2010 |
158 |
8 |
p. 951-963 13 p. |
artikel |
5 |
Contents
|
|
|
2010 |
158 |
8 |
p. v- 1 p. |
artikel |
6 |
Finding large cycles in Hamiltonian graphs
|
Feder, Tomás |
|
2010 |
158 |
8 |
p. 882-893 12 p. |
artikel |
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. |
artikel |
8 |
Independence polynomials of k-tree related graphs
|
Song, Lanzhen |
|
2010 |
158 |
8 |
p. 943-950 8 p. |
artikel |
9 |
Integrated production and delivery scheduling with disjoint windows
|
Huo, Yumei |
|
2010 |
158 |
8 |
p. 921-931 11 p. |
artikel |
10 |
On well-covered triangulations: Part III
|
Finbow, Arthur S. |
|
2010 |
158 |
8 |
p. 894-912 19 p. |
artikel |
11 |
Szeged index, edge Szeged index, and semi-star trees
|
Dolati, Ardeshir |
|
2010 |
158 |
8 |
p. 876-881 6 p. |
artikel |