On the public citation graph
An $O(n^2 )$ Algorithm for Coloring Proper Circular Arc Graphs
0 signed · 59 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.3230030305openalex-snapshot
Algorithms for a maximum clique and a maximum independent set of a circle graph
inferredcites →https://doi.org/10.1002/net.3230040407openalex-snapshot
Algorithms on circular‐arc graphs
inferredcites →https://doi.org/10.1016/0020-0190(79)90011-5openalex-snapshot
Minimum node disjoint path covering for circular-arc graphs
inferredcites →https://doi.org/10.1016/s0012-365x(74)80027-0openalex-snapshot
Structure theorems for some circular-arc graphs
inferredcites →https://doi.org/10.1137/0209001openalex-snapshot
An Efficient Test for Circular-Arc Graphs
inferredcites →https://doi.org/10.1137/0601025openalex-snapshot
The Complexity of Coloring Circular Arcs and Chords
inferredcites →https://doi.org/10.1287/opre.28.5.1074openalex-snapshot
Cyclic Scheduling via Integer Programs with Circular Ones
inferredcites →https://doi.org/10.2140/pjm.1971.39.535openalex-snapshot
Matrix characterizations of circular-arc 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/(sici)1097-0118(200004)33:4<256::aid-jgt7>3.0.co;2-2openalex-snapshot
The round-up property of the fractional chromatic number for proper circular arc graphs
inferred← citeshttps://doi.org/10.1002/cta.4490200304openalex-snapshot
Foreground memory management in data path synthesis
inferred← citeshttps://doi.org/10.1002/jgt.22146openalex-snapshot
On the structure of (pan, even hole)‐free graphs
inferred← citeshttps://doi.org/10.1007/11922377_6openalex-snapshot
Scheduling of a Smart Antenna: Capacitated Coloring of Unit Circular-Arc Graphs
inferred← citeshttps://doi.org/10.1007/3-540-55210-3_199openalex-snapshot
The complexity of colouring circle graphs
inferred← citeshttps://doi.org/10.1007/978-3-030-19212-9_22openalex-snapshot
Optimality Clue for Graph Coloring Problem
inferred← citeshttps://doi.org/10.1007/978-3-662-25209-3_12openalex-snapshot
Periodic Multiprocessor Scheduling
inferred← citeshttps://doi.org/10.1007/978-94-009-5315-4_11openalex-snapshot
Issues in the Theory of Uniqueness in Measurement
inferred← citeshttps://doi.org/10.1007/bf01097528openalex-snapshot
Representations of graphs and networks (coding, layouts and embeddings)
inferred← citeshttps://doi.org/10.1007/bf01190897openalex-snapshot
Efficient parallel recognition of some circular arc graphs, I
inferred← citeshttps://doi.org/10.1007/bf01864170openalex-snapshot
Algorithmic aspects of intersection graphs and representation hypergraphs
inferred← citeshttps://doi.org/10.1007/bf02523192openalex-snapshot
Efficient parallel recognition of some circular arc graphs, II
inferred← citeshttps://doi.org/10.1007/bfb0035103openalex-snapshot
Periodic multiprocessor scheduling
inferred← citeshttps://doi.org/10.1007/bfb0053971openalex-snapshot
Approximating circular arc colouring and bandwidth allocation in all-optical ring networks
inferred← citeshttps://doi.org/10.1007/s10878-005-1411-xopenalex-snapshot
Perfect Circular Arc Coloring
inferred← citeshttps://doi.org/10.1016/0012-365x(85)90039-1openalex-snapshot
Interval graphs and related topics
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/0020-0190(83)90078-9openalex-snapshot
Finding Hamiltonian circuits in proper interval graphs
inferred← citeshttps://doi.org/10.1016/0166-218x(85)90025-3openalex-snapshot
Dominating sets and domatic number of circular arc graphs
inferred← citeshttps://doi.org/10.1016/0166-218x(87)90068-0openalex-snapshot
Some parallel algorithms on interval graphs
inferred← citeshttps://doi.org/10.1016/0166-218x(89)90011-5openalex-snapshot
An O(n1.5) algorithm to color proper circular arcs
inferred← citeshttps://doi.org/10.1016/0166-218x(92)00036-lopenalex-snapshot
Periodic assignment and graph colouring
inferred← citeshttps://doi.org/10.1016/0196-6774(85)90012-4openalex-snapshot
The NP-completeness column: an ongoing guide
inferred← citeshttps://doi.org/10.1016/0196-6774(86)90020-9openalex-snapshot
The NP-completeness column: An ongoing guide
inferred← citeshttps://doi.org/10.1016/0196-6774(88)90023-5openalex-snapshot
Stability in circular arc graphs
inferred← citeshttps://doi.org/10.1016/j.dam.2005.10.008openalex-snapshot
Precoloring extension on unit interval graphs
inferred← citeshttps://doi.org/10.1016/j.dam.2009.04.020openalex-snapshot
Minimum sum edge colorings of multicycles
inferred← citeshttps://doi.org/10.1016/j.ejc.2008.07.024openalex-snapshot
Hadwiger’s conjecture for proper circular arc graphs
inferred← citeshttps://doi.org/10.1016/j.endm.2004.03.035openalex-snapshot
On a packet scheduling problem for smart antennas and polyhedra defined by circular-ones matrices
inferred← citeshttps://doi.org/10.1016/j.sysarc.2015.06.002openalex-snapshot
Message scheduling for real-time interprocessor communication
inferred← citeshttps://doi.org/10.1016/s0020-0255(98)10081-6openalex-snapshot
Jump number maximization for proper interval graphs and series—parallel graphs
inferred← citeshttps://doi.org/10.1016/s0304-3975(99)00152-8openalex-snapshot
The complexity of path coloring and call scheduling
inferred← citeshttps://doi.org/10.1016/s0377-2217(01)00058-3openalex-snapshot
Circular-arc graph coloring: On chords and circuits in the meeting graph
inferred← citeshttps://doi.org/10.1016/s1571-0653(04)00259-8openalex-snapshot
Revisiting Tucker's Algorithm to Color Circular-Arc Graphs
inferred← citeshttps://doi.org/10.1080/01495739708941428openalex-snapshot
COMPUTING MAXIMUM CLIQUES OF CIRCULAR ARCS IN PARALLEL*
inferred← citeshttps://doi.org/10.1109/edac.1992.205919openalex-snapshot
Transfer free register allocation in cyclic data flow graphs
inferred← citeshttps://doi.org/10.1109/iscit.2009.5341284openalex-snapshot
On perimeter coverage scheduling in wireless sensor networks
inferred← citeshttps://doi.org/10.1109/proc.1980.11899openalex-snapshot
Frequency assignment: Theory and applications
inferred← citeshttps://doi.org/10.1137/0402049openalex-snapshot
A Mathematical Model for Periodic Scheduling Problems
inferred← citeshttps://doi.org/10.1137/s0097539700382157openalex-snapshot
Revisiting Tucker's Algorithm to Color Circular Arc Graphs
inferred← citeshttps://doi.org/10.1137/s0097539792269095openalex-snapshot
Linear-Time Representation Algorithms for Proper Circular-Arc Graphs and Proper Interval Graphs
inferred← citeshttps://doi.org/10.1137/s089548010343569xopenalex-snapshot
Integer Decomposition for Polyhedra Defined by Nearly Totally Unimodular Matrices
inferred← citeshttps://doi.org/10.1137/s0895480192242754openalex-snapshot
A Linear Algorithm for Maximum Weight Cliques in Proper Circular Arc Graphs
inferred← citeshttps://doi.org/10.1155/2010/926075openalex-snapshot
Perimeter Coverage Scheduling in Wireless Sensor Networks Using Sensors with a Single Continuous Cover Range
inferred← citeshttps://doi.org/10.1287/opre.30.4.760openalex-snapshot
Minimizing the Number of Vehicles to Meet a Fixed Periodic Schedule: An Application of Periodic Posets
inferred← citeshttps://doi.org/10.29020/nybg.ejpam.v15i4.4574openalex-snapshot
Acyclic and Star Coloring of Powers of Paths and Cycles
inferred← citeshttps://doi.org/10.3929/ethz-a-004832472openalex-snapshot
On the design and operation of high-performance optical networks
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.