I am a Ph.D. student with the Theory Group at the University of Illinois, Urbana Champaign. I am fortunate to be advised by Karthik Chandrasekaran.
Here is my C.V. (last updated November 2024).
Here is a draft of my thesis proposal (last updated November 2024).
Polyhedral Aspects of Feedback Vertex Set and Pseudoforest Deletion Set
Karthik Chandrasekaran, Chandra Chekuri, Samuel Fiorini, Shubhang Kulkarni and Stefan Weltge.
(To appear) Mathematical Programming 2025.
[arXiv] [Poster]
On Deleting Vertices to Reduce Density in Graphs and Supermodular Functions
Chandra Chekuri, Karthik Chandrasekaran, and Shubhang Kulkarni.
In Submission 2024.
[link]
From Directed Steiner Tree to Polymatroid Steiner Tree in Planar Graphs
Chandra Chekuri, Rhea Jain, Shubhang Kulkarni, Da Wei (David) Zheng and Weihao Zhu.
In European Symposium on Algorithms (ESA 2024).
[arXiv]
Hypergraph Connectivity Augmentation in Strongly-Polynomial Time
Kristóf Bérczi, Karthik Chandrasekaran, Tamás Király and Shubhang Kulkarni.
In European Symposium on Algorithms (ESA 2024).
[arXiv]
Splitting-off in Hypergraphs
Kristóf Bérczi, Karthik Chandrasekaran, Tamás Király and Shubhang Kulkarni.
In 51st EATCS International Colloquium on Automata, Languages and Programming (ICALP 2024).
[arXiv]
Efficient Feedback and Partial Credit Grading for Proof Blocks Problems
Seth Poulsen, Shubhang Kulkarni, Geoffrey Herman, Matthew West.
The 24th International Conference on Artificial Intelligence in Education (AIED 2023).
[paper]
Polyhedral Binary Decision Diagrams for Representing Non-Convex Polyhedra
Shubhang Kulkarni and Michael Kruse.
12th International Workshop on Polyhedral Compilation Techniques (IMPACT 2022).
[paper] [slides] [my talk @ IMPACT]
Benchmarking partial credit grading algorithms for Proof Blocks problems
Seth Poulsen, Shubhang Kulkarni, Geoffrey Herman, Matthew West.
[Extended Abstract] The 23rd International Conference on Artificial Intelligence in Education (AIED 2022).
[paper]
The Maximum Binary Tree Problem
Karthik Chandrasekaran, Elena Grigorescu, Gabriel Istrate, Shubhang Kulkarni, Young-San Lin, Minshen Zhu.
Algorithmica 2021 [Vol 83, No. 8].
Preliminary version appeared in European Symposia on Algorithms (ESA 2020).
[paper]
[full arXiv version] [video by Young-San] [slides]
Fixed-Parameter Algorithms for Longest Heapable Subsequence and Maximum Binary Tree
Karthik Chandrasekaran, Elena Grigorescu, Gabriel Istrate, Shubhang Kulkarni, Young-San Lin, Minshen Zhu.
International Symposium on Parameterized and Exact Computation (IPEC 2020).
[paper]
Locally Decodable/Correctable Codes for Insertions and Deletions
Alexander R. Block, Jeremiah Blocki, Elena Grigorescu, Shubhang Kulkarni, Minshen Zhu.
Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2020).
[paper] [full arXiv version] [video by Alex] [slides]
On Locally Decodable Codes in Resource Bounded Channels
Jeremiah Blocki, Shubhang Kulkarni, Samson Zhou.
Information Theoretic Cryptography (ITC 2020).
[paper] [full arXiv version] [Pre-Recorded Talk] [8 Min. Conference Talk]
Exploring Frequented Regions in Pan-Genomic Graphs.
Alan Cleary, Thiruvarangan Ramaraj, Indika Kahanda, Joann Mudge, Shubhang Kulkarni, Brendan Mumey.
15th Annual Rocky Mountain Bioinformatics Conference (ROCKY, 2017).
[Project] [Poster]
You may reach me at smkulka2 [at] illinois [dot] edu
© 2024 Shubhang Kulkarni