nr |
titel |
auteur |
tijdschrift |
jaar |
jaarg. |
afl. |
pagina('s) |
type |
1 |
An algorithmic separating hyperplane theorem and its applications
|
Kalantari, Bahman |
|
2019 |
256 |
C |
p. 59-82 |
artikel |
2 |
Distinct distances and arithmetic progressions
|
Dumitrescu, Adrian |
|
2019 |
256 |
C |
p. 38-41 |
artikel |
3 |
Editorial Board
|
|
|
2019 |
256 |
C |
p. ii |
artikel |
4 |
Equivalent realisations of a rigid graph
|
Jackson, Bill |
|
2019 |
256 |
C |
p. 42-58 |
artikel |
5 |
Minimal NMR distance information for rigidity of protein graphs
|
Lavor, Carlile |
|
2019 |
256 |
C |
p. 91-104 |
artikel |
6 |
On the embedding of cone graphs in the line with distinct distances between neighbors
|
Zhou, Rodrigo M. |
|
2019 |
256 |
C |
p. 157-162 |
artikel |
7 |
On the Grace–Danielsson inequality for tetrahedra
|
László, Lajos |
|
2019 |
256 |
C |
p. 83-90 |
artikel |
8 |
Pasting gauges II: Balls in pasted halfplanes
|
Plastria, Frank |
|
2019 |
256 |
C |
p. 138-156 |
artikel |
9 |
Pasting gauges I: Shortest paths across a hyperplane
|
Plastria, Frank |
|
2019 |
256 |
C |
p. 105-137 |
artikel |
10 |
Preface
|
Alizadeh, Farid |
|
2019 |
256 |
C |
p. 1-4 |
artikel |
11 |
Realizing Euclidean distance matrices by sphere intersection
|
Alencar, Jorge |
|
2019 |
256 |
C |
p. 5-10 |
artikel |
12 |
The multi-terminal vertex separator problem: Polyhedral analysis and Branch-and-Cut
|
Cornaz, D. |
|
2019 |
256 |
C |
p. 11-37 |
artikel |