nr |
titel |
auteur |
tijdschrift |
jaar |
jaarg. |
afl. |
pagina('s) |
type |
1 |
An FPT Algorithm for Planar Multicuts with Sources and Sinks on the Outer Face
|
Bentz, Cédric |
|
2018 |
81 |
1 |
p. 224-237 |
artikel |
2 |
An Optimal Algorithm for Minimum-Link Rectilinear Paths in Triangulated Rectilinear Domains
|
Mitchell, Joseph S. B. |
|
2018 |
81 |
1 |
p. 289-316 |
artikel |
3 |
A Simple Projection Algorithm for Linear Programming Problems
|
Kitahara, Tomonari |
|
2018 |
81 |
1 |
p. 167-178 |
artikel |
4 |
Assortment Planning with Nested Preferences: Dynamic Programming with Distributions as States?
|
Segev, Danny |
|
2018 |
81 |
1 |
p. 393-417 |
artikel |
5 |
Correction to: Counting Minimum Weight Arborescences
|
Hayashi, Koyo |
|
2018 |
81 |
1 |
p. 418 |
artikel |
6 |
Guarding Orthogonal Art Galleries with Sliding k-Transmitters: Hardness and Approximation
|
Biedl, Therese |
|
2018 |
81 |
1 |
p. 69-97 |
artikel |
7 |
Impact of Knowledge on Election Time in Anonymous Networks
|
Dieudonné, Yoann |
|
2018 |
81 |
1 |
p. 238-288 |
artikel |
8 |
Linear Search by a Pair of Distinct-Speed Robots
|
Bampas, Evangelos |
|
2018 |
81 |
1 |
p. 317-342 |
artikel |
9 |
Minimum-Cost b-Edge Dominating Sets on Trees
|
Ito, Takehiro |
|
2018 |
81 |
1 |
p. 343-366 |
artikel |
10 |
Network Pollution Games
|
Anastasiadis, Eleftherios |
|
2018 |
81 |
1 |
p. 124-166 |
artikel |
11 |
New Online Algorithms for Story Scheduling in Web Advertising
|
Albers, Susanne |
|
2018 |
81 |
1 |
p. 1-25 |
artikel |
12 |
On Almost Monge All Scores Matrices
|
Carmel, Amir |
|
2018 |
81 |
1 |
p. 47-68 |
artikel |
13 |
Parameterized Algorithms for Max Colorable Induced Subgraph Problem on Perfect Graphs
|
Misra, Neeldhara |
|
2018 |
81 |
1 |
p. 26-46 |
artikel |
14 |
Parameterized Complexity of Asynchronous Border Minimization
|
Ganian, Robert |
|
2018 |
81 |
1 |
p. 201-223 |
artikel |
15 |
Sparse Selfreducible Sets and Nonuniform Lower Bounds
|
Buhrman, Harry |
|
2018 |
81 |
1 |
p. 179-200 |
artikel |
16 |
Structural Results on Matching Estimation with Applications to Streaming
|
Bury, Marc |
|
2018 |
81 |
1 |
p. 367-392 |
artikel |
17 |
The Fair OWA One-to-One Assignment Problem: NP-Hardness and Polynomial Time Special Cases
|
Lesca, Julien |
|
2018 |
81 |
1 |
p. 98-123 |
artikel |