On the public citation graph

Property Testing in Bounded Degree Hypergraphs

0 signed · 18 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.1007/978-3-031-88946-2_15openalex-snapshot
On Testing Hamiltonicity in the Bounded Degree Graph Model
inferredcites →https://doi.org/10.1007/978-3-319-21275-3openalex-snapshot
Parameterized Algorithms
inferredcites →https://doi.org/10.1007/s00453-014-9897-1openalex-snapshot
Testing Outerplanarity of Bounded Degree Graphs
inferredcites →https://doi.org/10.1016/j.ejc.2009.10.010openalex-snapshot
Bandwidth, expansion, treewidth, separators and universality for bounded-degree graphs
inferredcites →https://doi.org/10.1016/j.endm.2005.06.086openalex-snapshot
Every Monotone 3-Graph Property is Testable
inferredcites →https://doi.org/10.1016/j.jctb.2025.04.009openalex-snapshot
A characterization of testable hypergraph properties
inferredcites →https://doi.org/10.1016/j.tcs.2004.09.031openalex-snapshot
Testing hypergraph colorability
inferredcites →https://doi.org/10.1109/ccc.2011.10openalex-snapshot
Lower Bounds on Query Complexity for Testing Bounded-Degree CSPs
inferredcites →https://doi.org/10.1109/sfcs.2002.1181886openalex-snapshot
A lower bound for testing 3-colorability in bounded-degree graphs
inferredcites →https://doi.org/10.1137/060667177openalex-snapshot
A Combinatorial Characterization of the Testable Graph Properties: It's All About Regularity
inferredcites →https://doi.org/10.1137/070681831openalex-snapshot
Testing Hereditary Properties of Nonexpanding Bounded-Degree Graphs
inferredcites →https://doi.org/10.1137/18m1177159openalex-snapshot
Edge Correlations in Random Regular Hypergraphs and Applications to Subgraph Testing
inferredcites →https://doi.org/10.1137/s0097539793255151openalex-snapshot
Robust Characterizations of Polynomials with Applications to Program Testing
inferredcites →https://doi.org/10.1145/100216.100225openalex-snapshot
Self-testing/correcting with applications to numerical problems
inferredcites →https://doi.org/10.1145/103418.103429openalex-snapshot
Self-testing/correcting for polynomials and for approximate functions
inferredcites →https://doi.org/10.1145/1250790.1250862openalex-snapshot
Property testing in hypergraphs and the removal lemma
inferredcites →https://doi.org/10.1145/276698.276767openalex-snapshot
A sublinear bipartiteness tester for bounded degree graphs
inferredcites →https://doi.org/10.1145/285055.285060openalex-snapshot
Property testing and its connection to learning and approximation
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.