On the public citation graph

An algorithm for the multiple common subgraph problem

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.
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 points at this work

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

inferred← citeshttps://doi.org/10.1002/1096-987x(20010130)22:2<255::aid-jcc12>3.0.co;2-2openalex-snapshot
TGSA: A molecular superposition program based on topo-geometrical considerations
inferred← citeshttps://doi.org/10.1002/9780470125847.ch1openalex-snapshot
Similarity Searching in Databases of Chemical Structures
inferred← citeshttps://doi.org/10.1002/9780470125908.ch6openalex-snapshot
Structure Diagram Generation
inferred← citeshttps://doi.org/10.1002/chin.200706210openalex-snapshot
Basic Overview of Chemoinformatics.
inferred← citeshttps://doi.org/10.1007/3-540-44522-6_28openalex-snapshot
A New Error-Correcting Distance for Attributed Relational Graph Problems
inferred← citeshttps://doi.org/10.1007/3-540-47764-0_3openalex-snapshot
Using Slicing to Identify Duplication in Source Code
inferred← citeshttps://doi.org/10.1007/3-540-58672-5_25openalex-snapshot
Identification of structural similarity of organic molecules
inferred← citeshttps://doi.org/10.1007/978-3-540-24587-2_8openalex-snapshot
Finding the Maximum Common Subgraph of a Partial k-Tree and a Graph with a Polynomially Bounded Number of Spanning Trees
inferred← citeshttps://doi.org/10.1007/978-3-642-57273-9_2openalex-snapshot
Quantum objects, density functions and molecular quantum similarity measures
inferred← citeshttps://doi.org/10.1007/978-94-015-8488-3_12openalex-snapshot
Detection of the Largest Patterns Common to a Set of Molecules, Using 2D Graphs and 3D Skeletons
inferred← citeshttps://doi.org/10.1016/0263-7855(95)00034-4openalex-snapshot
Navigator: Tools for informal structure-activity relationship discovery
inferred← citeshttps://doi.org/10.1016/b978-0-12-809633-8.20195-7openalex-snapshot
Chemical Similarity and Substructure Searches
inferred← citeshttps://doi.org/10.1016/b978-0-323-95502-7.00048-8openalex-snapshot
Chemical Similarity and Substructure Searches
inferred← citeshttps://doi.org/10.1016/j.ipl.2004.06.019openalex-snapshot
Finding the maximum common subgraph of a partial k-tree and a graph with a polynomially bounded number of spanning trees
inferred← citeshttps://doi.org/10.1016/j.tcs.2008.12.060openalex-snapshot
On parameterized complexity of the Multi-MCS problem
inferred← citeshttps://doi.org/10.1021/acs.jcim.6b00546openalex-snapshot
ArbAlign: A Tool for Optimal Alignment of Arbitrarily Ordered Isomers Using the Kuhn–Munkres Algorithm
inferred← citeshttps://doi.org/10.1021/ci0103875openalex-snapshot
Generation and Display of Activity-Weighted Chemical Hyperstructures
inferred← citeshttps://doi.org/10.1021/ci020017wopenalex-snapshot
The Maximum Common Substructure as a Molecular Depiction in a Supervised Classification Context: Experiments in Quantitative Structure/Biodegradability Relationships
inferred← citeshttps://doi.org/10.1021/ci100219fopenalex-snapshot
How Different Are Two Chemical Structures?
inferred← citeshttps://doi.org/10.1021/ci600234zopenalex-snapshot
Basic Overview of Chemoinformatics
inferred← citeshttps://doi.org/10.1021/ci900092yopenalex-snapshot
Using Tversky Similarity Searches for Core Hopping: Finding the Needles in the Haystack
inferred← citeshttps://doi.org/10.1021/ci950169+openalex-snapshot
Stigmata: An Algorithm To Determine Structural Commonalities in Diverse Datasets
inferred← citeshttps://doi.org/10.1021/ci9601675openalex-snapshot
EMCSS: A New Method for Maximal Common Substructure Search
inferred← citeshttps://doi.org/10.1021/ci980044fopenalex-snapshot
A Method for Visualizing Recurrent Topological Substructures in Sets of Active Molecules
inferred← citeshttps://doi.org/10.1021/jm010535iopenalex-snapshot
Data Analysis of High-Throughput Screening Results: Application of Multidomain Clustering to the NCI Anti-HIV Data Set
inferred← citeshttps://doi.org/10.1023/a:1021271615909openalex-snapshot
Maximum common subgraph isomorphism algorithms for the matching of chemical structures
inferred← citeshttps://doi.org/10.1063/1.3231134openalex-snapshot
The discovery of unexpected isomers in sodium heptamers by Born–Oppenheimer molecular dynamics
inferred← citeshttps://doi.org/10.1089/153623103322006625openalex-snapshot
Whither Biological Database Research?
inferred← citeshttps://doi.org/10.1109/iv.2005.11openalex-snapshot
A Novel Efficient Algorithm for Determining Maximum Common Subgraphs
inferred← citeshttps://doi.org/10.1109/tcad.2002.805722openalex-snapshot
SubIslands: the probabilistic match assignment algorithm for subcircuit recognition
inferred← citeshttps://doi.org/10.1145/1014052.1014088openalex-snapshot
Scalable mining of large disk-based graph databases
inferred← citeshttps://doi.org/10.1145/1081870.1081898openalex-snapshot
On mining cross-graph quasi-cliques
inferred← citeshttps://doi.org/10.1145/1341811.1341820openalex-snapshot
Concurrency in a decentralized automatic regression test selection framework for web services
inferred← citeshttps://doi.org/10.1145/1368088.1368172openalex-snapshot
Clone detection in automotive model-based development
inferred← citeshttps://doi.org/10.1145/1460797.1460799openalex-snapshot
Mining frequent cross-graph quasi-cliques
inferred← citeshttps://doi.org/10.1201/9780203913390.ch19openalex-snapshot
Substructure and Maximal Common Substructure Searching
inferred← citeshttps://doi.org/10.1201/b10835-10openalex-snapshot
Density Functional Calculations of Metal Clusters
inferred← citeshttps://doi.org/10.1201/b10835-12openalex-snapshot
Exploring the Borderland between Physics and Chemistry
inferred← citeshttps://doi.org/10.1504/ijwgs.2014.058760openalex-snapshot
Modelling and exploring historical records to facilitate service composition
inferred← citeshttps://doi.org/10.34626/xva4-2h17openalex-snapshot
Automatic plan generation and adaptation by observation : supporting complex human planning
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.