| On the complexity of the core over coalition structures G Greco, E Malizia, L Palopoli, F Scarcello Twenty-Second International Joint Conference on Artificial Intelligence, 2011 | 47 | 2011 |
| On the complexity of core, kernel, and bargaining set G Greco, E Malizia, L Palopoli, F Scarcello Artificial Intelligence 175 (12-13), 1877-1910, 2011 | 46 | 2011 |
| Subsidies, stability, and restricted cooperation in coalitional games R Meir, JS Rosenschein, E Malizia IJCAI 11, 301-306, 2011 | 34 | 2011 |
| On the Complexity of Compact Coalitional Games. G Greco, E Malizia, L Palopoli, F Scarcello IJCAI 9, 147-152, 2009 | 28 | 2009 |
| Infeasibility Certificates and the Complexity of the Core in Coalitional Games. E Malizia, L Palopoli, F Scarcello IJCAI 7, 1402-1407, 2007 | 24 | 2007 |
| Achieving new upper bounds for the hypergraph duality problem through logic G Gottlob, E Malizia SIAM Journal on Computing 47 (2), 456-492, 2018 | 18 | 2018 |
| The complexity of the nucleolus in compact games G Greco, E Malizia, L Palopoli, F Scarcello ACM Transactions on Computation Theory (TOCT) 7 (1), 1-52, 2015 | 18 | 2015 |
| Non-transferable utility coalitional games via mixed-integer linear constraints G Greco, E Malizia, L Palopoli, F Scarcello Journal of Artificial Intelligence Research 38, 633-685, 2010 | 16 | 2010 |
| Explanations for query answers under existential rules II Ceylan, T Lukasiewicz, E Malizia, A Vaicenavicius IJCAI, 2019 | 13 | 2019 |
| On the complexity of mCP-nets T Lukasiewicz, E Malizia Proceedings of the AAAI Conference on Artificial Intelligence 30 (1), 2016 | 12 | 2016 |
| A novel characterization of the complexity class ΘkP based on counting and comparison T Lukasiewicz, E Malizia Theoretical Computer Science 694, 21-33, 2017 | 10 | 2017 |
| Complexity of approximate query answering under inconsistency in datalog+/- T Lukasiewicz, E Malizia, C Molinaro IJCAI, 2018 | 9 | 2018 |
| Explanations for ontology-mediated query answering in description logics II Ceylan, T Lukasiewicz, E Malizia, A Vaicenavicius Proceedings of the 24th European conference on artificial intelligence (ECAI …, 2020 | 5 | 2020 |
| Complexity of inconsistency-tolerant query answering in Datalog+/–under cardinality-based repairs T Lukasiewicz, E Malizia, A Vaicenavičius Proceedings of the AAAI Conference on Artificial Intelligence 33 (01), 2962-2969, 2019 | 5 | 2019 |
| Constrained coalitional games: formal framework, properties, and complexity results G Greco, E Malizia, L Palopoli, F Scarcello Proceedings of The 8th International Conference on Autonomous Agents and …, 2009 | 4 | 2009 |
| Explanations for negative query answers under existential rules II Ceylan, T Lukasiewicz, E Malizia, C Molinaro, A Vaicenavičius Proceedings of the International Conference on Principles of Knowledge …, 2020 | 2 | 2020 |
| Explanations for inconsistency-tolerant query answering under existential rules T Lukasiewicz, E Malizia, C Molinaro Proceedings of the AAAI Conference on Artificial Intelligence 34 (03), 2909-2916, 2020 | 2 | 2020 |
| Bounds on the cost of stabilizing a cooperative game Y Bachrach, E Elkind, E Malizia, R Meir, D Pasechnik, JS Rosenschein, ... Journal of Artificial Intelligence Research 63, 987-1023, 2018 | 2 | 2018 |
| Complexity Results for Preference Aggregation over (m)CP-nets: Pareto and Majority Voting T Lukasiewicz, E Malizia arXiv preprint arXiv:1806.10018, 2018 | 2 | 2018 |
| Hard and Easy k-Typed Compact Coalitional Games: The Knowledge of Player Types Marks the Boundary. G Greco, E Malizia, F Scarcello, L Palopoli ECAI, 372-377, 2012 | 2 | 2012 |
Luigi Palopoliprofessor of computer science, University of CalabriaVerified email at dimes.unical.it
