| nr |
titel |
auteur |
tijdschrift |
jaar |
jaarg. |
afl. |
pagina('s) |
type |
| 1 |
A Combinatorial Certifying Algorithm for Linear Feasibility in UTVPI Constraints
|
Subramani, K.
|
|
2016
|
78 |
1 |
p. 166-208
|
artikel
|
| 2 |
Algorithms for k-Internal Out-Branching and k-Tree in Bounded Degree Graphs
|
Zehavi, Meirav
|
|
2016
|
78 |
1 |
p. 319-341
|
artikel
|
| 3 |
Approximating the Maximum Overlap of Polygons under Translation
|
Har-Peled, Sariel
|
|
2016
|
78 |
1 |
p. 147-165
|
artikel
|
| 4 |
Binary Pattern Tile Set Synthesis Is NP-Hard
|
Kari, Lila
|
|
2016
|
78 |
1 |
p. 1-46
|
artikel
|
| 5 |
Computing the Center of Uncertain Points on Tree Networks
|
Wang, Haitao
|
|
2016
|
78 |
1 |
p. 232-254
|
artikel
|
| 6 |
Distribution-Sensitive Construction of the Greedy Spanner
|
Alewijnse, Sander P. A.
|
|
2016
|
78 |
1 |
p. 209-231
|
artikel
|
| 7 |
Linear Rank-Width of Distance-Hereditary Graphs I. A Polynomial-Time Algorithm
|
Adler, Isolde
|
|
2016
|
78 |
1 |
p. 342-377
|
artikel
|
| 8 |
List H-Coloring a Graph by Removing Few Vertices
|
Chitnis, Rajesh
|
|
2016
|
78 |
1 |
p. 110-146
|
artikel
|
| 9 |
Minimizing the Aggregate Movements for Interval Coverage
|
Andrews, Aaron M.
|
|
2016
|
78 |
1 |
p. 47-85
|
artikel
|
| 10 |
On the Parameterized Complexity of Reconfiguration Problems
|
Mouawad, Amer E.
|
|
2016
|
78 |
1 |
p. 274-297
|
artikel
|
| 11 |
Optimization with Uniform Size Queries
|
Feige, Uriel
|
|
2016
|
78 |
1 |
p. 255-273
|
artikel
|
| 12 |
Steiner Trees with Bounded RC-Delay
|
Scheifele, Rudolf
|
|
2016
|
78 |
1 |
p. 86-109
|
artikel
|
| 13 |
The Maximum Labeled Path Problem
|
Couëtoux, Basile
|
|
2016
|
78 |
1 |
p. 298-318
|
artikel
|
Tijdschrift beschrijving