From

Institution

Field

Type

Open access only Cited by patents (Lens) Include non-Aachen papers (citing/cited)

Reset

Papers matching “set cover” 122

Sort: Relevance Cited Newest Oldest Fwci Patents ⇩ CSV

Not finding it? Sign in to also search OpenAlex live.

On the Impact of Stability and the Helly Property on the Dominating Set Problem
2026 arXiv (Cornell University) preprint Computer Science Advanced Graph Theory Research Open access

Che Cheng, Daniel Mock, Peter Rossmanith

0

citations
Stackelberg Vertex Cover on a Path
2023 RWTH Publications (RWTH Aachen) conference-paper Computer Science Complexity and Algorithms in Graphs Open access

Katharina Eickhoff, Lennart Kauther, Britta Peis

0

citations
Benchmarking Advantage and D-Wave 2000Q quantum annealers with exact cover problems
2022 Quantum Information Processing article Computer Science Quantum Computing Algorithms and Architecture Open access

Dennis Willsch, Madita Willsch, Carlos D. Gonzalez Calaza, Fengping Jin, Hans A. De Raedt, Marika Svensson, +1 more

115

citations
The Solidarity Cover Problem
2023 arXiv (Cornell University) preprint Computer Science Complexity and Algorithms in Graphs Open access

Eran Rosenbluth

0

citations
A Polynomial Kernel for Face Cover on Non-Embedded Planar Graphs
2026 arXiv (Cornell University) preprint Computer Science Advanced Graph Theory Research Open access

Thekla Hamm, Sukanya Pandey, Krisztina Szilágyi

0

citations
A Polynomial Kernel for Face Cover on Non-Embedded Planar Graphs
2026 DROPS (Schloss Dagstuhl – Leibniz Center for Informatics) article Computer Science Advanced Graph Theory Research Open access

Thekla Hamm, Sukanya Pandey, Krisztina Szilágyi

0

citations
Solving Partial Dominating Set and Related Problems Using Twin-Width
2025 RWTH Publications (RWTH Aachen) preprint Computer Science Advanced Graph Theory Research Open access

Jakub Balabán, Daniel Mock, Peter Rossmanith

0

citations
Solving Partial Dominating Set and Related Problems Using Twin-Width
2025 DROPS (Schloss Dagstuhl – Leibniz Center for Informatics) article Computer Science Advanced Graph Theory Research Open access

Jakub Balabán

0

citations
A Polynomial Kernel for Face Cover on Non-Embedded Planar Graphs
2026 arXiv (Cornell University) preprint Computer Science Advanced Graph Theory Research Open access

Thekla Hamm, Sukanya Pandey, Krisztina Szilágyi

0

citations
Reoptimization of parameterized problems
2022 Acta Informatica article Computer Science Advanced Graph Theory Research Open access

Hans-Joachim Böckenhauer, Elisabet Burjons, Martin Raszyk, Peter Rossmanith

9

citations
The complexity of blocking all solutions
2026 Theoretical Computer Science article Computer Science Complexity and Algorithms in Graphs Open access

Christoph Grüne, Lasse Wulf

1

citations
The 2-Attractor Problem is NP-Complete
2023 arXiv (Cornell University) preprint Computer Science Algorithms and Data Compression Open access

Janosch Fuchs

0

citations
Delaying Decisions and Reservation Costs
2023 arXiv (Cornell University) preprint Computer Science Optimization and Search Problems Open access

Elisabet Burjons, Fabian Frei, Matthias Gehnen, Henri Lotze, Daniel Mock, Peter Rossmanith

0

citations
Semi online problems
2026 RWTH Publications (RWTH Aachen) dissertation Computer Science Optimization and Search Problems Open access

Matthias Gehnen

0

citations
Delaying Decisions and Reservation Costs
2023 Lecture notes in computer science conference-paper Computer Science Optimization and Search Problems Open access

Elisabet Burjons, Fabian Frei, Matthias Gehnen, Henri Lotze, Daniel Mock, Peter Rossmanith

1

citations
Snor: Simpler Descriptions Through Overlapping Patterns
2025 Lecture notes in computer science conference-paper Computer Science Data Mining Algorithms and Applications

Matthijs van Leeuwen, Jilles Vreeken

0

citations
On the Group Coverage Centrality Problem: Parameterized Complexity and Heuristics
2023 Society for Industrial and Applied Mathematics eBooks conference-paper Computer Science Advanced Graph Theory Research

Christian Komusiewicz, Jannis Schramek, Frank O. Sommer

1

citations
The Complexity Classes of Hamming Distance Recoverable Robust Problems
2022 arXiv (Cornell University) preprint Computer Science Complexity and Algorithms in Graphs Open access

Christoph Grüne

1

citations
Feature Tracking für raumfüllende Strukturen
2021 RWTH Publications (RWTH Aachen) dissertation Computer Science Computer Graphics and Visualization Techniques Open access

Andrea Schnorr

0

citations
Complexity framework for forbidden subgraphs IV: The Steiner Forest problem
2025 Journal of Computer and System Sciences article Computer Science Advanced Graph Theory Research Open access

Hans L. Bodlaender, Matthew Johnson, Barnaby D. Martin, Jelle J. Oostveen, Sukanya Pandey, Daniël Paulusma, +2 more

0

citations
Semi-supervised time series classification method for quantum computing
2021 Quantum Machine Intelligence article Computer Science Quantum Computing Algorithms and Architecture Open access

Florian Neukart

10

citations
Detecting and approximating decision boundaries in low-dimensional spaces
2023 Numerical Algorithms article Computer Science Computational Geometry and Mesh Generation Open access

Matthias Grajewski, Andreas Kleefeld

2

citations
On the Complexity of Recoverable Robust Optimization in the Polynomial Hierarchy
2024 arXiv (Cornell University) preprint Computer Science Complexity and Algorithms in Graphs Open access

Christoph Grüne, Lasse Wulf

0

citations
On the Complexity of Recoverable Robust Optimization in the Polynomial Hierarchy
2025 DROPS (Schloss Dagstuhl – Leibniz Center for Informatics) article Computer Science Complexity and Algorithms in Graphs Open access

0

citations
Continuous Defensive Domination Problems
2026 arXiv (Cornell University) preprint Computer Science Advanced Graph Theory Research Open access

Christoph Grüne, Tom Janßen

0

citations