Fixed-Parameter Linear-Time Algorithms for NP-hard Graph and Hypergraph Problems Arising in Industrial Applications › Research Explorer

Novosibirsk State University's Research Portal

Fixed-Parameter Linear-Time Algorithms for NP-hard Graph and Hypergraph Problems Arising in Industrial Applications

Research output: Book/Report › Book › Research › peer-review

DOI

https://doi.org/10.14279/depositonce-4131
Final published version

René van Bevern

Original language	English
Publisher	Universitätsverlag der TU Berlin
Number of pages	229
ISBN (Electronic)	978-3-7983-2706-1
ISBN (Print)	978-3-7983-2705-4
DOIs	https://doi.org/10.14279/depositonce-4131
Publication status	Published - 2014
Externally published	Yes

Publication series

Name	Foundations of Computing
Publisher	Universitätsverlag der TU Berlin
Volume	1
ISSN (Print)	2199-5249
ISSN (Electronic)	2199-5257

OECD FOS+WOS

1.02 COMPUTER AND INFORMATION SCIENCES

ID: 22342672