Infeasibility Certificates and the Complexity of the Core in Coalitional Games. - Enrico Malizia; Luigi Palopoli 001; Francesco Scarcello (IJCAI, 2007)

On the Computational Complexity of the Bargaining Set and the Kernel in Compact Coalitional Games - Enrico Malizia; Luigi Palopoli 001; Francesco Scarcello (CoRR, 2008)

Constrained coalitional games: formal framework, properties, and complexity results. - Gianluigi Greco; Enrico Malizia; Luigi Palopoli 001; Francesco Scarcello (AAMAS (2), 2009)

On the Complexity of Compact Coalitional Games. - Gianluigi Greco; Enrico Malizia; Luigi Palopoli 001; Francesco Scarcello (IJCAI, 2009)

Non-Transferable Utility Coalitional Games via Mixed-Integer Linear Constraints. - Gianluigi Greco; Enrico Malizia; Luigi Palopoli 001; Francesco Scarcello (J. Artif. Intell. Res., 2010)

On the Complexity of the Core over Coalition Structures. - Gianluigi Greco; Enrico Malizia; Luigi Palopoli 001; Francesco Scarcello (IJCAI, 2011)

Subsidies, Stability, and Restricted Cooperation in Coalitional Games. - Reshef Meir; Jeffrey S. Rosenschein; Enrico Malizia (IJCAI, 2011)

On the complexity of core, kernel, and bargaining set. - Gianluigi Greco; Enrico Malizia; Luigi Palopoli 001; Francesco Scarcello (Artif. Intell., 2011)

Hard and Easy k-Typed Compact Coalitional Games: The Knowledge of Player Types Marks the Boundary. - Gianluigi Greco; Enrico Malizia; Francesco Scarcello; Luigi Palopoli 001 (ECAI, 2012)

How much navigable is the Web of Linked Data? - Valeria Fionda; Enrico Malizia (ISWC (Posters & Demos), 2014)

The Complexity of the Nucleolus in Compact Games. - Gianluigi Greco; Enrico Malizia; Luigi Palopoli 001; Francesco Scarcello (ACM Trans. Comput. Theory, 2014)

On the Complexity of mCP-nets. - Thomas Lukasiewicz; Enrico Malizia (AAAI, 2016)

A novel characterization of the complexity class ϴPk based on counting and comparison. - Thomas Lukasiewicz; Enrico Malizia (Theor. Comput. Sci., 2017)

More Complexity Results about Reasoning over ( m )CP-nets. - Enrico Malizia (AAMAS, 2018)

Complexity of Approximate Query Answering under Inconsistency in Datalog+/-. - Thomas Lukasiewicz; Enrico Malizia; Cristian Molinaro (SEBD, 2018)

Complexity Results for Preference Aggregation over (m)CP-nets: Pareto and Majority Voting. - Thomas Lukasiewicz; Enrico Malizia (CoRR, 2018)

Bounds on the Cost of Stabilizing a Cooperative Game. - Yoram Bachrach; Edith Elkind; Enrico Malizia; Reshef Meir; Dmitrii V. Pasechnik; Jeffrey S. Rosenschein; Jörg Rothe; Michael Zuckerman (J. Artif. Intell. Res., 2018)

Achieving New Upper Bounds for the Hypergraph Duality Problem through Logic. - Georg Gottlob; Enrico Malizia (SIAM J. Comput., 2018)

Complexity results for preference aggregation over (m)CP-nets: Pareto and majority voting. - Thomas Lukasiewicz; Enrico Malizia (Artif. Intell., 2019)

Explanations for Ontology-Mediated Query Answering in Description Logics (Extended Abstract). - Ismail Ilkan Ceylan; Thomas Lukasiewicz; Enrico Malizia; Andrius Vaicenavicius (Description Logics, 2020)

Explanations for Ontology-Mediated Query Answering in Description Logics. - Ismail Ilkan Ceylan; Thomas Lukasiewicz; Enrico Malizia; Andrius Vaicenavicius (ECAI, 2020)

Explanations for Negative Query Answers under Existential Rules. - Ismail Ilkan Ceylan; Thomas Lukasiewicz; Enrico Malizia; Cristian Molinaro; Andrius Vaicenavicius (KR, 2020)

Preferred Explanations for Ontology-Mediated Queries under Existential Rules. - Ismail Ilkan Ceylan; Thomas Lukasiewicz; Enrico Malizia; Cristian Molinaro; Andrius Vaicenavicius (AAAI, 2021)

Materializing Knowledge Bases via Trigger Graphs. - Efthymia Tsamoura; David Carral; Enrico Malizia; Jacopo Urbani (Proc. VLDB Endow., 2021)

Pareto and Majority Voting in mCP-nets. - Thomas Lukasiewicz; Enrico Malizia (DP@AI*IA, 2022)

Explanations for Negative Query Answers under Inconsistency-Tolerant Semantics. - Thomas Lukasiewicz; Enrico Malizia; Cristian Molinaro (IJCAI, 2022)

Query Answer Explanations under Existential Rules. - Ismail Ilkan Ceylan; Thomas Lukasiewicz; Enrico Malizia; Andrius Vaicenavicius (SEBD, 2022)

Explanations for Inconsistency-Tolerant Query Answering under Existential Rules. - Thomas Lukasiewicz; Enrico Malizia; Cristian Molinaro (SEBD, 2022)

Complexity of Inconsistency-Tolerant Query Answering in Datalog+/- under Cardinality-Based Repairs. - Thomas Lukasiewicz; Enrico Malizia; Andrius Vaicenavicius (SEBD, 2022)

Complexity results for preference aggregation over (m)CP-nets: Max and rank voting. - Thomas Lukasiewicz; Enrico Malizia (Artif. Intell., 2022)

Inconsistency-tolerant query answering for existential rules. - Thomas Lukasiewicz; Enrico Malizia; Maria Vanina Martinez; Cristian Molinaro; Andreas Pieris; Gerardo I. Simari (Artif. Intell., 2022)

Guest Editorial: Reasoning With Inconsistent, Incomplete, and Uncertain Knowledge. - Enrico Malizia; Cristian Molinaro; Francesco Parisi (IEEE Intell. Syst., 2022)

Complexity of Inconsistency-Tolerant Query Answering in Datalog+/- under Preferred Repairs. - Thomas Lukasiewicz; Enrico Malizia; Cristian Molinaro (KR, 2023)

On the Complexity of Querying Inconsistent Weighted Knowledge Bases (Short paper). - Thomas Lukasiewicz; Enrico Malizia; Cristian Molinaro (DP@AI*IA, 2024)

Hausdorff Reductions and the Exponential Hierarchies. - Enrico Malizia (CoRR, 2024)

Explanations for query answers under existential rules. - Ismail Ilkan Ceylan; Thomas Lukasiewicz; Enrico Malizia; Andrius Vaicenavicius (Artif. Intell., 2025)

On the Complexity of Global Necessary Reasons to Explain Classification. - Marco Calautti; Enrico Malizia; Cristian Molinaro (CoRR, 2025)