| nr |
titel |
auteur |
tijdschrift |
jaar |
jaarg. |
afl. |
pagina('s) |
type |
| 1 |
Algorithms and Complexity on Indexing Founder Graphs
|
Equi, Massimo
|
|
|
85 |
6 |
p. 1586-1623
|
artikel
|
| 2 |
A Stronger Lower Bound on Parametric Minimum Spanning Trees
|
Eppstein, David
|
|
|
85 |
6 |
p. 1738-1753
|
artikel
|
| 3 |
Better Distance Labeling for Unweighted Planar Graphs
|
Gawrychowski, Paweł
|
|
|
85 |
6 |
p. 1805-1823
|
artikel
|
| 4 |
Clique-Based Separators for Geometric Intersection Graphs
|
de Berg, Mark
|
|
|
85 |
6 |
p. 1652-1678
|
artikel
|
| 5 |
Constructing the first (and coolest) fixed-content universal cycle
|
Sawada, Joe
|
|
|
85 |
6 |
p. 1754-1785
|
artikel
|
| 6 |
Dynamic Dictionaries for Multisets and Counting Filters with Constant Time Operations
|
Bercea, Ioana O.
|
|
|
85 |
6 |
p. 1786-1804
|
artikel
|
| 7 |
Essentially Tight Kernels for (Weakly) Closed Graphs
|
Koana, Tomohiro
|
|
|
85 |
6 |
p. 1706-1735
|
artikel
|
| 8 |
Machine Covering in the Random-Order Model
|
Albers, Susanne
|
|
|
85 |
6 |
p. 1560-1585
|
artikel
|
| 9 |
On the Kernel and Related Problems in Interval Digraphs
|
Francis, Mathew C.
|
|
|
85 |
6 |
p. 1522-1559
|
artikel
|
| 10 |
Preface to the Special Issue on the 17th Algorithms and Data Structures Symposium (WADS 2021)
|
He, Meng
|
|
|
85 |
6 |
p. 1736-1737
|
artikel
|
| 11 |
Resilient Level Ancestor, Bottleneck, and Lowest Common Ancestor Queries in Dynamic Trees
|
Gualà, Luciano
|
|
|
85 |
6 |
p. 1624-1651
|
artikel
|
| 12 |
Shortest Beer Path Queries in Outerplanar Graphs
|
Bacic, Joyce
|
|
|
85 |
6 |
p. 1679-1705
|
artikel
|
| 13 |
Special Issue on Algorithms and Computation (ISAAC 2021)
|
|
|
|
85 |
6 |
p. 1521
|
artikel
|
Tijdschrift beschrijving