nr |
titel |
auteur |
tijdschrift |
jaar |
jaarg. |
afl. |
pagina('s) |
type |
1 |
Acyclic coloring with few division vertices
|
Mondal, Debajyoti |
|
2013 |
23 |
C |
p. 42-53 12 p. |
artikel |
2 |
A graph-theoretic model to solve the approximate string matching problem allowing for translocations
|
Ahmed, Pritom |
|
2013 |
23 |
C |
p. 143-156 14 p. |
artikel |
3 |
Computing the partial word avoidability indices of binary patterns
|
Blanchet-Sadri, F. |
|
2013 |
23 |
C |
p. 113-118 6 p. |
artikel |
4 |
Computing the partial word avoidability indices of ternary patterns
|
Blanchet-Sadri, F. |
|
2013 |
23 |
C |
p. 119-142 24 p. |
artikel |
5 |
Degree associated edge reconstruction number of graphs
|
Monikandan, S. |
|
2013 |
23 |
C |
p. 35-41 7 p. |
artikel |
6 |
Editorial Board
|
|
|
2013 |
23 |
C |
p. iii-iv nvt p. |
artikel |
7 |
Faster replacement paths algorithms in case of edge or node failure for undirected, positive integer weighted graphs
|
Mahadeokar, Jay |
|
2013 |
23 |
C |
p. 54-62 9 p. |
artikel |
8 |
Finding dominators via disjoint set union
|
Fraczak, Wojciech |
|
2013 |
23 |
C |
p. 2-20 19 p. |
artikel |
9 |
Fuzzy local ω-systems
|
Arulprakasam, R. |
|
2013 |
23 |
C |
p. 157-164 8 p. |
artikel |
10 |
Identifying path covers in graphs
|
Foucaud, Florent |
|
2013 |
23 |
C |
p. 21-34 14 p. |
artikel |
11 |
Lattices, whose incomparability graphs have horns
|
Wasadikar, Meenakshi |
|
2013 |
23 |
C |
p. 63-75 13 p. |
artikel |
12 |
[No title]
|
Arumugam, S. |
|
2013 |
23 |
C |
p. 1- 1 p. |
artikel |
13 |
On antimagic labeling of regular graphs with particular factors
|
Wang, Tao-Ming |
|
2013 |
23 |
C |
p. 76-82 7 p. |
artikel |
14 |
The structural border array
|
Beal, Richard |
|
2013 |
23 |
C |
p. 98-112 15 p. |
artikel |
15 |
Weak heaps engineered
|
Edelkamp, Stefan |
|
2013 |
23 |
C |
p. 83-97 15 p. |
artikel |