pdf-format: |
|
@InProceedings{vanderzanden:LIPIcs:2015:5590, author = {Tom C. van der Zanden}, title = {{Parameterized Complexity of Graph Constraint Logic}}, booktitle = {10th International Symposium on Parameterized and Exact Computation (IPEC 2015)}, pages = {282--293}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-939897-92-7}, ISSN = {1868-8969}, year = {2015}, volume = {43}, editor = {Thore Husfeldt and Iyad Kanj}, publisher = {Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik}, address = {Dagstuhl, Germany}, URL = {http://drops.dagstuhl.de/opus/volltexte/2015/5590}, URN = {urn:nbn:de:0030-drops-55906}, doi = {10.4230/LIPIcs.IPEC.2015.282}, annote = {Keywords: Nondeterministic Constraint Logic, Reconfiguration Problems, Parameterized Complexity, Treewidth, Bandwidth} }
Keywords: | Nondeterministic Constraint Logic, Reconfiguration Problems, Parameterized Complexity, Treewidth, Bandwidth | |
Seminar: | 10th International Symposium on Parameterized and Exact Computation (IPEC 2015) | |
Issue date: | 2015 | |
Date of publication: | 19.11.2015 |