View source for CATS-Spring-2014

== Spring 2014 ==
{| class="wikitable" style="text-align: center;" border="1"
|-
! width="70pt" | Date !! width="110pt" | Time !! width="70pt" | Location !! width="150pt" | Speaker !! width="580pt" | Title
|-
| Jan 17|| 1:00-2:00 PM|| AVW4172|| [http://sina.sharif.edu/~emahmood/ E.S. Mahmoodian] || [https://wiki.cs.umd.edu/theory/index.php?title=CATS-Jan-17-2014 Defining sets in combinatorics with emphasis in graph theory] 
|-
| Jan 31|| 1:00-2:00 PM|| CSIC3120|| [https://www.cs.umd.edu/people/mabolhas Melika Abolhassani] || [https://wiki.cs.umd.edu/theory/index.php?title=CATS-Jan-31-2014 Selling Tomorrow's Bargains Today]  
|-
| Feb 7|| 1:00-2:00 PM|| CSIC3120|| [http://www.cs.umd.edu/~rchitnis/ Rajesh Chitnis] || [https://wiki.cs.umd.edu/theory/index.php?title=CATS-Feb-7-2014  Beating 2^n: Faster Exact Algorithms for Some Graph Problems]   
|-
| Feb 21|| 1:00-2:00 PM|| CSIC3120|| [http://www.cs.umd.edu/~khani/ Reza Khani]|| [https://wiki.cs.umd.edu/theory/index.php?title=CATS-Feb-21-2014 Revenue Monotone Mechanisms for Online Advertising] 
|-
| Feb 28|| 1:00-2:00 PM|| CSIC3120|| [http://www.cs.umd.edu/~manishp/ Manish Purohit]||  [https://wiki.cs.umd.edu/theory/index.php?title=CATS-Feb-28-2014 On Correcting Inputs - Inverse Optimization with a Margin]
|-
| Mar 7|| 1:00-2:00 PM|| CSIC3120|| [http://www.cs.umd.edu/~kasarpa/Welcome.html Kanthi Kiran Sarpatwar]|| [https://wiki.cs.umd.edu/theory/index.php?title=CATS-Mar-7-2014 Analyzing the Optimal Neighborhood: Algorithms for Partial and Budgeted Connected Dominating Set Problems] 
|- 
| Mar 14|| 1:00-2:00 PM|| CSIC3120|| [http://onak.pl/ Krzysztof Onak]|| [https://wiki.cs.umd.edu/theory/index.php?title=CATS-Mar-14-2014  Parallel Algorithms for Geometric Graph Problems]
|-
| Mar 28|| 1:00-2:00 PM|| CSIC3120|| [http://www.cs.umd.edu/~hmahini/ Hamid Mahini]|| [https://wiki.cs.umd.edu/theory/index.php?title=CATS-Mar-28-2014 How to Influence People with Partial Incentives] 
|-
| Apr 2|| 1:00-2:00 PM|| AVW3258|| [http://www.cs.rutgers.edu/~szegedy/ Mario Szegedy] || [https://wiki.cs.umd.edu/theory/index.php?title=CATS-Apr-2-2014 Impossibility Theorems and the Universal Algebraic Toolkit] 
|-
| Apr 4|| 1:00-2:00 PM|| CSIC3120|| [http://terpconnect.umd.edu/~raghavan/ S. Raghu Raghavan] || [https://wiki.cs.umd.edu/theory/index.php?title=CATS-Apr-4-2014 Weighted and Fractional Versions of the Target Set Selection Problem on Trees] 
|-
| Apr 11|| 1:00-2:00 PM|| CSIC1115|| [http://www.cs.toronto.edu/~bor/ Allan Borodin] || [https://wiki.cs.umd.edu/theory/index.php?title=CATS-Apr-11-2014 Greedy-like algorithms and a myopic model for the non-monotone submodular maximization problem] 
|-
| Apr 18|| 1:00-2:00 PM|| CSIC3120|| [http://www.cs.jhu.edu/~mdinitz/ Michael Dinitz] || [https://wiki.cs.umd.edu/theory/index.php?title=CATS-Apr-18-2014 Label Cover Instances with Large Girth and the Hardness of Approximating Spanners]
|-
| May 2|| 1:00-2:00 PM|| CSIC1115|| [https://sites.google.com/site/quaerereverum9/ Rakesh Vohra] || [https://wiki.cs.umd.edu/theory/index.php?title=CATS-May-2-2014 One-Sided Matching with Limited Complementarities] 
|-
| May 16|| 1:00-2:00 PM|| AVW2120|| [http://mhbateni.com/academic/ Mohammad Hossein Bateni] || [https://wiki.cs.umd.edu/theory/index.php?title=CATS-May-16-2014 Multiplicative Bidding] 
|-
| May 23|| 11:00-12:00|| AVW4172|| [http://people.cs.umass.edu/~mcgregor/ Andrew McGregor] || [https://wiki.cs.umd.edu/theory/index.php?title=CATS-May-23-2014 Analyzing Big Graphs via Sketching and Streaming] 
|}

(*) Sponsored by CS Dept and Northrop Grumman.

(**) 
Supported in part by NSF CAREER award 1053605, NSF grant CCF-1161626, ONR YIP award N000141110662, DARPA/AFOSR grant FA9550-12-1-0423, and a grant from Simons Foundation.