| nr |
titel |
auteur |
tijdschrift |
jaar |
jaarg. |
afl. |
pagina('s) |
type |
| 1 |
A 4 + ϵ approximation for k-connected subgraphs
|
Nutov, Zeev
|
|
|
123 |
C |
p. 64-75
|
artikel
|
| 2 |
An improved algorithm for the Steiner tree problem with bounded edge-length
|
Chen, Chi-Yeh
|
|
|
123 |
C |
p. 20-36
|
artikel
|
| 3 |
Coloring temporal graphs
|
Marino, Andrea
|
|
|
123 |
C |
p. 171-185
|
artikel
|
| 4 |
Complexity of stability
|
Frei, Fabian
|
|
|
123 |
C |
p. 103-121
|
artikel
|
| 5 |
Editorial Board
|
|
|
|
123 |
C |
p. ii
|
artikel
|
| 6 |
Frameworks for designing in-place graph algorithms
|
Chakraborty, Sankardeep
|
|
|
123 |
C |
p. 1-19
|
artikel
|
| 7 |
Improved distance sensitivity oracles with subcubic preprocessing time
|
Ren, Hanlin
|
|
|
123 |
C |
p. 159-170
|
artikel
|
| 8 |
Improved prophet inequalities for combinatorial welfare maximization with (approximately) subadditive agents
|
Zhang, Hanrui
|
|
|
123 |
C |
p. 143-156
|
artikel
|
| 9 |
Polynomial anonymous dynamic distributed computing without a unique leader
|
Kowalski, Dariusz R.
|
|
|
123 |
C |
p. 37-63
|
artikel
|
| 10 |
Refined notions of parameterized enumeration kernels with applications to matching cut enumeration
|
Golovach, Petr A.
|
|
|
123 |
C |
p. 76-102
|
artikel
|
| 11 |
Special issue on Algorithmic Theory of Dynamic Networks and Its Applications – Preface
|
Bonomi, Silvia
|
|
|
123 |
C |
p. 157-158
|
artikel
|
| 12 |
The Projection Games Conjecture and the hardness of approximation of super-SAT and related problems
|
Mukhopadhyay, Priyanka
|
|
|
123 |
C |
p. 186-201
|
artikel
|
| 13 |
Word equations in non-deterministic linear space
|
Jeż, Artur
|
|
|
123 |
C |
p. 122-142
|
artikel
|
Tijdschrift beschrijving