| nr |
titel |
auteur |
tijdschrift |
jaar |
jaarg. |
afl. |
pagina('s) |
type |
| 1 |
Algorithms and complexity results for labeled correlation clustering problem
|
Liu, Xianmin
|
|
2013
|
29 |
2 |
p. 488-501
|
artikel
|
| 2 |
A tolerance-based heuristic approach for the weighted independent set problem
|
Goldengorin, B. I.
|
|
2013
|
29 |
2 |
p. 433-450
|
artikel
|
| 3 |
Embedding signed graphs in the line
|
Pardo, Eduardo G.
|
|
2013
|
29 |
2 |
p. 451-471
|
artikel
|
| 4 |
General lower bound on the size of $$(H;k)$$-stable graphs
|
Żak, Andrzej
|
|
2013
|
29 |
2 |
p. 367-372
|
artikel
|
| 5 |
Network construction with subgraph connectivity constraints
|
Angluin, Dana
|
|
2013
|
29 |
2 |
p. 418-432
|
artikel
|
| 6 |
Nordhaus–Gaddum-type results for path covering and $$L(2,1)$$-labeling numbers
|
Lü, Damei
|
|
2013
|
29 |
2 |
p. 502-510
|
artikel
|
| 7 |
On the complexity of connectivity in cognitive radio networks through spectrum assignment
|
Liang, Hongyu
|
|
2013
|
29 |
2 |
p. 472-487
|
artikel
|
| 8 |
On the $$p$$-reinforcement and the complexity
|
Lu, You
|
|
2013
|
29 |
2 |
p. 389-405
|
artikel
|
| 9 |
The Laplacian of a uniform hypergraph
|
Hu, Shenglong
|
|
2013
|
29 |
2 |
p. 331-366
|
artikel
|
| 10 |
Transformation from PLTL to automata via NFGs
|
Tian, Cong
|
|
2013
|
29 |
2 |
p. 406-417
|
artikel
|
| 11 |
Two smaller upper bounds of list injective chromatic number
|
Bu, Yuehua
|
|
2013
|
29 |
2 |
p. 373-388
|
artikel
|
Tijdschrift beschrijving