On the public citation graph
Breaking the Hegemony of the Triangle Method in Clique Detection
0 signed · 22 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.1006/jcom.1998.0476openalex-extracted
Fast Rectangular Matrix Multiplication and Applications
inferredcites →https://doi.org/10.1007/11427186_54openalex-extracted
Finding, Counting and Listing All Triangles in Large Graphs, an Experimental Study
inferredcites →https://doi.org/10.1007/3-540-60618-1_62openalex-extracted
Finding and counting small induced subgraphs efficiently
inferredcites →https://doi.org/10.1007/bf01940874openalex-extracted
Derandomization, witnesses for Boolean matrix multiplication and construction of perfect hash functions
inferredcites →https://doi.org/10.1016/j.tcs.2004.05.009openalex-extracted
On the complexity of fixed parameter clique and dominating set
inferredcites →https://doi.org/10.1016/j.tcs.2015.09.001openalex-extracted
Induced subgraph isomorphism: Are some patterns substantially easier than others?
inferredcites →https://doi.org/10.1016/s0020-0190(00)00047-8openalex-extracted
Finding and counting small induced subgraphs efficiently
inferredcites →https://doi.org/10.1093/bioinformatics/btn163openalex-extracted
Biomolecular network motif counting and discovery by color coding
inferredcites →https://doi.org/10.1109/focs.2012.80openalex-extracted
Faster Algorithms for Rectangular Matrix Multiplication
inferredcites →https://doi.org/10.1137/0207033openalex-extracted
Finding a Minimum Circuit in a Graph
inferredcites →https://doi.org/10.1137/1.9781611973730.111openalex-extracted
Finding Four-Node Subgraphs in Triangle Time
inferredcites →https://doi.org/10.1137/1.9781611975031.67openalex-extracted
Improved Rectangular Matrix Multiplication using Powers of the Coppersmith-Winograd Tensor
inferredcites →https://doi.org/10.1137/1.9781611976465.32openalex-extracted
A Refined Laser Method and Faster Matrix Multiplication
inferredcites →https://doi.org/10.1137/110859798openalex-extracted
Counting and Detecting Small Subgraphs via Equations
inferredcites →https://doi.org/10.1137/140978211openalex-extracted
Detecting and Counting Small Pattern Graphs
inferredcites →https://doi.org/10.1137/20m1335054openalex-extracted
Graph Pattern Detection: Hardness for all Induced Patterns and Faster Noninduced Cycles
inferredcites →https://doi.org/10.1145/1640457.1640458openalex-extracted
Automatic design of application-specific reconfigurable processor extensions with UPaK synthesis kernel
inferredcites →https://doi.org/10.4230/lipics.isaac.2017.39openalex-extracted
Dominance Product and High-Dimensional Closest Pair under L_infty
inferredcites →https://doi.org/10.46298/theoretics.24.21openalex-extracted
A Refined Laser Method and Faster Matrix Multiplication
inferredcites →https://doi.org/10.5555/2133036.2133150openalex-extracted
Counting and detecting small subgraphs via equations and matrix multiplication
inferredcites →https://doi.org/10.5555/2722129.2722240openalex-extracted
Finding four-node subgraphs in triangle time
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.