On the public citation graph

When is the evaluation of conjunctive queries tractable?

https://doi.org/10.1145/380752.380867
0 signed · 164 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.1006/jcss.1999.1626openalex-snapshot
On the Complexity of Database Queries
inferredcites →https://doi.org/10.1007/3-540-44503-x_2openalex-snapshot
Query Evaluation via Tree-Decompositions
inferredcites →https://doi.org/10.1007/978-1-4684-2001-2_9openalex-snapshot
Reducibility among Combinatorial Problems
inferredcites →https://doi.org/10.1016/0095-8956(86)90030-4openalex-snapshot
Graph minors. V. Excluding a planar graph
inferredcites →https://doi.org/10.1016/0166-3615(86)90012-6openalex-snapshot
11th International conference on very large databases
inferredcites →https://doi.org/10.1016/0304-3975(94)00097-3openalex-snapshot
Fixed-parameter tractability and completeness II: On completeness for W[1]
inferredcites →https://doi.org/10.1016/s0304-3975(99)00220-0openalex-snapshot
Conjunctive query containment revisited
inferredcites →https://doi.org/10.1016/s1571-0661(04)00301-9openalex-snapshot
Parameterized Complexity
inferredcites →https://doi.org/10.1108/ir.1999.04926fae.001openalex-snapshot
Lecture Notes in Computer Science 1205
inferredcites →https://doi.org/10.1109/sfcs.1995.492479openalex-snapshot
Perspectives on database theory
inferredcites →https://doi.org/10.1109/sfcs.1998.743521openalex-snapshot
The complexity of acyclic conjunctive queries
inferredcites →https://doi.org/10.1145/263661.263664openalex-snapshot
On the complexity of database queries (extended abstract)
inferredcites →https://doi.org/10.1145/275487.275511openalex-snapshot
Conjunctive-query containment and constraint satisfaction
inferredcites →https://doi.org/10.1145/303976.303979openalex-snapshot
Hypertree decompositions and tractable queries
inferredcites →https://doi.org/10.1145/800070.802186openalex-snapshot
The complexity of relational query languages (Extended Abstract)
inferredcites →https://doi.org/10.1145/800105.803397openalex-snapshot
Optimal implementation of conjunctive queries in relational data bases

What points at this work

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

inferred← citeshttps://doi.org/10.2139/ssrn.4640092openalex-extracted
On the Complexity of Winner Determination and Strategic Control in Conditional Approval Voting
inferred← citeshttps://doi.org/10.1007/11523468_4openalex-snapshot
Logics for Unranked Trees: An Overview
inferred← citeshttps://doi.org/10.1007/3-540-36494-3_34openalex-snapshot
Solving Order Constraints in Logarithmic Space
inferred← citeshttps://doi.org/10.1007/3-540-44683-4_5openalex-snapshot
Hypertree Decompositions: A Survey
inferred← citeshttps://doi.org/10.1007/3-540-44693-1_2openalex-snapshot
Generalized Model-Checking Problems for First-Order Logic
inferred← citeshttps://doi.org/10.1007/3-540-45841-7_29openalex-snapshot
Describing Parameterized Complexity Classes
inferred← citeshttps://doi.org/10.1007/3-540-45841-7_51openalex-snapshot
A Parametric Analysis of the State Explosion Problem in Model Checking
inferred← citeshttps://doi.org/10.1007/3-540-48224-5_58openalex-snapshot
Hypergraphs in Model Checking: Acyclicity and Hypertree-Width versus Clique-Width
inferred← citeshttps://doi.org/10.1007/3-540-68804-8_6openalex-snapshot
A Logical Approach to Constraint Satisfaction
inferred← citeshttps://doi.org/10.1007/978-3-030-39951-1_10openalex-snapshot
Parameterised Complexity of Model Checking and Satisfiability in Propositional Dependence Logic
inferred← citeshttps://doi.org/10.1007/978-3-030-85315-0_3openalex-snapshot
Some Aspects of the Database Resilience
inferred← citeshttps://doi.org/10.1007/978-3-030-95481-9_1openalex-snapshot
Foundations of Graph Path Query Languages
inferred← citeshttps://doi.org/10.1007/978-3-319-27889-6_20openalex-snapshot
Complete Problems
inferred← citeshttps://doi.org/10.1007/978-3-319-68705-6_14openalex-snapshot
The Hardness of Embedding Grids and Walls
inferred← citeshttps://doi.org/10.1007/978-3-540-74915-8_18openalex-snapshot
On Acyclic Conjunctive Queries and Constant Delay Enumeration
inferred← citeshttps://doi.org/10.1007/978-3-540-79723-4_5openalex-snapshot
Fixed Structure Complexity
inferred← citeshttps://doi.org/10.1007/978-3-540-92800-3_6openalex-snapshot
A Logical Approach to Constraint Satisfaction
inferred← citeshttps://doi.org/10.1007/978-3-540-92800-3_7openalex-snapshot
Uniform Constraint Satisfaction Problems and Database Theory
inferred← citeshttps://doi.org/10.1007/978-3-642-15396-9_21openalex-snapshot
Structural Tractability of Enumerating CSP Solutions
inferred← citeshttps://doi.org/10.1007/978-3-642-39212-2_14openalex-snapshot
Block-Sorted Quantified Conjunctive Queries
inferred← citeshttps://doi.org/10.1007/978-3-642-39784-4_5openalex-snapshot
Ontology-Based Data Access with Databases: A Short Course
inferred← citeshttps://doi.org/10.1007/978-3-662-07003-1_6openalex-snapshot
Complexity of First-Order Logic
inferred← citeshttps://doi.org/10.1007/978-3-662-44522-8_16openalex-snapshot
Bounded Variable Logic, Parameterized Logarithmic Space, and Savitch’s Theorem
inferred← citeshttps://doi.org/10.1007/s00224-009-9248-9openalex-snapshot
Tractable Structures for Constraint Satisfaction with Truth Tables
inferred← citeshttps://doi.org/10.1007/s00224-014-9543-yopenalex-snapshot
Structural Tractability of Counting of Solutions to Conjunctive Queries
inferred← citeshttps://doi.org/10.1007/s00224-018-9893-yopenalex-snapshot
Counting Edge-injective Homomorphisms and Matchings on Restricted Graph Classes
inferred← citeshttps://doi.org/10.1007/s00224-020-10002-zopenalex-snapshot
Characterizing Tractability of Simple Well-Designed Pattern Trees with Projection
inferred← citeshttps://doi.org/10.1007/s00224-022-10098-5openalex-snapshot
The Complexity of Grid Coloring
inferred← citeshttps://doi.org/10.1007/s00453-022-00932-0openalex-snapshot
Finding Optimal Triangulations Parameterized by Edge Clique Cover
inferred← citeshttps://doi.org/10.1007/s00778-025-00916-wopenalex-snapshot
Threshold queries in theory and in the wild
inferred← citeshttps://doi.org/10.1007/s10472-021-09730-wopenalex-snapshot
Parameterised complexity of model checking and satisfiability in propositional dependence logic
inferred← citeshttps://doi.org/10.1007/s10601-012-9129-8openalex-snapshot
Structural tractability of enumerating CSP solutions
inferred← citeshttps://doi.org/10.1016/j.artint.2014.04.004openalex-snapshot
The price of query rewriting in ontology-based data access
inferred← citeshttps://doi.org/10.1016/j.dam.2015.06.019openalex-snapshot
The challenges of unbounded treewidth in parameterised subgraph counting problems
inferred← citeshttps://doi.org/10.1016/j.ic.2006.09.005openalex-snapshot
Towards a dichotomy theorem for the counting constraint satisfaction problem
inferred← citeshttps://doi.org/10.1016/j.ipl.2011.12.002openalex-snapshot
Computing hypergraph width measures exactly
inferred← citeshttps://doi.org/10.1016/j.jcss.2005.11.003openalex-snapshot
A parametric analysis of the state-explosion problem in model checking
inferred← citeshttps://doi.org/10.1016/j.jcss.2006.10.010openalex-snapshot
Weighted hypertree decompositions and optimal query plans
inferred← citeshttps://doi.org/10.1016/j.jcss.2010.04.009openalex-snapshot
Foundations of Semantic Web databases
inferred← citeshttps://doi.org/10.1016/j.jcss.2013.01.012openalex-snapshot
Tractable counting of the answers to conjunctive queries
inferred← citeshttps://doi.org/10.1016/j.jcss.2013.08.001openalex-snapshot
The complexity of weighted counting for acyclic conjunctive queries
inferred← citeshttps://doi.org/10.1016/j.tcs.2004.08.008openalex-snapshot
The complexity of counting homomorphisms seen from the other side
inferred← citeshttps://doi.org/10.1016/j.tcs.2025.115396openalex-snapshot
On the complexity of winner determination and strategic control in conditional approval voting
inferred← citeshttps://doi.org/10.1016/s0022-0000(03)00030-8openalex-snapshot
Robbers, marshals, and guards: game theoretic and logical characterizations of hypertree width
inferred← citeshttps://doi.org/10.1016/s0304-3975(02)00449-8openalex-snapshot
Tree-width and the monadic quantifier hierarchy
inferred← citeshttps://doi.org/10.1016/s0890-5401(03)00161-5openalex-snapshot
Describing parameterized complexity classes
inferred← citeshttps://doi.org/10.1093/comjnl/bxm056openalex-snapshot
Fixed-Parameter Algorithms For Artificial Intelligence, Constraint Satisfaction and Database Problems
inferred← citeshttps://doi.org/10.1109/ccc.2003.1214417openalex-snapshot
Parameterized complexity for the skeptic
inferred← citeshttps://doi.org/10.1109/focs.2014.22openalex-snapshot
Complexity of Counting Subgraphs: Only the Boundedness of the Vertex-Cover Number Counts
inferred← citeshttps://doi.org/10.1109/focs46700.2020.00128openalex-snapshot
Counting Small Induced Subgraphs Satisfying Monotone Properties
inferred← citeshttps://doi.org/10.1109/icde.2007.367849openalex-snapshot
Hypertree Decompositions for Query Optimization
inferred← citeshttps://doi.org/10.1109/icde53745.2022.00200openalex-snapshot
Deep and Collective Entity Resolution in Parallel
inferred← citeshttps://doi.org/10.1109/lics.2012.31openalex-snapshot
Decomposing Quantified Conjunctive (or Disjunctive) Formulas
inferred← citeshttps://doi.org/10.1109/lics.2019.8785660openalex-snapshot
Point-width and Max-CSPs
inferred← citeshttps://doi.org/10.1109/lics52264.2021.9470599openalex-snapshot
PTAS for Sparse General-Valued CSPs
inferred← citeshttps://doi.org/10.1109/lics56636.2023.10175813openalex-snapshot
PDL on Steroids: on Expressive Extensions of PDL with Intersection and Converse
inferred← citeshttps://doi.org/10.1109/secpri.2002.1004366openalex-snapshot
Design of a role-based trust-management framework
inferred← citeshttps://doi.org/10.1109/sfcs.2003.1238228openalex-snapshot
The complexity of homomorphism and constraint satisfaction problems seen from the other side
inferred← citeshttps://doi.org/10.1109/sfcs.2003.1238229openalex-snapshot
Towards a dichotomy theorem for the counting constraint satisfaction problem
inferred← citeshttps://doi.org/10.1137/1.9781611973730.42openalex-snapshot
Characterizing the easy-to-find subgraphs from the viewpoint of polynomial-time algorithms, kernels, and Turing kernels
inferred← citeshttps://doi.org/10.1137/1.9781611975994.133openalex-snapshot
Counting and Finding Homomorphisms is Universal for Parameterized Complexity Theory
inferred← citeshttps://doi.org/10.1137/1.9781611976465.137openalex-snapshot
Counting Homomorphisms to K 4 -minor-free Graphs, modulo 2
inferred← citeshttps://doi.org/10.1137/1.9781611976465.29openalex-snapshot
Treewidth-Pliability and PTAS for Max-CSPs
inferred← citeshttps://doi.org/10.1137/130911731openalex-snapshot
Efficient Approximations of Conjunctive Queries
inferred← citeshttps://doi.org/10.1137/140957378openalex-snapshot
Decomposing Quantified Conjunctive (or Disjunctive) Formulas
inferred← citeshttps://doi.org/10.1137/20m1365624openalex-snapshot
Counting Small Induced Subgraphs Satisfying Monotone Properties
inferred← citeshttps://doi.org/10.1137/20m1382921openalex-snapshot
Counting Homomorphisms to $K_4$-Minor-Free Graphs, Modulo 2
inferred← citeshttps://doi.org/10.1137/s0097539799360768openalex-snapshot
Fixed-Parameter Tractability, Definability, and Model-Checking
inferred← citeshttps://doi.org/10.1145/1055558.1055573openalex-snapshot
Foundations of semantic web databases
inferred← citeshttps://doi.org/10.1145/1055558.1055587openalex-snapshot
Weighted hypertree decompositions and optimal query plans
inferred← citeshttps://doi.org/10.1145/1055558.1055602openalex-snapshot
On preservation under homomorphisms and unions of conjunctive queries
inferred← citeshttps://doi.org/10.1145/1071596.1071597openalex-snapshot
Datalog programs and their persistency numbers
inferred← citeshttps://doi.org/10.1145/1084805.1084827openalex-snapshot
Query answering exploiting structural properties
inferred← citeshttps://doi.org/10.1145/1131342.1131344openalex-snapshot
On preservation under homomorphisms and unions of conjunctive queries
inferred← citeshttps://doi.org/10.1145/1206035.1206036openalex-snapshot
The complexity of homomorphism and constraint satisfaction problems seen from the other side
inferred← citeshttps://doi.org/10.1145/1721837.1721845openalex-snapshot
Approximating fractional hypertree width
inferred← citeshttps://doi.org/10.1145/1938551.1938583openalex-snapshot
The complexity of evaluating tuple generating dependencies
inferred← citeshttps://doi.org/10.1145/2213556.2213565openalex-snapshot
Worst-Case Optimal Join Algorithms
inferred← citeshttps://doi.org/10.1145/2213556.2213591openalex-snapshot
Efficient approximations of conjunctive queries
inferred← citeshttps://doi.org/10.1145/2274576.2274607openalex-snapshot
Factorised representations of query results
inferred← citeshttps://doi.org/10.1145/2338626.2338629openalex-snapshot
Entangled queries
inferred← citeshttps://doi.org/10.1145/2448496.2448508openalex-snapshot
Structural tractability of counting of solutions to conjunctive queries
inferred← citeshttps://doi.org/10.1145/2463664.2463669openalex-snapshot
The fine classification of conjunctive queries and parameterized logarithmic space complexity
inferred← citeshttps://doi.org/10.1145/2559946openalex-snapshot
On the complexity of existential positive queries
inferred← citeshttps://doi.org/10.1145/2582112.2582124openalex-snapshot
The limited blessing of low dimensionality
inferred← citeshttps://doi.org/10.1145/2603088.2603107openalex-snapshot
One hierarchy spawns another
inferred← citeshttps://doi.org/10.1145/2603088.2603119openalex-snapshot
The tractability frontier of graph-like first-order query sets
inferred← citeshttps://doi.org/10.1145/2636918openalex-snapshot
Constraint Solving via Fractional Edge Covers
inferred← citeshttps://doi.org/10.1145/2751316openalex-snapshot
The Fine Classification of Conjunctive Queries and Parameterized Logarithmic Space
inferred← citeshttps://doi.org/10.1145/2783888.2783894openalex-snapshot
Constant Delay Enumeration for Conjunctive Queries
inferred← citeshttps://doi.org/10.1145/3034786.3034789openalex-snapshot
Answering Conjunctive Queries under Updates
inferred← citeshttps://doi.org/10.1145/3073409openalex-snapshot
The Tractability Frontier of Graph-Like First-Order Query Sets
inferred← citeshttps://doi.org/10.1145/3143805openalex-snapshot
One Hierarchy Spawns Another
inferred← citeshttps://doi.org/10.1145/3191832openalex-snapshot
Ontology-Mediated Queries
inferred← citeshttps://doi.org/10.1145/3196959.3196962openalex-snapshot
General and Fractional Hypertree Decompositions
inferred← citeshttps://doi.org/10.1145/3233983openalex-snapshot
Efficient Evaluation and Static Analysis for Well-Designed Pattern Trees with Projection
inferred← citeshttps://doi.org/10.1145/3318464.3389762openalex-snapshot
Computing Local Sensitivities of Counting Queries with Joins
inferred← citeshttps://doi.org/10.1145/3406325.3451014openalex-snapshot
When is approximate counting for conjunctive queries tractable?
inferred← citeshttps://doi.org/10.1145/3409447openalex-snapshot
Point-Width and Max-CSPs
inferred← citeshttps://doi.org/10.1145/3450704openalex-snapshot
Almost Tight Lower Bounds for Hard Cutting Problems in Embedded Graphs
inferred← citeshttps://doi.org/10.1145/3452021.3458814openalex-snapshot
Modern Lower Bound Techniques in Database Theory and Constraint Satisfaction
inferred← citeshttps://doi.org/10.1145/3457374openalex-snapshot
Complexity Analysis of Generalized and Fractional Hypertree Decompositions
inferred← citeshttps://doi.org/10.1145/3517804.3524167openalex-snapshot
When is the Evaluation of Extended CRPQ Tractable?
inferred← citeshttps://doi.org/10.1145/3519935.3520008openalex-snapshot
Counting small induced subgraphs with hereditary properties
inferred← citeshttps://doi.org/10.1145/3569956openalex-snapshot
PTAS for Sparse General-valued CSPs
inferred← citeshttps://doi.org/10.1145/3572751.3572753openalex-snapshot
Counting the Answers to a Query
inferred← citeshttps://doi.org/10.1145/3618260.3649644openalex-snapshot
Counting Small Induced Subgraphs with Edge-Monotone Properties
inferred← citeshttps://doi.org/10.1145/3626515openalex-snapshot
Pliability and Approximating Max-CSPs
inferred← citeshttps://doi.org/10.1145/3651614openalex-snapshot
Counting Answers to Unions of Conjunctive Queries: Natural Tractability Criteria and Meta-Complexity
inferred← citeshttps://doi.org/10.1145/375551.375564openalex-snapshot
The parameterized complexity of database queries
inferred← citeshttps://doi.org/10.1145/375551.375579openalex-snapshot
Robbers, marshals, and guards
inferred← citeshttps://doi.org/10.1145/3771726openalex-snapshot
Counting Answers to Unions of Conjunctive Queries: Natural Tractability Criteria and Meta-Complexity
inferred← citeshttps://doi.org/10.1145/602220.602222openalex-snapshot
Query evaluation via tree-decompositions
inferred← citeshttps://doi.org/10.1201/9781584888215-c19openalex-snapshot
Database Theory
inferred← citeshttps://doi.org/10.14778/3510397.3510407openalex-snapshot
Threshold queries in theory and in the wild
inferred← citeshttps://doi.org/10.1515/9783110889178.51openalex-snapshot
Parameterized complexity: new developments and research frontiers
inferred← citeshttps://doi.org/10.1613/jair.4898openalex-snapshot
Module Extraction in Expressive Ontology Languages via Datalog Reasoning
inferred← citeshttps://doi.org/10.2168/lmcs-2(3:2)2006openalex-snapshot
Logics for Unranked Trees: An Overview
inferred← citeshttps://doi.org/10.2168/lmcs-8(1:32)2012openalex-snapshot
Tree-width for first order formulae
inferred← citeshttps://doi.org/10.23638/lmcs-15(3:31)2019openalex-snapshot
The parameterized space complexity of model-checking bounded variable first-order logic
inferred← citeshttps://doi.org/10.24963/ijcai.2020/43openalex-snapshot
Computational Aspects of Conditional Minisum Approval Voting in Elections with Interdependent Issues
inferred← citeshttps://doi.org/10.24963/ijcai.2021/48openalex-snapshot
Winner Determination and Strategic Control in Conditional Approval Voting
inferred← citeshttps://doi.org/10.37236/5474openalex-snapshot
Extended Formulation for CSP that is Compact for Instances of Bounded Treewidth
inferred← citeshttps://doi.org/10.4086/toc.2010.v006a005openalex-snapshot
inferred← citeshttps://doi.org/10.4230/lipics.ccc.2019.31openalex-snapshot
A Fine-Grained Analogue of Schaefer’s Theorem in P: Dichotomy of Exists^k-Forall-Quantified First-Order Graph Properties
inferred← citeshttps://doi.org/10.4230/lipics.csl.2012.137openalex-snapshot
A Negative Conjunctive Query is Easy if and only if it is Beta-Acyclic
inferred← citeshttps://doi.org/10.4230/lipics.icalp.2021.108openalex-snapshot
Detecting and Counting Small Subgraphs, and Evaluating a Parameterized Tutte Polynomial: Lower Bounds via Toroidal Grids and Cayley Graph Expanders
inferred← citeshttps://doi.org/10.4230/lipics.icalp.2021.91openalex-snapshot
On Counting (Quantum-)Graph Homomorphisms in Finite Fields of Prime Order
inferred← citeshttps://doi.org/10.4230/lipics.icdt.2018.8openalex-snapshot
Answering UCQs under Updates and in the Presence of Integrity Constraints
inferred← citeshttps://doi.org/10.4230/lipics.stacs.2011.12openalex-snapshot
Structural Decomposition Methods and What They are Good For
inferred← citeshttps://doi.org/10.48550/arxiv.1110.4201openalex-snapshot
The Complexity of Weighted Counting for Acyclic Conjunctive Queries
inferred← citeshttps://doi.org/10.48550/arxiv.1206.3282openalex-snapshot
Improving the Accuracy and Efficiency of MAP Inference for Markov Logic
inferred← citeshttps://doi.org/10.48550/arxiv.1303.2059openalex-snapshot
Structural Tractability of Counting of Solutions to Conjunctive Queries
inferred← citeshttps://doi.org/10.48550/arxiv.1407.3429openalex-snapshot
The Tractability Frontier of Graph-Like First-Order Query Sets
inferred← citeshttps://doi.org/10.48550/arxiv.1408.4263openalex-snapshot
Quantified Conjunctive Queries on Partially Ordered Sets
inferred← citeshttps://doi.org/10.48550/arxiv.1605.01207openalex-snapshot
Ontology-Mediated Queries: Combined Complexity and Succinctness of Rewritings via Circuit Complexity
inferred← citeshttps://doi.org/10.48550/arxiv.1611.01090openalex-snapshot
General and Fractional Hypertree Decompositions: Hard and Easy Cases
inferred← citeshttps://doi.org/10.48550/arxiv.1612.01171openalex-snapshot
The limited blessing of low dimensionality: when $1-1/d$ is the best possible exponent for $d$-dimensional geometric problems
inferred← citeshttps://doi.org/10.48550/arxiv.1702.06370openalex-snapshot
Answering Conjunctive Queries under Updates
inferred← citeshttps://doi.org/10.48550/arxiv.1710.08758openalex-snapshot
Two dichotomies for model-checking in multi-layer structures
inferred← citeshttps://doi.org/10.48550/arxiv.1904.07388openalex-snapshot
Point-width and Max-CSPs
inferred← citeshttps://doi.org/10.48550/arxiv.2002.02228openalex-snapshot
Querying Guarded Fragments via Resolution
inferred← citeshttps://doi.org/10.5441/002/icdt.2014.25openalex-snapshot
The Complexity of Width Minimization for Existential Positive Queries
inferred← citeshttps://doi.org/10.5555/1109557.1109590openalex-snapshot
Constraint solving via fractional edge covers
inferred← citeshttps://doi.org/10.5555/1496770.1496868openalex-snapshot
Approximating fractional hypertree width
inferred← citeshttps://doi.org/10.5555/2722129.2722171openalex-snapshot
Characterizing the easy-to-find subgraphs from the viewpoint of polynomial-time algorithms, kernels, and Turing kernels
inferred← citeshttps://doi.org/10.70675/82bb9f24z8517z463az8bc9zadcf1a50805fopenalex-snapshot
Synchronous relations and complexity of query evaluation
inferred← citeshttps://doi.org/10.7916/d8zp45ktopenalex-snapshot
Unconditional Lower Bounds in Complexity Theory
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.