About Me

Kishen N Gowda
  • Senior undergraduate, IIT Gandhinagar
  • Majors: Computer Science and Engineering
  • Email: kishen.gowda AT iitgn.ac.in
  • CV: Link
Technical Skills
  • Python, C, C++, Nim
  • LaTEX, Git, Flex, Bison, GDB, HTML, CSS
  • JavaScript, Bootstrap, Django, Flask
Achievements
  • Dean's list recepient for Sem 1 to 5, IIT Gandhinagar
  • Selected for Narendra Summer Internship Programme, Top 20 out of 2600 applications
  • Qualified for ACM ICPC '19 Regionals, both Amritapuri and Kanpur Regionals
  • Excellence in Academics, St. Patricks High School

If you share similar interests as that of mine and want to discuss about something, feel free to contact me.

About Me

I'm a senior undergraduate at the Indian Institute of Technology (IIT), Gandhinagar with majors in Computer Science and Engineering.

I enjoy Mathematics (especially Combinatorics and Discrete Mathematics) and love the art of solving problems using Algorithms. I'm broadly interested in the design and analysis of algorithms and theoretical computer science. I've so far worked on devising Approximation Algorithms, Randomized Algorithms and Parameterized Algorithms for problems in Graph Theory and Social Choice Theory. I've also worked on finding the Computational Complexity of problems (in the Parameterized Setting too). I'm also interested in Streaming Algorithms, Combinatorial Optimization, Algorithms for Big Data and Algorithmic Game Theory. (See my research here.)

Education

Indian Institute of Technology, Gandhinagar, India

2017 - Present

B.Tech. in Computer Science & Engineering

Research Experience

University of Bergen, Norway

Summer, 2020

Undergraduate Summer Intern

I worked under the supervision of Prof. Saket Saurabh. Due to the Covid-19 outbreak, I had to work on this project remotely. The project dealt with designing faster FPT Algorithms for problems dealing with deletion to Forest-like structures. An extended abstract of our work is currently under review at the 31st International Symposium On Algorithms And Computation (ISAAC), 2020.

Indian Institute of Science, Bangalore

Summer, 2019

Narendra Summer Research Intern

In this project, I studied the 2D Strip Packing problem under the guidance of Prof. Arindam Khan. The current best algorithm for this problem is a 5/3 + ε approximation algorithm, but with the running time heavily dependent on ε. The fastest algorithm is Steinberg's 2 approximation algorithm with a time complexity of O(nloglogn). Our goal was to develop a c-Approximation algorithm with running time O(nd), where c is strictly less than 2 and d is some reasonable constant (maybe ≤ 5).

We deeply analyzed Steinberg's and Schiermeyer's algorithms and developed insights on the problematic cases. We also devised some heuristics to deal with such cases. This project was a part of the Narendra Summer Internship Programme, IISc.

Other Interests

I love listening to all sorts of music (from Classical to hip-hop). I'm a decent singer myself and can also play the Tabla (3 years of professional training). I'm a foodie too 😋

I enjoy reading fiction and Sci-Tech. My favourite author of all time is Ruskin Bond. Just ♥ his novels and short-stories.

Above all, I love solving puzzles (all sorts). Sport programming is one of my favourite hobbies and I'm pretty good at it as well. I even represented my Institute at ACM ICPC India Regionals '19 and I'm also one of the lead representatives of the Group for Algorithms and Sport Programming in my Institute.