activity
20202026
most citedSemantic Tree-Width and Path-Width of Conjunctive Regular Path Queries

2 citations · 3 across the 7 of their papers we have counts for

collaborators
Showing 2025Show all

2 papers · 1 filter

cs.LO2025

Homomorphism Problems in Graph Databases and Automatic Structures

Rémi Morvan

This thesis investigates the central role of homomorphism problems (structure-preserving maps) in two complementary domains: database querying over finite, graph-shaped data, and c…

cs.DB2025★ 1 cited

Minimizing Conjunctive Regular Path Queries

Diego Figueira, Rémi Morvan, Miguel Romero

We study the minimization problem for Conjunctive Regular Path Queries (CRPQs) and unions of CRPQs (UCRPQs). This is the problem of checking, given a query and a number , whethe…