@article{10.1145/3801891,
  title = "Acyclic Conjunctive Regular Path Queries are no Harder than Corresponding Conjunctive Queries",
  author = "Abo Khamis and Mahmoud and Hurjui, Alexandru-Mihai and Kara, Ahmet and Olteanu, Dan and Suciu, Dan",
  year = "2026",
  address = "New York, NY, USA",
  journal = "Proc. ACM Manag. Data",
  keywords = "graph databases, conjunctive regular path queries, output-sensitive algorithms, product graph",
  month = "may",
  number = "2",
  publisher = "Association for Computing Machinery",
  url = "https://doi.org/10.1145/3801891",
  volume = "4",
  doi = "10.1145/3801891",
}