On Intersection Graphs of Convex Polygons. - Valentin E. Brimkov; Sean Kafer; Matthew Szczepankiewicz; Joshua Terhaar (IWCIA, 2014)

Homothetic Polygons and Beyond: Intersection Graphs, Recognition, and Maximum Clique. - Valentin E. Brimkov; Konstanty Junosza-Szaniawski; Sean Kafer; Jan Kratochvíl; Martin Pergel; Pawel Rzazewski; Matthew Szczepankiewicz; Joshua Terhaar (CoRR, 2014)

Homothetic polygons and beyond: Maximal cliques in intersection graphs. - Valentin E. Brimkov; Konstanty Junosza-Szaniawski; Sean Kafer; Jan Kratochvíl; Martin Pergel; Pawel Rzazewski; Matthew Szczepankiewicz; Joshua Terhaar (Discret. Appl. Math., 2018)

On the Circuit Diameter of Some Combinatorial Polytopes. - Sean Kafer; Kanstantsin Pashkovich; Laura Sanità (SIAM J. Discret. Math., 2019)

Pivot Rules for Circuit-Augmentation Algorithms in Linear Optimization. - Jesús A. De Loera; Sean Kafer; Laura Sanità (SIAM J. Optim., 2022)

On the hardness of short and sign-compatible circuit walks. - Steffen Borgwardt; Weston Grewe; Sean Kafer; Jon Lee 001; Laura Sanità (Discret. Appl. Math., 2025)

On the Simplex Method for 0/1-Polytopes. - Alexander E. Black; Jesús A. De Loera; Sean Kafer; Laura Sanità (Math. Oper. Res., 2025)