On the public citation graph
A Simpler Linear-Time Recognition of Circular-Arc Graphs
0 signed · 40 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.1002/net.3230040407openalex-snapshot
Algorithms on circular‐arc graphs
inferredcites →https://doi.org/10.1007/11809678_10openalex-snapshot
Characterizations and Linear Time Recognition of Helly Circular-Arc Graphs
inferredcites →https://doi.org/10.1007/3-540-53832-1_31openalex-snapshot
Avoiding matrix multiplication
inferredcites →https://doi.org/10.1007/bfb0036947openalex-snapshot
Recognition and isomorphism of two dimensional partial orders
inferredcites →https://doi.org/10.1007/s00453-003-1032-7openalex-snapshot
Linear-Time Recognition of Circular-Arc Graphs
inferredcites →https://doi.org/10.1016/0095-8956(88)90038-xopenalex-snapshot
Circular-arc graphs with clique cover number two
inferredcites →https://doi.org/10.1016/s0012-365x(98)00319-7openalex-snapshot
Modular decomposition and transitive orientation
inferredcites →https://doi.org/10.1016/s0022-0000(76)80045-1openalex-snapshot
Testing for the consecutive ones property, interval graphs, and graph planarity using PQ-tree algorithms
inferredcites →https://doi.org/10.1016/s0304-3975(02)00435-8openalex-snapshot
PC trees and circular-ones arrangements
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.1109/iscc.2004.1358419openalex-snapshot
Routing in all-optical ring networks revisited
inferredcites →https://doi.org/10.1137/0209001openalex-snapshot
An Efficient Test for Circular-Arc Graphs
inferredcites →https://doi.org/10.1137/s0097539792269095openalex-snapshot
Linear-Time Representation Algorithms for Proper Circular-Arc Graphs and Proper Interval Graphs
inferredcites →https://doi.org/10.1137/s0097539793260726openalex-snapshot
$O(M\cdot N)$ Algorithms for the Recognition and Isomorphism Problems on Circular-Arc Graphs
inferredcites →https://doi.org/10.1145/1109557.1109592openalex-snapshot
Efficient construction of unit circular-arc models
inferredcites →https://doi.org/10.2140/pjm.1971.39.535openalex-snapshot
Matrix characterizations of circular-arc graphs
inferredcites →https://doi.org/10.5555/1109557.1109592openalex-snapshot
Efficient construction of unit circular-arc models
inferredcites →https://doi.org/10.5555/313559.313637openalex-snapshot
An O(n2 algorithm for circular-arc graph recognition
inferredcites →https://doi.org/10.5555/545381.545494openalex-snapshot
Construction of probe interval models
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1007/11809678_10openalex-snapshot
Characterizations and Linear Time Recognition of Helly Circular-Arc Graphs
inferred← citeshttps://doi.org/10.1007/11917496_26openalex-snapshot
Certifying Algorithms for Recognizing Proper Circular-Arc Graphs and Unit Circular-Arc Graphs
inferred← citeshttps://doi.org/10.1007/978-3-031-09993-9_12openalex-snapshot
Distributed Interactive Proofs for the Recognition of Some Geometric Intersection Graph Classes
inferred← citeshttps://doi.org/10.1007/978-3-540-69903-3_32openalex-snapshot
A Simple Linear Time Algorithm for the Isomorphism Problem on Proper Circular-Arc Graphs
inferred← citeshttps://doi.org/10.1007/978-3-540-74839-7_24openalex-snapshot
Proper Helly Circular-Arc Graphs
inferred← citeshttps://doi.org/10.1007/978-3-540-92248-3_29openalex-snapshot
From a Circular-Arc Model to a Proper Circular-Arc Model
inferred← citeshttps://doi.org/10.1007/978-3-642-14165-2_33openalex-snapshot
Interval Graphs: Canonical Representation in Logspace
inferred← citeshttps://doi.org/10.1007/978-3-642-18469-7_35openalex-snapshot
Convex Polygon Intersection Graphs
inferred← citeshttps://doi.org/10.1007/s00453-009-9304-5openalex-snapshot
Linear-Time Recognition of Helly Circular-Arc Models and Graphs
inferred← citeshttps://doi.org/10.1007/s00453-010-9432-yopenalex-snapshot
A Simpler Linear-Time Recognition of Circular-Arc Graphs
inferred← citeshttps://doi.org/10.1016/j.dam.2009.01.019openalex-snapshot
The clique operator on circular-arc graphs
inferred← citeshttps://doi.org/10.1016/j.dam.2009.07.002openalex-snapshot
Certifying algorithms for recognizing proper circular-arc graphs and unit circular-arc graphs
inferred← citeshttps://doi.org/10.1016/j.dam.2022.04.024openalex-snapshot
Essential obstacles to Helly circular-arc 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.1016/j.ejc.2011.09.016openalex-snapshot
Coloring fuzzy circular interval graphs
inferred← citeshttps://doi.org/10.1016/j.jda.2007.08.001openalex-snapshot
Intersection representations of matrices by subtrees and unicycles on graphs
inferred← citeshttps://doi.org/10.1137/10080395xopenalex-snapshot
Interval Graphs: Canonical Representations in Logspace
inferred← citeshttps://doi.org/10.48550/arxiv.1403.0789openalex-snapshot
Induced Disjoint Paths in Circular-Arc Graphs in Linear Time
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.