Calvin Beideman

I am a fifth-year PhD student at the University of Illinois Urbana Champaign (UIUC), where I am thankful to be advised by Karthekeyan Chandrasekaran. Before coming to UIUC, I studied at Carnegie Mellon University, where I obtained a Bachelor of Science in Computer Science with an additional major in Mathematical Sciences (Discrete Mathematics and Logic) with University Honors. There I had the good fortune of working under Ryan O'Donnell on my honors thesis. I also had the pleasure of doing research with Anil Ada and of working with him in the development of the course 15-251: Great Ideas in Theoretical Computer Science.

[My CV]

Publications

• Counting and enumerating optimum cut sets for hypergraph k-partitioning problems for fixed k
  (with Karthekeyan Chandrasekaran and Weihang Wang)
  International Colloquium on Automata, Languages and Programming (ICALP), 2022. [arXiv]
• Faster Connectivity in Low-rank Hypergraphs via Expander Decomposition
  (with Karthekeyan Chandrasekaran, Sagnik Mukhopadhyay, and Danupon Nanongkai)
  Integer Programming and Combinatorial Optimization (IPCO), 2022. [arXiv]
• Deterministic enumeration of all minimum cut-sets and k-cut-sets in hypergraphs for fixed k
  (with Karthekeyan Chandrasekaran and Weihang Wang)
  ACM-SIAM Symposium on Discrete Algorithms (SODA), 2022. [arXiv]
• Multicritera Cuts and Size-Constrained k-cuts in Hypergraphs
  (with Karthekeyan Chandrasekaran and Chao Xu)
  Preliminary version in International Conference on Randomization and Computation (RANDOM), 2020.
  To appear in Mathematical Programming, 2022. [arXiv]

Teaching

At UIUC:

SU 2022

CS 173: Discrete Structures (Instructor)

SP 2022

CS 586/IE 519: Combinatorial Optimization (Teaching Assistant)

SP 2021

CS 374: Algorithms & Models of Computation (Teaching Assistant)

FA 2020

CS 473: Algorithms (Teaching Assistant)

FA 2019

CS 374: Algorithms & Models of Computation (Teaching Assistant)

SP 2019

CS 173: Discrete Structures (Teaching Assistant)

FA 2018

CS 374: Algorithms & Models of Computation (Teaching Assistant)

At CMU:

SP 2018

15-251: Great Ideas in Theoretical Computer Science (Head Teaching Assistant)

FA 2017

15-251: Great Ideas in Theoretical Computer Science (Head Teaching Assistant)

SP 2017

15-251: Great Ideas in Theoretical Computer Science (Teaching Assistant)

FA 2016

15-251: Great Ideas in Theoretical Computer Science (Teaching Assistant)

SP 2016

15-251: Great Ideas in Theoretical Computer Science (Teaching Assistant)

FA 2015

15-251: Great Ideas in Theoretical Computer Science (Teaching Assistant)

I was honored to be the 2018 undergraduate recepient of the Alan J. Perlis SCS Student Teaching Award.

Contact

Email: [first name][last initial][least prime number] at illinois dot edu
Office: 3101 Siebel Center