On the public citation graph
On rigid circuit graphs
0 signed · 853 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.
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.
What this work says
Outgoing claims: the papers this work cites, builds on, or argues with.
inferredcites →https://doi.org/10.1016/s1385-7258(51)50053-7openalex-snapshot
A Colour Problem for Infinite Graphs and a Problem in the Theory of Relations
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1002/(sici)1097-0118(199902)30:2<121::aid-jgt6>3.0.co;2-1openalex-snapshot
Restricted unimodular chordal graphs
inferred← citeshttps://doi.org/10.1002/(sici)1097-0118(199904)30:4<289::aid-jgt4>3.0.co;2-3openalex-snapshot
Even and odd holes in cap-free graphs
inferred← citeshttps://doi.org/10.1002/(sici)1097-0118(199912)32:4<405::aid-jgt8>3.0.co;2-zopenalex-snapshot
More than one tough chordal planar graphs are Hamiltonian
inferred← citeshttps://doi.org/10.1002/(sici)1097-0118(199912)32:4<405::aid-jgt8>3.3.co;2-qopenalex-snapshot
More than one tough chordal planar graphs are Hamiltonian
inferred← citeshttps://doi.org/10.1002/9781118032497.ch1openalex-snapshot
Introduction to Graph Coloring
inferred← citeshttps://doi.org/10.1002/jgt.20057openalex-snapshot
Disjoint clique cutsets in graphs without long holes
inferred← citeshttps://doi.org/10.1002/jgt.20407openalex-snapshot
Characterizing path graphs by forbidden induced subgraphs
inferred← citeshttps://doi.org/10.1002/jgt.21685openalex-snapshot
Hereditary Efficiently Dominatable Graphs
inferred← citeshttps://doi.org/10.1002/jgt.21795openalex-snapshot
Vertex Ordering Characterizations of Graphs of Bounded Asteroidal Number
inferred← citeshttps://doi.org/10.1002/jgt.22142openalex-snapshot
A New Class of Graphs That Satisfies the Chen‐Chvátal Conjecture
inferred← citeshttps://doi.org/10.1002/jgt.22146openalex-snapshot
On the structure of (pan, even hole)‐free graphs
inferred← citeshttps://doi.org/10.1002/jgt.22428openalex-snapshot
Clique cutsets beyond chordal graphs
inferred← citeshttps://doi.org/10.1002/jgt.22456openalex-snapshot
Linearly χ‐bounding (P6, C4)‐free graphs*
inferred← citeshttps://doi.org/10.1002/jgt.22458openalex-snapshot
A survey on the study of real zeros of flow polynomials
inferred← citeshttps://doi.org/10.1002/jgt.22499openalex-snapshot
The class of (P7,C4,C5)‐free graphs: Decomposition, algorithms, and χ‐boundedness
inferred← citeshttps://doi.org/10.1002/jgt.22617openalex-snapshot
Proving a conjecture on chromatic polynomials by counting the number of acyclic orientations
inferred← citeshttps://doi.org/10.1002/jgt.22952openalex-snapshot
ZDP(n) ${Z}_{DP}(n)$ is bounded above by n2−(n+3)∕2 ${n}^{2}-(n+3)\unicode{x02215}2$
inferred← citeshttps://doi.org/10.1002/jgt.23000openalex-snapshot
Clique‐width: Harnessing the power of atoms
inferred← citeshttps://doi.org/10.1002/jgt.23250openalex-snapshot
4‐Connected 1‐Planar Chordal Graphs Are Hamiltonian‐Connected
inferred← citeshttps://doi.org/10.1002/jgt.3190020209openalex-snapshot
Perfect Elimination and Chordal Bipartite Graphs
inferred← citeshttps://doi.org/10.1002/jgt.3190050314openalex-snapshot
A characterization of ptolemaic graphs
inferred← citeshttps://doi.org/10.1002/jgt.3190080206openalex-snapshot
A generalization of chordal graphs
inferred← citeshttps://doi.org/10.1002/jgt.3190110108openalex-snapshot
A separation property of planar triangulations
inferred← citeshttps://doi.org/10.1002/jgt.3190110303openalex-snapshot
On the Interval Number of a Triangulated Graph
inferred← citeshttps://doi.org/10.1002/jgt.3190120303openalex-snapshot
On the interval number of a chordal graph
inferred← citeshttps://doi.org/10.1002/jgt.3190120313openalex-snapshot
On the tree representation of chordal graphs
inferred← citeshttps://doi.org/10.1002/jgt.3190160403openalex-snapshot
s‐strongly perfect cartesian product of graphs
inferred← citeshttps://doi.org/10.1002/jgt.3190180704openalex-snapshot
The w ‐median of a connected strongly chordal graph
inferred← citeshttps://doi.org/10.1002/jgt.3190190407openalex-snapshot
Graphs with least number of colorings
inferred← citeshttps://doi.org/10.1002/jgt.70076openalex-snapshot
A Min–Max Relation on Dicuts and Dijoins in Weighted Chordal Digraphs
inferred← citeshttps://doi.org/10.1002/jgt.70126openalex-snapshot
Representation and Obstruction Characterization of Co‐TT Graphs
inferred← citeshttps://doi.org/10.1002/net.20198openalex-snapshot
On tree 3‐spanners in directed path graphs
inferred← citeshttps://doi.org/10.1002/net.3230030305openalex-snapshot
Algorithms for a maximum clique and a maximum independent set of a circle graph
inferred← citeshttps://doi.org/10.1002/net.3230150109openalex-snapshot
Steiner trees, connected domination and strongly chordal graphs
inferred← citeshttps://doi.org/10.1002/net.3230200304openalex-snapshot
A characterization of partial 3‐trees
inferred← citeshttps://doi.org/10.1002/net.3230240208openalex-snapshot
Edge‐maximal triangulated subgraphs and heuristics for the maximum clique problem
inferred← citeshttps://doi.org/10.1002/rsa.3240070304openalex-snapshot
On the computational complexity of ordered subgraph recognition
inferred← citeshttps://doi.org/10.1006/jagm.1998.0962openalex-snapshot
Distance Approximating Trees for Chordal and Dually Chordal Graphs
inferred← citeshttps://doi.org/10.1006/jagm.1998.0997openalex-snapshot
Approximating the Bandwidth for Asteroidal Triple-Free Graphs
inferred← citeshttps://doi.org/10.1006/jagm.2000.1118openalex-snapshot
Improved Bandwidth Approximation for Trees and Chordal Graphs
inferred← citeshttps://doi.org/10.1006/jctb.1993.1066openalex-snapshot
Finite Induced Graph Ramsey Theory: On Partitions of Subgraphs
inferred← citeshttps://doi.org/10.1006/jctb.1995.1021openalex-snapshot
Split-Neighborhood Graphs and the Strong Perfect Graph Conjecture
inferred← citeshttps://doi.org/10.1006/jctb.1995.1048openalex-snapshot
A Characterization of Some Graph Classes with No Long Holes
inferred← citeshttps://doi.org/10.1007/0-387-22444-0_3openalex-snapshot
On the coloration of perfect graphs
inferred← citeshttps://doi.org/10.1007/10692760_8openalex-snapshot
A Generalization of AT-free Graphs and a Generic Algorithm for Solving Treewidth, Minimum Fill-In and Vertex Ranking
inferred← citeshttps://doi.org/10.1007/11558958_95openalex-snapshot
Simple and Efficient Modifications of Elimination Orderings
inferred← citeshttps://doi.org/10.1007/11575467_21openalex-snapshot
Register Allocation Via Coloring of Chordal Graphs
inferred← citeshttps://doi.org/10.1007/11604686_16openalex-snapshot
Induced Subgraphs of Bounded Degree and Bounded Treewidth
inferred← citeshttps://doi.org/10.1007/11785293_38openalex-snapshot
Linear-Time Algorithms for Tree Root Problems
inferred← citeshttps://doi.org/10.1007/11917496_7openalex-snapshot
Listing Chordal Graphs and Interval Graphs
inferred← citeshttps://doi.org/10.1007/11925231_2openalex-snapshot
Properties of Markovian Subgraphs of a Decomposable Graph
inferred← citeshttps://doi.org/10.1007/3-540-36379-3_19openalex-snapshot
The Complexity of Approximating the Oriented Diameter of Chordal Graphs
inferred← citeshttps://doi.org/10.1007/3-540-44676-1_43openalex-snapshot
Packing Cycles and Cuts in Undirected Graphs
inferred← citeshttps://doi.org/10.1007/3-540-44679-6_34openalex-snapshot
A Linear Time Algorithm for Enumerating All the Minimum and Minimal Separators of a Chordal Graph
inferred← citeshttps://doi.org/10.1007/3-540-44985-x_13openalex-snapshot
Recognizing Weakly Triangulated Graphs by Edge Separability
inferred← citeshttps://doi.org/10.1007/3-540-49116-3_18openalex-snapshot
Treewidth and Minimum Fill-In of Weakly Triangulated Graphs
inferred← citeshttps://doi.org/10.1007/3-540-49116-3_23openalex-snapshot
Approximating Bandwidth by Mixing Layouts of Interval Graphs
inferred← citeshttps://doi.org/10.1007/3-540-52282-4_48openalex-snapshot
Nonblocking graphs: Greedy algorithms to compute disjoint paths
inferred← citeshttps://doi.org/10.1007/3-540-54891-2_22openalex-snapshot
A new simple linear algorithm to recognize interval graphs
inferred← citeshttps://doi.org/10.1007/3-540-55210-3_201openalex-snapshot
A simple linear time algorithm for triangulating three-colored graphs
inferred← citeshttps://doi.org/10.1007/3-540-55719-9_80openalex-snapshot
Two strikes against perfect phylogeny
inferred← citeshttps://doi.org/10.1007/3-540-56279-6_64openalex-snapshot
Approximating treewidth and pathwidth of some classes of perfect graphs
inferred← citeshttps://doi.org/10.1007/3-540-57273-2_61openalex-snapshot
Computing treewidth and minimum fill-in: All you need are the minimal separators
inferred← citeshttps://doi.org/10.1007/3-540-57899-4_53openalex-snapshot
Approximating the chromatic polynomial of a graph
inferred← citeshttps://doi.org/10.1007/3-540-59071-4_39openalex-snapshot
On domination elimination orderings and domination graphs
inferred← citeshttps://doi.org/10.1007/3-540-60084-1_68openalex-snapshot
How to use the minimal separators of a graph for its chordal triangulation
inferred← citeshttps://doi.org/10.1007/3-540-60618-1_88openalex-snapshot
Chordal graphs and their clique graphs
inferred← citeshttps://doi.org/10.1007/3-540-63165-8_195openalex-snapshot
Efficient parallel graph algorithms for coarse grained multicomputers and BSP
inferred← citeshttps://doi.org/10.1007/3-540-63397-9_7openalex-snapshot
Distance approximating trees for chordal and dually chordal graphs
inferred← citeshttps://doi.org/10.1007/978-0-387-34735-6_23openalex-snapshot
A Connectivity Rating for Vertices in Networks
inferred← citeshttps://doi.org/10.1007/978-1-4471-0717-0_20openalex-snapshot
Greedy Algorithms for the Lower and Upper Chromatic Numbers
inferred← citeshttps://doi.org/10.1007/978-1-4613-8369-7_1openalex-snapshot
An Introduction to Chordal Graphs and Clique Trees
inferred← citeshttps://doi.org/10.1007/978-1-4614-3719-2_8openalex-snapshot
Decomposable Models of Contingency Tables
inferred← citeshttps://doi.org/10.1007/978-1-4614-4529-6_11openalex-snapshot
Spectral Properties of Graphs
inferred← citeshttps://doi.org/10.1007/978-1-4614-4529-6_5openalex-snapshot
Independent Sets and Matchings
inferred← citeshttps://doi.org/10.1007/978-1-4614-4529-6_6openalex-snapshot
Eulerian and Hamiltonian Graphs
inferred← citeshttps://doi.org/10.1007/978-1-4684-6381-1_9openalex-snapshot
Food Webs, Competition Graphs, Competition-Common Enemy Graphs, and Niche Graphs
inferred← citeshttps://doi.org/10.1007/978-1-4757-3023-4_1openalex-snapshot
The Maximum Clique Problem
inferred← citeshttps://doi.org/10.1007/978-1-4939-2864-4_687openalex-snapshot
LexBFS, Structure, and Algorithms
inferred← citeshttps://doi.org/10.1007/978-3-030-00256-5_30openalex-snapshot
Characterization and Recognition of Tree 3-Spanner Admissible Directed Path Graphs of Diameter Three
inferred← citeshttps://doi.org/10.1007/978-3-030-24766-9_10openalex-snapshot
Avoidable Vertices and Edges in Graphs
inferred← citeshttps://doi.org/10.1007/978-3-030-38919-2_52openalex-snapshot
Two-Player Competitive Diffusion Game: Graph Classes and the Existence of a Nash Equilibrium
inferred← citeshttps://doi.org/10.1007/978-3-030-79527-6_6openalex-snapshot
Wait-Free Approximate Agreement on Graphs
inferred← citeshttps://doi.org/10.1007/978-3-031-20350-3_20openalex-snapshot
Exact and Parameterized Algorithms for Restricted Subset Feedback Vertex Set in Chordal Graphs
inferred← citeshttps://doi.org/10.1007/978-3-031-20624-5_7openalex-snapshot
Computing and Listing Avoidable Vertices and Paths
inferred← citeshttps://doi.org/10.1007/978-3-031-34347-6_25openalex-snapshot
On Integer Linear Programs for Treewidth Based on Perfect Elimination Orderings
inferred← citeshttps://doi.org/10.1007/978-3-031-43380-1_10openalex-snapshot
Metric Dimension Parameterized by Treewidth in Chordal Graphs
inferred← citeshttps://doi.org/10.1007/978-3-031-55598-5_2openalex-snapshot
Decoding Tree Decompositions from Permutations
inferred← citeshttps://doi.org/10.1007/978-3-031-62166-6_17openalex-snapshot
Characterizing s-Strongly Chordal Graphs Using 2-Paths and k-Chords
inferred← citeshttps://doi.org/10.1007/978-3-031-75409-8_13openalex-snapshot
Beyond Recognizing Well-Covered Graphs
inferred← citeshttps://doi.org/10.1007/978-3-031-91303-7_14openalex-snapshot
Free Quotients and Surface Subgroups
inferred← citeshttps://doi.org/10.1007/978-3-031-92935-9_19openalex-snapshot
Atoms Versus Avoiding Simplicial Vertices
inferred← citeshttps://doi.org/10.1007/978-3-032-27732-9_1openalex-snapshot
On the Complexity of Vertex-Splitting into an Interval Graph
inferred← citeshttps://doi.org/10.1007/978-3-319-00029-9_16openalex-snapshot
On Confidentially Connected-Free Graphs
inferred← citeshttps://doi.org/10.1007/978-3-319-09186-0_8openalex-snapshot
Koszul Binomial Edge Ideals
inferred← citeshttps://doi.org/10.1007/978-3-319-49475-3_9openalex-snapshot
Special Classes of Graphs
inferred← citeshttps://doi.org/10.1007/978-3-319-57586-5_37openalex-snapshot
Linear-Time Generation of Random Chordal Graphs
inferred← citeshttps://doi.org/10.1007/978-3-319-68705-6_20openalex-snapshot
Linearly $$\chi $$ χ -Bounding $$(P_6,C_4)$$ ( P 6 , C 4 ) -Free Graphs
inferred← citeshttps://doi.org/10.1007/978-3-319-95349-6_7openalex-snapshot
Binomial Edge Ideals and Related Ideals
inferred← citeshttps://doi.org/10.1007/978-3-319-96151-4_35openalex-snapshot
Lovász-Schrijver PSD-Operator on Some Graph Classes Defined by Clique Cutsets
inferred← citeshttps://doi.org/10.1007/978-3-319-97846-8_1openalex-snapshot
Mathematical Preliminaries
inferred← citeshttps://doi.org/10.1007/978-3-322-94689-8_8openalex-snapshot
Graphen und Hypergraphen mit Baumstruktur
inferred← citeshttps://doi.org/10.1007/978-3-540-24587-2_7openalex-snapshot
A Vertex Incremental Approach for Dynamically Maintaining Chordal Graphs
inferred← citeshttps://doi.org/10.1007/978-3-540-24587-2_70openalex-snapshot
Fair Cost Allocations under Conflicts — A Game-Theoretic Point of View —
inferred← citeshttps://doi.org/10.1007/978-3-540-27801-6_27openalex-snapshot
Maximal Common Connected Sets of Interval Graphs
inferred← citeshttps://doi.org/10.1007/978-3-540-27810-8_7openalex-snapshot
Collective Tree Spanners of Graphs
inferred← citeshttps://doi.org/10.1007/978-3-540-31843-9_14openalex-snapshot
Really Straight Graph Drawings
inferred← citeshttps://doi.org/10.1007/978-3-540-39890-5_6openalex-snapshot
The Minimum Degree Heuristic and the Minimal Triangulation Process
inferred← citeshttps://doi.org/10.1007/978-3-540-69733-6_45openalex-snapshot
On Listing, Sampling, and Counting the Chordal Graphs with Edge Constraints
inferred← citeshttps://doi.org/10.1007/978-3-540-74839-7_10openalex-snapshot
A Characterisation of the Minimal Triangulations of Permutation Graphs
inferred← citeshttps://doi.org/10.1007/978-3-540-74839-7_26openalex-snapshot
Characterization and Recognition of Digraphs of Bounded Kelly-width
inferred← citeshttps://doi.org/10.1007/978-3-540-76796-1_3openalex-snapshot
Antimatroids, Betweenness, Convexity
inferred← citeshttps://doi.org/10.1007/978-3-540-77120-3_76openalex-snapshot
Minimum Fill-In and Treewidth of Split+ ke and Split+ kv Graphs
inferred← citeshttps://doi.org/10.1007/978-3-540-92182-0_27openalex-snapshot
Faster Parameterized Algorithms for Minimum Fill-In
inferred← citeshttps://doi.org/10.1007/978-3-642-13073-1_12openalex-snapshot
A Parameterized Algorithm for Chordal Sandwich
inferred← citeshttps://doi.org/10.1007/978-3-642-13078-6_8openalex-snapshot
Extensions and Improvements to the Chordal Graph Approach to the Multi-state Perfect Phylogeny Problem
inferred← citeshttps://doi.org/10.1007/978-3-642-17461-2_17openalex-snapshot
New Min-Max Theorems for Weakly Chordal and Dually Chordal Graphs
inferred← citeshttps://doi.org/10.1007/978-3-642-19222-7_30openalex-snapshot
Graphs of Separability at Most Two: Structural Characterizations and Their Consequences
inferred← citeshttps://doi.org/10.1007/978-3-642-19861-8_4openalex-snapshot
SSA-Based Register Allocation with PBQP
inferred← citeshttps://doi.org/10.1007/978-3-642-21458-5_13openalex-snapshot
Unique Perfect Phylogeny Is NP-Hard
inferred← citeshttps://doi.org/10.1007/978-3-642-23038-7_10openalex-snapshot
Constructing Perfect Phylogenies and Proper Triangulations for Three-State Characters
inferred← citeshttps://doi.org/10.1007/978-3-642-23038-7_24openalex-snapshot
Efficiently Solvable Perfect Phylogeny Problems on Binary and k-State Data with Missing Values
inferred← citeshttps://doi.org/10.1007/978-3-642-25591-5_13openalex-snapshot
Finding Contractions and Induced Minors in Chordal Graphs via Disjoint Paths
inferred← citeshttps://doi.org/10.1007/978-3-642-27848-8_687-1openalex-snapshot
LexBFS, Structure, and Algorithms
inferred← citeshttps://doi.org/10.1007/978-3-642-29700-7_31openalex-snapshot
The Black-and-White Coloring Problem on Distance-Hereditary Graphs and Strongly Chordal Graphs
inferred← citeshttps://doi.org/10.1007/978-3-642-34611-8_5openalex-snapshot
Triangulation and Clique Separator Decomposition of Claw-Free Graphs
inferred← citeshttps://doi.org/10.1007/978-3-642-35311-6_44openalex-snapshot
The Competitive Facility Location Problem in a Duopoly: Connections to the 1-Median Problem
inferred← citeshttps://doi.org/10.1007/978-3-642-35843-2_24openalex-snapshot
Polynomial Time Algorithms for Computing a Minimum Hull Set in Distance-Hereditary and Chordal Graphs
inferred← citeshttps://doi.org/10.1007/978-3-642-40313-2_22openalex-snapshot
Semilinearity and Context-Freeness of Languages Accepted by Valence Automata
inferred← citeshttps://doi.org/10.1007/978-3-642-45043-3_33openalex-snapshot
Characterizing and Computing the Structure of Clique Intersections in Strongly Chordal Graphs
inferred← citeshttps://doi.org/10.1007/978-3-642-46908-4_17openalex-snapshot
On the Domination Problem for Bipartite Graphs
inferred← citeshttps://doi.org/10.1007/978-3-642-68874-4_18openalex-snapshot
Min-Max Results in Combinatorial Optimization
inferred← citeshttps://doi.org/10.1007/978-3-642-93360-8_5openalex-snapshot
A Necessary and Sufficient Assembly Rule for Real Ecosystems
inferred← citeshttps://doi.org/10.1007/978-3-662-46681-0_24openalex-snapshot
Linearly Ordered Attribute Grammar Scheduling Using SAT-Solving
inferred← citeshttps://doi.org/10.1007/978-3-662-53174-7_11openalex-snapshot
A Polynomial Delay Algorithm for Enumerating Minimal Dominating Sets in Chordal Graphs
inferred← citeshttps://doi.org/10.1007/978-3-7091-9076-0_1openalex-snapshot
Efficient Computations in Tree-Like Graphs
inferred← citeshttps://doi.org/10.1007/978-981-99-3080-7_26openalex-snapshot
On m-Bonacci Intersection-Sum Graphs
inferred← citeshttps://doi.org/10.1007/bf01097528openalex-snapshot
Representations of graphs and networks (coding, layouts and embeddings)
inferred← citeshttps://doi.org/10.1007/bf01222661openalex-snapshot
Separation of two convex sets in convexity structures
inferred← citeshttps://doi.org/10.1007/bf01581045openalex-snapshot
Polynomially bounded algorithms for locatingp-centers on a tree
inferred← citeshttps://doi.org/10.1007/bf01787705openalex-snapshot
A conjecture on triangles of graphs
inferred← citeshttps://doi.org/10.1007/bf01858456openalex-snapshot
On the chromatic uniqueness of the graphW(n, n − 2, k)
inferred← citeshttps://doi.org/10.1007/bf01929485openalex-snapshot
Recognizing bull-free perfect graphs
inferred← citeshttps://doi.org/10.1007/bf01934264openalex-snapshot
Finding minimum height elimination trees for interval graphs in polynomial time
inferred← citeshttps://doi.org/10.1007/bf02115757openalex-snapshot
Some properties of graph centroids
inferred← citeshttps://doi.org/10.1007/bf02571719openalex-snapshot
Free hyperplane arrangements betweenA n−1 andB n
inferred← citeshttps://doi.org/10.1007/bf02614320openalex-snapshot
Cuts, matrix completions and graph rigidity
inferred← citeshttps://doi.org/10.1007/bfb0024492openalex-snapshot
Algorithms for the treewidth and minimum fill-in of HHD-free graphs
inferred← citeshttps://doi.org/10.1007/bfb0070404openalex-snapshot
Food webs, competition graphs, and the boxicity of ecological phase space
inferred← citeshttps://doi.org/10.1007/bfb0083471openalex-snapshot
A characterization of centroidal graphs
inferred← citeshttps://doi.org/10.1007/s00009-023-02348-8openalex-snapshot
Dirac’s Theorem and Multigraded Syzygies
inferred← citeshttps://doi.org/10.1007/s00009-023-02508-wopenalex-snapshot
Diameter and Connectivity of Finite Simple Graphs
inferred← citeshttps://doi.org/10.1007/s00009-025-03028-5openalex-snapshot
Edge Ideals with Linear Quotients and Without Homological Linear Quotients
inferred← citeshttps://doi.org/10.1007/s00010-021-00776-zopenalex-snapshot
On graphs with equal total domination and Grundy total domination numbers
inferred← citeshttps://doi.org/10.1007/s000130050040openalex-snapshot
Cohen-macaulay bipartite graphs
showing the first 200 of 852 · page through all 852
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.