• Title of article

    On the parameterized complexity of d-dimensional point set pattern matching

  • Author/Authors

    Sergio Cabello، نويسنده , , Panos Giannopoulos، نويسنده , , Christian Knauer، نويسنده ,

  • Issue Information
    دوهفته نامه با شماره پیاپی سال 2007
  • Pages
    5
  • From page
    73
  • To page
    77
  • Keywords
    computational complexity , Fixed parameter tractability , Geometric point set matching , congruence , Computational geometry , Unbounded dimension
  • Journal title
    Information Processing Letters
  • Serial Year
    2007
  • Journal title
    Information Processing Letters
  • Record number

    130534

    • Link To Document
    https://search.isc.ac/dl/search/defaultta.aspx?DTC=10&DC=130534