No. | Title | Author | Year |
---|---|---|---|
1 | Searching for Smallest Universal Graphs and Tournaments with SAT | Zhang, Tianwei et al. | 2023 |
2 | Faster Cut-Equivalent Trees in Simple Graphs | Zhang, Tianyi | 2022 |
3 | Vertex Sparsifiers for Hyperedge Connectivity | Jiang, Han et al. | 2022 |
4 | Deterministic Maximum Flows in Simple Graphs | Zhang, Tianyi | 2021 |
5 | A Scaling Algorithm for Weighted f-Factors in General Graphs | Duan, Ran et al. | 2020 |
6 | Reliable Dynamic Packet Scheduling over Lossy Real-Time Wireless Networks | Gong, Tao et al. | 2019 |
7 | An Improved Algorithm for Incremental DFS Tree in Undirected Graphs | Chen, Lijie et al. | 2018 |
Current Page : | |
Number of result pages: | 1 |
Number of documents: | 7 |