Calvin Beideman

I am an Instructional Assistant Professor of Comptuer Science at Texas A&M University. I obtained my PhD from the University of Illinois Urbana Champaign (UIUC), where I was advised by Karthekeyan Chandrasekaran. Before that, I completed my Bachelor's Degree at Carnegie Mellon University in Computer Science. There I worked under Ryan O'Donnell on my honors thesis. I also had the pleasure of working with Anil Ada in the development of the course 15-251: Great Ideas in Theoretical Computer Science.

[My CV]

Publications

• Approximate minimum cuts and their enumeration
  (with Karthekeyan Chandrasekaran and Weihang Wang)
  SIAM Symposium on Simplicity in Algorithm (SOSA), 2023.
• Approximate Representation of Symmetric Submodular Functions via Hypergraph Cut Functions
  (with Karthekeyan Chandrasekaran, Chandra Chekuri, and Chao Xu)
  IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS), 2022.
• 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.
  Mathematical Programming, 2022. [arXiv]

Teaching

At Texas A&M:

SP 2024

CSCE 120: Program Design and Concepts

CSCE 411: Design and Analysis of Algorithms

FA 2023

CSCE 120: Program Design and Concepts/dd>

At UIUC:

FA 2022

CS 374: Algorithms & Models of Computation (Head TA)

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: [last name] at tamu dot edu
Office: 113 PETR