| nr |
titel |
auteur |
tijdschrift |
jaar |
jaarg. |
afl. |
pagina('s) |
type |
| 1 |
Algorithms with improved delay for enumerating connected induced subgraphs of a large cardinality
|
Wang, Shanshan
|
|
|
183 |
C |
p.
|
artikel
|
| 2 |
A new key recovery attack on a code-based signature from the Lyubashevsky framework
|
Tan, Chik How
|
|
|
183 |
C |
p.
|
artikel
|
| 3 |
A note on hardness of computing recursive teaching dimension
|
Manurangsi, Pasin
|
|
|
183 |
C |
p.
|
artikel
|
| 4 |
A short note on “A note on single-machine scheduling with job-dependent learning effects”
|
Yang, Dar-Li
|
|
|
183 |
C |
p.
|
artikel
|
| 5 |
A weakness in OCB3 used with short nonces allowing for a break of authenticity and confidentiality
|
Liénardy, Jean
|
|
|
183 |
C |
p.
|
artikel
|
| 6 |
Editorial Board
|
|
|
|
183 |
C |
p.
|
artikel
|
| 7 |
Fast primal-dual update against local weight update in linear assignment problem and its application
|
Morita, Kohei
|
|
|
183 |
C |
p.
|
artikel
|
| 8 |
Learning from positive and negative examples: New proof for binary alphabets
|
Lingg, Jonas
|
|
|
183 |
C |
p.
|
artikel
|
| 9 |
Linear threshold functions in decision lists, decision trees, and depth-2 circuits
|
Dahiya, Yogesh
|
|
|
183 |
C |
p.
|
artikel
|
| 10 |
On approximate near-neighbors search under the (continuous) Fréchet distance in higher dimensions
|
Mirzanezhad, Majid
|
|
|
183 |
C |
p.
|
artikel
|
| 11 |
On the hull number on cycle convexity of graphs
|
Araujo, Julio
|
|
|
183 |
C |
p.
|
artikel
|
| 12 |
On the non-efficient PAC learnability of conjunctive queries
|
ten Cate, Balder
|
|
|
183 |
C |
p.
|
artikel
|
| 13 |
Recognizing well-dominated graphs is coNP-complete
|
Agrawal, Akanksha
|
|
|
183 |
C |
p.
|
artikel
|
| 14 |
Recursion-free modular arithmetic in the lambda-calculus
|
Mackie, Maximilien
|
|
|
183 |
C |
p.
|
artikel
|
| 15 |
Security weakness of a certificate-based proxy signature scheme for IIoT environments
|
Park, Je Hong
|
|
|
183 |
C |
p.
|
artikel
|
| 16 |
Simplicity in Eulerian circuits: Uniqueness and safety
|
Obscura Acosta, Nidia
|
|
|
183 |
C |
p.
|
artikel
|
| 17 |
Steiner connectivity problems in hypergraphs
|
Hörsch, Florian
|
|
|
183 |
C |
p.
|
artikel
|
| 18 |
The maximum linear arrangement problem for trees under projectivity and planarity
|
Alemany-Puig, Lluís
|
|
|
183 |
C |
p.
|
artikel
|
| 19 |
There is no APTAS for 2-dimensional vector bin packing: Revisited
|
Ray, Arka
|
|
|
183 |
C |
p.
|
artikel
|
| 20 |
Unbiased estimation of inner product via higher order count sketch
|
Verma, Bhisham Dev
|
|
|
183 |
C |
p.
|
artikel
|
| 21 |
Word automatic groups of nilpotency class 2
|
Nies, André
|
|
|
183 |
C |
p.
|
artikel
|
| 22 |
Worst-case analysis of LPT scheduling on a small number of non-identical processors
|
Mitsunobu, Takuto
|
|
|
183 |
C |
p.
|
artikel
|
Tijdschrift beschrijving