Indranil Banerjee

Contact: ibanerje [at] gmu [dot] edu
CS, GMU

I am in my fifth year as a PhD student at GMU working on Graph Algorithms. I am advised by
Dana Richards. Before begining my studies at GMU I majored in
Electrical Engineering at National Institute Of Technology, Durgapur, India.
Here is my brief curriculum vitae.

A list of publications can be found here.

Research Interests

I am primarily interested in combinatorial problems on graphs, hypergraphs and matroids.
Currently I am working on sorting and routing on graphs and hypergraph connectivity. Non-constructive methods/proofs,
randomization, expanders are some areas I like to work in the near future.


Links:

  1. Google Scholar
  2. Poetic Curricatures
  3. Travels & Photography
  4. math.stackexchange
TA:
  1. GMU Theory colloquium Talk: Soft-Heaps & MST
  2. Summer 16: CS330 (Formal Methods)
  3. CS 499 (Parallel Computing): Sorting Net Slides