View in EDS PDF Full Text

Tight Complexity Bounds for Counting Generalized Dominating Sets in Bounded-Treewidth Graphs—Part I: Algorithmic Results.

Saved in:
Bibliographic Details
Title: Tight Complexity Bounds for Counting Generalized Dominating Sets in Bounded-Treewidth Graphs—Part I: Algorithmic Results.
Authors: Focke, Jacob1, jacob.focke@cispa.de, Marx, Dániel1, marx@cispa.de, Mc Inerney, Fionn2, fionn.mc.inerney@tuwien.ac.at, Neuen, Daniel3, dneuen@mpi-inf.mpg.de, Sankar, Govind S.4, govind.subash.sankar@duke.edu, Schepper, Philipp1, philipp.schepper@cispa.de, Wellnitz, Philip5, wellnitz@nii.ac.jp
Source: ACM Transactions on Algorithms; Jul2025, Vol. 21 Issue 3, p1-45, 45p
Database: Applied Science & Technology Source
FullText Links:
  – Type: pdflink
Text:
  Availability: 0
Header DbId: aci
DbLabel: Applied Science & Technology Source
An: 187056275
AccessLevel: 2
PubType: Academic Journal
PubTypeId: academicJournal
PreciseRelevancyScore: 0
IllustrationInfo
Items – Name: Title
  Label: Title
  Group: Ti
  Data: Tight Complexity Bounds for Counting Generalized Dominating Sets in Bounded-Treewidth Graphs—Part I: Algorithmic Results.
– Name: Author
  Label: Authors
  Group: Au
  Data: <searchLink fieldCode="AU" term="%22Focke%2C+Jacob%22">Focke, Jacob</searchLink><relatesTo>1</relatesTo>, <i>jacob.focke@cispa.de</i><br /><searchLink fieldCode="AU" term="%22Marx%2C+Dániel%22">Marx, Dániel</searchLink><relatesTo>1</relatesTo>, <i>marx@cispa.de</i><br /><searchLink fieldCode="AU" term="%22Mc+Inerney%2C+Fionn%22">Mc Inerney, Fionn</searchLink><relatesTo>2</relatesTo>, <i>fionn.mc.inerney@tuwien.ac.at</i><br /><searchLink fieldCode="AU" term="%22Neuen%2C+Daniel%22">Neuen, Daniel</searchLink><relatesTo>3</relatesTo>, <i>dneuen@mpi-inf.mpg.de</i><br /><searchLink fieldCode="AU" term="%22Sankar%2C+Govind+S%2E%22">Sankar, Govind S.</searchLink><relatesTo>4</relatesTo>, <i>govind.subash.sankar@duke.edu</i><br /><searchLink fieldCode="AU" term="%22Schepper%2C+Philipp%22">Schepper, Philipp</searchLink><relatesTo>1</relatesTo>, <i>philipp.schepper@cispa.de</i><br /><searchLink fieldCode="AU" term="%22Wellnitz%2C+Philip%22">Wellnitz, Philip</searchLink><relatesTo>5</relatesTo>, <i>wellnitz@nii.ac.jp</i>
– Name: TitleSource
  Label: Source
  Group: Src
  Data: <searchLink fieldCode="JN" term="%22ACM+Transactions+on+Algorithms%22">ACM Transactions on Algorithms</searchLink>; Jul2025, Vol. 21 Issue 3, p1-45, 45p
PLink https://search.ebscohost.com/login.aspx?direct=true&site=eds-live&db=aci&AN=187056275
RecordInfo BibRecord:
  BibEntity:
    Identifiers:
      – Type: doi
        Value: 10.1145/3731452
    Languages:
      – Code: eng
        Text: English
    PhysicalDescription:
      Pagination:
        PageCount: 45
        StartPage: 1
    Titles:
      – TitleFull: Tight Complexity Bounds for Counting Generalized Dominating Sets in Bounded-Treewidth Graphs—Part I: Algorithmic Results.
        Type: main
  BibRelationships:
    HasContributorRelationships:
      – PersonEntity:
          Name:
            NameFull: Focke, Jacob
      – PersonEntity:
          Name:
            NameFull: Marx, Dániel
      – PersonEntity:
          Name:
            NameFull: Mc Inerney, Fionn
      – PersonEntity:
          Name:
            NameFull: Neuen, Daniel
      – PersonEntity:
          Name:
            NameFull: Sankar, Govind S.
      – PersonEntity:
          Name:
            NameFull: Schepper, Philipp
      – PersonEntity:
          Name:
            NameFull: Wellnitz, Philip
    IsPartOfRelationships:
      – BibEntity:
          Dates:
            – D: 01
              M: 07
              Text: Jul2025
              Type: published
              Y: 2025
          Identifiers:
            – Type: issn-print
              Value: 15496325
          Numbering:
            – Type: volume
              Value: 21
            – Type: issue
              Value: 3
          Titles:
            – TitleFull: ACM Transactions on Algorithms
              Type: main
ResultId 1