CMSO-Transducing Tree-Like Graph Decompositions

Campbell, R., Guillon, B., Kante, M.M. et al. (2 more authors) (2025) CMSO-Transducing Tree-Like Graph Decompositions. In: Beyersdorff, O., Pilipczuk, M., Pimentel, E. and Kim Thắng, N., (eds.) 42nd International Symposium on Theoretical Aspects of Computer Science (STACS 2025). 42nd International Symposium on Theoretical Aspects of Computer Science (STACS 2025), 04-07 Mar 2025, Jena, Germany. Leibniz International Proceedings in Informatics (LIPIcs), 327. Schloss Dagstuhl – Leibniz-Zentrum für Informatik. Article no: 22, 22:1-22:18. ISBN: 978-3-95977-365-2. ISSN: 1868-8969.

Abstract

Metadata

Item Type: Proceedings Paper
Authors/Creators:
Editors:
  • Beyersdorff, O.
  • Pilipczuk, M.
  • Pimentel, E.
  • Kim Thắng, N.
Copyright, Publisher and Additional Information:

© Rutger Campbell, Bruno Guillon, Mamadou Moustapha Kanté, Eun Jung Kim, and Noleen Köhler; licensed under Creative Commons License CC-BY 4.0.
Keywords: MSO-transduction; MSO-definability; graph decomposisions
Dates:
  • Published: 24 February 2025
Institution: The University of Leeds
Academic Units: The University of Leeds > Faculty of Engineering & Physical Sciences (Leeds) > School of Computing (Leeds)
Date Deposited: 20 Jan 2026 16:59
Last Modified: 20 Jan 2026 16:59
Status: Published
Publisher: Schloss Dagstuhl – Leibniz-Zentrum für Informatik
Series Name: Leibniz International Proceedings in Informatics (LIPIcs)
Identification Number: 10.4230/LIPIcs.STACS.2025.22
Related URLs:
Open Archives Initiative ID (OAI ID):

Export

Statistics

View Altmetric information about this item.


CORE (COnnecting REpositories)