| no |
title |
author |
magazine |
year |
volume |
issue |
page(s) |
type |
| 1 |
Approximate Nearest Neighbor for Curves: Simple, Efficient, and Deterministic
|
Filtser, Arnold
|
|
|
85 |
5 |
p. 1490-1519
|
article
|
| 2 |
Drawing Partial 2-Trees with Few Slopes
|
Lenhart, William
|
|
|
85 |
5 |
p. 1156-1175
|
article
|
| 3 |
Fair Allocation of Indivisible Items with Conflict Graphs
|
Chiarelli, Nina
|
|
|
85 |
5 |
p. 1459-1489
|
article
|
| 4 |
Group Activity Selection with Few Agent Types
|
Ganian, Robert
|
|
|
85 |
5 |
p. 1111-1155
|
article
|
| 5 |
Improved Bounds for Open Online Dial-a-Ride on the Line
|
Birx, Alexander
|
|
|
85 |
5 |
p. 1372-1414
|
article
|
| 6 |
Lazy Queue Layouts of Posets
|
Alam, Jawaherul Md.
|
|
|
85 |
5 |
p. 1176-1201
|
article
|
| 7 |
Maximizing Coverage While Ensuring Fairness: A Tale of Conflicting Objectives
|
Asudeh, Abolfazl
|
|
|
85 |
5 |
p. 1287-1331
|
article
|
| 8 |
Online Bin Packing of Squares and Cubes
|
Epstein, Leah
|
|
|
85 |
5 |
p. 1415-1458
|
article
|
| 9 |
Practical Budgeted Submodular Maximization
|
Feldman, Moran
|
|
|
85 |
5 |
p. 1332-1371
|
article
|
| 10 |
Quantum Meets Fine-Grained Complexity: Sublinear Time Quantum Algorithms for String Problems
|
Le Gall, François
|
|
|
85 |
5 |
p. 1251-1286
|
article
|
| 11 |
The Complexity of Routing Problems in Forbidden-Transition Graphs and Edge-Colored Graphs
|
Bellitto, Thomas
|
|
|
85 |
5 |
p. 1202-1250
|
article
|
Journal description