| nr |
titel |
auteur |
tijdschrift |
jaar |
jaarg. |
afl. |
pagina('s) |
type |
| 1 |
A note on approximations of directed edge dominating set
|
Fujito, Toshihiro
|
|
|
179 |
C |
p.
|
artikel
|
| 2 |
A note on matching-cut in P t -free graphs
|
Feghali, Carl
|
|
|
179 |
C |
p.
|
artikel
|
| 3 |
A note on the class of languages generated by F-systems over regular languages
|
Lucero, Jorge C.
|
|
|
179 |
C |
p.
|
artikel
|
| 4 |
A note on the satisfactory partition problem: Constant size requirement
|
Ciccarelli, Felice
|
|
|
179 |
C |
p.
|
artikel
|
| 5 |
A real polynomial for bipartite graph minimum weight perfect matchings
|
Tröbst, Thorben
|
|
|
179 |
C |
p.
|
artikel
|
| 6 |
Computing the k densest subgraphs of a graph
|
Dondi, Riccardo
|
|
|
179 |
C |
p.
|
artikel
|
| 7 |
Corrigendum to “Mutual exclusion in fully anonymous shared memory systems” [Inf. Process. Lett. 158 (2020) 105938]
|
Raynal, Michel
|
|
|
179 |
C |
p.
|
artikel
|
| 8 |
Determining rate monotonic schedulability of real-time periodic tasks using continued fractions
|
Park, Moonju
|
|
|
179 |
C |
p.
|
artikel
|
| 9 |
Editorial Board
|
|
|
|
179 |
C |
p.
|
artikel
|
| 10 |
Efficient linear-time ranking and unranking of derangements
|
Mikawa, Kenji
|
|
|
179 |
C |
p.
|
artikel
|
| 11 |
Escaping Braess's paradox through approximate Caratheodory's theorem
|
Dimos, Sotirios
|
|
|
179 |
C |
p.
|
artikel
|
| 12 |
Faster deterministic algorithm for Cactus Vertex Deletion
|
Tsur, Dekel
|
|
|
179 |
C |
p.
|
artikel
|
| 13 |
GR ( 1 ) is equivalent to R ( 1 )
|
Cimatti, Alessandro
|
|
|
179 |
C |
p.
|
artikel
|
| 14 |
Guided blocks WOM codes
|
Baruch, Gilad
|
|
|
179 |
C |
p.
|
artikel
|
| 15 |
Mesosome avoidance
|
Cummings, Robert
|
|
|
179 |
C |
p.
|
artikel
|
| 16 |
NP-hardness of shortest path problems in networks with non-FIFO time-dependent travel times
|
Zeitz, Tim
|
|
|
179 |
C |
p.
|
artikel
|
| 17 |
On parallel time in population protocols
|
Czumaj, Artur
|
|
|
179 |
C |
p.
|
artikel
|
| 18 |
On some decidability questions concerning supports of rational series
|
Kostolányi, Peter
|
|
|
179 |
C |
p.
|
artikel
|
| 19 |
On the intractability of preemptive single-machine job scheduling with release times, deadlines, and family setup times
|
Singh, Abhishek
|
|
|
179 |
C |
p.
|
artikel
|
| 20 |
On the “majority is least stable” conjecture
|
Biswas, Aniruddha
|
|
|
179 |
C |
p.
|
artikel
|
| 21 |
On the security of TrCBC
|
Chakraborty, Debrup
|
|
|
179 |
C |
p.
|
artikel
|
| 22 |
Polynomial kernels for tracking shortest paths
|
Blažej, Václav
|
|
|
179 |
C |
p.
|
artikel
|
| 23 |
Polynomial recognition of vulnerable multi-commodities
|
Fiorenza, Dario
|
|
|
179 |
C |
p.
|
artikel
|
| 24 |
Space-efficient Huffman codes revisited
|
Grabowski, Szymon
|
|
|
179 |
C |
p.
|
artikel
|
| 25 |
Strong edge-colorings of sparse graphs with 3Δ − 1 colors
|
Li, Xiangwen
|
|
|
179 |
C |
p.
|
artikel
|
Tijdschrift beschrijving