Hello! I'm currently a PhD student in Combinatorics and Optimization at the University of Waterloo with Vijay Bhattiprolu. I recently completed my Master's with with Kanstantsin Pashkovich. I did my undergrad in Honors Computing Science at the University of Alberta, where I can thank Zachary Friggstad for helping guide me to the lovely world of algorithms and theoretical computer science.
Check out Asymptote, an open source vector graphics language I've done some work on. I'm also a fan of competitive programming. If you like fun problems you should check it out! Kattis and codeforces are good sources of problems and contests.
I am broadly interested in combinatorial optimization and approximation algorithms. Currently I am looking at hardness of approximation, and previously I've looked at problems with a game theoretic twist.
My Master's thesis, Contracts for Density and Packing Functions, focused primarily on obtaining an additive PTAS for a graph density contract theory problem. Also available is the presentation from my Master's thesis, and an arXiv version, Linear Contracts for Supermodular Functions Based on Graphs.
Also feel free to check out my personal site (tsko.ski) which has more pictures of my corgi, baking, projects, adventures, etc.
My hometown Edmonton is now investing $100 million into bike infrastructure (bike plan)! I think this is great news for infrastructure in the city. Also biking is great.
