Enrico Malizia

Dr Enrico Malizia

Research Assistant

E: firstname.lastname at cs.ox.ac.uk

Wolfson Building, Parks Road, Oxford OX1 3QD

Themes:

On the Complexity of mCP−Nets

Thomas Lukasiewicz and Enrico Malizia

In Dale Schuurmans and Michael Wellman, editors, Proceedings of the 30th National Conference on Artificial Intelligence‚ AAAI 2016‚ Phoenix‚ Arizona‚ USA‚ February 12–17‚ 2016. Pages 558−564. AAAI Press. February, 2016.

Details about On the Complexity of mCP−Nets | BibTeX data for On the Complexity of mCP−Nets | Link to On the Complexity of mCP−Nets
Achieving New Upper Bounds for the Hypergraph Duality Problem through Logic

Georg Gottlob and Enrico Malizia

No. arXiv:1407.2912. Computing Research Repository (CoRR). June, 2015.

Details about Achieving New Upper Bounds for the Hypergraph Duality Problem through Logic | BibTeX data for Achieving New Upper Bounds for the Hypergraph Duality Problem through Logic | Link to Achieving New Upper Bounds for the Hypergraph Duality Problem through Logic
The Complexity of the Nucleolus in Compact Games

Gianluigi Greco‚ Enrico Malizia‚ Luigi Palopoli and Francesco Scarcello

In ACM Transactions on Computation Theory. Vol. 7. No. 1. Pages 3:1–3:52. December, 2014.

Details about The Complexity of the Nucleolus in Compact Games | BibTeX data for The Complexity of the Nucleolus in Compact Games | Link to The Complexity of the Nucleolus in Compact Games