default search action
Marina Moscarini
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2022
- [j26]Marina Moscarini:
A necessary condition for the equality of the clique number and the convexity number of a graph. Discret. Appl. Math. 314: 191-196 (2022) - [j25]Marina Moscarini:
Computing a metric basis of a bipartite distance-hereditary graph. Theor. Comput. Sci. 900: 20-24 (2022) - 2020
- [j24]Marina Moscarini:
On the geodetic iteration number of a graph in which geodesic and monophonic convexities are equivalent. Discret. Appl. Math. 283: 142-152 (2020) - [j23]Marina Moscarini:
Computing a metric basis of a 2-connected bipartite distance-hereditary graph. Theor. Comput. Sci. 804: 186-206 (2020)
2010 – 2019
- 2018
- [j22]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): 1850042:1-1850042:22 (2018) - 2016
- [j21]Mauro Mezzini
, Marina Moscarini
The contour of a bridged graph is geodetic. Discret. Appl. Math. 204: 213-215 (2016) - 2015
- [j20]Mauro Mezzini
On the geodeticity of the contour of a graph. Discret. Appl. Math. 181: 209-220 (2015) - [j19]Francesco M. Malvestuto, Marina Moscarini
Decomposability of abstract and path-induced convexities in hypergraphs. Discuss. Math. Graph Theory 35(3): 493-515 (2015) - 2012
- [j18]Francesco M. Malvestuto, Mauro Mezzini
Characteristic Properties and Recognition of Graphs in which Geodesic and Monophonic convexities are Equivalent. Discret. Math. Algorithms Appl. 4(4) (2012) - 2011
- [j17]Francesco M. Malvestuto, Mauro Mezzini
Computing simple-path convex hulls in hypergraphs. Inf. Process. Lett. 111(5): 231-234 (2011) - 2010
- [j16]Mauro Mezzini
Simple algorithms for minimal triangulation of a graph and backward selection of a decomposable Markov network. Theor. Comput. Sci. 411(7-9): 958-966 (2010)
2000 – 2009
- 2007
- [j15]Francesco M. Malvestuto, Mauro Mezzini
An analytical approach to the inference of summary data of additive type. Theor. Comput. Sci. 385(1-3): 264-285 (2007) - 2006
- [j14]Francesco M. Malvestuto, Mauro Mezzini
Minimal invariant sets in a vertex-weighted graph. Theor. Comput. Sci. 362(1-3): 140-161 (2006) - [j13]Francesco M. Malvestuto, Mauro Mezzini
Auditing sum-queries to make a statistical database secure. ACM Trans. Inf. Syst. Secur. 9(1): 31-60 (2006) - 2003
- [p2]Francesco M. Malvestuto, Marina Moscarini:
Privacy in Multidimensional Databases. Multidimensional Databases 2003: 310-360 - 2000
- [j12]Francesco M. Malvestuto, Marina Moscarini
Decomposition of a hypergraph by partial-edge separators. Theor. Comput. Sci. 237(1-2): 57-79 (2000) - [c17]Marcello Valeri, Flavio Fontana, Marina Moscarini:
Looking for Alternative Ways to Query Database through the Web: an Iconic Approach with IVQS. WebNet 2000: 953-954
1990 – 1999
- 1998
- [j11]Francesco M. Malvestuto, Marina Moscarini:
A Fast Algorithm for Query Optimization in Universal-Relation Databases. J. Comput. Syst. Sci. 56(3): 299-309 (1998) - [c16]Francesco M. Malvestuto, Marina Moscarini:
Computational Issues Connected with the Protection of Sensitive Statistics by Auditing Sum Queries. SSDBM 1998: 134-144 - 1997
- [j10]Francesco M. Malvestuto, Marina Moscarini:
Suppressing marginal totals from a two-dimensional table to protect sensitive information. Stat. Comput. 7(2): 101-114 (1997) - 1996
- [c15]Francesco M. Malvestuto, Marina Moscarini:
Censoring Statistical Tables to Protect Sensitive Information: Easy and Hard Problems. SSDBM 1996: 12-21 - 1995
- [c14]Francesco M. Malvestuto, Marina Moscarini:
A Fast Algorithm for Query Optimization in Universal Relation Databases. SEBD 1995: 343-361 - 1993
- [j9]Marina Moscarini:
Doubly chordal graphs, steiner trees, and connected domination. Networks 23(1): 59-69 (1993) - 1991
- [c13]Francesco M. Malvestuto, Marina Moscarini, Maurizio Rafanelli:
Suppressing Marginal Cells to Protect Sensitive Information in a Two-Dimensional Statistical Table. PODS 1991: 252-258 - 1990
- [j8]Francesco M. Malvestuto, Marina Moscarini
Query Evaluability in Statistical Databases. IEEE Trans. Knowl. Data Eng. 2(4): 425-430 (1990)
1980 – 1989
- 1989
- [j7]Alessandro D'Atri, Paolino Di Felice, Marina Moscarini
Dynamic query interpretation in relational databases. Inf. Syst. 14(3): 195-204 (1989) - [c12]Francesco M. Malvestuto, Marina Moscarini:
Aggregate Evaluability in Statistical Databases. VLDB 1989: 279-286 - 1988
- [j6]Alessandro D'Atri, Marina Moscarini
On Hypergraph Acyclicity and Graph Chordality. Inf. Process. Lett. 29(5): 271-274 (1988) - [j5]Alessandro D'Atri, Marina Moscarini:
Distance-Hereditary Graphs, Steiner Trees, and Connected Domination. SIAM J. Comput. 17(3): 521-538 (1988) - [c11]Alessandro D'Atri, Marina Moscarini, Antonio Sassano:
The Steiner Tree Problem and Homogeneous Sets. MFCS 1988: 249-261 - 1987
- [c10]Alessandro D'Atri, Paolino Di Felice, V. S. Lakshmanan, Marina Moscarini:
On Global Context Dependencies and their Properties. MFDBS 1987: 71-79 - [c9]Alessandro D'Atri, Paolino Di Felice, Marina Moscarini:
Dynamic Query Interpretation in Relational Databases. PODS 1987: 70-78 - 1986
- [j4]Alessandro D'Atri, Marina Moscarini:
Recognition Algorithms and Design Methodologies for Acyclic Database Schemes. Adv. Comput. Res. 3: 43-67 (1986) - [j3]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): 179-202 (1986) - 1985
- [j2]Giorgio Ausiello, Alessandro D'Atri, Marina Moscarini
On the Existence of Acyclic Views in a Database Scheme. Theor. Comput. Sci. 35: 165-177 (1985) - [c8]Giorgio Ausiello, Alessandro D'Atri, Marina Moscarini:
Chordality Properties on Graphs and Minimal Conceptual Connections in Semantic Data Models. PODS 1985: 164-170 - 1984
- [c7]Alessandro D'Atri, Marina Moscarini:
On the Recognition and Design of Acyclic Databases. PODS 1984: 1-8 - 1983
- [c6]Alessandro D'Atri, Marina Moscarini, Nicolas Spyratos:
Answering Queries in Relational Databases. SIGMOD Conference 1983: 173-177 - [p1]Carlo Batini, Maurizio Lenzerini, Marina Moscarini:
Views Integration. Methodology and Tools for Data Base Design 1983: 57-84 - 1982
- [j1]Paolo Atzeni
Inclusion and Equivalence between Relational Database Schemata. Theor. Comput. Sci. 19: 267-285 (1982) - [c5]Giorgio Ausiello, Alessandro D'Atri, Marina Moscarini:
Minimal Coverings of Acyclic Database Schemata. Advances in Data Base Theory 1982: 27-51 - 1981
- [c4]Carlo Batini, Alessandro D'Atri, Marina Moscarini:
Formal Tools for Top-Down and Bottom-Up Generation of Acyclic Relational Schemata. WG 1981: 219-229 - 1980
- [c3]Giorgio Ausiello, Carlo Batini, Marina Moscarini:
On the Equivalence among Data Base Schemata. ICOD 1980: 34-46 - [c2]Giorgio Ausiello, Carlo Batini, Marina Moscarini:
Conceptual Relations between Databases Transformed under Join and Projection. MFCS 1980: 123-136
1970 – 1979
- 1976
- [c1]Giorgio Ausiello, Marina Moscarini:
On the Complexity of Decision Problems for Classes of Simple Programs on Strings. GI Jahrestagung 1976: 148-163
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2025-01-20 23:00 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: