| no |
title |
author |
magazine |
year |
volume |
issue |
page(s) |
type |
| 1 |
A linear time algorithm for embedding locally twisted cube into grid network to optimize the layout
|
Shalini, Arul Jeya
|
|
|
286 |
C |
p. 10-18
|
article
|
| 2 |
Axiomatic characterization of the interval function of a bipartite graph
|
Changat, Manoj
|
|
|
286 |
C |
p. 19-28
|
article
|
| 3 |
Computing solutions to the congruence 1 n + 2 n + ⋯ + n n ≡ p ( mod n )
|
Alekseyev, Max A.
|
|
|
286 |
C |
p. 3-9
|
article
|
| 4 |
Editorial Board
|
|
|
|
286 |
C |
p. ii
|
article
|
| 5 |
Elusiveness of finding degrees
|
Goyal, Dishant
|
|
|
286 |
C |
p. 128-139
|
article
|
| 6 |
Independent sets in Line of Sight networks
|
Sangha, Pavan
|
|
|
286 |
C |
p. 100-115
|
article
|
| 7 |
Liar’s dominating set problem on unit disk graphs
|
Jallu, Ramesh K.
|
|
|
286 |
C |
p. 91-99
|
article
|
| 8 |
On colouring point visibility graphs
|
Diwan, Ajit Arvind
|
|
|
286 |
C |
p. 78-90
|
article
|
| 9 |
Optimizing movement in convex and non-convex path-networks to establish connectivity
|
Das, Sandip
|
|
|
286 |
C |
p. 62-77
|
article
|
| 10 |
Preface: CALDAM 2017
|
Gaur, Daya Ram
|
|
|
286 |
C |
p. 1-2
|
article
|
| 11 |
Querying relational event graphs using colored range searching data structures
|
Chanchary, Farah
|
|
|
286 |
C |
p. 51-61
|
article
|
| 12 |
Subgraphs with orthogonal factorizations in graphs
|
Zhou, Sizhong
|
|
|
286 |
C |
p. 29-34
|
article
|
| 13 |
System of unbiased representatives for a collection of bicolorings
|
Balachandran, Niranjan
|
|
|
286 |
C |
p. 116-127
|
article
|
| 14 |
Variations of largest rectangle recognition amidst a bichromatic point set
|
Acharyya, Ankush
|
|
|
286 |
C |
p. 35-50
|
article
|
Journal description