On the public citation graph
Large Cuts with Local Algorithms on Triangle-Free Graphs
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/rsa.3240030211openalex-snapshot
A note on bipartite subgraphs of triangle‐free graphs
inferredcites →https://doi.org/10.1007/978-3-540-73420-8_22openalex-snapshot
Distributed Computing with Advice: Information Sensitivity of Graph Coloring
inferredcites →https://doi.org/10.1137/0221015openalex-snapshot
Locality in Distributed Graph Algorithms
inferredcites →https://doi.org/10.1137/s0097539705447372openalex-snapshot
Optimal Inapproximability Results for MAX‐CUT and Other 2‐Variable CSPs?
inferredcites →https://doi.org/10.1145/1146381.1146387openalex-snapshot
On the complexity of distributed graph coloring
inferredcites →https://doi.org/10.1145/258533.258536openalex-snapshot
Some optimal inapproximability results
inferredcites →https://doi.org/10.29007/38lmopenalex-snapshot
Improved Exact Solver for the Weighted MAX-SAT Problem
inferredcites →https://doi.org/10.48550/arxiv.1502.04963openalex-snapshot
Exact bounds for distributed graph colouring
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-030-30786-8_6openalex-snapshot
Local Approximation of the Maximum Cut in Regular Graphs
inferred← citeshttps://doi.org/10.1007/978-3-031-60603-8_19openalex-snapshot
On Distributed Computation of the Minimum Triangle Edge Transversal
inferred← citeshttps://doi.org/10.1007/978-3-319-72751-6_4openalex-snapshot
Fast Distributed Approximation for Max-Cut
inferred← citeshttps://doi.org/10.1007/978-3-662-53426-7_4openalex-snapshot
Fast Distributed Algorithms for Testing Graph Properties
inferred← citeshttps://doi.org/10.1007/s00446-018-0324-8openalex-snapshot
Fast distributed algorithms for testing graph properties
inferred← citeshttps://doi.org/10.1007/s00446-024-00470-8openalex-snapshot
Deterministic Near-Optimal Distributed Listing of Cliques
inferred← citeshttps://doi.org/10.1016/j.future.2024.06.012openalex-snapshot
Assessing and advancing the potential of quantum computing: A NASA case study
inferred← citeshttps://doi.org/10.1016/j.jcss.2015.09.002openalex-snapshot
Synchronous counting and computational algorithm design
inferred← citeshttps://doi.org/10.1016/j.physrep.2024.03.002openalex-snapshot
A review on Quantum Approximate Optimization Algorithm and its variants
inferred← citeshttps://doi.org/10.1016/j.tcs.2020.03.008openalex-snapshot
Local approximation of the Maximum Cut in regular graphs
inferred← citeshttps://doi.org/10.1103/physreva.103.052413openalex-snapshot
Approximate optimization of the MaxCut problem with a local spin algorithm
inferred← citeshttps://doi.org/10.1109/infocom.2019.8737382openalex-snapshot
On the Power of Preprocessing in Decentralized Network Optimization
inferred← citeshttps://doi.org/10.1109/tqe.2024.3443660openalex-snapshot
Solving Nonnative Combinatorial Optimization Problems Using Hybrid Quantum–Classical Algorithms
inferred← citeshttps://doi.org/10.1137/1.9781611977066.17openalex-snapshot
An explicit vector algorithm for high-girth MaxCut
inferred← citeshttps://doi.org/10.1145/3087801.3087811openalex-snapshot
Triangle Finding and Listing in CONGEST Networks
inferred← citeshttps://doi.org/10.1145/3293611.3331606openalex-snapshot
The Distributed Complexity of Locally Checkable Problems on Paths is Decidable
inferred← citeshttps://doi.org/10.1145/3409964.3461788openalex-snapshot
Finding Subgraphs in Highly Dynamic Networks
inferred← citeshttps://doi.org/10.1145/3732772.3733522openalex-snapshot
Brief Announcement: The Complexity Landscape of Dynamic Distributed Subgraph Finding
inferred← citeshttps://doi.org/10.1145/3796701.3815937openalex-snapshot
Brief Announcement: 2-Coloring Cycles in One Round
inferred← citeshttps://doi.org/10.22331/q-2021-04-20-437openalex-snapshot
Local classical MAX-CUT algorithm outperforms p=2 QAOA on high-girth regular graphs
inferred← citeshttps://doi.org/10.22331/q-2022-07-07-757openalex-snapshot
Bounds on approximating Max k XOR with quantum and classical local algorithms
inferred← citeshttps://doi.org/10.4230/lipics.disc.2018.35openalex-snapshot
Adapting Local Sequential Algorithms to the Distributed Setting
inferred← citeshttps://doi.org/10.4230/lipics.itcs.2022.14openalex-snapshot
Classical Algorithms and Quantum Limitations for Maximum Cut on High-Girth Graphs
inferred← citeshttps://doi.org/10.48550/arxiv.1512.05411openalex-snapshot
Non-Local Probes Do Not Help with Graph Problems
inferred← citeshttps://doi.org/10.48550/arxiv.1602.03718openalex-snapshot
Fast Distributed Algorithms for Testing Graph Properties
inferred← citeshttps://doi.org/10.48550/arxiv.1812.00854openalex-snapshot
On the Power of Preprocessing in Decentralized Network Optimization
inferred← citeshttps://doi.org/10.48550/arxiv.1908.11488openalex-snapshot
Quantum Distributed Algorithm for Triangle Finding in the CONGEST Model
inferred← citeshttps://doi.org/10.70675/ddc8a4b2z9f68z49d3z91e1zc1d6664298b1openalex-snapshot
Analog Quantum Computing for NP-Hard Combinatorial Graph Problems
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.