default search action
Mauro Mezzini
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [j17]Mauro Mezzini, Fernando Cuartero Gomez, Jose Javier Paulet Gonzalez, Hernan Indibil de la Cruz Calvo, Vicente Pascual, Fernando L. Pelayo:
Polynomial quantum computing algorithms for solving the dualization problem for positive Boolean functions. Quantum Mach. Intell. 6(2): 71 (2024) - [c14]Lorenzo Battisti, Sabrina Fagioli, Alessio Ferrato, Carla Limongelli, Stefano Mastandrea, Mauro Mezzini, Davide Nardo, Giuseppe Sansonetti:
Towards Empathetic Social Robots: Investigating the Interplay between Facial Expressions and Brain Activity (short paper). IUI Workshops 2024 - [c13]Alessio Ferrato
, Carla Limongelli
Artwork Segmentation in Eye-Tracking Experiments: Challenges and Future Directions. UMAP (Adjunct Publication) 2024 - 2023
- [c12]Lorenzo Battisti, Sabrina Fagioli, Alessio Ferrato, Carla Limongelli, Stefano Mastandrea, Mauro Mezzini, Davide Nardo, Giuseppe Sansonetti:
Towards a Deeper Understanding: EEG and Facial Expressions in Museums (short paper). IAI4CH@AI*IA 2023: 42-49 - [c11]Mauro Mezzini, Fernando Cuartero Gomez, Fernando López Pelayo, Jose Javier Paulet Gonzales, Hernan Indibil de la Cruz Calvo, Vicente Pascual:
A polynomial quantum computing algorithm for solving the dualization problem for positive boolean functions (Short Paper). AIQxQIA@AI*IA 2023 - [c10]Mauro Mezzini:
Emotion detection using deep learning on spectrogram images of the electroencephalogram. AIxHMI@AI*IA 2023: 1-14 - [c9]Lorenzo Battisti, Alessio Ferrato, Carla Limongelli, Mauro Mezzini, Giuseppe Sansonetti:
Deep Learning Based Emotion Classification through EEG Spectrogram Images 211-215. IUI Workshops 2023: 211-215 - [c8]Daria Occhioni
Eyeing the Visitor's Gaze for Artwork Recommendation. UMAP (Adjunct Publication) 2023: 374-378 - [i3]Mauro Mezzini, Fernando Cuartero Gomez, Fernando L. Pelayo, Jose Javier Paulet Gonzales, Hernan Indibil de la Cruz Calvo
A polynomial quantum computing algorithm for solving the dualization problem. CoRR abs/2308.14819 (2023) - 2022
- [j16]Mauro Mezzini
An O(mn2) algorithm for computing the strong geodetic number in outerplanar graphs. Discuss. Math. Graph Theory 42(2): 591-599 (2022) - [c7]Alessandro Aiuti, Alessio Ferrato, Carla Limongelli, Mauro Mezzini, Giuseppe Sansonetti:
Inferring Emotional State from Facial Micro-Expressions 209-212. IUI Workshops 2022: 209-212 - [c6]Alessio Ferrato, Carla Limongelli, Mauro Mezzini, Giuseppe Sansonetti:
A Deep Learning-based Approach to Model Museum Visitors 217-221. IUI Workshops 2022: 217-221 - [c5]Alessio Ferrato
The META4RS Proposal: Museum Emotion and Tracking Analysis For Recommender Systems. UMAP (Adjunct Publication) 2022: 406-409 - [i2]Hernán I. de la Cruz, Fernando L. Pelayo, Vicente Pascual, Jose J. Paulet, Fernando Cuartero, Luis Llana, Mauro Mezzini:
Quantum invariants for the graph isomorphism problem. CoRR abs/2209.14914 (2022) - 2021
- [c4]Alessio Ferrato, Carla Limongelli, Mauro Mezzini, Giuseppe Sansonetti:
Exploiting Micro Facial Expressions for More Inclusive User Interfaces. IUI Workshops 2021 - [i1]Mauro Mezzini, Fernando L. Pelayo, Fernando Cuartero:
Quantum algorithm for doubling the amplitude of the search problem's solution states. CoRR abs/2105.06935 (2021) - 2020
- [c3]Mauro Mezzini
Tracking Museum Visitors through Convolutional Object Detectors. UMAP (Adjunct Publication) 2020: 352-355
2010 – 2019
- 2018
- [j15]Mauro Mezzini
Polynomial time algorithm for computing a minimum geodetic set in outerplanar graphs. Theor. Comput. Sci. 745: 63-74 (2018) - 2016
- [j14]Mauro Mezzini
The contour of a bridged graph is geodetic. Discret. Appl. Math. 204: 213-215 (2016) - [j13]Mauro Mezzini
On the geodetic iteration number of the contour of a graph. Discret. Appl. Math. 206: 211-214 (2016) - 2015
- [j12]Mauro Mezzini
On the geodeticity of the contour of a graph. Discret. Appl. Math. 181: 209-220 (2015) - 2012
- [j11]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) - [j10]Mauro Mezzini
Fully dynamic algorithm for chordal graphs with O(1) query-time and O(n2) update-time. Theor. Comput. Sci. 445: 82-92 (2012) - 2011
- [j9]Francesco M. Malvestuto, Mauro Mezzini
Computing simple-path convex hulls in hypergraphs. Inf. Process. Lett. 111(5): 231-234 (2011) - [j8]Mauro Mezzini
Fast minimal triangulation algorithm using minimum degree criterion. Theor. Comput. Sci. 412(29): 3775-3787 (2011) - 2010
- [j7]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) - [j6]Mauro Mezzini
On the complexity of finding chordless paths in bipartite graphs and some interval operators in graphs and hypergraphs. Theor. Comput. Sci. 411(7-9): 1212-1220 (2010)
2000 – 2009
- 2007
- [j5]Mauro Mezzini
Finding a Nonempty Algebraic Subset of an Edge Set in Linear Time. J. Graph Algorithms Appl. 11(1): 239-257 (2007) - [j4]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
- [j3]Francesco M. Malvestuto, Mauro Mezzini
Minimal invariant sets in a vertex-weighted graph. Theor. Comput. Sci. 362(1-3): 140-161 (2006) - [j2]Francesco M. Malvestuto, Mauro Mezzini
Auditing sum-queries to make a statistical database secure. ACM Trans. Inf. Syst. Secur. 9(1): 31-60 (2006) - 2004
- [c2]Francesco M. Malvestuto, Mauro Mezzini
Privacy Preserving and Data Mining in an On-Line Statistical Database of Additive Type. Privacy in Statistical Databases 2004: 353-365 - 2003
- [c1]Francesco M. Malvestuto, Mauro Mezzini
Auditing Sum Queries. ICDT 2003: 126-142 - 2002
- [j1]Francesco M. Malvestuto, Mauro Mezzini
A Linear Algorithm for Finding the Invariant Edges of an Edge-Weighted Graph. SIAM J. Comput. 31(5): 1438-1455 (2002)
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 2024-11-07 21:33 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: