Published in: LIPIcs, Volume 285, 18th International Symposium on Parameterized and Exact Computation (IPEC 2023)
Hisao Tamaki. A Contraction-Recursive Algorithm for Treewidth. In 18th International Symposium on Parameterized and Exact Computation (IPEC 2023). Leibniz International Proceedings in Informatics (LIPIcs), Volume 285, pp. 34:1-34:15, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2023)
@InProceedings{tamaki:LIPIcs.IPEC.2023.34, author = {Tamaki, Hisao}, title = {{A Contraction-Recursive Algorithm for Treewidth}}, booktitle = {18th International Symposium on Parameterized and Exact Computation (IPEC 2023)}, pages = {34:1--34:15}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-305-8}, ISSN = {1868-8969}, year = {2023}, volume = {285}, editor = {Misra, Neeldhara and Wahlstr\"{o}m, Magnus}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.IPEC.2023.34}, URN = {urn:nbn:de:0030-drops-194536}, doi = {10.4230/LIPIcs.IPEC.2023.34}, annote = {Keywords: graph algorithm, treewidth, exact computation, BT dynamic programming, contraction, certifying algorithms} }
Published in: LIPIcs, Volume 233, 20th International Symposium on Experimental Algorithms (SEA 2022)
Hisao Tamaki. Heuristic Computation of Exact Treewidth. In 20th International Symposium on Experimental Algorithms (SEA 2022). Leibniz International Proceedings in Informatics (LIPIcs), Volume 233, pp. 17:1-17:16, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2022)
@InProceedings{tamaki:LIPIcs.SEA.2022.17, author = {Tamaki, Hisao}, title = {{Heuristic Computation of Exact Treewidth}}, booktitle = {20th International Symposium on Experimental Algorithms (SEA 2022)}, pages = {17:1--17:16}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-251-8}, ISSN = {1868-8969}, year = {2022}, volume = {233}, editor = {Schulz, Christian and U\c{c}ar, Bora}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SEA.2022.17}, URN = {urn:nbn:de:0030-drops-165512}, doi = {10.4230/LIPIcs.SEA.2022.17}, annote = {Keywords: graph algorithm, treewidth, heuristics, BT dynamic programming, contraction, obstruction, minimal forbidden minor, certifying algorithms} }
Published in: LIPIcs, Volume 89, 12th International Symposium on Parameterized and Exact Computation (IPEC 2017)
Yasuaki Kobayashi, Hiromu Ohtsuka, and Hisao Tamaki. An Improved Fixed-Parameter Algorithm for One-Page Crossing Minimization. In 12th International Symposium on Parameterized and Exact Computation (IPEC 2017). Leibniz International Proceedings in Informatics (LIPIcs), Volume 89, pp. 25:1-25:12, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2018)
@InProceedings{kobayashi_et_al:LIPIcs.IPEC.2017.25, author = {Kobayashi, Yasuaki and Ohtsuka, Hiromu and Tamaki, Hisao}, title = {{An Improved Fixed-Parameter Algorithm for One-Page Crossing Minimization}}, booktitle = {12th International Symposium on Parameterized and Exact Computation (IPEC 2017)}, pages = {25:1--25:12}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-051-4}, ISSN = {1868-8969}, year = {2018}, volume = {89}, editor = {Lokshtanov, Daniel and Nishimura, Naomi}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.IPEC.2017.25}, URN = {urn:nbn:de:0030-drops-85661}, doi = {10.4230/LIPIcs.IPEC.2017.25}, annote = {Keywords: Book Embedding, Fixed-Parameter Tractability, Graph Drawing, Treewidth} }
Published in: LIPIcs, Volume 87, 25th Annual European Symposium on Algorithms (ESA 2017)
Hisao Tamaki. Positive-Instance Driven Dynamic Programming for Treewidth. In 25th Annual European Symposium on Algorithms (ESA 2017). Leibniz International Proceedings in Informatics (LIPIcs), Volume 87, pp. 68:1-68:13, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2017)
@InProceedings{tamaki:LIPIcs.ESA.2017.68, author = {Tamaki, Hisao}, title = {{Positive-Instance Driven Dynamic Programming for Treewidth}}, booktitle = {25th Annual European Symposium on Algorithms (ESA 2017)}, pages = {68:1--68:13}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-049-1}, ISSN = {1868-8969}, year = {2017}, volume = {87}, editor = {Pruhs, Kirk and Sohler, Christian}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ESA.2017.68}, URN = {urn:nbn:de:0030-drops-78804}, doi = {10.4230/LIPIcs.ESA.2017.68}, annote = {Keywords: treewidth, dynamic programming, minimal separators, potential maximal cliques, positive instances} }
Published in: LIPIcs, Volume 63, 11th International Symposium on Parameterized and Exact Computation (IPEC 2016)
Yasuaki Kobayashi and Hisao Tamaki. Treedepth Parameterized by Vertex Cover Number. In 11th International Symposium on Parameterized and Exact Computation (IPEC 2016). Leibniz International Proceedings in Informatics (LIPIcs), Volume 63, pp. 18:1-18:11, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2017)
@InProceedings{kobayashi_et_al:LIPIcs.IPEC.2016.18, author = {Kobayashi, Yasuaki and Tamaki, Hisao}, title = {{Treedepth Parameterized by Vertex Cover Number}}, booktitle = {11th International Symposium on Parameterized and Exact Computation (IPEC 2016)}, pages = {18:1--18:11}, 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.dagstuhl.de/entities/document/10.4230/LIPIcs.IPEC.2016.18}, URN = {urn:nbn:de:0030-drops-69438}, doi = {10.4230/LIPIcs.IPEC.2016.18}, annote = {Keywords: Fixed-parameter algorithm, Polynomial kernelization, Structural parameterization, Treedepth, Vertex cover} }
Feedback for Dagstuhl Publishing