| nr |
titel |
auteur |
tijdschrift |
jaar |
jaarg. |
afl. |
pagina('s) |
type |
| 1 |
Corrigendum to “Revisiting reachability in polynomial interrupt timed automata” [Information Processing Letters 174 (2022) 106208]
|
Bérard, Béatrice
|
|
|
175 |
C |
p.
|
artikel
|
| 2 |
Discrete load balancing on complete bipartite graphs
|
Huang, Xiaomin
|
|
|
175 |
C |
p.
|
artikel
|
| 3 |
Editorial Board
|
|
|
|
175 |
C |
p.
|
artikel
|
| 4 |
Erasure and error correcting ability of Parikh matrices
|
Atanasiu, Adrian
|
|
|
175 |
C |
p.
|
artikel
|
| 5 |
Faster counting empty convex polygons in a planar point set
|
Bae, Sang Won
|
|
|
175 |
C |
p.
|
artikel
|
| 6 |
Horton-Strahler number, rooted pathwidth and upward drawings of trees
|
Biedl, Therese
|
|
|
175 |
C |
p.
|
artikel
|
| 7 |
Non-uniform birthday problem revisited: Refined analysis and applications to discrete logarithms
|
Wu, Haoxuan
|
|
|
175 |
C |
p.
|
artikel
|
| 8 |
Representing point sets on the plane as permutations
|
Álvarez-Rebollar, J.L.
|
|
|
175 |
C |
p.
|
artikel
|
| 9 |
The complexity of finding temporal separators under waiting time constraints
|
Molter, Hendrik
|
|
|
175 |
C |
p.
|
artikel
|
| 10 |
The complexity of the vertex-minor problem
|
Dahlberg, Axel
|
|
|
175 |
C |
p.
|
artikel
|
| 11 |
Tight lower bound for average number of terms in optimal double-base number system using information-theoretic tools
|
Suppakitpaisarn, Vorapong
|
|
|
175 |
C |
p.
|
artikel
|
Tijdschrift beschrijving