Marina Moscarini

Theor. Comput. Sci., 2022

A necessary condition for the equality of the clique number and the convexity number of a graph.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2022

2020

Computing a metric basis of a 2-connected bipartite distance-hereditary graph.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2020

On the geodetic iteration number of a graph in which geodesic and monophonic convexities are equivalent.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2020

2018

Two classes of graphs in which some problems related to convexity are efficiently solvable.

[BibT_eX]

[DOI]

Discret. Math. Algorithms Appl., 2018

2016

The contour of a bridged graph is geodetic.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2016

2015

Decomposability of abstract and path-induced convexities in hypergraphs.

[BibT_eX]

[DOI]

Discuss. Math. Graph Theory, 2015

On the geodeticity of the contour of a graph.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2015

2012

Characteristic Properties and Recognition of Graphs in which Geodesic and Monophonic convexities are Equivalent.

[BibT_eX]

[DOI]

Discret. Math. Algorithms Appl., 2012

2011

Computing simple-path convex hulls in hypergraphs.

[BibT_eX]

[DOI]

Inf. Process. Lett., 2011

2010

Simple algorithms for minimal triangulation of a graph and backward selection of a decomposable Markov network.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2010

2007

An analytical approach to the inference of summary data of additive type.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2007

2006

Auditing sum-queries to make a statistical database secure.

[BibT_eX]

[DOI]

ACM Trans. Inf. Syst. Secur., 2006

Minimal invariant sets in a vertex-weighted graph.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2006

2003

Privacy in Multidimensional Databases.

[BibT_eX]

[DOI]

Proceedings of the Multidimensional Databases: Problems and Solutions, 2003

2000

Decomposition of a hypergraph by partial-edge separators.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2000

Looking for Alternative Ways to Query Database through the Web: an Iconic Approach with IVQS.

[BibT_eX]

Marcello Valeri

Flavio Fontana

Proceedings of WebNet 2000 - World Conference on the WWW and Internet, San Antonio, Texas, USA, October 30, 2000

1998

A Fast Algorithm for Query Optimization in Universal-Relation Databases.

[BibT_eX]

[DOI]

J. Comput. Syst. Sci., 1998

Computational Issues Connected with the Protection of Sensitive Statistics by Auditing Sum Queries.

[BibT_eX]

[DOI]

Proceedings of the 10th International Conference on Scientific and Statistical Database Management, 1998

1997

Suppressing marginal totals from a two-dimensional table to protect sensitive information.

[BibT_eX]

[DOI]

Stat. Comput., 1997

1996

Censoring Statistical Tables to Protect Sensitive Information: Easy and Hard Problems.

[BibT_eX]

[DOI]

Proceedings of the Eighth International Conference on Scientific and Statistical Database Management, 1996

1993

Doubly chordal graphs, steiner trees, and connected domination.

[BibT_eX]

[DOI]

Networks, 1993

1991

Suppressing Marginal Cells to Protect Sensitive Information in a Two-Dimensional Statistical Table.

[BibT_eX]

[DOI]

Maurizio Rafanelli

Proceedings of the Tenth ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems, 1991

1990

Query Evaluability in Statistical Databases.

[BibT_eX]

[DOI]

IEEE Trans. Knowl. Data Eng., 1990

1989

Dynamic query interpretation in relational databases.

[BibT_eX]

[DOI]

Paolino Di Felice

Inf. Syst., 1989

Aggregate Evaluability in Statistical Databases.

[BibT_eX]

[DOI]

Proceedings of the Fifteenth International Conference on Very Large Data Bases, 1989

1988

Distance-Hereditary Graphs, Steiner Trees, and Connected Domination.

[BibT_eX]

[DOI]

SIAM J. Comput., 1988

On Hypergraph Acyclicity and Graph Chordality.

[BibT_eX]

[DOI]

Inf. Process. Lett., 1988

The Steiner Tree Problem and Homogeneous Sets.

[BibT_eX]

[DOI]

Antonio Sassano

Proceedings of the Mathematical Foundations of Computer Science 1988, 1988

1987

On Global Context Dependencies and their Properties.

[BibT_eX]

[DOI]

Proceedings of the MFDBS 87, 1987

1986

Chordality Properties on Graphs and Minimal Conceptual Connections in Semantic Data Models.

[BibT_eX]

[DOI]

J. Comput. Syst. Sci., 1986

Recognition Algorithms and Design Methodologies for Acyclic Database Schemes.

[BibT_eX]

Adv. Comput. Res., 1986

1985

On the Existence of Acyclic Views in a Database Scheme.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 1985

1984

On the Recognition and Design of Acyclic Databases.

[BibT_eX]

[DOI]

Proceedings of the Third ACM SIGACT-SIGMOD Symposium on Principles of Database Systems, 1984

1983

Answering Queries in Relational Databases.

[BibT_eX]

[DOI]

Nicolas Spyratos

Proceedings of the SIGMOD'83, 1983

Views Integration.

[BibT_eX]

Maurizio Lenzerini

Proceedings of the Methodology and Tools for Data Base Design., 1983

1982

Inclusion and Equivalence between Relational Database Schemata.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 1982

Minimal Coverings of Acyclic Database Schemata.

[BibT_eX]

Proceedings of the Advances in Data Base Theory, 1982

1981

Formal Tools for Top-Down and Bottom-Up Generation of Acyclic Relational Schemata.

[BibT_eX]

Proceedings of the 7th Conference Graphtheoretic Concepts in Computer Science (WG '81), 1981

1980

Conceptual Relations between Databases Transformed under Join and Projection.

[BibT_eX]

[DOI]

Proceedings of the Mathematical Foundations of Computer Science 1980 (MFCS'80), 1980

On the Equivalence among Data Base Schemata.

[BibT_eX]

Proceedings of the Proceedings International Conference on Data Bases, 1980

1976

On the Complexity of Decision Problems for Classes of Simple Programs on Strings.

[BibT_eX]

[DOI]