• Designed and developed new features to existing products.• Developed various wireshark plugins for network traffic analysis and ransomware attack detection on the host.

• Worked on various NP-Hard and NP-Complete problems of graph theory which include graph covering, partitioning, convexity detection and longest delay path search.• Developed a heuristic convex partitioning and mapping algorithm for graphpartitioning which can minimize the cut-edges of all partitions and longest delaypath of non-convex partitions.• Implemented the algorithm using C programming language and performed thestatistical analysis on the outcomes on different benchmark circuits. Ouralgorithm outperformed many best known heuristic algorithms.