nr |
titel |
auteur |
tijdschrift |
jaar |
jaarg. |
afl. |
pagina('s) |
type |
1 |
An algorithm for the dominator chromatic number of a tree
|
Boumediene Merouane, Houcine |
|
2013 |
30 |
1 |
p. 27-33 |
artikel |
2 |
A new randomized algorithm for group testing with unknown number of defective items
|
Cheng, Yongxi |
|
2013 |
30 |
1 |
p. 150-159 |
artikel |
3 |
An optimal randomized online algorithm for the $$k$$k-Canadian Traveller Problem on node-disjoint paths
|
Bender, Marco |
|
2013 |
30 |
1 |
p. 87-96 |
artikel |
4 |
Better approximation algorithms for influence maximization in online social networks
|
Zhu, Yuqing |
|
2013 |
30 |
1 |
p. 97-108 |
artikel |
5 |
Dual power assignment optimization and fault tolerance in WSNs
|
Lam, Nhat X. |
|
2013 |
30 |
1 |
p. 120-138 |
artikel |
6 |
Game domination subdivision number of a graph
|
Favaron, O. |
|
2013 |
30 |
1 |
p. 109-119 |
artikel |
7 |
Group irregularity strength of connected graphs
|
Anholcer, Marcin |
|
2013 |
30 |
1 |
p. 1-17 |
artikel |
8 |
Handling least privilege problem and role mining in RBAC
|
Huang, Hejiao |
|
2013 |
30 |
1 |
p. 63-86 |
artikel |
9 |
L($$d$$d,1)-labelings of the edge-path-replacement by factorization of graphs
|
Karst, Nathaniel |
|
2013 |
30 |
1 |
p. 34-41 |
artikel |
10 |
On the complexity of partitioning a graph into a few connected subgraphs
|
Bensmail, Julien |
|
2013 |
30 |
1 |
p. 174-187 |
artikel |
11 |
On the constraint length of random $$k$$k-CSP
|
Zhou, Guangyan |
|
2014 |
30 |
1 |
p. 188-200 |
artikel |
12 |
On total colorings of 1-planar graphs
|
Zhang, Xin |
|
2013 |
30 |
1 |
p. 160-173 |
artikel |
13 |
PTAS for routing-cost constrained minimum connected dominating set in growth bounded graphs
|
Wu, Lidong |
|
2013 |
30 |
1 |
p. 18-26 |
artikel |
14 |
Radio number for the product of a path and a complete graph
|
Kim, Byeong Moon |
|
2013 |
30 |
1 |
p. 139-149 |
artikel |
15 |
Snakes, coils, and single-track circuit codes with spread $$k$$k
|
Hood, Simon |
|
2013 |
30 |
1 |
p. 42-62 |
artikel |