A Aralex Aachen research explorer

Search

From

To

Institution

Field

Type

Topic: Complexity and Algorithms in Graphs ×

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

Papers matching “NP-completeness” in Complexity and Algorithms in Graphs 6

Sort: Relevance Cited Newest Oldest Fwci Patents ⇩ CSV

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

Computational complexity of problems in robust, bilevel and online optimization
2025 RWTH Publications (RWTH Aachen) dissertation Computer Science Complexity and Algorithms in Graphs Open access

0

citations
A note on the complexity of the bilevel bottleneck assignment problem
2021 4OR article Computer Science Complexity and Algorithms in Graphs Open access

Dennis Fischer, Komal Muluk, Gerhard J. Woeginger

2

citations
On the Computational Complexity of the Chain Rule of Differential Calculus
2021 arXiv (Cornell University) preprint Computer Science Complexity and Algorithms in Graphs Open access

Uwe Naumann

1

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
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

6 results