| nr |
titel |
auteur |
tijdschrift |
jaar |
jaarg. |
afl. |
pagina('s) |
type |
| 1 |
A Multiplicative Weight Updates Algorithm for Packing and Covering Semi-infinite Linear Programs
|
Elbassioni, Khaled
|
|
2019
|
81 |
6 |
p. 2377-2429
|
artikel
|
| 2 |
An Efficient Randomized Algorithm for Higher-Order Abstract Voronoi Diagrams
|
Bohler, Cecilia
|
|
2018
|
81 |
6 |
p. 2317-2345
|
artikel
|
| 3 |
Approximate Span Programs
|
Ito, Tsuyoshi
|
|
2018
|
81 |
6 |
p. 2158-2195
|
artikel
|
| 4 |
Clustered Planarity with Pipes
|
Angelini, Patrizio
|
|
2019
|
81 |
6 |
p. 2484-2526
|
artikel
|
| 5 |
Computing $$L_1$$L1 Shortest Paths Among Polygonal Obstacles in the Plane
|
Chen, Danny Z.
|
|
2019
|
81 |
6 |
p. 2430-2483
|
artikel
|
| 6 |
Covering Uncertain Points in a Tree
|
Wang, Haitao
|
|
2019
|
81 |
6 |
p. 2346-2376
|
artikel
|
| 7 |
Hierarchical Partial Planarity
|
Angelini, Patrizio
|
|
2018
|
81 |
6 |
p. 2196-2221
|
artikel
|
| 8 |
Improved Parameterized Algorithms for Network Query Problems
|
Pinter, Ron Y.
|
|
2018
|
81 |
6 |
p. 2270-2316
|
artikel
|
| 9 |
Longest Common Substring with Approximately k Mismatches
|
Kociumaka, Tomasz
|
|
2019
|
81 |
6 |
p. 2633-2652
|
artikel
|
| 10 |
Longest Common Substring with Approximately k Mismatches
|
Kociumaka, Tomasz
|
|
|
81 |
6 |
p. 2633-2652
|
artikel
|
| 11 |
Mind the Gap!
|
Amir, Amihood
|
|
2018
|
81 |
6 |
p. 2123-2157
|
artikel
|
| 12 |
New and Simple Algorithms for Stable Flow Problems
|
Cseh, Ágnes
|
|
2019
|
81 |
6 |
p. 2557-2591
|
artikel
|
| 13 |
On the Complexity Landscape of Connected f-Factor Problems
|
Ganian, R.
|
|
2019
|
81 |
6 |
p. 2606-2632
|
artikel
|
| 14 |
Optimization with Demand Oracles
|
Badanidiyuru, Ashwinkumar
|
|
2018
|
81 |
6 |
p. 2244-2269
|
artikel
|
| 15 |
Randomized Algorithms for Tracking Distributed Count, Frequencies, and Ranks
|
Huang, Zengfeng
|
|
2018
|
81 |
6 |
p. 2222-2243
|
artikel
|
| 16 |
Randomized Algorithms for Tracking Distributed Count, Frequencies, and Ranks
|
Huang, Zengfeng
|
|
|
81 |
6 |
p. 2222-2243
|
artikel
|
| 17 |
Revisiting Connected Dominating Sets: An Almost Optimal Local Information Algorithm
|
Khuller, Samir
|
|
2019
|
81 |
6 |
p. 2592-2605
|
artikel
|
| 18 |
Universal Slope Sets for 1-Bend Planar Drawings
|
Angelini, Patrizio
|
|
2019
|
81 |
6 |
p. 2527-2556
|
artikel
|
Tijdschrift beschrijving