15 citations · 20 across the 6 of their papers we have counts for
1 paper · 1 filter
Juho Lauri, Christodoulos Mitillos
We strengthen a result by Laskar and Lyle (Discrete Appl. Math. (2009), 330-338) by proving that it is NP-complete to decide whether a bipartite planar graph can be partitioned int…