The Streaming Complexity of Validating XML Documents - Christian Konrad 001; Frédéric Magniez (CoRR, 2010)

Two-constraint domain decomposition with Space Filling Curves. - Christian Konrad 001 (Parallel Comput., 2011)

Maximum Matching in Semi-streaming with Few Passes. - Christian Konrad 001; Frédéric Magniez; Claire Mathieu (APPROX-RANDOM, 2012)

Validating XML documents in the streaming model with external memory. - Christian Konrad 001; Frédéric Magniez (ACM Trans. Database Syst., 2013)

Computations on Massive Data Sets : Streaming Algorithms and Two-party Communication. (Calculs sur des grosses données : algorithmes de streaming et communication entre deux joueurs). - Christian Konrad 001 (2013)

The Minimum Vulnerability Problem on Graphs. - Yusuke Aoki; Bjarni V. Halldórsson; Magnús M. Halldórsson; Takehiro Ito; Christian Konrad 001; Xiao Zhou 001 (COCOA, 2014)

Robust set reconciliation. - Di Chen; Christian Konrad 001; Ke Yi 001; Wei Yu; Qin Zhang 001 (SIGMOD Conference, 2014)

Distributed Algorithms for Coloring Interval Graphs. - Magnús M. Halldórsson; Christian Konrad 001 (DISC, 2014)

Streaming Algorithms for Partitioning Integer Sequences. - Christian Konrad 001; László Kozma 002 (CoRR, 2014)

Limitations of Current Wireless Scheduling Algorithms. - Magnús M. Halldórsson; Christian Konrad 001; Tigran Tonoyan (ALGOSENSORS, 2015)

Maximum Matching in Turnstile Streams. - Christian Konrad 001 (ESA, 2015)

Distributed Large Independent Sets in One Round on Bounded-Independence Graphs. - Magnús M. Halldórsson; Christian Konrad 001 (DISC, 2015)

On the Power of Advice and Randomization for Online Bipartite Matching. - Christoph Dürr; Christian Konrad 001; Marc P. Renault (ESA, 2016)

Streaming Partitioning of Sequences and Trees. - Christian Konrad 001 (ICDT, 2016)

Brief Announcement: Local Independent Set Approximation. - Marijke H. L. Bodlaender; Magnús M. Halldórsson; Christian Konrad 001; Fabian Kuhn (PODC, 2016)

The triangle scheduling problem. - Christoph Dürr; Zdenek Hanzálek; Christian Konrad 001; René Sitters; Óscar C. Vásquez 001; Gerhard J. Woeginger (CoRR, 2016)

The minimum vulnerability problem on specific graph classes. - Yusuke Aoki; Bjarni V. Halldórsson; Magnús M. Halldórsson; Takehiro Ito; Christian Konrad 001; Xiao Zhou 001 (J. Comb. Optim., 2016)

Approximating Semi-matchings in Streaming and in Two-Party Communication. - Christian Konrad 001; Adi Rosén (ACM Trans. Algorithms, 2016)

Independent Set Size Approximation in Graph Streams. - Graham Cormode; Jacques Dark; Christian Konrad 001 (CoRR, 2017)

Preemptive Online Partitioning of Sequences. - Christian Konrad 001; Tigran Tonoyan (CoRR, 2017)

SIROCCO 2017 Review. - Christian Konrad 001 (SIGACT News, 2017)

Approximating the Caro-Wei Bound for Independent Sets in Graph Streams. - Graham Cormode; Jacques Dark; Christian Konrad 001 (ISCO, 2018)

Preemptively Guessing the Center. - Christian Konrad 001; Tigran Tonoyan (ISCO, 2018)

A Simple Augmentation Method for Matchings with Applications to Streaming Algorithms. - Christian Konrad 001 (MFCS, 2018)

Improved Massively Parallel Computation Algorithms for MIS, Matching, and Vertex Cover. - Mohsen Ghaffari 001; Themis Gouleakis; Christian Konrad 001; Slobodan Mitrovic; Ronitt Rubinfeld (PODC, 2018)

Brief Announcement: Distributed Minimum Vertex Coloring and Maximum Independent Set in Chordal Graphs. - Christian Konrad 001; Viktor Zamaraev (PODC, 2018)

MIS in the Congested Clique Model in O(log log Δ) Rounds. - Christian Konrad 001 (CoRR, 2018)

Computing large independent sets in a single round. - Magnús M. Halldórsson; Christian Konrad 001 (Distributed Comput., 2018)

The triangle scheduling problem. - Christoph Dürr; Zdenek Hanzálek; Christian Konrad 001; Yasmina Seddik; René Sitters; Óscar C. Vásquez 001; Gerhard J. Woeginger (J. Sched., 2018)

The Densest k-Subhypergraph Problem. - Eden Chlamtác; Michael Dinitz; Christian Konrad 001; Guy Kortsarz; George Rabanca (SIAM J. Discret. Math., 2018)

Independent Sets in Vertex-Arrival Streams. - Graham Cormode; Jacques Dark; Christian Konrad 001 (ICALP, 2019)

The Complexity of Symmetry Breaking in Massive Graphs. - Christian Konrad 001; Sriram V. Pemmaraju; Talal Riaz; Peter Robinson 002 (DISC, 2019)

Streaming Frequent Items with Timestamps and Detecting Large Neighborhoods in Graph Streams. - Christian Konrad 001 (CoRR, 2019)

Optimal Lower Bounds for Matching and Vertex Cover in Dynamic Graph Streams. - Jacques Dark; Christian Konrad 001 (CCC, 2020)

Constructing Large Matchings via Query Access to a Maximal Matching Oracle. - Lidiya Khalidah binti Khalil; Christian Konrad 001 (FSTTCS, 2020)

Detecting cliques in CONGEST networks. - Artur Czumaj; Christian Konrad 001 (Distributed Comput., 2020)

Radio aggregation scheduling. - Rajiv Gandhi; Magnús M. Halldórsson; Christian Konrad 001; Guy Kortsarz; Hoon Oh (Theor. Comput. Sci., 2020)

Improved distributed algorithms for coloring interval graphs with application to multicoloring trees. - Magnús M. Halldórsson; Christian Konrad 001 (Theor. Comput. Sci., 2020)

Limitations of current wireless link scheduling algorithms. - Magnús M. Halldórsson; Christian Konrad 001; Tigran Tonoyan (Theor. Comput. Sci., 2020)

Streaming Set Cover in Practice. - Michael Barlow 002; Christian Konrad 001; Charana Nandasena (ALENEX, 2021)

On Two-Pass Streaming Algorithms for Maximum Bipartite Matching. - Christian Konrad 001; Kheeran K. Naidu (APPROX-RANDOM, 2021)

Frequent Elements with Witnesses in Data Streams. - Christian Konrad 001 (PODS, 2021)

Robust Lower Bounds for Graph Problems in the Blackboard Model of Communication. - Christian Konrad 001; Peter Robinson 002; Viktor Zamaraev (CoRR, 2021)

Optimal Bounds for Dominating Set in Graph Streams. - Sanjeev Khanna; Christian Konrad 001 (ITCS, 2022)

Closing the Gap between Weighted and Unweighted Matching in the Sliding Window Model. - Cezar-Mihail Alexandru; Pavel Dvorák; Christian Konrad 001; Kheeran K. Naidu (CoRR, 2022)

Guessing fractions of online sequences. - Christian Konrad 001; Tigran Tonoyan (Discret. Appl. Math., 2022)

Distributed minimum vertex coloring and maximum independent set in chordal graphs. - Christian Konrad 001; Viktor Zamaraev (Theor. Comput. Sci., 2022)

Interval Selection in Data Streams: Weighted Intervals and the Insertion-Deletion Setting. - Jacques Dark; Adithya Diddapur; Christian Konrad 001 (FSTTCS, 2023)

Set Cover in the One-pass Edge-arrival Streaming Model. - Sanjeev Khanna; Christian Konrad 001; Cezar-Mihail Alexandru (PODS, 2023)

Maximum Matching via Maximal Matching Queries. - Christian Konrad 001; Kheeran K. Naidu; Arun Steward (STACS, 2023)

Improved Weighted Matching in the Sliding Window Model. - Cezar-Mihail Alexandru; Pavel Dvorák; Christian Konrad 001; Kheeran K. Naidu (STACS, 2023)

Interval Selection in Sliding Windows. - Cezar-Mihail Alexandru; Christian Konrad 001 (ESA, 2024)

Matchings in Low-Arboricity Graphs in the Dynamic Graph Stream Model. - Christian Konrad 001; Andrew McGregor 001; Rik Sengupta; Cuong Than (FSTTCS, 2024)

An Unconditional Lower Bound for Two-Pass Streaming Algorithms for Maximum Matching Approximation. - Christian Konrad 001; Kheeran K. Naidu (SODA, 2024)

O(log log n) Passes Is Optimal for Semi-streaming Maximal Independent Set. - Sepehr Assadi; Christian Konrad 001; Kheeran K. Naidu; Janani Sundaresan (STOC, 2024)

Streaming Maximal Matching with Bounded Deletions. - Sanjeev Khanna; Christian Konrad 001; Jacques Dark (ICALP, 2025)

Graph Reconstruction via MIS Queries. - Christian Konrad 001; Conor O'Sullivan; Victor Traistaru (ITCS, 2025)

Settling the Pass Complexity of Approximate Matchings in Dynamic Graph Streams. - Sepehr Assadi; Soheil Behnezhad; Christian Konrad 001; Kheeran K. Naidu; Janani Sundaresan (SODA, 2025)