On the public citation graph
Constraint Satisfaction Problems Solvable by Local Consistency Methods
0 signed · 184 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.1007/3-540-45022-x_24openalex-snapshot
Constraint Satisfaction Problems and Finite Algebras
inferredcites →https://doi.org/10.1007/978-3-540-73420-8_25openalex-snapshot
Universal Algebra and Hardness Results for Constraint Satisfaction Problems
inferredcites →https://doi.org/10.1007/978-3-540-92800-3_4openalex-snapshot
Recent Results on the Algebraic Approach to the CSP
inferredcites →https://doi.org/10.1007/978-3-540-92800-3_5openalex-snapshot
Dualities for Constraint Satisfaction Problems
inferredcites →https://doi.org/10.1007/s00012-007-2012-6openalex-snapshot
Bounded width problems and algebras
inferredcites →https://doi.org/10.1007/s00012-008-2122-9openalex-snapshot
Existence theorems for weakly symmetric operations
inferredcites →https://doi.org/10.1007/s00012-015-0338-zopenalex-snapshot
Mal’tsev conditions, lack of absorption, and solvability
inferredcites →https://doi.org/10.1016/j.jalgebra.2004.07.044openalex-snapshot
Combinatorial problems raised from 2-semilattices
inferredcites →https://doi.org/10.1017/s0305004100013463openalex-snapshot
On the Structure of Abstract Algebras
inferredcites →https://doi.org/10.1090/s0002-9947-09-04874-0openalex-snapshot
Varieties with few subalgebras of powers
inferredcites →https://doi.org/10.1109/focs.2009.32openalex-snapshot
Constraint Satisfaction Problems of Bounded Width
inferredcites →https://doi.org/10.1109/lics.2003.1210072openalex-snapshot
Tractable conservative constraint satisfaction problems
inferredcites →https://doi.org/10.1109/lics.2007.50openalex-snapshot
Tractability and learnability arising from algebras with few subpowers
inferredcites →https://doi.org/10.1109/lics.2010.34openalex-snapshot
New Conditions for Taylor Varieties and CSP
inferredcites →https://doi.org/10.1137/050628957openalex-snapshot
A Simple Algorithm for Mal'tsev Constraints
inferredcites →https://doi.org/10.1137/080743238openalex-snapshot
Congruence Distributivity Implies Bounded Width
inferredcites →https://doi.org/10.1137/s0097539700376676openalex-snapshot
Classifying the Complexity of Constraints Using Finite Algebras
inferredcites →https://doi.org/10.1137/s0097539794266766openalex-snapshot
The Computational Structure of Monotone Monadic SNP and Constraint Satisfaction: A Study through Datalog and Group Theory
inferredcites →https://doi.org/10.1142/s021819670900524xopenalex-snapshot
OMITTING TYPES, BOUNDED WIDTH AND THE ABILITY TO COUNT
inferredcites →https://doi.org/10.1145/1120582.1120584openalex-snapshot
A dichotomy theorem for constraint satisfaction problems on a 3-element set
inferredcites →https://doi.org/10.1145/2213977.2214061openalex-snapshot
Robust satisfiability of constraint satisfaction problems
inferredcites →https://doi.org/10.1145/263867.263489openalex-snapshot
Closure properties of constraints
inferredcites →https://doi.org/10.2140/pjm.1968.27.95openalex-snapshot
Closed systems of functions and predicates
inferredcites →https://doi.org/10.2168/lmcs-3(2:6)2007openalex-snapshot
On tractability and congruence distributivity
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-63128-4_10openalex-snapshot
Constraint Programming as an Approach for Structural Flowsheet Synthesis
inferred← citeshttps://doi.org/10.1007/978-3-031-24117-8_18openalex-snapshot
Constraint Satisfaction, Graph Isomorphism, and the Pebbling Comonad
inferred← citeshttps://doi.org/10.1007/978-3-319-10428-7_18openalex-snapshot
On Backdoors to Tractable Constraint Languages
inferred← citeshttps://doi.org/10.1007/978-3-319-11478-1_10openalex-snapshot
Algebra and Coalgebra Objects in Categories, and Functors Having Adjoints
inferred← citeshttps://doi.org/10.1007/978-3-319-23219-5_18openalex-snapshot
On Tree-Preserving Constraints
inferred← citeshttps://doi.org/10.1007/978-3-319-77313-1_1openalex-snapshot
Constraint Satisfaction Problems: Complexity and Algorithms
inferred← citeshttps://doi.org/10.1007/978-3-662-47672-7_42openalex-snapshot
A Galois Connection for Valued Constraint Languages of Infinite Size
inferred← citeshttps://doi.org/10.1007/978-3-662-47672-7_86openalex-snapshot
Sherali-Adams Relaxations for Valued CSPs
inferred← citeshttps://doi.org/10.1007/978-981-10-6147-9_5openalex-snapshot
Parameterized Complexity of the Workflow Satisfiability Problem
inferred← citeshttps://doi.org/10.1007/s00012-015-0327-2openalex-snapshot
Characterizations of several Maltsev conditions
inferred← citeshttps://doi.org/10.1007/s00012-015-0338-zopenalex-snapshot
Mal’tsev conditions, lack of absorption, and solvability
inferred← citeshttps://doi.org/10.1007/s00012-016-0406-zopenalex-snapshot
Optimal strong Mal’cev conditions for congruence meet-semidistributivity in locally finite varieties
inferred← citeshttps://doi.org/10.1007/s00012-017-0440-5openalex-snapshot
Deciding absorption in relational structures
inferred← citeshttps://doi.org/10.1007/s00012-018-0533-9openalex-snapshot
A characterization of idempotent strong Mal’cev conditions for congruence meet-semidistributivity in locally finite varieties
inferred← citeshttps://doi.org/10.1007/s00012-024-00865-5openalex-snapshot
Graphs of finite algebras: edges, and connectivity
inferred← citeshttps://doi.org/10.1007/s00012-026-00948-5openalex-snapshot
Smb algebras II: On the constraint satisfaction problem over semilattice of Mal’cev blocks
inferred← citeshttps://doi.org/10.1007/s00224-018-9905-yopenalex-snapshot
The Number of Clones Determined by Disjunctions of Unary Relations
inferred← citeshttps://doi.org/10.1007/s00453-018-0498-2openalex-snapshot
On Singleton Arc Consistency for CSPs Defined by Monotone Patterns
inferred← citeshttps://doi.org/10.1007/s00453-020-00735-1openalex-snapshot
Using a Min-Cut Generalisation to Go Beyond Boolean Surjective VCSPs
inferred← citeshttps://doi.org/10.1007/s10472-017-9566-6openalex-snapshot
A polynomial relational class of binary CSP
inferred← citeshttps://doi.org/10.1007/s10601-015-9198-6openalex-snapshot
Tractability in constraint satisfaction problems: a survey
inferred← citeshttps://doi.org/10.1007/s11856-017-1621-9openalex-snapshot
The wonderland of reflections
inferred← citeshttps://doi.org/10.1016/j.artint.2017.12.003openalex-snapshot
Constants and finite unary relations in qualitative constraint reasoning
inferred← citeshttps://doi.org/10.1016/j.disc.2015.06.024openalex-snapshot
Dichotomy for finite tournaments of mixed-type
inferred← citeshttps://doi.org/10.1016/j.ejc.2017.10.001openalex-snapshot
On the complexity of H -coloring for special oriented trees
inferred← citeshttps://doi.org/10.1016/j.ic.2018.09.013openalex-snapshot
Binary constraint satisfaction problems defined by excluded topological minors
inferred← citeshttps://doi.org/10.1016/j.ic.2019.104437openalex-snapshot
Constraint Satisfaction Problems over semilattice block Mal'tsev algebras
inferred← citeshttps://doi.org/10.1016/j.ipl.2016.09.009openalex-snapshot
Equivariant algorithms for constraint satisfaction problems over coset templates
inferred← citeshttps://doi.org/10.1016/j.jcss.2016.10.007openalex-snapshot
Backdoors into heterogeneous classes of SAT and CSP
inferred← citeshttps://doi.org/10.1016/j.jcss.2018.03.003openalex-snapshot
Towards a characterization of constant-factor approximable finite-valued CSPs
inferred← citeshttps://doi.org/10.1016/j.jctb.2025.10.002openalex-snapshot
Quantum advantage and CSP complexity
inferred← citeshttps://doi.org/10.1016/j.tcs.2017.03.006openalex-snapshot
Gap theorems for robust satisfiability: Boolean CSPs and beyond
inferred← citeshttps://doi.org/10.1017/bsl.2015.25openalex-snapshot
THE CONSTRAINT SATISFACTION PROBLEM AND UNIVERSAL ALGEBRA
inferred← citeshttps://doi.org/10.1017/jsl.2019.73openalex-snapshot
DECIDING SOME MALTSEV CONDITIONS IN FINITE IDEMPOTENT ALGEBRAS
inferred← citeshttps://doi.org/10.1090/tran/8179openalex-snapshot
𝜔-categorical structures avoiding height 1 identities
inferred← citeshttps://doi.org/10.1093/comjnl/bxx122openalex-snapshot
Exploring Directional Path-Consistency for Solving Constraint Networks
inferred← citeshttps://doi.org/10.1093/logcom/exu070openalex-snapshot
The collapse of the bounded width hierarchy
inferred← citeshttps://doi.org/10.1109/dcabes.2018.00090openalex-snapshot
Top-k Query for Weighted Interactive Product Configuration
inferred← citeshttps://doi.org/10.1109/focs.2015.80openalex-snapshot
The Complexity of General-Valued CSPs
inferred← citeshttps://doi.org/10.1109/focs.2016.63openalex-snapshot
Testing Assignments to Constraint Satisfaction Problems
inferred← citeshttps://doi.org/10.1109/focs.2017.37openalex-snapshot
A Dichotomy Theorem for Nonuniform CSPs
inferred← citeshttps://doi.org/10.1109/focs.2018.00031openalex-snapshot
The Complexity of General-Valued CSPs Seen from the Other Side
inferred← citeshttps://doi.org/10.1109/idaacs58523.2023.10348818openalex-snapshot
The Formal Grounds for Construction for Intellimedia Automated System
inferred← citeshttps://doi.org/10.1109/ismvl.2016.10openalex-snapshot
Minimal Weighted Clones with Boolean Support
inferred← citeshttps://doi.org/10.1109/ismvl52857.2022.00019openalex-snapshot
Current Challenges in Infinite-Domain Constraint Satisfaction: Dilemmas of the Infinite Sheep
inferred← citeshttps://doi.org/10.1109/lics.2011.25openalex-snapshot
The Dichotomy for Conservative Constraint Satisfaction Problems Revisited
inferred← citeshttps://doi.org/10.1109/lics.2015.51openalex-snapshot
Locally Finite Constraint Satisfaction Problems
inferred← citeshttps://doi.org/10.1109/lics.2015.52openalex-snapshot
Descriptive Complexity of List H-Coloring Problems in Logspace: A Refined Dichotomy
inferred← citeshttps://doi.org/10.1109/lics.2017.8005087openalex-snapshot
The limits of SDP relaxations for general-valued CSPs
inferred← citeshttps://doi.org/10.1109/lics.2017.8005149openalex-snapshot
Constraint satisfaction problems over semilattice block Mal'tsev algebras
inferred← citeshttps://doi.org/10.1109/lics.2019.8785678openalex-snapshot
A short story of the CSP dichotomy conjecture
inferred← citeshttps://doi.org/10.1109/lics.2019.8785883openalex-snapshot
Topology is relevant (in a dichotomy conjecture for infinite-domain constraint satisfaction problems)
inferred← citeshttps://doi.org/10.1109/lics52264.2021.9470557openalex-snapshot
Minimal Taylor Algebras as a Common Framework for the Three Algebraic Approaches to the CSP
inferred← citeshttps://doi.org/10.1109/lics65433.2025.00034openalex-snapshot
Algebraic and algorithmic synergies between promise and infinite-domain CSPs
inferred← citeshttps://doi.org/10.1109/lics65433.2025.00036openalex-snapshot
Binary symmetries of tractable non-rigid structures
inferred← citeshttps://doi.org/10.1112/blms/bdu044openalex-snapshot
Idempotent n -permutable varieties
inferred← citeshttps://doi.org/10.1137/1.9781611974782.22openalex-snapshot
Robust algorithms with polynomial loss for near-unanimity CSPs
inferred← citeshttps://doi.org/10.1137/1.9781611975994.86openalex-snapshot
Improved hardness for H -colourings of G -colourable graphs
inferred← citeshttps://doi.org/10.1137/1.9781611977073.46openalex-snapshot
CLAP: A New Algorithm for Promise CSPs
inferred← citeshttps://doi.org/10.1137/1.9781611977073.48openalex-snapshot
Promise Constraint Satisfaction and Width
inferred← citeshttps://doi.org/10.1137/1.9781611977554.ch25openalex-snapshot
Hierarchies of Minion Tests for PCSPs through Tensors
inferred← citeshttps://doi.org/10.1137/130915479openalex-snapshot
Robustly Solvable Constraint Satisfaction Problems
inferred← citeshttps://doi.org/10.1137/130945648openalex-snapshot
The Power of Linear Programming for General-Valued CSPs
inferred← citeshttps://doi.org/10.1137/140990346openalex-snapshot
Necessary Conditions for Tractability of Valued CSPs
inferred← citeshttps://doi.org/10.1137/16m1079245openalex-snapshot
The Power of Sherali--Adams Relaxations for General-Valued CSPs
inferred← citeshttps://doi.org/10.1137/18m1163932openalex-snapshot
Robust Algorithms with Polynomial Loss for Near-Unanimity CSPs
inferred← citeshttps://doi.org/10.1137/18m117577xopenalex-snapshot
Solving CSPs Using Weak Local Consistency
inferred← citeshttps://doi.org/10.1137/18m121085xopenalex-snapshot
Constant-Query Testability of Assignments to Constraint Satisfaction Problems
inferred← citeshttps://doi.org/10.1137/18m1220194openalex-snapshot
Satisfiability in MultiValued Circuits
inferred← citeshttps://doi.org/10.1137/19m1250121openalex-snapshot
The Complexity of General-Valued Constraint Satisfaction Problems Seen from the Other Side
inferred← citeshttps://doi.org/10.1137/19m128212xopenalex-snapshot
Promise Constraint Satisfaction: Algebraic Structure and a Symmetric Boolean Dichotomy
inferred← citeshttps://doi.org/10.1137/20m1312745openalex-snapshot
The Power of the Combined Basic Linear Programming and Affine Relaxation for Promise Constraint Satisfaction Problems
inferred← citeshttps://doi.org/10.1137/22m1476435openalex-snapshot
CLAP: A New Algorithm for Promise CSPs
inferred← citeshttps://doi.org/10.1137/22m1538934openalex-snapshot
Collapsing the Bounded Width Hierarchy for Infinite-Domain Constraint Satisfaction Problems: When Symmetries Are Enough
inferred← citeshttps://doi.org/10.1137/24m1691594openalex-snapshot
Approximate Graph Coloring and the Crystal with a Hollow Shadow
inferred← citeshttps://doi.org/10.1142/s0218196714500507openalex-snapshot
Tractability of quantified temporal constraints to the max
inferred← citeshttps://doi.org/10.1142/s0218196716500429openalex-snapshot
On algebras with many symmetric operations
inferred← citeshttps://doi.org/10.1142/s0218196716500600openalex-snapshot
Complexity and polymorphisms for digraph constraint problems under some basic constructions
inferred← citeshttps://doi.org/10.1142/s0218196726500013openalex-snapshot
Network satisfaction problems solved by k -consistency
inferred← citeshttps://doi.org/10.1145/2213977.2214061openalex-snapshot
Robust satisfiability of constraint satisfaction problems
inferred← citeshttps://doi.org/10.1145/2677161.2677165openalex-snapshot
Constraint satisfaction problem and universal algebra
inferred← citeshttps://doi.org/10.1145/2898438openalex-snapshot
A Galois Connection for Weighted (Relational) Clones of Infinite Size
inferred← citeshttps://doi.org/10.1145/2933575.2933587openalex-snapshot
The Power of Arc Consistency for CSPs Defined by Partially-Ordered Forbidden Patterns
inferred← citeshttps://doi.org/10.1145/2933575.2933604openalex-snapshot
Graphs of relational structures
inferred← citeshttps://doi.org/10.1145/2933575.2934510openalex-snapshot
Weak consistency notions for all the CSPs of bounded width
inferred← citeshttps://doi.org/10.1145/3134757openalex-snapshot
Asking the Metaquestions in Constraint Tractability
inferred← citeshttps://doi.org/10.1145/3201777openalex-snapshot
The Limits of SDP Relaxations for General-Valued CSPs
inferred← citeshttps://doi.org/10.1145/3209108.3209173openalex-snapshot
Satisfiability in multi-valued circuits
inferred← citeshttps://doi.org/10.1145/3282429openalex-snapshot
The Complexity of Boolean Surjective General-Valued CSPs
inferred← citeshttps://doi.org/10.1145/3292048.3292050openalex-snapshot
Constraint satisfaction problems
inferred← citeshttps://doi.org/10.1145/3301410openalex-snapshot
The Complexity of Minimal Inference Problem for Conservative Constraint Languages
inferred← citeshttps://doi.org/10.1145/3313276.3316300openalex-snapshot
Algebraic approach to promise constraint satisfaction
inferred← citeshttps://doi.org/10.1145/3373718.3394781openalex-snapshot
On The Relational Width of First-Order Expansions of Finitely Bounded Homogeneous Binary Cores with Bounded Strict Width
inferred← citeshttps://doi.org/10.1145/3457606openalex-snapshot
Algebraic Approach to Promise Constraint Satisfaction
inferred← citeshttps://doi.org/10.1145/3531130.3533353openalex-snapshot
Smooth approximations and CSPs over finitely bounded homogeneous structures
inferred← citeshttps://doi.org/10.1145/3559736.3559740openalex-snapshot
An invitation to the promise constraint satisfaction problem
inferred← citeshttps://doi.org/10.1145/3564246.3585112openalex-snapshot
Approximate Graph Colouring and the Hollow Shadow
inferred← citeshttps://doi.org/10.1145/3564246.3585180openalex-snapshot
SDPs and Robust Satisfiability of Promise CSP
inferred← citeshttps://doi.org/10.1145/3566051openalex-snapshot
On the Descriptive Complexity of Temporal Constraint Satisfaction Problems
inferred← citeshttps://doi.org/10.1145/3649445openalex-snapshot
A Complexity Dichotomy in Spatial Reasoning via Ramsey Theory
inferred← citeshttps://doi.org/10.1145/3661814.3662068openalex-snapshot
Local consistency as a reduction between constraint satisfaction problems
inferred← citeshttps://doi.org/10.1145/3661814.3662076openalex-snapshot
Algebraic Approach to Approximation
inferred← citeshttps://doi.org/10.1145/3661814.3662118openalex-snapshot
Quantum advantage and CSP complexity
inferred← citeshttps://doi.org/10.1145/3689207openalex-snapshot
Smooth approximations: An algebraic approach to CSPs over finitely bounded homogeneous structures
inferred← citeshttps://doi.org/10.1145/3756323openalex-snapshot
The Sherali–Adams and Weisfeiler–Leman Hierarchies in (Promise Valued) Constraint Satisfaction Problems
inferred← citeshttps://doi.org/10.1145/3779418openalex-snapshot
Datalog-Expressibility for Monadic and Guarded Second-Order Logic
inferred← citeshttps://doi.org/10.1145/3799414openalex-snapshot
Hierarchies of Minion Tests for PCSPs through Tensors
inferred← citeshttps://doi.org/10.11575/prism/31986openalex-snapshot
Bounded Width Dichotomies in Constraint Satisfaction Problems
inferred← citeshttps://doi.org/10.1515/forum-2020-0205openalex-snapshot
On a stronger reconstruction notion for monoids and clones
inferred← citeshttps://doi.org/10.1609/aaai.v29i1.9749openalex-snapshot
Binarisation via Dualisation for Valued Constraints
inferred← citeshttps://doi.org/10.1609/aaai.v30i1.10432openalex-snapshot
The Meta-Problem for Conservative Mal'tsev Constraints
inferred← citeshttps://doi.org/10.1613/jair.5260openalex-snapshot
A Model-Theoretic View on Qualitative Constraint Reasoning
inferred← citeshttps://doi.org/10.18287/2223-9537-2018-8-4-487-522openalex-snapshot
THE ONTOLOGIES OF DESIGNING FROM VITRUVIA TO VITTIKH
inferred← citeshttps://doi.org/10.18287/2223-9537-2018-8-4-523-539openalex-snapshot
SPACE ROCKET COMPLEX PROJECT ON THE BASIS OF A SUPER-LIGHT CLASS ROCKET-CARRIER
inferred← citeshttps://doi.org/10.18287/2223-9537-2018-8-4-540-549openalex-snapshot
LOGICAL-SYSTEM SEQUENCES IN SCIENTIFIC PROJECTS
inferred← citeshttps://doi.org/10.18287/2223-9537-2018-8-4-562-570openalex-snapshot
MODELLING OF EMERGENCY SITUATIONS TERMINOLOGICAL SYSTEM
inferred← citeshttps://doi.org/10.18287/2223-9537-2018-8-4-571-593openalex-snapshot
COMBINING OF METHODS OF CONSTRAINT PROPAGATION AND STRUCTURAL DECOMPOSITION FOR THE A PRIORI ANALYSIS OF QUERIES TO THE ONTOLOGIES
inferred← citeshttps://doi.org/10.18287/2223-9537-2018-8-4-605-614openalex-snapshot
CONSTRUCTION OF EFFECTIVE FRONTS OF INNOVATIVE PROJECTS
inferred← citeshttps://doi.org/10.18287/2223-9537-2018-8-4-615-627openalex-snapshot
ALTERNANCE METHOD IN VECTOR PROBLEMS OF PARAMETRIC OPTIMIZATION OF SYSTEMS WITH DISTRIBUTED PARAMETERS
inferred← citeshttps://doi.org/10.18287/2223-9537-2018-8-4-628-640openalex-snapshot
COMPARATIVE STUDY OF THE ALGORITHMS OF DESIGN OF RECOMMENDATION SYSTEMS BASED ON THE ANALYSIS OF BIG DATA ON CONSUMER BASKETS
inferred← citeshttps://doi.org/10.2168/lmcs-11(4:18)2015openalex-snapshot
A finer reduction of constraint problems to digraphs
inferred← citeshttps://doi.org/10.2298/fil2313083popenalex-snapshot
SMB algebras I: On the variety of SMB algebras
inferred← citeshttps://doi.org/10.23638/dmtcs-22-1-10openalex-snapshot
New schemes for simplifying binary constraint satisfaction problems
inferred← citeshttps://doi.org/10.23638/lmcs-13(4:26)2017openalex-snapshot
The Power of Arc Consistency for CSPs Defined by Partially-Ordered Forbidden Patterns
inferred← citeshttps://doi.org/10.23638/lmcs-14(2:3)2018openalex-snapshot
$n$-permutability and linear Datalog implies symmetric Datalog
inferred← citeshttps://doi.org/10.23638/lmcs-15(1:4)2019openalex-snapshot
A Finite-Model-Theoretic View on Propositional Proof Complexity
inferred← citeshttps://doi.org/10.32920/21482265openalex-snapshot
A Finer Reduction of Constraint Problems to Digraphs
inferred← citeshttps://doi.org/10.32920/21482265.v1openalex-snapshot
A Finer Reduction of Constraint Problems to Digraphs
inferred← citeshttps://doi.org/10.32920/23459144openalex-snapshot
Expressibility Of Constraint Satisfaction Problems In Extensions Of First-Order Logic
inferred← citeshttps://doi.org/10.32920/23459144.v1openalex-snapshot
Expressibility Of Constraint Satisfaction Problems In Extensions Of First-Order Logic
inferred← citeshttps://doi.org/10.4171/jems/790openalex-snapshot
Finitely related algebras in congruence modular varieties have few subpowers
inferred← citeshttps://doi.org/10.4230/lipics.csl.2015.60openalex-snapshot
A Definability Dichotomy for Finite Valued CSPs
inferred← citeshttps://doi.org/10.4230/lipics.csl.2016.2openalex-snapshot
Infinite Domain Constraint Satisfaction Problem (Invited Talk)
inferred← citeshttps://doi.org/10.4230/lipics.icalp.2021.138openalex-snapshot
Smooth Approximations and Relational Width Collapses
inferred← citeshttps://doi.org/10.4230/lipics.stacs.2019.52openalex-snapshot
Beyond Boolean Surjective VCSPs
inferred← citeshttps://doi.org/10.46298/theoretics.24.14openalex-snapshot
Unifying the Three Algebraic Approaches to the CSP via Minimal Taylor Algebras
inferred← citeshttps://doi.org/10.48550/arxiv.1404.3675openalex-snapshot
On Backdoors To Tractable Constraint Languages
inferred← citeshttps://doi.org/10.48550/arxiv.1407.1779openalex-snapshot
On the complexity of $\mathbb H$-coloring for special oriented trees
inferred← citeshttps://doi.org/10.48550/arxiv.1507.01776openalex-snapshot
A Reduction from Valued CSP to Min Cost Homomorphism Problem for Digraphs
inferred← citeshttps://doi.org/10.48550/arxiv.1605.00565openalex-snapshot
Weaker consistency notions for all the CSPs of bounded width
inferred← citeshttps://doi.org/10.48550/arxiv.1609.03943openalex-snapshot
A Constraint Satisfaction Problem Algorithm for Certain 2-Semilattice-over-Edge Algebras
inferred← citeshttps://doi.org/10.48550/arxiv.1706.03451openalex-snapshot
Constraint Satisfaction Problem Dichotomy for Finite Templates: a Proof Via Consistency Checks
inferred← citeshttps://doi.org/10.48550/arxiv.1709.08311openalex-snapshot
A new algorithm for constraint satisfaction problems with Maltsev templates
inferred← citeshttps://doi.org/10.48550/arxiv.1711.01943openalex-snapshot
A new algorithm for constraint satisfaction problems with few subpowers templates
inferred← citeshttps://doi.org/10.48550/arxiv.1909.05901openalex-snapshot
Examples, counterexamples, and structure in bounded width algebras
inferred← citeshttps://doi.org/10.48550/arxiv.2005.00593openalex-snapshot
Strong subalgebras and the Constraint Satisfaction Problem
inferred← citeshttps://doi.org/10.48550/arxiv.2006.10239openalex-snapshot
Local structure of idempotent algebras II
inferred← citeshttps://doi.org/10.48550/arxiv.2006.11713openalex-snapshot
Graphs of relational structures: restricted types
inferred← citeshttps://doi.org/10.48550/arxiv.2007.09099openalex-snapshot
A dichotomy theorem for nonuniform CSPs simplified
inferred← citeshttps://doi.org/10.48550/arxiv.2102.07329openalex-snapshot
Symmetric Operations on Domains of Size at Most 4
inferred← citeshttps://doi.org/10.5555/3329995.3330022openalex-snapshot
The limits of SDP relaxations for general-valued CSPs
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.