Christian Konrad

ORCID

Publication Activity (10 Years)

Years Active: 2010-2022
Publications (10 Years): 49

Top Venues

University of Paris-Sud, Orsay, France (PHD)

Education History

University of Paris-Sud, Orsay, France

PHD

Publications

Cezar-Mihail Alexandru, Pavel Dvorák, Christian Konrad, Kheeran K. Naidu
Closing the Gap between Weighted and Unweighted Matching in the Sliding Window Model. CoRR (2022)
Christian Konrad, Viktor Zamaraev
Distributed minimum vertex coloring and maximum independent set in chordal graphs. Theor. Comput. Sci. 922 (2022)
Sanjeev Khanna, Christian Konrad
Optimal Bounds for Dominating Set in Graph Streams. ITCS (2022)
Julius Moritz Berges, Kathrin Spütz, Georg Jacobs, Julia Kowalski, Thilo Zerwas, Jörg Berroth, Christian Konrad
Automated Identification of Valid Model Networks Using Model-Based Systems Engineering. Syst. 10 (6) (2022)
Christian Konrad, Tigran Tonoyan
Guessing fractions of online sequences. Discret. Appl. Math. 308 (2022)
Michael Barlow, Christian Konrad, Charana Nandasena
Streaming Set Cover in Practice. ALENEX (2021)
Christian Konrad, Kheeran K. Naidu
On Two-Pass Streaming Algorithms for Maximum Bipartite Matching. APPROX-RANDOM (2021)
Christian Konrad, Kheeran K. Naidu
On Two-Pass Streaming Algorithms for Maximum Bipartite Matching. CoRR (2021)
Christian Konrad
Frequent Elements with Witnesses in Data Streams. PODS (2021)
Christian Konrad, Peter Robinson, Viktor Zamaraev
Robust Lower Bounds for Graph Problems in the Blackboard Model of Communication. CoRR (2021)
Christian Konrad, Sriram V. Pemmaraju, Talal Riaz, Peter Robinson
The Complexity of Symmetry Breaking in Massive Graphs. CoRR (2021)
Magnús M. Halldórsson, Christian Konrad
Improved distributed algorithms for coloring interval graphs with application to multicoloring trees. Theor. Comput. Sci. 811 (2020)
Lidiya Khalidah binti Khalil, Christian Konrad
Constructing Large Matchings via Query Access to a Maximal Matching Oracle. FSTTCS (2020)
Jacques Dark, Christian Konrad
Optimal Lower Bounds for Matching and Vertex Cover in Dynamic Graph Streams. Computational Complexity Conference (2020)
Jacques Dark, Christian Konrad
Optimal Lower Bounds for Matching and Vertex Cover in Dynamic Graph Streams. CoRR (2020)
Magnús M. Halldórsson, Christian Konrad, Tigran Tonoyan
Limitations of current wireless link scheduling algorithms. Theor. Comput. Sci. 840 (2020)
Lidiya Khalidah binti Khalil, Christian Konrad
Constructing Large Matchings via Query Access to a Maximal Matching Oracle. CoRR (2020)
Artur Czumaj, Christian Konrad
Detecting cliques in CONGEST networks. Distributed Comput. 33 (6) (2020)
Rajiv Gandhi, Magnús M. Halldórsson, Christian Konrad, Guy Kortsarz, Hoon Oh
Radio aggregation scheduling. Theor. Comput. Sci. 840 (2020)
Graham Cormode, Jacques Dark, Christian Konrad
Independent Sets in Vertex-Arrival Streams. ICALP (2019)
Christian Konrad
Streaming Frequent Items with Timestamps and Detecting Large Neighborhoods in Graph Streams. CoRR (2019)
Christian Konrad, Viktor Zamaraev
Distributed Minimum Vertex Coloring and Maximum Independent Set in Chordal Graphs. MFCS (2019)
Christian Konrad, Sriram V. Pemmaraju, Talal Riaz, Peter Robinson
The Complexity of Symmetry Breaking in Massive Graphs. DISC (2019)
Christian Konrad
MIS in the Congested Clique Model in O(log log Δ) Rounds. CoRR (2018)
Christian Konrad, Viktor Zamaraev
Brief Announcement: Distributed Minimum Vertex Coloring and Maximum Independent Set in Chordal Graphs. PODC (2018)
Artur Czumaj, Christian Konrad
Detecting cliques in CONGEST networks. CoRR (2018)
Eden Chlamtác, Michael Dinitz, Christian Konrad, Guy Kortsarz, George Rabanca
The Densest k-Subhypergraph Problem. SIAM J. Discret. Math. 32 (2) (2018)
Christoph Dürr, Zdenek Hanzálek, Christian Konrad, Yasmina Seddik, René Sitters, Óscar C. Vásquez, Gerhard J. Woeginger
The triangle scheduling problem. J. Sched. 21 (3) (2018)
Christian Konrad, Viktor Zamaraev
Distributed Minimum Vertex Coloring and Maximum Independent Set in Chordal Graphs. CoRR (2018)
Christian Konrad, Tigran Tonoyan
Preemptively Guessing the Center. ISCO (2018)
Graham Cormode, Jacques Dark, Christian Konrad
Approximating the Caro-Wei Bound for Independent Sets in Graph Streams. ISCO (2018)
Christian Konrad
A Simple Augmentation Method for Matchings with Applications to Streaming Algorithms. MFCS (2018)
Graham Cormode, Jacques Dark, Christian Konrad
Independent Sets in Vertex-Arrival Streams. CoRR (2018)
Mohsen Ghaffari, Themis Gouleakis, Christian Konrad, Slobodan Mitrovic, Ronitt Rubinfeld
Improved Massively Parallel Computation Algorithms for MIS, Matching, and Vertex Cover. PODC (2018)
Magnús M. Halldórsson, Christian Konrad
Computing large independent sets in a single round. Distributed Comput. 31 (1) (2018)
Artur Czumaj, Christian Konrad
Detecting Cliques in CONGEST Networks. DISC (2018)
Magnús M. Halldórsson, Christian Konrad
Improved Distributed Algorithms for Coloring Interval Graphs with Application to Multicoloring Trees. SIROCCO (2017)
Christian Konrad, Tigran Tonoyan
Preemptive Online Partitioning of Sequences. CoRR (2017)
Christian Konrad
SIROCCO 2017 Review. SIGACT News 48 (4) (2017)
Graham Cormode, Jacques Dark, Christian Konrad
Independent Set Size Approximation in Graph Streams. CoRR (2017)
Yusuke Aoki, Bjarni V. Halldórsson, Magnús M. Halldórsson, Takehiro Ito, Christian Konrad, Xiao Zhou
The minimum vulnerability problem on specific graph classes. J. Comb. Optim. 32 (4) (2016)
Eden Chlamtác, Michael Dinitz, Christian Konrad, Guy Kortsarz, George Rabanca
The Densest k-Subhypergraph Problem. CoRR (2016)
Marijke H. L. Bodlaender, Magnús M. Halldórsson, Christian Konrad, Fabian Kuhn
Brief Announcement: Local Independent Set Approximation. PODC (2016)
Christian Konrad, Adi Rosén
Approximating Semi-matchings in Streaming and in Two-Party Communication. ACM Trans. Algorithms 12 (3) (2016)
Eden Chlamtác, Michael Dinitz, Christian Konrad, Guy Kortsarz, George Rabanca
The Densest k-Subhypergraph Problem. APPROX-RANDOM (2016)
Christoph Dürr, Zdenek Hanzálek, Christian Konrad, René Sitters, Óscar C. Vásquez, Gerhard J. Woeginger
The triangle scheduling problem. CoRR (2016)
Christian Konrad
Streaming Partitioning of Sequences and Trees. ICDT (2016)
Christoph Dürr, Christian Konrad, Marc P. Renault
On the Power of Advice and Randomization for Online Bipartite Matching. CoRR (2016)
Christoph Dürr, Christian Konrad, Marc P. Renault
On the Power of Advice and Randomization for Online Bipartite Matching. ESA (2016)
Magnús M. Halldórsson, Christian Konrad
Distributed Large Independent Sets in One Round on Bounded-Independence Graphs. DISC (2015)
Rajiv Gandhi, Magnús M. Halldórsson, Christian Konrad, Guy Kortsarz, Hoon Oh
Radio Aggregation Scheduling. ALGOSENSORS (2015)
Christian Konrad
Maximum Matching in Turnstile Streams. CoRR (2015)
Christian Konrad
Maximum Matching in Turnstile Streams. ESA (2015)
Magnús M. Halldórsson, Christian Konrad, Tigran Tonoyan
Limitations of Current Wireless Scheduling Algorithms. ALGOSENSORS (2015)
Christian Konrad, László Kozma
Streaming Algorithms for Partitioning Integer Sequences. CoRR (2014)
Di Chen, Christian Konrad, Ke Yi, Wei Yu, Qin Zhang
Robust set reconciliation. SIGMOD Conference (2014)
Magnús M. Halldórsson, Christian Konrad
Distributed Algorithms for Coloring Interval Graphs. DISC (2014)
Yusuke Aoki, Bjarni V. Halldórsson, Magnús M. Halldórsson, Takehiro Ito, Christian Konrad, Xiao Zhou
The Minimum Vulnerability Problem on Graphs. COCOA (2014)
Christian Konrad, Adi Rosén
Approximating Semi-matchings in Streaming and in Two-Party Communication. ICALP (1) (2013)
Christian Konrad, Adi Rosén
Approximating Semi-Matchings in Streaming and in Two-Party Communication CoRR (2013)
Christian Konrad, Frédéric Magniez
Validating XML documents in the streaming model with external memory. ACM Trans. Database Syst. 38 (4) (2013)
Christian Konrad, Frédéric Magniez, Claire Mathieu
Maximum Matching in Semi-streaming with Few Passes. APPROX-RANDOM (2012)
Christian Konrad, Frédéric Magniez
Validating XML documents in the streaming model with external memory. ICDT (2012)
Christian Konrad, Frédéric Magniez, Claire Mathieu
Maximum Matching in Semi-Streaming with Few Passes CoRR (2011)
Christian Konrad
Two-constraint domain decomposition with Space Filling Curves. Parallel Comput. 37 (4-5) (2011)
Christian Konrad, Frédéric Magniez
The Streaming Complexity of Validating XML Documents CoRR (2010)

Christian Konrad.css-eqlu8i{font-size:small;padding-left:4px;}

Publication Activity (10 Years)

Top Topics

Top Venues

Christian Konrad