| 2026 | ESA | On the Assadi-Liu-Tarjan Auction Algorithm for Bipartite Matching: Simplification, Alternative Analysis, and Hard Instance. | Christian Konrad, Kheeran K. Naidu, Archie Walton, Eric Wang |
| 2026 | STACS | Unit Interval Selection in Random Order Streams. | Cezar-Mihail Alexandru, Adithya Diddapur, Magns M. Halldrsson, Christian Konrad, Kheeran K. Naidu |
| 2025 | SODA | Settling the Pass Complexity of Approximate Matchings in Dynamic Graph Streams. | Sepehr Assadi, Soheil Behnezhad, Christian Konrad, Kheeran K. Naidu, Janani Sundaresan |
| 2024 | SODA | An Unconditional Lower Bound for Two-Pass Streaming Algorithms for Maximum Matching Approximation. | Christian Konrad, Kheeran K. Naidu |
| 2024 | STOC | O(log log n) Passes Is Optimal for Semi-streaming Maximal Independent Set. | Sepehr Assadi, Christian Konrad, Kheeran K. Naidu, Janani Sundaresan |
| 2023 | STACS | Maximum Matching via Maximal Matching Queries. | Christian Konrad, Kheeran K. Naidu, Arun Steward |
| 2023 | STACS | Improved Weighted Matching in the Sliding Window Model. | Cezar-Mihail Alexandru, Pavel Dvork, Christian Konrad, Kheeran K. Naidu |