Francesco Scarcello

From MaRDI portal
Person:235708

Available identifiers

zbMath Open scarcello.francescoDBLP71/3711WikidataQ60503686 ScholiaQ60503686MaRDI QIDQ235708

List of research outcomes





PublicationDate of PublicationType
Coalitional games induced by matching problems: complexity and islands of tractability for the Shapley value2020-01-20Paper
Tree projections and constraint optimization problems: fixed-parameter tractability and parallel algorithms2018-04-18Paper
The Power of Local Consistency in Conjunctive Queries and Constraint Satisfaction Problems2017-07-21Paper
The DLV system for knowledge representation and reasoning2017-07-12Paper
Greedy strategies and larger islands of tractability for conjunctive queries and constraint satisfaction problems2016-12-22Paper
The complexity of the nucleolus in compact games2016-10-24Paper
https://portal.mardi4nfdi.de/entity/Q34572382015-12-11Paper
The complexity of acyclic conjunctive queries2015-10-30Paper
Structural tractability of enumerating CSP solutions2015-04-29Paper
Mechanisms for Fair Allocation Problems: No-Punishment Payment Rules in Verifiable Settings2014-03-24Paper
Tree projections and structural decomposition methods: minimality and game-theoretic characterization2014-01-24Paper
On the complexity of core, kernel, and bargaining set2011-11-25Paper
Census Data Repair: A Challenging Application of Disjunctive Logic Programming2011-05-06Paper
On the complexity of regular-grammars with integer attributes2011-03-28Paper
Non-Transferable Utility Coalitional Games via Mixed-Integer Linear Constraints2010-09-09Paper
On the power of structural decompositions of graph-based representations of constraint problems2010-05-07Paper
Tree projections: Game characterization and computational aspects2010-01-07Paper
On the complexity of constrained Nash equilibria in graphical games2009-09-10Paper
Tractable Optimization Problems through Hypergraph-Based Structural Restrictions2009-07-14Paper
Uniform Constraint Satisfaction Problems and Database Theory2009-01-22Paper
Tree Projections: Hypergraph Games and Minimality2008-08-28Paper
Enhancing DLV instantiator by backjumping techniques2008-04-21Paper
Weighted hypertree decompositions and optimal query plans2007-04-26Paper
Graph-Theoretic Concepts in Computer Science2006-11-01Paper
https://portal.mardi4nfdi.de/entity/Q57157202006-01-04Paper
Abductive logic programs with penalization: semantics, complexity and implementation2005-04-29Paper
Robbers, marshals, and guards: Game theoretic and logical characterizations of hypertree width.2003-08-19Paper
https://portal.mardi4nfdi.de/entity/Q47980162003-03-18Paper
https://portal.mardi4nfdi.de/entity/Q47992532003-03-18Paper
https://portal.mardi4nfdi.de/entity/Q47791332002-11-25Paper
Hypertree decompositions and tractable queries2002-09-12Paper
Fixed-parameter complexity in AI and nonmonotonic reasoning2002-07-15Paper
Computing LOGCFL certificates2002-03-03Paper
A comparison of structural CSP decomposition methods2000-12-12Paper
Semantical and computational aspects of Horn approximations2000-08-21Paper
https://portal.mardi4nfdi.de/entity/Q49553252000-07-24Paper
https://portal.mardi4nfdi.de/entity/Q49386362000-07-10Paper
Propositional lower bounds: Algorithms and complexity2000-06-07Paper
https://portal.mardi4nfdi.de/entity/Q43758231998-06-09Paper
Disjunctive stable models: Unfounded sets, fixpoint semantics, and computation1998-01-12Paper

Research outcomes over time

This page was built for person: Francesco Scarcello