Line 2: |
Line 2: |
| | | |
| | | |
− | == Spring 2014 == | + | == Fall 2014 == |
| {| class="wikitable" style="text-align: center;" border="1" | | {| class="wikitable" style="text-align: center;" border="1" |
| |- | | |- |
| ! width="70pt" | Date !! width="110pt" | Time !! width="70pt" | Location !! width="150pt" | Speaker !! width="580pt" | Title | | ! 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] | + | | Sep 19|| 1:00-2:00 PM|| CSIC3120|| [http://www.cs.umd.edu/~kasarpa/ Kanthi Kiran Sarpatwar] || [https://wiki.cs.umd.edu/theory/index.php?title=CATS-Sep-19-2014 Approximation Algorithms for Container Selection Problems.] |
| |- | | |- |
− | | 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] | + | | Sep 26|| 11:00-12:00 PM|| CSIC2117|| [http://people.mpi-inf.mpg.de/~mehlhorn/ Kurt Mehlhorn] || [https://wiki.cs.umd.edu/theory/index.php?title=CATS-Sep-26-2014 Certifying Computations: Algorithmics meets Software Engineering] |
| |- | | |- |
− | | 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] | + | | Oct 3|| 1:00-2:00 PM|| CSIC3120|| [http://www.cs.umd.edu/~manishp/ Manish Purohit] || [https://wiki.cs.umd.edu/theory/index.php?title=CATS-Oct-3-2014 Elementary Properties of Geometric Objects in High Dimensions] |
| |- | | |- |
− | | 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] | + | | Oct 10|| 1:00-2:00 PM|| CSIC3120|| [TBA]|| [https://wiki.cs.umd.edu/theory/index.php?title=CATS-Oct-10-2014 TBA] |
| |- | | |- |
− | | 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] | + | | Oct 17|| 1:00-2:00 PM|| CSIC3120|| [TBA]|| [https://wiki.cs.umd.edu/theory/index.php?title=CATS-Oct-17-2014 TBA] |
| |- | | |- |
− | | 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] | + | | Oct 24|| 1:00-2:00 PM|| CSIC3120|| [TBA]|| [https://wiki.cs.umd.edu/theory/index.php?title=CATS-Oct-24-2014 TBA] |
| |- | | |- |
− | | 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] | + | | Oct 31|| 1:00-2:00 PM|| CSIC3120|| [http://grigory.us/ Grigory Yaroslavtsev]|| [https://wiki.cs.umd.edu/theory/index.php?title=CATS-Oct-31-2014 TBA] |
| |- | | |- |
− | | 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] | + | | Nov 7|| 1:00-2:00 PM|| CSIC3120|| [http://www.cs.toronto.edu/~blucier/ Brendan Lucier]|| [https://wiki.cs.umd.edu/theory/index.php?title=CATS-Nov-7-2014 Duelling Games] |
| |- | | |- |
− | | 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] | + | | Nov 14|| 1:00-2:00 PM|| CSIC3120|| [TBA] || [https://wiki.cs.umd.edu/theory/index.php?title=CATS-Nov-14-2014 TBA] |
| |- | | |- |
− | | 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] | + | | Nov 21|| 1:00-2:00 PM|| CSIC3120|| [TBA] || [https://wiki.cs.umd.edu/theory/index.php?title=CATS-Nov-21-2014 TBA] |
| |- | | |- |
− | | 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] | + | | Dec 5 || 1:00-2:00 PM|| CSIC3120|| [TBA] || [https://wiki.cs.umd.edu/theory/index.php?title=CATS-Dec-5-2014 TBA] |
| |- | | |- |
− | | 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] | + | | Dec 12|| 1:00-2:00 PM|| CSIC3120|| [TBA] || [https://wiki.cs.umd.edu/theory/index.php?title=CATS-Dec-12-2014 TBA] |
| |- | | |- |
− | | 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] | + | | Dec 19|| 1:00-2:00 PM|| CSIC3120|| [TBA] || [https://wiki.cs.umd.edu/theory/index.php?title=CATS-Dec-17-2014 TBA] |
− | |-
| |
− | | 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]
| |
| |} | | |} |
| | | |