Bureaucrats, editor, Administrators
373
edits
Changes
From Theory
→Spring 2014
Line 21:
Line 21:
| 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 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]|| 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]
−|-
+|-
| 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]
| 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]
|-
|-
