On the public citation graph

Algorithmic aspects of intersection graphs and representation hypergraphs

https://doi.org/10.1007/bf01864170
0 signed · 83 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/net.3230040407openalex-snapshot
Algorithms on circular‐arc graphs
inferredcites →https://doi.org/10.1002/net.3230120410openalex-snapshot
Efficient algorithms for interval graphs and circular‐arc graphs
inferredcites →https://doi.org/10.1002/net.3230130302openalex-snapshot
I‐Colorings, I‐Phasings, and I‐Intersection assignments for graphs, and their applications
inferredcites →https://doi.org/10.1002/net.3230130306openalex-snapshot
An algorithm for constructing edge‐trees from hypergraphs
inferredcites →https://doi.org/10.1007/3-540-12727-5_3openalex-snapshot
Acyclic database schemes (of various degrees): A painless introduction
inferredcites →https://doi.org/10.1007/978-1-4612-1098-6openalex-snapshot
Computational Geometry
inferredcites →https://doi.org/10.1016/0012-365x(74)90002-8openalex-snapshot
A characterisation of rigid circuit graphs
inferredcites →https://doi.org/10.1016/0012-365x(78)90003-1openalex-snapshot
A recognition algorithm for the intersection graphs of paths in trees
inferredcites →https://doi.org/10.1016/0012-365x(78)90154-1openalex-snapshot
Hypergraphes arbores
inferredcites →https://doi.org/10.1016/0012-365x(82)90184-4openalex-snapshot
The asymptotic probability that a random graph is a unit interval graph, indifference graph, or proper interval graph
inferredcites →https://doi.org/10.1016/0012-365x(83)90018-3openalex-snapshot
Hypergraphes de chaines d'aretes d'un arbre
inferredcites →https://doi.org/10.1016/0012-365x(83)90019-5openalex-snapshot
Comparability graphs and intersection graphs
inferredcites →https://doi.org/10.1016/0012-365x(84)90006-2openalex-snapshot
Circular representation problem on hypergraphs
inferredcites →https://doi.org/10.1016/0012-365x(85)90039-1openalex-snapshot
Interval graphs and related topics
inferredcites →https://doi.org/10.1016/0012-365x(85)90043-3openalex-snapshot
Edge and vertex intersection of paths in a tree
inferredcites →https://doi.org/10.1016/0012-365x(85)90052-4openalex-snapshot
An O(qn) algorithm to q-color a proper family of circular arcs
inferredcites →https://doi.org/10.1016/0022-247x(70)90282-9openalex-snapshot
Triangulated graphs and the elimination process
inferredcites →https://doi.org/10.1016/0022-247x(78)90053-7openalex-snapshot
A note on perfect Gaussian elimination
inferredcites →https://doi.org/10.1016/0095-8956(74)90094-xopenalex-snapshot
The intersection graphs of subtrees in trees are exactly the chordal graphs
inferredcites →https://doi.org/10.1016/0095-8956(77)90049-1openalex-snapshot
Comparability graphs and a new matroid
inferredcites →https://doi.org/10.1016/0095-8956(85)90088-7openalex-snapshot
The edge intersection graphs of paths in a tree
inferredcites →https://doi.org/10.1016/0095-8956(86)90042-0openalex-snapshot
Intersection graphs of paths in a tree
inferredcites →https://doi.org/10.1016/0166-218x(84)90016-7openalex-snapshot
Tolerance graphs
inferredcites →https://doi.org/10.1016/0166-218x(84)90080-5openalex-snapshot
Chronological orderings of interval graphs
inferredcites →https://doi.org/10.1016/0167-6377(81)90018-3openalex-snapshot
An application of vertex packing to data analysis in the evaluation of pavement deterioration
inferredcites →https://doi.org/10.1016/0167-6423(84)90013-3openalex-snapshot
The theory of relational databases
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/0196-6774(88)90023-5openalex-snapshot
Stability in circular arc graphs
inferredcites →https://doi.org/10.1016/0303-2647(82)90010-7openalex-snapshot
Computer-assisted sequencing, interval graphs, and molecular evolution
inferredcites →https://doi.org/10.1016/0771-050x(80)90036-4openalex-snapshot
Algorithmic graph theory and perfect 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.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/s0167-5060(04)x8001-8openalex-snapshot
Algorithmic Graph Theory and Perfect Graphs
inferredcites →https://doi.org/10.1016/s0304-0208(08)72924-4openalex-snapshot
Classical Perfect Graphs
inferredcites →https://doi.org/10.1016/s0304-0208(08)72942-6openalex-snapshot
Algorithmic Aspects of Perfect Graphs
inferredcites →https://doi.org/10.1016/s0924-6509(09)x7013-3openalex-snapshot
Graphs and Hypergraphs
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.1090/s0002-9904-1970-12628-3openalex-snapshot
Characterizing circular-arc graphs
inferredcites →https://doi.org/10.1090/s0002-9939-1960-0117173-5openalex-snapshot
An Algorithm for Determining Whether a Given Binary Matroid is Graphic
inferredcites →https://doi.org/10.1090/s0002-9939-1976-0417001-6openalex-snapshot
The Dimension of a Comparability Graph
inferredcites →https://doi.org/10.1090/s0002-9947-1982-0662044-8openalex-snapshot
Counting Interval Graphs
inferredcites →https://doi.org/10.1108/ir.1999.04926fae.001openalex-snapshot
Lecture Notes in Computer Science 1205
inferredcites →https://doi.org/10.1109/sfcs.1980.7openalex-snapshot
A polynomial time algorithm for optimal routing around a rectangle
inferredcites →https://doi.org/10.1109/sfcs.1985.47openalex-snapshot
Recognizing circle graphs in polynomial time
inferredcites →https://doi.org/10.1111/j.1749-6632.1989.tb22452.xopenalex-snapshot
Containment Graphs, Posets, and Related Classes of Graphs
inferredcites →https://doi.org/10.1137/0129040openalex-snapshot
Coloring a Family of Circular Arcs
inferredcites →https://doi.org/10.1137/0205021openalex-snapshot
Algorithmic Aspects of Vertex Elimination on Graphs
inferredcites →https://doi.org/10.1137/0209001openalex-snapshot
An Efficient Test for Circular-Arc Graphs
inferredcites →https://doi.org/10.1137/0213035openalex-snapshot
Simple Linear-Time Algorithms to Test Chordality of Graphs, Test Acyclicity of Hypergraphs, and Selectively Reduce Acyclic Hypergraphs
inferredcites →https://doi.org/10.1137/0214018openalex-snapshot
Maximum Weight Clique Algorithms for Circular-Arc Graphs and Circle Graphs
inferredcites →https://doi.org/10.1137/0214048openalex-snapshot
On Comparability and Permutation Graphs
inferredcites →https://doi.org/10.1137/0601025openalex-snapshot
The Complexity of Coloring Circular Arcs and Chords
inferredcites →https://doi.org/10.1137/0602012openalex-snapshot
An $O(n^2 )$ Algorithm for Coloring Proper Circular Arc Graphs
inferredcites →https://doi.org/10.1137/0603036openalex-snapshot
The Complexity of the Partial Order Dimension Problem
inferredcites →https://doi.org/10.1145/2157.322405openalex-snapshot
Syntactic Characterization of Tree Database Schemas
inferredcites →https://doi.org/10.1145/2402.322389openalex-snapshot
On the Desirability of Acyclic Database Schemes
inferredcites →https://doi.org/10.1145/2402.322390openalex-snapshot
Degrees of acyclicity for hypergraphs and relational database schemes
inferredcites →https://doi.org/10.1145/321707.321710openalex-snapshot
Permutation Graphs and Transitive Graphs
inferredcites →https://doi.org/10.1145/872732.806957openalex-snapshot
Automatic storage optimization
inferredcites →https://doi.org/10.1145/989393.989398openalex-snapshot
Automatic storage optimization
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/2322080openalex-snapshot
Discrete Mathematical Models with Applications to Social, Biological, and Environmental Problems.
inferredcites →https://doi.org/10.2307/2371374openalex-snapshot
Partially Ordered Sets
inferredcites →https://doi.org/10.4153/cjm-1964-055-5openalex-snapshot
A Characterization of Comparability Graphs and of Interval Graphs
inferredcites →https://doi.org/10.4153/cjm-1971-016-5openalex-snapshot
Transitive Orientation of Graphs and Identification of Permutation Graphs

What points at this work

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

inferred← citeshttps://doi.org/10.1007/3-540-57899-4_56openalex-snapshot
Dually chordal graphs
inferred← citeshttps://doi.org/10.1007/978-3-032-04700-7_22openalex-snapshot
Simultaneous Contact Representations of Planar Graphs
inferred← citeshttps://doi.org/10.1007/978-3-322-94689-8_8openalex-snapshot
Graphen und Hypergraphen mit Baumstruktur
inferred← citeshttps://doi.org/10.1007/978-3-642-15369-3_20openalex-snapshot
Approximation Algorithms for Intersection Graphs
inferred← citeshttps://doi.org/10.1007/bf01097528openalex-snapshot
Representations of graphs and networks (coding, layouts and embeddings)
inferred← citeshttps://doi.org/10.1007/s003730050028openalex-snapshot
Complexity and Algorithms for Graph and Hypergraph Sandwich Problems
inferred← citeshttps://doi.org/10.1007/s00453-012-9671-1openalex-snapshot
Approximation Algorithms for Intersection Graphs
inferred← citeshttps://doi.org/10.1007/s10817-012-9272-3openalex-snapshot
Set Graphs. III. Proof Pearl: Claw-Free Graphs Mirrored into Transitive Hereditarily Finite Sets
inferred← citeshttps://doi.org/10.1016/0166-218x(88)90032-7openalex-snapshot
Trapezoid graphs and their coloring
inferred← citeshttps://doi.org/10.1016/0196-6774(88)90023-5openalex-snapshot
Stability in circular arc 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/s0012-365x(03)00321-2openalex-snapshot
Difference graphs
inferred← citeshttps://doi.org/10.1016/s0024-3795(97)10075-1openalex-snapshot
Matrix sandwich problems
inferred← citeshttps://doi.org/10.1016/s0167-5060(04)80062-1openalex-snapshot
Epilogue 2004
inferred← citeshttps://doi.org/10.1137/s0895480193253415openalex-snapshot
Dually Chordal Graphs
inferred← citeshttps://doi.org/10.1201/b16132-66openalex-snapshot
Tolerance 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.