Publisher
Springer Berlin Heidelberg
Reference18 articles.
1. Chen, J., Kanj, I.A., Xia, G.: Simplicity is beauty: Improved upper bounds for vertex cover. Technical Report TR05-008, DePaul University, Chicago, Illinois (2005)
2. Deo, N., Krishnamoorthy, M.S., Langston, M.A.: Exact and approximate solutions for the gate matrix layout problem. IEEE Transactions on Computer Aided Design 6, 79–84 (1987)
3. Downey, R.G., Fellows, M.R.: Parameterized Complexity. Springer (1999)
4. Fellows, M.R., Langston, M.A.: Nonconstructive advances in polynomial-time complexity. Information Processing Letters 26, 157–162 (1987)
5. Fellows, M.R., Langston, M.A.: Nonconstructive tools for proving polynomial-time decidability. Journal of the ACM 35, 727–739 (1988)
Cited by
16 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Index;Network Flow Algorithms;2019-09-05
2. Author Index;Network Flow Algorithms;2019-09-05
3. Open Questions;Network Flow Algorithms;2019-09-05
4. Electrical Flow Algorithms;Network Flow Algorithms;2019-09-05
5. Multicommodity Flow Algorithms;Network Flow Algorithms;2019-09-05