1: Algorithm to Compute Squares of 1st N Natural Numbers Without Using Multiplication
2: Local Thresholding in General Network Graphs
3: Weak Visibility Queries of Line Segments in Simple Polygons
4: On The Optimization of Dijkstras Algorithm
5: Secluded Connectivity Problems
6: Speeding up shortest path algorithms
7: 2-connecting Outerplanar Graphs without Blowing Up the Pathwidth
8: Canonical Primal-Dual Method for Solving Non-convex Minimization Problems