A note on triangle partitions
A Note on: `Algorithms for Connected Set Cover Problem and Fault-Tolerant Connected Set Cover Problem'
A Novel Solution to the ATT48 Benchmark Problem
A novel type of branch and bound for maximum independent set
A O(1/eps^2)^n Time Sieving Algorithm for Approximate Integer Programming
A O(E) Time Shortest Path Algorithm For Non Negative Weighted Undirected Graphs
A parallel approximation algorithm for mixed packing and covering semidefinite programs
A Parameterized Perspective on $P_2$-Packings
A parametric-complexity exact 3-COLORING Algorithm
A Partition-Based Relaxation For Steiner Trees
A Planarity Test via Construction Sequences
A Polylogarithmic-Competitive Algorithm for the k-Server Problem
A polynomial algorithm for the k-cluster problem on interval graphs
A Polynomial kernel for Proper Interval Vertex Deletion
A polynomial time $\frac 3 2$ -approximation algorithm for the vertex cover problem on a class of graphs
A Polynomial Time Algorithm for a Special Case of Linear Integer Programming
A Polynomial Time Algorithm for Hamilton Cycle Based on the Enlarged Rotation-Extension Technique
A Polynomial Time Approximation Algorithm for the Two-Commodity Splittable Flow Problem
A Primal-Dual Parallel Approximation Technique Applied to Weighted Set and Vertex Cover
A probabilistic analysis of a leader election algorithm