Research Events

Image accompanying Kanba testimonial
Icon Seminar 21051
Icon Upcoming

Dagstuhl Seminar

Vertex Partitioning in Graphs: From Structure to Algorithms

Co-organizers:
Maria Chudnovsky (Princeton University, US)
Daniel Paulusma (Durham University, GB)
and Oliver Schaudt (ZF Friedrichshafen, DE).

31st January to 5th February, 2021  Icon  Dagstuhl
Image accompanying Kanba testimonial
Icon Amihood Amir
Icon GIAN Course

Pattern Matching Algorithms

This course was a modern introduction to the field of pattern matching algorithms. These problems are among the oldest in computer science. For example, Celera Genomics used shotgun sequencing to complete the first sequenced genome. Every text editor uses the Boyer-Moore algorithm. The area remains a fertile ground for very active current research.

28th August 2017 to 7th September 2017  Icon  IITGN
Image accompanying Kanba testimonial
Icon Edith Elkind
Icon GIAN Course

Computational Social Choice

This course was an introduction to the rapidly growing field of computational social choice, which — at the intersection of computer science and economics — deals with the algorithmic and complexity-theoretic aspects of collective decision making. This course addresses several algorithmic and complexity-theoretic themes in computational social choice.

4th December 2017 to 8th December 2017  Icon  IITGN
Icon