activity
20142025
most citedOn the Simplex method for 0/1 polytopes

1 citations · 2 across the 7 of their papers we have counts for

collaborators
Showing 2014 · cs.DMShow all

1 paper · 2 filters

cs.DM2014

Homothetic Polygons and Beyond: Intersection Graphs, Recognition, and Maximum Clique

Valentin E. Brimkov, Konstanty Junosza-Szaniawski, Sean Kafer +5

We study the {\sc Clique} problem in classes of intersection graphs of convex sets in the plane. The problem is known to be NP-complete in convex-set intersection graphs and straig…