nr |
titel |
auteur |
tijdschrift |
jaar |
jaarg. |
afl. |
pagina('s) |
type |
1 |
A new construction of broadcast graphs
|
Harutyunyan, Hovhannes A. |
|
|
280 |
C |
p. 144-155 |
artikel |
2 |
Bisecting and D -secting families for set systems
|
Balachandran, Niranjan |
|
|
280 |
C |
p. 2-13 |
artikel |
3 |
Color spanning objects: Algorithms and hardness results
|
Banerjee, Sandip |
|
|
280 |
C |
p. 14-22 |
artikel |
4 |
Domination chain: Characterisation, classical complexity, parameterised complexity and approximability
|
Bazgan, Cristina |
|
|
280 |
C |
p. 23-42 |
artikel |
5 |
Domination parameters in hypertrees and sibling trees
|
Rajasingh, Indra |
|
|
280 |
C |
p. 237-245 |
artikel |
6 |
Edge consecutive gracefulness of a graph
|
Pereira, Jessica |
|
|
280 |
C |
p. 214-220 |
artikel |
7 |
Editorial Board
|
|
|
|
280 |
C |
p. ii |
artikel |
8 |
Efficient independent set approximation in unit disk graphs
|
Das, Gautam K. |
|
|
280 |
C |
p. 63-70 |
artikel |
9 |
Improved approximation algorithms for cumulative VRP with stochastic demands
|
Gaur, Daya Ram |
|
|
280 |
C |
p. 133-143 |
artikel |
10 |
Interval function, induced path function, (claw, paw)-free graphs and axiomatic characterizations
|
Changat, Manoj |
|
|
280 |
C |
p. 53-62 |
artikel |
11 |
L ( 2 , 1 ) -colorings and irreducible no-hole colorings of the direct product of graphs
|
Mandal, Nibedita |
|
|
280 |
C |
p. 186-200 |
artikel |
12 |
Linear time algorithms for Euclidean 1-center in ℜ d with non-linear convex constraints
|
Das, Sandip |
|
|
280 |
C |
p. 71-85 |
artikel |
13 |
Linear-time fitting of a k -step function
|
Bhattacharya, Binay |
|
|
280 |
C |
p. 43-52 |
artikel |
14 |
On cyclic codes over Galois rings
|
Kaur, Jasbir |
|
|
280 |
C |
p. 156-161 |
artikel |
15 |
On strictly chordality- k graphs
|
Dhanalakshmi, S. |
|
|
280 |
C |
p. 93-112 |
artikel |
16 |
On the complexity of cd-coloring of graphs
|
M.A., Shalu |
|
|
280 |
C |
p. 171-185 |
artikel |
17 |
Preface: CALDAM 2016
|
Govindarajan, Sathish |
|
|
280 |
C |
p. 1 |
artikel |
18 |
Relative clique number of planar signed graphs
|
Das, Sandip |
|
|
280 |
C |
p. 86-92 |
artikel |
19 |
Reversible complement cyclic codes over Galois rings with application to DNA codes
|
Kaur, Jasbir |
|
|
280 |
C |
p. 162-170 |
artikel |
20 |
Space reduction constraints for the median of permutations problem
|
Milosz, Robin |
|
|
280 |
C |
p. 201-213 |
artikel |
21 |
The complexity of AND—decomposition of Boolean functions
|
Emelyanov, Pavel |
|
|
280 |
C |
p. 113-132 |
artikel |
22 |
The Steiner tree in K 1 , r -free split graphs—A Dichotomy
|
Renjith, P. |
|
|
280 |
C |
p. 246-255 |
artikel |
23 |
Wirelength of embedding complete multipartite graphs into certain graphs
|
R., Sundara Rajan |
|
|
280 |
C |
p. 221-236 |
artikel |