nr |
titel |
auteur |
tijdschrift |
jaar |
jaarg. |
afl. |
pagina('s) |
type |
1 |
A dichotomy for weighted efficient dominating sets with bounded degree vertices
|
Brandstädt, Andreas |
|
2019 |
142 |
C |
p. 30-34 |
artikel |
2 |
A (3 + ϵ)k-vertex kernel for edge-disjoint triangle packing
|
Lin, Weibo |
|
2019 |
142 |
C |
p. 20-26 |
artikel |
3 |
A linear-time algorithm for finding a one-to-many 3-disjoint path cover in the cube of a connected graph
|
Park, Jung-Heum |
|
2019 |
142 |
C |
p. 57-63 |
artikel |
4 |
A note on domination 3-edge-critical planar graphs
|
Furuya, Michitaka |
|
2019 |
142 |
C |
p. 64-67 |
artikel |
5 |
Bottleneck bichromatic full Steiner trees
|
Abu-Affash, A. Karim |
|
2019 |
142 |
C |
p. 14-19 |
artikel |
6 |
Competitive analysis of online revenue management with hierarchical resources
|
Ni, Guanqun |
|
2019 |
142 |
C |
p. 41-45 |
artikel |
7 |
Editorial Board
|
|
|
2019 |
142 |
C |
p. ii |
artikel |
8 |
Greedy can beat pure dynamic programming
|
Jukna, Stasys |
|
2019 |
142 |
C |
p. 90-95 |
artikel |
9 |
Nonlinear gradient neural network for solving system of linear equations
|
Xiao, Lin |
|
2019 |
142 |
C |
p. 35-40 |
artikel |
10 |
On exploring always-connected temporal graphs of small pathwidth
|
Bodlaender, Hans L. |
|
2019 |
142 |
C |
p. 68-71 |
artikel |
11 |
On the conjecture of vertex-transitivity of DCell
|
Lü, Huazhong |
|
2019 |
142 |
C |
p. 80-83 |
artikel |
12 |
Parallel routing in regular networks with faults
|
Sabir, Eminjan |
|
2019 |
142 |
C |
p. 84-89 |
artikel |
13 |
#P-completeness of counting roots of a sparse polynomial
|
Milovanov, Alexey |
|
2019 |
142 |
C |
p. 77-79 |
artikel |
14 |
Sets of binary sequences with small total Hamming distances
|
Abdel-Ghaffar, Khaled A.S. |
|
2019 |
142 |
C |
p. 27-29 |
artikel |
15 |
Single machine lot scheduling to minimize the total weighted (discounted) completion time
|
Zhang, E |
|
2019 |
142 |
C |
p. 46-51 |
artikel |
16 |
Strongly polynomial efficient approximation scheme for segmentation
|
Tatti, Nikolaj |
|
2019 |
142 |
C |
p. 1-8 |
artikel |
17 |
The super connectivity of folded crossed cubes
|
Cai, Xuepeng |
|
2019 |
142 |
C |
p. 52-56 |
artikel |
18 |
Thorup–Zwick emulators are universally optimal hopsets
|
Huang, Shang-En |
|
2019 |
142 |
C |
p. 9-13 |
artikel |
19 |
Upper bounds for multi-level multi-server paging
|
Dolev, Shlomi |
|
2019 |
142 |
C |
p. 72-76 |
artikel |