| nr |
titel |
auteur |
tijdschrift |
jaar |
jaarg. |
afl. |
pagina('s) |
type |
| 1 |
An information theoretic proof of the Chernoff-Hoeffding inequality
|
Rioul, Olivier
|
|
|
190 |
C |
p.
|
artikel
|
| 2 |
A note on the complexity of one-sided crossing minimization of trees
|
Dobler, Alexander
|
|
|
190 |
C |
p.
|
artikel
|
| 3 |
A note on the method of equal shares
|
Sánchez-Fernández, Luis
|
|
|
190 |
C |
p.
|
artikel
|
| 4 |
A PTAS for k-hop MST on the Euclidean plane: Improving dependency on k
|
Fakcharoenphol, Jittat
|
|
|
190 |
C |
p.
|
artikel
|
| 5 |
A simple 4-approximation algorithm for maximum agreement forests on multiple unrooted binary trees
|
Dempsey, Jordan
|
|
|
190 |
C |
p.
|
artikel
|
| 6 |
Editorial Board
|
|
|
|
190 |
C |
p.
|
artikel
|
| 7 |
Efficient Implementations of Square-root Vélu's Formulas
|
Lin, Jianming
|
|
|
190 |
C |
p.
|
artikel
|
| 8 |
Fair and truthful allocations under leveled valuations
|
Christodoulou, George
|
|
|
190 |
C |
p.
|
artikel
|
| 9 |
Faster algorithms and a smaller kernel for Cliques or Trees Vertex Deletion
|
Tsur, Dekel
|
|
|
190 |
C |
p.
|
artikel
|
| 10 |
Friends-and-strangers is PSPACE-complete
|
Yang, Chao
|
|
|
190 |
C |
p.
|
artikel
|
| 11 |
Lower bound proof for the size of BDDs representing a shifted addition
|
Kleinekathöfer, Jan
|
|
|
190 |
C |
p.
|
artikel
|
| 12 |
Online delay management on a single train line with predictions
|
Eichhorn, Daniel
|
|
|
190 |
C |
p.
|
artikel
|
| 13 |
On the complexity of some restricted variants of Quotient Pigeon and a weak variant of Kőnig
|
Ishizuka, Takashi
|
|
|
190 |
C |
p.
|
artikel
|
| 14 |
Special issue on Economics and Computation
|
Deligkas, Argyrios
|
|
|
190 |
C |
p.
|
artikel
|
| 15 |
The longest common subsequence problem for small alphabets in the word RAM model
|
Castro Campos, Rodrigo Alexander
|
|
|
190 |
C |
p.
|
artikel
|
Tijdschrift beschrijving