default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMauro Sozio
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j13]T.-H. Hubert Chan, Silvio Lattanzi, Mauro Sozio, Bo Wang:
Fully Dynamic k-Center Clustering with Outliers. Algorithmica 86(1): 171-193 (2024)- [j12]Oana Balalau
, Francesco Bonchi, T.-H. Hubert Chan, Francesco Gullo, Mauro Sozio, Hao Xie:
Finding Subgraphs with Maximum Total Density and Limited Overlap in Weighted Hypergraphs. ACM Trans. Knowl. Discov. Data 18(4): 95:1-95:21 (2024) - [c39]Yajing Zhi, Lanfang Kong, Samed Atouati, T.-H. Hubert Chan, Mauro Sozio:
Explaining Cryptocurrency Price Trends: Statistical Analysis of Social Media Posts vs Market Prices. CACML 2024: 234-239 - [c38]Marco Bressan, Mauro Sozio:
Fully-Dynamic Approximate Decision Trees With Worst-Case Update Time Guarantees. ICML 2024 - 2023
- [c37]Marco Bressan, Gabriel Damay, Mauro Sozio:
Fully-Dynamic Decision Trees. AAAI 2023: 6842-6849 - [c36]Lanfang Kong, Alexis Huet, Dario Rossi, Mauro Sozio:
Tree-based Kendall's τ Maximization for Explainable Unsupervised Anomaly Detection. ICDM 2023: 1073-1078 - [i8]Marco Bressan, Mauro Sozio:
Fully-Dynamic Approximate Decision Trees With Worst-Case Update Time Guarantees. CoRR abs/2302.03994 (2023) - 2022
- [j11]Maroua Bahri, Flavia Salutari, Andrian Putina, Mauro Sozio:
AutoML: state of the art with a focus on anomaly detection, challenges, and research directions. Int. J. Data Sci. Anal. 14(2): 113-126 (2022) - [j10]Rediet Abebe, T.-H. Hubert Chan, Jon M. Kleinberg, Zhibin Liang, David C. Parkes, Mauro Sozio, Charalampos E. Tsourakakis:
Opinion Dynamics Optimization by Varying Susceptibility to Persuasion via Non-Convex Local Search. ACM Trans. Knowl. Discov. Data 16(2): 33:1-33:34 (2022) - [j9]T.-H. Hubert Chan, Arnaud Guerquin, Shuguang Hu, Mauro Sozio:
Fully Dynamic $k$k-Center Clustering With Improved Memory Efficiency. IEEE Trans. Knowl. Data Eng. 34(7): 3255-3266 (2022) - [c35]Stefan Nesic, Andrian Putina, Maroua Bahri, Alexis Huet, José Manuel Navarro, Dario Rossi, Mauro Sozio:
STREamRHF: Tree-Based Unsupervised Anomaly Detection for Data Streams. AICCSA 2022: 1-8 - [c34]T.-H. Hubert Chan, Silvio Lattanzi, Mauro Sozio, Bo Wang:
Fully Dynamic k-Center Clustering with Outliers. COCOON 2022: 150-161 - [c33]Andrian Putina, Maroua Bahri, Flavia Salutari, Mauro Sozio:
AutoAD: an Automated Framework for Unsupervised Anomaly Detectio. DSAA 2022: 1-10 - [i7]Marco Bressan, Gabriel Damay, Mauro Sozio:
Fully-Dynamic Decision Trees. CoRR abs/2212.00778 (2022) - 2021
- [j8]T.-H. Hubert Chan, Mauro Sozio, Bintao Sun:
Distributed approximate k-core decomposition and min-max edge orientation: Breaking the diameter barrier. J. Parallel Distributed Comput. 147: 87-99 (2021) - 2020
- [j7]Polina Rozenshtein, Francesco Bonchi, Aristides Gionis, Mauro Sozio, Nikolaj Tatti:
Finding events in temporal networks: segmentation meets densest subgraph discovery. Knowl. Inf. Syst. 62(4): 1611-1639 (2020) - [j6]Bintao Sun, Maximilien Danisch, T.-H. Hubert Chan, Mauro Sozio:
KClist++: A Simple Algorithm for Finding k-Clique Densest Subgraphs in Large Graphs. Proc. VLDB Endow. 13(10): 1628-1640 (2020) - [j5]Bintao Sun, T.-H. Hubert Chan, Mauro Sozio:
Fully Dynamic Approximate k-Core Decomposition in Hypergraphs. ACM Trans. Knowl. Discov. Data 14(4): 39:1-39:21 (2020) - [c32]Andrian Putina, Mauro Sozio, Dario Rossi, José Manuel Navarro:
Random Histogram Forest for Unsupervised Anomaly Detection. ICDM 2020: 1226-1231 - [c31]Francesco Bonchi, Lorenzo Severini, Mauro Sozio:
Better Fewer but Better: Community Search with Outliers. WI/IAT 2020: 105-112 - [c30]Samed Atouati, Xiao Lu, Mauro Sozio:
Negative Purchase Intent Identification in Twitter. WWW 2020: 2796-2802 - [i6]Rediet Abebe, T.-H. Hubert Chan, Jon M. Kleinberg, Zhibin Liang, David C. Parkes, Mauro Sozio, Charalampos E. Tsourakakis:
Opinion Dynamics with Varying Susceptibility to Persuasion via Non-Convex Local Search. CoRR abs/2011.02583 (2020) - [i5]Francesco Bonchi, Lorenzo Severini, Mauro Sozio:
Better Fewer but Better: Community Search with Outliers. CoRR abs/2012.00356 (2020)
2010 – 2019
- 2019
- [c29]T.-H. Hubert Chan, Mauro Sozio, Bintao Sun:
Distributed Approximate k-Core Decomposition and Min-Max Edge Orientation: Breaking the Diameter Barrier. IPDPS 2019: 345-354 - [c28]T.-H. Hubert Chan, Zhibin Liang, Mauro Sozio:
Revisiting Opinion Dynamics with Varying Susceptibility to Persuasion via Non-Convex Local Search. WWW 2019: 173-183 - [i4]Oana Balalau, Carlos Castillo, Mauro Sozio:
EviDense: a Graph-based Method for Finding Unique High-impact Events with Succinct Keyword-based Descriptions. CoRR abs/1912.02484 (2019) - 2018
- [c27]Polina Rozenshtein, Francesco Bonchi, Aristides Gionis, Mauro Sozio, Nikolaj Tatti:
Finding Events in Temporal Networks: Segmentation Meets Densest-Subgraph Discovery. ICDM 2018: 397-406 - [c26]Oana Balalau, Carlos Castillo, Mauro Sozio:
EviDense: A Graph-Based Method for Finding Unique High-Impact Events with Succinct Keyword-Based Descriptions. ICWSM 2018: 560-563 - [c25]T.-H. Hubert Chan, Arnaud Guerquin, Mauro Sozio:
Fully Dynamic k-Center Clustering. WWW 2018: 579-587 - [c24]Maximilien Danisch, Oana Balalau, Mauro Sozio:
Listing k-cliques in Sparse Real-World Graphs. WWW 2018: 589-598 - [i3]Polina Rozenshtein, Francesco Bonchi, Aristides Gionis, Mauro Sozio, Nikolaj Tatti:
Finding events in temporal networks: Segmentation meets densest-subgraph discovery. CoRR abs/1808.09317 (2018) - 2017
- [c23]Maximilien Danisch, T.-H. Hubert Chan, Mauro Sozio:
Large Scale Density-friendly Graph Decomposition via Convex Programming. WWW 2017: 233-242 - 2016
- [c22]Raman Samusevich, Maximilien Danisch, Mauro Sozio:
Local triangle-densest subgraphs. ASONAM 2016: 33-40 - [c21]Matthaios Letsios, Oana Denisa Balalau, Maximilien Danisch, Emmanuel Orsini, Mauro Sozio:
Finding Heaviest k-Subgraphs and Events in Social Media. ICDM Workshops 2016: 113-120 - 2015
- [c20]Kiran Garimella, Gianmarco De Francisci Morales, Aristides Gionis, Mauro Sozio:
Scalable Facility Location for Massive Graphs on Pregel-like Systems. CIKM 2015: 273-282 - [c19]Michele Spina, Dario Rossi, Mauro Sozio, Silviu Maniu, Bogdan Cautis:
Snooping Wikipedia vandals with MapReduce. ICC 2015: 1146-1151 - [c18]Oana Denisa Balalau, Francesco Bonchi, T.-H. Hubert Chan, Francesco Gullo, Mauro Sozio:
Finding Subgraphs with Maximum Total Density and Limited Overlap. WSDM 2015: 379-388 - [c17]Alessandro Epasto, Silvio Lattanzi, Mauro Sozio:
Efficient Densest Subgraph Computation in Evolving Graphs. WWW 2015: 300-310 - [i2]Kiran Garimella, Gianmarco De Francisci Morales, Aristides Gionis, Mauro Sozio:
Scalable Facility Location for Massive Graphs on Pregel-like Systems. CoRR abs/1503.03635 (2015) - 2013
- [j4]Faraz Makari Manshadi, Baruch Awerbuch, Rainer Gemulla, Rohit Khandekar, Julián Mestre, Mauro Sozio:
A Distributed Algorithm for Large-Scale Generalized Matching. Proc. VLDB Endow. 6(9): 613-624 (2013) - 2012
- [c16]Imen Ben Dhia, Talel Abdessalem, Mauro Sozio:
Primates: a privacy management system for social networks. CIKM 2012: 2746-2748 - [c15]Ndapandula Nakashole, Mauro Sozio, Fabian M. Suchanek, Martin Theobald:
Query-Time Reasoning in Uncertain RDF Knowledge Bases with Soft and Hard Rules. VLDS 2012: 15-20 - 2011
- [j3]Gianmarco De Francisci Morales, Aristides Gionis, Mauro Sozio:
Social Content Matching in MapReduce. Proc. VLDB Endow. 4(7): 460-469 (2011) - [c14]Maximilian Dylla, Mauro Sozio, Martin Theobald:
Resolving Temporal Conflicts in Inconsistent RDF Knowledge Bases. BTW 2011: 474-493 - [c13]Tomasz Tylenda, Mauro Sozio, Gerhard Weikum:
Einstein: physicist or vegetarian? summarizing semantic type graphs for knowledge discovery. WWW (Companion Volume) 2011: 273-276 - [i1]Gianmarco De Francisci Morales, Aristides Gionis, Mauro Sozio:
Social content matching in MapReduce. CoRR abs/1105.4256 (2011) - 2010
- [j2]Alessandro Panconesi, Mauro Sozio:
Fast primal-dual distributed algorithms for scheduling and matching problems. Distributed Comput. 22(4): 269-283 (2010) - [c12]Mauro Sozio, Aristides Gionis:
The community-search problem and how to plan a successful cocktail party. KDD 2010: 939-948
2000 – 2009
- 2009
- [c11]Gjergji Kasneci, Maya Ramanath, Mauro Sozio, Fabian M. Suchanek, Gerhard Weikum:
STAR: Steiner-Tree Approximation in Relationship Graphs. ICDE 2009: 868-879 - [c10]Klaus Berberich, Srikanta J. Bedathur, Mauro Sozio, Gerhard Weikum:
Bridging the Terminology Gap in Web Archive Search. WebDB 2009 - [c9]Fabian M. Suchanek, Mauro Sozio, Gerhard Weikum:
SOFIE: a self-organizing framework for information extraction. WWW 2009: 631-640 - 2008
- [j1]Fabrizio Grandoni, Jochen Könemann, Alessandro Panconesi, Mauro Sozio:
A Primal-Dual Bicriteria Distributed Algorithm for Capacitated Vertex Cover. SIAM J. Comput. 38(3): 825-840 (2008) - [c8]Mauro Sozio, Thomas Neumann, Gerhard Weikum:
Near-optimal dynamic replication in unstructured peer-to-peer networks. PODS 2008: 281-290 - [c7]Alessandro Panconesi, Mauro Sozio:
Fast distributed scheduling via primal-dual. SPAA 2008: 229-235 - [c6]Mauro Sozio, Josiane Xavier Parreira, Tom Crecelius, Gerhard Weikum:
Good Guys vs. Bad Guys: Countering Cheating in Peer-to-Peer Authority Computations over Social Networks. WebDB 2008 - 2007
- [c5]David B. Shmoys, Mauro Sozio:
Approximation Algorithms for 2-Stage Stochastic Scheduling Problems. IPCO 2007: 145-157 - [c4]Flavio Chierichetti, Alessandro Panconesi, Prabhakar Raghavan, Mauro Sozio, Alessandro Tiberi, Eli Upfal:
Finding near neighbors through cluster pruning. PODS 2007: 103-112 - 2005
- [c3]Fabrizio Grandoni, Jochen Könemann, Alessandro Panconesi, Mauro Sozio:
Primal-dual based distributed algorithms for vertex cover with semi-hard capacities. PODC 2005: 118-125 - [c2]Devdatt P. Dubhashi, C. Johansson, Olle Häggström, Alessandro Panconesi, Mauro Sozio:
Irrigating ad hoc networks in constant time. SPAA 2005: 106-115 - 2004
- [c1]Alessandro Panconesi, Mauro Sozio:
Fast Hare: A Fast Heuristic for Single Individual SNP Haplotype Reconstruction. WABI 2004: 266-277
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-10-07 21:23 CEST 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:
