Christian Konrad

From MaRDI portal
Person:346525

Available identifiers

zbMath Open konrad.christianMaRDI QIDQ346525

List of research outcomes





PublicationDate of PublicationType
An unconditional lower bound for two-pass streaming algorithms for maximum matching approximation2024-11-28Paper
Improved weighted matching in the sliding window model2024-10-08Paper
Maximum matching via maximal matching queries2024-10-08Paper
https://portal.mardi4nfdi.de/entity/Q61263372024-04-09Paper
https://portal.mardi4nfdi.de/entity/Q60908932023-11-20Paper
The complexity of symmetry breaking in massive graphs2023-02-03Paper
Detecting cliques in CONGEST networks2022-07-21Paper
Independent sets in vertex-arrival streams2022-07-21Paper
Distributed Minimum Vertex Coloring and Maximum Independent Set in Chordal Graphs2022-07-21Paper
Optimal lower bounds for matching and vertex cover in dynamic graph streams2022-07-21Paper
Distributed minimum vertex coloring and maximum independent set in chordal graphs2022-06-13Paper
Guessing fractions of online sequences2022-01-05Paper
A simple augmentation method for matchings with applications to streaming algorithms2021-08-04Paper
Streaming Set Cover in Practice2021-01-27Paper
Detecting cliques in CONGEST networks2021-01-22Paper
Radio aggregation scheduling2020-09-17Paper
Limitations of current wireless link scheduling algorithms2020-09-17Paper
Improved distributed algorithms for coloring interval graphs with application to multicoloring trees2020-02-13Paper
Improved massively parallel computation algorithms for MIS, matching, and vertex cover2019-09-19Paper
Brief announcement: Distributed minimum vertex coloring and maximum independent set in chordal graphs2019-09-19Paper
The triangle scheduling problem2018-11-07Paper
Distributed large independent sets in one round on bounded-independence graphs2018-08-24Paper
Approximating the Caro-Wei bound for independent sets in graph streams2018-08-17Paper
Preemptively guessing the center2018-08-17Paper
The densest \(k\)-subhypergraph problem2018-07-18Paper
The densest \(k\)-subhypergraph problem2018-04-19Paper
Improved distributed algorithms for coloring interval graphs with application to multicoloring trees2018-04-12Paper
On the power of advice and randomization for online bipartite matching2018-03-02Paper
Computing large independent sets in a single round2018-02-23Paper
Brief Announcement2017-09-29Paper
Streaming partitioning of sequences and trees2017-07-14Paper
The minimum vulnerability problem on specific graph classes2016-11-29Paper
Maximum matching in turnstile streams2015-11-19Paper
The minimum vulnerability problem on graphs2015-09-11Paper
Validating XML documents in the streaming model with external memory2015-09-03Paper
Distributed algorithms for coloring interval graphs2015-02-10Paper
Maximum matching in semi-streaming with few passes2012-11-02Paper
Two-constraint domain decomposition with space filling curves2011-07-14Paper

Research outcomes over time

This page was built for person: Christian Konrad