Anti-factor is FPT Parameterized by Treewidth and List Size (but Counting is Hard)
- Standort
-
Deutsche Nationalbibliothek Frankfurt am Main
- Umfang
-
1 Online-Ressource.
- Sprache
-
Englisch
- Erschienen in
-
Anti-factor is FPT Parameterized by Treewidth and List Size (but Counting is Hard) ; day:15 ; month:10 ; year:2024 ; pages:1-67
Algorithmica ; (15.10.2024), 1-67
- Urheber
- Beteiligte Personen und Organisationen
-
SpringerLink (Online service)
- DOI
-
10.1007/s00453-024-01265-w
- URN
-
urn:nbn:de:101:1-2501022142102.612628310013
- Rechteinformation
-
Open Access; Der Zugriff auf das Objekt ist unbeschränkt möglich.
- Letzte Aktualisierung
-
15.08.2025, 07:34 MESZ
Datenpartner
Dieses Objekt wird bereitgestellt von:
Deutsche Nationalbibliothek. Bei Fragen zum Objekt wenden Sie sich bitte an den Datenpartner.
Deutsche Nationalbibliothek. Bei Fragen zum Objekt wenden Sie sich bitte an den Datenpartner.
Beteiligte
- Marx, Dániel
- Sankar, Govind S.
- Schepper, Philipp
- SpringerLink (Online service)
Ähnliche Objekte (12)
On parameterized counting
Parameterized Counting of Partially Injective Homomorphisms
Hardware is Hard
Counting Problems on Quantum Graphs : Parameterized and Exact Complexity Classifications
The simple, little and slow things count : on parameterized counting complexity
Double hard scattering without double counting
Double hard scattering without double counting
API Design is Hard
On Hard Subgraph Problems: Parameterized Algorithms and Efficient Implementations
Parameterized algorithms of fundamental NP-hard problems: a survey
Why is it so hard?
Automating Resolution is NP-Hard
On parameterized counting
Parameterized Counting of Partially Injective Homomorphisms
Hardware is Hard
Counting Problems on Quantum Graphs : Parameterized and Exact Complexity Classifications
The simple, little and slow things count : on parameterized counting complexity
Double hard scattering without double counting
Double hard scattering without double counting
API Design is Hard
On Hard Subgraph Problems: Parameterized Algorithms and Efficient Implementations
Parameterized algorithms of fundamental NP-hard problems: a survey
Why is it so hard?
Automating Resolution is NP-Hard
On parameterized counting
Parameterized Counting of Partially Injective Homomorphisms
Hardware is Hard
Counting Problems on Quantum Graphs : Parameterized and Exact Complexity Classifications
The simple, little and slow things count : on parameterized counting complexity
Double hard scattering without double counting
Double hard scattering without double counting
API Design is Hard
On Hard Subgraph Problems: Parameterized Algorithms and Efficient Implementations
Parameterized algorithms of fundamental NP-hard problems: a survey
Why is it so hard?