The following pages link to Francesco Scarcello (Q235708):
Displaying 43 items.
- Tree projections and structural decomposition methods: minimality and game-theoretic characterization (Q393903) (← links)
- (Q632803) (redirect page) (← links)
- On the complexity of regular-grammars with integer attributes (Q632805) (← links)
- On the complexity of core, kernel, and bargaining set (Q650525) (← links)
- Hypertree decompositions and tractable queries (Q696962) (← links)
- Greedy strategies and larger islands of tractability for conjunctive queries and constraint satisfaction problems (Q729822) (← links)
- On the complexity of constrained Nash equilibria in graphical games (Q837182) (← links)
- Weighted hypertree decompositions and optimal query plans (Q878759) (← links)
- On the power of structural decompositions of graph-based representations of constraint problems (Q969532) (← links)
- Disjunctive stable models: Unfounded sets, fixpoint semantics, and computation (Q1363783) (← links)
- Robbers, marshals, and guards: Game theoretic and logical characterizations of hypertree width. (Q1401972) (← links)
- Minimal length elements of Thompson's group \(F\) (Q1406019) (← links)
- Semantical and computational aspects of Horn approximations (Q1575175) (← links)
- A comparison of structural CSP decomposition methods (Q1589639) (← links)
- Fixed-parameter complexity in AI and nonmonotonic reasoning (Q1603733) (← links)
- Tree projections and constraint optimization problems: fixed-parameter tractability and parallel algorithms (Q1745716) (← links)
- Propositional lower bounds: Algorithms and complexity (Q1978032) (← links)
- Coalitional games induced by matching problems: complexity and islands of tractability for the Shapley value (Q2289024) (← links)
- Structural tractability of enumerating CSP solutions (Q2342585) (← links)
- Enhancing DLV instantiator by backjumping techniques (Q2426106) (← links)
- Planar graph bipartization in linear time (Q2482113) (← links)
- The Complexity of the Nucleolus in Compact Games (Q2828226) (← links)
- Census Data Repair: A Challenging Application of Disjunctive Logic Programming (Q2996194) (← links)
- The complexity of acyclic conjunctive queries (Q3196620) (← links)
- (Q3457238) (← links)
- Tree Projections: Hypergraph Games and Minimality (Q3521962) (← links)
- Non-Transferable Utility Coalitional Games via Mixed-Integer Linear Constraints (Q3588641) (← links)
- Tractable Optimization Problems through Hypergraph-Based Structural Restrictions (Q3638082) (← links)
- Tree Projections: Game Characterization and Computational Aspects (Q3655155) (← links)
- (Q4375823) (← links)
- Abductive logic programs with penalization: semantics, complexity and implementation (Q4673542) (← links)
- (Q4779133) (← links)
- (Q4798016) (← links)
- (Q4799253) (← links)
- (Q4938636) (← links)
- (Q4955325) (← links)
- The DLV system for knowledge representation and reasoning (Q5277755) (← links)
- The Power of Local Consistency in Conjunctive Queries and Constraint Satisfaction Problems (Q5283239) (← links)
- Mechanisms for Fair Allocation Problems: No-Punishment Payment Rules in Verifiable Settings (Q5404397) (← links)
- Uniform Constraint Satisfaction Problems and Database Theory (Q5504703) (← links)
- (Q5715720) (← links)
- Graph-Theoretic Concepts in Computer Science (Q5897539) (← links)
- Computing LOGCFL certificates (Q5958329) (← links)
