nr |
titel |
auteur |
tijdschrift |
jaar |
jaarg. |
afl. |
pagina('s) |
type |
1 |
Algorithms for diameters of unicycle graphs and diameter-optimally augmenting trees
|
Wang, Haitao |
|
|
890 |
C |
p. 192-209 |
artikel |
2 |
Approximate set union via approximate randomization
|
Fu, Bin |
|
|
890 |
C |
p. 210-239 |
artikel |
3 |
A process calculus approach to detection and mitigation of PLC malware
|
Lanotte, Ruggero |
|
|
890 |
C |
p. 125-146 |
artikel |
4 |
A substructure based lower bound for eternal vertex cover number
|
Babu, Jasine |
|
|
890 |
C |
p. 87-104 |
artikel |
5 |
Complexity of Scorpion Solitaire and applications to Klondike
|
Arena, Francesco |
|
|
890 |
C |
p. 105-124 |
artikel |
6 |
Constrained synchronization and commutativity
|
Hoffmann, Stefan |
|
|
890 |
C |
p. 147-170 |
artikel |
7 |
Copy complexity of Horn formulas with respect to unit read-once resolution
|
Wojciechowski, Piotr |
|
|
890 |
C |
p. 70-86 |
artikel |
8 |
Deterministic approximation algorithm for submodular maximization subject to a matroid constraint
|
Sun, Xin |
|
|
890 |
C |
p. 1-15 |
artikel |
9 |
Editorial Board
|
|
|
|
890 |
C |
p. ii |
artikel |
10 |
Efficient computation of the oriented chromatic number of recursively defined digraphs
|
Gurski, Frank |
|
|
890 |
C |
p. 16-35 |
artikel |
11 |
On coresets for support vector machines
|
Tukan, Murad |
|
|
890 |
C |
p. 171-191 |
artikel |
12 |
On the parameterized complexity of the synthesis of Boolean nets with restricted place environments
|
Tredup, Ronny |
|
|
890 |
C |
p. 36-69 |
artikel |