Author:
Chitnis Rajesh,Egri László,Marx Dániel
Funder
European Research Council
Országos Tudományos Kutatási Alapprogramok
National Science Foundation
Office of Naval Research
Defense Advanced Research Projects Agency
Publisher
Springer Science and Business Media LLC
Subject
Applied Mathematics,Computer Science Applications,General Computer Science
Reference31 articles.
1. Chen, Y., Grohe, M., Grüber, M.: On parameterized approximability. In: Parameterized and Exact Computation, Second International Workshop, IWPEC 2006, Zürich, Switzerland, 13–15 Sept 2006, Proceedings, pp. 109–120 (2006)
2. Chitnis, R.H., Cygan, M., Hajiaghayi, M.T., Marx, D.: Directed subset feedback vertex set is fixed-parameter tractable. ACM Trans. Algorithms 11(4), 28 (2015)
3. Chitnis, R.H., Hajiaghayi, M., Marx, D.: Fixed-parameter tractability of directed multiway cut parameterized by the size of the cutset. SIAM J. Comput. 42(4), 1674–1696 (2013)
4. Courcelle, B.: Graph rewriting: an algebraic and logic approach. In: van Leeuwen, J. (ed.) Handbook of Theoretical Computer Science: Volume B: Formal Models and Semantics, pp. 193–242. Elsevier, Amsterdam (1990)
5. Cygan, M., Pilipczuk, M., Pilipczuk, M., Wojtaszczyk, J.O.: On multiway cut parameterized above lower bounds. ACM Trans. Comput. Theory 5(1), 3 (2013)
Cited by
12 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Flow-augmentation II: Undirected Graphs;ACM Transactions on Algorithms;2024-03-13
2. On Weighted Graph Separation Problems and Flow Augmentation;SIAM Journal on Discrete Mathematics;2024-01-08
3. Parameterized complexity of multicut in weighted trees;Theoretical Computer Science;2023-11
4. A survey of parameterized algorithms and the complexity of edge modification;Computer Science Review;2023-05
5. Directed flow-augmentation;Proceedings of the 54th Annual ACM SIGACT Symposium on Theory of Computing;2022-06-09