| no |
title |
author |
magazine |
year |
volume |
issue |
page(s) |
type |
| 1 |
A constant-time sampling algorithm for binary Gaussian distribution over the integers
|
Du, Yusong
|
|
|
176 |
C |
p.
|
article
|
| 2 |
A generalization of the Blind Rotating Table game
|
Rabinovich, Yuri
|
|
|
176 |
C |
p.
|
article
|
| 3 |
A note on algebraic techniques for subgraph detection
|
Brand, Cornelius
|
|
|
176 |
C |
p.
|
article
|
| 4 |
A note on VNP-completeness and border complexity
|
Ikenmeyer, Christian
|
|
|
176 |
C |
p.
|
article
|
| 5 |
A polynomial algorithm for deciding the validity of an electrical distribution tree
|
Barth, Dominique
|
|
|
176 |
C |
p.
|
article
|
| 6 |
A refined approximation for Euclidean k-means
|
Grandoni, Fabrizio
|
|
|
176 |
C |
p.
|
article
|
| 7 |
Editorial Board
|
|
|
|
176 |
C |
p.
|
article
|
| 8 |
Geometric separability using orthogonal objects
|
Abidha, V.P.
|
|
|
176 |
C |
p.
|
article
|
| 9 |
Geometric systems of unbiased representatives
|
Banik, Aritra
|
|
|
176 |
C |
p.
|
article
|
| 10 |
Insertion depth in power-weight trees
|
Lyon, Merritt
|
|
|
176 |
C |
p.
|
article
|
| 11 |
On regularity of Max-CSPs and Min-CSPs
|
Stanković, Aleksa
|
|
|
176 |
C |
p.
|
article
|
| 12 |
Optimal approximations made easy
|
Csikós, Mónika
|
|
|
176 |
C |
p.
|
article
|
| 13 |
The first Zagreb index, reciprocal degree distance and Hamiltonian-connectedness of graphs
|
An, Mingqiang
|
|
|
176 |
C |
p.
|
article
|
| 14 |
The upper and lower bounds of R g -conditional diagnosability of networks
|
Yuan, Jun
|
|
|
176 |
C |
p.
|
article
|
Journal description