1: A near-optimal fully dynamic distributed algorithm for maintaining sparse spanners
2: Why Linear Programming cannot solve large instances of NP-complete problems in polynomial time
3: Algorithmic Aspects of a General Modular Decomposition Theory
4: Faster Streaming algorithms for graph spanners