no |
title |
author |
magazine |
year |
volume |
issue |
page(s) |
type |
1 |
Almost envy-freeness in group resource allocation
|
Kyropoulou, Maria |
|
|
841 |
C |
p. 110-123 |
article |
2 |
Bayesian generalized network design
|
Emek, Yuval |
|
|
841 |
C |
p. 167-185 |
article |
3 |
Editorial Board
|
|
|
|
841 |
C |
p. ii |
article |
4 |
Exploration of carrier-based time-varying networks: The power of waiting
|
Ilcinkas, David |
|
|
841 |
C |
p. 50-61 |
article |
5 |
Extended partial key exposure attacks on RSA: Improvement up to full size decryption exponents
|
Suzuki, Kaichi |
|
|
841 |
C |
p. 62-83 |
article |
6 |
Fully persistent B-trees
|
Brodal, Gerth Stølting |
|
|
841 |
C |
p. 10-26 |
article |
7 |
Hardness results for three kinds of colored connections of graphs
|
Huang, Zhong |
|
|
841 |
C |
p. 27-38 |
article |
8 |
Multiple birds with one stone: Beating 1/2 for EFX and GMMS via envy cycle elimination
|
Amanatidis, Georgios |
|
|
841 |
C |
p. 94-109 |
article |
9 |
On fan-crossing graphs
|
Brandenburg, Franz J. |
|
|
841 |
C |
p. 39-49 |
article |
10 |
On the behavioral implications of differential privacy
|
Gilboa-Freedman, Gail |
|
|
841 |
C |
p. 84-93 |
article |
11 |
Pattern-avoiding inversion sequences and open partition diagrams
|
Yan, Sherry H.F. |
|
|
841 |
C |
p. 186-197 |
article |
12 |
Polynomial kernels for hitting forbidden minors under structural parameterizations
|
Jansen, Bart M.P. |
|
|
841 |
C |
p. 124-166 |
article |
13 |
Scheduling jobs with sizes and delivery times on identical parallel batch machines
|
Li, Yijie |
|
|
841 |
C |
p. 1-9 |
article |