| no |
title |
author |
magazine |
year |
volume |
issue |
page(s) |
type |
| 1 |
Adding isolated vertices makes some greedy online algorithms optimal
|
Boyar, Joan
|
|
2018
|
246 |
C |
p. 12-21
|
article
|
| 2 |
1.5-approximation algorithm for the 2 -Convex Recoloring problem
|
Bar-Yehuda, Reuven
|
|
2018
|
246 |
C |
p. 2-11
|
article
|
| 3 |
Computational complexity of distance edge labeling
|
Knop, Dušan
|
|
2018
|
246 |
C |
p. 80-98
|
article
|
| 4 |
Computing longest common extensions in partial words
|
Blanchet-Sadri, F.
|
|
2018
|
246 |
C |
p. 119-139
|
article
|
| 5 |
Editorial Board
|
|
|
2018
|
246 |
C |
p. ii
|
article
|
| 6 |
Efficient enumeration of graph orientations with sources
|
Conte, Alessio
|
|
2018
|
246 |
C |
p. 22-37
|
article
|
| 7 |
Grid spanners with low forwarding index for energy efficient networks
|
Giroire, Frédéric
|
|
2018
|
246 |
C |
p. 99-107
|
article
|
| 8 |
On the complexity of rainbow coloring problems
|
Eiben, Eduard
|
|
2018
|
246 |
C |
p. 38-48
|
article
|
| 9 |
Preface
|
Lipták, Zsuzsanna
|
|
2018
|
246 |
C |
p. 1
|
article
|
| 10 |
Prefix and suffix reversals on strings
|
Fertin, Guillaume
|
|
2018
|
246 |
C |
p. 140-153
|
article
|
| 11 |
Solving the tree containment problem in linear time for nearly stable phylogenetic networks
|
Gambette, Philippe
|
|
2018
|
246 |
C |
p. 62-79
|
article
|
| 12 |
The 1-good-neighbor connectivity and diagnosability of Cayley graphs generated by complete graphs
|
Wang, Mujiangshan
|
|
2018
|
246 |
C |
p. 108-118
|
article
|
| 13 |
The S -labeling problem: An algorithmic tour
|
Fertin, Guillaume
|
|
2018
|
246 |
C |
p. 49-61
|
article
|
Journal description