| nr |
titel |
auteur |
tijdschrift |
jaar |
jaarg. |
afl. |
pagina('s) |
type |
| 1 |
Algorithmic results in Roman dominating functions on graphs
|
Poureidi, Abolfazl
|
|
|
182 |
C |
p.
|
artikel
|
| 2 |
A nearly tight lower bound for the d-dimensional cow-path problem
|
Bansal, Nikhil
|
|
|
182 |
C |
p.
|
artikel
|
| 3 |
An improved kernel for the flip distance problem on simple convex polygons
|
Bosch-Calvo, Miguel
|
|
|
182 |
C |
p.
|
artikel
|
| 4 |
A note for approximating the submodular cover problem over integer lattice with low adaptive and query complexities
|
Pham, Canh V.
|
|
|
182 |
C |
p.
|
artikel
|
| 5 |
A note on the network coloring game: A randomized distributed (Δ + 1)-coloring algorithm
|
Fryganiotis, Nikolaos
|
|
|
182 |
C |
p.
|
artikel
|
| 6 |
An undecidability result for Separation Logic with theory reasoning
|
Echenim, Mnacho
|
|
|
182 |
C |
p.
|
artikel
|
| 7 |
A sharper lower bound on Rankin's constant
|
Li, Kang
|
|
|
182 |
C |
p.
|
artikel
|
| 8 |
Bounds and algorithms for generalized superimposed codes
|
Rescigno, Adele A.
|
|
|
182 |
C |
p.
|
artikel
|
| 9 |
Comparing approximate and probabilistic differential privacy parameters
|
Guingona, Vincent
|
|
|
182 |
C |
p.
|
artikel
|
| 10 |
Complexity of solving a system of difference constraints with variables restricted to a finite set
|
Cifuentes, Santiago
|
|
|
182 |
C |
p.
|
artikel
|
| 11 |
Connectivity, super connectivity and generalized 3-connectivity of folded divide-and-swap cubes
|
Zhao, Shu-Li
|
|
|
182 |
C |
p.
|
artikel
|
| 12 |
Cryptanalysis of a round optimal lattice-based multisignature scheme
|
Liu, Zi-Yuan
|
|
|
182 |
C |
p.
|
artikel
|
| 13 |
Density of distinct squares in non-primitive words
|
Patawar, Maithilee
|
|
|
182 |
C |
p.
|
artikel
|
| 14 |
Domain-oriented masked bit-parallel finite-field multiplier against side-channel attacks
|
Imaña, José L.
|
|
|
182 |
C |
p.
|
artikel
|
| 15 |
Editorial Board
|
|
|
|
182 |
C |
p.
|
artikel
|
| 16 |
Efficiently recognizing graphs with equal independence and annihilation numbers
|
Rauch, Johannes
|
|
|
182 |
C |
p.
|
artikel
|
| 17 |
Exact PPS sampling with bounded sample size
|
Hentschel, Brian
|
|
|
182 |
C |
p.
|
artikel
|
| 18 |
Heavy and light paths and Hamilton cycles
|
Diskin, Sahar
|
|
|
182 |
C |
p.
|
artikel
|
| 19 |
Longest bordered and periodic subsequences
|
Bannai, Hideo
|
|
|
182 |
C |
p.
|
artikel
|
| 20 |
Long paths in heterogeneous random subgraphs of graphs with large minimum degree
|
Shang, Yilun
|
|
|
182 |
C |
p.
|
artikel
|
| 21 |
Maximal elements with minimal logic
|
Misselbeck-Wessel, Daniel
|
|
|
182 |
C |
p.
|
artikel
|
| 22 |
Monochromatic partitioning of colored points by lines
|
Jowhari, Hossein
|
|
|
182 |
C |
p.
|
artikel
|
| 23 |
On maximum bipartite matching with separation
|
Manurangsi, Pasin
|
|
|
182 |
C |
p.
|
artikel
|
| 24 |
On optimization problems in acyclic hypergraphs
|
Kamiyama, Naoyuki
|
|
|
182 |
C |
p.
|
artikel
|
| 25 |
On radio k-labeling of the power of the infinite path
|
Das, Tapas
|
|
|
182 |
C |
p.
|
artikel
|
| 26 |
Optimal circle search despite the presence of faulty robots
|
Georgiou, Konstantinos
|
|
|
182 |
C |
p.
|
artikel
|
| 27 |
Polynomial invariants for cactuses
|
van Iersel, Leo
|
|
|
182 |
C |
p.
|
artikel
|
| 28 |
Probabilistic weak bisimulation and axiomatization for probabilistic models
|
Wu, Hao
|
|
|
182 |
C |
p.
|
artikel
|
| 29 |
Simplified Chernoff bounds with powers-of-two probabilities
|
Dillencourt, Michael
|
|
|
182 |
C |
p.
|
artikel
|
| 30 |
Synchronizing words under LTL constraints
|
Bertrand, Nathalie
|
|
|
182 |
C |
p.
|
artikel
|
| 31 |
The final nail in the coffin of statistically-secure obfuscator
|
Volkovich, Ilya
|
|
|
182 |
C |
p.
|
artikel
|
| 32 |
The odd chromatic number of a toroidal graph is at most 9
|
Tian, Fangyu
|
|
|
182 |
C |
p.
|
artikel
|
| 33 |
Tight FPT Approximation for Socially Fair Clustering
|
Goyal, Dishant
|
|
|
182 |
C |
p.
|
artikel
|
Tijdschrift beschrijving