19 citations · 31 across the 7 of their papers we have counts for
1 paper · 1 filter
Marek Cygan, Lukasz Kowalik, Marcin Pilipczuk +1
We study optimization problems that are neither approximable in polynomial time (at least with a constant factor) nor fixed parameter tractable, under widely believed complexity as…