Marco Bressan

SIAM J. Comput., August, 2023

Efficient and Near-optimal Algorithms for Sampling Small Connected Subgraphs.

[BibT_eX]

[DOI]

ACM Trans. Algorithms, July, 2023

Fully-Dynamic Approximate Decision Trees With Worst-Case Update Time Guarantees.

[BibT_eX]

[DOI]

Mauro Sozio

CoRR, 2023

The Complexity of Pattern Counting in Directed Graphs, Parameterised by the Outdegree.

[BibT_eX]

[DOI]

Matthias Lanzinger

Marc Roth

Proceedings of the 55th Annual ACM Symposium on Theory of Computing, 2023

Counting Subgraphs in Somewhere Dense Graphs.

[BibT_eX]

[DOI]

Proceedings of the 14th Innovations in Theoretical Computer Science Conference, 2023

Fully-Dynamic Decision Trees.

[BibT_eX]

[DOI]

Gabriel Damay

Mauro Sozio

Proceedings of the Thirty-Seventh AAAI Conference on Artificial Intelligence, 2023

2022

Active Learning of Classifiers with Label and Seed Queries.

[BibT_eX]

[DOI]

Proceedings of the Advances in Neural Information Processing Systems 35: Annual Conference on Neural Information Processing Systems 2022, 2022

2021

Faster Motif Counting via Succinct Color Coding and Adaptive Sampling.

[BibT_eX]

[DOI]

Stefano Leucci

Alessandro Panconesi

ACM Trans. Knowl. Discov. Data, 2021

Counting homomorphisms, subgraphs, and induced subgraphs in degenerate graphs: new hardness results and complete complexity classifications.

[BibT_eX]

[DOI]

Marc Roth

CoRR, 2021

Faster algorithms for counting subgraphs in sparse graphs.

[BibT_eX]

[DOI]

Algorithmica, 2021

Efficient and near-optimal algorithms for sampling connected subgraphs.

[BibT_eX]

[DOI]

Proceedings of the STOC '21: 53rd Annual ACM SIGACT Symposium on Theory of Computing, 2021

On Margin-Based Cluster Recovery with Oracle Queries.

[BibT_eX]

[DOI]

Proceedings of the Advances in Neural Information Processing Systems 34: Annual Conference on Neural Information Processing Systems 2021, 2021

Exact and Approximate Pattern Counting in Degenerate Graphs: New Algorithms, Hardness Results, and Complexity Dichotomies.

[BibT_eX]

[DOI]

Marc Roth

Proceedings of the 62nd IEEE Annual Symposium on Foundations of Computer Science, 2021

Exact Recovery of Clusters in Finite Metric Spaces Using Oracle Queries.

[BibT_eX]

[DOI]

Proceedings of the Conference on Learning Theory, 2021

2020

On Approximating the Stationary Distribution of Time-Reversible Markov Chains.

[BibT_eX]

[DOI]

Theory Comput. Syst., 2020

Faster algorithms for sampling connected induced subgraphs.

[BibT_eX]

[DOI]

CoRR, 2020

Exact Recovery of Mangled Clusters with Same-Cluster Queries.

[BibT_eX]

[DOI]

Proceedings of the Advances in Neural Information Processing Systems 33: Annual Conference on Neural Information Processing Systems 2020, 2020

2019

Motivo: Fast Motif Counting via Succinct Color Coding and Adaptive Sampling.

[BibT_eX]

[DOI]

Stefano Leucci

Alessandro Panconesi

Proc. VLDB Endow., 2019

Mixing time bounds for graphlet random walks.

[BibT_eX]

[DOI]

Matteo Agostini

Shahrzad Haddadan

Inf. Process. Lett., 2019

Correlation Clustering with Adaptive Similarity Queries.

[BibT_eX]

[DOI]

Proceedings of the Advances in Neural Information Processing Systems 32: Annual Conference on Neural Information Processing Systems 2019, 2019

Faster Subgraph Counting in Sparse Graphs.

[BibT_eX]

[DOI]

Proceedings of the 14th International Symposium on Parameterized and Exact Computation, 2019

2018

Motif Counting Beyond Five Nodes.

[BibT_eX]

[DOI]

ACM Trans. Knowl. Discov. Data, 2018

On degeneracy and the parameterized complexity of subgraph counting.

[BibT_eX]

[DOI]

CoRR, 2018

Brief Announcement: On Approximating PageRank Locally with Sublinear Query Complexity.

[BibT_eX]

[DOI]

Proceedings of the 30th on Symposium on Parallelism in Algorithms and Architectures, 2018

2017

Counting Graphlets: Space vs Time.

[BibT_eX]

[DOI]

Proceedings of the Tenth ACM International Conference on Web Search and Data Mining, 2017

2016

The Limits of Popularity-Based Recommendations, and the Role of Social Ties.

[BibT_eX]

[DOI]

Proceedings of the 22nd ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, 2016

2015

Simple set cardinality estimation through random sampling.

[BibT_eX]

[DOI]

CoRR, 2015

2014

Approximating PageRank locally with sublinear query complexity.

[BibT_eX]

[DOI]

CoRR, 2014

2013

The power of local information in PageRank.

[BibT_eX]

[DOI]

Vincenzo-Maria Cappelleri

Proceedings of the 22nd International World Wide Web Conference, 2013

Simple, Fast, Accurate Melanocytic Lesion Segmentation in 1D Colour Space.

[BibT_eX]

Proceedings of the VISAPP 2013, 2013

2011

Ranking robustly.

[BibT_eX]

[DOI]

PhD thesis, 2011

<i>psort</i>, yet another fast stable sorting software.

[BibT_eX]

[DOI]

Paolo Bertasi

ACM J. Exp. Algorithmics, 2011

Datamation: A Quarter of a Century and Four Orders of Magnitude Later.

[BibT_eX]

[DOI]

Proceedings of the 2011 IEEE International Conference on Cluster Computing (CLUSTER), 2011

Local computation of PageRank: the ranking side.

[BibT_eX]

[DOI]

Proceedings of the 20th ACM Conference on Information and Knowledge Management, 2011

2010

Choose the damping, choose the ranking?

[BibT_eX]

[DOI]

J. Discrete Algorithms, 2010

Urban Hitchhiking.

[BibT_eX]

[DOI]

Proceedings of the Fun with Algorithms, 5th International Conference, 2010

2009

psort, Yet Another Fast Stable Sorting Software.

[BibT_eX]

[DOI]

Paolo Bertasi