On the public citation graph

A trichotomy for regular simple path queries on graphs

0 signed · 47 inferred · view as graph

Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.

Is this your work? Sign in with ORCID and put your name on the claims that are yours.
Claim with ORCID
Reference health. See whether every reference in this work resolves to a known work and none has been retracted — and get a dated CiteStamped badge you can embed.
See reference health

What this work says

Outgoing claims: the papers this work cites, builds on, or argues with.

inferredcites →https://doi.org/10.1002/net.3230140403openalex-snapshot
The even‐path problem for graphs and digraphs
inferredcites →https://doi.org/10.1006/jagm.1999.1072openalex-snapshot
A Polynomial-Time Algorithm for Finding Regular Simple Paths in Outerplanar Graphs
inferredcites →https://doi.org/10.1006/jcss.1999.1627openalex-snapshot
Regular Path Queries with Constraints
inferredcites →https://doi.org/10.1006/jctb.1995.1006openalex-snapshot
Graph Minors .XIII. The Disjoint Paths Problem
inferredcites →https://doi.org/10.1006/jctb.2000.2031openalex-snapshot
Directed Tree-Width
inferredcites →https://doi.org/10.1007/978-3-642-03793-1_2openalex-snapshot
An Automata-Theoretic Approach to Regular XPath
inferredcites →https://doi.org/10.1007/978-3-642-31235-9_12openalex-snapshot
Regular Path Queries on Large Graphs
inferredcites →https://doi.org/10.1016/0022-0000(84)90066-7openalex-snapshot
Space-bounded hierarchies and probabilistic computations
inferredcites →https://doi.org/10.1016/b978-0-444-88074-1.50010-xopenalex-snapshot
Graph Rewriting: An Algebraic and Logic Approach
inferredcites →https://doi.org/10.1016/j.comnet.2009.04.012openalex-snapshot
Complexity results on labeled shortest path problems from wireless routing metrics
inferredcites →https://doi.org/10.1016/j.jctb.2012.04.004openalex-snapshot
The dag-width of directed graphs
inferredcites →https://doi.org/10.1016/s0019-9958(65)90108-7openalex-snapshot
On finite monoids having only trivial subgroups
inferredcites →https://doi.org/10.1089/153623103322006652openalex-snapshot
Graph Data Management for Molecular Biology
inferredcites →https://doi.org/10.1093/bioinformatics/bti1105openalex-snapshot
A query language for biological networks
inferredcites →https://doi.org/10.1109/icde.2000.839439openalex-snapshot
Answering regular path queries using views
inferredcites →https://doi.org/10.1109/icde.2009.172openalex-snapshot
SoQL: A Language for Querying and Creating Data in Social Networks
inferredcites →https://doi.org/10.1109/icde.2011.5767858openalex-snapshot
Adding regular expressions to graph reachability and pattern queries
inferredcites →https://doi.org/10.1109/pgec.1963.263534openalex-snapshot
The Theory of Definite Automata
inferredcites →https://doi.org/10.1137/0217058openalex-snapshot
Nondeterministic Space is Closed under Complementation
inferredcites →https://doi.org/10.1137/s009753979122370xopenalex-snapshot
Finding Regular Simple Paths in Graph Databases
inferredcites →https://doi.org/10.1137/s0097539792224061openalex-snapshot
Finding k Disjoint Paths in a Directed Planar Graph
inferredcites →https://doi.org/10.1137/s0097539797330343openalex-snapshot
Finding an Even Simple Path in a Directed Planar Graph
inferredcites →https://doi.org/10.1137/s0097539798337716openalex-snapshot
Formal-Language-Constrained Path Problems
inferredcites →https://doi.org/10.1145/103516.103517openalex-snapshot
Modularity of cycles and paths in graphs
inferredcites →https://doi.org/10.1145/1055558.1055573openalex-snapshot
Foundations of semantic web databases
inferredcites →https://doi.org/10.1145/1807167.1807183openalex-snapshot
Computing label-constraint reachability in graph databases
inferredcites →https://doi.org/10.1145/1989284.1989307openalex-snapshot
Querying graph patterns
inferredcites →https://doi.org/10.1145/210332.210337openalex-snapshot
Color-coding
inferredcites →https://doi.org/10.1145/2187836.2187922openalex-snapshot
Counting beyond a Yottabyte, or how SPARQL 1.1 property paths will prevent adoption of the standard
inferredcites →https://doi.org/10.1145/2213556.2213573openalex-snapshot
The complexity of evaluating path expressions in SPARQL
inferredcites →https://doi.org/10.1145/2274576.2274585openalex-snapshot
Regular path queries on graphs with data
inferredcites →https://doi.org/10.1145/2494529openalex-snapshot
The complexity of regular expressions and property paths in SPARQL
inferredcites →https://doi.org/10.1145/303976.303996openalex-snapshot
Rewriting of regular expressions and regular path queries
inferredcites →https://doi.org/10.1145/38713.38749openalex-snapshot
A graphical query language supporting recursion
inferredcites →https://doi.org/10.1145/800125.804029openalex-snapshot
Word problems requiring exponential time(Preliminary Report)

What points at this work

Incoming claims: where this work appears in other papers’ reference lists and arguments.

inferred← citeshttps://doi.org/10.1007/978-3-030-95481-9_1openalex-snapshot
Foundations of Graph Path Query Languages
inferred← citeshttps://doi.org/10.1145/3448016.3457561openalex-snapshot
PG-Keys: Keys for Property Graphs
inferred← citeshttps://doi.org/10.1145/3517804.3524149openalex-snapshot
The Complexity of Regular Trail and Simple Path Queries on Undirected Graphs
inferred← citeshttps://doi.org/10.1145/3584372.3588662openalex-snapshot
GPC: A Pattern Calculus for Property Graphs
inferred← citeshttps://doi.org/10.1145/3584372.3588664openalex-snapshot
Conjunctive Regular Path Queries under Injective Semantics
inferred← citeshttps://doi.org/10.1145/3722234.3725822openalex-snapshot
Querying Graph Data: Where We Are and Where To Go
inferred← citeshttps://doi.org/10.1145/3725242openalex-snapshot
Output-Sensitive Evaluation of Regular Path Queries
inferred← citeshttps://doi.org/10.1145/3788852.3805597openalex-snapshot
Enumeration Theory through the Lens of Database Challenges
inferred← citeshttps://doi.org/10.24963/kr.2023/18openalex-snapshot
Run-Based Semantics for RPQs
inferred← citeshttps://doi.org/10.4230/lipics.icdt.2018.19openalex-snapshot
Enumeration Problems for Regular Path Queries
inferred← citeshttps://doi.org/10.46298/lmcs-19(4:15)2023openalex-snapshot
Fine-Grained Complexity of Regular Path Queries
inferred← citeshttps://doi.org/10.46298/lmcs-19(4:20)2023openalex-snapshot
A Trichotomy for Regular Trail Queries
Editorial review for independent work. ICSAC — the Institute for Complexity Science and Advanced Computing — runs a structured editorial panel for researchers publishing outside journals, and publishes on CiteStamp rails. Submission is free and goes through ORCID: icsacinstitute.org/submit.