21 search results - page 5 / 5 » Circle graphs and monadic second-order logic |
171
click to vote
FOCS
2009
IEEE
16 years 20 days ago
2009
IEEE
Polynomial time preprocessing to reduce instance size is one of the most commonly deployed heuristics to tackle computationally hard problems. In a parameterized problem, every in...