"Efficiently Finding and Counting Patterns with Distance Constraints in ..."

Daniel Lokshtanov et al. (2025)

> Home

Details and statistics

DOI: 10.1145/3717823.3718251

access: closed

type: Conference or Workshop Paper

metadata version: 2025-07-06

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - conf/stoc/LokshtanovP00Z25
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/stoc/LokshtanovP00Z25
Daniel Lokshtanov, Fahad Panolan, Saket Saurabh, Jie Xue, Meirav Zehavi:
Efficiently Finding and Counting Patterns with Distance Constraints in Sparse Graphs. STOC 2025: 1965-1974

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.