Efficiently Finding and Counting Patterns with Distance Constraints in Sparse Graphs

Lokshtanov, D., Panolan, F. orcid.org/0000-0001-6213-8687, Saurabh, S. et al. (2 more authors) (2025) Efficiently Finding and Counting Patterns with Distance Constraints in Sparse Graphs. In: STOC '25: Proceedings of the 57th Annual ACM Symposium on Theory of Computing. The 57th ACM Symposium on Theory of Computing (STOC 2025), 23-27 Jun 2025, Prague, Czech Republic. ACM , New York, NY, United States , pp. 1965-1974. ISBN 979-8-4007-1510-5

Metadata

Item Type: Proceedings Paper
Authors/Creators:
Copyright, Publisher and Additional Information:

This is an author produced version of a proceedings paper published in STOC '25: Proceedings of the 57th Annual ACM Symposium on Theory of Computing, made available under the terms of the Creative Commons Attribution License (CC-BY), which permits unrestricted use, distribution and reproduction in any medium, provided the original work is properly cited.
Keywords: Bounded expansion graphs, Pattern finding and counting, First order model checking
Dates:
  • Accepted: 31 January 2025
  • Published (online): 15 June 2025
  • Published: 15 June 2025
Institution: The University of Leeds
Academic Units: The University of Leeds > Faculty of Engineering & Physical Sciences (Leeds) > School of Computing (Leeds)
Depositing User: Symplectic Publications
Date Deposited: 14 Apr 2025 13:04
Last Modified: 17 Jun 2025 08:53
Published Version: https://dl.acm.org/doi/10.1145/3717823.3718251
Status: Published
Publisher: ACM
Identification Number: 10.1145/3717823.3718251
Open Archives Initiative ID (OAI ID):

Export

Statistics


CORE (COnnecting REpositories)