| Date |
Time |
Location |
Speaker |
Title
|
| Jan 17 |
1:00-2:00 PM |
AVW4172 |
E.S. Mahmoodian |
Defining sets in combinatorics with emphasis in graph theory
|
| Jan 31 |
1:00-2:00 PM |
CSIC3120 |
Melika Abolhassani |
Selling Tomorrow's Bargains Today
|
| Feb 7 |
1:00-2:00 PM |
CSIC3120 |
Rajesh Chitnis |
Beating 2^n: Faster Exact Algorithms for Some Graph Problems
|
| Feb 14 |
1:00-2:00 PM |
CSIC3120 |
Hossein Esfandiari |
Online Stochastic Reordering Buffer Scheduling
|
| Feb 21 |
1:00-2:00 PM |
CSIC3120 |
Reza Khani |
Revenue Monotone Mechanisms for Online Advertising
|
| Feb 28 |
1:00-2:00 PM |
CSIC3120 |
Manish Purohit |
On Correcting Inputs - Inverse Optimization with a Margin
|
| Mar 7 |
1:00-2:00 PM |
CSIC3120 |
Kanthi Kiran Sarpatwar |
Analyzing the Optimal Neighborhood: Algorithms for Partial and Budgeted Connected Dominating Set Problems
|
| Mar 14 |
1:00-2:00 PM |
CSIC3120 |
Krzysztof Onak |
Parallel Algorithms for Geometric Graph Problems
|
| Mar 28 |
1:00-2:00 PM |
CSIC3120 |
Hamid Mahini |
How to Influence People with Partial Incentives
|
| Apr 2 |
1:00-2:00 PM |
AVW3258 |
Mario Szegedy |
Impossibility Theorems and the Universal Algebraic Toolkit
|
| Apr 4 |
1:00-2:00 PM |
CSIC3120 |
S. Raghu Raghavan |
Weighted and Fractional Versions of the Target Set Selection Problem on Trees
|
| Apr 11 |
1:00-2:00 PM |
CSIC1115 |
Allan Borodin |
Greedy-like algorithms and a myopic model for the non-monotone submodular maximization problem
|
| Apr 18 |
1:00-2:00 PM |
CSIC3120 |
Michael Dinitz |
Label Cover Instances with Large Girth and the Hardness of Approximating Spanners
|
| Apr 25 |
1:00-2:00 PM |
CSIC3120 |
Hossein Esfandiari |
Online Stochastic Reordering Buffer Scheduling
|
| May 2 |
1:00-2:00 PM |
CSIC1115 |
Rakesh Vohra |
One-Sided Matching with Limited Complementarities
|
| May 9 |
1:00-2:00 PM |
CSIC3120 |
Laura Sanita |
TBA
|
