- Location
-
Deutsche Nationalbibliothek Frankfurt am Main
- Extent
-
Online-Ressource
- Language
-
Englisch
- Bibliographic citation
-
In: International Symposium on Parameterized and Exact Computation (IPEC 2022)
- Event
-
Veröffentlichung
- (where)
-
Hamburg
- (who)
-
Universitätsbibliothek der Technischen Universität Hamburg
- (when)
-
2022
- Creator
- DOI
-
10.15480/882.4872
- URN
-
urn:nbn:de:gbv:830-882.0206933
- Rights
-
Der Zugriff auf das Objekt ist unbeschränkt möglich.
- Last update
-
25.03.2025, 1:46 PM CET
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
- Galby, Esther
- Marx, Dániel
- Schepper, Philipp
- Sharma, Roohani
- Tale, Prafullkumar
- Universitätsbibliothek der Technischen Universität Hamburg
Time of origin
- 2022
Other Objects (12)
Domination and cut problems on chordal graphs with bounded leafage
Cut problems on graphs
Domination problems on special graph classes
Multiple domination in graphs
On domination in graphs
Multiple domination in graphs
Approximation algorithms for network design and cut problems in bounded-treewidth
On double domination in graphs
Algorithms for Graph Connectivity and Cut Problems - Connectivity Augmentation, All-Pairs Minimum Cut, and Cut-Based Clustering
Total Roman 3}-domination in Graphs
Embedding spanning bounded degree graphs in randomly perturbed graphs
Restrained double Roman domination of a graph
Domination and cut problems on chordal graphs with bounded leafage
Cut problems on graphs
Domination problems on special graph classes
Multiple domination in graphs
On domination in graphs
Multiple domination in graphs
Approximation algorithms for network design and cut problems in bounded-treewidth
On double domination in graphs
Algorithms for Graph Connectivity and Cut Problems - Connectivity Augmentation, All-Pairs Minimum Cut, and Cut-Based Clustering
Total Roman 3}-domination in Graphs
Embedding spanning bounded degree graphs in randomly perturbed graphs
Restrained double Roman domination of a graph
Domination and cut problems on chordal graphs with bounded leafage
Cut problems on graphs
Domination problems on special graph classes
Multiple domination in graphs
On domination in graphs
Multiple domination in graphs
Approximation algorithms for network design and cut problems in bounded-treewidth
On double domination in graphs
Algorithms for Graph Connectivity and Cut Problems - Connectivity Augmentation, All-Pairs Minimum Cut, and Cut-Based Clustering
Total Roman 3}-domination in Graphs
Embedding spanning bounded degree graphs in randomly perturbed graphs