Cited By
View all- Izumi TKitamura NNaruse TSchwartzman GAgrawal KLee I(2022)Fully Polynomial-Time Distributed Computation in Low-Treewidth GraphsProceedings of the 34th ACM Symposium on Parallelism in Algorithms and Architectures10.1145/3490148.3538590(11-22)Online publication date: 11-Jul-2022
- Abboud ACensor-Hillel KKhoury SPaz A(2021)Smaller Cuts, Higher Lower BoundsACM Transactions on Algorithms10.1145/346983417:4(1-40)Online publication date: 4-Oct-2021
- Suomela J(2020)Using Round Elimination to Understand LocalityACM SIGACT News10.1145/3427361.342737451:3(63-81)Online publication date: 29-Sep-2020
- Show More Cited By