View in EDS PDF Full Text

Parameterized Complexity of Geometric Problems.

Saved in:
Bibliographic Details
Title: Parameterized Complexity of Geometric Problems.
Authors: Panos Giannopoulos, Christian Knauer, Sue Whitesides
Source: Computer Journal. 2008, Vol. 51 Issue 3, p372-372. 1p.
Subjects: Algorithms, Computers in geometry, Geometric modeling, Graph theory, Combinatorics, Graph labelings, Graphic methods
Abstract: This paper surveys parameterized complexity results for hard geometric algorithmic problems. It includes fixed-parameter tractable problems in graph drawing, geometric graphs, geometric covering and several other areas, together with an overview of the algorithmic techniques used. Fixed-parameter intractability results are surveyed as well. Finally, we give some directions for future research. [ABSTRACT FROM AUTHOR]
Copyright of Computer Journal is the property of Oxford University Press / USA and its content may not be copied or emailed to multiple sites without the copyright holder's express written permission. Additionally, content may not be used with any artificial intelligence tools or machine learning technologies. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.)
Database: Engineering Source
FullText Links:
  – Type: pdflink
Text:
  Availability: 0
Header DbId: egs
DbLabel: Engineering Source
An: 32932915
AccessLevel: 6
PubType: Academic Journal
PubTypeId: academicJournal
PreciseRelevancyScore: 0
IllustrationInfo
Items – Name: Title
  Label: Title
  Group: Ti
  Data: Parameterized Complexity of Geometric Problems.
– Name: Author
  Label: Authors
  Group: Au
  Data: <searchLink fieldCode="AR" term="%22Panos+Giannopoulos%22">Panos Giannopoulos</searchLink><br /><searchLink fieldCode="AR" term="%22Christian+Knauer%22">Christian Knauer</searchLink><br /><searchLink fieldCode="AR" term="%22Sue+Whitesides%22">Sue Whitesides</searchLink>
– Name: TitleSource
  Label: Source
  Group: Src
  Data: <searchLink fieldCode="JN" term="%22Computer+Journal%22">Computer Journal</searchLink>. 2008, Vol. 51 Issue 3, p372-372. 1p.
– Name: Subject
  Label: Subjects
  Group: Su
  Data: <searchLink fieldCode="DE" term="%22Algorithms%22">Algorithms</searchLink><br /><searchLink fieldCode="DE" term="%22Computers+in+geometry%22">Computers in geometry</searchLink><br /><searchLink fieldCode="DE" term="%22Geometric+modeling%22">Geometric modeling</searchLink><br /><searchLink fieldCode="DE" term="%22Graph+theory%22">Graph theory</searchLink><br /><searchLink fieldCode="DE" term="%22Combinatorics%22">Combinatorics</searchLink><br /><searchLink fieldCode="DE" term="%22Graph+labelings%22">Graph labelings</searchLink><br /><searchLink fieldCode="DE" term="%22Graphic+methods%22">Graphic methods</searchLink>
– Name: Abstract
  Label: Abstract
  Group: Ab
  Data: This paper surveys parameterized complexity results for hard geometric algorithmic problems. It includes fixed-parameter tractable problems in graph drawing, geometric graphs, geometric covering and several other areas, together with an overview of the algorithmic techniques used. Fixed-parameter intractability results are surveyed as well. Finally, we give some directions for future research. [ABSTRACT FROM AUTHOR]
– Name: AbstractSuppliedCopyright
  Label:
  Group: Ab
  Data: <i>Copyright of Computer Journal is the property of Oxford University Press / USA and its content may not be copied or emailed to multiple sites without the copyright holder's express written permission. Additionally, content may not be used with any artificial intelligence tools or machine learning technologies. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract.</i> (Copyright applies to all Abstracts.)
PLink https://search.ebscohost.com/login.aspx?direct=true&site=eds-live&db=egs&AN=32932915
RecordInfo BibRecord:
  BibEntity:
    Languages:
      – Code: eng
        Text: English
    PhysicalDescription:
      Pagination:
        PageCount: 1
        StartPage: 372
    Subjects:
      – SubjectFull: Algorithms
        Type: general
      – SubjectFull: Computers in geometry
        Type: general
      – SubjectFull: Geometric modeling
        Type: general
      – SubjectFull: Graph theory
        Type: general
      – SubjectFull: Combinatorics
        Type: general
      – SubjectFull: Graph labelings
        Type: general
      – SubjectFull: Graphic methods
        Type: general
    Titles:
      – TitleFull: Parameterized Complexity of Geometric Problems.
        Type: main
  BibRelationships:
    HasContributorRelationships:
      – PersonEntity:
          Name:
            NameFull: Panos Giannopoulos
      – PersonEntity:
          Name:
            NameFull: Christian Knauer
      – PersonEntity:
          Name:
            NameFull: Sue Whitesides
    IsPartOfRelationships:
      – BibEntity:
          Dates:
            – D: 01
              M: 05
              Text: 2008
              Type: published
              Y: 2008
          Identifiers:
            – Type: issn-print
              Value: 00104620
          Numbering:
            – Type: volume
              Value: 51
            – Type: issue
              Value: 3
          Titles:
            – TitleFull: Computer Journal
              Type: main
ResultId 1