Sean Kafer

According to our database, Sean Kafer authored at least 8 papers between 2014 and 2026.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2026

Beyond Smoothed Analysis: Analyzing the Simplex Method By-the-Book.

Eleon Bach, Alexander E. Black, Sophie Huiberts, Sean Kafer

Proceedings of the 58th Annual ACM Symposium on Theory of Computing, 2026

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

On the hardness of short and sign-compatible circuit walks.

Steffen Borgwardt, Weston Grewe, Sean Kafer, Jon Lee, Laura Sanità

Discret. Appl. Math., 2025

2022

Pivot Rules for Circuit-Augmentation Algorithms in Linear Optimization.

Jesús A. De Loera, Sean Kafer, Laura Sanità

SIAM J. Optim., September, 2022

2019

On the Circuit Diameter of Some Combinatorial Polytopes.

Sean Kafer, Kanstantsin Pashkovich, Laura Sanità

SIAM J. Discret. Math., 2019

2018

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

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

On Intersection Graphs of Convex Polygons.

Valentin E. Brimkov, Sean Kafer, Matthew Szczepankiewicz, Joshua Terhaar

Proceedings of the Combinatorial Image Analysis - 16th International Workshop, 2014