Skip to main content

and
  1. No Access

    Chapter and Conference Paper

    Generating Faster Algorithms for d-Path Vertex Cover

    Many algorithms which exactly solve hard problems require branching on more or less complex structures in order to do their job. Those who design such algorithms often find themselves doing a meticulous analys...

    Radovan Červený, Ondřej Suchý in Graph-Theoretic Concepts in Computer Science (2023)