nr |
titel |
auteur |
tijdschrift |
jaar |
jaarg. |
afl. |
pagina('s) |
type |
1 |
A direct barter model for course add/drop process
|
Özer, Ali Haydar |
|
2011 |
159 |
8 |
p. 812-825 14 p. |
artikel |
2 |
An s – t connection problem with adaptability
|
Adjiashvili, David |
|
2011 |
159 |
8 |
p. 695-705 11 p. |
artikel |
3 |
Best semi-online algorithms for unbounded parallel batch scheduling
|
Yuan, Jinjiang |
|
2011 |
159 |
8 |
p. 838-847 10 p. |
artikel |
4 |
Bounding the feedback vertex number of digraphs in terms of vertex degrees
|
Gruber, Hermann |
|
2011 |
159 |
8 |
p. 872-875 4 p. |
artikel |
5 |
Bounds on the locating-total domination number of a tree
|
Chen, Xue-gang |
|
2011 |
159 |
8 |
p. 769-773 5 p. |
artikel |
6 |
Constrained k -center and movement to independence
|
Dumitrescu, Adrian |
|
2011 |
159 |
8 |
p. 859-865 7 p. |
artikel |
7 |
Contents
|
|
|
2011 |
159 |
8 |
p. v-vi nvt p. |
artikel |
8 |
Degree distance of unicyclic and bicyclic graphs
|
Ilić, Aleksandar |
|
2011 |
159 |
8 |
p. 779-788 10 p. |
artikel |
9 |
Embedding processes in combinatorial game theory
|
dos Santos, Carlos Pereira |
|
2011 |
159 |
8 |
p. 675-682 8 p. |
artikel |
10 |
2-extendability and k -resonance of non-bipartite Klein-bottle polyhexes
|
Li, Qiuli |
|
2011 |
159 |
8 |
p. 800-811 12 p. |
artikel |
11 |
Generalization of matching extensions in graphs (III)
|
Bai, Bing |
|
2011 |
159 |
8 |
p. 727-732 6 p. |
artikel |
12 |
Improved bounds for acyclic chromatic index of planar graphs
|
Hou, Jianfeng |
|
2011 |
159 |
8 |
p. 876-881 6 p. |
artikel |
13 |
Local condition for planar graphs of maximum degree 7 to be 8-totally colorable
|
Chang, Gerard Jennhwa |
|
2011 |
159 |
8 |
p. 760-768 9 p. |
artikel |
14 |
Necessary conditions for the existence of two classes of ZCPS-Wh( v )
|
Abel, R. Julian R. |
|
2011 |
159 |
8 |
p. 848-851 4 p. |
artikel |
15 |
Occurrence of structured motifs in random sequences: Arbitrary number of boxes
|
Stefanov, Valeri T. |
|
2011 |
159 |
8 |
p. 826-831 6 p. |
artikel |
16 |
On a labeling problem in graphs
|
Chandrasekaran, R. |
|
2011 |
159 |
8 |
p. 746-759 14 p. |
artikel |
17 |
On minimal Sturmian partial words
|
Blanchet-Sadri, F. |
|
2011 |
159 |
8 |
p. 733-745 13 p. |
artikel |
18 |
On the Zagreb index inequality of graphs with prescribed vertex degrees
|
Andova, Vesna |
|
2011 |
159 |
8 |
p. 852-858 7 p. |
artikel |
19 |
Separator orders in interval, cocomparability, and AT-free graphs
|
Backer, Jonathan |
|
2011 |
159 |
8 |
p. 717-726 10 p. |
artikel |
20 |
The hyper-Wiener index of the generalized hierarchical product of graphs
|
Eliasi, Mehdi |
|
2011 |
159 |
8 |
p. 866-871 6 p. |
artikel |
21 |
The incidence game chromatic number of paths and subgraphs of wheels
|
Kim, John Y. |
|
2011 |
159 |
8 |
p. 683-694 12 p. |
artikel |
22 |
Uniform-cost inverse absolute and vertex center location problems with edge length variations on trees
|
Alizadeh, Behrooz |
|
2011 |
159 |
8 |
p. 706-716 11 p. |
artikel |
23 |
Unique intersectability of diamond-free graphs
|
Guo, Jun-Lin |
|
2011 |
159 |
8 |
p. 774-778 5 p. |
artikel |
24 |
Untangling planar graphs from a specified vertex position—Hard cases
|
Kang, M. |
|
2011 |
159 |
8 |
p. 789-799 11 p. |
artikel |
25 |
Upper bounds on the signed total domatic number of graphs
|
Volkmann, Lutz |
|
2011 |
159 |
8 |
p. 832-837 6 p. |
artikel |