Published in: LIPIcs, Volume 63, 11th International Symposium on Parameterized and Exact Computation (IPEC 2016)
Willem J. A. Pino, Hans L. Bodlaender, and Johan M. M. van Rooij. Cut and Count and Representative Sets on Branch Decompositions. In 11th International Symposium on Parameterized and Exact Computation (IPEC 2016). Leibniz International Proceedings in Informatics (LIPIcs), Volume 63, pp. 27:1-27:12, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2017)
@InProceedings{pino_et_al:LIPIcs.IPEC.2016.27, author = {Pino, Willem J. A. and Bodlaender, Hans L. and van Rooij, Johan M. M.}, title = {{Cut and Count and Representative Sets on Branch Decompositions}}, booktitle = {11th International Symposium on Parameterized and Exact Computation (IPEC 2016)}, pages = {27:1--27:12}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-023-1}, ISSN = {1868-8969}, year = {2017}, volume = {63}, editor = {Guo, Jiong and Hermelin, Danny}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.IPEC.2016.27}, URN = {urn:nbn:de:0030-drops-69450}, doi = {10.4230/LIPIcs.IPEC.2016.27}, annote = {Keywords: Graph algorithms, Branchwidth, Treewidth, Dynamic Programming, Planar Graphs} }
Published in: Dagstuhl Seminar Proceedings, Volume 8431, Moderately Exponential Time Algorithms (2008)
Fedor V. Fomin, Kazuo Iwama, Dieter Kratsch, Petteri Kaski, Mikko Koivisto, Lukasz Kowalik, Yoshio Okamoto, Johan van Rooij, and Ryan Williams. 08431 Open Problems – Moderately Exponential Time Algorithms. In Moderately Exponential Time Algorithms. Dagstuhl Seminar Proceedings, Volume 8431, pp. 1-8, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2008)
@InProceedings{fomin_et_al:DagSemProc.08431.3, author = {Fomin, Fedor V. and Iwama, Kazuo and Kratsch, Dieter and Kaski, Petteri and Koivisto, Mikko and Kowalik, Lukasz and Okamoto, Yoshio and van Rooij, Johan and Williams, Ryan}, title = {{08431 Open Problems – Moderately Exponential Time Algorithms}}, booktitle = {Moderately Exponential Time Algorithms}, pages = {1--8}, series = {Dagstuhl Seminar Proceedings (DagSemProc)}, ISSN = {1862-4405}, year = {2008}, volume = {8431}, editor = {Fedor V. Fomin and Kazuo Iwama and Dieter Kratsch}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/DagSemProc.08431.3}, URN = {urn:nbn:de:0030-drops-17986}, doi = {10.4230/DagSemProc.08431.3}, annote = {Keywords: Algorithms, NP-hard problems, Moderately Exponential Time Algorithms} }
Published in: LIPIcs, Volume 1, 25th International Symposium on Theoretical Aspects of Computer Science (2008)
Johan M. M. van Rooij and Hans L. Bodlaender. Design by Measure and Conquer, A Faster Exact Algorithm for Dominating Set. In 25th International Symposium on Theoretical Aspects of Computer Science. Leibniz International Proceedings in Informatics (LIPIcs), Volume 1, pp. 657-668, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2008)
@InProceedings{vanrooij_et_al:LIPIcs.STACS.2008.1329, author = {van Rooij, Johan M. M. and Bodlaender, Hans L.}, title = {{Design by Measure and Conquer, A Faster Exact Algorithm for Dominating Set}}, booktitle = {25th International Symposium on Theoretical Aspects of Computer Science}, pages = {657--668}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-939897-06-4}, ISSN = {1868-8969}, year = {2008}, volume = {1}, editor = {Albers, Susanne and Weil, Pascal}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2008.1329}, URN = {urn:nbn:de:0030-drops-13297}, doi = {10.4230/LIPIcs.STACS.2008.1329}, annote = {Keywords: Exact algorithms, exponential time algorithms, branch and reduce, measure and conquer, dominating set, computer aided algorithm design} }
Feedback for Dagstuhl Publishing