| nr |
titel |
auteur |
tijdschrift |
jaar |
jaarg. |
afl. |
pagina('s) |
type |
| 1 |
Complexity and inapproximability results for balanced connected subgraph problem
|
Martinod, T.
|
|
|
886 |
C |
p. 69-83
|
artikel
|
| 2 |
Concurrent linearizable nearest neighbour search in LockFree-kD-tree
|
Chatterjee, Bapi
|
|
|
886 |
C |
p. 27-48
|
artikel
|
| 3 |
Dispersing and grouping points on planar segments
|
He, Xiaozhou
|
|
|
886 |
C |
p. 169-177
|
artikel
|
| 4 |
Editorial Board
|
|
|
|
886 |
C |
p. ii
|
artikel
|
| 5 |
Editorial: The 27th London Stringology Days & London Algorithmic Workshop (LSD & LAW) 2019
|
Ayad, Lorraine A.K.
|
|
|
886 |
C |
p. 1-2
|
artikel
|
| 6 |
Extremal set theory and LWE based access structure hiding verifiable secret sharing with malicious-majority and free verification
|
Sehrawat, Vipin Singh
|
|
|
886 |
C |
p. 106-138
|
artikel
|
| 7 |
Fixed-parameter tractability for the Tree Assembly problem
|
Shi, Feng
|
|
|
886 |
C |
p. 3-12
|
artikel
|
| 8 |
One-visibility cops and robber on trees
|
Yang, Boting
|
|
|
886 |
C |
p. 139-156
|
artikel
|
| 9 |
On finding maximum disjoint paths with different colors: Computational complexity and practical LP-based algorithms
|
Deng, Yunyun
|
|
|
886 |
C |
p. 157-168
|
artikel
|
| 10 |
Scheduling with variable-length calibrations: Two agreeable variants
|
Chen, Hua
|
|
|
886 |
C |
p. 94-105
|
artikel
|
| 11 |
Set-constrained delivery broadcast: A communication abstraction for read/write implementable distributed objects
|
Imbs, Damien
|
|
|
886 |
C |
p. 49-68
|
artikel
|
| 12 |
The assignment problem
|
Delporte-Gallet, Carole
|
|
|
886 |
C |
p. 13-26
|
artikel
|
| 13 |
The Small Set Vertex Expansion Problem
|
Agrawal, Garima
|
|
|
886 |
C |
p. 84-93
|
artikel
|
Tijdschrift beschrijving