No. | Title | Author | Year |
---|---|---|---|
1 | Improved Distributed Approximations for Maximum Independent Set | Kawarabayashi, Ken-ichi et al. | 2020 |
2 | Optimal Distributed Covering Algorithms | Ben-Basat, Ran et al. | 2019 |
3 | Parameterized Distributed Algorithms | Ben-Basat, Ran et al. | 2019 |
4 | Adapting Local Sequential Algorithms to the Distributed Setting | Kawarabayashi, Ken-ichi et al. | 2018 |
5 | Additive Non-Approximability of Chromatic Number in Proper Minor-Closed Classes | Dvorák, Zdenek et al. | 2018 |
6 | Successor-Invariant First-Order Logic on Graphs with Excluded Topological Subgraphs | Eickmeyer, Kord et al. | 2016 |
7 | Coloring 3-colorable graphs with o(n^{1/5}) colors | Kawarabayashi, Ken-ichi et al. | 2014 |
8 | Edge-disjoint Odd Cycles in 4-edge-connected Graphs | Kawarabayashi, Ken-ichi et al. | 2012 |
9 | Linear min-max relation between the treewidth of H-minor-free graphs and its largest grid | Kawarabayashi, Ken-ichi et al. | 2012 |
Current Page : | |
Number of result pages: | 1 |
Number of documents: | 9 |