nr |
titel |
auteur |
tijdschrift |
jaar |
jaarg. |
afl. |
pagina('s) |
type |
1 |
An Efficient Algorithm for All-Pairs Bounded Edge Connectivity
|
Akmal, Shyan |
|
|
86 |
5 |
p. 1623-1656 |
artikel |
2 |
Approximation Algorithms for Multiprocessor Scheduling with Testing to Minimize the Total Job Completion Time
|
Gong, Mingyang |
|
|
86 |
5 |
p. 1400-1427 |
artikel |
3 |
Approximations for Throughput Maximization
|
Hyatt-Denesik, Dylan |
|
|
86 |
5 |
p. 1545-1577 |
artikel |
4 |
Connectivity with Uncertainty Regions Given as Line Segments
|
Cabello, Sergio |
|
|
86 |
5 |
p. 1512-1544 |
artikel |
5 |
Domination and Cut Problems on Chordal Graphs with Bounded Leafage
|
Galby, Esther |
|
|
86 |
5 |
p. 1428-1474 |
artikel |
6 |
Exploration of High-Dimensional Grids by Finite State Machines
|
Dobrev, Stefan |
|
|
86 |
5 |
p. 1700-1729 |
artikel |
7 |
Improved FPT Algorithms for Deletion to Forest-Like Structures
|
Gowda, Kishen N. |
|
|
86 |
5 |
p. 1657-1699 |
artikel |
8 |
Maximum Weighted Independent Set: Effective Reductions and Fast Algorithms on Sparse Graphs
|
Xiao, Mingyu |
|
|
86 |
5 |
p. 1293-1334 |
artikel |
9 |
On Structural Parameterizations of the Harmless Set Problem
|
Gaikwad, Ajinkya |
|
|
86 |
5 |
p. 1475-1511 |
artikel |
10 |
Predecessor on the Ultra-Wide Word RAM
|
Bille, Philip |
|
|
86 |
5 |
p. 1578-1599 |
artikel |
11 |
Stochastic Variance Reduction for DR-Submodular Maximization
|
Lian, Yuefang |
|
|
86 |
5 |
p. 1335-1364 |
artikel |
12 |
Theoretical Analysis of Git Bisect
|
Courtiel, Julien |
|
|
86 |
5 |
p. 1365-1399 |
artikel |
13 |
Truthful Matching with Online Items and Offline Agents
|
Feldman, Michal |
|
|
86 |
5 |
p. 1600-1622 |
artikel |