| nr |
titel |
auteur |
tijdschrift |
jaar |
jaarg. |
afl. |
pagina('s) |
type |
| 1 |
Algorithms and Turing kernels for detecting and counting small patterns in unit disk graphs
|
Nederlof, Jesper
|
|
|
148 |
C |
p.
|
artikel
|
| 2 |
Approximate realizations for outerplanaric degree sequences
|
Bar-Noy, Amotz
|
|
|
148 |
C |
p.
|
artikel
|
| 3 |
Backwards-reachability for cooperating multi-pushdown systems
|
Köcher, Chris
|
|
|
148 |
C |
p.
|
artikel
|
| 4 |
Editorial Board
|
|
|
|
148 |
C |
p.
|
artikel
|
| 5 |
Embedding hypercubes into torus and Cartesian product of paths and/or cycles for minimizing wirelength
|
Tang, Zhiyi
|
|
|
148 |
C |
p.
|
artikel
|
| 6 |
Exact and parameterized algorithms for the independent cutset problem
|
Rauch, Johannes
|
|
|
148 |
C |
p.
|
artikel
|
| 7 |
Monitoring the edges of product networks using distances
|
Li, Wen
|
|
|
148 |
C |
p.
|
artikel
|
| 8 |
On computing optimal temporal branchings and spanning subgraphs
|
Bubboloni, Daniela
|
|
|
148 |
C |
p.
|
artikel
|
| 9 |
Parameterized results on acyclic matchings with implications for related problems
|
Chaudhary, Juhi
|
|
|
148 |
C |
p.
|
artikel
|
| 10 |
Single-exponential FPT algorithms for enumerating secluded F -free subgraphs and deleting to scattered graph classes
|
Jansen, Bart M.P.
|
|
|
148 |
C |
p.
|
artikel
|
| 11 |
The parameterized complexity of the survivable network design problem
|
Feldmann, Andreas Emil
|
|
|
148 |
C |
p.
|
artikel
|
| 12 |
Time-sharing scheduling with tolerance capacities
|
Karakostas, George
|
|
|
148 |
C |
p.
|
artikel
|
Tijdschrift beschrijving