From

Institution

Field

Type

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

Reset

Papers matching “NP-completeness” 43

Sort: Relevance Cited Newest Oldest Fwci Patents ⇩ CSV

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

Timeline-based planning over dense temporal domains
2020 Theoretical Computer Science article Computer Science AI-based Problem Solving and Planning Open access

Laura Bozzelli, Alberto Molinari, Angelo Montanari, Adriano Peron, Gerhard J. Woeginger

6

citations
Robust transshipment problem under consistent flow constraints
2023 Networks article Computer Science Complexity and Algorithms in Graphs Open access

Christina Büsing, Arie M. C. A. Koster, Sabrina Schmitz

1

citations
Komplexitätstheorie: Komplex oder Kompliziert?
2022 Studienbücher Informatik book-chapter Computer Science Complexity and Algorithms in Graphs

Bastian Küppers

0

citations
Roman {3} -domination (double Italian domination)
2020 Discrete Applied Mathematics article Computer Science Advanced Graph Theory Research Open access

Doost Ali Mojdeh, Lutz Volkmann

27

citations
On the Burning Number of p-Caterpillars
2020 AIRO Springer series/AIRO Springer Series book-chapter Computer Science Advanced Graph Theory Research

Michaela Hiller, Arie M. C. A. Koster, Eberhard Triesch

21

citations
Conflict-Free Coloring: Graphs of Bounded Clique Width and Intersection Graphs
2021 Lecture notes in computer science conference-paper Computer Science Advanced Graph Theory Research

Sriram Bhyravarapu, Tim A. Hartmann, Subrahmanyam Kalyanasundaram, I. Vinod Reddy

5

citations
Make a Graph Singly Connected by Edge Orientations
2023 Lecture notes in computer science conference-paper Computer Science Advanced Graph Theory Research

Tim A. Hartmann, Komal Muluk

1

citations
Make a Graph Singly Connected by Edge Orientations
2024 SSRN Electronic Journal preprint Computer Science Advanced Graph Theory Research Open access

Tim A. Hartmann, Komal Muluk

0

citations
The Complexity of Online Graph Games
2022 arXiv (Cornell University) preprint Computer Science Advanced Graph Theory Research Open access

Janosch Fuchs, Christoph Grüne, Tom Janßen

0

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 Complexity of Stackelberg Pricing Games
2025 IT University Of Copenhagen (IT University of Copenhagen) preprint Computer Science Complexity and Algorithms in Graphs Open access

Christoph Grüne, Dorothee Henke, Eva Rotenberg, Lasse Wulf

0

citations
Applying aspiration in local search for satisfiability
2020 PLoS ONE article Computer Science Constraint Satisfaction and Optimization Open access

Peng Cong, XU Zhong-wei, Meng Mei

5

citations
Efficient Privacy-Preserving Approximation of the Kidney Exchange Problem
2024 ACM Asia Conference on Computer and Communications Security (ASIA CCS) conference-paper Computer Science Cryptography and Data Security

Malte Breuer, Ulrike Meyer, Susanne Wetzel

2

citations
Efficient Privacy-Preserving Approximation of the Kidney Exchange Problem
2023 arXiv (Cornell University) preprint Computer Science Cryptography and Data Security Open access

Malte Breuer, Ulrike Meyer, Susanne Wetzel

1

citations
Homomorphism Tensors and Linear Equations
2025 Advances in Combinatorics article Computer Science Advanced Graph Theory Research Open access

Martin Grohe, Gaurav Rattan, Tim Seppelt

5

citations
A decomposition-compatible canonization framework for the graph isomorphism problem
2021 RWTH Publications (RWTH Aachen) dissertation Computer Science Graph Theory and Algorithms Open access

Daniel Wiebking

0

citations
Limitations of Affine Integer Relaxations for Solving Constraint Satisfaction Problems
2024 arXiv (Cornell University) preprint Computer Science Advanced Graph Theory Research Open access

Moritz Lichter, Benedikt Pago

2

citations
Limitations of Affine Integer Relaxations for Solving Constraint Satisfaction Problems
2025 DROPS (Schloss Dagstuhl – Leibniz Center for Informatics) article Computer Science Advanced Graph Theory Research Open access

Benedikt Pago

0

citations