Conference paperA universally fastest algorithm for Max 2-Sat, Max 2-CSP, and everything in betweenSerge Gaspers, Gregory B. SorkinSODA 2009
PaperExact expectations and distributions for the random assignment problemSven Erick Alm, Gregory B. SorkinCombinatorics Probability and Computing
PaperA tight bound on the collection of edges in MSTs of induced subgraphsGregory B. Sorkin, Angelika Steger, et al.Journal of Combinatorial Theory. Series B
PaperThe interlace polynomial of a graphRichard Arratia, Béla Bollobás, et al.Journal of Combinatorial Theory. Series B
