On the public citation graph
Finding the Smallest H-Subgraph in Real Weighted Graphs and Related Problems
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.
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.1997.0438openalex-snapshot
Rectangular Matrix Multiplication Revisited
inferredcites →https://doi.org/10.1006/jcom.1998.0476openalex-snapshot
Fast Rectangular Matrix Multiplication and Applications
inferredcites →https://doi.org/10.1006/jcss.1995.1078openalex-snapshot
On the All-Pairs-Shortest-Path Problem in Unweighted Undirected Graphs
inferredcites →https://doi.org/10.1007/11523468_20openalex-snapshot
LCA Queries in Directed Acyclic Graphs
inferredcites →https://doi.org/10.1007/11534273_28openalex-snapshot
All-Pairs Shortest Paths with Real Weights in O(n 3/log n) Time
inferredcites →https://doi.org/10.1007/3-540-53832-1_28openalex-snapshot
Finding minimally weighted subgraphs
inferredcites →https://doi.org/10.1007/bf01940874openalex-snapshot
Derandomization, witnesses for Boolean matrix multiplication and construction of perfect hash functions
inferredcites →https://doi.org/10.1007/bf02392825openalex-snapshot
Clique is hard to approximate within n1−ε
inferredcites →https://doi.org/10.1007/bf02523189openalex-snapshot
Finding and counting given length cycles
inferredcites →https://doi.org/10.1016/0304-3975(76)90078-5openalex-snapshot
How good is the information theory bound in sorting?
inferredcites →https://doi.org/10.1016/0304-3975(94)00097-3openalex-snapshot
Fixed-parameter tractability and completeness II: On completeness for W[1]
inferredcites →https://doi.org/10.1016/j.jalgor.2005.08.001openalex-snapshot
Lowest common ancestors in trees and directed acyclic graphs
inferredcites →https://doi.org/10.1016/j.tcs.2004.05.009openalex-snapshot
On the complexity of fixed parameter clique and dominating set
inferredcites →https://doi.org/10.1016/s0020-0190(00)00047-8openalex-snapshot
Finding and counting small induced subgraphs efficiently
inferredcites →https://doi.org/10.1016/s0747-7171(08)80013-2openalex-snapshot
Matrix multiplication via arithmetic progressions
inferredcites →https://doi.org/10.1137/0205006openalex-snapshot
New Bounds on the Complexity of the Shortest Path Problem
inferredcites →https://doi.org/10.1137/0214017openalex-snapshot
Arboricity and Subgraph Listing Algorithms
inferredcites →https://doi.org/10.1145/1132516.1132550openalex-snapshot
Finding a maximum weight triangle in n 3-Δ time, with applications
inferredcites →https://doi.org/10.5555/982792.982828openalex-snapshot
Detecting short directed cycles using rectangular matrix multiplication and dynamic programming
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1007/978-3-319-20119-1_4openalex-snapshot
Parallel Efficient Sparse Matrix-Matrix Multiplication on Multicore Platforms
inferred← citeshttps://doi.org/10.1007/978-3-540-70575-8_10openalex-snapshot
A New Combinatorial Approach for Sparse Graph Problems
inferred← citeshttps://doi.org/10.1007/978-3-540-78773-0_63openalex-snapshot
Efficient Approximation Algorithms for Shortest Cycles in Undirected Graphs
inferred← citeshttps://doi.org/10.1007/978-3-662-44777-2_1openalex-snapshot
Losing Weight by Gaining Edges
inferred← citeshttps://doi.org/10.1007/s00453-009-9328-xopenalex-snapshot
All-Pairs Bottleneck Paths in Vertex Weighted Graphs
inferred← citeshttps://doi.org/10.1007/s40747-023-01126-zopenalex-snapshot
MT$$^2$$AD: multi-layer temporal transaction anomaly detection in ethereum networks with GNN
inferred← citeshttps://doi.org/10.1109/focs.2010.67openalex-snapshot
Subcubic Equivalences between Path, Matrix and Triangle Problems
inferred← citeshttps://doi.org/10.1109/focs46700.2020.00078openalex-snapshot
Monochromatic Triangles, Triangle Listing and APSP
inferred← citeshttps://doi.org/10.1109/iros51168.2021.9635991openalex-snapshot
BundleTrack: 6D Pose Tracking for Novel Objects without Instance or Category-Level 3D Models
inferred← citeshttps://doi.org/10.1145/1132516.1132550openalex-snapshot
Finding a maximum weight triangle in n 3-Δ time, with applications
inferred← citeshttps://doi.org/10.1145/1250790.1250876openalex-snapshot
All-pairs bottleneck paths for general graphs in truly sub-cubic time
inferred← citeshttps://doi.org/10.1145/1250790.1250877openalex-snapshot
More algorithms for all-pairs shortest paths in weighted graphs
inferred← citeshttps://doi.org/10.1145/1536414.1536477openalex-snapshot
Finding, minimizing, and counting weighted subgraphs
inferred← citeshttps://doi.org/10.1145/1798596.1798597openalex-snapshot
Finding heaviest H -subgraphs in real weighted graphs, with applications
inferred← citeshttps://doi.org/10.1145/3186893openalex-snapshot
Subcubic Equivalences Between Path, Matrix, and Triangle Problems
inferred← citeshttps://doi.org/10.1609/aaai.v38i10.29051openalex-snapshot
Time-Aware Knowledge Representations of Dynamic Objects with Multidimensional Persistence
inferred← citeshttps://doi.org/10.26552/com.c.2014.2.83-91openalex-snapshot
Economically Optimal Road Subnetwork
inferred← citeshttps://doi.org/10.7708/ijtte.2013.3(1).06openalex-snapshot
DECISION MAKING ON OPTIMAL ROAD SUBNETWORK
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.