On the public citation graph
Algorithms on circular‐arc graphs
0 signed · 157 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/0022-247x(70)90282-9openalex-snapshot
Triangulated graphs and the elimination process
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/tec.1959.5222697openalex-snapshot
Minimizing the Number of States in Incompletely Specified Sequential Switching Functions
inferredcites →https://doi.org/10.1137/0201013openalex-snapshot
Algorithms for Minimum Coloring, Maximum Clique, Minimum Covering by Cliques, and Maximum Independent Set of a Chordal Graph
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.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/ecjc.4430790503openalex-snapshot
An algorithm for a maximum clique of the intersection graph of isooriented rectangles on a cylinder
inferred← citeshttps://doi.org/10.1002/jgt.20442openalex-snapshot
Biclique graphs and biclique matrices
inferred← citeshttps://doi.org/10.1002/jgt.22486openalex-snapshot
Characterization and linear‐time detection of minimal obstructions to concave‐round graphs and the circular‐ones property
inferred← citeshttps://doi.org/10.1002/net.20318openalex-snapshot
Improper coloring of unit disk graphs
inferred← citeshttps://doi.org/10.1002/net.3230120410openalex-snapshot
Efficient algorithms for interval graphs and circular‐arc graphs
inferred← citeshttps://doi.org/10.1002/net.3230170402openalex-snapshot
An algorithmic framework for the matching problem in some hypergraphs
inferred← citeshttps://doi.org/10.1002/net.3230210205openalex-snapshot
Polynomial time algorithms on circular‐arc overlap graphs
inferred← citeshttps://doi.org/10.1006/jcss.1998.1572openalex-snapshot
Optimal Circular Arc Representations: Properties, Recognition, and Construction
inferred← citeshttps://doi.org/10.1007/11785293_7openalex-snapshot
A Simpler Linear-Time Recognition of Circular-Arc Graphs
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/3-540-51542-9_25openalex-snapshot
NC algorithms for circular-arc graphs
inferred← citeshttps://doi.org/10.1007/3-540-57155-8_229openalex-snapshot
Computing the all-pairs longest chains in the plane
inferred← citeshttps://doi.org/10.1007/978-1-4615-3642-0_6openalex-snapshot
RNA Secondary Structure Prediction
inferred← citeshttps://doi.org/10.1007/978-1-4757-3023-4_1openalex-snapshot
The Maximum Clique Problem
inferred← citeshttps://doi.org/10.1007/978-3-031-15914-5_17openalex-snapshot
Extending Partial Representations of Circular-Arc Graphs
inferred← citeshttps://doi.org/10.1007/978-3-031-30448-4_4openalex-snapshot
Independent Set Under a Change Constraint from an Initial Solution
inferred← citeshttps://doi.org/10.1007/978-3-319-12340-0_12openalex-snapshot
Contact Representations of Planar Graphs: Extending a Partial Representation is Hard
inferred← citeshttps://doi.org/10.1007/978-3-319-48749-6_20openalex-snapshot
Approximability of the Distance Independent Set Problem on Regular Graphs and Planar Graphs
inferred← citeshttps://doi.org/10.1007/978-3-319-53925-6_18openalex-snapshot
Approximation Algorithm for the Distance-3 Independent Set Problem on Cubic Graphs
inferred← citeshttps://doi.org/10.1007/978-3-319-68705-6_13openalex-snapshot
On H-Topological Intersection Graphs
inferred← citeshttps://doi.org/10.1007/978-3-540-77903-2_2openalex-snapshot
Routing and Capacity Optimization for IP Networks
inferred← citeshttps://doi.org/10.1007/978-3-642-02029-2_3openalex-snapshot
Algorithms on Subtree Filament Graphs
inferred← citeshttps://doi.org/10.1007/978-3-642-21934-4_5openalex-snapshot
Wireless Sensor Network’s Lifetime Maximization Problem in Case of Given Set of Covers
inferred← citeshttps://doi.org/10.1007/978-3-642-31770-5_21openalex-snapshot
Distance-d Independent Set Problems for Bipartite and Chordal Graphs
inferred← citeshttps://doi.org/10.1007/978-3-642-40313-2_56openalex-snapshot
Helly Circular-Arc Graph Isomorphism Is in Logspace
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-94-009-5315-4_8openalex-snapshot
Parameters of Partial Orders and Graphs: Packing, Covering, and Representation
inferred← citeshttps://doi.org/10.1007/978-981-15-6198-6_15openalex-snapshot
Estimating RNA Secondary Structure by Maximizing Stacking Regions
inferred← citeshttps://doi.org/10.1007/bf01190897openalex-snapshot
Efficient parallel recognition of some circular arc graphs, I
inferred← citeshttps://doi.org/10.1007/bf01202237openalex-snapshot
Two remarks on circular arc graphs
inferred← citeshttps://doi.org/10.1007/bf01299447openalex-snapshot
An exact algorithm for the maximum stable set problem
inferred← citeshttps://doi.org/10.1007/bf01415983openalex-snapshot
A branch and bound algorithm for the maximum clique problem
inferred← citeshttps://doi.org/10.1007/bf01864170openalex-snapshot
Algorithmic aspects of intersection graphs and representation hypergraphs
inferred← citeshttps://doi.org/10.1007/bf02257777openalex-snapshot
Finding maximum cliques in arbitrary and in special graphs
inferred← citeshttps://doi.org/10.1007/bf02523192openalex-snapshot
Efficient parallel recognition of some circular arc graphs, II
inferred← citeshttps://doi.org/10.1007/bf02832044openalex-snapshot
Maximum weight independent set of circular-arc graph and its application
inferred← citeshttps://doi.org/10.1007/bf03192385openalex-snapshot
Computational aspects of the Helly property: a survey
inferred← citeshttps://doi.org/10.1007/bfb0070412openalex-snapshot
Circular arc graphs: New uses and a new algorithm
inferred← citeshttps://doi.org/10.1007/pl00007243openalex-snapshot
Intersection Graphs and the Clique Operator
inferred← citeshttps://doi.org/10.1007/s00373-022-02510-1openalex-snapshot
2-Nested Matrices: Towards Understanding the Structure of Circle 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.1007/s00453-018-0410-0openalex-snapshot
Canonical Representations for Circular-Arc Graphs Using Flip Sets
inferred← citeshttps://doi.org/10.1007/s00453-021-00822-xopenalex-snapshot
Subexponential Parameterized Algorithms and Kernelization on Almost Chordal Graphs
inferred← citeshttps://doi.org/10.1007/s004939970003openalex-snapshot
List Homomorphisms and Circular Arc Graphs
inferred← citeshttps://doi.org/10.1007/s10107-005-0649-5openalex-snapshot
Independent packings in structured graphs
inferred← citeshttps://doi.org/10.1007/s10479-007-0189-xopenalex-snapshot
Algorithms for finding clique-transversals of graphs
inferred← citeshttps://doi.org/10.1007/s10878-012-9594-4openalex-snapshot
Distance- $$d$$ independent set problems for bipartite and chordal graphs
inferred← citeshttps://doi.org/10.1016/0020-0190(79)90011-5openalex-snapshot
Minimum node disjoint path covering for circular-arc graphs
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/0020-0190(84)90033-4openalex-snapshot
On a circle-cover minimization problem
inferred← citeshttps://doi.org/10.1016/0020-0190(89)90220-2openalex-snapshot
An O(n log n + m log log n) maximum weight clique algorithm for circular-arc graphs
inferred← citeshttps://doi.org/10.1016/0020-0190(90)90128-kopenalex-snapshot
A parallel algorithm for finding a maximum clique of a set of circular arcs of a circle
inferred← citeshttps://doi.org/10.1016/0020-0190(90)90209-gopenalex-snapshot
Parallel algorithms on circular-arc graphs
inferred← citeshttps://doi.org/10.1016/0095-8956(88)90038-xopenalex-snapshot
Circular-arc graphs with clique cover number two
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(92)00036-lopenalex-snapshot
Periodic assignment and graph colouring
inferred← citeshttps://doi.org/10.1016/0166-218x(92)90200-topenalex-snapshot
New clique and independent set algorithms for circle graphs
inferred← citeshttps://doi.org/10.1016/0166-218x(94)00136-2openalex-snapshot
Intersection graphs of Helly families of subtrees
inferred← citeshttps://doi.org/10.1016/0166-218x(94)90081-7openalex-snapshot
Intersection graphs of concatenable subtrees of graphs
inferred← citeshttps://doi.org/10.1016/0196-6774(84)90037-3openalex-snapshot
Fast algorithms for generating all maximal independent sets of interval, circular-arc and chordal graphs
inferred← citeshttps://doi.org/10.1016/0196-6774(88)90023-5openalex-snapshot
Stability in circular arc graphs
inferred← citeshttps://doi.org/10.1016/0196-6774(92)90012-2openalex-snapshot
Generation of maximum independent sets of a bipartite graph and maximum cliques of a circular-arc graph
inferred← citeshttps://doi.org/10.1016/j.dam.2006.03.022openalex-snapshot
Algorithms for clique-independent sets on subclasses of circular-arc graphs
inferred← citeshttps://doi.org/10.1016/j.dam.2007.08.006openalex-snapshot
3D -interval-filament 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.2012.11.005openalex-snapshot
Normal Helly circular-arc graphs and its subclasses
inferred← citeshttps://doi.org/10.1016/j.dam.2016.04.029openalex-snapshot
On neighborhood-Helly graphs
inferred← citeshttps://doi.org/10.1016/j.dam.2016.08.004openalex-snapshot
On the bend number of circular-arc graphs as edge intersection graphs of paths on a grid
inferred← citeshttps://doi.org/10.1016/j.dam.2017.01.021openalex-snapshot
Completing colored graphs to meet a target property
inferred← citeshttps://doi.org/10.1016/j.dam.2017.09.016openalex-snapshot
On polygon numbers of circle graphs and distance hereditary graphs
inferred← citeshttps://doi.org/10.1016/j.dam.2019.05.019openalex-snapshot
On some graph classes related to perfect graphs: A survey
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.dam.2023.06.013openalex-snapshot
Intersection models and forbidden pattern characterizations for 2-thin and proper 2-thin graphs
inferred← citeshttps://doi.org/10.1016/j.dam.2025.07.022openalex-snapshot
Contractions in perfect graphs
inferred← citeshttps://doi.org/10.1016/j.disc.2003.05.001openalex-snapshot
Induced matchings in intersection graphs
inferred← citeshttps://doi.org/10.1016/j.disc.2007.12.054openalex-snapshot
Partial characterizations of clique-perfect graphs II: Diamond-free and 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.disc.2011.11.036openalex-snapshot
Finding intersection models: From chordal to Helly circular-arc graphs
inferred← citeshttps://doi.org/10.1016/j.disc.2026.115108openalex-snapshot
New vertex ordering characterizations of circular-arc bigraphs
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.2005.05.014openalex-snapshot
Partial characterizations of clique-perfect graphs
inferred← citeshttps://doi.org/10.1016/j.endm.2005.06.022openalex-snapshot
Improper Colourings of Unit Disk Graphs
inferred← citeshttps://doi.org/10.1016/j.endm.2005.06.026openalex-snapshot
Characterization and recognition of Helly circular-arc clique-perfect graphs
inferred← citeshttps://doi.org/10.1016/j.endm.2005.06.083openalex-snapshot
Colouring Some Classes of Perfect Graphs Robustly
inferred← citeshttps://doi.org/10.1016/j.endm.2010.05.142openalex-snapshot
Balancedness of some subclasses of circular-arc graphs
inferred← citeshttps://doi.org/10.1016/j.endm.2015.07.042openalex-snapshot
On the bend number of circular-arc graphs as edge intersection graphs of paths on a grid
inferred← citeshttps://doi.org/10.1016/j.ic.2016.01.006openalex-snapshot
On the isomorphism problem for Helly circular-arc graphs
inferred← citeshttps://doi.org/10.1016/j.ic.2017.01.008openalex-snapshot
Unit interval editing is fixed-parameter tractable
inferred← citeshttps://doi.org/10.1016/j.ic.2024.105211openalex-snapshot
Modification problems toward proper (Helly) circular-arc graphs
inferred← citeshttps://doi.org/10.1016/j.jalgor.2004.08.003openalex-snapshot
Polynomial time recognition of unit circular-arc 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.1016/j.procs.2021.11.028openalex-snapshot
Intersection models for 2-thin and proper 2-thin graphs
inferred← citeshttps://doi.org/10.1016/j.tcs.2012.02.031openalex-snapshot
Pivots, determinants, and perfect matchings of graphs
inferred← citeshttps://doi.org/10.1016/s0012-365x(02)00578-2openalex-snapshot
Restricted circular-arc graphs and clique cycles
inferred← citeshttps://doi.org/10.1016/s0020-0190(00)00025-9openalex-snapshot
Maximum weight independent sets and cliques in intersection graphs of filaments
inferred← citeshttps://doi.org/10.1016/s0166-218x(00)00309-7openalex-snapshot
An approximation result for a periodic allocation problem
inferred← citeshttps://doi.org/10.1016/s0166-218x(99)00159-6openalex-snapshot
Algorithmic aspects of clique-transversal and clique-independent sets
inferred← citeshttps://doi.org/10.1016/s1571-0653(05)80122-2openalex-snapshot
Induced Matchings in Intersection Graphs
inferred← citeshttps://doi.org/10.1051/ro/2011112openalex-snapshot
Algorithms for recognizing bipartite-Helly and bipartite-conformal hypergraphs,
inferred← citeshttps://doi.org/10.1080/00207168208803311openalex-snapshot
Determining the number of internal stability of a graph
inferred← citeshttps://doi.org/10.1080/00207168308803357openalex-snapshot
An algorithm for the maximum internally stable set in a weighted graph
inferred← citeshttps://doi.org/10.1080/01495739708941428openalex-snapshot
COMPUTING MAXIMUM CLIQUES OF CIRCULAR ARCS IN PARALLEL*
inferred← citeshttps://doi.org/10.1080/02522667.1989.10698985openalex-snapshot
Using Fifth Generation Tools for Solving the Clique Number Problem
inferred← citeshttps://doi.org/10.1090/conm/342/06137openalex-snapshot
Coloring intersection graphs of geometric figures with a given clique number
inferred← citeshttps://doi.org/10.1109/71.491584openalex-snapshot
Graph isomorphism and identification matrices: parallel algorithms
inferred← citeshttps://doi.org/10.1109/72.80251openalex-snapshot
Parallel algorithms for finding a near-maximum independent set of a circle graph
inferred← citeshttps://doi.org/10.1109/icci.1992.227707openalex-snapshot
An optimal algorithm for finding maximum induced bipartite subgraphs of circular-arc graphs
inferred← citeshttps://doi.org/10.1109/icisce.2016.33openalex-snapshot
A Stochastic Neuron Model for Finding a Near-Maximum Independent Set of a Circle Graph
inferred← citeshttps://doi.org/10.1109/secon.1991.147822openalex-snapshot
NC algorithms for finding depth-first-search trees in interval graphs and circular-arc graphs
inferred← citeshttps://doi.org/10.1109/secon.1992.202301openalex-snapshot
A parallel algorithm for maximum independent set of a circular-arc graph
inferred← citeshttps://doi.org/10.1109/soac.1991.143921openalex-snapshot
On the problem of finding all maximum weight independent sets in interval and circular-arc graphs
inferred← citeshttps://doi.org/10.1137/0209001openalex-snapshot
An Efficient Test for Circular-Arc Graphs
inferred← citeshttps://doi.org/10.1137/0214018openalex-snapshot
Maximum Weight Clique Algorithms for Circular-Arc Graphs and Circle Graphs
inferred← citeshttps://doi.org/10.1137/0217003openalex-snapshot
An Optimal Algorithm for Finding a Maximum Independent Set of a Circular-Arc Graph
inferred← citeshttps://doi.org/10.1137/0601025openalex-snapshot
The Complexity of Coloring Circular Arcs and Chords
inferred← citeshttps://doi.org/10.1137/0602012openalex-snapshot
An $O(n^2 )$ Algorithm for Coloring Proper Circular Arc Graphs
inferred← citeshttps://doi.org/10.1137/1.9781611974782.179openalex-snapshot
An Efficient Representation for Filtrations of Simplicial Complexes
inferred← citeshttps://doi.org/10.1137/s0097539792238431openalex-snapshot
Efficient Algorithms for the Domination Problems on Interval and Circular-Arc Graphs
inferred← citeshttps://doi.org/10.1137/s0097539793260726openalex-snapshot
$O(M\cdot N)$ Algorithms for the Recognition and Isomorphism Problems on Circular-Arc Graphs
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.1142/s0218195995000155openalex-snapshot
COMPUTING THE ALL-PAIRS LONGEST CHAINS IN THE PLANE
inferred← citeshttps://doi.org/10.1142/s1793830922501476openalex-snapshot
Maximum max-k-clique subgraphs in cactus subtree graphs
inferred← citeshttps://doi.org/10.1145/3229146openalex-snapshot
An Efficient Representation for Filtrations of Simplicial Complexes
inferred← citeshttps://doi.org/10.1145/327164.327204openalex-snapshot
Efficient parallel algorithms for finding biconnected components of some intersection graphs
inferred← citeshttps://doi.org/10.1287/moor.12.3.522openalex-snapshot
On the Maximum Weight Clique Problem
inferred← citeshttps://doi.org/10.1541/ieejeiss.125.314openalex-snapshot
Maximum Neural Network with Nonlinear Self-Feedback and Its Application to Maximum Independent Set Problem
inferred← citeshttps://doi.org/10.1587/transfun.2021dmp0017openalex-snapshot
Approximability of the Distance Independent Set Problem on Regular Graphs and Planar Graphs
inferred← citeshttps://doi.org/10.1587/transinf.2021edp7175openalex-snapshot
A Polynomial-Time Algorithm for Finding a Spanning Tree with Non-Terminal Set VNT on Circular-Arc Graphs
inferred← citeshttps://doi.org/10.1590/s0104-65002006000200002openalex-snapshot
Computational aspects of the Helly property: a survey
inferred← citeshttps://doi.org/10.18130/v37t14openalex-snapshot
A Spectrum Allocation and Auction Mechanism With The Maximum Weighed Independent Set
inferred← citeshttps://doi.org/10.37236/38openalex-snapshot
Complexity Aspects of the Helly Property: Graphs and Hypergraphs
inferred← citeshttps://doi.org/10.46298/dmtcs.2100openalex-snapshot
Balancedness of subclasses of circular-arc graphs
inferred← citeshttps://doi.org/10.46298/dmtcs.387openalex-snapshot
Complexity results on graphs with few cliques
inferred← citeshttps://doi.org/10.46298/dmtcs.451openalex-snapshot
On economical set representations of graphs
inferred← citeshttps://doi.org/10.46298/dmtcs.625openalex-snapshot
Isomorphism of graph classes related to the circular-ones property
inferred← citeshttps://doi.org/10.48550/arxiv.1203.4822openalex-snapshot
Isomorphism of graph classes related to the circular-ones property
inferred← citeshttps://doi.org/10.48550/arxiv.1706.00575openalex-snapshot
Combinatorial Problems on $H$-graphs
inferred← citeshttps://doi.org/10.5555/313559.313637openalex-snapshot
An O(n2 algorithm for circular-arc graph recognition
inferred← citeshttps://doi.org/10.71889/5fylantbak.29865629openalex-snapshot
Maximum Independent Set And Maximum Induced Matching Problems For Competitive Programming
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.