nr |
titel |
auteur |
tijdschrift |
jaar |
jaarg. |
afl. |
pagina('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 |
artikel |
2 |
Axiomatic characterization of the interval function of a bipartite graph
|
Changat, Manoj |
|
|
286 |
C |
p. 19-28 |
artikel |
3 |
Computing solutions to the congruence 1 n + 2 n + ⋯ + n n ≡ p ( mod n )
|
Alekseyev, Max A. |
|
|
286 |
C |
p. 3-9 |
artikel |
4 |
Editorial Board
|
|
|
|
286 |
C |
p. ii |
artikel |
5 |
Elusiveness of finding degrees
|
Goyal, Dishant |
|
|
286 |
C |
p. 128-139 |
artikel |
6 |
Independent sets in Line of Sight networks
|
Sangha, Pavan |
|
|
286 |
C |
p. 100-115 |
artikel |
7 |
Liar’s dominating set problem on unit disk graphs
|
Jallu, Ramesh K. |
|
|
286 |
C |
p. 91-99 |
artikel |
8 |
On colouring point visibility graphs
|
Diwan, Ajit Arvind |
|
|
286 |
C |
p. 78-90 |
artikel |
9 |
Optimizing movement in convex and non-convex path-networks to establish connectivity
|
Das, Sandip |
|
|
286 |
C |
p. 62-77 |
artikel |
10 |
Preface: CALDAM 2017
|
Gaur, Daya Ram |
|
|
286 |
C |
p. 1-2 |
artikel |
11 |
Querying relational event graphs using colored range searching data structures
|
Chanchary, Farah |
|
|
286 |
C |
p. 51-61 |
artikel |
12 |
Subgraphs with orthogonal factorizations in graphs
|
Zhou, Sizhong |
|
|
286 |
C |
p. 29-34 |
artikel |
13 |
System of unbiased representatives for a collection of bicolorings
|
Balachandran, Niranjan |
|
|
286 |
C |
p. 116-127 |
artikel |
14 |
Variations of largest rectangle recognition amidst a bichromatic point set
|
Acharyya, Ankush |
|
|
286 |
C |
p. 35-50 |
artikel |