| nr |
titel |
auteur |
tijdschrift |
jaar |
jaarg. |
afl. |
pagina('s) |
type |
| 1 |
A Color-Avoiding Approach to Subgraph Counting in Bounded Expansion Classes
|
Reidl, Felix
|
|
|
85 |
8 |
p. 2318-2347
|
artikel
|
| 2 |
Algorithms for p-Faulty Search on a Half-Line
|
Bonato, Anthony
|
|
|
85 |
8 |
p. 2485-2514
|
artikel
|
| 3 |
Certifying Fully Dynamic Algorithms for Recognition and Hamiltonicity of Threshold and Chain Graphs
|
Beisegel, Jesse
|
|
|
85 |
8 |
p. 2454-2481
|
artikel
|
| 4 |
Computing Balanced Convex Partitions of Lines
|
Bereg, Sergey
|
|
|
85 |
8 |
p. 2515-2528
|
artikel
|
| 5 |
Farthest-Point Voronoi Diagrams in the Presence of Rectangular Obstacles
|
Kim, Mincheol
|
|
|
85 |
8 |
p. 2214-2237
|
artikel
|
| 6 |
Guest Editorial: Special Issue on Theoretical Informatics
|
Kohayakawa, Yoshiharu
|
|
|
85 |
8 |
p. 2482-2484
|
artikel
|
| 7 |
Improved Merlin–Arthur Protocols for Central Problems in Fine-Grained Complexity
|
Akmal, Shyan
|
|
|
85 |
8 |
p. 2395-2426
|
artikel
|
| 8 |
Intersecting Longest Cycles in Archimedean Tilings
|
Nadeem, Muhammad Faisal
|
|
|
85 |
8 |
p. 2348-2362
|
artikel
|
| 9 |
Near-Optimal Quantum Algorithms for String Problems
|
Akmal, Shyan
|
|
|
85 |
8 |
p. 2260-2317
|
artikel
|
| 10 |
Online Minimization of the Maximum Starting Time: Migration Helps
|
Levin, Asaf
|
|
|
85 |
8 |
p. 2238-2259
|
artikel
|
| 11 |
On the Complexity of Binary Polynomial Optimization Over Acyclic Hypergraphs
|
Del Pia, Alberto
|
|
|
85 |
8 |
p. 2189-2213
|
artikel
|
| 12 |
Resource-Constrained Scheduling Algorithms for Stochastic Independent Tasks With Unknown Probability Distribution
|
Gao, Yiqin
|
|
|
85 |
8 |
p. 2363-2394
|
artikel
|
| 13 |
Unique Assembly Verification in Two-Handed Self-Assembly
|
Caballero, David
|
|
|
85 |
8 |
p. 2427-2453
|
artikel
|
Tijdschrift beschrijving