nr |
titel |
auteur |
tijdschrift |
jaar |
jaarg. |
afl. |
pagina('s) |
type |
1 |
An approximate cost recovery scheme for the k-product facility location game with penalties
|
Li, Xiaowei |
|
|
1021 |
C |
p. |
artikel |
2 |
Arbitrary pattern formation on a continuous circle by oblivious robot swarm
|
Mondal, Brati |
|
|
1021 |
C |
p. |
artikel |
3 |
Counting vanishing matrix-vector products
|
Brand, Cornelius |
|
|
1021 |
C |
p. |
artikel |
4 |
Editorial Board
|
|
|
|
1021 |
C |
p. |
artikel |
5 |
Generating Java code pairing with ChatGPT
|
Zhao, Zelong |
|
|
1021 |
C |
p. |
artikel |
6 |
MODRED: A code-based non-interactive key exchange protocol
|
Pei, Junling |
|
|
1021 |
C |
p. |
artikel |
7 |
Multiple-model polynomial regression and efficient algorithms for data analysis
|
Lyu, Bohan |
|
|
1021 |
C |
p. |
artikel |
8 |
No six-cell neighborhood cellular automaton solves the parity problem
|
Nenca, Anna |
|
|
1021 |
C |
p. |
artikel |
9 |
Parameterized approximation algorithms for weighted vertex cover
|
Mandal, Soumen |
|
|
1021 |
C |
p. |
artikel |
10 |
Parameterized complexity of vertex splitting to pathwidth at most 1
|
Baumann, Jakob |
|
|
1021 |
C |
p. |
artikel |
11 |
Polynomial-time checking of generalized Sahlqvist syntactic shape
|
Manoorkar, Krishna B. |
|
|
1021 |
C |
p. |
artikel |
12 |
Priority algorithms with advice for disjoint path allocation problems
|
Böckenhauer, Hans-Joachim |
|
|
1021 |
C |
p. |
artikel |
13 |
Probabilistic unifying relations for modelling epistemic and aleatoric uncertainty: Semantics and automated reasoning with theorem proving
|
Ye, Kangfeng |
|
|
1021 |
C |
p. |
artikel |
14 |
Some results on digital segments and balanced words
|
De Luca, Alessandro |
|
|
1021 |
C |
p. |
artikel |