Title | Citations | PageRank | Year |
---|---|---|---|
The Parameterized Complexity of s-Club with Triangle and Seed Constraints. | 0 | 0.34 | 2022 |
Essentially Tight Kernels For (Weakly) Closed Graphs. | 0 | 0.34 | 2021 |
Sorting by Multi-cut Rearrangements. | 0 | 0.34 | 2021 |
Can Local Optimality Be Used for Efficient Data Reduction? | 0 | 0.34 | 2021 |
Preventing Small $\mathbf {(s, t)}$-Cuts by Protecting Edges. | 0 | 0.34 | 2021 |