- Standort
-
Deutsche Nationalbibliothek Frankfurt am Main
- Umfang
-
Online-Ressource
- Sprache
-
Englisch
- Anmerkungen
-
In: 17th International Symposium on Parameterized and Exact Computation (IPEC 2022) / Holger Dell; Jesper Nederlof (Hrsg.). - Wadern : Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2022. - (LIPIcs ; 249). - S. 5:1-5:23. - ISBN 978-3-95977-260-0
In: 17th International Symposium on Parameterized and Exact Computation (IPEC 2022), 7. Sep. 2022 - 9. Sep. 2022, Potsdam, Germany
- Ereignis
-
Veröffentlichung
- (wo)
-
Konstanz
- (wer)
-
KOPS Universität Konstanz
- (wann)
-
2022
- Urheber
- URN
-
urn:nbn:de:bsz:352-2-1czowk16g6pp68
- Rechteinformation
-
Der Zugriff auf das Objekt ist unbeschränkt möglich.
- Letzte Aktualisierung
- 15.08.2025, 07:25 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
- Blum, Johannes
- Disser, Yann
- Feldmann, Andreas Emil
- Gupta, Siddharth
- Zych-Pawlewicz, Anna
- KOPS Universität Konstanz
Entstanden
- 2022
Ähnliche Objekte (12)
Multistage Vertex Cover
Multistage vertex cover
Two-distance vertex-distinguishing index of sparse graphs
Computing subset vertex covers in H-free graphs
Distributed CONGEST approximation of weighted vertex covers and matchings
Mixed hitting-time models
Mixed Hitting-Time Models
Hitting the Right Person
Hitting hyperbolic half-space
Sequential Monte Carlo for Counting Vertex Covers in General Graphs
On algorithmic approaches for independent sets, vertex covers, and colourings
Solving Vertex Cover in Polynomial Time on Hyperbolic Random Graphs
Multistage Vertex Cover
Multistage vertex cover
Two-distance vertex-distinguishing index of sparse graphs
Computing subset vertex covers in H-free graphs
Distributed CONGEST approximation of weighted vertex covers and matchings
Mixed hitting-time models
Mixed Hitting-Time Models
Hitting the Right Person
Hitting hyperbolic half-space
Sequential Monte Carlo for Counting Vertex Covers in General Graphs
On algorithmic approaches for independent sets, vertex covers, and colourings
Solving Vertex Cover in Polynomial Time on Hyperbolic Random Graphs
Multistage Vertex Cover
Multistage vertex cover
Two-distance vertex-distinguishing index of sparse graphs
Computing subset vertex covers in H-free graphs
Distributed CONGEST approximation of weighted vertex covers and matchings
Mixed hitting-time models
Mixed Hitting-Time Models
Hitting the Right Person
Hitting hyperbolic half-space
Sequential Monte Carlo for Counting Vertex Covers in General Graphs
On algorithmic approaches for independent sets, vertex covers, and colourings