Constrained minimum vertex cover in bipartite graphs: complexity and parameterized algorithms

Jianer Chen, Iyad A. Kanj. Constrained minimum vertex cover in bipartite graphs: complexity and parameterized algorithms. J. Comput. Syst. Sci., 67(4):833-847, 2003. [doi]

@article{ChenK03:8,
  title = {Constrained minimum vertex cover in bipartite graphs: complexity and parameterized algorithms},
  author = {Jianer Chen and Iyad A. Kanj},
  year = {2003},
  doi = {10.1016/j.jcss.2003.09.003},
  url = {http://dx.doi.org/10.1016/j.jcss.2003.09.003},
  tags = {graph-rewriting, rewriting},
  researchr = {https://researchr.org/publication/ChenK03%3A8},
  cites = {0},
  citedby = {0},
  journal = {J. Comput. Syst. Sci.},
  volume = {67},
  number = {4},
  pages = {833-847},
}