- Location
-
Deutsche Nationalbibliothek Frankfurt am Main
- ISSN
-
1433-0490
- Extent
-
Online-Ressource
- Language
-
Englisch
- Notes
-
online resource.
- Bibliographic citation
-
On the Parameterized Complexity of the Expected Coverage Problem ; volume:66 ; number:2 ; day:10 ; month:3 ; year:2022 ; pages:432-453 ; date:4.2022
Theory of computing systems ; 66, Heft 2 (10.3.2022), 432-453, 4.2022
- Creator
-
Fomin, Fedor V.
Ramamoorthi, Vijayaragunathan
- Contributor
-
SpringerLink (Online service)
- DOI
-
10.1007/s00224-022-10073-0
- URN
-
urn:nbn:de:101:1-2022071118591514377392
- Rights
-
Open Access; Der Zugriff auf das Objekt ist unbeschränkt möglich.
- Last update
- 15.08.2025, 7:26 AM CEST
Data provider
This object is provided by:
Deutsche Nationalbibliothek. If you have any questions about the object, please contact the data provider.
Deutsche Nationalbibliothek. If you have any questions about the object, please contact the data provider.
Associated
- Fomin, Fedor V.
- Ramamoorthi, Vijayaragunathan
- SpringerLink (Online service)
Other Objects (12)
Parameterized complexity
Parameterized complexity theory
Parameterized complexity in the polynomial hierarchy : extending parameterized complexity theory to higher levels of the hierarchy
Parameterized Complexity of Diameter
Parameterized Complexity of Diameter
Parameterized Complexity of Graph Burning
On the Parameterized Complexity of Compact Set Packing
Immunization in the Threshold Model: A Parameterized Complexity Study
On the space and circuit complexity of parameterized problems
On the Parameterized Complexity of Bend-Minimum Orthogonal Planarity
An analysis of the parameterized complexity of periodic timetabling
Parameterized complexity of weighted team definability
Parameterized complexity
Parameterized complexity theory
Parameterized complexity in the polynomial hierarchy : extending parameterized complexity theory to higher levels of the hierarchy
Parameterized Complexity of Diameter
Parameterized Complexity of Diameter
Parameterized Complexity of Graph Burning
On the Parameterized Complexity of Compact Set Packing
Immunization in the Threshold Model: A Parameterized Complexity Study
On the space and circuit complexity of parameterized problems
On the Parameterized Complexity of Bend-Minimum Orthogonal Planarity
An analysis of the parameterized complexity of periodic timetabling
Parameterized complexity of weighted team definability
Parameterized complexity
Parameterized complexity theory
Parameterized complexity in the polynomial hierarchy : extending parameterized complexity theory to higher levels of the hierarchy
Parameterized Complexity of Diameter
Parameterized Complexity of Diameter
Parameterized Complexity of Graph Burning
On the Parameterized Complexity of Compact Set Packing
Immunization in the Threshold Model: A Parameterized Complexity Study
On the space and circuit complexity of parameterized problems
On the Parameterized Complexity of Bend-Minimum Orthogonal Planarity
An analysis of the parameterized complexity of periodic timetabling