| no |
title |
author |
magazine |
year |
volume |
issue |
page(s) |
type |
| 1 |
An efficient dynamic programming algorithm for the generalized LCS problem with multiple substring exclusive constraints
|
Wu, Yingjie
|
|
2014
|
26 |
C |
p. 98-105
8 p.
|
article
|
| 2 |
An efficient Gray code algorithm for generating all permutations with a given major index
|
Vajnovszki, Vincent
|
|
2014
|
26 |
C |
p. 77-88
12 p.
|
article
|
| 3 |
Bounded max-colorings of graphs
|
Bampis, E.
|
|
2014
|
26 |
C |
p. 56-68
13 p.
|
article
|
| 4 |
Corrections to “Finding dominators via disjoint set union” [J. Discrete Algorithms 23 (2013) 2–20]
|
Fraczak, Wojciech
|
|
2014
|
26 |
C |
p. 106-110
5 p.
|
article
|
| 5 |
Counting solutions to CSP using generating polynomials
|
Berend, Daniel
|
|
2014
|
26 |
C |
p. 89-97
9 p.
|
article
|
| 6 |
Dominating induced matchings in graphs without a skew star
|
Korpelainen, Nicholas
|
|
2014
|
26 |
C |
p. 45-55
11 p.
|
article
|
| 7 |
Editorial Board
|
|
|
2014
|
26 |
C |
p. iii-iv
nvt p.
|
article
|
| 8 |
Gathering six oblivious robots on anonymous symmetric rings
|
D'Angelo, Gianlorenzo
|
|
2014
|
26 |
C |
p. 16-27
12 p.
|
article
|
| 9 |
Integer representations towards efficient counting in the bit probe model
|
Brodal, Gerth Stølting
|
|
2014
|
26 |
C |
p. 34-44
11 p.
|
article
|
| 10 |
Irreversible conversion processes with deadlines
|
Rautenbach, Dieter
|
|
2014
|
26 |
C |
p. 69-76
8 p.
|
article
|
| 11 |
On relating edges in graphs without cycles of length 4
|
Levit, Vadim E.
|
|
2014
|
26 |
C |
p. 28-33
6 p.
|
article
|
| 12 |
On the metric dimension of HDN
|
Xu, Dacheng
|
|
2014
|
26 |
C |
p. 1-6
6 p.
|
article
|
| 13 |
Subset feedback vertex sets in chordal graphs
|
Golovach, Petr A.
|
|
2014
|
26 |
C |
p. 7-15
9 p.
|
article
|
Journal description