| nr |
titel |
auteur |
tijdschrift |
jaar |
jaarg. |
afl. |
pagina('s) |
type |
| 1 |
A generalization of orthogonal factorizations in digraphs
|
Sun, Zhiren
|
|
2018
|
132 |
C |
p. 49-54
|
artikel
|
| 2 |
Computing positively weighted straight skeletons of simple polygons based on a bisector arrangement
|
Eder, Günther
|
|
2018
|
132 |
C |
p. 28-32
|
artikel
|
| 3 |
Editorial Board
|
|
|
2018
|
132 |
C |
p. ii
|
artikel
|
| 4 |
Fast modular reduction and squaring in GF(2 m )
|
Niehues, L. Boppre
|
|
2018
|
132 |
C |
p. 33-38
|
artikel
|
| 5 |
Fooling sets and the Spanning Tree polytope
|
Khoshkhah, Kaveh
|
|
2018
|
132 |
C |
p. 11-13
|
artikel
|
| 6 |
Memoryless determinacy of finite parity games: Another simple proof
|
Haddad, Serge
|
|
2018
|
132 |
C |
p. 19-21
|
artikel
|
| 7 |
Minimizing total load on a proportionate flowshop with position-dependent processing times and job-rejection
|
Fiszman, Shir
|
|
2018
|
132 |
C |
p. 39-43
|
artikel
|
| 8 |
Multiplicative updates for polynomial root finding
|
Gillis, Nicolas
|
|
2018
|
132 |
C |
p. 14-18
|
artikel
|
| 9 |
Sorting signed permutations by reversals using link-cut trees
|
Rusu, Irena
|
|
2018
|
132 |
C |
p. 44-48
|
artikel
|
| 10 |
Succinct data structures for nearest colored node in a tree
|
Tsur, Dekel
|
|
2018
|
132 |
C |
p. 6-10
|
artikel
|
| 11 |
The P3 infection time is W[1]-hard parameterized by the treewidth
|
Marcilon, Thiago
|
|
2018
|
132 |
C |
p. 55-61
|
artikel
|
| 12 |
Universal approximate simplification under the discrete Fréchet distance
|
Filtser, Omrit
|
|
2018
|
132 |
C |
p. 22-27
|
artikel
|
| 13 |
Why is it hard to beat O(n 2) for Longest Common Weakly Increasing Subsequence?
|
Polak, Adam
|
|
2018
|
132 |
C |
p. 1-5
|
artikel
|
Tijdschrift beschrijving