| nr |
titel |
auteur |
tijdschrift |
jaar |
jaarg. |
afl. |
pagina('s) |
type |
| 1 |
Absolutely no free lunches!
|
Belot, Gordon
|
|
|
845 |
C |
p. 159-180
|
artikel
|
| 2 |
Approximation of set multi-cover via hypergraph matching
|
Gorgi, Abbass
|
|
|
845 |
C |
p. 136-143
|
artikel
|
| 3 |
Card-based protocols for secure ranking computations
|
Takashima, Ken
|
|
|
845 |
C |
p. 122-135
|
artikel
|
| 4 |
Editorial Board
|
|
|
|
845 |
C |
p. ii
|
artikel
|
| 5 |
Finding patterns and periods in Cartesian tree matching
|
Park, Sung Gwan
|
|
|
845 |
C |
p. 181-197
|
artikel
|
| 6 |
Liar's domination in unit disk graphs
|
Jallu, Ramesh K.
|
|
|
845 |
C |
p. 38-49
|
artikel
|
| 7 |
New bounds for energy complexity of Boolean functions
|
Dinesh, Krishnamoorthy
|
|
|
845 |
C |
p. 59-75
|
artikel
|
| 8 |
NextPriorityConcept: A new and generic algorithm computing concepts from complex and heterogeneous data
|
Demko, Christophe
|
|
|
845 |
C |
p. 1-20
|
artikel
|
| 9 |
Online parameterized dictionary matching with one gap
|
Levy, Avivit
|
|
|
845 |
C |
p. 208-229
|
artikel
|
| 10 |
On positionality of trigger strategies Nash equilibria in SCAR
|
Konstantinidis, G.
|
|
|
845 |
C |
p. 144-158
|
artikel
|
| 11 |
Parameterized complexity of determinant and permanent
|
Singh, Ranveer
|
|
|
845 |
C |
p. 50-58
|
artikel
|
| 12 |
Sorting an array using the topological sort of a corresponding comparison graph
|
Behera, Balaram D.
|
|
|
845 |
C |
p. 76-97
|
artikel
|
| 13 |
Space-efficient algorithms for computing minimal/shortest unique substrings
|
Mieno, Takuya
|
|
|
845 |
C |
p. 230-242
|
artikel
|
| 14 |
Structure fault tolerance of balanced hypercubes
|
Liu, Heqin
|
|
|
845 |
C |
p. 198-207
|
artikel
|
| 15 |
Towards a theory of mixing graphs: A characterization of perfect mixability
|
Coviello Gonzalez, Miguel
|
|
|
845 |
C |
p. 98-121
|
artikel
|
| 16 |
Vertex deletion on split graphs: Beyond 4-hitting set
|
Choudhary, Pratibha
|
|
|
845 |
C |
p. 21-37
|
artikel
|
Tijdschrift beschrijving