From

Institution

Field

Type

Topic: Complexity and Algorithms in Graphs ×

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

Reset

Papers matching “computational complexity” in Complexity and Algorithms in Graphs 41

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
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
Thermodynamic Perspectives on Computational Complexity: Exploring the P vs. NP Problem
2023 SSRN Electronic Journal preprint Computer Science Complexity and Algorithms in Graphs Open access

Florian Neukart

2

citations
Thermodynamic Perspectives on Computational Complexity
2024 SSRN Electronic Journal preprint Computer Science Complexity and Algorithms in Graphs Open access

Florian Neukart

1

citations
A note on the computational complexity of chain rule differentiation
2023 Optimization methods & software article Computer Science Complexity and Algorithms in Graphs

Uwe Naumann

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
Complexity of the Directed Robust b‐Matching Problem and Its Variants on Different Graph Classes
2025 Networks article Computer Science Complexity and Algorithms in Graphs Open access

Jenny Segschneider, Arie M. C. A. Koster

0

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
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
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
The Complexity Classes of Hamming Distance Recoverable Robust Problems
2024 Lecture notes in computer science conference-paper Computer Science Complexity and Algorithms in Graphs

Christoph Grüne

1

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
The Complexity of Homomorphism Reconstruction Revisited
2026 Leibniz international proceedings in informatics book-chapter Computer Science Complexity and Algorithms in Graphs Open access

Timo Gervens, Martin Grohe, Louis Härtel, Philipp Silva da Fonseca

0

citations
Complexity framework for forbidden subgraphs IV: The Steiner Forest problem
2025 Journal of Computer and System Sciences article Computer Science Complexity and Algorithms in Graphs Open access

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

0

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
The Descriptive Complexity of Graph Neural Networks
2024 TheoretiCS article Computer Science Complexity and Algorithms in Graphs Open access

Martin Grohe

3

citations
The Descriptive Complexity of Graph Neural Networks
2023 Proceedings - Symposium on Logic in Computer Science conference-paper Computer Science Complexity and Algorithms in Graphs

Martin Grohe

7

citations
Fine-grained Complexity Analysis of Two Classic TSP Variants
2020 ACM Transactions on Algorithms article Computer Science Complexity and Algorithms in Graphs Open access

Mark de Berg, Kevin Buchin, Bart M. P. Jansen, Gerhard J. Woeginger

17

citations
Special issue on: Computational discrete optimization
2020 EURO Journal on Computational Optimization editorial Computer Science Complexity and Algorithms in Graphs Open access

Arie M. C. A. Koster, Clemens Thielen

0

citations
An Investigation of the Recoverable Robust Assignment Problem
2020 RWTH Publications (RWTH Aachen) conference-paper Computer Science Complexity and Algorithms in Graphs Open access

Dennis Fischer, Tim A. Hartmann, Stefan Lendl, Gerhard J. Woeginger

6

citations
Robust optimization and variants of the scheduling problem
2026 RWTH Publications (RWTH Aachen) dissertation Computer Science Complexity and Algorithms in Graphs Open access

Jenny Segschneider

0

citations
The trouble with the second quantifier
2021 4OR article Computer Science Complexity and Algorithms in Graphs Open access

Gerhard J. Woeginger

27

citations
Recoverable robust optimization with commitment
2026 Mathematical Programming article Computer Science Complexity and Algorithms in Graphs Open access

Komal Muluk, Britta Peis

3

citations
Fault-Tolerant Edge-Disjoint s-t Paths - Beyond Uniform Faults
2022 Leibniz international proceedings in informatics conference-paper Computer Science Complexity and Algorithms in Graphs Open access

David Adjiashvili, Felix Hommelsheim, Moritz Mühlenthaler, Oliver Schaudt

1

citations