Mauro Sozio

Orcid: 0000-0002-2031-3974

According to our database1, Mauro Sozio authored at least 50 papers between 2004 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2024
Finding Subgraphs with Maximum Total Density and Limited Overlap in Weighted Hypergraphs.
ACM Trans. Knowl. Discov. Data, May, 2024

Fully Dynamic k-Center Clustering with Outliers.
Algorithmica, January, 2024

Fully-Dynamic Approximate Decision Trees With Worst-Case Update Time Guarantees.
Proceedings of the Forty-first International Conference on Machine Learning, 2024

Explaining Cryptocurrency Price Trends: Statistical Analysis of Social Media Posts vs Market Prices.
Proceedings of the 2024 3rd Asia Conference on Algorithms, Computing and Machine Learning, 2024

2023
Tree-based Kendall's τ Maximization for Explainable Unsupervised Anomaly Detection.
Proceedings of the IEEE International Conference on Data Mining, 2023

Fully-Dynamic Decision Trees.
Proceedings of the Thirty-Seventh AAAI Conference on Artificial Intelligence, 2023

2022
Fully Dynamic $k$k-Center Clustering With Improved Memory Efficiency.
IEEE Trans. Knowl. Data Eng., 2022

Opinion Dynamics Optimization by Varying Susceptibility to Persuasion via Non-Convex Local Search.
ACM Trans. Knowl. Discov. Data, 2022

AutoML: state of the art with a focus on anomaly detection, challenges, and research directions.
Int. J. Data Sci. Anal., 2022

AutoAD: an Automated Framework for Unsupervised Anomaly Detectio.
Proceedings of the 9th IEEE International Conference on Data Science and Advanced Analytics, 2022

STREamRHF: Tree-Based Unsupervised Anomaly Detection for Data Streams.
Proceedings of the 19th IEEE/ACS International Conference on Computer Systems and Applications, 2022

2021
Distributed approximate k-core decomposition and min-max edge orientation: Breaking the diameter barrier.
J. Parallel Distributed Comput., 2021

2020
Fully Dynamic Approximate k-Core Decomposition in Hypergraphs.
ACM Trans. Knowl. Discov. Data, 2020

KClist++: A Simple Algorithm for Finding k-Clique Densest Subgraphs in Large Graphs.
Proc. VLDB Endow., 2020

Finding events in temporal networks: segmentation meets densest subgraph discovery.
Knowl. Inf. Syst., 2020

Opinion Dynamics with Varying Susceptibility to Persuasion via Non-Convex Local Search.
CoRR, 2020

Negative Purchase Intent Identification in Twitter.
Proceedings of the WWW '20: The Web Conference 2020, Taipei, Taiwan, April 20-24, 2020, 2020

Better Fewer but Better: Community Search with Outliers.
Proceedings of the IEEE/WIC/ACM International Joint Conference on Web Intelligence and Intelligent Agent Technology, 2020

Random Histogram Forest for Unsupervised Anomaly Detection.
Proceedings of the 20th IEEE International Conference on Data Mining, 2020

2019
Revisiting Opinion Dynamics with Varying Susceptibility to Persuasion via Non-Convex Local Search.
Proceedings of the World Wide Web Conference, 2019

2018
Listing k-cliques in Sparse Real-World Graphs.
Proceedings of the 2018 World Wide Web Conference on World Wide Web, 2018

Fully Dynamic <i>k</i>-Center Clustering.
Proceedings of the 2018 World Wide Web Conference on World Wide Web, 2018

EviDense: A Graph-Based Method for Finding Unique High-Impact Events with Succinct Keyword-Based Descriptions.
Proceedings of the Twelfth International Conference on Web and Social Media, 2018

2017
Large Scale Density-friendly Graph Decomposition via Convex Programming.
Proceedings of the 26th International Conference on World Wide Web, 2017

2016
Finding Heaviest k-Subgraphs and Events in Social Media.
Proceedings of the IEEE International Conference on Data Mining Workshops, 2016

Local triangle-densest subgraphs.
Proceedings of the 2016 IEEE/ACM International Conference on Advances in Social Networks Analysis and Mining, 2016

2015
Efficient Densest Subgraph Computation in Evolving Graphs.
Proceedings of the 24th International Conference on World Wide Web, 2015

Finding Subgraphs with Maximum Total Density and Limited Overlap.
Proceedings of the Eighth ACM International Conference on Web Search and Data Mining, 2015

Snooping Wikipedia vandals with MapReduce.
Proceedings of the 2015 IEEE International Conference on Communications, 2015

Scalable Facility Location for Massive Graphs on Pregel-like Systems.
Proceedings of the 24th ACM International Conference on Information and Knowledge Management, 2015

2013
A Distributed Algorithm for Large-Scale Generalized Matching.
Proc. VLDB Endow., 2013

2012
Query-Time Reasoning in Uncertain RDF Knowledge Bases with Soft and Hard Rules.
Proceedings of the Second International Workshop on Searching and Integrating New Web Data Sources, 2012

Primates: a privacy management system for social networks.
Proceedings of the 21st ACM International Conference on Information and Knowledge Management, 2012

2011
Social Content Matching in MapReduce.
Proc. VLDB Endow., 2011

Einstein: physicist or vegetarian? summarizing semantic type graphs for knowledge discovery.
Proceedings of the 20th International Conference on World Wide Web, 2011

Resolving Temporal Conflicts in Inconsistent RDF Knowledge Bases.
Proceedings of the Datenbanksysteme für Business, 2011

2010
Fast primal-dual distributed algorithms for scheduling and matching problems.
Distributed Comput., 2010

The community-search problem and how to plan a successful cocktail party.
Proceedings of the 16th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, 2010

2009
SOFIE: a self-organizing framework for information extraction.
Proceedings of the 18th International Conference on World Wide Web, 2009

Bridging the Terminology Gap in Web Archive Search.
Proceedings of the 12th International Workshop on the Web and Databases, 2009

STAR: Steiner-Tree Approximation in Relationship Graphs.
Proceedings of the 25th International Conference on Data Engineering, 2009

2008
A Primal-Dual Bicriteria Distributed Algorithm for Capacitated Vertex Cover.
SIAM J. Comput., 2008

Good Guys vs. Bad Guys: Countering Cheating in Peer-to-Peer Authority Computations over Social Networks.
Proceedings of the 11th International Workshop on the Web and Databases, 2008

Fast distributed scheduling via primal-dual.
Proceedings of the SPAA 2008: Proceedings of the 20th Annual ACM Symposium on Parallelism in Algorithms and Architectures, 2008

Near-optimal dynamic replication in unstructured peer-to-peer networks.
Proceedings of the Twenty-Seventh ACM SIGMOD-SIGACT-SIGART Symposium on Principles of Database Systems, 2008

2007
Finding near neighbors through cluster pruning.
Proceedings of the Twenty-Sixth ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems, 2007

Approximation Algorithms for 2-Stage Stochastic Scheduling Problems.
Proceedings of the Integer Programming and Combinatorial Optimization, 2007

2005
Irrigating ad hoc networks in constant time.
Proceedings of the SPAA 2005: Proceedings of the 17th Annual ACM Symposium on Parallelism in Algorithms and Architectures, 2005

Primal-dual based distributed algorithms for vertex cover with semi-hard capacities.
Proceedings of the Twenty-Fourth Annual ACM Symposium on Principles of Distributed Computing, 2005

2004
Fast Hare: A Fast Heuristic for Single Individual SNP Haplotype Reconstruction.
Proceedings of the Algorithms in Bioinformatics, 4th International Workshop, 2004


  Loading...