2 publications

• Published Subscription 15 Feb 2020

  Decomposition of Dynamic Graphs in Memory Saving with Effective Programming

  By Rishabh Rauthan, Rohan Khaneja, Rohan Kadam, Swapnil Yadav

  Abstract: This study proposes a simple and effective heuristic to save memory in effective programming on tree decompositions when solving a graph optimization problem. The introduced “anchor technique” is based on a tree-like set covering problem. We substantiated our findings by experimental results. Our strategy has negligible computational overhead concerning running time but achieves memory savings for nice tree decompositions and path decompositions between 60% and 98%.

  Published in Recent Trends in Programming languages · Vol. 1, Issue 3, 2014 · pp. 7–12 Read article →

• Published Subscription 7 Jan 2016

  Masters of Deception: A Group That Ruled Cyberspace

  By Rishabh Bhrauthan, Rohan Khaneja, Rohan Kadam, Swapnil Yadav

  Abstract: While widely used, the term hacker is not always applied as it should be. In the hacking community in particular, there can be stark divisions between hackers - people immensely skilled at navigating computer systems and diagnosing security flaws - and crackers - those who use their hacking knowledge for malicious gain. This same dichotomy is sometimes represented by the terms white hat and black hat. A white hat hacker, …

  Published in Recent Trends in Programming languages · Vol. 1, Issue 3, 2014 · pp. 1–3 Read article →