1. C. Banderier, H. Hwang, V. Ravelomanana, V. Zacharovas, Average case analysis of NP-complete problems: Maximum independent set and exhaustive search algorithms, in: International Meeting on Probabilistic, Combinatorial, and Asymptotic Methods in the Analysis of Algorithms, AofA09, 2009.
2. Analysis of an exhaustive search algorithm in random graphs and the nclogn-asymptotics;Banderier;SIAM J. Discrete Math.,2014
3. Progress in computational mixed integer programming - A look back from the other side of the tipping point;Bixby;Ann. Oper. Res.,2007
4. Random Graphs;Bollobás,1985
5. On the integrality gap of binary integer programs with Gaussian data;Borst;Math. Program.,2023