Marina Moscarini

Publication Activity (10 Years)

Years Active: 1976-2022
Publications (10 Years): 8

Top Topics

Cosine Distance

Triangular Inequality

Directed Acyclic Graph

Top Venues

Discret. Appl. Math.

Theor. Comput. Sci.

Discuss. Math. Graph Theory

Discret. Math. Algorithms Appl.

Publications

Marina Moscarini
Computing a metric basis of a bipartite distance-hereditary graph. Theor. Comput. Sci. 900 (2022)
Marina Moscarini
A necessary condition for the equality of the clique number and the convexity number of a graph. Discret. Appl. Math. 314 (2022)
Marina Moscarini
Computing a metric basis of a 2-connected bipartite distance-hereditary graph. Theor. Comput. Sci. 804 (2020)
Marina Moscarini
On the geodetic iteration number of a graph in which geodesic and monophonic convexities are equivalent. Discret. Appl. Math. 283 (2020)
Marina Moscarini, Francesco M. Malvestuto
Two classes of graphs in which some problems related to convexity are efficiently solvable. Discret. Math. Algorithms Appl. 10 (3) (2018)
Mauro Mezzini, Marina Moscarini
The contour of a bridged graph is geodetic. Discret. Appl. Math. 204 (2016)
Mauro Mezzini, Marina Moscarini
On the geodeticity of the contour of a graph. Discret. Appl. Math. 181 (2015)
Francesco M. Malvestuto, Marina Moscarini
Decomposability of abstract and path-induced convexities in hypergraphs. Discuss. Math. Graph Theory 35 (3) (2015)
Francesco M. Malvestuto, Mauro Mezzini, Marina Moscarini
Characteristic Properties and Recognition of Graphs in which Geodesic and Monophonic convexities are Equivalent. Discret. Math. Algorithms Appl. 4 (4) (2012)
Francesco M. Malvestuto, Mauro Mezzini, Marina Moscarini
Computing simple-path convex hulls in hypergraphs. Inf. Process. Lett. 111 (5) (2011)
Mauro Mezzini, Marina Moscarini
Simple algorithms for minimal triangulation of a graph and backward selection of a decomposable Markov network. Theor. Comput. Sci. 411 (7-9) (2010)
Francesco M. Malvestuto, Mauro Mezzini, Marina Moscarini
An analytical approach to the inference of summary data of additive type. Theor. Comput. Sci. 385 (1-3) (2007)
Francesco M. Malvestuto, Mauro Mezzini, Marina Moscarini
Auditing sum-queries to make a statistical database secure. ACM Trans. Inf. Syst. Secur. 9 (1) (2006)
Francesco M. Malvestuto, Mauro Mezzini, Marina Moscarini
Minimal invariant sets in a vertex-weighted graph. Theor. Comput. Sci. 362 (1-3) (2006)
Francesco M. Malvestuto, Marina Moscarini
Decomposition of a hypergraph by partial-edge separators. Theor. Comput. Sci. 237 (1-2) (2000)
Marcello Valeri, Flavio Fontana, Marina Moscarini
Looking for Alternative Ways to Query Database through the Web: an Iconic Approach with IVQS. WebNet (2000)
Francesco M. Malvestuto, Marina Moscarini
A Fast Algorithm for Query Optimization in Universal-Relation Databases. J. Comput. Syst. Sci. 56 (3) (1998)
Francesco M. Malvestuto, Marina Moscarini
Computational Issues Connected with the Protection of Sensitive Statistics by Auditing Sum Queries. SSDBM (1998)
Francesco M. Malvestuto, Marina Moscarini
Suppressing marginal totals from a two-dimensional table to protect sensitive information. Stat. Comput. 7 (2) (1997)
Francesco M. Malvestuto, Marina Moscarini
Censoring Statistical Tables to Protect Sensitive Information: Easy and Hard Problems. SSDBM (1996)
Francesco M. Malvestuto, Marina Moscarini
A Fast Algorithm for Query Optimization in Universal Relation Databases. SEBD (1995)
Francesco M. Malvestuto, Marina Moscarini, Maurizio Rafanelli
Suppressing Marginal Cells to Protect Sensitive Information in a Two-Dimensional Statistical Table. PODS (1991)
Francesco M. Malvestuto, Marina Moscarini
Query Evaluability in Statistical Databases. IEEE Trans. Knowl. Data Eng. 2 (4) (1990)
Alessandro D'Atri, Paolino Di Felice, Marina Moscarini
Dynamic query interpretation in relational databases. Inf. Syst. 14 (3) (1989)
Francesco M. Malvestuto, Marina Moscarini
Aggregate Evaluability in Statistical Databases. VLDB (1989)
Alessandro D'Atri, Marina Moscarini
Distance-Hereditary Graphs, Steiner Trees, and Connected Domination. SIAM J. Comput. 17 (3) (1988)
Alessandro D'Atri, Marina Moscarini, Antonio Sassano
The Steiner Tree Problem and Homogeneous Sets. MFCS (1988)
Alessandro D'Atri, Marina Moscarini
On Hypergraph Acyclicity and Graph Chordality. Inf. Process. Lett. 29 (5) (1988)
Alessandro D'Atri, Paolino Di Felice, Marina Moscarini
Dynamic Query Interpretation in Relational Databases. PODS (1987)
Alessandro D'Atri, Paolino Di Felice, V. S. Lakshmanan, Marina Moscarini
On Global Context Dependencies and their Properties. MFDBS (1987)
Alessandro D'Atri, Marina Moscarini
Recognition Algorithms and Design Methodologies for Acyclic Database Schemes. Adv. Comput. Res. 3 (1986)
Giorgio Ausiello, Alessandro D'Atri, Marina Moscarini
Chordality Properties on Graphs and Minimal Conceptual Connections in Semantic Data Models. J. Comput. Syst. Sci. 33 (2) (1986)
Giorgio Ausiello, Alessandro D'Atri, Marina Moscarini
Chordality Properties on Graphs and Minimal Conceptual Connections in Semantic Data Models. PODS (1985)
Giorgio Ausiello, Alessandro D'Atri, Marina Moscarini
On the Existence of Acyclic Views in a Database Scheme. Theor. Comput. Sci. 35 (1985)
Alessandro D'Atri, Marina Moscarini
On the Recognition and Design of Acyclic Databases. PODS (1984)
Alessandro D'Atri, Marina Moscarini, Nicolas Spyratos
Answering Queries in Relational Databases. SIGMOD Conference (1983)
Giorgio Ausiello, Alessandro D'Atri, Marina Moscarini
Minimal Coverings of Acyclic Database Schemata. Advances in Data Base Theory (1982)
Paolo Atzeni, Giorgio Ausiello, Carlo Batini, Marina Moscarini
Inclusion and Equivalence between Relational Database Schemata. Theor. Comput. Sci. 19 (1982)
Carlo Batini, Alessandro D'Atri, Marina Moscarini
Formal Tools for Top-Down and Bottom-Up Generation of Acyclic Relational Schemata. WG (1981)
Giorgio Ausiello, Carlo Batini, Marina Moscarini
Conceptual Relations between Databases Transformed under Join and Projection. MFCS (1980)
Giorgio Ausiello, Carlo Batini, Marina Moscarini
On the Equivalence among Data Base Schemata. ICOD (1980)
Giorgio Ausiello, Marina Moscarini
On the Complexity of Decision Problems for Classes of Simple Programs on Strings. GI Jahrestagung (1976)