1 problem

Matching

Polynomial-time MIS conjecture for graphs forbidding independent planar minors
Less than 1 year old
Independent-planar-minor MIS conjecture. For every planar $H$ and every $k$ , MIS is polynomial-time solvable on the class of $kH$ -free graphs.
openmaximum-independent-set parameterized-complexity planar-minors
05

Polynomial-time MIS conjecture for graphs forbidding independent planar minors