1: Multiple-Source Multiple-Sink Maximum Flow in Directed Planar Graphs in $O(n^{1.5} \log n)$ Time
2: Near approximation of maximum weight matching through efficient weight reduction
3: Exhaustive Verification of Weak Reconstruction For Self Complementary Graphs
4: Popular b-matchings
5: A Brief Review on Results and Computational Algorithms for Minimizing the Lennard-Jones Potential
6: An Algorithm to Reduce the Time Complexity of Earliest Deadline First Scheduling Algorithm in Real-Time System
7: A Searchable Compressed Edit-Sensitive Parsing
8: The Complexity of Euclidian 2 Dimension Travelling Salesman Problem versus General Assign Problem, NP is not P