nr |
titel |
auteur |
tijdschrift |
jaar |
jaarg. |
afl. |
pagina('s) |
type |
1 |
Approximating subset k-connectivity problems
|
Nutov, Zeev |
|
2012 |
17 |
C |
p. 51-59 9 p. |
artikel |
2 |
Capacitated Arc Stabbing
|
Rawitz, Dror |
|
2012 |
17 |
C |
p. 86-94 9 p. |
artikel |
3 |
Detecting induced star-like minors in polynomial time
|
Fiala, Jiří |
|
2012 |
17 |
C |
p. 74-85 12 p. |
artikel |
4 |
Detecting 2-joins faster
|
Charbit, Pierre |
|
2012 |
17 |
C |
p. 60-66 7 p. |
artikel |
5 |
d-Transversals of stable sets and vertex covers in weighted bipartite graphs
|
Bentz, C. |
|
2012 |
17 |
C |
p. 95-102 8 p. |
artikel |
6 |
Editorial Board
|
|
|
2012 |
17 |
C |
p. iii-iv nvt p. |
artikel |
7 |
Efficient algorithms for the periodic subgraphs mining problem
|
Apostolico, Alberto |
|
2012 |
17 |
C |
p. 24-30 7 p. |
artikel |
8 |
Enumerating trichromatic triangles containing the origin in linear time
|
Elmasry, Amr |
|
2012 |
17 |
C |
p. 45-50 6 p. |
artikel |
9 |
More results on overlapping squares
|
Franek, Frantisek |
|
2012 |
17 |
C |
p. 2-8 7 p. |
artikel |
10 |
[No title]
|
Mouchard, Laurent |
|
2012 |
17 |
C |
p. 1- 1 p. |
artikel |
11 |
On a conjecture of Erdős for multiplicities of cliques
|
Deza, Antoine |
|
2012 |
17 |
C |
p. 9-14 6 p. |
artikel |
12 |
On left and right seeds of a string
|
Christou, Michalis |
|
2012 |
17 |
C |
p. 31-44 14 p. |
artikel |
13 |
On position restricted substring searching in succinct space
|
Hon, Wing-Kai |
|
2012 |
17 |
C |
p. 109-114 6 p. |
artikel |
14 |
Succinct representations of weighted trees supporting path queries
|
Patil, Manish |
|
2012 |
17 |
C |
p. 103-108 6 p. |
artikel |
15 |
The substring inclusion constraint longest common subsequence problem can be solved in quadratic time
|
Alam, Muhammad Rashed |
|
2012 |
17 |
C |
p. 67-73 7 p. |
artikel |
16 |
Tree template matching in ranked ordered trees by pushdown automata
|
Flouri, Tomáš |
|
2012 |
17 |
C |
p. 15-23 9 p. |
artikel |