On the public citation graph
On the k-colouring of circle-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.3230110305openalex-snapshot
Finding maximum cliques in circle graphs
inferredcites →https://doi.org/10.1002/net.3230120410openalex-snapshot
Efficient algorithms for interval graphs and circular‐arc graphs
inferredcites →https://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
inferredcites →https://doi.org/10.1016/b978-0-12-417750-5.50011-7openalex-snapshot
QUEUES, STACKS AND GRAPHS
inferredcites →https://doi.org/10.1016/s0195-6698(84)80005-0openalex-snapshot
A Characterization of Circle Graphs
inferredcites →https://doi.org/10.1109/sfcs.1985.47openalex-snapshot
Recognizing circle graphs in polynomial time
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.1145/12130.12141openalex-snapshot
Four pages are necessary and sufficient for planar graphs
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1006/jagm.2001.1206openalex-snapshot
A (2+ε)-Approximation Scheme for Minimum Domination on Circle 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-35802-0_35openalex-snapshot
Mixed Linear Layouts: Complexity, Heuristics, and Experiments
inferred← citeshttps://doi.org/10.1007/978-3-031-49272-3_11openalex-snapshot
On 3-Coloring Circle Graphs
inferred← citeshttps://doi.org/10.1007/978-3-032-11835-6_13openalex-snapshot
The Peculiarities of Extending Queue Layouts
inferred← citeshttps://doi.org/10.1007/978-3-319-07467-2_48openalex-snapshot
The Stowage Stack Minimization Problem with Zero Rehandle Constraint
inferred← citeshttps://doi.org/10.1007/978-3-319-50106-2_9openalex-snapshot
Computing NodeTrix Representations of Clustered Graphs
inferred← citeshttps://doi.org/10.1007/978-3-319-75172-6_13openalex-snapshot
A Note on Online Colouring Problems in Overlap Graphs and Their Complements
inferred← citeshttps://doi.org/10.1007/978-3-540-92182-0_78openalex-snapshot
Sorting with Complete Networks of Stacks
inferred← citeshttps://doi.org/10.1007/978-3-642-04241-6_14openalex-snapshot
K-Partite RNA Secondary Structures
inferred← citeshttps://doi.org/10.1007/978-3-642-25870-1_15openalex-snapshot
Maximum Independent Set in 2-Direction Outersegment Graphs
inferred← citeshttps://doi.org/10.1007/978-3-642-34611-8_31openalex-snapshot
Parameterized Domination in Circle Graphs
inferred← citeshttps://doi.org/10.1007/978-3-642-46908-4_50openalex-snapshot
Colouring of Spider Graphs
inferred← citeshttps://doi.org/10.1007/978-981-15-6533-5_12openalex-snapshot
Beyond Clustered Planar Graphs
inferred← citeshttps://doi.org/10.1007/jhep05(2025)235openalex-snapshot
Dirac traces and the Tutte polynomial
inferred← citeshttps://doi.org/10.1007/s00224-013-9478-8openalex-snapshot
Parameterized Domination in Circle Graphs
inferred← citeshttps://doi.org/10.1007/s00453-023-01142-yopenalex-snapshot
Upward Book Embeddability of st-Graphs: Complexity and Algorithms
inferred← citeshttps://doi.org/10.1007/s10479-012-1186-2openalex-snapshot
Tree search for the stacking problem
inferred← citeshttps://doi.org/10.1016/j.dam.2006.03.003openalex-snapshot
Approximating the minimum clique cover and other hard problems in subtree filament graphs
inferred← citeshttps://doi.org/10.1016/j.dam.2010.06.007openalex-snapshot
Sorting with networks of data structures
inferred← citeshttps://doi.org/10.1016/j.dam.2021.05.021openalex-snapshot
Revising Johnson’s table for the 21st century
inferred← citeshttps://doi.org/10.1016/j.tcs.2021.04.021openalex-snapshot
On parameterized algorithms for fixed-order book thickness with respect to the pathwidth of the vertex ordering
inferred← citeshttps://doi.org/10.1016/j.tcs.2021.05.004openalex-snapshot
Generalised online colouring problems in overlap graphs
inferred← citeshttps://doi.org/10.1016/s0166-218x(99)00245-0openalex-snapshot
Container ship stowage problem: complexity and connection to the coloring of circle graphs
inferred← citeshttps://doi.org/10.1089/cmb.2009.0119openalex-snapshot
K-Partite RNA Secondary Structures
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/43.59073openalex-snapshot
Unconstrained via minimization for topological multilayer routing
inferred← citeshttps://doi.org/10.1109/43.85735openalex-snapshot
On the k-layer planar subset and topological via minimization problems
inferred← citeshttps://doi.org/10.1111/j.1475-3995.2011.00831.xopenalex-snapshot
Heuristic search for the stacking problem
inferred← citeshttps://doi.org/10.1142/s0129054123500168openalex-snapshot
Parameterized Algorithms for Fixed-Order Book Drawing with Few Crossings Per Edge
inferred← citeshttps://doi.org/10.1145/3564246.3585122openalex-snapshot
A (1.5+ε)-Approximation Algorithm for Weighted Connectivity Augmentation
inferred← citeshttps://doi.org/10.11606/d.45.2016.tde-27012016-090223openalex-snapshot
Problemas computacionais em teoria topológica dos grafos
inferred← citeshttps://doi.org/10.1162/tacl_a_00158openalex-snapshot
Parsing to Noncrossing Dependency Graphs
inferred← citeshttps://doi.org/10.24355/dbbs.084-201103151022-0openalex-snapshot
Optimal Sorting Of Rolling Stock
inferred← citeshttps://doi.org/10.33581/2520-6508-2021-1-54-68openalex-snapshot
Графы самопересечений замкнутых ломаных
inferred← citeshttps://doi.org/10.37236/2713openalex-snapshot
The Graph Crossing Number and its Variants: A Survey
inferred← citeshttps://doi.org/10.3929/ethz-a-007017958openalex-snapshot
Optimization of Railway Operations: Algorithms, Complexity, and Models
inferred← citeshttps://doi.org/10.48550/arxiv.1201.6580openalex-snapshot
Stackable and queueable permutations
inferred← citeshttps://doi.org/10.48550/arxiv.1205.3728openalex-snapshot
Parameterized Domination in Circle Graphs
inferred← citeshttps://doi.org/10.48550/arxiv.1504.05908openalex-snapshot
Maximum Pagenumber-k Subgraph is NP-Complete
inferred← citeshttps://doi.org/10.48550/arxiv.1608.08952openalex-snapshot
Computing NodeTrix Representations of Clustered Graphs
inferred← citeshttps://doi.org/10.48550/arxiv.2112.00629openalex-snapshot
Classifying grounded intersection graphs via ordered forbidden patterns
inferred← citeshttps://doi.org/10.5555/949970.950073openalex-snapshot
On the k-layer planar subset and via minimization problems
inferred← citeshttps://doi.org/10.56294/sctconf2024898openalex-snapshot
Stack sort: a new approach with sorting network and a buffer
inferred← citeshttps://doi.org/10.7155/jgaa.00461openalex-snapshot
Computing NodeTrix Representations of Clustered Graphs
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.