1. Total matchings and total coverings of graphs;Alavi;J. Graph Theory,1977
2. Extended formulations for matroid polytopes through randomized protocols;Aprile;Oper. Res. Lett.,2022
3. Extended formulations from communication protocols in output-efficient time;Aprile;Math. Program.,2020
4. Extension complexity of stable set polytopes of bipartite graphs;Aprile;Lect. Notes Comput. Sci.,2017
5. Smaller extended formulations for spanning tree polytopes in minor-closed classes and beyond;Aprile;Electron. J. Comb.,2021