13 citations · 24 across the 6 of their papers we have counts for
1 paper · 2 filters
Martin Pergel
We show NP-completeness for the recognition problem of 2-line-bend graphs.