| Distance-hereditary graphs, Steiner trees, and connected domination A D’Atri, M Moscarini SIAM Journal on Computing 17 (3), 521-538, 1988 | 167 | 1988 |
| Inclusion and equivalence between relational database schemata P Atzeni, G Ausiello, C Batini, M Moscarini Theor. Comput. Sci. 19 (3), 267-285, 1982 | 81 | 1982 |
| Chordality properties on graphs and minimal conceptual connections in semantic data models G Ausiello, A D'Atri, M Moscarini Proceedings of the fourth ACM SIGACT-SIGMOD symposium on Principles of …, 1985 | 72 | 1985 |
| Doubly chordal graphs, Steiner trees, and connected domination M Moscarini Networks 23 (1), 59-69, 1993 | 69 | 1993 |
| Auditing sum-queries to make a statistical database secure FM Malvestuto, M Mezzini, M Moscarini ACM Transactions on Information and System Security (TISSEC) 9 (1), 31-60, 2006 | 51 | 2006 |
| Views Integration. C Batini, M Lenzerini, M Moscarini Methodology and tools for data base design, 57-84, 1983 | 42 | 1983 |
| On hypergraph acyclicity and graph chordality A D'atri, M Moscarini Information Processing Letters 29 (5), 271-274, 1988 | 37 | 1988 |
| Suppressing marginal cells to protect sensitive information in a two-dimensional statistical table FM Malvestuto, M Moscarini, M Rafanelli Proceedings of the tenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of …, 1991 | 36 | 1991 |
| Query evaluability in statistical databases FM Malvestuto, M Moscarini IEEE Transactions on Knowledge and Data Engineering 2 (4), 425-430, 1990 | 34 | 1990 |
| An audit expert for large statistical databases FM Malvestuto, M Moscarini Conference on Statistical Data Protection'98, 29-43, 1998 | 26 | 1998 |
| Computational issues connected with the protection of sensitive statistics by auditing sum-queries FM Malvestuto, M Moscarini Proceedings. Tenth International Conference on Scientific and Statistical …, 1998 | 25 | 1998 |
| Dynamic query interpretation in relational databases A D'Atri, P Di Felice, M Moscarini Proceedings of the sixth ACM SIGACT-SIGMOD-SIGART symposium on Principles of …, 1987 | 25 | 1987 |
| Recognition algorithms and design methodologies for acyclic database schemes A D'Atri, M Moscarini Advances in Computing Research 3, 43-67, 1986 | 23 | 1986 |
| Minimal coverings of acyclic database schemata G Ausiello, A D’Atri, M Moscarini Advances in Data Base Theory: Volume 2, 27-51, 1984 | 23 | 1984 |
| Simple algorithms for minimal triangulation of a graph and backward selection of a decomposable Markov network M Mezzini, M Moscarini Theoretical computer science 411 (7-9), 958-966, 2010 | 21 | 2010 |
| On the recognition and design of acyclic databases A D'atri, M Moscarini Proceedings of the 3rd ACM SIGACT-SIGMOD symposium on Principles of database …, 1984 | 21 | 1984 |
| Decomposition of a hypergraph by partial-edge separators FM Malvestuto, M Moscarini Theoretical Computer Science 237 (1-2), 57-79, 2000 | 19 | 2000 |
| The Steiner tree problem and homogeneous sets A D'Atri, M Moscarini, A Sassano Mathematical Foundations of Computer Science 1988: Proceedings of the 13th …, 1988 | 19 | 1988 |
| On the geodeticity of the contour of a graph M Mezzini, M Moscarini Discrete Applied Mathematics 181, 209-220, 2015 | 17 | 2015 |
| On the equivalence among data base schemata G Ausiello, C Batini, M Moscarini | 17 | 1980 |
