On the public citation graph

A universally fastest algorithm for Max 2-Sat, Max 2-CSP, and everything in between

0 signed · 48 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.1006/jagm.2000.1075openalex-snapshot
New Upper Bounds for Maximum Satisfiability
inferredcites →https://doi.org/10.1007/11523468_16openalex-snapshot
Measure and Conquer: Domination – A Case Study
inferredcites →https://doi.org/10.1007/11604686_34openalex-snapshot
Algorithms Based on the Treewidth of Sparse Graphs
inferredcites →https://doi.org/10.1007/3-540-46541-3_5openalex-snapshot
A New Algorithm for MAX-2-SAT
inferredcites →https://doi.org/10.1007/3-540-46632-0_26openalex-snapshot
Upper Bounds for MaxSat: Further Improved
inferredcites →https://doi.org/10.1007/978-3-540-45198-3_32openalex-snapshot
Faster Algorithms for MAX CUT and MAX CSP, with Polynomial Expected Time for Sparse Instances
inferredcites →https://doi.org/10.1007/978-3-540-74510-5_21openalex-snapshot
New Bounds for MAX-SAT by Clause Learning
inferredcites →https://doi.org/10.1007/978-3-540-85238-4_45openalex-snapshot
A New Upper Bound for Max-2-SAT: A Graph-Theoretic Approach
inferredcites →https://doi.org/10.1007/978-3-642-22300-6_11openalex-snapshot
Feedback Vertex Set in Mixed Graphs
inferredcites →https://doi.org/10.1016/j.disopt.2007.08.001openalex-snapshot
Linear-programming design and analysis of fast algorithms for Max 2-CSP
inferredcites →https://doi.org/10.1016/j.ipl.2005.11.013openalex-snapshot
Optimal 2-constraint satisfaction via sum–product algorithms
inferredcites →https://doi.org/10.1016/j.jalgor.2004.01.001openalex-snapshot
Exact algorithms for finding minimum transversals in rank-3 hypergraphs
inferredcites →https://doi.org/10.1016/j.jalgor.2004.06.008openalex-snapshot
3-coloring in time
inferredcites →https://doi.org/10.1016/j.tcs.2005.09.023openalex-snapshot
A new algorithm for optimal 2-constraint satisfaction and its implications
inferredcites →https://doi.org/10.1016/s0166-218x(02)00402-xopenalex-snapshot
Worst-case upper bounds for MAX-2-SAT with an application to MAX-CUT
inferredcites →https://doi.org/10.1016/s0304-3975(98)00017-6openalex-snapshot
New methods for 3-SAT decision and worst-case analysis
inferredcites →https://doi.org/10.1090/dimacs/035/06openalex-snapshot
Worst-case analysis, 3-SAT decision, and lower bounds: Approaches for improved SAT algorithms
inferredcites →https://doi.org/10.1137/1.9780898715859openalex-snapshot
Proceedings of the 16th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA)
inferredcites →https://doi.org/10.1137/1.9780898716474openalex-snapshot
Proceedings of the 19th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA)
inferredcites →https://doi.org/10.1145/1198513.1198515openalex-snapshot
Quasiconvex analysis of multivariate recurrence equations for backtracking algorithms
inferredcites →https://doi.org/10.1145/1462153.1462154openalex-snapshot
Recursive Markov chains, stochastic grammars, and monotone systems of nonlinear equations
inferredcites →https://doi.org/10.1145/1552285.1552286openalex-snapshot
A measure & conquer approach for the analysis of exact algorithms
inferredcites →https://doi.org/10.5555/1109557.1109559openalex-snapshot
A new approach to proving upper bounds for MAX-2-SAT
inferredcites →https://doi.org/10.5555/1496770.1496837openalex-snapshot
A universally fastest algorithm for Max 2-Sat, Max 2-CSP, and everything in between

What points at this work

Incoming claims: where this work appears in other papers’ reference lists and arguments.

inferred← citeshttps://doi.org/10.1002/jgt.22179openalex-snapshot
On the number of minimal separators in graphs
inferred← citeshttps://doi.org/10.1007/978-3-319-09284-3_4openalex-snapshot
Solving Sparse Instances of Max SAT via Width Reduction and Greedy Restriction
inferred← citeshttps://doi.org/10.1007/978-3-319-24318-4_4openalex-snapshot
Improved Algorithms for Sparse MAX-SAT and MAX-k-CSP
inferred← citeshttps://doi.org/10.1007/978-3-319-39817-4_12openalex-snapshot
Breaking Cycle Structure to Improve Lower Bound for Max-SAT
inferred← citeshttps://doi.org/10.1007/978-3-319-62389-4_31openalex-snapshot
Faster Graph Coloring in Polynomial Space
inferred← citeshttps://doi.org/10.1007/978-3-662-47672-7_46openalex-snapshot
Separate, Measure and Conquer: Faster Polynomial-Space Algorithms for Max 2-CSP and Counting Dominating Sets
inferred← citeshttps://doi.org/10.1007/978-3-662-49529-2_23openalex-snapshot
Faster Algorithms to Enumerate Hypergraph Transversals
inferred← citeshttps://doi.org/10.1007/978-3-662-53174-7_9openalex-snapshot
On the Number of Minimal Separators in Graphs
inferred← citeshttps://doi.org/10.1007/978-981-96-2845-2_6openalex-snapshot
A Piecewise Approach for the Analysis of Exact Algorithms
inferred← citeshttps://doi.org/10.1007/s00224-014-9600-6openalex-snapshot
Solving Sparse Instances of Max SAT via Width Reduction and Greedy Restriction
inferred← citeshttps://doi.org/10.1007/s00453-011-9566-6openalex-snapshot
Parameterized Measure & Conquer for Problems with No Small Kernels
inferred← citeshttps://doi.org/10.1007/s00453-011-9575-5openalex-snapshot
Exact and Parameterized Algorithms for Max Internal Spanning Tree
inferred← citeshttps://doi.org/10.1007/s00453-013-9759-2openalex-snapshot
Inclusion/Exclusion Meets Measure and Conquer
inferred← citeshttps://doi.org/10.1007/s00453-014-9883-7openalex-snapshot
A General Reduction Theorem with Applications to Pathwidth and the Complexity of MAX 2-CSP
inferred← citeshttps://doi.org/10.1016/j.jcss.2015.11.013openalex-snapshot
A faster polynomial-space algorithm for Max 2-CSP
inferred← citeshttps://doi.org/10.1016/j.tcs.2014.01.010openalex-snapshot
New exact algorithms for the 2-constraint satisfaction problem
inferred← citeshttps://doi.org/10.1016/j.tcs.2017.07.011openalex-snapshot
Improved exact algorithms for mildly sparse instances of Max SAT
inferred← citeshttps://doi.org/10.1016/j.tcs.2026.115814openalex-snapshot
A piecewise approach for the analysis of exact algorithms
inferred← citeshttps://doi.org/10.1137/16m107712xopenalex-snapshot
$K_4$-Minor-Free Induced Subgraphs of Sparse Connected Graphs
inferred← citeshttps://doi.org/10.1145/3111499openalex-snapshot
Separate, Measure and Conquer
inferred← citeshttps://doi.org/10.1609/aaai.v37i4.25503openalex-snapshot
Improved Algorithms for Maximum Satisfiability and Its Special Cases
inferred← citeshttps://doi.org/10.4230/lipics.itcs.2019.8openalex-snapshot
A #SAT Algorithm for Small Constant-Depth Circuits with PTF Gates
inferred← citeshttps://doi.org/10.46298/dmtcs.563openalex-snapshot
A Branch-and-Reduce Algorithm for Finding a Minimum Independent Dominating Set
inferred← citeshttps://doi.org/10.48550/arxiv.1404.0753openalex-snapshot
Separate, Measure and Conquer: Faster Algorithms for Max 2-CSP and Counting Dominating Sets
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.