1: A Fast General Methodology for Information-Theoretically Optimal Encodings of Graphs
2: On-Line Difference Maximization
3: Optimal Constructions of Hybrid Algorithms
4: Tree Contractions and Evolutionary Trees
5: Cavity Matchings, Label Compressions, and Unrooted Evolutionary Trees
6: Total Protection of Analytic Invariant Information in Cross Tabulated Tables
7: Linear-Time Succinct Encodings of Planar Graphs via Canonical Orderings
8: Data Security Equals Graph Connectivity