You are here:
2020 Andreas Wiese (Universidad de Chile) Fully Dynamic Approximate Maximum Independent Set in Interval and Geometric Intersection Graphs Andreas Wiese (Universidad de Chile) Independent set is a fundamental [...] resources and setup times. May 15, 2018 Bertrand Simon (ENS de Lyon) Task graph scheduling on modern computing platforms Bertrand Simon (ENS de Lyon) With the increasing complexity of modern computing platforms [...] to small constants for this problem. Our work can be understood as a simplification of invertible Bloom filters. December 07, 2022 Felix Hommelsheim (University of Bremen) Matching Augmentation via Simultaneous
Section: FB3