Research Scientist
Email: [email protected]
Dr. Bundit Laekhanukit
I am a senior researcher in the Algorithms and Theory group at INSAIT. My work primarily focuses on Graph Algorithms, Approximation Algorithms, Hardness of Approximation, and Parameterized Complexity. I received my PhD from McGill University in 2014. Before joining INSAIT, I was an Associate Professor at the Institute for Theoretical Computer Science at Shanghai University of Finance and Economics (ITCS@SUFE).
Research Interests
- Graph Algorithms
- Approximation Algorithms
- Hardness of Approximation
- Parameterized Complexity
- Computational Complexity
Teaching
- Undergraduate Algorithms: Spring 2019, Spring 2020, Spring 2021, Spring 2023
- Graduate Algorithms: Spring 2022
- Advanced Algorithms: Spring 2020
- Scientific Computation: Spring 2022, Spring 2023
- Object-Oriented Design and Analysis: Summer 2021, Summer 2022, Summer 2023, Fall 2023
- Principle of Database Systems: Fall 2022
- Computational Complexity: Fall 2022 (online, co-teach with Jittat Fakcharoenphol)
- Other Courses: Computer Programming, IT for Engineers
Academic Background
- PhD in Computer Science
McGill University
Advisor: Adrian Vetta - MMath in Combinatorics and Optimization
University of Waterloo
Advisor: Joseph Cheriyan - MEng in Computer Engineering
Kasetsart University
Advisor: Jittat Fakcharoenphol - BEng in Computer Engineering
Kasetsart University
Positions
- Associate Professor: Shanghai University of Finance and Economics (June 2018 – June 2024)
- Lecturer: Kasetsart University Kamphaeng-Saen Campus (May 2007 – April 2008)
- Part-Time Lecturer: Kasetsart University Sri-Racha Campus (November 2005 – March 2007)
- Postdocs:
- Swiss AI Lab IDSIA (June 2014 – August 2014, January 2015 – September 2015)
- Weizmann Institute for Science (October 2015 – August 2017)
- Simons Institute for the Theory of Computing at UC Berkeley (August 2014 – December 2014, August 2017 – December 2017)
- Max-Planck-Institut für Informatik (January 2018 – June 2018)
