| 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 | ESA | Constructing Long Paths in Graph Streams. | Christian Konrad, Chhaya Trehan |
| 2025 | ICALP | Streaming Maximal Matching with Bounded Deletions. | Sanjeev Khanna, Christian Konrad, Jacques Dark |
| 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 | ESA | Interval Selection in Sliding Windows. | Cezar-Mihail Alexandru, Christian Konrad |
| 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 | PODS | Set Cover in the One-pass Edge-arrival Streaming Model. | Sanjeev Khanna, Christian Konrad, Cezar-Mihail Alexandru |
| 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 |
| 2021 | ALENEX | Streaming Set Cover in Practice. | Michael Barlow, Christian Konrad, Charana Nandasena |
| 2021 | PODS | Frequent Elements with Witnesses in Data Streams. | Christian Konrad |
| 2019 | ICALP | Independent Sets in Vertex-Arrival Streams. | Graham Cormode, Jacques Dark, Christian Konrad |
| 2019 | MFCS | Distributed Minimum Vertex Coloring and Maximum Independent Set in Chordal Graphs. | Christian Konrad, Viktor Zamaraev |
| 2018 | MFCS | A Simple Augmentation Method for Matchings with Applications to Streaming Algorithms. | Christian Konrad |
| 2018 | PODC | Improved Massively Parallel Computation Algorithms for MIS, Matching, and Vertex Cover. | Mohsen Ghaffari, Themis Gouleakis, Christian Konrad, Slobodan Mitrovic, Ronitt Rubinfeld |
| 2018 | PODC | Brief Announcement: Distributed Minimum Vertex Coloring and Maximum Independent Set in Chordal Graphs. | Christian Konrad, Viktor Zamaraev |
| 2017 | SIROCCO | Improved Distributed Algorithms for Coloring Interval Graphs with Application to Multicoloring Trees. | Magns M. Halldrsson, Christian Konrad |
| 2016 | ESA | On the Power of Advice and Randomization for Online Bipartite Matching. | Christoph Drr, Christian Konrad, Marc P. Renault |
| 2016 | ICDT | Streaming Partitioning of Sequences and Trees. | Christian Konrad |
| 2016 | PODC | Brief Announcement: Local Independent Set Approximation. | Marijke H. L. Bodlaender, Magns M. Halldrsson, Christian Konrad, Fabian Kuhn |
| 2015 | Algosensors | Radio Aggregation Scheduling. | Rajiv Gandhi, Magns M. Halldrsson, Christian Konrad, Guy Kortsarz, Hoon Oh |
| 2015 | Algosensors | Limitations of Current Wireless Scheduling Algorithms. | Magns M. Halldrsson, Christian Konrad, Tigran Tonoyan |
| 2015 | ESA | Maximum Matching in Turnstile Streams. | Christian Konrad |
| 2014 | COCOA | The Minimum Vulnerability Problem on Graphs. | Yusuke Aoki, Bjarni V. Halldrsson, Magns M. Halldrsson, Takehiro Ito, Christian Konrad, Xiao Zhou |
| 2014 | SIGMOD | Robust set reconciliation. | Di Chen, Christian Konrad, Ke Yi, Wei Yu, Qin Zhang |
| 2013 | ICALP | Approximating Semi-matchings in Streaming and in Two-Party Communication. | Christian Konrad, Adi Rosn |
| 2012 | ICDT | Validating XML documents in the streaming model with external memory. | Christian Konrad, Frdric Magniez |