Generating Faster Algorithms for d-Path Vertex Cover

Radovan Cervený, Ondrej Suchý. Generating Faster Algorithms for d-Path Vertex Cover. In Daniël Paulusma, Bernard Ries, editors, Graph-Theoretic Concepts in Computer Science - 49th International Workshop, WG 2023, Fribourg, Switzerland, June 28-30, 2023, Revised Selected Papers. Volume 14093 of Lecture Notes in Computer Science, pages 157-171, Springer, 2023. [doi]

@inproceedings{CervenyS23,
  title = {Generating Faster Algorithms for d-Path Vertex Cover},
  author = {Radovan Cervený and Ondrej Suchý},
  year = {2023},
  doi = {10.1007/978-3-031-43380-1_12},
  url = {https://doi.org/10.1007/978-3-031-43380-1_12},
  researchr = {https://researchr.org/publication/CervenyS23},
  cites = {0},
  citedby = {0},
  pages = {157-171},
  booktitle = {Graph-Theoretic Concepts in Computer Science - 49th International Workshop, WG 2023, Fribourg, Switzerland, June 28-30, 2023, Revised Selected Papers},
  editor = {Daniël Paulusma and Bernard Ries},
  volume = {14093},
  series = {Lecture Notes in Computer Science},
  publisher = {Springer},
  isbn = {978-3-031-43380-1},
}