Presentations

You can browse through some of my slides on Issuu.

  1. Mining Graphs for Faster Deep Learning
    Schloss Dagstuhl – Leibniz-Zentrum für Informatik , June 2018
  2. Predicting Positive and Negative Links with Noisy Queries: Theory & Practice
    Theory Seminar, Boston University, September 2017
  3. Predicting Positive and Negative Links with Noisy Queries: Theory & Practice
    Data Science Seminar, Boston University, September 2017
  4. Graph Clustering Problems
    Legendary Entertainment,  Boston August 2017
  5. Motif-aware graph mining
    SIAM Annual Meeting, Pittsburgh, July 2017
  6. Motif-aware graph mining
    GraphEx Symposium, MIT, May 2017
  7. Motif-aware graph mining
    Allerton Conference, September 2016
  8. Mining Tools for Large-Scale Networks
    Aarhus University, April 2016
  9. Mining Tools for Large-Scale Networks
    IT Copenhagen University, April 2016
  10. Mining Tools for Large-Scale Networks
    UC Santa Cruz University, March 2016
  11. Mining Tools for Large-Scale Networks
    ETH Zurich, March 2016
  12. Mining Tools for Large-Scale Networks
    University of Illinois Urbana-Champaign, February 2016
  13. Mining Tools for Large-Scale Networks
    Boston University, February 2016
  14. Mining Tools for Large-Scale Networks
    University Colorado-Boulder, February 2016
  15. Mining Tools for Large-Scale Networks
    Northeastern University, January 2016
  16.  Scalable Large Near-Clique Detection in Large-Scale Networks via Sampling
    University of Maryland
  17. Scalable Large Near-Clique Detection in Large-Scale Networks via Sampling
    Ohio State University
  18. Dense subgraph discovery
    Google Research
  19. Large-Scale Graph Mining
    IBM T.J. Watson Research Center
  20. Streaming Graph Partitioning in the Planted Partition Model
    ACM Conference on Online Social Networks (COSN’15)
  21. Scalable Large Near-Clique Detection in Large-Scale Networks via Sampling
    Stanford University
  22. Scalable Large Near-Clique Detection in Large-Scale Networks
    Signals, Inference, and Networks (SINE) Seminar
    University of Illinois Urbana-Champaign
  23. Dense subgraph discovery
    Data-driven Algorithmics
  24. Scalable Large Near-Clique Detection in Large-Scale Networks via Sampling
    21st ACM SIGKDD International Conference on Knowledge Discovery and Data Mining (KDD 2015)
  25. Dense subgraph discovery
    Tutorial at 21st ACM SIGKDD International Conference on Knowledge Discovery and Data Mining (KDD 2015)
  26. Scalable dense subgraph discovery
    Random Structures and Algorithms (RSA), July ’15
  27. Scalable dense subgraph discovery
    International Symposium on Optimization (ISMP), July ’15
  28. Space- and Time-Efficient Algorithms for Maintaining Dense Subgraphs on One-Pass Dynamic Streams
    STOC 2015, June ’15
  29. Scalable dense subgraph discovery
    University of Cyprus, June ’15
  30. Provably Fast Inference of Latent Features from Networks
    24th International World Wide Web Conference (WWW 2015), May’15
  31. The k-clique Densest Subgraph Problem
    24th International World Wide Web Conference (WWW 2015), May’15
  32. Algorithmic Analysis of Large Datasets
    Universitat Pompeu Fabra, May ’15
  33. Modern Data Mining Algorithms
    Draper Laboratory, December ’14
  34. Algorithmic Analysis of Large Datasets
    SEAS Harvard University, November ’14
    Youtube video
  35. Algorithmic Analysis of Large Datasets (pptx)
    Brown University, May ’14
    Host: Philip Klein
  36. Large-Scale Graph Mining
    Imperial College London, May ’14
    Host: Moez Draief
  37. Algorithmic Analysis of Large Datasets
    Google NYC, April ’14
    Host: Vahab Mirrokni
  38. Mathematical Techniques for Modeling and Analyzing Large Graphs (pdf)
    Aalto Science Institute, January ’14, Helsinki
  39. Modeling Intratumor Gene Copy Number Heterogeneity using Fluorescence in Situ Hybridization data (pptx, pdf)
    WABI ’13, September ’13, Nice
  40. Fennel: Streaming Graph Partitioning for Massive Scale Graphs (pdf)
    MASSIVE ’13, September ’13, Nice
  41. Denser than the densest subgraph: extracting optimal quasi-cliques with quality guarantees (pptx, pdf)
    KDD ’13, August ’13, Chicago
  42. Mathematical and Algorithmic Analysis of Network and Biological data
    Thesis Defense, Carnegie Mellon University, May 2013
  43. Processing, Analyzing and Mining Big Graph Data
    Machine learning lunch seminar, Carnegie Mellon University, April 2013
    Video
  44. Random Graphs and Complex Networks
    Guest lecture, TELCOM2125: Network Science and Analysis
    Host: Konstantinos Pelechrinis
    April 2013
  45. Mathematical and Algorithmic Analysis of Biological data and Networks
    Abstract
    Brown University, April 2013
    Host: Eli Upfal
  46. Fennel: Streaming Graph Partitioning for Massive Scale Graphs
    Microsoft Research, Cambridge UK, November 2012
    Host: Milan Vojnovic
  47. On Certain Topics on Networks and Optimization: Theorems, Algorithms and Applications
    Yahoo! Research Barcelona, Barcelona, August 2012
    Host: Aris Gionis
  48. On Certain Properties of Random Apollonian Networks (pptx, pdf)
    WAW 2012, June 2012, Halifax
  49. Triangle Counting and Vertex Similarity
    Canadian Mathematical Society, December 2011, Toronto
    Invited Speaker
  50. High Degree Vertices, Eigenvalues and Diameter of Random Apollonian Networks
    15th International Conference on Random Structures and Algorithms RSA 2011, Atlanta
  51. Counting Triangles in Real-World Networks
    SIAM Conference on Computational Science and Engineering (CSE11), Reno Invited Speaker
  52. Approximate Dynamic Programming using Halfspace Queries and Multiscale Monge Analysis (pptx)
    SODA 2011, San Francisco
  53. Approximate Dynamic Programming and Denoising aCGH data (pptx)
    Machine Learning Seminar 2011, Carnegie Mellon University
    Video
  54. Efficient Triangle Counting via Degree-based Partitioning (pptx)
    Machine Learning Seminar 2011, Carnegie Mellon University
    Video
  55. Approximate Dynamic Programming and Denoising aCGH data (pptx)
    ACO Seminar 2011, Carnegie Mellon University
  56. Efficient Triangle Counting via Degree-based Partitioning (pptx)
    ACO Seminar 2011, Carnegie Mellon University
  57. Efficient Triangle Counting via Degree-based Partitioning (pptx)
    WAW 2010, Stanford University
  58. The Determinant of Random Bernoulli Matrices
    Discrete Math 21701, Carnegie Mellon University
  59. Approximate Dynamic Programming
    Carnegie Mellon University
  60. Unmixing of Tumor States in aCGH data
    Carnegie Mellon University
  61. Data Mining with MapReduce: Graph and Tensor Algorithms with Applications
    Master Thesis, Carnegie Mellon University
  62. MACH: Fast Randomized Tensor Decompositions
    SIAM Data Mining 2010, Columbus OH
  63. Algorithms for Denoising aCGH Data
    MLD Speaking Skills, Carnegie Mellon University
  64. Welcome Talk (MLD Open House) (welcome.ppt)
    MLD Open House, Carnegie Mellon University
  65. Spectral Counting of Triangles in Power-Law Networks via Element-Wise Sparsification
    ASONAM 2009, Athens
  66. DOULION: Counting Triangles in Massive Graphs with a Coin
    KDD 2009, Paris
  67. Approximate Triangle Counting
    Poster Presentation, Machine Learning Summer School 2009, Chicago
  68. Basics of Spectral Graph Theory
    Carnegie Mellon University, Paris
  69. On Polygonal Numbers and Fermat’s Conjecture
    Additive Number Theory, Carnegie Mellon University
  70. Graph Mining Guest Lecture 15-826 Multimedia Databases and Data Mining (CMU)
  71. Fast Counting of Triangles in Large Real Networks without counting: Algorithms and Laws (pps)
    IEEE Data Mining (ICDM), 2008 Italy
  72. Fast Counting of triangles in large networks: Algorithms and laws (ppt)
    Theory Seminar of Rensselaer Polytechnic Institute
    Host: Petros Drineas
    Invited Talk
  73. Two heads better than one: pattern discovery in time-evolving multi-aspect data (ppt)
    European Conference on Machine Learning and Principles and Practice of Knowledge Discovery in Databases
    (ECML-PKDD 2008), 2008 Belgium
Some talks of mine have been recorded.


Denser than the Densest Subgraph: Extracting Optimal Quasi-Cliques with Quality Guarantees


Doulion: Counting Triangles in Massive Graphs with a Coin

Advertisements
%d bloggers like this: