no |
title |
author |
magazine |
year |
volume |
issue |
page(s) |
type |
1 |
An application of the universality theorem for Tverberg partitions to data depth and hitting convex sets
|
Bárány, Imre |
|
|
90 |
C |
p. |
article |
2 |
Approximate range closest-pair queries
|
Xue, Jie |
|
|
90 |
C |
p. |
article |
3 |
1-bend upward planar slope number of SP-digraphs
|
Di Giacomo, Emilio |
|
|
90 |
C |
p. |
article |
4 |
Dihedral deformation and rigidity
|
Amenta, Nina |
|
|
90 |
C |
p. |
article |
5 |
Editorial Board
|
|
|
|
90 |
C |
p. |
article |
6 |
Extending Erdős–Beck's theorem to higher dimensions
|
Do, Thao |
|
|
90 |
C |
p. |
article |
7 |
Finding minimum witness sets in orthogonal polygons
|
Aldana-Galván, I. |
|
|
90 |
C |
p. |
article |
8 |
Foreword
|
Durocher, Stephane |
|
|
90 |
C |
p. |
article |
9 |
Gathering by repulsion
|
Bose, Prosenjit |
|
|
90 |
C |
p. |
article |
10 |
Improved approximation bounds for the minimum constraint removal problem
|
Bandyapadhyay, Sayan |
|
|
90 |
C |
p. |
article |
11 |
Packing plane spanning trees into a point set
|
Biniaz, Ahmad |
|
|
90 |
C |
p. |
article |
12 |
Parallel computation of alpha complexes for biomolecules
|
Masood, Talha Bin |
|
|
90 |
C |
p. |
article |
13 |
Reconstructing embedded graphs from persistence diagrams
|
Belton, Robin Lynne |
|
|
90 |
C |
p. |
article |
14 |
Symmetric assembly puzzles are hard, beyond a few pieces
|
Demaine, Erik D. |
|
|
90 |
C |
p. |
article |
15 |
Trajectory planning for an articulated probe
|
Teo, Ka Yaw |
|
|
90 |
C |
p. |
article |