On the public citation graph
Approximate Hypergraph Partitioning and Applications
0 signed · 38 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/(sici)1098-2418(199605)8:3<187::aid-rsa3>3.0.co;2-uopenalex-snapshot
MAX-CUT has a randomized approximation scheme in dense graphs
inferredcites →https://doi.org/10.1002/rsa.10041openalex-snapshot
Property testers for dense constraint satisfaction programs on finite domains
inferredcites →https://doi.org/10.1002/rsa.20017openalex-snapshot
Regularity Lemma for k‐uniform hypergraphs
inferredcites →https://doi.org/10.1002/rsa.20117openalex-snapshot
The counting lemma for regulark‐uniform hypergraphs
inferredcites →https://doi.org/10.1002/rsa.3240020208openalex-snapshot
Regularity lemmas for hypergraphs and quasi‐randomness
inferredcites →https://doi.org/10.1006/jagm.1994.1005openalex-snapshot
The Algorithmic Aspects of the Regularity Lemma
inferredcites →https://doi.org/10.1006/jcss.1998.1605openalex-snapshot
Polynomial Time Approximation Schemes for Dense Instances of NP-Hard Problems
inferredcites →https://doi.org/10.1006/jcta.2001.3217openalex-snapshot
Hypergraphs, Quasi-randomness, and Conditions for Regularity
inferredcites →https://doi.org/10.1007/978-3-540-27821-4_36openalex-snapshot
Testing the Independence Number of Hypergraphs
inferredcites →https://doi.org/10.1007/pl00001621openalex-snapshot
Lower bounds of tower type for Szemerédi's uniformity lemma
inferredcites →https://doi.org/10.1007/s004930050052openalex-snapshot
Quick Approximation to Matrices and Applications
inferredcites →https://doi.org/10.1016/j.jcta.2005.11.006openalex-snapshot
A variant of the hypergraph removal lemma
inferredcites →https://doi.org/10.1016/j.tcs.2004.09.031openalex-snapshot
Testing hypergraph colorability
inferredcites →https://doi.org/10.1016/s0022-0000(03)00008-4openalex-snapshot
Random sampling and approximation of MAX-CSPs
inferredcites →https://doi.org/10.1109/sfcs.1996.548459openalex-snapshot
The regularity lemma and approximation schemes for dense problems
inferredcites →https://doi.org/10.1109/sfcs.2005.17openalex-snapshot
An Algorithmic Version of the Hypergraph Regularity Method
inferredcites →https://doi.org/10.1137/060652324openalex-snapshot
Testing versus Estimation of Graph Properties
inferredcites →https://doi.org/10.1137/060652385openalex-snapshot
An Algorithmic Version of the Hypergraph Regularity Method
inferredcites →https://doi.org/10.1137/s0097539702408223openalex-snapshot
An Optimal Algorithm for Checking Regularity
inferredcites →https://doi.org/10.1137/s0097539704441629openalex-snapshot
Approximating the Cut-Norm via Grothendieck's Inequality
inferredcites →https://doi.org/10.1137/s0097539793247634openalex-snapshot
A Fast Approximation Algorithm for Computing the Frequencies of Subgraphs in a Given Graph
inferredcites →https://doi.org/10.1137/s0097539799351729openalex-snapshot
An Algorithmic Regularity Lemma for Hypergraphs
inferredcites →https://doi.org/10.1145/1060590.1060612openalex-snapshot
Testing versus estimation of graph properties
inferredcites →https://doi.org/10.1145/285055.285060openalex-snapshot
Property testing and its connection to learning and approximation
inferredcites →https://doi.org/10.1145/509907.509945openalex-snapshot
Random sampling and approximation of MAX-CSP problems
inferredcites →https://doi.org/10.37236/1449openalex-snapshot
A Simple Algorithm for Constructing Szemerédi's Regularity Partition
inferredcites →https://doi.org/10.4007/annals.2007.166.897openalex-snapshot
Hypergraph regularity and the multidimensional Szemerédi theorem
inferredcites →https://doi.org/10.4064/aa-27-1-199-245openalex-snapshot
On sets of integers containing k elements in arithmetic progression
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-031-40594-5_3openalex-snapshot
Coupe: A Mesh Partitioning Platform
inferred← citeshttps://doi.org/10.1017/s0963548317000049openalex-snapshot
On Regularity Lemmas and their Algorithmic Applications
inferred← citeshttps://doi.org/10.1109/ccc.2012.28openalex-snapshot
Junto-Symmetric Functions, Hypergraph Isomorphism and Crunching
inferred← citeshttps://doi.org/10.1137/1.9781611976465.98openalex-snapshot
On Efficient Distance Approximation for Graph Properties
inferred← citeshttps://doi.org/10.1137/16m1060224openalex-snapshot
Computing Eigenvalues of Large Scale Sparse Tensors Arising from a Hypergraph
inferred← citeshttps://doi.org/10.1145/3717823.3718290openalex-snapshot
A Tolerant Independent Set Tester
inferred← citeshttps://doi.org/10.4028/www.scientific.net/amr.760-762.311openalex-snapshot
Parallel Computing of Laser Propulsion with Hypergraph Partitioning
inferred← citeshttps://doi.org/10.48550/arxiv.1312.5105openalex-snapshot
Local correlation clustering
inferred← citeshttps://doi.org/10.48550/arxiv.1509.03046openalex-snapshot
Explicit Bounds for Nondeterministically Testable Hypergraph Parameters
inferred← citeshttps://doi.org/10.5555/2043527.2043531openalex-snapshot
Szemerédi-type clustering of peer-to-peer streaming system
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.