The following pages link to Stanislav Živný (Q606898):
Displaying 50 items.
- Classes of submodular constraints expressible by graph cuts (Q606899) (← links)
- Hybrid tractability of valued constraint problems (Q646503) (← links)
- Backdoors into heterogeneous classes of SAT and CSP (Q730498) (← links)
- The expressive power of valued constraints: Hierarchies and collapses (Q959827) (← links)
- The expressive power of binary submodular functions (Q967393) (← links)
- A note on some collapse results of valued constraints (Q987814) (← links)
- Structural properties of oracle classes (Q990941) (← links)
- Binary constraint satisfaction problems defined by excluded topological minors (Q1633806) (← links)
- Discrete convexity in joint winner property (Q1662162) (← links)
- On singleton arc consistency for CSPs defined by monotone patterns (Q1739115) (← links)
- On rainbow-free colourings of uniform hypergraphs (Q1981770) (← links)
- Galois connections for patterns: an algebra of labelled graphs (Q2044173) (← links)
- Beyond PCSP (\textbf{1-in-3}, \textbf{NAE}) (Q2105441) (← links)
- Using a Min-Cut generalisation to go beyond Boolean surjective VCSPs (Q2211354) (← links)
- Boolean approximate counting CSPs with weak conservativity, and implications for ferromagnetic two-spin (Q2301362) (← links)
- Variable and value elimination in binary constraint satisfaction via forbidden patterns (Q2353394) (← links)
- Functional clones and expressibility of partition functions (Q2357376) (← links)
- On planar valued CSPs (Q2396724) (← links)
- Tractable Triangles and Cross-Free Convexity in Discrete Optimisation (Q2905390) (← links)
- An Algebraic Theory of Complexity for Valued Constraints: Establishing a Galois Connection (Q3088042) (← links)
- The Complexity of Finite-Valued CSPs (Q3177814) (← links)
- The Expressive Power of Binary Submodular Functions (Q3182971) (← links)
- On Singleton Arc Consistency for CSPs Defined by Monotone Patterns (Q3304113) (← links)
- Beyond JWP: A Tractable Class of Binary VCSPs via M-Convex Intersection. (Q3304138) (← links)
- A Galois Connection for Valued Constraint Languages of Infinite Size (Q3448812) (← links)
- Sherali-Adams Relaxations for Valued CSPs (Q3448860) (← links)
- Necessary Conditions for Tractability of Valued CSPs (Q3455247) (← links)
- The Expressive Power of Valued Constraints: Hierarchies and Collapses (Q3523088) (← links)
- (Q4600768) (← links)
- (Q4608005) (← links)
- On Planar Valued CSPs (Q4608600) (← links)
- The Power of Arc Consistency for CSPs Defined by Partially-Ordered Forbidden Patterns (Q4635926) (← links)
- The Complexity of Valued Constraint Satisfaction Problems (Q4911805) (← links)
- Maximizing <i>k</i> -Submodular Functions and Beyond (Q4962626) (← links)
- (Q4967163) (← links)
- A Tractable Class of Binary VCSPs via M-Convex Intersection (Q4972691) (← links)
- A Galois Connection for Weighted (Relational) Clones of Infinite Size (Q4973854) (← links)
- The Limits of SDP Relaxations for General-Valued CSPs (Q4973880) (← links)
- Hybrid Tractable Classes of Constraint Problems (Q4993597) (← links)
- The Complexity of Valued CSPs (Q4993602) (← links)
- Counting Homomorphisms to $K_4$-Minor-Free Graphs, Modulo 2 (Q5013574) (← links)
- The Complexity of General-Valued Constraint Satisfaction Problems Seen from the Other Side (Q5026391) (← links)
- The Combined Basic LP and Affine IP Relaxation for Promise VCSPs on Infinite Domains (Q5032030) (← links)
- The Complexity of Approximately Counting Retractions to Square-free Graphs (Q5032031) (← links)
- Approximate Counting CSP Seen from the Other Side (Q5053062) (← links)
- The Complexity of Approximately Counting Retractions (Q5053066) (← links)
- The Complexity of Promise SAT on Non-Boolean Domains (Q5066145) (← links)
- (Q5089260) (← links)
- Sparsification of Binary CSPs (Q5090464) (← links)
- (Q5090503) (← links)
