A

  • Approximation algorithm Minimum Spanning Tree of Imprecise Points Under $L_1$-metric [Volume 51, Issue 2, 2019, Pages 99-110]

  • Approximation algorithms Efficient Approximation Algorithms for Point-set Diameter in Higher Dimensions [Volume 51, Issue 2, 2019, Pages 47-61]

  • Armed Crown $k$-Total difference cordial graphs [Volume 51, Issue 1, 2019, Pages 121-128]

  • Arnoldi method Some new restart vectors for explicitly restarted Arnoldi method [Volume 51, Issue 1, 2019, Pages 91-105]

  • Autism disorder Eye Tracking for Autism Disorder Analysis using Image Processing [Volume 51, Issue 2, 2019, Pages 83-98]

  • Autonomous robot Feasibility of detecting and localizing radioactive source using image processing and computational geometry algorithms [Volume 51, Issue 1, 2019, Pages 107-120]

B

  • Bipartite graphs On the outer-connected reinforcement and bondage problems in bipartite graphs: the algorithmic complexity [Volume 51, Issue 2, 2019, Pages 63-74]

  • Bistar $k$-Total difference cordial graphs [Volume 51, Issue 1, 2019, Pages 121-128]

  • Bistar PD-prime cordial labeling of graphs [Volume 51, Issue 2, 2019, Pages 1-7]

  • Bondage On the outer-connected reinforcement and bondage problems in bipartite graphs: the algorithmic complexity [Volume 51, Issue 2, 2019, Pages 63-74]

C

  • Cloud Computing A Review of Replica Replacement Techniques in Grid Computing and Cloud Computing [Volume 51, Issue 2, 2019, Pages 134-151]

  • Clustering Correlation Coefficients for Hesitant Fuzzy Linguistic Term Sets [Volume 51, Issue 1, 2019, Pages 79-89]

  • Clustering Eye Tracking for Autism Disorder Analysis using Image Processing [Volume 51, Issue 2, 2019, Pages 83-98]

  • Comb $k$-Total difference cordial graphs [Volume 51, Issue 1, 2019, Pages 121-128]

  • Complete bipartiate $k$-Total difference cordial graphs [Volume 51, Issue 1, 2019, Pages 121-128]

  • Complexity On the outer-connected reinforcement and bondage problems in bipartite graphs: the algorithmic complexity [Volume 51, Issue 2, 2019, Pages 63-74]

  • Complexity Tenacious Graph is NP-hard [Volume 51, Issue 2, 2019, Pages 127-134]

  • Convex hull Hough transform Feasibility of detecting and localizing radioactive source using image processing and computational geometry algorithms [Volume 51, Issue 1, 2019, Pages 107-120]

  • Core A generalization of zero-divisor graphs [Volume 51, Issue 2, 2019, Pages 35-45]

D

  • Distance Fr{'e}chet and Hausdorff Queries on $x$-Monotone Trajectories [Volume 51, Issue 2, 2019, Pages 9-17]

  • Dosimetry Feasibility of detecting and localizing radioactive source using image processing and computational geometry algorithms [Volume 51, Issue 1, 2019, Pages 107-120]

  • Dragonfly Algorithm Intelligent application for Heart disease detection using Hybrid Optimization algorithm [Volume 51, Issue 1, 2019, Pages 15-27]

E

  • Evolutionary algorithms Xerus Optimization Algorithm (XOA): a novel nature-inspired metaheuristic algorithm for solving global optimization problems [Volume 51, Issue 2, 2019, Pages 111-126]

  • Explicitly restarted Some new restart vectors for explicitly restarted Arnoldi method [Volume 51, Issue 1, 2019, Pages 91-105]

F

  • Fan PD-prime cordial labeling of graphs [Volume 51, Issue 2, 2019, Pages 1-7]

  • Feature Selection Intelligent application for Heart disease detection using Hybrid Optimization algorithm [Volume 51, Issue 1, 2019, Pages 15-27]

  • File popularity A Review of Replica Replacement Techniques in Grid Computing and Cloud Computing [Volume 51, Issue 2, 2019, Pages 134-151]

  • Finite Difference Method A Closed-Form Solution for Two-Dimensional Diffusion Equation Using Crank-Nicolson Finite Difference Method [Volume 51, Issue 1, 2019, Pages 71-77]

  • Fuzzy relation Max-Min averaging operator: fuzzy inequality systems and resolution [Volume 51, Issue 1, 2019, Pages 55-70]

  • Fuzzy relation On the max - ``Fuzzy Or'' composition fuzzy inequalities systems [Volume 51, Issue 2, 2019, Pages 19-34]

G

  • Global Optimization Xerus Optimization Algorithm (XOA): a novel nature-inspired metaheuristic algorithm for solving global optimization problems [Volume 51, Issue 2, 2019, Pages 111-126]

  • Grid A Review of Replica Replacement Techniques in Grid Computing and Cloud Computing [Volume 51, Issue 2, 2019, Pages 134-151]

H

  • Helm $k$-Total difference cordial graphs [Volume 51, Issue 1, 2019, Pages 121-128]

  • Hesitant fuzzy set Correlation Coefficients for Hesitant Fuzzy Linguistic Term Sets [Volume 51, Issue 1, 2019, Pages 79-89]

  • Higher dimensions Efficient Approximation Algorithms for Point-set Diameter in Higher Dimensions [Volume 51, Issue 2, 2019, Pages 47-61]

  • Hybrid Optimization Algorithm Intelligent application for Heart disease detection using Hybrid Optimization algorithm [Volume 51, Issue 1, 2019, Pages 15-27]

I

  • IIC Algorithm for finding the largest inscribed rectangle in polygon [Volume 51, Issue 1, 2019, Pages 29-41]

  • Imprecise point set Minimum Spanning Tree of Imprecise Points Under $L_1$-metric [Volume 51, Issue 2, 2019, Pages 99-110]

  • Inventory Control Optimization of profit and customer satisfaction in combinatorial production and purchase model by genetic algorithm [Volume 51, Issue 1, 2019, Pages 43-54]

K

  • Krylov subspace Some new restart vectors for explicitly restarted Arnoldi method [Volume 51, Issue 1, 2019, Pages 91-105]

L

  • Large eigenvalue problems Some new restart vectors for explicitly restarted Arnoldi method [Volume 51, Issue 1, 2019, Pages 91-105]

M

  • Metaheuristic algorithms Xerus Optimization Algorithm (XOA): a novel nature-inspired metaheuristic algorithm for solving global optimization problems [Volume 51, Issue 2, 2019, Pages 111-126]

  • Minimum Spanning tree Minimum Spanning Tree of Imprecise Points Under $L_1$-metric [Volume 51, Issue 2, 2019, Pages 99-110]

O

  • Outer-connected domination On the outer-connected reinforcement and bondage problems in bipartite graphs: the algorithmic complexity [Volume 51, Issue 2, 2019, Pages 63-74]

P

  • Path PD-prime cordial labeling of graphs [Volume 51, Issue 2, 2019, Pages 1-7]

  • Performance Sweep Line Algorithm for Convex Hull Revisited [Volume 51, Issue 1, 2019, Pages 1-14]

  • Point-set Efficient Approximation Algorithms for Point-set Diameter in Higher Dimensions [Volume 51, Issue 2, 2019, Pages 47-61]

R

  • Reinforcement On the outer-connected reinforcement and bondage problems in bipartite graphs: the algorithmic complexity [Volume 51, Issue 2, 2019, Pages 63-74]

  • Replica replacement A Review of Replica Replacement Techniques in Grid Computing and Cloud Computing [Volume 51, Issue 2, 2019, Pages 134-151]

  • Restarting vector Some new restart vectors for explicitly restarted Arnoldi method [Volume 51, Issue 1, 2019, Pages 91-105]

S

  • Star $k$-Total difference cordial graphs [Volume 51, Issue 1, 2019, Pages 121-128]

  • Support vector Machine Intelligent application for Heart disease detection using Hybrid Optimization algorithm [Volume 51, Issue 1, 2019, Pages 15-27]

T

  • Tenacity Tenacity and rupture degree parameters for trapezoid graphs [Volume 51, Issue 1, 2019, Pages 157-164]

  • Tenacity Tenacious Graph is NP-hard [Volume 51, Issue 2, 2019, Pages 127-134]

  • Trapezoid graphs Tenacity and rupture degree parameters for trapezoid graphs [Volume 51, Issue 1, 2019, Pages 157-164]

V

  • Vulnerability parameters Tenacity and rupture degree parameters for trapezoid graphs [Volume 51, Issue 1, 2019, Pages 157-164]

W

  • Whale Optimization Algorithm Intelligent application for Heart disease detection using Hybrid Optimization algorithm [Volume 51, Issue 1, 2019, Pages 15-27]

  • Wheel $k$-Total difference cordial graphs [Volume 51, Issue 1, 2019, Pages 121-128]

  • Wheel PD-prime cordial labeling of graphs [Volume 51, Issue 2, 2019, Pages 1-7]

X

  • Xerus Optimization Algorithm Xerus Optimization Algorithm (XOA): a novel nature-inspired metaheuristic algorithm for solving global optimization problems [Volume 51, Issue 2, 2019, Pages 111-126]

Z

  • Zero-divisor graphs A generalization of zero-divisor graphs [Volume 51, Issue 2, 2019, Pages 35-45]