activity
20052023
most citedAn explicit formula for the number of tunnels in digital objects

19 citations · 20 across the 5 of their papers we have counts for

collaborators
Showing 2014Show all

1 paper · 1 filter

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…