Academic Services
Program Committees
Organizers
2024 Nov, Dagstuhl Seminar 24471: Graph Algorithms: Distributed Meets Dynamic
2024 June, STOC 2024 workshop on Length-Constrained Expanders
2023 Oct, Dagstuhl Seminar 23422 "Graph Algorithms: Cuts, Flows, and Network Design"
2023 Sep, Simon's workshop on Dynamic Graphs and Algorithm Design
2022 July, STOC 2022 workshop on Dynamic Algorithms: Recent Advances and Applications (videos)
Talks
Using Isolating Mincuts for Fast Graph Algorithms: A tutorial
2023 Dec: Reading group @ Kasetsart University
2023 Nov: Theory seminar @ UT Austin
2023 Oct: Dagstuhl Seminar 23422 "Graph Algorithms: Cuts, Flows, and Network Design"
Tutorials on Graph Data Structures [video part 1, part 2, part 3, slides part 1-2, part 3, more]
2023 August: Data Structures and Optimization for Fast Algorithms Boot Camp @ Simons
Expander Decompositions and Applications [video part 1, part 2]
2023, July: ICALP 2023 (Presburger Award)
2023, June: DIMACS Workshop on Modern Techniques in Graph Algorithms @ Rutgers
Using Expanders for Fast Graph Algorithms [video]
2023, May: Computer Science/Discrete Mathematics Seminar II @ IAS
Invitation to Theoretical Computer Science
2022, Dec: Seminar @ Kasetsart University
A Blackbox Reduction for Adaptive Adversaries using Differential Privacy
2023 Nov: Theory seminar @ UT Austin
2022, Nov: Dagstuhl Seminar 22461 (Dynamic Graph Algorithms)
Dynamic Matching with Better-than-2 Approximation in Polylogarithmic Update Time
2022, Dec: Theory Seminar @ Kasetsart University
2022, Nov: Theory Lunch @ UMich
Using Expanders for Dynamic Graph Algorithms
2022, June: Milan Theory Workshop
2022, May: HALG (Invited tutorial)
All-pairs minimum cuts in nearly quadratic time: a tutorial [video]
2022, May: TCS+
Dynamic Graph Algorithms Against an Adaptive Adversary via Congestion Balancing [video]
2021, May: Theory Seminar @ BARC
2021, May: Algorithms & Complexity Seminar @ MIT
2021, May: Theory Seminar @ University of Toronto
2021, May: Google Workshop on Computational Mobility
2021, May: Theory Seminar @ UW
Recent Applications of Expanders to Graph Algorithms (survey) [video] [slides]
2021, Feb: Theory Seminar @ UIUC
2021, Feb: DIMAP Seminar
2020, Oct: Rutgers/DIMACS Theory of Computing Seminar
2020, Oct: IGAFIT Algorithmic Colloquium (invited)
A Deterministic Algorithm for Balanced Cut with Applications
2020, Oct: STOC 2020
2020, Jan: Recent Trends in Theoretical Computer Science @ TTIC (invited)
Algorithmic Paradigms for Dynamic Graph Problems
2020, Apr: CS Colloquium @ EPFL
2020, Apr: CS Colloquium @ Harvard
2020, Mar: CS Colloquium @ Columbia
2020, Mar: CS Colloquium @ U of Michigan
2020, Mar: CS Colloquium @ Boston U
2020, Feb: CS Colloquium @ Purdue
2020, Feb: CS Colloquium @ Saarland University
2020, Feb: CS Colloquium @ Northwestern
2020, Jan: Research at TTIC seminar @ TTIC
Expander Decomposition: Applications and How to use it [video] [slides]
2019, Oct: Quarterly Theory Workshop: 2019 Junior Theorists Workshop (invited)
2019, Oct: ADGA 2019 (invited)
2019, Oct: ACO Student Seminar @ Georgia Tech
Breaking Quadratic Time for Small Vertex Connectivity [video]
2020, Oct: CS Theory Seminar @ Duke
2019, Jun: Talk @ BARC
2019, May: Theory Seminar @ KTH
2019, Apr: Theory Seminar @ U of Chicago
2019, Apr: TCS+ (invited)
2019, Apr: DIMAP Workshop on Advances in Modern Graph Algorithms (invited)
Smooth heaps and a dual view of self-adjusting data structures
2019, Jun: Contributed talk @ HALG 2019
Expander Decomposition: Fast Algorithm
2019, Sep: Theory Seminar @ U of Michigan
2019, Jun: Contributed talk @ HALG 2019
2019, Mar: Research at TTIC seminar @ TTIC
2019, Feb: Foundations of Computer Science Seminar @ Weizmann
2017, Oct: Theory Lunch @ Berkeley
Dynamic Spanning Forest: Techniques and Connections
2019, Jan: Theory Seminar @ SHUFE
2018, Nov: Theory Seminar @ UIUC
2018, Nov: Theory Seminar @ U of Chicago
2018, Nov: Theory Seminar @ U of Michigan
2018, Apr: Mittagsseminar @ ETHZ
2018, Jan: Theory Seminar @ l'Université libre de Bruxelles
2018, Jan: Theory Seminar @ TTIC
2017, Oct: Theory Seminar @ Stanford
2017, Nov: PIC Seminar @ IBM Watson
2017, Nov: Seminar @ BARC
Distributed Exact Weighted All-Pairs Shortest Paths in O~(n^{5/4}) Rounds
2017, Oct: FOCS 2017
Dynamic Minimum Spanning Forest with Subpolynomial Worst-case Update Time
2018, July: Summer School on Algorithms and Lower Bounds 2018
2018, Apr: Google Algorithms and Optimization Workshop 2018 (poster session) (invited)
2017, Oct: FOCS 2017
Dynamic Spanning Forest with O(n^{0.5-\eps}) Worst-case Update Time
2017, Jun: STOC 2017
2017, Jun: ADS 2017 (invited)
2017, Jun: Contributed talk @ HALG 2017
2017, Apr: Lunch Seminar @ KTH
2017, Apr: Theory Seminar @ Aalto
Oblivious Adversary Assumption in Dynamic Problems
2016, Nov: Dagstuhl: Structure and Hardness in P (invited)
Pattern-avoiding Access in Binary Search Trees
2018, Apr: Seminar @ BARC
2015, Oct: FOCS 2015
Greedy is an Almost Optimal Deque
2015, Aug: WADS 2015
Unifying and Strengthening Hardness for Dynamic Problems via the Online Matrix-Vector Multiplication Conjecture
2016, Aug: China Theory Week 2016 (invited)
2016, Jun: Contributed talk @ HALG 2016
2015, Sep: Sixth Cargese Workshop on Combinatorial Optimization
2015, Jul: Lunch Seminar @ MPI
2015, Jun: Theory reading group @ KTH
2015, Jun: STOC 2015
Conference Review
FOCS 2024, 2022, 2021, 2020,2019, 2016, 2015
STOC 2022, 2021, 2019, 2018, 2015
SODA 2022, 2021, 2020, 2018, 2015
ICALP 2022, 2019, 2018, 2017, 2016
ESA 2021, 2020, 2019, 2016
ITCS 2020
PODC 2022, 2020
SPAA 2021