I am broadly interested in theoretical computer science. My focus is on approximation algorithms and combinatorial optimization. Recently, I have worked on problems on the hardness of approximation as well as approximation algorithms for set packing, clustering, and scheduling problems. 

• Update: Our paper "The Computational Complexity of Almost Stable Clustering with Penalties" has been accepted to IJCAI 2026.

• Update: Our paper "Inapproximability of H-Coloring Problems" has been accepted to LATIN 2026.

• Update: Our paper "Online and Offline Learning of Orderly Hypergraphs Using Queries" has been accepted to ALT 2026.

[more...]

Upcoming Courses

• Approximation Algorithms (CS 890EY/490DM) - Winter 2027

• Data Structures and Abstraction (CS 210) - Winter 2027

• Data Structures and Abstraction (CS 210) - Spring 2027

Past Courses

• Data Structures and Abstraction (CS 210) - Spring 2026

• Discrete Computational Structures (CS 310) - Winter 2026

• Data Structures and Abstraction (CS 210) - Winter 2026

• Data Structures and Abstraction (CS 210) - Spring 2025

• Approximation Algorithms (CS 890EY/490DM) - Winter 2025

• Data Structures and Abstraction (CS 210) - Spring 2024

• Discrete Computational Structures (CS 310) - Winter 2024

• Approximation Algorithms - Aalto University, Spring 2022

• Seminars on Mathematical Foundations of Data Science - JMU Würzburg, Summer 2021

• Approximation Algorithms - JMU Würzburg, Fall 2020

Program Committee

• WAOA 2023

• Canadian AI 2020, Canadian AI 2019, Canadian AI 2018