Slides from talks:
Matrix Completion with Structure (PhD thesis) 2016. [Slides]
 The goal of this thesis is to improve matrix completion algorithms by explicitly analyzing two sources of information in the observed entries: their locations and their values. In doing so, we examine matrix completion from a macro to a micro view, starting from a classification of the matrix to an analysis of substructure. First, we provide a categorization of a new approach to matrix completion, which we call structural, that quantifies the possibility of completion using tests applied only to the locations of known entries. Building on the structural approach, we then develop a new combinatorial algorithm for active matrixcompletion in the case when completion is not initially possible. Finally, we dig into the values of the observed entries to identify lowrank submatrices whose existence violates traditional assumptions and propose a local approach to matrix completion.
Query to Learn and Learn to Query 2016. [Slides]
 This talk, given at multiple locations, covers the Learning to Query problem through the lens of matrix completion, and the Querying to Learn problem through the lens of graph mining. Specifically, I cover material from two papers: Matrix Completion with Queries and The Minimum Wiener Connector.
Graph Mining 2015. [Slides]
 Talk given as a part of a lecture series exposing high school students to various topics and career paths in computer science . (Artemis Project at Boston University.)
Structural vs Statistical Matrix Completion 2014. [Slides]
 In this talk we highlight the differenve between traditional, statistical matrix completion, and a new line of work which we call structural matrix completion.
Slides from conference talks:

To Be Connected, or Not to Be Connected: That is the Minimum Inefficiency Subgraph Problem. [Slides]
(slides made with and presented by Francesco Bonchi)
Ruchansky, Bonchi, GarcíaSoriano, Gullo, Kourtellis.

CSI: A Hybrid Deep Model for Fake News [Slides]
(slides made and presented by Sungyong Seo)
Ruchansky, Seo, Liu. 2017

Targeted Matrix Completion. [Slides]
Ruchansky, Crovella, Terzi. 2017

Matrix Completion with Queries. [Slides]
Ruchansky, Crovella, Terzi. 2015

The Minimum Wiener Connector Problem. [Slides]
Ruchansky, Bonchi, GarcíaSoriano, Gullo, Kourtellis. 2015
 Routing State Distance: A Pathbased Metric for Network Analysis. [Slides].
Gursun, Ruchansky, Terzi, Crovella. 2012