A
Menu
January 01, 2023 conference-paper Aachen paper

Advice Complexity Bounds for Online Delayed $$\mathcal{F}$$-Node-, H-Node- and H-Edge-Deletion Problems

Lecture notes in computer science, pp. 62–73

DOI: 10.1007/978-3-031-34347-6_6 OpenAlex

Authors 2

  1. Niklas Berndt Aachen

    RWTH Aachen University

    Affiliation as printed

    RWTH Aachen University, Aachen, Germany

  2. Henri Lotze corresponding Aachen

    RWTH Aachen University

    Affiliation as printed

    RWTH Aachen University, Aachen, Germany

Cited by 3 stored of 3

3 results

No patents citing this paper on Lens.org (checked 2026-10-06).

References 17

17 results