"Exploring Subexponential Parameterized Complexity of Completion Problems."

Pål Grønås Drange et al. (2014)

Details and statistics

DOI: 10.4230/LIPICS.STACS.2014.288

access: open

type: Conference or Workshop Paper

metadata version: 2019-10-19

a service of  Schloss Dagstuhl - Leibniz Center for Informatics