nr |
titel |
auteur |
tijdschrift |
jaar |
jaarg. |
afl. |
pagina('s) |
type |
1 |
Additive edge labelings
|
Dickenstein, Alicia |
|
2010 |
158 |
5 |
p. 444-452 9 p. |
artikel |
2 |
A min–max theorem for plane bipartite graphs
|
Abeledo, Hernán |
|
2010 |
158 |
5 |
p. 375-378 4 p. |
artikel |
3 |
A new approximation algorithm for the multilevel facility location problem
|
Gabor, Adriana F. |
|
2010 |
158 |
5 |
p. 453-460 8 p. |
artikel |
4 |
A note on scheduling identical coupled tasks in logarithmic time
|
Baptiste, Philippe |
|
2010 |
158 |
5 |
p. 583-587 5 p. |
artikel |
5 |
A polyhedral approach to the stability of a family of coalitions
|
Aguilera, Néstor E. |
|
2010 |
158 |
5 |
p. 379-396 18 p. |
artikel |
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. |
artikel |
7 |
Backbone colorings of graphs with bounded degree
|
Miškuf, Jozef |
|
2010 |
158 |
5 |
p. 534-542 9 p. |
artikel |
8 |
Bounds for short covering codes and reactive tabu search
|
Mendes, Carlos |
|
2010 |
158 |
5 |
p. 522-533 12 p. |
artikel |
9 |
Complexity of two coloring problems in cubic planar bipartite mixed graphs
|
Ries, B. |
|
2010 |
158 |
5 |
p. 592-596 5 p. |
artikel |
10 |
Contents
|
|
|
2010 |
158 |
5 |
p. vii-viii nvt p. |
artikel |
11 |
Editorial Board
|
|
|
2010 |
158 |
5 |
p. v-vi nvt p. |
artikel |
12 |
Forcing matching numbers of fullerene graphs
|
Zhang, Heping |
|
2010 |
158 |
5 |
p. 573-582 10 p. |
artikel |
13 |
Greedy approaches for a class of nonlinear Generalized Assignment Problems
|
Sharkey, Thomas C. |
|
2010 |
158 |
5 |
p. 559-572 14 p. |
artikel |
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. |
artikel |
15 |
Maintaining dynamic minimum spanning trees: An experimental study
|
Cattaneo, G. |
|
2010 |
158 |
5 |
p. 404-425 22 p. |
artikel |
16 |
On end-vertices of Lexicographic Breadth First Searches
|
Corneil, Derek G. |
|
2010 |
158 |
5 |
p. 434-443 10 p. |
artikel |
17 |
On the connectivity and superconnected graphs with small diameter
|
Balbuena, C. |
|
2010 |
158 |
5 |
p. 397-403 7 p. |
artikel |
18 |
On the distribution of distances between specified nodes in increasing trees
|
Kuba, Markus |
|
2010 |
158 |
5 |
p. 489-506 18 p. |
artikel |
19 |
Optimal radio labellings of complete m -ary trees
|
Li, Xiangwen |
|
2010 |
158 |
5 |
p. 507-515 9 p. |
artikel |
20 |
Parallel cleaning of a network with brushes
|
Gaspers, Serge |
|
2010 |
158 |
5 |
p. 467-478 12 p. |
artikel |
21 |
Real-time data gathering in sensor networks
|
Revah, Yoram |
|
2010 |
158 |
5 |
p. 543-550 8 p. |
artikel |
22 |
Robust network optimization under polyhedral demand uncertainty is N P -hard
|
Minoux, M. |
|
2010 |
158 |
5 |
p. 597-603 7 p. |
artikel |
23 |
The existence and upper bound for two types of restricted connectivity
|
Liu, Qinghai |
|
2010 |
158 |
5 |
p. 516-521 6 p. |
artikel |
24 |
The independence polynomial of rooted products of graphs
|
Rosenfeld, Vladimir R. |
|
2010 |
158 |
5 |
p. 551-558 8 p. |
artikel |
25 |
The induced path function, monotonicity and betweenness
|
Changat, Manoj |
|
2010 |
158 |
5 |
p. 426-433 8 p. |
artikel |
26 |
The lattice of embedded subsets
|
Grabisch, Michel |
|
2010 |
158 |
5 |
p. 479-488 10 p. |
artikel |