37 citations · 80 across the 29 of their papers we have counts for
Showing 2013Show all
2 papers · 1 filter
cs.CC2013★ 1 cited
Parameterized Enumeration with Ordering
Nadia Creignou, Raïda Ktari, Arne Meier +3
The classes Delay-FPT and Total-FPT recently have been introduced into parameterized complexity in order to capture the notion of efficiently solvable parameterized enumeration pro…
cs.CC2013★ 1 cited
Paradigms for Parameterized Enumeration
Nadia Creignou, Arne Meier, Julian-Steffen Müller +2
The aim of the paper is to examine the computational complexity and algorithmics of enumeration, the task to output all solutions of a given problem, from the point of view of para…