View in EDS PDF Full Text

Lower Bounds for the Parameterized Complexity of Minimum Fill-in and Other Completion Problems.

Saved in:
Bibliographic Details
Title: Lower Bounds for the Parameterized Complexity of Minimum Fill-in and Other Completion Problems.
Authors: BLIZNETS, IVAN1, CYGAN, MAREK2, KOMOSA, PAWEŁ3, PILIPCZUK, MICHAŁ1, MACH, LUKÁŠ1
Source: ACM Transactions on Algorithms; Mar2020, Vol. 16 Issue 2, p1-31, 31p
Database: Applied Science & Technology Source
FullText Links:
  – Type: pdflink
Text:
  Availability: 0
Header DbId: aci
DbLabel: Applied Science & Technology Source
An: 142530426
AccessLevel: 2
PubType: Academic Journal
PubTypeId: academicJournal
PreciseRelevancyScore: 0
IllustrationInfo
Items – Name: Title
  Label: Title
  Group: Ti
  Data: Lower Bounds for the Parameterized Complexity of Minimum Fill-in and Other Completion Problems.
– Name: Author
  Label: Authors
  Group: Au
  Data: <searchLink fieldCode="AU" term="%22BLIZNETS%2C+IVAN%22">BLIZNETS, IVAN</searchLink><relatesTo>1</relatesTo><br /><searchLink fieldCode="AU" term="%22CYGAN%2C+MAREK%22">CYGAN, MAREK</searchLink><relatesTo>2</relatesTo><br /><searchLink fieldCode="AU" term="%22KOMOSA%2C+PAWEŁ%22">KOMOSA, PAWEŁ</searchLink><relatesTo>3</relatesTo><br /><searchLink fieldCode="AU" term="%22PILIPCZUK%2C+MICHAŁ%22">PILIPCZUK, MICHAŁ</searchLink><relatesTo>1</relatesTo><br /><searchLink fieldCode="AU" term="%22MACH%2C+LUKÁŠ%22">MACH, LUKÁŠ</searchLink><relatesTo>1</relatesTo>
– Name: TitleSource
  Label: Source
  Group: Src
  Data: <searchLink fieldCode="JN" term="%22ACM+Transactions+on+Algorithms%22">ACM Transactions on Algorithms</searchLink>; Mar2020, Vol. 16 Issue 2, p1-31, 31p
PLink https://search.ebscohost.com/login.aspx?direct=true&site=eds-live&db=aci&AN=142530426
RecordInfo BibRecord:
  BibEntity:
    Identifiers:
      – Type: doi
        Value: 10.1145/3381426
    Languages:
      – Code: eng
        Text: English
    PhysicalDescription:
      Pagination:
        PageCount: 31
        StartPage: 1
    Titles:
      – TitleFull: Lower Bounds for the Parameterized Complexity of Minimum Fill-in and Other Completion Problems.
        Type: main
  BibRelationships:
    HasContributorRelationships:
      – PersonEntity:
          Name:
            NameFull: BLIZNETS, IVAN
      – PersonEntity:
          Name:
            NameFull: CYGAN, MAREK
      – PersonEntity:
          Name:
            NameFull: KOMOSA, PAWEŁ
      – PersonEntity:
          Name:
            NameFull: PILIPCZUK, MICHAŁ
      – PersonEntity:
          Name:
            NameFull: MACH, LUKÁŠ
    IsPartOfRelationships:
      – BibEntity:
          Dates:
            – D: 01
              M: 03
              Text: Mar2020
              Type: published
              Y: 2020
          Identifiers:
            – Type: issn-print
              Value: 15496325
          Numbering:
            – Type: volume
              Value: 16
            – Type: issue
              Value: 2
          Titles:
            – TitleFull: ACM Transactions on Algorithms
              Type: main
ResultId 1