Shubhang Kulkarni

According to our database, Shubhang Kulkarni authored at least 12 papers between 2020 and 2024.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2024

Splitting-Off in Hypergraphs.

Kristóf Bérczi, Karthekeyan Chandrasekaran, Tamás Király, Shubhang Kulkarni

Proceedings of the 51st International Colloquium on Automata, Languages, and Programming, 2024

From Directed Steiner Tree to Directed Polymatroid Steiner Tree in Planar Graphs.

Chandra Chekuri, Rhea Jain, Shubhang Kulkarni, Da Wei Zheng, Weihao Zhu

Proceedings of the 32nd Annual European Symposium on Algorithms, 2024

Hypergraph Connectivity Augmentation in Strongly Polynomial Time.

Kristóf Bérczi, Karthekeyan Chandrasekaran, Tamás Király, Shubhang Kulkarni

Proceedings of the 32nd Annual European Symposium on Algorithms, 2024

2023

Hypergraph Splitting-off and Covering Skew-Supermodular Functions in Strongly Polynomial Time.

Kristóf Bérczi, Karthekeyan Chandrasekaran, Tamás Király, Shubhang Kulkarni

CoRR, 2023

Polyhedral Aspects of Feedback Vertex Set and Pseudoforest Deletion Set.

Karthekeyan Chandrasekaran, Chandra Chekuri, Samuel Fiorini, Shubhang Kulkarni, Stefan Weltge

CoRR, 2023

Efficient Feedback and Partial Credit Grading for Proof Blocks Problems.

Seth Poulsen, Shubhang Kulkarni, Geoffrey L. Herman, Matthew West

Proceedings of the Artificial Intelligence in Education - 24th International Conference, 2023

2022

Efficient Partial Credit Grading of Proof Blocks Problems.

Seth Poulsen, Shubhang Kulkarni, Geoffrey L. Herman, Matthew West

CoRR, 2022

Benchmarking Partial Credit Grading Algorithms for Proof Blocks Problems.

Seth Poulsen, Shubhang Kulkarni, Geoffrey L. Herman, Matthew West

Proceedings of the Artificial Intelligence in Education. Posters and Late Breaking Results, Workshops and Tutorials, Industry and Innovation Tracks, Practitioners' and Doctoral Consortium, 2022

2021

The Maximum Binary Tree Problem.

Karthekeyan Chandrasekaran, Elena Grigorescu, Gabriel Istrate, Shubhang Kulkarni, Young-San Lin, Minshen Zhu

Algorithmica, 2021

2020

Fixed-Parameter Algorithms for Longest Heapable Subsequence and Maximum Binary Tree.

Karthekeyan Chandrasekaran, Elena Grigorescu, Gabriel Istrate, Shubhang Kulkarni, Young-San Lin, Minshen Zhu

Proceedings of the 15th International Symposium on Parameterized and Exact Computation, 2020

On Locally Decodable Codes in Resource Bounded Channels.

Jeremiah Blocki, Shubhang Kulkarni, Samson Zhou

Proceedings of the 1st Conference on Information-Theoretic Cryptography, 2020

Locally Decodable/Correctable Codes for Insertions and Deletions.

Alexander R. Block, Jeremiah Blocki, Elena Grigorescu, Shubhang Kulkarni, Minshen Zhu

Proceedings of the 40th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, 2020