Published in: LIPIcs, Volume 272, 48th International Symposium on Mathematical Foundations of Computer Science (MFCS 2023)
Vera Chekan and Stefan Kratsch. Tight Algorithmic Applications of Clique-Width Generalizations. In 48th International Symposium on Mathematical Foundations of Computer Science (MFCS 2023). Leibniz International Proceedings in Informatics (LIPIcs), Volume 272, pp. 35:1-35:15, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2023)
@InProceedings{chekan_et_al:LIPIcs.MFCS.2023.35, author = {Chekan, Vera and Kratsch, Stefan}, title = {{Tight Algorithmic Applications of Clique-Width Generalizations}}, booktitle = {48th International Symposium on Mathematical Foundations of Computer Science (MFCS 2023)}, pages = {35:1--35:15}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-292-1}, ISSN = {1868-8969}, year = {2023}, volume = {272}, editor = {Leroux, J\'{e}r\^{o}me and Lombardy, Sylvain and Peleg, David}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.MFCS.2023.35}, URN = {urn:nbn:de:0030-drops-185699}, doi = {10.4230/LIPIcs.MFCS.2023.35}, annote = {Keywords: Parameterized complexity, connectivity problems, clique-width} }
Published in: LIPIcs, Volume 168, 47th International Colloquium on Automata, Languages, and Programming (ICALP 2020)
Martin Fürer, Carlos Hoppen, and Vilmar Trevisan. Efficient Diagonalization of Symmetric Matrices Associated with Graphs of Small Treewidth. In 47th International Colloquium on Automata, Languages, and Programming (ICALP 2020). Leibniz International Proceedings in Informatics (LIPIcs), Volume 168, pp. 52:1-52:18, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2020)
@InProceedings{furer_et_al:LIPIcs.ICALP.2020.52, author = {F\"{u}rer, Martin and Hoppen, Carlos and Trevisan, Vilmar}, title = {{Efficient Diagonalization of Symmetric Matrices Associated with Graphs of Small Treewidth}}, booktitle = {47th International Colloquium on Automata, Languages, and Programming (ICALP 2020)}, pages = {52:1--52:18}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-138-2}, ISSN = {1868-8969}, year = {2020}, volume = {168}, editor = {Czumaj, Artur and Dawar, Anuj and Merelli, Emanuela}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2020.52}, URN = {urn:nbn:de:0030-drops-124590}, doi = {10.4230/LIPIcs.ICALP.2020.52}, annote = {Keywords: Treewidth, Diagonalization, Eigenvalues} }
Published in: LIPIcs, Volume 67, 8th Innovations in Theoretical Computer Science Conference (ITCS 2017)
Martin Fürer. Multi-Clique-Width. In 8th Innovations in Theoretical Computer Science Conference (ITCS 2017). Leibniz International Proceedings in Informatics (LIPIcs), Volume 67, pp. 14:1-14:13, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2017)
@InProceedings{furer:LIPIcs.ITCS.2017.14, author = {F\"{u}rer, Martin}, title = {{Multi-Clique-Width}}, booktitle = {8th Innovations in Theoretical Computer Science Conference (ITCS 2017)}, pages = {14:1--14:13}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-029-3}, ISSN = {1868-8969}, year = {2017}, volume = {67}, editor = {Papadimitriou, Christos H.}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ITCS.2017.14}, URN = {urn:nbn:de:0030-drops-81775}, doi = {10.4230/LIPIcs.ITCS.2017.14}, annote = {Keywords: clique-width, parameterized complexity, tree-width, independent set polynomial, graph coloring} }
Feedback for Dagstuhl Publishing