On the public citation graph

Circular arc graphs: New uses and a new algorithm

0 signed · 27 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/jcp.1040700403openalex-snapshot
Circular genetic maps
inferredcites →https://doi.org/10.1002/net.3230040407openalex-snapshot
Algorithms on circular‐arc graphs
inferredcites →https://doi.org/10.1016/0041-1647(68)90016-6openalex-snapshot
Scheduling of traffic lights—A new approach
inferredcites →https://doi.org/10.1016/s0012-365x(74)80027-0openalex-snapshot
Structure theorems for some circular-arc graphs
inferredcites →https://doi.org/10.1016/s0012-365x(76)80011-8openalex-snapshot
Characterization problems for graphs, partially ordered sets, lattices, and families of sets
inferredcites →https://doi.org/10.1073/pnas.45.11.1607openalex-snapshot
ON THE TOPOLOGY OF THE GENETIC FINE STRUCTURE
inferredcites →https://doi.org/10.1080/00029890.1969.12000337openalex-snapshot
What Are the Intersection Graphs of Arcs in a Circle?
inferredcites →https://doi.org/10.1111/j.2044-8317.1974.tb00534.xopenalex-snapshot
SOME APPLICATIONS OF GRAPH THEORY AND RELATED NON‐METRIC TECHNIQUES TO PROBLEMS OF APPROXIMATE SERIATION: THE CASE OF SYMMETRIC PROXIMITY MEASURES
inferredcites →https://doi.org/10.1137/0129040openalex-snapshot
Coloring a Family of Circular Arcs
inferredcites →https://doi.org/10.2140/pjm.1965.15.835openalex-snapshot
Incidence matrices and interval graphs
inferredcites →https://doi.org/10.2140/pjm.1971.39.535openalex-snapshot
Matrix characterizations of circular-arc graphs
inferredcites →https://doi.org/10.2307/2004649openalex-snapshot
Proof Techniques in Graph Theory
inferredcites →https://doi.org/10.4064/fm-51-1-45-64openalex-snapshot
Representation of a finite graph by a set of intervals on the real line
inferredcites →https://doi.org/10.4153/cjm-1964-055-5openalex-snapshot
A Characterization of Comparability Graphs and of Interval Graphs

What points at this work

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

inferred← citeshttps://doi.org/10.1002/jgt.3190090210openalex-snapshot
The frame dimension and the complete overlap dimension of a graph
inferred← citeshttps://doi.org/10.1002/jgt.3190130508openalex-snapshot
Circular‐arc digraphs: A characterization
inferred← citeshttps://doi.org/10.1007/3-540-51542-9_25openalex-snapshot
NC algorithms for circular-arc graphs
inferred← citeshttps://doi.org/10.1007/978-94-009-5315-4_8openalex-snapshot
Parameters of Partial Orders and Graphs: Packing, Covering, and Representation
inferred← citeshttps://doi.org/10.1007/bf01097528openalex-snapshot
Representations of graphs and networks (coding, layouts and embeddings)
inferred← citeshttps://doi.org/10.1007/bfb0070359openalex-snapshot
Theory and Applications of Graphs
inferred← citeshttps://doi.org/10.1007/bfb0083468openalex-snapshot
(K4-e)-free perfect graphs and star cutsets
inferred← citeshttps://doi.org/10.1007/s00373-025-02887-9openalex-snapshot
On Some Subclasses of Oriented Catch Digraphs
inferred← citeshttps://doi.org/10.1016/0012-365x(85)90052-4openalex-snapshot
An O(qn) algorithm to q-color a proper family of circular arcs
inferred← citeshttps://doi.org/10.1016/0012-365x(92)90623-nopenalex-snapshot
Articulation sets in linear perfect matrices I: forbidden configurations and star cutsets
inferred← citeshttps://doi.org/10.1016/b978-0-12-289260-8.50015-7openalex-snapshot
Interval Graphs
inferred← citeshttps://doi.org/10.1016/j.disc.2008.04.003openalex-snapshot
Characterizations and recognition of circular-arc graphs and subclasses: A survey
inferred← citeshttps://doi.org/10.1142/9789812799890_0008openalex-snapshot
SOME APPLICATIONS OF GRAPH 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.