| nr |
titel |
auteur |
tijdschrift |
jaar |
jaarg. |
afl. |
pagina('s) |
type |
| 1 |
A faster FPTAS for the Unbounded Knapsack Problem
|
Jansen, Klaus
|
|
2018
|
68 |
C |
p. 148-174
|
artikel
|
| 2 |
A fast scaling algorithm for the weighted triangle-free 2-matching problem
|
Artamonov, S.
|
|
2018
|
68 |
C |
p. 3-23
|
artikel
|
| 3 |
Border correlations, lattices, and the subgraph component polynomial
|
Blanchet-Sadri, F.
|
|
2018
|
68 |
C |
p. 204-222
|
artikel
|
| 4 |
3-coloring triangle-free planar graphs with a precolored 9-cycle
|
Choi, Ilkyoo
|
|
2018
|
68 |
C |
p. 38-65
|
artikel
|
| 5 |
Computing heat kernel pagerank and a local clustering algorithm
|
Chung, Fan
|
|
2018
|
68 |
C |
p. 96-119
|
artikel
|
| 6 |
Computing primitively-rooted squares and runs in partial words
|
Blanchet-Sadri, F.
|
|
2018
|
68 |
C |
p. 223-241
|
artikel
|
| 7 |
Contagious sets in dense graphs
|
Freund, Daniel
|
|
2018
|
68 |
C |
p. 66-78
|
artikel
|
| 8 |
Decomposing the complete graph and the complete graph minus a 1-factor into copies of a graph G where G is the union of two disjoint cycles
|
El-Zanati, Saad I.
|
|
2018
|
68 |
C |
p. 120-131
|
artikel
|
| 9 |
Editorial Board
|
|
|
2018
|
68 |
C |
p. IFC
|
artikel
|
| 10 |
EERTREE: An efficient data structure for processing palindromes in strings
|
Rubinchik, Mikhail
|
|
2018
|
68 |
C |
p. 249-265
|
artikel
|
| 11 |
Enumeration and maximum number of minimal connected vertex covers in graphs
|
Golovach, Petr A.
|
|
2018
|
68 |
C |
p. 132-147
|
artikel
|
| 12 |
Longest common extension
|
Bollobás, Béla
|
|
2018
|
68 |
C |
p. 242-248
|
artikel
|
| 13 |
On maximum common subgraph problems in series–parallel graphs
|
Kriege, Nils
|
|
2018
|
68 |
C |
p. 79-95
|
artikel
|
| 14 |
1 -page and 2 -page drawings with bounded number of crossings per edge
|
Binucci, Carla
|
|
2018
|
68 |
C |
p. 24-37
|
artikel
|
| 15 |
Preface
|
Kratochvíl, Jan
|
|
2018
|
68 |
C |
p. 1-2
|
artikel
|
| 16 |
The k -leaf spanning tree problem admits a klam value of 39
|
Zehavi, Meirav
|
|
2018
|
68 |
C |
p. 175-203
|
artikel
|
Tijdschrift beschrijving