13 citations · 24 across the 6 of their papers we have counts for
1 paper · 1 filter
Irina Mustaţă, Martin Pergel
It has been known since 1991 that the problem of recognizing grid intersection graphs is NP-complete. Here we use a modified argument of the above result to show that even if we re…