| Line 9: |
Line 9: |
| | | Aug 2|| 1:00-2:00 PM|| AVW4172|| [http://i.cs.hku.hk/~hubert/ Hubert Chan] || [https://wiki.cs.umd.edu/theory/index.php?title=CATS-Aug-02-2013 Revisiting the Ranking Algorithm for Greedy Randomized Matching on Arbitrary Graphs] | | | Aug 2|| 1:00-2:00 PM|| AVW4172|| [http://i.cs.hku.hk/~hubert/ Hubert Chan] || [https://wiki.cs.umd.edu/theory/index.php?title=CATS-Aug-02-2013 Revisiting the Ranking Algorithm for Greedy Randomized Matching on Arbitrary Graphs] |
| | |} | | |} |
| − |
| |
| − | == Spring 2013 ==
| |
| − |
| |
| − | {| class="wikitable" style="text-align: center;" border="1"
| |
| − | |-
| |
| − | ! width="70pt" | Date !! width="110pt" | Time !! width="70pt" | Location !! width="150pt" | Speaker !! width="580pt" | Title
| |
| − | |-
| |
| − | | Jan 25|| 1:00-2:00 PM|| AVW4172|| [http://www.tks.informatik.uni-frankfurt.de/monemizadeh Morteza Monemizadeh] || [https://wiki.cs.umd.edu/theory/index.php?title=CATS-Jan-25-2013 Property Testing in Planar Graphs and Euclidean Facility Location in the Streaming Model]
| |
| − | |-
| |
| − | | Feb 1|| 1:00-2:00 PM|| AVW2120|| [http://www.cs.umd.edu/~khani/ Reza Khani] || [https://wiki.cs.umd.edu/theory/index.php?title=CATS-Feb-01-2013 Movement Repairman Problem]
| |
| − | |-
| |
| − | | Feb 15|| 1:00-2:00 PM|| AVW4172 || [http://pages.cs.wisc.edu/~dmalec/ David Malec] || [https://wiki.cs.umd.edu/theory/index.php?title=CATS-Feb-15-2013 Approximations in Bayesian optimal multi-dimensional mechanism design]
| |
| − | |-
| |
| − | | Feb 22|| 1:00-2:00 PM|| AVW2120|| [http://www.cs.umd.edu/~koyelm/ Koyel Mukherjee] || [https://wiki.cs.umd.edu/theory/index.php?title=CATS-Feb-22-2013 To send or not to send: Reducing the cost of data transmission]
| |
| − | |-
| |
| − | | Mar 1|| 1:00-2:00 PM|| AVW4172|| [http://www.cs.umd.edu/~kasarpa/Welcome.html Kanthi Kiran Sarpatwar] || [https://wiki.cs.umd.edu/theory/index.php?title=CATS-Mar-01-2013 New Approximation Results for Resource Replication Problems]
| |
| − | |-
| |
| − | | Mar 8|| 1:00-2:00 PM|| AVW2120|| [http://www.cs.umd.edu/~rchitnis/ Rajesh Chitnis] || [https://wiki.cs.umd.edu/theory/index.php?title=CATS-Mar-08-2013 New Connections between Fixed-Parameter Algorithms and Approximation Algorithms]
| |
| − | |-
| |
| − | | Mar 15|| 1:00-2:00 PM|| AVW4172|| [http://users.eecs.northwestern.edu/~nickle/ Nicole Immorlica] || [https://wiki.cs.umd.edu/theory/index.php?title=CATS-Mar-15-2013 The Degree of Segregation in Social Networks]
| |
| − | |-
| |
| − | | Mar 29|| 1:00-2:00 PM|| AVW2120|| [http://www.cs.umd.edu/~vliaghat/ Vahid Liaghat] || [https://wiki.cs.umd.edu/theory/index.php?title=CATS-Mar-29-2013 Improvements for Prize Collecting Steiner Connectivity Problems]
| |
| − | |-
| |
| − | | Apr 5|| 1:00-2:00 PM|| AVW4172|| [http://www.cs.umd.edu/~vliaghat/ Vahid Liaghat] || [https://wiki.cs.umd.edu/theory/index.php?title=CATS-Apr-05-2013 Online Node-Weighted Steiner Connectivity Problems]
| |
| − | |-
| |
| − | | Apr 12|| 1:00-2:00 PM|| CSI3117|| [http://www2.research.att.com/~dsj/ David Johnson] || [https://wiki.cs.umd.edu/theory/index.php?title=CATS-Apr-12-2013 The Combinatorics of Hidden Diversity]
| |
| − | |-
| |
| − | | Apr 17|| 9:00-10:00 AM|| AVW4172 || [http://www.research.att.com/people/Karloff_Howard_J/?fbid=0gJQQVm-4ux Howard J. Karloff] || [https://wiki.cs.umd.edu/theory/index.php?title=CATS-Apr-17-2013 Maximum Entropy Summary Trees]
| |
| − | |-
| |
| − | | Apr 19|| 1:00-2:00 PM|| AVW4172 || [http://faculty.cse.tamu.edu/nikolova/ Evdokia Nikolova] || [https://wiki.cs.umd.edu/theory/index.php?title=CATS-Apr-19-2013 Risk in Routing Games]
| |
| − | |-
| |
| − | | Apr 26|| 1:00-2:00 PM|| AVW4172|| Thomas Pensyl, Khoa Trinh || [https://wiki.cs.umd.edu/theory/index.php?title=CATS-Apr-26-2013 The breakthrough on k-median by Li and Svensson]
| |
| − | |-
| |
| − | | May 3|| 11:00-12:00 AM|| CSI1122|| [http://theory.stanford.edu/~tim/ Tim Roughgarden] || [https://wiki.cs.umd.edu/theory/index.php?title=CATS-May-3-2013 Porting the Computer Science Toolbox to Game Theory and Economics]
| |
| − | |-
| |
| − | | May 10|| 1:00-2:00 PM|| AVW4172 || [http://research.microsoft.com/en-us/people/slivkins/ Alex Slivkins] || [https://wiki.cs.umd.edu/theory/index.php?title=CATS-May-10-2013 Reconstructing Latent Similarities in a Multiplex Social Network]
| |
| − | |-
| |
| − | | May 13|| 1:00-2:00 PM|| AVW3258 || [http://www.math.uwaterloo.ca/~jochen/ Jochen Koenemann] || [https://wiki.cs.umd.edu/theory/index.php?title=CATS-May-13-2013 Network Diffusion & Node-Weighted Steiner Trees]
| |
| − | |}
| |
| − |
| |
| − | (*) 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.
| |
| | | | |
| | == CATS Talks from previous semesters == | | == CATS Talks from previous semesters == |
| | + | * [https://wiki.cs.umd.edu/theory/index.php?title=CATS-Spring-2013 Spring 2013] |
| | * [http://www.cs.umd.edu/areas/Theory/CATS/catss12.html Spring 2012] [https://wiki.cs.umd.edu/theory/index.php?title=CATS-Fall-2012 Fall 2012] | | * [http://www.cs.umd.edu/areas/Theory/CATS/catss12.html Spring 2012] [https://wiki.cs.umd.edu/theory/index.php?title=CATS-Fall-2012 Fall 2012] |
| | * [http://www.cs.umd.edu/areas/Theory/CATS/catss11.html Spring 2011] [http://www.cs.umd.edu/areas/Theory/CATS/catsf11.html Fall 2011] | | * [http://www.cs.umd.edu/areas/Theory/CATS/catss11.html Spring 2011] [http://www.cs.umd.edu/areas/Theory/CATS/catsf11.html Fall 2011] |