Complexity Theory and Algorithmics Group Seminar

CTAG Group Logo

Our research group meets once a week for a talk given by a member of the groups, or a visitor, about their current research, or a more general overview of their research topics. These seminars are held every Thursday at 3:00-4:00pm in Room 2.23 (the Seminar Room opposite the Help Desk), George Holt Building (unless otherwise stated).

Schedule for 2nd Semester 2010-2011

Date Speaker Title
10 Feb 2011 Leszek Gąsieniec Choosing the best among peers (Abstract)
17 Feb 2011 Adrian Kosowski
INRIA Bordeaux Sud-Ouest 		Constructing a Map of an Anonymous Graph: Applications of Universal Sequences (Abstract)
24 Feb 2011 Jurek Czyzowicz
Universite du Quebec 		Dijkstra shortest path algorithm and the problem of motion planning (Abstract)
9 Mar 2011
2pm 		Evangelos Kranakis
Carleton University 		Combinatorics of Canonical and Saturated RNA Secondary Structures (Abstract)
10 Mar 2011 Stanley P.Y. Fung
University of Leicester 		Online Preemptive Scheduling with Immediate Decision or Notification and Penalties (Abstract)
15 Mar 2011
4pm, Ashton Lecture Theatre 		Paul Spirakis
University of Patras and CTI Patras 		Approximate Nash Equilibria in Bimatrix Games (Abstract)
17 Mar 2011 Alexandru Popa
University of Bristol 		The Maximum Edge q-Coloring Problem (Abstract)
24 Mar 2011 Thomas Nickson Geometric Computations by Broadcasting Automata on the Integer Grid (Abstract)
31 Mar 2011 Obilor Nwamadi
EEE Dept 		Trends in Resource Allocation for Fourth Generation Wireless Communication Systems (Abstract)
7 Apr 2011 Marcin Bienkowski
University of Wroclaw 		An Optimal Lower Bound for Buffer Management in Multi-Queue Switches (Abstract)
Friday 8 April
3pm 		Michael Clague
School of Biomedical Science 		Challenges in Understanding Cell Signaling Networks (Abstract)
9 Jun 2011 Tom Friedetzky
Durham University 		Speeding up random walks (Abstract)
16 Jun 2011 Chung-Keung Poon
City University of Hong Kong 		Path Hop: Efficiently Indexing Large Graphs for Reachability Queries (Abstract)

Schedule for 1st Semester 2010-2011

Date Speaker Title
25 Nov 2010 Prasad Chebolu Complexity of Approximately Counting Stable Roommate Assignments (Abstract)

Schedule of 2009-10 can be found here.

Please report any problems to the email address at the bottom of the page.