## Speaker:

## Time:

## Venue:

We will try to find an upper bound on the number of edges in a graph with no k pairwise crossing edges.

Saswata Shannigrahi
School of Technology and Computer Science
Tata Institute of Fundamental Research
Homi Bhabha R

Wednesday, 26 August 2009 (All day)

We will try to find an upper bound on the number of edges in a graph with no k pairwise crossing edges.

Kishor Barman
School of Technology and Computer Science
Tata Institute of Fundamental Research
Homi Bhabha Road
<b

Wednesday, 19 August 2009 (All day)

Suppose there is a graph G, whose vertices are letters in an alphabet A and in which adjacency means that the letters can be confused in a transmission.

N.V. Narendra Kumar
School of Technology and Computer Science
Tata Institute of Fundamental Research
Homi Bhabha R

Friday, 7 August 2009 (All day)

In this talk we will try to understand how we can protect ourself against computer viruses.

Jay Sethuraman
Industrial Engineering and Operations Research
Columbia University
United States of America
htt

Monday, 17 August 2009 (All day)

We survey the classical multi-armed bandit problem and discuss several variations such as the problem of stochastic search in a forest and the union branching bandit problem.

Sasanka Roy
Indian Institute of Science
Bangalore 560012
http://www.csa.iisc.ernet.in/people/people-postdoc.php

Tuesday, 25 August 2009 (All day)

A path from $s$ to $t$ on a polyhedral terrain is descending if the height of a point $p$ never increases while we move p along the path from $s$ to $t$.

Shishir Pandey
School of Technology and Computer Science
Tata Institute of Fundamental Research
Homi Bhabha Road
<

Friday, 31 July 2009 (All day)

Given 3 or more non-collinear points on a plane how many distinct slopes to these points define on the plane? We will prove the following theorem.

Joseph Cheriyan
University of Waterloo
Canada
http://www.math.uwaterloo.ca/~jcheriya/

Wednesday, 29 July 2009 (All day)

A typical problem in network design is to find a subgraph H of a given graph G such that H satisfies some connectivity requirements and has minimum cost.