- Location
-
Deutsche Nationalbibliothek Frankfurt am Main
- Extent
-
1 Online-Ressource.
- Language
-
Englisch
- Bibliographic citation
-
XNLP-Completeness for Parameterized Problems on Graphs with a Linear Structure ; day:4 ; month:11 ; year:2024 ; pages:1-42
Algorithmica ; (4.11.2024), 1-42
- Creator
-
Bodlaender, Hans L.
Groenland, Carla
Jacob, Hugo
Jaffke, Lars
Lima, Paloma T.
- Contributor
-
SpringerLink (Online service)
- DOI
-
10.1007/s00453-024-01274-9
- URN
-
urn:nbn:de:101:1-2501222116162.697084244921
- Rights
-
Open Access; Der Zugriff auf das Objekt ist unbeschränkt möglich.
- Last update
-
15.08.2025, 7:37 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
- Bodlaender, Hans L.
- Groenland, Carla
- Jacob, Hugo
- Jaffke, Lars
- Lima, Paloma T.
- SpringerLink (Online service)
Other Objects (12)
Parameterized Mixed Graph Coloring
Parameterized Complexity of Graph Burning
Graph separators - a parameterized view
Graph algorithms and NP-completeness
Efficient parameterized algorithms on structured graphs
On stochastic completeness of weighted graphs
Linear representability without completeness and transitivity
Parameterized Algorithmics for Graph-Based Data Analysis
Deciding circular-arc graph isomorphism in parameterized logspace
Algorithm design techniques for parameterized graph modification problems
Resolving infeasibility of linear systems: a parameterized approach
Completeness, interconnectedness and distribution of interbank exposures: A parameterized analysis of the stability of financial networks
Parameterized Mixed Graph Coloring
Parameterized Complexity of Graph Burning
Graph separators - a parameterized view
Graph algorithms and NP-completeness
Efficient parameterized algorithms on structured graphs
On stochastic completeness of weighted graphs
Linear representability without completeness and transitivity
Parameterized Algorithmics for Graph-Based Data Analysis
Deciding circular-arc graph isomorphism in parameterized logspace
Algorithm design techniques for parameterized graph modification problems
Resolving infeasibility of linear systems: a parameterized approach
Completeness, interconnectedness and distribution of interbank exposures: A parameterized analysis of the stability of financial networks
Parameterized Mixed Graph Coloring
Parameterized Complexity of Graph Burning
Graph separators - a parameterized view
Graph algorithms and NP-completeness
Efficient parameterized algorithms on structured graphs
On stochastic completeness of weighted graphs
Linear representability without completeness and transitivity
Parameterized Algorithmics for Graph-Based Data Analysis
Deciding circular-arc graph isomorphism in parameterized logspace
Algorithm design techniques for parameterized graph modification problems
Resolving infeasibility of linear systems: a parameterized approach