Mauro Mezzini

Orcid: 0000-0002-5308-0097

According to our database1, Mauro Mezzini authored at least 33 papers between 2002 and 2024.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2024
Artwork Segmentation in Eye-Tracking Experiments: Challenges and Future Directions.
Proceedings of the Adjunct Proceedings of the 32nd ACM Conference on User Modeling, 2024

Towards Empathetic Social Robots: Investigating the Interplay between Facial Expressions and Brain Activity (short paper).
Proceedings of the Joint Proceedings of the ACM IUI 2024 Workshops co-located with the 29th Annual ACM Conference on Intelligent User Interfaces (IUI 2024), 2024

2023
A polynomial quantum computing algorithm for solving the dualization problem.
CoRR, 2023

Eyeing the Visitor's Gaze for Artwork Recommendation.
Proceedings of the Adjunct Proceedings of the 31st ACM Conference on User Modeling, 2023

Deep Learning Based Emotion Classification through EEG Spectrogram Images 211-215.
Proceedings of the Joint Proceedings of the IUI 2023 Workshops: HAI-GEN, 2023

Emotion detection using deep learning on spectrogram images of the electroencephalogram.
Proceedings of the 2nd Workshop on Artificial Intelligence for Human-Machine Interaction 2023 co-located with the 22nd International Conference of the Italian Association for Artificial Intelligence (AIxIA 2023), 2023

A polynomial quantum computing algorithm for solving the dualization problem for positive boolean functions (Short Paper).
Proceedings of the International Workshop on AI for Quantum and Quantum for AI (AIQxQIA 2023) co-located with 22nd International Conference of the Italian Association for Artificial Intelligence (AIxIA 2023), November 6, 2023

Towards a Deeper Understanding: EEG and Facial Expressions in Museums (short paper).
Proceedings of the 2nd Workshop on Artificial Intelligence for Cultural Heritage (IAI4CH 2023) co-located with the 22nd International Conference of the Italian Association for Artificial Intelligence (AIxIA 2023), 2023

2022
An O(mn<sup>2</sup>) algorithm for computing the strong geodetic number in outerplanar graphs.
Discuss. Math. Graph Theory, 2022

Quantum invariants for the graph isomorphism problem.
CoRR, 2022

The META4RS Proposal: Museum Emotion and Tracking Analysis For Recommender Systems.
Proceedings of the UMAP '22: 30th ACM Conference on User Modeling, Adaptation and Personalization, Barcelona, Spain, July 4, 2022

A Deep Learning-based Approach to Model Museum Visitors 217-221.
Proceedings of the Joint Proceedings of the IUI 2022 Workshops: APEx-UI, 2022

Inferring Emotional State from Facial Micro-Expressions 209-212.
Proceedings of the Joint Proceedings of the IUI 2022 Workshops: APEx-UI, 2022

2021
Quantum algorithm for doubling the amplitude of the search problem's solution states.
CoRR, 2021

Exploiting Micro Facial Expressions for More Inclusive User Interfaces.
Proceedings of the Joint Proceedings of the ACM IUI 2021 Workshops co-located with 26th ACM Conference on Intelligent User Interfaces (ACM IUI 2021), 2021

2020
Tracking Museum Visitors through Convolutional Object Detectors.
Proceedings of the Adjunct Publication of the 28th ACM Conference on User Modeling, 2020

2018
Polynomial time algorithm for computing a minimum geodetic set in outerplanar graphs.
Theor. Comput. Sci., 2018

2016
The contour of a bridged graph is geodetic.
Discret. Appl. Math., 2016

On the geodetic iteration number of the contour of a graph.
Discret. Appl. Math., 2016

2015
On the geodeticity of the contour of a graph.
Discret. Appl. Math., 2015

2012
Fully dynamic algorithm for chordal graphs with O(1) query-time and O(n<sup>2</sup>) update-time.
Theor. Comput. Sci., 2012

Characteristic Properties and Recognition of Graphs in which Geodesic and Monophonic convexities are Equivalent.
Discret. Math. Algorithms Appl., 2012

2011
Fast minimal triangulation algorithm using minimum degree criterion.
Theor. Comput. Sci., 2011

Computing simple-path convex hulls in hypergraphs.
Inf. Process. Lett., 2011

2010
Simple algorithms for minimal triangulation of a graph and backward selection of a decomposable Markov network.
Theor. Comput. Sci., 2010

On the complexity of finding chordless paths in bipartite graphs and some interval operators in graphs and hypergraphs.
Theor. Comput. Sci., 2010

2007
An analytical approach to the inference of summary data of additive type.
Theor. Comput. Sci., 2007

Finding a Nonempty Algebraic Subset of an Edge Set in Linear Time.
J. Graph Algorithms Appl., 2007

2006
Auditing sum-queries to make a statistical database secure.
ACM Trans. Inf. Syst. Secur., 2006

Minimal invariant sets in a vertex-weighted graph.
Theor. Comput. Sci., 2006

2004
Privacy Preserving and Data Mining in an On-Line Statistical Database of Additive Type.
Proceedings of the Privacy in Statistical Databases: CASC Project International Workshop, 2004

2003
Auditing Sum Queries.
Proceedings of the Database Theory, 2003

2002
A Linear Algorithm for Finding the Invariant Edges of an Edge-Weighted Graph.
SIAM J. Comput., 2002


  Loading...