Published in: LIPIcs, Volume 326, 33rd EACSL Annual Conference on Computer Science Logic (CSL 2025)
Moritz Lichter, Simon Raßmann, and Pascal Schweitzer. Computational Complexity of the Weisfeiler-Leman Dimension. In 33rd EACSL Annual Conference on Computer Science Logic (CSL 2025). Leibniz International Proceedings in Informatics (LIPIcs), Volume 326, pp. 13:1-13:22, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2025)
@InProceedings{lichter_et_al:LIPIcs.CSL.2025.13, author = {Lichter, Moritz and Ra{\ss}mann, Simon and Schweitzer, Pascal}, title = {{Computational Complexity of the Weisfeiler-Leman Dimension}}, booktitle = {33rd EACSL Annual Conference on Computer Science Logic (CSL 2025)}, pages = {13:1--13:22}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-362-1}, ISSN = {1868-8969}, year = {2025}, volume = {326}, editor = {Endrullis, J\"{o}rg and Schmitz, Sylvain}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CSL.2025.13}, URN = {urn:nbn:de:0030-drops-227707}, doi = {10.4230/LIPIcs.CSL.2025.13}, annote = {Keywords: Weisfeiler-Leman algorithm, dimension, complexity, coherent configurations} }
Published in: LIPIcs, Volume 326, 33rd EACSL Annual Conference on Computer Science Logic (CSL 2025)
Simon Raßmann, Georg Schindling, and Pascal Schweitzer. Finite Variable Counting Logics with Restricted Requantification. In 33rd EACSL Annual Conference on Computer Science Logic (CSL 2025). Leibniz International Proceedings in Informatics (LIPIcs), Volume 326, pp. 14:1-14:23, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2025)
@InProceedings{ramann_et_al:LIPIcs.CSL.2025.14, author = {Ra{\ss}mann, Simon and Schindling, Georg and Schweitzer, Pascal}, title = {{Finite Variable Counting Logics with Restricted Requantification}}, booktitle = {33rd EACSL Annual Conference on Computer Science Logic (CSL 2025)}, pages = {14:1--14:23}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-362-1}, ISSN = {1868-8969}, year = {2025}, volume = {326}, editor = {Endrullis, J\"{o}rg and Schmitz, Sylvain}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CSL.2025.14}, URN = {urn:nbn:de:0030-drops-227716}, doi = {10.4230/LIPIcs.CSL.2025.14}, annote = {Keywords: Requantification, Finite variable counting logics, Weisfeiler-Leman algorithm} }
Published in: LIPIcs, Volume 285, 18th International Symposium on Parameterized and Exact Computation (IPEC 2023)
Irene Heinrich and Simon Raßmann. Twin-Width of Graphs with Tree-Structured Decompositions. In 18th International Symposium on Parameterized and Exact Computation (IPEC 2023). Leibniz International Proceedings in Informatics (LIPIcs), Volume 285, pp. 25:1-25:17, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2023)
@InProceedings{heinrich_et_al:LIPIcs.IPEC.2023.25, author = {Heinrich, Irene and Ra{\ss}mann, Simon}, title = {{Twin-Width of Graphs with Tree-Structured Decompositions}}, booktitle = {18th International Symposium on Parameterized and Exact Computation (IPEC 2023)}, pages = {25:1--25:17}, 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.25}, URN = {urn:nbn:de:0030-drops-194449}, doi = {10.4230/LIPIcs.IPEC.2023.25}, annote = {Keywords: twin-width, quasi-4 connected components, strong tree-width} }
Feedback for Dagstuhl Publishing