Funder
H2020 European Research Council
FP7 Ideas: European Research Council
Engineering and Physical Sciences Research Council
Publisher
Springer Science and Business Media LLC
Subject
Applied Mathematics,Computer Science Applications,General Computer Science
Reference29 articles.
1. Agarwal, A., Alon, N., Charikar, M.: Improved approximation for directed cut problems. In: Johnson, D.S., Feige, U. (eds.) Proceedings of the 39th Annual ACM Symposium on Theory of Computing, San Diego, California, USA, June 11–13, 2007, pp. 671–680. ACM (2007)
2. Chekuri, C., Guha, S., Naor, J.: The steiner k-cut problem. SIAM J. Discrete Math. 20(1), 261–271 (2006)
3. Chen, J., Kanj, I.A.: Constrained minimum vertex cover in bipartite graphs: complexity and parameterized algorithms. J. Comput. Syst. Sci. 67(4), 833–847 (2003)
4. Chen, J., Liu, Y., Lu, S., O’Sullivan, B., Razgon, I.: A fixed-parameter algorithm for the directed feedback vertex set problem. J. ACM 55(5), 21:1–21:19 (2008)
5. Chitnis, R., Cygan, M., Hajiaghayi, M., Pilipczuk, M., Pilipczuk, M.: Designing FPT algorithms for cut problems using randomized contractions. SIAM J. Comput. 45(4), 1171–1229 (2016)
Cited by
3 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Flow-augmentation II: Undirected Graphs;ACM Transactions on Algorithms;2024-03-13
2. A survey of parameterized algorithms and the complexity of edge modification;Computer Science Review;2023-05
3. Directed flow-augmentation;Proceedings of the 54th Annual ACM SIGACT Symposium on Theory of Computing;2022-06-09