13 citations · 36 across the 28 of their papers we have counts for
1 paper · 2 filters
Minghui Jiang
Butman, Hermelin, Lewenstein, and Rawitz proved that Clique in t-interval graphs is NP-hard for t >= 3. We strengthen this result to show that Clique in 3-track interval graphs is…