"Fully polynomial FPT algorithms for some classes of bounded clique-width ..."

David Coudert, Guillaume Ducoffe, Alexandru Popa (2018)

Details and statistics

DOI: 10.1137/1.9781611975031.176

access: open

type: Conference or Workshop Paper

metadata version: 2021-07-25

a service of  Schloss Dagstuhl - Leibniz Center for Informatics