19 citations · 54 across the 16 of their papers we have counts for
3 papers · 1 filter
The Densest k-Subhypergraph Problem
Eden Chlamtáč, Michael Dinitz, Christian Konrad +2
The Densest -Subgraph (DS) problem, and its corresponding minimization problem Smallest -Edge Subgraph (SES), have come to play a central role in approximation algorith…
On the Power of Advice and Randomization for Online Bipartite Matching
Christoph Dürr, Christian Konrad, Marc Renault
While randomized online algorithms have access to a sequence of uniform random bits, deterministic online algorithms with advice have access to a sequence of advice bits, i.e., bit…
The triangle scheduling problem
Christoph Dürr, Zdeněk Hanzálek, Christian Konrad +4
This paper introduces a novel scheduling problem, where jobs occupy a triangular shape on the time line. This problem is motivated by scheduling jobs with different criticality lev…