| nr |
titel |
auteur |
tijdschrift |
jaar |
jaarg. |
afl. |
pagina('s) |
type |
| 1 |
An Improved Upper Bound on the Queue Number of Planar Graphs
|
Bekos, Michael
|
|
|
85 |
2 |
p. 544-562
|
artikel
|
| 2 |
Efficient Isomorphism for Sd-Graphs and T-Graphs
|
Ağaoğlu Çağırıcı, Deniz
|
|
|
85 |
2 |
p. 352-383
|
artikel
|
| 3 |
Faster Graph Coloring in Polynomial Space
|
Gaspers, Serge
|
|
|
85 |
2 |
p. 584-609
|
artikel
|
| 4 |
Fast Exact Dynamic Time Warping on Run-Length Encoded Time Series
|
Froese, Vincent
|
|
|
85 |
2 |
p. 492-508
|
artikel
|
| 5 |
Improved Algorithms for Scheduling Unsplittable Flows on Paths
|
Jahanjou, Hamidreza
|
|
|
85 |
2 |
p. 563-583
|
artikel
|
| 6 |
Integer Feasibility and Refutations in UTVPI Constraints Using Bit-Scaling
|
Subramani, K.
|
|
|
85 |
2 |
p. 610-637
|
artikel
|
| 7 |
Parameterized Complexity of Computing Maximum Minimal Blocking and Hitting Sets
|
Araújo, Júlio
|
|
|
85 |
2 |
p. 444-491
|
artikel
|
| 8 |
Parameterized Complexity of Diameter
|
Bentert, Matthias
|
|
|
85 |
2 |
p. 325-351
|
artikel
|
| 9 |
Round-Competitive Algorithms for Uncertainty Problems with Parallel Queries
|
Erlebach, Thomas
|
|
|
85 |
2 |
p. 406-443
|
artikel
|
| 10 |
Solving Target Set Selection with Bounded Thresholds Faster than 2n
|
Bliznets, Ivan
|
|
|
85 |
2 |
p. 384-405
|
artikel
|
| 11 |
Succinct Permutation Graphs
|
Tsakalidis, Konstantinos
|
|
|
85 |
2 |
p. 509-543
|
artikel
|
Tijdschrift beschrijving