|I wrote a report on SIROCCO 2017, which was recently published in ACM SIGACT News (Volume 48).
|Article The Densest k-Subhypergraph Problem (co-authored by Eden Chlamtàč,
Michael Dinitz, Guy Kortsarz and George Rabanca) accepted for publication in SIAM Journal of Discrete Mathematics (SIDMA).
||Delivered a talk at SIROCCO on the paper "Improved Distributed Algorithms for
Coloring Interval Graphs with Application to Multicoloring Trees",
which is joint work with Magnús M.
|Delivered a talk at the Shonan workshop "Processing
Big Data Streams".
|Article The triangle scheduling problem
(co-authored by Christoph
Dürr, Zdeněk Hanzálek, Yasmina Seddik, René Sitters, Óscar C. Vásquez
and Gerhard Woeginger) accepted for
publication in the Journal
|Article Improved Distributed Algorithms for
Coloring Interval Graphs with Application to Multicoloring Trees
(joint work with Magnús M.
Halldórsson) accepted at SIROCCO 2017.
Large Independent Sets in a Single Round co-authored by Magnús M. Halldórsson
publication in Distributed
Computing. This is an extended version of this article (presented
at DISC 2015) with many new results.
|New preprint of joint work on
streaming independent set size approximation with Graham Cormode and Jacques
|New preprint of joint work on online data
partitioning with Tigran Tonoyan available.
| Delivered a DIMAP
seminar talk in Warwick.
Computer Science Department at Warwick University.
|Delivered a talk at ESA on the paper "On the Power of Advice and
Randomization for Online Bipartite Matching", which is a joint work
with Christoph Dürr